/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf -i ../../../trunk/examples/svcomp/nla-digbench-scaling/sqrt1-ll_unwindbound5.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-15 17:27:29,987 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-15 17:27:29,993 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-15 17:27:30,014 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-15 17:27:30,015 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-15 17:27:30,015 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-15 17:27:30,018 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-15 17:27:30,019 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-15 17:27:30,020 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-15 17:27:30,021 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-15 17:27:30,021 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-15 17:27:30,022 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-15 17:27:30,022 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-15 17:27:30,023 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-15 17:27:30,023 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-15 17:27:30,024 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-15 17:27:30,025 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-15 17:27:30,025 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-15 17:27:30,026 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-15 17:27:30,028 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-15 17:27:30,029 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-15 17:27:30,034 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-15 17:27:30,035 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-15 17:27:30,037 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-15 17:27:30,039 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-15 17:27:30,043 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-15 17:27:30,043 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-15 17:27:30,044 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-15 17:27:30,044 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-15 17:27:30,044 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-15 17:27:30,045 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-15 17:27:30,045 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-15 17:27:30,045 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-15 17:27:30,046 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-15 17:27:30,046 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-15 17:27:30,047 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-15 17:27:30,047 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-15 17:27:30,048 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-15 17:27:30,048 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-15 17:27:30,048 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-15 17:27:30,049 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-15 17:27:30,049 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-15 17:27:30,050 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-04-15 17:27:30,055 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-15 17:27:30,055 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-15 17:27:30,056 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-15 17:27:30,056 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-15 17:27:30,056 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-15 17:27:30,056 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-15 17:27:30,056 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-15 17:27:30,056 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-15 17:27:30,057 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-15 17:27:30,057 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-15 17:27:30,057 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-15 17:27:30,057 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-15 17:27:30,057 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-15 17:27:30,057 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-15 17:27:30,058 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-15 17:27:30,058 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 17:27:30,058 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-15 17:27:30,058 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-15 17:27:30,058 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-15 17:27:30,058 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-15 17:27:30,058 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-15 17:27:30,059 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-15 17:27:30,059 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-15 17:27:30,200 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-15 17:27:30,230 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-15 17:27:30,232 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-15 17:27:30,233 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-15 17:27:30,234 INFO L275 PluginConnector]: CDTParser initialized [2022-04-15 17:27:30,236 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/sqrt1-ll_unwindbound5.c [2022-04-15 17:27:30,273 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0243cf40f/ac500eb752c14c67a9dc49cf8011dd13/FLAG2252f36d0 [2022-04-15 17:27:30,643 INFO L306 CDTParser]: Found 1 translation units. [2022-04-15 17:27:30,644 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/sqrt1-ll_unwindbound5.c [2022-04-15 17:27:30,649 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0243cf40f/ac500eb752c14c67a9dc49cf8011dd13/FLAG2252f36d0 [2022-04-15 17:27:31,068 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0243cf40f/ac500eb752c14c67a9dc49cf8011dd13 [2022-04-15 17:27:31,070 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-15 17:27:31,071 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-15 17:27:31,073 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-15 17:27:31,078 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-15 17:27:31,084 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-15 17:27:31,086 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 05:27:31" (1/1) ... [2022-04-15 17:27:31,087 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@22c5b8d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:27:31, skipping insertion in model container [2022-04-15 17:27:31,087 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 05:27:31" (1/1) ... [2022-04-15 17:27:31,092 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-15 17:27:31,101 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-15 17:27:31,202 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/sqrt1-ll_unwindbound5.c[520,533] [2022-04-15 17:27:31,212 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 17:27:31,217 INFO L203 MainTranslator]: Completed pre-run [2022-04-15 17:27:31,225 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/sqrt1-ll_unwindbound5.c[520,533] [2022-04-15 17:27:31,233 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 17:27:31,241 INFO L208 MainTranslator]: Completed translation [2022-04-15 17:27:31,241 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:27:31 WrapperNode [2022-04-15 17:27:31,241 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-15 17:27:31,242 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-15 17:27:31,242 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-15 17:27:31,242 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-15 17:27:31,249 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:27:31" (1/1) ... [2022-04-15 17:27:31,249 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:27:31" (1/1) ... [2022-04-15 17:27:31,253 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:27:31" (1/1) ... [2022-04-15 17:27:31,254 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:27:31" (1/1) ... [2022-04-15 17:27:31,266 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:27:31" (1/1) ... [2022-04-15 17:27:31,271 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:27:31" (1/1) ... [2022-04-15 17:27:31,273 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:27:31" (1/1) ... [2022-04-15 17:27:31,277 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-15 17:27:31,277 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-15 17:27:31,277 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-15 17:27:31,277 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-15 17:27:31,279 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:27:31" (1/1) ... [2022-04-15 17:27:31,284 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 17:27:31,289 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 17:27:31,298 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-15 17:27:31,312 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-15 17:27:31,324 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-15 17:27:31,324 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-15 17:27:31,325 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-15 17:27:31,325 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-15 17:27:31,325 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-15 17:27:31,325 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-15 17:27:31,325 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-15 17:27:31,325 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-15 17:27:31,325 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-15 17:27:31,325 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-15 17:27:31,325 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-15 17:27:31,325 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-15 17:27:31,325 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-15 17:27:31,325 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-15 17:27:31,325 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-15 17:27:31,325 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-15 17:27:31,326 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-15 17:27:31,326 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-15 17:27:31,326 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-15 17:27:31,326 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-15 17:27:31,367 INFO L234 CfgBuilder]: Building ICFG [2022-04-15 17:27:31,368 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-15 17:27:31,501 INFO L275 CfgBuilder]: Performing block encoding [2022-04-15 17:27:31,505 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-15 17:27:31,505 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-15 17:27:31,506 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 05:27:31 BoogieIcfgContainer [2022-04-15 17:27:31,506 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-15 17:27:31,507 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-15 17:27:31,507 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-15 17:27:31,517 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-15 17:27:31,518 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.04 05:27:31" (1/3) ... [2022-04-15 17:27:31,518 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c37b5f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 05:27:31, skipping insertion in model container [2022-04-15 17:27:31,518 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:27:31" (2/3) ... [2022-04-15 17:27:31,518 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c37b5f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 05:27:31, skipping insertion in model container [2022-04-15 17:27:31,518 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 05:27:31" (3/3) ... [2022-04-15 17:27:31,519 INFO L111 eAbstractionObserver]: Analyzing ICFG sqrt1-ll_unwindbound5.c [2022-04-15 17:27:31,522 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-15 17:27:31,522 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-15 17:27:31,564 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-15 17:27:31,568 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-15 17:27:31,568 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-15 17:27:31,578 INFO L276 IsEmpty]: Start isEmpty. Operand has 26 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 14 states have internal predecessors, (18), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-15 17:27:31,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-15 17:27:31,583 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 17:27:31,583 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 17:27:31,584 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 17:27:31,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 17:27:31,602 INFO L85 PathProgramCache]: Analyzing trace with hash -643130361, now seen corresponding path program 1 times [2022-04-15 17:27:31,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 17:27:31,607 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1189785162] [2022-04-15 17:27:31,614 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 17:27:31,615 INFO L85 PathProgramCache]: Analyzing trace with hash -643130361, now seen corresponding path program 2 times [2022-04-15 17:27:31,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 17:27:31,617 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1372372152] [2022-04-15 17:27:31,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 17:27:31,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 17:27:31,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:27:31,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 17:27:31,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:27:31,805 INFO L290 TraceCheckUtils]: 0: Hoare triple {34#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {29#true} is VALID [2022-04-15 17:27:31,805 INFO L290 TraceCheckUtils]: 1: Hoare triple {29#true} assume true; {29#true} is VALID [2022-04-15 17:27:31,805 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {29#true} {29#true} #66#return; {29#true} is VALID [2022-04-15 17:27:31,807 INFO L272 TraceCheckUtils]: 0: Hoare triple {29#true} call ULTIMATE.init(); {34#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 17:27:31,807 INFO L290 TraceCheckUtils]: 1: Hoare triple {34#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {29#true} is VALID [2022-04-15 17:27:31,807 INFO L290 TraceCheckUtils]: 2: Hoare triple {29#true} assume true; {29#true} is VALID [2022-04-15 17:27:31,807 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29#true} {29#true} #66#return; {29#true} is VALID [2022-04-15 17:27:31,807 INFO L272 TraceCheckUtils]: 4: Hoare triple {29#true} call #t~ret6 := main(); {29#true} is VALID [2022-04-15 17:27:31,807 INFO L290 TraceCheckUtils]: 5: Hoare triple {29#true} havoc ~n~0;havoc ~a~0;havoc ~s~0;havoc ~t~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4;~a~0 := 0;~s~0 := 1;~t~0 := 1; {29#true} is VALID [2022-04-15 17:27:31,808 INFO L290 TraceCheckUtils]: 6: Hoare triple {29#true} assume !true; {30#false} is VALID [2022-04-15 17:27:31,808 INFO L272 TraceCheckUtils]: 7: Hoare triple {30#false} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {30#false} is VALID [2022-04-15 17:27:31,808 INFO L290 TraceCheckUtils]: 8: Hoare triple {30#false} ~cond := #in~cond; {30#false} is VALID [2022-04-15 17:27:31,808 INFO L290 TraceCheckUtils]: 9: Hoare triple {30#false} assume 0 == ~cond; {30#false} is VALID [2022-04-15 17:27:31,809 INFO L290 TraceCheckUtils]: 10: Hoare triple {30#false} assume !false; {30#false} is VALID [2022-04-15 17:27:31,809 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 17:27:31,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 17:27:31,810 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1372372152] [2022-04-15 17:27:31,811 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1372372152] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 17:27:31,811 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 17:27:31,811 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 17:27:31,815 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 17:27:31,816 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1189785162] [2022-04-15 17:27:31,816 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1189785162] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 17:27:31,816 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 17:27:31,817 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 17:27:31,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [843118123] [2022-04-15 17:27:31,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 17:27:31,822 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-15 17:27:31,823 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 17:27:31,825 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:27:31,840 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 17:27:31,840 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-15 17:27:31,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 17:27:31,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-15 17:27:31,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-15 17:27:31,862 INFO L87 Difference]: Start difference. First operand has 26 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 14 states have internal predecessors, (18), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:27:32,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:27:32,002 INFO L93 Difference]: Finished difference Result 47 states and 70 transitions. [2022-04-15 17:27:32,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-15 17:27:32,002 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-15 17:27:32,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 17:27:32,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:27:32,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 70 transitions. [2022-04-15 17:27:32,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:27:32,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 70 transitions. [2022-04-15 17:27:32,021 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 70 transitions. [2022-04-15 17:27:32,093 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 17:27:32,100 INFO L225 Difference]: With dead ends: 47 [2022-04-15 17:27:32,100 INFO L226 Difference]: Without dead ends: 22 [2022-04-15 17:27:32,102 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-15 17:27:32,105 INFO L913 BasicCegarLoop]: 31 mSDtfsCounter, 6 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 17:27:32,107 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 35 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 17:27:32,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2022-04-15 17:27:32,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2022-04-15 17:27:32,130 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 17:27:32,130 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states. Second operand has 21 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 8 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-15 17:27:32,131 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand has 21 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 8 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-15 17:27:32,131 INFO L87 Difference]: Start difference. First operand 22 states. Second operand has 21 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 8 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-15 17:27:32,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:27:32,135 INFO L93 Difference]: Finished difference Result 22 states and 28 transitions. [2022-04-15 17:27:32,136 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 28 transitions. [2022-04-15 17:27:32,136 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 17:27:32,136 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 17:27:32,136 INFO L74 IsIncluded]: Start isIncluded. First operand has 21 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 8 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 22 states. [2022-04-15 17:27:32,157 INFO L87 Difference]: Start difference. First operand has 21 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 8 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 22 states. [2022-04-15 17:27:32,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:27:32,164 INFO L93 Difference]: Finished difference Result 22 states and 28 transitions. [2022-04-15 17:27:32,164 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 28 transitions. [2022-04-15 17:27:32,165 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 17:27:32,165 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 17:27:32,165 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 17:27:32,165 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 17:27:32,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 8 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-15 17:27:32,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 27 transitions. [2022-04-15 17:27:32,170 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 27 transitions. Word has length 11 [2022-04-15 17:27:32,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 17:27:32,170 INFO L478 AbstractCegarLoop]: Abstraction has 21 states and 27 transitions. [2022-04-15 17:27:32,171 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:27:32,171 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 21 states and 27 transitions. [2022-04-15 17:27:32,196 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 17:27:32,197 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 27 transitions. [2022-04-15 17:27:32,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-15 17:27:32,199 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 17:27:32,200 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 17:27:32,203 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-15 17:27:32,203 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 17:27:32,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 17:27:32,204 INFO L85 PathProgramCache]: Analyzing trace with hash 1070997212, now seen corresponding path program 1 times [2022-04-15 17:27:32,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 17:27:32,204 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [481599400] [2022-04-15 17:27:32,206 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 17:27:32,206 INFO L85 PathProgramCache]: Analyzing trace with hash 1070997212, now seen corresponding path program 2 times [2022-04-15 17:27:32,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 17:27:32,206 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2022040196] [2022-04-15 17:27:32,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 17:27:32,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 17:27:32,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:27:32,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 17:27:32,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:27:32,308 INFO L290 TraceCheckUtils]: 0: Hoare triple {224#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {222#(= ~counter~0 0)} is VALID [2022-04-15 17:27:32,309 INFO L290 TraceCheckUtils]: 1: Hoare triple {222#(= ~counter~0 0)} assume true; {222#(= ~counter~0 0)} is VALID [2022-04-15 17:27:32,309 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {222#(= ~counter~0 0)} {217#true} #66#return; {222#(= ~counter~0 0)} is VALID [2022-04-15 17:27:32,310 INFO L272 TraceCheckUtils]: 0: Hoare triple {217#true} call ULTIMATE.init(); {224#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 17:27:32,310 INFO L290 TraceCheckUtils]: 1: Hoare triple {224#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {222#(= ~counter~0 0)} is VALID [2022-04-15 17:27:32,311 INFO L290 TraceCheckUtils]: 2: Hoare triple {222#(= ~counter~0 0)} assume true; {222#(= ~counter~0 0)} is VALID [2022-04-15 17:27:32,311 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {222#(= ~counter~0 0)} {217#true} #66#return; {222#(= ~counter~0 0)} is VALID [2022-04-15 17:27:32,312 INFO L272 TraceCheckUtils]: 4: Hoare triple {222#(= ~counter~0 0)} call #t~ret6 := main(); {222#(= ~counter~0 0)} is VALID [2022-04-15 17:27:32,312 INFO L290 TraceCheckUtils]: 5: Hoare triple {222#(= ~counter~0 0)} havoc ~n~0;havoc ~a~0;havoc ~s~0;havoc ~t~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4;~a~0 := 0;~s~0 := 1;~t~0 := 1; {222#(= ~counter~0 0)} is VALID [2022-04-15 17:27:32,312 INFO L290 TraceCheckUtils]: 6: Hoare triple {222#(= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {223#(= |main_#t~post5| 0)} is VALID [2022-04-15 17:27:32,313 INFO L290 TraceCheckUtils]: 7: Hoare triple {223#(= |main_#t~post5| 0)} assume !(#t~post5 < 5);havoc #t~post5; {218#false} is VALID [2022-04-15 17:27:32,313 INFO L272 TraceCheckUtils]: 8: Hoare triple {218#false} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {218#false} is VALID [2022-04-15 17:27:32,313 INFO L290 TraceCheckUtils]: 9: Hoare triple {218#false} ~cond := #in~cond; {218#false} is VALID [2022-04-15 17:27:32,313 INFO L290 TraceCheckUtils]: 10: Hoare triple {218#false} assume 0 == ~cond; {218#false} is VALID [2022-04-15 17:27:32,313 INFO L290 TraceCheckUtils]: 11: Hoare triple {218#false} assume !false; {218#false} is VALID [2022-04-15 17:27:32,314 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 17:27:32,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 17:27:32,314 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2022040196] [2022-04-15 17:27:32,314 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2022040196] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 17:27:32,314 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 17:27:32,314 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 17:27:32,315 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 17:27:32,315 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [481599400] [2022-04-15 17:27:32,315 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [481599400] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 17:27:32,315 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 17:27:32,315 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 17:27:32,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2051942594] [2022-04-15 17:27:32,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 17:27:32,316 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-15 17:27:32,316 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 17:27:32,316 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:27:32,325 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 17:27:32,325 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 17:27:32,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 17:27:32,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 17:27:32,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 17:27:32,326 INFO L87 Difference]: Start difference. First operand 21 states and 27 transitions. Second operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:27:32,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:27:32,455 INFO L93 Difference]: Finished difference Result 32 states and 40 transitions. [2022-04-15 17:27:32,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-15 17:27:32,455 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-15 17:27:32,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 17:27:32,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:27:32,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 40 transitions. [2022-04-15 17:27:32,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:27:32,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 40 transitions. [2022-04-15 17:27:32,458 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 40 transitions. [2022-04-15 17:27:32,497 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 17:27:32,498 INFO L225 Difference]: With dead ends: 32 [2022-04-15 17:27:32,498 INFO L226 Difference]: Without dead ends: 23 [2022-04-15 17:27:32,499 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 17:27:32,499 INFO L913 BasicCegarLoop]: 25 mSDtfsCounter, 6 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 17:27:32,500 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 49 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 17:27:32,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-04-15 17:27:32,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2022-04-15 17:27:32,503 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 17:27:32,504 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states. Second operand has 23 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 8 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-15 17:27:32,504 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand has 23 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 8 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-15 17:27:32,504 INFO L87 Difference]: Start difference. First operand 23 states. Second operand has 23 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 8 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-15 17:27:32,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:27:32,505 INFO L93 Difference]: Finished difference Result 23 states and 29 transitions. [2022-04-15 17:27:32,505 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 29 transitions. [2022-04-15 17:27:32,506 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 17:27:32,506 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 17:27:32,506 INFO L74 IsIncluded]: Start isIncluded. First operand has 23 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 8 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 23 states. [2022-04-15 17:27:32,506 INFO L87 Difference]: Start difference. First operand has 23 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 8 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 23 states. [2022-04-15 17:27:32,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:27:32,508 INFO L93 Difference]: Finished difference Result 23 states and 29 transitions. [2022-04-15 17:27:32,508 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 29 transitions. [2022-04-15 17:27:32,508 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 17:27:32,508 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 17:27:32,508 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 17:27:32,508 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 17:27:32,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 8 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-15 17:27:32,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 29 transitions. [2022-04-15 17:27:32,510 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 29 transitions. Word has length 12 [2022-04-15 17:27:32,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 17:27:32,510 INFO L478 AbstractCegarLoop]: Abstraction has 23 states and 29 transitions. [2022-04-15 17:27:32,510 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:27:32,510 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 23 states and 29 transitions. [2022-04-15 17:27:32,538 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 17:27:32,538 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 29 transitions. [2022-04-15 17:27:32,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-15 17:27:32,539 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 17:27:32,539 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 17:27:32,539 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-15 17:27:32,539 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 17:27:32,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 17:27:32,540 INFO L85 PathProgramCache]: Analyzing trace with hash 1072665508, now seen corresponding path program 1 times [2022-04-15 17:27:32,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 17:27:32,540 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [91364774] [2022-04-15 17:27:32,540 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 17:27:32,540 INFO L85 PathProgramCache]: Analyzing trace with hash 1072665508, now seen corresponding path program 2 times [2022-04-15 17:27:32,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 17:27:32,540 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1388295184] [2022-04-15 17:27:32,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 17:27:32,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 17:27:32,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:27:32,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 17:27:32,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:27:32,614 INFO L290 TraceCheckUtils]: 0: Hoare triple {393#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {385#true} is VALID [2022-04-15 17:27:32,615 INFO L290 TraceCheckUtils]: 1: Hoare triple {385#true} assume true; {385#true} is VALID [2022-04-15 17:27:32,615 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {385#true} {385#true} #66#return; {385#true} is VALID [2022-04-15 17:27:32,615 INFO L272 TraceCheckUtils]: 0: Hoare triple {385#true} call ULTIMATE.init(); {393#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 17:27:32,615 INFO L290 TraceCheckUtils]: 1: Hoare triple {393#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {385#true} is VALID [2022-04-15 17:27:32,616 INFO L290 TraceCheckUtils]: 2: Hoare triple {385#true} assume true; {385#true} is VALID [2022-04-15 17:27:32,616 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {385#true} {385#true} #66#return; {385#true} is VALID [2022-04-15 17:27:32,616 INFO L272 TraceCheckUtils]: 4: Hoare triple {385#true} call #t~ret6 := main(); {385#true} is VALID [2022-04-15 17:27:32,616 INFO L290 TraceCheckUtils]: 5: Hoare triple {385#true} havoc ~n~0;havoc ~a~0;havoc ~s~0;havoc ~t~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4;~a~0 := 0;~s~0 := 1;~t~0 := 1; {390#(and (= (* main_~a~0 2) 0) (= main_~t~0 (+ (* main_~a~0 2) 1)))} is VALID [2022-04-15 17:27:32,617 INFO L290 TraceCheckUtils]: 6: Hoare triple {390#(and (= (* main_~a~0 2) 0) (= main_~t~0 (+ (* main_~a~0 2) 1)))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {390#(and (= (* main_~a~0 2) 0) (= main_~t~0 (+ (* main_~a~0 2) 1)))} is VALID [2022-04-15 17:27:32,620 INFO L290 TraceCheckUtils]: 7: Hoare triple {390#(and (= (* main_~a~0 2) 0) (= main_~t~0 (+ (* main_~a~0 2) 1)))} assume !!(#t~post5 < 5);havoc #t~post5; {390#(and (= (* main_~a~0 2) 0) (= main_~t~0 (+ (* main_~a~0 2) 1)))} is VALID [2022-04-15 17:27:32,622 INFO L272 TraceCheckUtils]: 8: Hoare triple {390#(and (= (* main_~a~0 2) 0) (= main_~t~0 (+ (* main_~a~0 2) 1)))} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {391#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 17:27:32,622 INFO L290 TraceCheckUtils]: 9: Hoare triple {391#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {392#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 17:27:32,622 INFO L290 TraceCheckUtils]: 10: Hoare triple {392#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {386#false} is VALID [2022-04-15 17:27:32,622 INFO L290 TraceCheckUtils]: 11: Hoare triple {386#false} assume !false; {386#false} is VALID [2022-04-15 17:27:32,623 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 17:27:32,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 17:27:32,623 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1388295184] [2022-04-15 17:27:32,623 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1388295184] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 17:27:32,624 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 17:27:32,624 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 17:27:32,624 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 17:27:32,624 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [91364774] [2022-04-15 17:27:32,624 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [91364774] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 17:27:32,624 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 17:27:32,624 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 17:27:32,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [756405450] [2022-04-15 17:27:32,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 17:27:32,624 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-15 17:27:32,625 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 17:27:32,625 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:27:32,633 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 17:27:32,633 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 17:27:32,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 17:27:32,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 17:27:32,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-15 17:27:32,634 INFO L87 Difference]: Start difference. First operand 23 states and 29 transitions. Second operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:27:32,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:27:32,868 INFO L93 Difference]: Finished difference Result 36 states and 47 transitions. [2022-04-15 17:27:32,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-15 17:27:32,868 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-15 17:27:32,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 17:27:32,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:27:32,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 47 transitions. [2022-04-15 17:27:32,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:27:32,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 47 transitions. [2022-04-15 17:27:32,870 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 47 transitions. [2022-04-15 17:27:32,908 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 17:27:32,909 INFO L225 Difference]: With dead ends: 36 [2022-04-15 17:27:32,909 INFO L226 Difference]: Without dead ends: 34 [2022-04-15 17:27:32,909 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-04-15 17:27:32,910 INFO L913 BasicCegarLoop]: 26 mSDtfsCounter, 16 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 17:27:32,910 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [21 Valid, 53 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 17:27:32,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-04-15 17:27:32,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 32. [2022-04-15 17:27:32,915 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 17:27:32,915 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand has 32 states, 16 states have (on average 1.25) internal successors, (20), 18 states have internal predecessors, (20), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-15 17:27:32,915 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand has 32 states, 16 states have (on average 1.25) internal successors, (20), 18 states have internal predecessors, (20), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-15 17:27:32,915 INFO L87 Difference]: Start difference. First operand 34 states. Second operand has 32 states, 16 states have (on average 1.25) internal successors, (20), 18 states have internal predecessors, (20), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-15 17:27:32,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:27:32,917 INFO L93 Difference]: Finished difference Result 34 states and 45 transitions. [2022-04-15 17:27:32,917 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 45 transitions. [2022-04-15 17:27:32,917 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 17:27:32,917 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 17:27:32,918 INFO L74 IsIncluded]: Start isIncluded. First operand has 32 states, 16 states have (on average 1.25) internal successors, (20), 18 states have internal predecessors, (20), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) Second operand 34 states. [2022-04-15 17:27:32,918 INFO L87 Difference]: Start difference. First operand has 32 states, 16 states have (on average 1.25) internal successors, (20), 18 states have internal predecessors, (20), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) Second operand 34 states. [2022-04-15 17:27:32,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:27:32,927 INFO L93 Difference]: Finished difference Result 34 states and 45 transitions. [2022-04-15 17:27:32,927 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 45 transitions. [2022-04-15 17:27:32,928 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 17:27:32,928 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 17:27:32,928 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 17:27:32,928 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 17:27:32,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 16 states have (on average 1.25) internal successors, (20), 18 states have internal predecessors, (20), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-15 17:27:32,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 42 transitions. [2022-04-15 17:27:32,931 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 42 transitions. Word has length 12 [2022-04-15 17:27:32,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 17:27:32,931 INFO L478 AbstractCegarLoop]: Abstraction has 32 states and 42 transitions. [2022-04-15 17:27:32,931 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:27:32,931 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 32 states and 42 transitions. [2022-04-15 17:27:32,967 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 17:27:32,967 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 42 transitions. [2022-04-15 17:27:32,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-15 17:27:32,967 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 17:27:32,968 INFO L499 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 17:27:32,968 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-15 17:27:32,968 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 17:27:32,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 17:27:32,968 INFO L85 PathProgramCache]: Analyzing trace with hash 1640566567, now seen corresponding path program 1 times [2022-04-15 17:27:32,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 17:27:32,968 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [179072911] [2022-04-15 17:27:32,969 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 17:27:32,969 INFO L85 PathProgramCache]: Analyzing trace with hash 1640566567, now seen corresponding path program 2 times [2022-04-15 17:27:32,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 17:27:32,969 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [843747554] [2022-04-15 17:27:32,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 17:27:32,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 17:27:32,978 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 17:27:32,979 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1305179482] [2022-04-15 17:27:32,979 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 17:27:32,979 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 17:27:32,979 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 17:27:32,980 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 17:27:32,981 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-15 17:27:33,011 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 17:27:33,011 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 17:27:33,013 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-15 17:27:33,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:27:33,021 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 17:27:33,115 INFO L272 TraceCheckUtils]: 0: Hoare triple {608#true} call ULTIMATE.init(); {608#true} is VALID [2022-04-15 17:27:33,115 INFO L290 TraceCheckUtils]: 1: Hoare triple {608#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {608#true} is VALID [2022-04-15 17:27:33,115 INFO L290 TraceCheckUtils]: 2: Hoare triple {608#true} assume true; {608#true} is VALID [2022-04-15 17:27:33,115 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {608#true} {608#true} #66#return; {608#true} is VALID [2022-04-15 17:27:33,115 INFO L272 TraceCheckUtils]: 4: Hoare triple {608#true} call #t~ret6 := main(); {608#true} is VALID [2022-04-15 17:27:33,116 INFO L290 TraceCheckUtils]: 5: Hoare triple {608#true} havoc ~n~0;havoc ~a~0;havoc ~s~0;havoc ~t~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4;~a~0 := 0;~s~0 := 1;~t~0 := 1; {628#(and (= main_~a~0 0) (= main_~s~0 1))} is VALID [2022-04-15 17:27:33,116 INFO L290 TraceCheckUtils]: 6: Hoare triple {628#(and (= main_~a~0 0) (= main_~s~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {628#(and (= main_~a~0 0) (= main_~s~0 1))} is VALID [2022-04-15 17:27:33,117 INFO L290 TraceCheckUtils]: 7: Hoare triple {628#(and (= main_~a~0 0) (= main_~s~0 1))} assume !!(#t~post5 < 5);havoc #t~post5; {628#(and (= main_~a~0 0) (= main_~s~0 1))} is VALID [2022-04-15 17:27:33,117 INFO L272 TraceCheckUtils]: 8: Hoare triple {628#(and (= main_~a~0 0) (= main_~s~0 1))} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {608#true} is VALID [2022-04-15 17:27:33,117 INFO L290 TraceCheckUtils]: 9: Hoare triple {608#true} ~cond := #in~cond; {608#true} is VALID [2022-04-15 17:27:33,117 INFO L290 TraceCheckUtils]: 10: Hoare triple {608#true} assume !(0 == ~cond); {608#true} is VALID [2022-04-15 17:27:33,117 INFO L290 TraceCheckUtils]: 11: Hoare triple {608#true} assume true; {608#true} is VALID [2022-04-15 17:27:33,118 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {608#true} {628#(and (= main_~a~0 0) (= main_~s~0 1))} #54#return; {628#(and (= main_~a~0 0) (= main_~s~0 1))} is VALID [2022-04-15 17:27:33,119 INFO L272 TraceCheckUtils]: 13: Hoare triple {628#(and (= main_~a~0 0) (= main_~s~0 1))} call __VERIFIER_assert((if ~s~0 == (1 + ~a~0) * (1 + ~a~0) then 1 else 0)); {653#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 17:27:33,119 INFO L290 TraceCheckUtils]: 14: Hoare triple {653#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {657#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 17:27:33,119 INFO L290 TraceCheckUtils]: 15: Hoare triple {657#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {609#false} is VALID [2022-04-15 17:27:33,120 INFO L290 TraceCheckUtils]: 16: Hoare triple {609#false} assume !false; {609#false} is VALID [2022-04-15 17:27:33,120 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 17:27:33,120 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 17:27:33,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 17:27:33,120 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [843747554] [2022-04-15 17:27:33,120 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 17:27:33,120 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1305179482] [2022-04-15 17:27:33,120 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1305179482] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 17:27:33,120 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 17:27:33,120 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 17:27:33,121 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 17:27:33,121 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [179072911] [2022-04-15 17:27:33,121 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [179072911] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 17:27:33,121 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 17:27:33,121 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 17:27:33,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [32200082] [2022-04-15 17:27:33,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 17:27:33,121 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 17 [2022-04-15 17:27:33,122 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 17:27:33,122 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 17:27:33,134 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 17:27:33,134 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 17:27:33,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 17:27:33,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 17:27:33,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 17:27:33,135 INFO L87 Difference]: Start difference. First operand 32 states and 42 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 17:27:33,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:27:33,256 INFO L93 Difference]: Finished difference Result 40 states and 50 transitions. [2022-04-15 17:27:33,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 17:27:33,257 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 17 [2022-04-15 17:27:33,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 17:27:33,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 17:27:33,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 47 transitions. [2022-04-15 17:27:33,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 17:27:33,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 47 transitions. [2022-04-15 17:27:33,259 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 47 transitions. [2022-04-15 17:27:33,287 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 17:27:33,289 INFO L225 Difference]: With dead ends: 40 [2022-04-15 17:27:33,289 INFO L226 Difference]: Without dead ends: 38 [2022-04-15 17:27:33,290 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 17:27:33,292 INFO L913 BasicCegarLoop]: 29 mSDtfsCounter, 6 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 17:27:33,292 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 88 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 17:27:33,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-04-15 17:27:33,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 37. [2022-04-15 17:27:33,322 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 17:27:33,322 INFO L82 GeneralOperation]: Start isEquivalent. First operand 38 states. Second operand has 37 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 21 states have internal predecessors, (23), 13 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-15 17:27:33,322 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand has 37 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 21 states have internal predecessors, (23), 13 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-15 17:27:33,323 INFO L87 Difference]: Start difference. First operand 38 states. Second operand has 37 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 21 states have internal predecessors, (23), 13 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-15 17:27:33,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:27:33,324 INFO L93 Difference]: Finished difference Result 38 states and 48 transitions. [2022-04-15 17:27:33,324 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 48 transitions. [2022-04-15 17:27:33,324 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 17:27:33,324 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 17:27:33,325 INFO L74 IsIncluded]: Start isIncluded. First operand has 37 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 21 states have internal predecessors, (23), 13 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) Second operand 38 states. [2022-04-15 17:27:33,325 INFO L87 Difference]: Start difference. First operand has 37 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 21 states have internal predecessors, (23), 13 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) Second operand 38 states. [2022-04-15 17:27:33,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:27:33,326 INFO L93 Difference]: Finished difference Result 38 states and 48 transitions. [2022-04-15 17:27:33,326 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 48 transitions. [2022-04-15 17:27:33,327 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 17:27:33,327 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 17:27:33,327 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 17:27:33,327 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 17:27:33,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 21 states have internal predecessors, (23), 13 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-15 17:27:33,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 47 transitions. [2022-04-15 17:27:33,328 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 47 transitions. Word has length 17 [2022-04-15 17:27:33,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 17:27:33,328 INFO L478 AbstractCegarLoop]: Abstraction has 37 states and 47 transitions. [2022-04-15 17:27:33,329 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 17:27:33,329 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 37 states and 47 transitions. [2022-04-15 17:27:33,363 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 17:27:33,363 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 47 transitions. [2022-04-15 17:27:33,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-15 17:27:33,366 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 17:27:33,366 INFO L499 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 17:27:33,384 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-15 17:27:33,582 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 17:27:33,582 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 17:27:33,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 17:27:33,583 INFO L85 PathProgramCache]: Analyzing trace with hash 1129080132, now seen corresponding path program 1 times [2022-04-15 17:27:33,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 17:27:33,583 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [397370791] [2022-04-15 17:27:33,583 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 17:27:33,583 INFO L85 PathProgramCache]: Analyzing trace with hash 1129080132, now seen corresponding path program 2 times [2022-04-15 17:27:33,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 17:27:33,583 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1845496653] [2022-04-15 17:27:33,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 17:27:33,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 17:27:33,592 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 17:27:33,592 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1022698727] [2022-04-15 17:27:33,592 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 17:27:33,592 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 17:27:33,592 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 17:27:33,601 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 17:27:33,602 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-15 17:27:33,638 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 17:27:33,639 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 17:27:33,639 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-15 17:27:33,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:27:33,644 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 17:27:33,748 INFO L272 TraceCheckUtils]: 0: Hoare triple {895#true} call ULTIMATE.init(); {895#true} is VALID [2022-04-15 17:27:33,748 INFO L290 TraceCheckUtils]: 1: Hoare triple {895#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {895#true} is VALID [2022-04-15 17:27:33,748 INFO L290 TraceCheckUtils]: 2: Hoare triple {895#true} assume true; {895#true} is VALID [2022-04-15 17:27:33,748 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {895#true} {895#true} #66#return; {895#true} is VALID [2022-04-15 17:27:33,749 INFO L272 TraceCheckUtils]: 4: Hoare triple {895#true} call #t~ret6 := main(); {895#true} is VALID [2022-04-15 17:27:33,749 INFO L290 TraceCheckUtils]: 5: Hoare triple {895#true} havoc ~n~0;havoc ~a~0;havoc ~s~0;havoc ~t~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4;~a~0 := 0;~s~0 := 1;~t~0 := 1; {915#(and (= main_~t~0 1) (= main_~s~0 1))} is VALID [2022-04-15 17:27:33,750 INFO L290 TraceCheckUtils]: 6: Hoare triple {915#(and (= main_~t~0 1) (= main_~s~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {915#(and (= main_~t~0 1) (= main_~s~0 1))} is VALID [2022-04-15 17:27:33,750 INFO L290 TraceCheckUtils]: 7: Hoare triple {915#(and (= main_~t~0 1) (= main_~s~0 1))} assume !!(#t~post5 < 5);havoc #t~post5; {915#(and (= main_~t~0 1) (= main_~s~0 1))} is VALID [2022-04-15 17:27:33,750 INFO L272 TraceCheckUtils]: 8: Hoare triple {915#(and (= main_~t~0 1) (= main_~s~0 1))} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {895#true} is VALID [2022-04-15 17:27:33,750 INFO L290 TraceCheckUtils]: 9: Hoare triple {895#true} ~cond := #in~cond; {895#true} is VALID [2022-04-15 17:27:33,750 INFO L290 TraceCheckUtils]: 10: Hoare triple {895#true} assume !(0 == ~cond); {895#true} is VALID [2022-04-15 17:27:33,750 INFO L290 TraceCheckUtils]: 11: Hoare triple {895#true} assume true; {895#true} is VALID [2022-04-15 17:27:33,751 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {895#true} {915#(and (= main_~t~0 1) (= main_~s~0 1))} #54#return; {915#(and (= main_~t~0 1) (= main_~s~0 1))} is VALID [2022-04-15 17:27:33,751 INFO L272 TraceCheckUtils]: 13: Hoare triple {915#(and (= main_~t~0 1) (= main_~s~0 1))} call __VERIFIER_assert((if ~s~0 == (1 + ~a~0) * (1 + ~a~0) then 1 else 0)); {895#true} is VALID [2022-04-15 17:27:33,751 INFO L290 TraceCheckUtils]: 14: Hoare triple {895#true} ~cond := #in~cond; {895#true} is VALID [2022-04-15 17:27:33,751 INFO L290 TraceCheckUtils]: 15: Hoare triple {895#true} assume !(0 == ~cond); {895#true} is VALID [2022-04-15 17:27:33,751 INFO L290 TraceCheckUtils]: 16: Hoare triple {895#true} assume true; {895#true} is VALID [2022-04-15 17:27:33,754 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {895#true} {915#(and (= main_~t~0 1) (= main_~s~0 1))} #56#return; {915#(and (= main_~t~0 1) (= main_~s~0 1))} is VALID [2022-04-15 17:27:33,755 INFO L272 TraceCheckUtils]: 18: Hoare triple {915#(and (= main_~t~0 1) (= main_~s~0 1))} call __VERIFIER_assert((if 0 == 1 + (~t~0 * ~t~0 - 4 * ~s~0 + 2 * ~t~0) then 1 else 0)); {955#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 17:27:33,755 INFO L290 TraceCheckUtils]: 19: Hoare triple {955#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {959#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 17:27:33,755 INFO L290 TraceCheckUtils]: 20: Hoare triple {959#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {896#false} is VALID [2022-04-15 17:27:33,756 INFO L290 TraceCheckUtils]: 21: Hoare triple {896#false} assume !false; {896#false} is VALID [2022-04-15 17:27:33,756 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-15 17:27:33,756 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 17:27:33,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 17:27:33,756 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1845496653] [2022-04-15 17:27:33,756 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 17:27:33,756 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1022698727] [2022-04-15 17:27:33,756 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1022698727] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 17:27:33,756 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 17:27:33,756 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 17:27:33,756 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 17:27:33,757 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [397370791] [2022-04-15 17:27:33,757 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [397370791] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 17:27:33,757 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 17:27:33,757 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 17:27:33,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [402637423] [2022-04-15 17:27:33,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 17:27:33,757 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 22 [2022-04-15 17:27:33,757 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 17:27:33,757 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-15 17:27:33,769 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 17:27:33,770 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 17:27:33,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 17:27:33,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 17:27:33,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 17:27:33,771 INFO L87 Difference]: Start difference. First operand 37 states and 47 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-15 17:27:33,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:27:33,900 INFO L93 Difference]: Finished difference Result 44 states and 53 transitions. [2022-04-15 17:27:33,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 17:27:33,901 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 22 [2022-04-15 17:27:33,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 17:27:33,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-15 17:27:33,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 47 transitions. [2022-04-15 17:27:33,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-15 17:27:33,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 47 transitions. [2022-04-15 17:27:33,902 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 47 transitions. [2022-04-15 17:27:33,939 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 17:27:33,941 INFO L225 Difference]: With dead ends: 44 [2022-04-15 17:27:33,941 INFO L226 Difference]: Without dead ends: 39 [2022-04-15 17:27:33,942 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 17:27:33,944 INFO L913 BasicCegarLoop]: 32 mSDtfsCounter, 6 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 17:27:33,945 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 95 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 17:27:33,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-04-15 17:27:33,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2022-04-15 17:27:33,959 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 17:27:33,960 INFO L82 GeneralOperation]: Start isEquivalent. First operand 39 states. Second operand has 39 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 11 states have call successors, (11), 6 states have call predecessors, (11), 5 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-15 17:27:33,961 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand has 39 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 11 states have call successors, (11), 6 states have call predecessors, (11), 5 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-15 17:27:33,961 INFO L87 Difference]: Start difference. First operand 39 states. Second operand has 39 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 11 states have call successors, (11), 6 states have call predecessors, (11), 5 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-15 17:27:33,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:27:33,964 INFO L93 Difference]: Finished difference Result 39 states and 45 transitions. [2022-04-15 17:27:33,964 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 45 transitions. [2022-04-15 17:27:33,964 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 17:27:33,964 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 17:27:33,964 INFO L74 IsIncluded]: Start isIncluded. First operand has 39 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 11 states have call successors, (11), 6 states have call predecessors, (11), 5 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand 39 states. [2022-04-15 17:27:33,965 INFO L87 Difference]: Start difference. First operand has 39 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 11 states have call successors, (11), 6 states have call predecessors, (11), 5 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand 39 states. [2022-04-15 17:27:33,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:27:33,968 INFO L93 Difference]: Finished difference Result 39 states and 45 transitions. [2022-04-15 17:27:33,968 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 45 transitions. [2022-04-15 17:27:33,968 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 17:27:33,968 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 17:27:33,968 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 17:27:33,968 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 17:27:33,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 11 states have call successors, (11), 6 states have call predecessors, (11), 5 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-15 17:27:33,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 45 transitions. [2022-04-15 17:27:33,970 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 45 transitions. Word has length 22 [2022-04-15 17:27:33,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 17:27:33,970 INFO L478 AbstractCegarLoop]: Abstraction has 39 states and 45 transitions. [2022-04-15 17:27:33,970 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-15 17:27:33,970 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 39 states and 45 transitions. [2022-04-15 17:27:34,003 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 17:27:34,003 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 45 transitions. [2022-04-15 17:27:34,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-15 17:27:34,004 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 17:27:34,004 INFO L499 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 17:27:34,022 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-15 17:27:34,218 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 17:27:34,219 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 17:27:34,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 17:27:34,219 INFO L85 PathProgramCache]: Analyzing trace with hash -1326533350, now seen corresponding path program 1 times [2022-04-15 17:27:34,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 17:27:34,219 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1866138094]