/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/loop-simple/nested_3.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-15 13:14:32,404 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-15 13:14:32,405 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-15 13:14:32,444 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-15 13:14:32,445 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-15 13:14:32,446 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-15 13:14:32,448 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-15 13:14:32,454 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-15 13:14:32,455 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-15 13:14:32,456 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-15 13:14:32,456 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-15 13:14:32,457 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-15 13:14:32,457 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-15 13:14:32,458 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-15 13:14:32,459 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-15 13:14:32,460 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-15 13:14:32,460 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-15 13:14:32,461 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-15 13:14:32,462 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-15 13:14:32,470 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-15 13:14:32,476 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-15 13:14:32,477 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-15 13:14:32,478 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-15 13:14:32,479 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-15 13:14:32,479 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-15 13:14:32,481 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-15 13:14:32,481 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-15 13:14:32,487 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-15 13:14:32,488 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-15 13:14:32,488 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-15 13:14:32,489 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-15 13:14:32,489 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-15 13:14:32,490 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-15 13:14:32,490 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-15 13:14:32,491 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-15 13:14:32,491 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-15 13:14:32,492 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-15 13:14:32,492 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-15 13:14:32,492 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-15 13:14:32,493 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-15 13:14:32,493 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-15 13:14:32,494 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-15 13:14:32,494 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 13:14:32,502 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-15 13:14:32,502 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-15 13:14:32,503 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-15 13:14:32,503 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-15 13:14:32,504 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-15 13:14:32,504 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-15 13:14:32,504 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-15 13:14:32,504 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-15 13:14:32,504 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-15 13:14:32,505 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-15 13:14:32,505 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-15 13:14:32,505 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-15 13:14:32,505 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-15 13:14:32,505 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-15 13:14:32,506 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-15 13:14:32,506 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 13:14:32,506 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-15 13:14:32,506 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-15 13:14:32,506 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-15 13:14:32,507 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-15 13:14:32,507 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-15 13:14:32,507 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-15 13:14:32,507 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 13:14:32,681 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-15 13:14:32,703 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-15 13:14:32,705 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-15 13:14:32,706 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-15 13:14:32,707 INFO L275 PluginConnector]: CDTParser initialized [2022-04-15 13:14:32,708 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-simple/nested_3.c [2022-04-15 13:14:32,762 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/47cd137f9/eb0215d83bbe445e834b0f9f079d29fb/FLAG223335791 [2022-04-15 13:14:33,108 INFO L306 CDTParser]: Found 1 translation units. [2022-04-15 13:14:33,108 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-simple/nested_3.c [2022-04-15 13:14:33,112 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/47cd137f9/eb0215d83bbe445e834b0f9f079d29fb/FLAG223335791 [2022-04-15 13:14:33,122 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/47cd137f9/eb0215d83bbe445e834b0f9f079d29fb [2022-04-15 13:14:33,124 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-15 13:14:33,125 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-15 13:14:33,126 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-15 13:14:33,126 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-15 13:14:33,130 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-15 13:14:33,131 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 01:14:33" (1/1) ... [2022-04-15 13:14:33,133 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@25d6c80 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:14:33, skipping insertion in model container [2022-04-15 13:14:33,133 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 01:14:33" (1/1) ... [2022-04-15 13:14:33,138 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-15 13:14:33,148 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-15 13:14:33,336 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-simple/nested_3.c[784,797] [2022-04-15 13:14:33,340 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 13:14:33,355 INFO L203 MainTranslator]: Completed pre-run [2022-04-15 13:14:33,368 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-simple/nested_3.c[784,797] [2022-04-15 13:14:33,369 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 13:14:33,379 INFO L208 MainTranslator]: Completed translation [2022-04-15 13:14:33,381 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:14:33 WrapperNode [2022-04-15 13:14:33,381 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-15 13:14:33,382 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-15 13:14:33,382 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-15 13:14:33,382 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-15 13:14:33,391 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:14:33" (1/1) ... [2022-04-15 13:14:33,391 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:14:33" (1/1) ... [2022-04-15 13:14:33,395 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:14:33" (1/1) ... [2022-04-15 13:14:33,395 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:14:33" (1/1) ... [2022-04-15 13:14:33,400 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:14:33" (1/1) ... [2022-04-15 13:14:33,403 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:14:33" (1/1) ... [2022-04-15 13:14:33,411 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:14:33" (1/1) ... [2022-04-15 13:14:33,415 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-15 13:14:33,416 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-15 13:14:33,416 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-15 13:14:33,416 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-15 13:14:33,417 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:14:33" (1/1) ... [2022-04-15 13:14:33,422 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 13:14:33,429 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 13:14:33,444 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 13:14:33,459 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 13:14:33,480 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-15 13:14:33,480 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-15 13:14:33,481 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-15 13:14:33,481 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-15 13:14:33,481 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-15 13:14:33,481 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-15 13:14:33,481 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-15 13:14:33,481 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-15 13:14:33,482 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-15 13:14:33,482 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-15 13:14:33,482 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-15 13:14:33,482 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-15 13:14:33,483 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-15 13:14:33,483 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-15 13:14:33,533 INFO L234 CfgBuilder]: Building ICFG [2022-04-15 13:14:33,534 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-15 13:14:33,626 INFO L275 CfgBuilder]: Performing block encoding [2022-04-15 13:14:33,632 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-15 13:14:33,633 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-04-15 13:14:33,634 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 01:14:33 BoogieIcfgContainer [2022-04-15 13:14:33,634 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-15 13:14:33,636 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-15 13:14:33,636 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-15 13:14:33,638 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-15 13:14:33,639 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.04 01:14:33" (1/3) ... [2022-04-15 13:14:33,639 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61de4587 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 01:14:33, skipping insertion in model container [2022-04-15 13:14:33,639 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:14:33" (2/3) ... [2022-04-15 13:14:33,640 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61de4587 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 01:14:33, skipping insertion in model container [2022-04-15 13:14:33,640 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 01:14:33" (3/3) ... [2022-04-15 13:14:33,641 INFO L111 eAbstractionObserver]: Analyzing ICFG nested_3.c [2022-04-15 13:14:33,645 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-15 13:14:33,645 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-15 13:14:33,679 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-15 13:14:33,684 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 13:14:33,684 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-15 13:14:33,699 INFO L276 IsEmpty]: Start isEmpty. Operand has 20 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 15 states have internal predecessors, (22), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 13:14:33,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-04-15 13:14:33,704 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:14:33,705 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 13:14:33,705 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:14:33,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:14:33,709 INFO L85 PathProgramCache]: Analyzing trace with hash -1607939523, now seen corresponding path program 1 times [2022-04-15 13:14:33,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:14:33,715 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1307018661] [2022-04-15 13:14:33,724 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 13:14:33,725 INFO L85 PathProgramCache]: Analyzing trace with hash -1607939523, now seen corresponding path program 2 times [2022-04-15 13:14:33,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:14:33,728 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [499052417] [2022-04-15 13:14:33,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:14:33,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:14:33,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:14:33,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 13:14:33,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:14:33,915 INFO L290 TraceCheckUtils]: 0: Hoare triple {28#(and (= |#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); {23#true} is VALID [2022-04-15 13:14:33,915 INFO L290 TraceCheckUtils]: 1: Hoare triple {23#true} assume true; {23#true} is VALID [2022-04-15 13:14:33,916 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {23#true} {23#true} #56#return; {23#true} is VALID [2022-04-15 13:14:33,922 INFO L272 TraceCheckUtils]: 0: Hoare triple {23#true} call ULTIMATE.init(); {28#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 13:14:33,922 INFO L290 TraceCheckUtils]: 1: Hoare triple {28#(and (= |#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); {23#true} is VALID [2022-04-15 13:14:33,922 INFO L290 TraceCheckUtils]: 2: Hoare triple {23#true} assume true; {23#true} is VALID [2022-04-15 13:14:33,923 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23#true} {23#true} #56#return; {23#true} is VALID [2022-04-15 13:14:33,923 INFO L272 TraceCheckUtils]: 4: Hoare triple {23#true} call #t~ret7 := main(); {23#true} is VALID [2022-04-15 13:14:33,923 INFO L290 TraceCheckUtils]: 5: Hoare triple {23#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~a~0 := 0; {23#true} is VALID [2022-04-15 13:14:33,924 INFO L290 TraceCheckUtils]: 6: Hoare triple {23#true} assume !true; {24#false} is VALID [2022-04-15 13:14:33,925 INFO L290 TraceCheckUtils]: 7: Hoare triple {24#false} assume !((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0); {24#false} is VALID [2022-04-15 13:14:33,925 INFO L290 TraceCheckUtils]: 8: Hoare triple {24#false} assume !false; {24#false} is VALID [2022-04-15 13:14:33,926 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 13:14:33,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:14:33,927 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [499052417] [2022-04-15 13:14:33,928 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [499052417] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:14:33,928 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:14:33,928 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 13:14:33,930 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:14:33,932 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1307018661] [2022-04-15 13:14:33,932 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1307018661] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:14:33,933 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:14:33,933 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 13:14:33,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1995236893] [2022-04-15 13:14:33,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:14:33,938 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 9 [2022-04-15 13:14:33,940 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:14:33,942 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:14:33,962 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 9 edges. 9 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:14:33,962 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-15 13:14:33,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:14:33,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-15 13:14:33,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-15 13:14:33,989 INFO L87 Difference]: Start difference. First operand has 20 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 15 states have internal predecessors, (22), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:14:34,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:14:34,065 INFO L93 Difference]: Finished difference Result 34 states and 46 transitions. [2022-04-15 13:14:34,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-15 13:14:34,065 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 9 [2022-04-15 13:14:34,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:14:34,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:14:34,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 46 transitions. [2022-04-15 13:14:34,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:14:34,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 46 transitions. [2022-04-15 13:14:34,079 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 46 transitions. [2022-04-15 13:14:34,157 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:14:34,163 INFO L225 Difference]: With dead ends: 34 [2022-04-15 13:14:34,163 INFO L226 Difference]: Without dead ends: 15 [2022-04-15 13:14:34,166 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 13:14:34,169 INFO L913 BasicCegarLoop]: 22 mSDtfsCounter, 15 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 13:14:34,169 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 25 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 13:14:34,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2022-04-15 13:14:34,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2022-04-15 13:14:34,190 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:14:34,191 INFO L82 GeneralOperation]: Start isEquivalent. First operand 15 states. Second operand has 15 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 states have internal predecessors, (14), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:14:34,191 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand has 15 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 states have internal predecessors, (14), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:14:34,191 INFO L87 Difference]: Start difference. First operand 15 states. Second operand has 15 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 states have internal predecessors, (14), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:14:34,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:14:34,194 INFO L93 Difference]: Finished difference Result 15 states and 17 transitions. [2022-04-15 13:14:34,194 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 17 transitions. [2022-04-15 13:14:34,194 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:14:34,194 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:14:34,195 INFO L74 IsIncluded]: Start isIncluded. First operand has 15 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 states have internal predecessors, (14), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 15 states. [2022-04-15 13:14:34,195 INFO L87 Difference]: Start difference. First operand has 15 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 states have internal predecessors, (14), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 15 states. [2022-04-15 13:14:34,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:14:34,197 INFO L93 Difference]: Finished difference Result 15 states and 17 transitions. [2022-04-15 13:14:34,197 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 17 transitions. [2022-04-15 13:14:34,197 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:14:34,198 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:14:34,198 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:14:34,198 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:14:34,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 states have internal predecessors, (14), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:14:34,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 17 transitions. [2022-04-15 13:14:34,200 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 17 transitions. Word has length 9 [2022-04-15 13:14:34,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:14:34,201 INFO L478 AbstractCegarLoop]: Abstraction has 15 states and 17 transitions. [2022-04-15 13:14:34,201 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:14:34,201 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 17 transitions. [2022-04-15 13:14:34,219 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 13:14:34,219 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 17 transitions. [2022-04-15 13:14:34,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-04-15 13:14:34,220 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:14:34,220 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 13:14:34,220 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-15 13:14:34,221 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:14:34,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:14:34,222 INFO L85 PathProgramCache]: Analyzing trace with hash -1607968353, now seen corresponding path program 1 times [2022-04-15 13:14:34,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:14:34,222 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1825819976] [2022-04-15 13:14:34,223 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 13:14:34,223 INFO L85 PathProgramCache]: Analyzing trace with hash -1607968353, now seen corresponding path program 2 times [2022-04-15 13:14:34,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:14:34,223 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [710261629] [2022-04-15 13:14:34,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:14:34,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:14:34,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:14:34,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 13:14:34,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:14:34,277 INFO L290 TraceCheckUtils]: 0: Hoare triple {165#(and (= |#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); {159#true} is VALID [2022-04-15 13:14:34,277 INFO L290 TraceCheckUtils]: 1: Hoare triple {159#true} assume true; {159#true} is VALID [2022-04-15 13:14:34,277 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {159#true} {159#true} #56#return; {159#true} is VALID [2022-04-15 13:14:34,278 INFO L272 TraceCheckUtils]: 0: Hoare triple {159#true} call ULTIMATE.init(); {165#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 13:14:34,278 INFO L290 TraceCheckUtils]: 1: Hoare triple {165#(and (= |#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); {159#true} is VALID [2022-04-15 13:14:34,278 INFO L290 TraceCheckUtils]: 2: Hoare triple {159#true} assume true; {159#true} is VALID [2022-04-15 13:14:34,298 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {159#true} {159#true} #56#return; {159#true} is VALID [2022-04-15 13:14:34,298 INFO L272 TraceCheckUtils]: 4: Hoare triple {159#true} call #t~ret7 := main(); {159#true} is VALID [2022-04-15 13:14:34,299 INFO L290 TraceCheckUtils]: 5: Hoare triple {159#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~a~0 := 0; {164#(= main_~a~0 0)} is VALID [2022-04-15 13:14:34,299 INFO L290 TraceCheckUtils]: 6: Hoare triple {164#(= main_~a~0 0)} assume !(~a~0 < 6); {160#false} is VALID [2022-04-15 13:14:34,299 INFO L290 TraceCheckUtils]: 7: Hoare triple {160#false} assume !((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0); {160#false} is VALID [2022-04-15 13:14:34,300 INFO L290 TraceCheckUtils]: 8: Hoare triple {160#false} assume !false; {160#false} is VALID [2022-04-15 13:14:34,300 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 13:14:34,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:14:34,300 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [710261629] [2022-04-15 13:14:34,301 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [710261629] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:14:34,301 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:14:34,301 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 13:14:34,301 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:14:34,301 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1825819976] [2022-04-15 13:14:34,302 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1825819976] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:14:34,302 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:14:34,302 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 13:14:34,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2012519963] [2022-04-15 13:14:34,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:14:34,303 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 9 [2022-04-15 13:14:34,303 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:14:34,303 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:14:34,312 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 9 edges. 9 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:14:34,312 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 13:14:34,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:14:34,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 13:14:34,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 13:14:34,314 INFO L87 Difference]: Start difference. First operand 15 states and 17 transitions. Second operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:14:34,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:14:34,370 INFO L93 Difference]: Finished difference Result 24 states and 28 transitions. [2022-04-15 13:14:34,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 13:14:34,371 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 9 [2022-04-15 13:14:34,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:14:34,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:14:34,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 28 transitions. [2022-04-15 13:14:34,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:14:34,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 28 transitions. [2022-04-15 13:14:34,374 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 28 transitions. [2022-04-15 13:14:34,401 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:14:34,402 INFO L225 Difference]: With dead ends: 24 [2022-04-15 13:14:34,403 INFO L226 Difference]: Without dead ends: 21 [2022-04-15 13:14:34,403 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-15 13:14:34,404 INFO L913 BasicCegarLoop]: 15 mSDtfsCounter, 26 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 13:14:34,405 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [26 Valid, 22 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 13:14:34,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2022-04-15 13:14:34,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 16. [2022-04-15 13:14:34,409 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:14:34,409 INFO L82 GeneralOperation]: Start isEquivalent. First operand 21 states. Second operand has 16 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:14:34,410 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand has 16 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:14:34,410 INFO L87 Difference]: Start difference. First operand 21 states. Second operand has 16 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:14:34,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:14:34,412 INFO L93 Difference]: Finished difference Result 21 states and 25 transitions. [2022-04-15 13:14:34,412 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2022-04-15 13:14:34,412 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:14:34,412 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:14:34,412 INFO L74 IsIncluded]: Start isIncluded. First operand has 16 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 21 states. [2022-04-15 13:14:34,413 INFO L87 Difference]: Start difference. First operand has 16 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 21 states. [2022-04-15 13:14:34,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:14:34,414 INFO L93 Difference]: Finished difference Result 21 states and 25 transitions. [2022-04-15 13:14:34,414 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2022-04-15 13:14:34,415 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:14:34,415 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:14:34,415 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:14:34,415 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:14:34,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:14:34,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 18 transitions. [2022-04-15 13:14:34,416 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 18 transitions. Word has length 9 [2022-04-15 13:14:34,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:14:34,417 INFO L478 AbstractCegarLoop]: Abstraction has 16 states and 18 transitions. [2022-04-15 13:14:34,417 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:14:34,417 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 18 transitions. [2022-04-15 13:14:34,435 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:14:34,435 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 18 transitions. [2022-04-15 13:14:34,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-15 13:14:34,436 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:14:34,436 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 13:14:34,437 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-15 13:14:34,437 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:14:34,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:14:34,439 INFO L85 PathProgramCache]: Analyzing trace with hash -1181899718, now seen corresponding path program 1 times [2022-04-15 13:14:34,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:14:34,442 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1778852414] [2022-04-15 13:14:34,545 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 13:14:34,547 INFO L85 PathProgramCache]: Analyzing trace with hash 1694000335, now seen corresponding path program 1 times [2022-04-15 13:14:34,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:14:34,548 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2029361010] [2022-04-15 13:14:34,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:14:34,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:14:34,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 13:14:34,564 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 13:14:34,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 13:14:34,583 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 13:14:34,584 INFO L85 PathProgramCache]: Analyzing trace with hash -1181899718, now seen corresponding path program 2 times [2022-04-15 13:14:34,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:14:34,584 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2116649795] [2022-04-15 13:14:34,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:14:34,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:14:34,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:14:34,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 13:14:34,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:14:34,633 INFO L290 TraceCheckUtils]: 0: Hoare triple {298#(and (= |#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); {292#true} is VALID [2022-04-15 13:14:34,634 INFO L290 TraceCheckUtils]: 1: Hoare triple {292#true} assume true; {292#true} is VALID [2022-04-15 13:14:34,634 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {292#true} {292#true} #56#return; {292#true} is VALID [2022-04-15 13:14:34,635 INFO L272 TraceCheckUtils]: 0: Hoare triple {292#true} call ULTIMATE.init(); {298#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 13:14:34,635 INFO L290 TraceCheckUtils]: 1: Hoare triple {298#(and (= |#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); {292#true} is VALID [2022-04-15 13:14:34,635 INFO L290 TraceCheckUtils]: 2: Hoare triple {292#true} assume true; {292#true} is VALID [2022-04-15 13:14:34,635 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {292#true} {292#true} #56#return; {292#true} is VALID [2022-04-15 13:14:34,635 INFO L272 TraceCheckUtils]: 4: Hoare triple {292#true} call #t~ret7 := main(); {292#true} is VALID [2022-04-15 13:14:34,636 INFO L290 TraceCheckUtils]: 5: Hoare triple {292#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~a~0 := 0; {292#true} is VALID [2022-04-15 13:14:34,636 INFO L290 TraceCheckUtils]: 6: Hoare triple {292#true} assume !!(~a~0 < 6);~b~0 := 0; {297#(= main_~b~0 0)} is VALID [2022-04-15 13:14:34,637 INFO L290 TraceCheckUtils]: 7: Hoare triple {297#(= main_~b~0 0)} assume !(~b~0 < 6); {293#false} is VALID [2022-04-15 13:14:34,637 INFO L290 TraceCheckUtils]: 8: Hoare triple {293#false} #t~pre4 := 1 + ~a~0;~a~0 := 1 + ~a~0;havoc #t~pre4; {293#false} is VALID [2022-04-15 13:14:34,638 INFO L290 TraceCheckUtils]: 9: Hoare triple {293#false} assume !(~a~0 < 6); {293#false} is VALID [2022-04-15 13:14:34,641 INFO L290 TraceCheckUtils]: 10: Hoare triple {293#false} assume !((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0); {293#false} is VALID [2022-04-15 13:14:34,641 INFO L290 TraceCheckUtils]: 11: Hoare triple {293#false} assume !false; {293#false} is VALID [2022-04-15 13:14:34,641 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:14:34,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:14:34,642 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2116649795] [2022-04-15 13:14:34,642 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2116649795] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:14:34,642 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:14:34,642 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 13:14:34,642 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:14:34,642 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1778852414] [2022-04-15 13:14:34,642 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1778852414] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:14:34,643 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:14:34,643 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 13:14:34,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1684123789] [2022-04-15 13:14:34,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:14:34,643 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (2), 2 states have call predecessors, (2), 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 13:14:34,644 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:14:34,644 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:14:34,654 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 13:14:34,654 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 13:14:34,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:14:34,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 13:14:34,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 13:14:34,655 INFO L87 Difference]: Start difference. First operand 16 states and 18 transitions. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:14:34,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:14:34,705 INFO L93 Difference]: Finished difference Result 29 states and 35 transitions. [2022-04-15 13:14:34,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 13:14:34,705 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (2), 2 states have call predecessors, (2), 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 13:14:34,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:14:34,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:14:34,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 34 transitions. [2022-04-15 13:14:34,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:14:34,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 34 transitions. [2022-04-15 13:14:34,708 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 34 transitions. [2022-04-15 13:14:34,737 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:14:34,738 INFO L225 Difference]: With dead ends: 29 [2022-04-15 13:14:34,738 INFO L226 Difference]: Without dead ends: 20 [2022-04-15 13:14:34,738 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-15 13:14:34,741 INFO L913 BasicCegarLoop]: 15 mSDtfsCounter, 20 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 13:14:34,748 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [20 Valid, 22 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 13:14:34,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2022-04-15 13:14:34,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 17. [2022-04-15 13:14:34,752 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:14:34,752 INFO L82 GeneralOperation]: Start isEquivalent. First operand 20 states. Second operand has 17 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 states have internal predecessors, (16), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:14:34,752 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand has 17 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 states have internal predecessors, (16), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:14:34,752 INFO L87 Difference]: Start difference. First operand 20 states. Second operand has 17 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 states have internal predecessors, (16), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:14:34,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:14:34,754 INFO L93 Difference]: Finished difference Result 20 states and 23 transitions. [2022-04-15 13:14:34,754 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2022-04-15 13:14:34,754 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:14:34,754 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:14:34,754 INFO L74 IsIncluded]: Start isIncluded. First operand has 17 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 states have internal predecessors, (16), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 20 states. [2022-04-15 13:14:34,755 INFO L87 Difference]: Start difference. First operand has 17 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 states have internal predecessors, (16), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 20 states. [2022-04-15 13:14:34,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:14:34,756 INFO L93 Difference]: Finished difference Result 20 states and 23 transitions. [2022-04-15 13:14:34,756 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2022-04-15 13:14:34,756 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:14:34,756 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:14:34,756 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:14:34,756 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:14:34,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 states have internal predecessors, (16), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:14:34,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2022-04-15 13:14:34,757 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 12 [2022-04-15 13:14:34,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:14:34,758 INFO L478 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2022-04-15 13:14:34,758 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:14:34,758 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 19 transitions. [2022-04-15 13:14:34,782 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 13:14:34,782 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2022-04-15 13:14:34,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-15 13:14:34,782 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:14:34,783 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 13:14:34,783 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,SelfDestructingSolverStorable2 [2022-04-15 13:14:34,783 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:14:34,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:14:34,783 INFO L85 PathProgramCache]: Analyzing trace with hash -2039168997, now seen corresponding path program 1 times [2022-04-15 13:14:34,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:14:34,784 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2130426004] [2022-04-15 13:14:35,091 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Basisvector must contain only constants! [2022-04-15 13:14:35,091 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 13:14:35,091 INFO L85 PathProgramCache]: Analyzing trace with hash -2039168997, now seen corresponding path program 2 times [2022-04-15 13:14:35,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:14:35,091 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1347961026] [2022-04-15 13:14:35,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:14:35,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:14:35,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:14:35,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 13:14:35,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:14:35,155 INFO L290 TraceCheckUtils]: 0: Hoare triple {441#(and (= |#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); {435#true} is VALID [2022-04-15 13:14:35,155 INFO L290 TraceCheckUtils]: 1: Hoare triple {435#true} assume true; {435#true} is VALID [2022-04-15 13:14:35,155 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {435#true} {435#true} #56#return; {435#true} is VALID [2022-04-15 13:14:35,156 INFO L272 TraceCheckUtils]: 0: Hoare triple {435#true} call ULTIMATE.init(); {441#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 13:14:35,156 INFO L290 TraceCheckUtils]: 1: Hoare triple {441#(and (= |#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); {435#true} is VALID [2022-04-15 13:14:35,156 INFO L290 TraceCheckUtils]: 2: Hoare triple {435#true} assume true; {435#true} is VALID [2022-04-15 13:14:35,156 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {435#true} {435#true} #56#return; {435#true} is VALID [2022-04-15 13:14:35,157 INFO L272 TraceCheckUtils]: 4: Hoare triple {435#true} call #t~ret7 := main(); {435#true} is VALID [2022-04-15 13:14:35,157 INFO L290 TraceCheckUtils]: 5: Hoare triple {435#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~a~0 := 0; {435#true} is VALID [2022-04-15 13:14:35,157 INFO L290 TraceCheckUtils]: 6: Hoare triple {435#true} assume !!(~a~0 < 6);~b~0 := 0; {435#true} is VALID [2022-04-15 13:14:35,157 INFO L290 TraceCheckUtils]: 7: Hoare triple {435#true} assume !!(~b~0 < 6);~c~0 := 0; {440#(= main_~c~0 0)} is VALID [2022-04-15 13:14:35,158 INFO L290 TraceCheckUtils]: 8: Hoare triple {440#(= main_~c~0 0)} assume !(~c~0 < 6); {436#false} is VALID [2022-04-15 13:14:35,158 INFO L290 TraceCheckUtils]: 9: Hoare triple {436#false} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {436#false} is VALID [2022-04-15 13:14:35,158 INFO L290 TraceCheckUtils]: 10: Hoare triple {436#false} assume !(~b~0 < 6); {436#false} is VALID [2022-04-15 13:14:35,158 INFO L290 TraceCheckUtils]: 11: Hoare triple {436#false} #t~pre4 := 1 + ~a~0;~a~0 := 1 + ~a~0;havoc #t~pre4; {436#false} is VALID [2022-04-15 13:14:35,159 INFO L290 TraceCheckUtils]: 12: Hoare triple {436#false} assume !(~a~0 < 6); {436#false} is VALID [2022-04-15 13:14:35,159 INFO L290 TraceCheckUtils]: 13: Hoare triple {436#false} assume !((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0); {436#false} is VALID [2022-04-15 13:14:35,159 INFO L290 TraceCheckUtils]: 14: Hoare triple {436#false} assume !false; {436#false} is VALID [2022-04-15 13:14:35,159 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 13:14:35,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:14:35,160 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1347961026] [2022-04-15 13:14:35,160 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1347961026] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:14:35,160 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:14:35,160 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 13:14:35,160 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:14:35,160 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2130426004] [2022-04-15 13:14:35,160 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2130426004] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:14:35,160 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:14:35,161 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 13:14:35,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764332844] [2022-04-15 13:14:35,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:14:35,161 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-04-15 13:14:35,161 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:14:35,161 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:14:35,175 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:14:35,175 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 13:14:35,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:14:35,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 13:14:35,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 13:14:35,176 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:14:35,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:14:35,228 INFO L93 Difference]: Finished difference Result 29 states and 34 transitions. [2022-04-15 13:14:35,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 13:14:35,229 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-04-15 13:14:35,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:14:35,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:14:35,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 31 transitions. [2022-04-15 13:14:35,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:14:35,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 31 transitions. [2022-04-15 13:14:35,231 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 31 transitions. [2022-04-15 13:14:35,259 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:14:35,260 INFO L225 Difference]: With dead ends: 29 [2022-04-15 13:14:35,260 INFO L226 Difference]: Without dead ends: 19 [2022-04-15 13:14:35,260 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-15 13:14:35,261 INFO L913 BasicCegarLoop]: 15 mSDtfsCounter, 14 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 13:14:35,261 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 22 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 13:14:35,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2022-04-15 13:14:35,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 18. [2022-04-15 13:14:35,265 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:14:35,265 INFO L82 GeneralOperation]: Start isEquivalent. First operand 19 states. Second operand has 18 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:14:35,265 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand has 18 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:14:35,266 INFO L87 Difference]: Start difference. First operand 19 states. Second operand has 18 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:14:35,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:14:35,267 INFO L93 Difference]: Finished difference Result 19 states and 21 transitions. [2022-04-15 13:14:35,267 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2022-04-15 13:14:35,267 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:14:35,267 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:14:35,267 INFO L74 IsIncluded]: Start isIncluded. First operand has 18 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 19 states. [2022-04-15 13:14:35,268 INFO L87 Difference]: Start difference. First operand has 18 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 19 states. [2022-04-15 13:14:35,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:14:35,269 INFO L93 Difference]: Finished difference Result 19 states and 21 transitions. [2022-04-15 13:14:35,269 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2022-04-15 13:14:35,269 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:14:35,269 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:14:35,269 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:14:35,269 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:14:35,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:14:35,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2022-04-15 13:14:35,271 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 20 transitions. Word has length 15 [2022-04-15 13:14:35,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:14:35,271 INFO L478 AbstractCegarLoop]: Abstraction has 18 states and 20 transitions. [2022-04-15 13:14:35,271 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:14:35,271 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 20 transitions. [2022-04-15 13:14:35,290 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:14:35,290 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2022-04-15 13:14:35,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-15 13:14:35,291 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:14:35,291 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 13:14:35,291 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-04-15 13:14:35,291 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:14:35,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:14:35,292 INFO L85 PathProgramCache]: Analyzing trace with hash -434811975, now seen corresponding path program 1 times [2022-04-15 13:14:35,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:14:35,292 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1545441478] [2022-04-15 13:14:36,006 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 13:14:36,007 INFO L85 PathProgramCache]: Analyzing trace with hash 1694061839, now seen corresponding path program 1 times [2022-04-15 13:14:36,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:14:36,007 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [440462189] [2022-04-15 13:14:36,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:14:36,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:14:36,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 13:14:36,015 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 13:14:36,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 13:14:36,021 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 13:14:36,021 INFO L85 PathProgramCache]: Analyzing trace with hash -434811975, now seen corresponding path program 2 times [2022-04-15 13:14:36,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:14:36,022 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1776196838] [2022-04-15 13:14:36,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:14:36,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:14:36,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:14:36,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 13:14:36,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:14:36,058 INFO L290 TraceCheckUtils]: 0: Hoare triple {585#(and (= |#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); {578#true} is VALID [2022-04-15 13:14:36,058 INFO L290 TraceCheckUtils]: 1: Hoare triple {578#true} assume true; {578#true} is VALID [2022-04-15 13:14:36,058 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {578#true} {578#true} #56#return; {578#true} is VALID [2022-04-15 13:14:36,059 INFO L272 TraceCheckUtils]: 0: Hoare triple {578#true} call ULTIMATE.init(); {585#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 13:14:36,059 INFO L290 TraceCheckUtils]: 1: Hoare triple {585#(and (= |#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); {578#true} is VALID [2022-04-15 13:14:36,059 INFO L290 TraceCheckUtils]: 2: Hoare triple {578#true} assume true; {578#true} is VALID [2022-04-15 13:14:36,059 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {578#true} {578#true} #56#return; {578#true} is VALID [2022-04-15 13:14:36,059 INFO L272 TraceCheckUtils]: 4: Hoare triple {578#true} call #t~ret7 := main(); {578#true} is VALID [2022-04-15 13:14:36,060 INFO L290 TraceCheckUtils]: 5: Hoare triple {578#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~a~0 := 0; {578#true} is VALID [2022-04-15 13:14:36,060 INFO L290 TraceCheckUtils]: 6: Hoare triple {578#true} assume !!(~a~0 < 6);~b~0 := 0; {578#true} is VALID [2022-04-15 13:14:36,060 INFO L290 TraceCheckUtils]: 7: Hoare triple {578#true} assume !!(~b~0 < 6);~c~0 := 0; {583#(= main_~c~0 0)} is VALID [2022-04-15 13:14:36,061 INFO L290 TraceCheckUtils]: 8: Hoare triple {583#(= main_~c~0 0)} assume !!(~c~0 < 6); {583#(= main_~c~0 0)} is VALID [2022-04-15 13:14:36,061 INFO L290 TraceCheckUtils]: 9: Hoare triple {583#(= main_~c~0 0)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {584#(<= main_~c~0 1)} is VALID [2022-04-15 13:14:36,062 INFO L290 TraceCheckUtils]: 10: Hoare triple {584#(<= main_~c~0 1)} assume !(~c~0 < 6); {579#false} is VALID [2022-04-15 13:14:36,062 INFO L290 TraceCheckUtils]: 11: Hoare triple {579#false} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {579#false} is VALID [2022-04-15 13:14:36,062 INFO L290 TraceCheckUtils]: 12: Hoare triple {579#false} assume !(~b~0 < 6); {579#false} is VALID [2022-04-15 13:14:36,062 INFO L290 TraceCheckUtils]: 13: Hoare triple {579#false} #t~pre4 := 1 + ~a~0;~a~0 := 1 + ~a~0;havoc #t~pre4; {579#false} is VALID [2022-04-15 13:14:36,062 INFO L290 TraceCheckUtils]: 14: Hoare triple {579#false} assume !(~a~0 < 6); {579#false} is VALID [2022-04-15 13:14:36,062 INFO L290 TraceCheckUtils]: 15: Hoare triple {579#false} assume !((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0); {579#false} is VALID [2022-04-15 13:14:36,062 INFO L290 TraceCheckUtils]: 16: Hoare triple {579#false} assume !false; {579#false} is VALID [2022-04-15 13:14:36,063 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:14:36,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:14:36,063 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1776196838] [2022-04-15 13:14:36,063 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1776196838] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 13:14:36,063 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [436626379] [2022-04-15 13:14:36,063 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 13:14:36,064 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 13:14:36,064 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 13:14:36,065 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 13:14:36,076 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 13:14:36,112 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 13:14:36,112 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 13:14:36,113 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 3 conjunts are in the unsatisfiable core [2022-04-15 13:14:36,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:14:36,126 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 13:14:36,215 INFO L272 TraceCheckUtils]: 0: Hoare triple {578#true} call ULTIMATE.init(); {578#true} is VALID [2022-04-15 13:14:36,216 INFO L290 TraceCheckUtils]: 1: Hoare triple {578#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); {578#true} is VALID [2022-04-15 13:14:36,216 INFO L290 TraceCheckUtils]: 2: Hoare triple {578#true} assume true; {578#true} is VALID [2022-04-15 13:14:36,216 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {578#true} {578#true} #56#return; {578#true} is VALID [2022-04-15 13:14:36,216 INFO L272 TraceCheckUtils]: 4: Hoare triple {578#true} call #t~ret7 := main(); {578#true} is VALID [2022-04-15 13:14:36,216 INFO L290 TraceCheckUtils]: 5: Hoare triple {578#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~a~0 := 0; {578#true} is VALID [2022-04-15 13:14:36,217 INFO L290 TraceCheckUtils]: 6: Hoare triple {578#true} assume !!(~a~0 < 6);~b~0 := 0; {578#true} is VALID [2022-04-15 13:14:36,217 INFO L290 TraceCheckUtils]: 7: Hoare triple {578#true} assume !!(~b~0 < 6);~c~0 := 0; {610#(<= main_~c~0 0)} is VALID [2022-04-15 13:14:36,218 INFO L290 TraceCheckUtils]: 8: Hoare triple {610#(<= main_~c~0 0)} assume !!(~c~0 < 6); {610#(<= main_~c~0 0)} is VALID [2022-04-15 13:14:36,219 INFO L290 TraceCheckUtils]: 9: Hoare triple {610#(<= main_~c~0 0)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {584#(<= main_~c~0 1)} is VALID [2022-04-15 13:14:36,222 INFO L290 TraceCheckUtils]: 10: Hoare triple {584#(<= main_~c~0 1)} assume !(~c~0 < 6); {579#false} is VALID [2022-04-15 13:14:36,222 INFO L290 TraceCheckUtils]: 11: Hoare triple {579#false} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {579#false} is VALID [2022-04-15 13:14:36,222 INFO L290 TraceCheckUtils]: 12: Hoare triple {579#false} assume !(~b~0 < 6); {579#false} is VALID [2022-04-15 13:14:36,222 INFO L290 TraceCheckUtils]: 13: Hoare triple {579#false} #t~pre4 := 1 + ~a~0;~a~0 := 1 + ~a~0;havoc #t~pre4; {579#false} is VALID [2022-04-15 13:14:36,223 INFO L290 TraceCheckUtils]: 14: Hoare triple {579#false} assume !(~a~0 < 6); {579#false} is VALID [2022-04-15 13:14:36,223 INFO L290 TraceCheckUtils]: 15: Hoare triple {579#false} assume !((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0); {579#false} is VALID [2022-04-15 13:14:36,223 INFO L290 TraceCheckUtils]: 16: Hoare triple {579#false} assume !false; {579#false} is VALID [2022-04-15 13:14:36,223 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:14:36,223 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 13:14:36,324 INFO L290 TraceCheckUtils]: 16: Hoare triple {579#false} assume !false; {579#false} is VALID [2022-04-15 13:14:36,324 INFO L290 TraceCheckUtils]: 15: Hoare triple {579#false} assume !((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0); {579#false} is VALID [2022-04-15 13:14:36,325 INFO L290 TraceCheckUtils]: 14: Hoare triple {579#false} assume !(~a~0 < 6); {579#false} is VALID [2022-04-15 13:14:36,325 INFO L290 TraceCheckUtils]: 13: Hoare triple {579#false} #t~pre4 := 1 + ~a~0;~a~0 := 1 + ~a~0;havoc #t~pre4; {579#false} is VALID [2022-04-15 13:14:36,325 INFO L290 TraceCheckUtils]: 12: Hoare triple {579#false} assume !(~b~0 < 6); {579#false} is VALID [2022-04-15 13:14:36,325 INFO L290 TraceCheckUtils]: 11: Hoare triple {579#false} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {579#false} is VALID [2022-04-15 13:14:36,331 INFO L290 TraceCheckUtils]: 10: Hoare triple {656#(< main_~c~0 6)} assume !(~c~0 < 6); {579#false} is VALID [2022-04-15 13:14:36,332 INFO L290 TraceCheckUtils]: 9: Hoare triple {660#(< main_~c~0 5)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {656#(< main_~c~0 6)} is VALID [2022-04-15 13:14:36,332 INFO L290 TraceCheckUtils]: 8: Hoare triple {660#(< main_~c~0 5)} assume !!(~c~0 < 6); {660#(< main_~c~0 5)} is VALID [2022-04-15 13:14:36,335 INFO L290 TraceCheckUtils]: 7: Hoare triple {578#true} assume !!(~b~0 < 6);~c~0 := 0; {660#(< main_~c~0 5)} is VALID [2022-04-15 13:14:36,335 INFO L290 TraceCheckUtils]: 6: Hoare triple {578#true} assume !!(~a~0 < 6);~b~0 := 0; {578#true} is VALID [2022-04-15 13:14:36,335 INFO L290 TraceCheckUtils]: 5: Hoare triple {578#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~a~0 := 0; {578#true} is VALID [2022-04-15 13:14:36,336 INFO L272 TraceCheckUtils]: 4: Hoare triple {578#true} call #t~ret7 := main(); {578#true} is VALID [2022-04-15 13:14:36,336 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {578#true} {578#true} #56#return; {578#true} is VALID [2022-04-15 13:14:36,336 INFO L290 TraceCheckUtils]: 2: Hoare triple {578#true} assume true; {578#true} is VALID [2022-04-15 13:14:36,336 INFO L290 TraceCheckUtils]: 1: Hoare triple {578#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); {578#true} is VALID [2022-04-15 13:14:36,336 INFO L272 TraceCheckUtils]: 0: Hoare triple {578#true} call ULTIMATE.init(); {578#true} is VALID [2022-04-15 13:14:36,336 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:14:36,337 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [436626379] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 13:14:36,337 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 13:14:36,337 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 8 [2022-04-15 13:14:36,337 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:14:36,337 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1545441478] [2022-04-15 13:14:36,338 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1545441478] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:14:36,338 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:14:36,338 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 13:14:36,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [410440550] [2022-04-15 13:14:36,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:14:36,338 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-15 13:14:36,338 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:14:36,339 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:14:36,350 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 13:14:36,350 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 13:14:36,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:14:36,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 13:14:36,351 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2022-04-15 13:14:36,352 INFO L87 Difference]: Start difference. First operand 18 states and 20 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:14:36,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:14:36,432 INFO L93 Difference]: Finished difference Result 32 states and 37 transitions. [2022-04-15 13:14:36,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 13:14:36,432 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-15 13:14:36,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:14:36,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:14:36,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 33 transitions. [2022-04-15 13:14:36,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:14:36,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 33 transitions. [2022-04-15 13:14:36,435 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 33 transitions. [2022-04-15 13:14:36,460 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:14:36,461 INFO L225 Difference]: With dead ends: 32 [2022-04-15 13:14:36,461 INFO L226 Difference]: Without dead ends: 21 [2022-04-15 13:14:36,461 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2022-04-15 13:14:36,462 INFO L913 BasicCegarLoop]: 15 mSDtfsCounter, 16 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 13:14:36,462 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [16 Valid, 27 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 13:14:36,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2022-04-15 13:14:36,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 20. [2022-04-15 13:14:36,467 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:14:36,467 INFO L82 GeneralOperation]: Start isEquivalent. First operand 21 states. Second operand has 20 states, 16 states have (on average 1.1875) internal successors, (19), 16 states have internal predecessors, (19), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:14:36,468 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand has 20 states, 16 states have (on average 1.1875) internal successors, (19), 16 states have internal predecessors, (19), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:14:36,468 INFO L87 Difference]: Start difference. First operand 21 states. Second operand has 20 states, 16 states have (on average 1.1875) internal successors, (19), 16 states have internal predecessors, (19), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:14:36,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:14:36,469 INFO L93 Difference]: Finished difference Result 21 states and 23 transitions. [2022-04-15 13:14:36,469 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2022-04-15 13:14:36,469 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:14:36,469 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:14:36,469 INFO L74 IsIncluded]: Start isIncluded. First operand has 20 states, 16 states have (on average 1.1875) internal successors, (19), 16 states have internal predecessors, (19), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 21 states. [2022-04-15 13:14:36,470 INFO L87 Difference]: Start difference. First operand has 20 states, 16 states have (on average 1.1875) internal successors, (19), 16 states have internal predecessors, (19), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 21 states. [2022-04-15 13:14:36,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:14:36,471 INFO L93 Difference]: Finished difference Result 21 states and 23 transitions. [2022-04-15 13:14:36,471 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2022-04-15 13:14:36,471 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:14:36,471 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:14:36,471 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:14:36,471 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:14:36,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 16 states have (on average 1.1875) internal successors, (19), 16 states have internal predecessors, (19), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:14:36,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 22 transitions. [2022-04-15 13:14:36,472 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 22 transitions. Word has length 17 [2022-04-15 13:14:36,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:14:36,473 INFO L478 AbstractCegarLoop]: Abstraction has 20 states and 22 transitions. [2022-04-15 13:14:36,473 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:14:36,473 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 20 states and 22 transitions. [2022-04-15 13:14:36,492 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:14:36,492 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2022-04-15 13:14:36,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-04-15 13:14:36,493 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:14:36,493 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 13:14:36,515 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-04-15 13:14:36,710 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-04-15 13:14:36,711 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:14:36,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:14:36,711 INFO L85 PathProgramCache]: Analyzing trace with hash -540973097, now seen corresponding path program 3 times [2022-04-15 13:14:36,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:14:36,712 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1381642781] [2022-04-15 13:14:37,393 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 13:14:37,394 INFO L85 PathProgramCache]: Analyzing trace with hash 1694123343, now seen corresponding path program 1 times [2022-04-15 13:14:37,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:14:37,394 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1493027436] [2022-04-15 13:14:37,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:14:37,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:14:37,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 13:14:37,400 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 13:14:37,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 13:14:37,406 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 13:14:37,406 INFO L85 PathProgramCache]: Analyzing trace with hash -540973097, now seen corresponding path program 4 times [2022-04-15 13:14:37,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:14:37,406 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1678611114] [2022-04-15 13:14:37,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:14:37,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:14:37,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:14:37,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 13:14:37,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:14:37,445 INFO L290 TraceCheckUtils]: 0: Hoare triple {847#(and (= |#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); {840#true} is VALID [2022-04-15 13:14:37,445 INFO L290 TraceCheckUtils]: 1: Hoare triple {840#true} assume true; {840#true} is VALID [2022-04-15 13:14:37,445 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {840#true} {840#true} #56#return; {840#true} is VALID [2022-04-15 13:14:37,446 INFO L272 TraceCheckUtils]: 0: Hoare triple {840#true} call ULTIMATE.init(); {847#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 13:14:37,446 INFO L290 TraceCheckUtils]: 1: Hoare triple {847#(and (= |#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); {840#true} is VALID [2022-04-15 13:14:37,446 INFO L290 TraceCheckUtils]: 2: Hoare triple {840#true} assume true; {840#true} is VALID [2022-04-15 13:14:37,446 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {840#true} {840#true} #56#return; {840#true} is VALID [2022-04-15 13:14:37,446 INFO L272 TraceCheckUtils]: 4: Hoare triple {840#true} call #t~ret7 := main(); {840#true} is VALID [2022-04-15 13:14:37,446 INFO L290 TraceCheckUtils]: 5: Hoare triple {840#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~a~0 := 0; {840#true} is VALID [2022-04-15 13:14:37,447 INFO L290 TraceCheckUtils]: 6: Hoare triple {840#true} assume !!(~a~0 < 6);~b~0 := 0; {845#(= main_~b~0 0)} is VALID [2022-04-15 13:14:37,447 INFO L290 TraceCheckUtils]: 7: Hoare triple {845#(= main_~b~0 0)} assume !!(~b~0 < 6);~c~0 := 0; {845#(= main_~b~0 0)} is VALID [2022-04-15 13:14:37,448 INFO L290 TraceCheckUtils]: 8: Hoare triple {845#(= main_~b~0 0)} assume !!(~c~0 < 6); {845#(= main_~b~0 0)} is VALID [2022-04-15 13:14:37,448 INFO L290 TraceCheckUtils]: 9: Hoare triple {845#(= main_~b~0 0)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {845#(= main_~b~0 0)} is VALID [2022-04-15 13:14:37,448 INFO L290 TraceCheckUtils]: 10: Hoare triple {845#(= main_~b~0 0)} assume !!(~c~0 < 6); {845#(= main_~b~0 0)} is VALID [2022-04-15 13:14:37,449 INFO L290 TraceCheckUtils]: 11: Hoare triple {845#(= main_~b~0 0)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {845#(= main_~b~0 0)} is VALID [2022-04-15 13:14:37,449 INFO L290 TraceCheckUtils]: 12: Hoare triple {845#(= main_~b~0 0)} assume !(~c~0 < 6); {845#(= main_~b~0 0)} is VALID [2022-04-15 13:14:37,450 INFO L290 TraceCheckUtils]: 13: Hoare triple {845#(= main_~b~0 0)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {846#(<= main_~b~0 1)} is VALID [2022-04-15 13:14:37,450 INFO L290 TraceCheckUtils]: 14: Hoare triple {846#(<= main_~b~0 1)} assume !(~b~0 < 6); {841#false} is VALID [2022-04-15 13:14:37,450 INFO L290 TraceCheckUtils]: 15: Hoare triple {841#false} #t~pre4 := 1 + ~a~0;~a~0 := 1 + ~a~0;havoc #t~pre4; {841#false} is VALID [2022-04-15 13:14:37,450 INFO L290 TraceCheckUtils]: 16: Hoare triple {841#false} assume !(~a~0 < 6); {841#false} is VALID [2022-04-15 13:14:37,451 INFO L290 TraceCheckUtils]: 17: Hoare triple {841#false} assume !((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0); {841#false} is VALID [2022-04-15 13:14:37,451 INFO L290 TraceCheckUtils]: 18: Hoare triple {841#false} assume !false; {841#false} is VALID [2022-04-15 13:14:37,451 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-15 13:14:37,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:14:37,451 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1678611114] [2022-04-15 13:14:37,451 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1678611114] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 13:14:37,451 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [607836884] [2022-04-15 13:14:37,451 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 13:14:37,452 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 13:14:37,452 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 13:14:37,453 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 13:14:37,454 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 13:14:37,482 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 13:14:37,482 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 13:14:37,483 INFO L263 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 4 conjunts are in the unsatisfiable core [2022-04-15 13:14:37,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:14:37,504 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 13:14:37,593 INFO L272 TraceCheckUtils]: 0: Hoare triple {840#true} call ULTIMATE.init(); {840#true} is VALID [2022-04-15 13:14:37,593 INFO L290 TraceCheckUtils]: 1: Hoare triple {840#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); {840#true} is VALID [2022-04-15 13:14:37,593 INFO L290 TraceCheckUtils]: 2: Hoare triple {840#true} assume true; {840#true} is VALID [2022-04-15 13:14:37,593 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {840#true} {840#true} #56#return; {840#true} is VALID [2022-04-15 13:14:37,593 INFO L272 TraceCheckUtils]: 4: Hoare triple {840#true} call #t~ret7 := main(); {840#true} is VALID [2022-04-15 13:14:37,594 INFO L290 TraceCheckUtils]: 5: Hoare triple {840#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~a~0 := 0; {840#true} is VALID [2022-04-15 13:14:37,594 INFO L290 TraceCheckUtils]: 6: Hoare triple {840#true} assume !!(~a~0 < 6);~b~0 := 0; {840#true} is VALID [2022-04-15 13:14:37,594 INFO L290 TraceCheckUtils]: 7: Hoare triple {840#true} assume !!(~b~0 < 6);~c~0 := 0; {872#(<= main_~c~0 0)} is VALID [2022-04-15 13:14:37,595 INFO L290 TraceCheckUtils]: 8: Hoare triple {872#(<= main_~c~0 0)} assume !!(~c~0 < 6); {872#(<= main_~c~0 0)} is VALID [2022-04-15 13:14:37,595 INFO L290 TraceCheckUtils]: 9: Hoare triple {872#(<= main_~c~0 0)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {879#(<= main_~c~0 1)} is VALID [2022-04-15 13:14:37,596 INFO L290 TraceCheckUtils]: 10: Hoare triple {879#(<= main_~c~0 1)} assume !!(~c~0 < 6); {879#(<= main_~c~0 1)} is VALID [2022-04-15 13:14:37,596 INFO L290 TraceCheckUtils]: 11: Hoare triple {879#(<= main_~c~0 1)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {886#(<= main_~c~0 2)} is VALID [2022-04-15 13:14:37,597 INFO L290 TraceCheckUtils]: 12: Hoare triple {886#(<= main_~c~0 2)} assume !(~c~0 < 6); {841#false} is VALID [2022-04-15 13:14:37,597 INFO L290 TraceCheckUtils]: 13: Hoare triple {841#false} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {841#false} is VALID [2022-04-15 13:14:37,597 INFO L290 TraceCheckUtils]: 14: Hoare triple {841#false} assume !(~b~0 < 6); {841#false} is VALID [2022-04-15 13:14:37,597 INFO L290 TraceCheckUtils]: 15: Hoare triple {841#false} #t~pre4 := 1 + ~a~0;~a~0 := 1 + ~a~0;havoc #t~pre4; {841#false} is VALID [2022-04-15 13:14:37,597 INFO L290 TraceCheckUtils]: 16: Hoare triple {841#false} assume !(~a~0 < 6); {841#false} is VALID [2022-04-15 13:14:37,597 INFO L290 TraceCheckUtils]: 17: Hoare triple {841#false} assume !((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0); {841#false} is VALID [2022-04-15 13:14:37,598 INFO L290 TraceCheckUtils]: 18: Hoare triple {841#false} assume !false; {841#false} is VALID [2022-04-15 13:14:37,598 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:14:37,598 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 13:14:37,690 INFO L290 TraceCheckUtils]: 18: Hoare triple {841#false} assume !false; {841#false} is VALID [2022-04-15 13:14:37,690 INFO L290 TraceCheckUtils]: 17: Hoare triple {841#false} assume !((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0); {841#false} is VALID [2022-04-15 13:14:37,690 INFO L290 TraceCheckUtils]: 16: Hoare triple {841#false} assume !(~a~0 < 6); {841#false} is VALID [2022-04-15 13:14:37,690 INFO L290 TraceCheckUtils]: 15: Hoare triple {841#false} #t~pre4 := 1 + ~a~0;~a~0 := 1 + ~a~0;havoc #t~pre4; {841#false} is VALID [2022-04-15 13:14:37,690 INFO L290 TraceCheckUtils]: 14: Hoare triple {841#false} assume !(~b~0 < 6); {841#false} is VALID [2022-04-15 13:14:37,690 INFO L290 TraceCheckUtils]: 13: Hoare triple {841#false} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {841#false} is VALID [2022-04-15 13:14:37,691 INFO L290 TraceCheckUtils]: 12: Hoare triple {926#(< main_~c~0 6)} assume !(~c~0 < 6); {841#false} is VALID [2022-04-15 13:14:37,691 INFO L290 TraceCheckUtils]: 11: Hoare triple {930#(< main_~c~0 5)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {926#(< main_~c~0 6)} is VALID [2022-04-15 13:14:37,692 INFO L290 TraceCheckUtils]: 10: Hoare triple {930#(< main_~c~0 5)} assume !!(~c~0 < 6); {930#(< main_~c~0 5)} is VALID [2022-04-15 13:14:37,693 INFO L290 TraceCheckUtils]: 9: Hoare triple {937#(< main_~c~0 4)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {930#(< main_~c~0 5)} is VALID [2022-04-15 13:14:37,693 INFO L290 TraceCheckUtils]: 8: Hoare triple {937#(< main_~c~0 4)} assume !!(~c~0 < 6); {937#(< main_~c~0 4)} is VALID [2022-04-15 13:14:37,693 INFO L290 TraceCheckUtils]: 7: Hoare triple {840#true} assume !!(~b~0 < 6);~c~0 := 0; {937#(< main_~c~0 4)} is VALID [2022-04-15 13:14:37,694 INFO L290 TraceCheckUtils]: 6: Hoare triple {840#true} assume !!(~a~0 < 6);~b~0 := 0; {840#true} is VALID [2022-04-15 13:14:37,694 INFO L290 TraceCheckUtils]: 5: Hoare triple {840#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~a~0 := 0; {840#true} is VALID [2022-04-15 13:14:37,694 INFO L272 TraceCheckUtils]: 4: Hoare triple {840#true} call #t~ret7 := main(); {840#true} is VALID [2022-04-15 13:14:37,694 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {840#true} {840#true} #56#return; {840#true} is VALID [2022-04-15 13:14:37,694 INFO L290 TraceCheckUtils]: 2: Hoare triple {840#true} assume true; {840#true} is VALID [2022-04-15 13:14:37,694 INFO L290 TraceCheckUtils]: 1: Hoare triple {840#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); {840#true} is VALID [2022-04-15 13:14:37,694 INFO L272 TraceCheckUtils]: 0: Hoare triple {840#true} call ULTIMATE.init(); {840#true} is VALID [2022-04-15 13:14:37,695 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:14:37,695 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [607836884] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 13:14:37,695 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 13:14:37,695 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2022-04-15 13:14:37,695 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:14:37,695 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1381642781] [2022-04-15 13:14:37,695 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1381642781] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:14:37,696 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:14:37,696 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 13:14:37,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1533700084] [2022-04-15 13:14:37,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:14:37,696 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-04-15 13:14:37,697 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:14:37,697 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:14:37,720 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 13:14:37,720 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 13:14:37,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:14:37,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 13:14:37,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2022-04-15 13:14:37,721 INFO L87 Difference]: Start difference. First operand 20 states and 22 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:14:37,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:14:37,809 INFO L93 Difference]: Finished difference Result 46 states and 53 transitions. [2022-04-15 13:14:37,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 13:14:37,809 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-04-15 13:14:37,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:14:37,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:14:37,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 39 transitions. [2022-04-15 13:14:37,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:14:37,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 39 transitions. [2022-04-15 13:14:37,812 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 39 transitions. [2022-04-15 13:14:37,844 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:14:37,845 INFO L225 Difference]: With dead ends: 46 [2022-04-15 13:14:37,845 INFO L226 Difference]: Without dead ends: 33 [2022-04-15 13:14:37,846 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2022-04-15 13:14:37,848 INFO L913 BasicCegarLoop]: 15 mSDtfsCounter, 28 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 13:14:37,848 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [28 Valid, 22 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 13:14:37,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-04-15 13:14:37,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 27. [2022-04-15 13:14:37,863 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:14:37,863 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states. Second operand has 27 states, 23 states have (on average 1.173913043478261) internal successors, (27), 23 states have internal predecessors, (27), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:14:37,864 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand has 27 states, 23 states have (on average 1.173913043478261) internal successors, (27), 23 states have internal predecessors, (27), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:14:37,864 INFO L87 Difference]: Start difference. First operand 33 states. Second operand has 27 states, 23 states have (on average 1.173913043478261) internal successors, (27), 23 states have internal predecessors, (27), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:14:37,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:14:37,865 INFO L93 Difference]: Finished difference Result 33 states and 37 transitions. [2022-04-15 13:14:37,865 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2022-04-15 13:14:37,866 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:14:37,866 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:14:37,866 INFO L74 IsIncluded]: Start isIncluded. First operand has 27 states, 23 states have (on average 1.173913043478261) internal successors, (27), 23 states have internal predecessors, (27), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 33 states. [2022-04-15 13:14:37,866 INFO L87 Difference]: Start difference. First operand has 27 states, 23 states have (on average 1.173913043478261) internal successors, (27), 23 states have internal predecessors, (27), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 33 states. [2022-04-15 13:14:37,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:14:37,867 INFO L93 Difference]: Finished difference Result 33 states and 37 transitions. [2022-04-15 13:14:37,867 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2022-04-15 13:14:37,868 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:14:37,868 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:14:37,868 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:14:37,868 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:14:37,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 23 states have (on average 1.173913043478261) internal successors, (27), 23 states have internal predecessors, (27), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:14:37,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 30 transitions. [2022-04-15 13:14:37,869 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 30 transitions. Word has length 19 [2022-04-15 13:14:37,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:14:37,870 INFO L478 AbstractCegarLoop]: Abstraction has 27 states and 30 transitions. [2022-04-15 13:14:37,870 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:14:37,870 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 27 states and 30 transitions. [2022-04-15 13:14:37,896 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:14:37,897 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2022-04-15 13:14:37,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-15 13:14:37,897 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:14:37,898 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 13:14:37,922 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 13:14:38,111 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8,SelfDestructingSolverStorable7 [2022-04-15 13:14:38,111 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:14:38,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:14:38,112 INFO L85 PathProgramCache]: Analyzing trace with hash 611633562, now seen corresponding path program 5 times [2022-04-15 13:14:38,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:14:38,112 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1473236540] [2022-04-15 13:14:38,507 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 13:14:38,508 INFO L85 PathProgramCache]: Analyzing trace with hash 1694184847, now seen corresponding path program 1 times [2022-04-15 13:14:38,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:14:38,508 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350084430] [2022-04-15 13:14:38,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:14:38,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:14:38,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 13:14:38,514 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 13:14:38,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 13:14:38,519 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 13:14:38,519 INFO L85 PathProgramCache]: Analyzing trace with hash 611633562, now seen corresponding path program 6 times [2022-04-15 13:14:38,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:14:38,520 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1887230702] [2022-04-15 13:14:38,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:14:38,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:14:38,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:14:38,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 13:14:38,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:14:38,561 INFO L290 TraceCheckUtils]: 0: Hoare triple {1190#(and (= |#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); {1183#true} is VALID [2022-04-15 13:14:38,561 INFO L290 TraceCheckUtils]: 1: Hoare triple {1183#true} assume true; {1183#true} is VALID [2022-04-15 13:14:38,561 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1183#true} {1183#true} #56#return; {1183#true} is VALID [2022-04-15 13:14:38,562 INFO L272 TraceCheckUtils]: 0: Hoare triple {1183#true} call ULTIMATE.init(); {1190#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 13:14:38,562 INFO L290 TraceCheckUtils]: 1: Hoare triple {1190#(and (= |#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); {1183#true} is VALID [2022-04-15 13:14:38,562 INFO L290 TraceCheckUtils]: 2: Hoare triple {1183#true} assume true; {1183#true} is VALID [2022-04-15 13:14:38,562 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1183#true} {1183#true} #56#return; {1183#true} is VALID [2022-04-15 13:14:38,563 INFO L272 TraceCheckUtils]: 4: Hoare triple {1183#true} call #t~ret7 := main(); {1183#true} is VALID [2022-04-15 13:14:38,563 INFO L290 TraceCheckUtils]: 5: Hoare triple {1183#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~a~0 := 0; {1188#(= main_~a~0 0)} is VALID [2022-04-15 13:14:38,563 INFO L290 TraceCheckUtils]: 6: Hoare triple {1188#(= main_~a~0 0)} assume !!(~a~0 < 6);~b~0 := 0; {1188#(= main_~a~0 0)} is VALID [2022-04-15 13:14:38,564 INFO L290 TraceCheckUtils]: 7: Hoare triple {1188#(= main_~a~0 0)} assume !!(~b~0 < 6);~c~0 := 0; {1188#(= main_~a~0 0)} is VALID [2022-04-15 13:14:38,564 INFO L290 TraceCheckUtils]: 8: Hoare triple {1188#(= main_~a~0 0)} assume !!(~c~0 < 6); {1188#(= main_~a~0 0)} is VALID [2022-04-15 13:14:38,564 INFO L290 TraceCheckUtils]: 9: Hoare triple {1188#(= main_~a~0 0)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {1188#(= main_~a~0 0)} is VALID [2022-04-15 13:14:38,565 INFO L290 TraceCheckUtils]: 10: Hoare triple {1188#(= main_~a~0 0)} assume !!(~c~0 < 6); {1188#(= main_~a~0 0)} is VALID [2022-04-15 13:14:38,565 INFO L290 TraceCheckUtils]: 11: Hoare triple {1188#(= main_~a~0 0)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {1188#(= main_~a~0 0)} is VALID [2022-04-15 13:14:38,566 INFO L290 TraceCheckUtils]: 12: Hoare triple {1188#(= main_~a~0 0)} assume !(~c~0 < 6); {1188#(= main_~a~0 0)} is VALID [2022-04-15 13:14:38,566 INFO L290 TraceCheckUtils]: 13: Hoare triple {1188#(= main_~a~0 0)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {1188#(= main_~a~0 0)} is VALID [2022-04-15 13:14:38,566 INFO L290 TraceCheckUtils]: 14: Hoare triple {1188#(= main_~a~0 0)} assume !!(~b~0 < 6);~c~0 := 0; {1188#(= main_~a~0 0)} is VALID [2022-04-15 13:14:38,567 INFO L290 TraceCheckUtils]: 15: Hoare triple {1188#(= main_~a~0 0)} assume !!(~c~0 < 6); {1188#(= main_~a~0 0)} is VALID [2022-04-15 13:14:38,567 INFO L290 TraceCheckUtils]: 16: Hoare triple {1188#(= main_~a~0 0)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {1188#(= main_~a~0 0)} is VALID [2022-04-15 13:14:38,567 INFO L290 TraceCheckUtils]: 17: Hoare triple {1188#(= main_~a~0 0)} assume !!(~c~0 < 6); {1188#(= main_~a~0 0)} is VALID [2022-04-15 13:14:38,568 INFO L290 TraceCheckUtils]: 18: Hoare triple {1188#(= main_~a~0 0)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {1188#(= main_~a~0 0)} is VALID [2022-04-15 13:14:38,568 INFO L290 TraceCheckUtils]: 19: Hoare triple {1188#(= main_~a~0 0)} assume !(~c~0 < 6); {1188#(= main_~a~0 0)} is VALID [2022-04-15 13:14:38,568 INFO L290 TraceCheckUtils]: 20: Hoare triple {1188#(= main_~a~0 0)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {1188#(= main_~a~0 0)} is VALID [2022-04-15 13:14:38,569 INFO L290 TraceCheckUtils]: 21: Hoare triple {1188#(= main_~a~0 0)} assume !(~b~0 < 6); {1188#(= main_~a~0 0)} is VALID [2022-04-15 13:14:38,569 INFO L290 TraceCheckUtils]: 22: Hoare triple {1188#(= main_~a~0 0)} #t~pre4 := 1 + ~a~0;~a~0 := 1 + ~a~0;havoc #t~pre4; {1189#(<= main_~a~0 1)} is VALID [2022-04-15 13:14:38,570 INFO L290 TraceCheckUtils]: 23: Hoare triple {1189#(<= main_~a~0 1)} assume !(~a~0 < 6); {1184#false} is VALID [2022-04-15 13:14:38,570 INFO L290 TraceCheckUtils]: 24: Hoare triple {1184#false} assume !((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0); {1184#false} is VALID [2022-04-15 13:14:38,570 INFO L290 TraceCheckUtils]: 25: Hoare triple {1184#false} assume !false; {1184#false} is VALID [2022-04-15 13:14:38,570 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-04-15 13:14:38,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:14:38,570 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1887230702] [2022-04-15 13:14:38,571 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1887230702] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 13:14:38,571 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [262230287] [2022-04-15 13:14:38,571 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 13:14:38,571 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 13:14:38,571 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 13:14:38,572 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 13:14:38,587 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-15 13:14:38,607 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-04-15 13:14:38,607 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 13:14:38,608 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 3 conjunts are in the unsatisfiable core [2022-04-15 13:14:38,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:14:38,614 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 13:14:38,692 INFO L272 TraceCheckUtils]: 0: Hoare triple {1183#true} call ULTIMATE.init(); {1183#true} is VALID [2022-04-15 13:14:38,692 INFO L290 TraceCheckUtils]: 1: Hoare triple {1183#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); {1183#true} is VALID [2022-04-15 13:14:38,693 INFO L290 TraceCheckUtils]: 2: Hoare triple {1183#true} assume true; {1183#true} is VALID [2022-04-15 13:14:38,693 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1183#true} {1183#true} #56#return; {1183#true} is VALID [2022-04-15 13:14:38,693 INFO L272 TraceCheckUtils]: 4: Hoare triple {1183#true} call #t~ret7 := main(); {1183#true} is VALID [2022-04-15 13:14:38,693 INFO L290 TraceCheckUtils]: 5: Hoare triple {1183#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~a~0 := 0; {1209#(<= main_~a~0 0)} is VALID [2022-04-15 13:14:38,694 INFO L290 TraceCheckUtils]: 6: Hoare triple {1209#(<= main_~a~0 0)} assume !!(~a~0 < 6);~b~0 := 0; {1209#(<= main_~a~0 0)} is VALID [2022-04-15 13:14:38,694 INFO L290 TraceCheckUtils]: 7: Hoare triple {1209#(<= main_~a~0 0)} assume !!(~b~0 < 6);~c~0 := 0; {1209#(<= main_~a~0 0)} is VALID [2022-04-15 13:14:38,694 INFO L290 TraceCheckUtils]: 8: Hoare triple {1209#(<= main_~a~0 0)} assume !!(~c~0 < 6); {1209#(<= main_~a~0 0)} is VALID [2022-04-15 13:14:38,695 INFO L290 TraceCheckUtils]: 9: Hoare triple {1209#(<= main_~a~0 0)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {1209#(<= main_~a~0 0)} is VALID [2022-04-15 13:14:38,695 INFO L290 TraceCheckUtils]: 10: Hoare triple {1209#(<= main_~a~0 0)} assume !!(~c~0 < 6); {1209#(<= main_~a~0 0)} is VALID [2022-04-15 13:14:38,695 INFO L290 TraceCheckUtils]: 11: Hoare triple {1209#(<= main_~a~0 0)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {1209#(<= main_~a~0 0)} is VALID [2022-04-15 13:14:38,696 INFO L290 TraceCheckUtils]: 12: Hoare triple {1209#(<= main_~a~0 0)} assume !(~c~0 < 6); {1209#(<= main_~a~0 0)} is VALID [2022-04-15 13:14:38,696 INFO L290 TraceCheckUtils]: 13: Hoare triple {1209#(<= main_~a~0 0)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {1209#(<= main_~a~0 0)} is VALID [2022-04-15 13:14:38,696 INFO L290 TraceCheckUtils]: 14: Hoare triple {1209#(<= main_~a~0 0)} assume !!(~b~0 < 6);~c~0 := 0; {1209#(<= main_~a~0 0)} is VALID [2022-04-15 13:14:38,697 INFO L290 TraceCheckUtils]: 15: Hoare triple {1209#(<= main_~a~0 0)} assume !!(~c~0 < 6); {1209#(<= main_~a~0 0)} is VALID [2022-04-15 13:14:38,698 INFO L290 TraceCheckUtils]: 16: Hoare triple {1209#(<= main_~a~0 0)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {1209#(<= main_~a~0 0)} is VALID [2022-04-15 13:14:38,698 INFO L290 TraceCheckUtils]: 17: Hoare triple {1209#(<= main_~a~0 0)} assume !!(~c~0 < 6); {1209#(<= main_~a~0 0)} is VALID [2022-04-15 13:14:38,699 INFO L290 TraceCheckUtils]: 18: Hoare triple {1209#(<= main_~a~0 0)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {1209#(<= main_~a~0 0)} is VALID [2022-04-15 13:14:38,699 INFO L290 TraceCheckUtils]: 19: Hoare triple {1209#(<= main_~a~0 0)} assume !(~c~0 < 6); {1209#(<= main_~a~0 0)} is VALID [2022-04-15 13:14:38,699 INFO L290 TraceCheckUtils]: 20: Hoare triple {1209#(<= main_~a~0 0)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {1209#(<= main_~a~0 0)} is VALID [2022-04-15 13:14:38,700 INFO L290 TraceCheckUtils]: 21: Hoare triple {1209#(<= main_~a~0 0)} assume !(~b~0 < 6); {1209#(<= main_~a~0 0)} is VALID [2022-04-15 13:14:38,700 INFO L290 TraceCheckUtils]: 22: Hoare triple {1209#(<= main_~a~0 0)} #t~pre4 := 1 + ~a~0;~a~0 := 1 + ~a~0;havoc #t~pre4; {1189#(<= main_~a~0 1)} is VALID [2022-04-15 13:14:38,701 INFO L290 TraceCheckUtils]: 23: Hoare triple {1189#(<= main_~a~0 1)} assume !(~a~0 < 6); {1184#false} is VALID [2022-04-15 13:14:38,701 INFO L290 TraceCheckUtils]: 24: Hoare triple {1184#false} assume !((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0); {1184#false} is VALID [2022-04-15 13:14:38,701 INFO L290 TraceCheckUtils]: 25: Hoare triple {1184#false} assume !false; {1184#false} is VALID [2022-04-15 13:14:38,701 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-04-15 13:14:38,701 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 13:14:38,801 INFO L290 TraceCheckUtils]: 25: Hoare triple {1184#false} assume !false; {1184#false} is VALID [2022-04-15 13:14:38,802 INFO L290 TraceCheckUtils]: 24: Hoare triple {1184#false} assume !((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0); {1184#false} is VALID [2022-04-15 13:14:38,803 INFO L290 TraceCheckUtils]: 23: Hoare triple {1276#(< main_~a~0 6)} assume !(~a~0 < 6); {1184#false} is VALID [2022-04-15 13:14:38,803 INFO L290 TraceCheckUtils]: 22: Hoare triple {1280#(< main_~a~0 5)} #t~pre4 := 1 + ~a~0;~a~0 := 1 + ~a~0;havoc #t~pre4; {1276#(< main_~a~0 6)} is VALID [2022-04-15 13:14:38,804 INFO L290 TraceCheckUtils]: 21: Hoare triple {1280#(< main_~a~0 5)} assume !(~b~0 < 6); {1280#(< main_~a~0 5)} is VALID [2022-04-15 13:14:38,804 INFO L290 TraceCheckUtils]: 20: Hoare triple {1280#(< main_~a~0 5)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {1280#(< main_~a~0 5)} is VALID [2022-04-15 13:14:38,804 INFO L290 TraceCheckUtils]: 19: Hoare triple {1280#(< main_~a~0 5)} assume !(~c~0 < 6); {1280#(< main_~a~0 5)} is VALID [2022-04-15 13:14:38,805 INFO L290 TraceCheckUtils]: 18: Hoare triple {1280#(< main_~a~0 5)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {1280#(< main_~a~0 5)} is VALID [2022-04-15 13:14:38,805 INFO L290 TraceCheckUtils]: 17: Hoare triple {1280#(< main_~a~0 5)} assume !!(~c~0 < 6); {1280#(< main_~a~0 5)} is VALID [2022-04-15 13:14:38,805 INFO L290 TraceCheckUtils]: 16: Hoare triple {1280#(< main_~a~0 5)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {1280#(< main_~a~0 5)} is VALID [2022-04-15 13:14:38,806 INFO L290 TraceCheckUtils]: 15: Hoare triple {1280#(< main_~a~0 5)} assume !!(~c~0 < 6); {1280#(< main_~a~0 5)} is VALID [2022-04-15 13:14:38,806 INFO L290 TraceCheckUtils]: 14: Hoare triple {1280#(< main_~a~0 5)} assume !!(~b~0 < 6);~c~0 := 0; {1280#(< main_~a~0 5)} is VALID [2022-04-15 13:14:38,806 INFO L290 TraceCheckUtils]: 13: Hoare triple {1280#(< main_~a~0 5)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {1280#(< main_~a~0 5)} is VALID [2022-04-15 13:14:38,807 INFO L290 TraceCheckUtils]: 12: Hoare triple {1280#(< main_~a~0 5)} assume !(~c~0 < 6); {1280#(< main_~a~0 5)} is VALID [2022-04-15 13:14:38,811 INFO L290 TraceCheckUtils]: 11: Hoare triple {1280#(< main_~a~0 5)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {1280#(< main_~a~0 5)} is VALID [2022-04-15 13:14:38,812 INFO L290 TraceCheckUtils]: 10: Hoare triple {1280#(< main_~a~0 5)} assume !!(~c~0 < 6); {1280#(< main_~a~0 5)} is VALID [2022-04-15 13:14:38,812 INFO L290 TraceCheckUtils]: 9: Hoare triple {1280#(< main_~a~0 5)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {1280#(< main_~a~0 5)} is VALID [2022-04-15 13:14:38,812 INFO L290 TraceCheckUtils]: 8: Hoare triple {1280#(< main_~a~0 5)} assume !!(~c~0 < 6); {1280#(< main_~a~0 5)} is VALID [2022-04-15 13:14:38,813 INFO L290 TraceCheckUtils]: 7: Hoare triple {1280#(< main_~a~0 5)} assume !!(~b~0 < 6);~c~0 := 0; {1280#(< main_~a~0 5)} is VALID [2022-04-15 13:14:38,813 INFO L290 TraceCheckUtils]: 6: Hoare triple {1280#(< main_~a~0 5)} assume !!(~a~0 < 6);~b~0 := 0; {1280#(< main_~a~0 5)} is VALID [2022-04-15 13:14:38,813 INFO L290 TraceCheckUtils]: 5: Hoare triple {1183#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~a~0 := 0; {1280#(< main_~a~0 5)} is VALID [2022-04-15 13:14:38,814 INFO L272 TraceCheckUtils]: 4: Hoare triple {1183#true} call #t~ret7 := main(); {1183#true} is VALID [2022-04-15 13:14:38,814 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1183#true} {1183#true} #56#return; {1183#true} is VALID [2022-04-15 13:14:38,814 INFO L290 TraceCheckUtils]: 2: Hoare triple {1183#true} assume true; {1183#true} is VALID [2022-04-15 13:14:38,814 INFO L290 TraceCheckUtils]: 1: Hoare triple {1183#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); {1183#true} is VALID [2022-04-15 13:14:38,814 INFO L272 TraceCheckUtils]: 0: Hoare triple {1183#true} call ULTIMATE.init(); {1183#true} is VALID [2022-04-15 13:14:38,814 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-04-15 13:14:38,815 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [262230287] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 13:14:38,815 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 13:14:38,815 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 8 [2022-04-15 13:14:38,815 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:14:38,815 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1473236540] [2022-04-15 13:14:38,815 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1473236540] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:14:38,815 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:14:38,816 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 13:14:38,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1765033232] [2022-04-15 13:14:38,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:14:38,816 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2022-04-15 13:14:38,816 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:14:38,816 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:14:38,828 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 13:14:38,828 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 13:14:38,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:14:38,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 13:14:38,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2022-04-15 13:14:38,829 INFO L87 Difference]: Start difference. First operand 27 states and 30 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:14:38,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:14:38,933 INFO L93 Difference]: Finished difference Result 63 states and 72 transitions. [2022-04-15 13:14:38,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 13:14:38,934 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2022-04-15 13:14:38,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:14:38,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:14:38,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 36 transitions. [2022-04-15 13:14:38,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:14:38,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 36 transitions. [2022-04-15 13:14:38,936 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 36 transitions. [2022-04-15 13:14:38,966 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:14:38,967 INFO L225 Difference]: With dead ends: 63 [2022-04-15 13:14:38,967 INFO L226 Difference]: Without dead ends: 60 [2022-04-15 13:14:38,967 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2022-04-15 13:14:38,968 INFO L913 BasicCegarLoop]: 15 mSDtfsCounter, 40 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 13:14:38,968 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [40 Valid, 22 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 13:14:38,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2022-04-15 13:14:39,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 44. [2022-04-15 13:14:39,003 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:14:39,003 INFO L82 GeneralOperation]: Start isEquivalent. First operand 60 states. Second operand has 44 states, 40 states have (on average 1.175) internal successors, (47), 40 states have internal predecessors, (47), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:14:39,003 INFO L74 IsIncluded]: Start isIncluded. First operand 60 states. Second operand has 44 states, 40 states have (on average 1.175) internal successors, (47), 40 states have internal predecessors, (47), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:14:39,003 INFO L87 Difference]: Start difference. First operand 60 states. Second operand has 44 states, 40 states have (on average 1.175) internal successors, (47), 40 states have internal predecessors, (47), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:14:39,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:14:39,006 INFO L93 Difference]: Finished difference Result 60 states and 69 transitions. [2022-04-15 13:14:39,006 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 69 transitions. [2022-04-15 13:14:39,009 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:14:39,009 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:14:39,010 INFO L74 IsIncluded]: Start isIncluded. First operand has 44 states, 40 states have (on average 1.175) internal successors, (47), 40 states have internal predecessors, (47), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 60 states. [2022-04-15 13:14:39,010 INFO L87 Difference]: Start difference. First operand has 44 states, 40 states have (on average 1.175) internal successors, (47), 40 states have internal predecessors, (47), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 60 states. [2022-04-15 13:14:39,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:14:39,013 INFO L93 Difference]: Finished difference Result 60 states and 69 transitions. [2022-04-15 13:14:39,013 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 69 transitions. [2022-04-15 13:14:39,014 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:14:39,014 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:14:39,014 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:14:39,014 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:14:39,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 40 states have (on average 1.175) internal successors, (47), 40 states have internal predecessors, (47), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:14:39,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 50 transitions. [2022-04-15 13:14:39,017 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 50 transitions. Word has length 26 [2022-04-15 13:14:39,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:14:39,017 INFO L478 AbstractCegarLoop]: Abstraction has 44 states and 50 transitions. [2022-04-15 13:14:39,017 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:14:39,018 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 44 states and 50 transitions. [2022-04-15 13:14:39,067 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:14:39,068 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 50 transitions. [2022-04-15 13:14:39,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-04-15 13:14:39,068 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:14:39,069 INFO L499 BasicCegarLoop]: trace histogram [8, 8, 4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 13:14:39,094 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-15 13:14:39,289 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,SelfDestructingSolverStorable9,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 13:14:39,289 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:14:39,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:14:39,290 INFO L85 PathProgramCache]: Analyzing trace with hash 1035792127, now seen corresponding path program 7 times [2022-04-15 13:14:39,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:14:39,290 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1452451264] [2022-04-15 13:14:39,950 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 13:14:39,951 INFO L85 PathProgramCache]: Analyzing trace with hash 1694246351, now seen corresponding path program 1 times [2022-04-15 13:14:39,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:14:39,952 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2068154257] [2022-04-15 13:14:39,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:14:39,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:14:39,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 13:14:39,957 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 13:14:39,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 13:14:39,961 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 13:14:39,961 INFO L85 PathProgramCache]: Analyzing trace with hash 1035792127, now seen corresponding path program 8 times [2022-04-15 13:14:39,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:14:39,961 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [189328314] [2022-04-15 13:14:39,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:14:39,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:14:39,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:14:40,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 13:14:40,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:14:40,036 INFO L290 TraceCheckUtils]: 0: Hoare triple {1695#(and (= |#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); {1687#true} is VALID [2022-04-15 13:14:40,036 INFO L290 TraceCheckUtils]: 1: Hoare triple {1687#true} assume true; {1687#true} is VALID [2022-04-15 13:14:40,036 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1687#true} {1687#true} #56#return; {1687#true} is VALID [2022-04-15 13:14:40,042 INFO L272 TraceCheckUtils]: 0: Hoare triple {1687#true} call ULTIMATE.init(); {1695#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 13:14:40,042 INFO L290 TraceCheckUtils]: 1: Hoare triple {1695#(and (= |#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); {1687#true} is VALID [2022-04-15 13:14:40,043 INFO L290 TraceCheckUtils]: 2: Hoare triple {1687#true} assume true; {1687#true} is VALID [2022-04-15 13:14:40,043 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1687#true} {1687#true} #56#return; {1687#true} is VALID [2022-04-15 13:14:40,043 INFO L272 TraceCheckUtils]: 4: Hoare triple {1687#true} call #t~ret7 := main(); {1687#true} is VALID [2022-04-15 13:14:40,043 INFO L290 TraceCheckUtils]: 5: Hoare triple {1687#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~a~0 := 0; {1687#true} is VALID [2022-04-15 13:14:40,043 INFO L290 TraceCheckUtils]: 6: Hoare triple {1687#true} assume !!(~a~0 < 6);~b~0 := 0; {1687#true} is VALID [2022-04-15 13:14:40,044 INFO L290 TraceCheckUtils]: 7: Hoare triple {1687#true} assume !!(~b~0 < 6);~c~0 := 0; {1692#(= main_~c~0 0)} is VALID [2022-04-15 13:14:40,044 INFO L290 TraceCheckUtils]: 8: Hoare triple {1692#(= main_~c~0 0)} assume !!(~c~0 < 6); {1692#(= main_~c~0 0)} is VALID [2022-04-15 13:14:40,044 INFO L290 TraceCheckUtils]: 9: Hoare triple {1692#(= main_~c~0 0)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {1693#(<= main_~c~0 1)} is VALID [2022-04-15 13:14:40,045 INFO L290 TraceCheckUtils]: 10: Hoare triple {1693#(<= main_~c~0 1)} assume !!(~c~0 < 6); {1693#(<= main_~c~0 1)} is VALID [2022-04-15 13:14:40,045 INFO L290 TraceCheckUtils]: 11: Hoare triple {1693#(<= main_~c~0 1)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {1694#(<= main_~c~0 2)} is VALID [2022-04-15 13:14:40,046 INFO L290 TraceCheckUtils]: 12: Hoare triple {1694#(<= main_~c~0 2)} assume !(~c~0 < 6); {1688#false} is VALID [2022-04-15 13:14:40,046 INFO L290 TraceCheckUtils]: 13: Hoare triple {1688#false} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {1688#false} is VALID [2022-04-15 13:14:40,046 INFO L290 TraceCheckUtils]: 14: Hoare triple {1688#false} assume !!(~b~0 < 6);~c~0 := 0; {1688#false} is VALID [2022-04-15 13:14:40,046 INFO L290 TraceCheckUtils]: 15: Hoare triple {1688#false} assume !!(~c~0 < 6); {1688#false} is VALID [2022-04-15 13:14:40,046 INFO L290 TraceCheckUtils]: 16: Hoare triple {1688#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {1688#false} is VALID [2022-04-15 13:14:40,046 INFO L290 TraceCheckUtils]: 17: Hoare triple {1688#false} assume !!(~c~0 < 6); {1688#false} is VALID [2022-04-15 13:14:40,046 INFO L290 TraceCheckUtils]: 18: Hoare triple {1688#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {1688#false} is VALID [2022-04-15 13:14:40,047 INFO L290 TraceCheckUtils]: 19: Hoare triple {1688#false} assume !(~c~0 < 6); {1688#false} is VALID [2022-04-15 13:14:40,047 INFO L290 TraceCheckUtils]: 20: Hoare triple {1688#false} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {1688#false} is VALID [2022-04-15 13:14:40,047 INFO L290 TraceCheckUtils]: 21: Hoare triple {1688#false} assume !(~b~0 < 6); {1688#false} is VALID [2022-04-15 13:14:40,047 INFO L290 TraceCheckUtils]: 22: Hoare triple {1688#false} #t~pre4 := 1 + ~a~0;~a~0 := 1 + ~a~0;havoc #t~pre4; {1688#false} is VALID [2022-04-15 13:14:40,047 INFO L290 TraceCheckUtils]: 23: Hoare triple {1688#false} assume !!(~a~0 < 6);~b~0 := 0; {1688#false} is VALID [2022-04-15 13:14:40,047 INFO L290 TraceCheckUtils]: 24: Hoare triple {1688#false} assume !!(~b~0 < 6);~c~0 := 0; {1688#false} is VALID [2022-04-15 13:14:40,047 INFO L290 TraceCheckUtils]: 25: Hoare triple {1688#false} assume !!(~c~0 < 6); {1688#false} is VALID [2022-04-15 13:14:40,047 INFO L290 TraceCheckUtils]: 26: Hoare triple {1688#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {1688#false} is VALID [2022-04-15 13:14:40,048 INFO L290 TraceCheckUtils]: 27: Hoare triple {1688#false} assume !!(~c~0 < 6); {1688#false} is VALID [2022-04-15 13:14:40,048 INFO L290 TraceCheckUtils]: 28: Hoare triple {1688#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {1688#false} is VALID [2022-04-15 13:14:40,048 INFO L290 TraceCheckUtils]: 29: Hoare triple {1688#false} assume !(~c~0 < 6); {1688#false} is VALID [2022-04-15 13:14:40,048 INFO L290 TraceCheckUtils]: 30: Hoare triple {1688#false} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {1688#false} is VALID [2022-04-15 13:14:40,048 INFO L290 TraceCheckUtils]: 31: Hoare triple {1688#false} assume !!(~b~0 < 6);~c~0 := 0; {1688#false} is VALID [2022-04-15 13:14:40,048 INFO L290 TraceCheckUtils]: 32: Hoare triple {1688#false} assume !!(~c~0 < 6); {1688#false} is VALID [2022-04-15 13:14:40,048 INFO L290 TraceCheckUtils]: 33: Hoare triple {1688#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {1688#false} is VALID [2022-04-15 13:14:40,048 INFO L290 TraceCheckUtils]: 34: Hoare triple {1688#false} assume !!(~c~0 < 6); {1688#false} is VALID [2022-04-15 13:14:40,048 INFO L290 TraceCheckUtils]: 35: Hoare triple {1688#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {1688#false} is VALID [2022-04-15 13:14:40,049 INFO L290 TraceCheckUtils]: 36: Hoare triple {1688#false} assume !(~c~0 < 6); {1688#false} is VALID [2022-04-15 13:14:40,049 INFO L290 TraceCheckUtils]: 37: Hoare triple {1688#false} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {1688#false} is VALID [2022-04-15 13:14:40,049 INFO L290 TraceCheckUtils]: 38: Hoare triple {1688#false} assume !(~b~0 < 6); {1688#false} is VALID [2022-04-15 13:14:40,049 INFO L290 TraceCheckUtils]: 39: Hoare triple {1688#false} #t~pre4 := 1 + ~a~0;~a~0 := 1 + ~a~0;havoc #t~pre4; {1688#false} is VALID [2022-04-15 13:14:40,049 INFO L290 TraceCheckUtils]: 40: Hoare triple {1688#false} assume !(~a~0 < 6); {1688#false} is VALID [2022-04-15 13:14:40,049 INFO L290 TraceCheckUtils]: 41: Hoare triple {1688#false} assume !((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0); {1688#false} is VALID [2022-04-15 13:14:40,049 INFO L290 TraceCheckUtils]: 42: Hoare triple {1688#false} assume !false; {1688#false} is VALID [2022-04-15 13:14:40,050 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 46 proven. 4 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2022-04-15 13:14:40,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:14:40,050 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [189328314] [2022-04-15 13:14:40,050 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [189328314] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 13:14:40,050 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1710854687] [2022-04-15 13:14:40,050 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 13:14:40,050 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 13:14:40,051 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 13:14:40,052 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 13:14:40,060 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-04-15 13:14:40,099 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 13:14:40,100 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 13:14:40,100 INFO L263 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 4 conjunts are in the unsatisfiable core [2022-04-15 13:14:40,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:14:40,110 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 13:14:40,211 INFO L272 TraceCheckUtils]: 0: Hoare triple {1687#true} call ULTIMATE.init(); {1687#true} is VALID [2022-04-15 13:14:40,211 INFO L290 TraceCheckUtils]: 1: Hoare triple {1687#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); {1687#true} is VALID [2022-04-15 13:14:40,211 INFO L290 TraceCheckUtils]: 2: Hoare triple {1687#true} assume true; {1687#true} is VALID [2022-04-15 13:14:40,211 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1687#true} {1687#true} #56#return; {1687#true} is VALID [2022-04-15 13:14:40,211 INFO L272 TraceCheckUtils]: 4: Hoare triple {1687#true} call #t~ret7 := main(); {1687#true} is VALID [2022-04-15 13:14:40,211 INFO L290 TraceCheckUtils]: 5: Hoare triple {1687#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~a~0 := 0; {1687#true} is VALID [2022-04-15 13:14:40,212 INFO L290 TraceCheckUtils]: 6: Hoare triple {1687#true} assume !!(~a~0 < 6);~b~0 := 0; {1687#true} is VALID [2022-04-15 13:14:40,212 INFO L290 TraceCheckUtils]: 7: Hoare triple {1687#true} assume !!(~b~0 < 6);~c~0 := 0; {1720#(<= main_~c~0 0)} is VALID [2022-04-15 13:14:40,212 INFO L290 TraceCheckUtils]: 8: Hoare triple {1720#(<= main_~c~0 0)} assume !!(~c~0 < 6); {1720#(<= main_~c~0 0)} is VALID [2022-04-15 13:14:40,213 INFO L290 TraceCheckUtils]: 9: Hoare triple {1720#(<= main_~c~0 0)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {1693#(<= main_~c~0 1)} is VALID [2022-04-15 13:14:40,213 INFO L290 TraceCheckUtils]: 10: Hoare triple {1693#(<= main_~c~0 1)} assume !!(~c~0 < 6); {1693#(<= main_~c~0 1)} is VALID [2022-04-15 13:14:40,215 INFO L290 TraceCheckUtils]: 11: Hoare triple {1693#(<= main_~c~0 1)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {1694#(<= main_~c~0 2)} is VALID [2022-04-15 13:14:40,215 INFO L290 TraceCheckUtils]: 12: Hoare triple {1694#(<= main_~c~0 2)} assume !(~c~0 < 6); {1688#false} is VALID [2022-04-15 13:14:40,215 INFO L290 TraceCheckUtils]: 13: Hoare triple {1688#false} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {1688#false} is VALID [2022-04-15 13:14:40,215 INFO L290 TraceCheckUtils]: 14: Hoare triple {1688#false} assume !!(~b~0 < 6);~c~0 := 0; {1688#false} is VALID [2022-04-15 13:14:40,215 INFO L290 TraceCheckUtils]: 15: Hoare triple {1688#false} assume !!(~c~0 < 6); {1688#false} is VALID [2022-04-15 13:14:40,215 INFO L290 TraceCheckUtils]: 16: Hoare triple {1688#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {1688#false} is VALID [2022-04-15 13:14:40,216 INFO L290 TraceCheckUtils]: 17: Hoare triple {1688#false} assume !!(~c~0 < 6); {1688#false} is VALID [2022-04-15 13:14:40,216 INFO L290 TraceCheckUtils]: 18: Hoare triple {1688#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {1688#false} is VALID [2022-04-15 13:14:40,216 INFO L290 TraceCheckUtils]: 19: Hoare triple {1688#false} assume !(~c~0 < 6); {1688#false} is VALID [2022-04-15 13:14:40,216 INFO L290 TraceCheckUtils]: 20: Hoare triple {1688#false} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {1688#false} is VALID [2022-04-15 13:14:40,216 INFO L290 TraceCheckUtils]: 21: Hoare triple {1688#false} assume !(~b~0 < 6); {1688#false} is VALID [2022-04-15 13:14:40,216 INFO L290 TraceCheckUtils]: 22: Hoare triple {1688#false} #t~pre4 := 1 + ~a~0;~a~0 := 1 + ~a~0;havoc #t~pre4; {1688#false} is VALID [2022-04-15 13:14:40,216 INFO L290 TraceCheckUtils]: 23: Hoare triple {1688#false} assume !!(~a~0 < 6);~b~0 := 0; {1688#false} is VALID [2022-04-15 13:14:40,216 INFO L290 TraceCheckUtils]: 24: Hoare triple {1688#false} assume !!(~b~0 < 6);~c~0 := 0; {1688#false} is VALID [2022-04-15 13:14:40,217 INFO L290 TraceCheckUtils]: 25: Hoare triple {1688#false} assume !!(~c~0 < 6); {1688#false} is VALID [2022-04-15 13:14:40,217 INFO L290 TraceCheckUtils]: 26: Hoare triple {1688#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {1688#false} is VALID [2022-04-15 13:14:40,217 INFO L290 TraceCheckUtils]: 27: Hoare triple {1688#false} assume !!(~c~0 < 6); {1688#false} is VALID [2022-04-15 13:14:40,217 INFO L290 TraceCheckUtils]: 28: Hoare triple {1688#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {1688#false} is VALID [2022-04-15 13:14:40,217 INFO L290 TraceCheckUtils]: 29: Hoare triple {1688#false} assume !(~c~0 < 6); {1688#false} is VALID [2022-04-15 13:14:40,217 INFO L290 TraceCheckUtils]: 30: Hoare triple {1688#false} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {1688#false} is VALID [2022-04-15 13:14:40,217 INFO L290 TraceCheckUtils]: 31: Hoare triple {1688#false} assume !!(~b~0 < 6);~c~0 := 0; {1688#false} is VALID [2022-04-15 13:14:40,217 INFO L290 TraceCheckUtils]: 32: Hoare triple {1688#false} assume !!(~c~0 < 6); {1688#false} is VALID [2022-04-15 13:14:40,218 INFO L290 TraceCheckUtils]: 33: Hoare triple {1688#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {1688#false} is VALID [2022-04-15 13:14:40,218 INFO L290 TraceCheckUtils]: 34: Hoare triple {1688#false} assume !!(~c~0 < 6); {1688#false} is VALID [2022-04-15 13:14:40,218 INFO L290 TraceCheckUtils]: 35: Hoare triple {1688#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {1688#false} is VALID [2022-04-15 13:14:40,218 INFO L290 TraceCheckUtils]: 36: Hoare triple {1688#false} assume !(~c~0 < 6); {1688#false} is VALID [2022-04-15 13:14:40,218 INFO L290 TraceCheckUtils]: 37: Hoare triple {1688#false} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {1688#false} is VALID [2022-04-15 13:14:40,218 INFO L290 TraceCheckUtils]: 38: Hoare triple {1688#false} assume !(~b~0 < 6); {1688#false} is VALID [2022-04-15 13:14:40,218 INFO L290 TraceCheckUtils]: 39: Hoare triple {1688#false} #t~pre4 := 1 + ~a~0;~a~0 := 1 + ~a~0;havoc #t~pre4; {1688#false} is VALID [2022-04-15 13:14:40,218 INFO L290 TraceCheckUtils]: 40: Hoare triple {1688#false} assume !(~a~0 < 6); {1688#false} is VALID [2022-04-15 13:14:40,218 INFO L290 TraceCheckUtils]: 41: Hoare triple {1688#false} assume !((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0); {1688#false} is VALID [2022-04-15 13:14:40,219 INFO L290 TraceCheckUtils]: 42: Hoare triple {1688#false} assume !false; {1688#false} is VALID [2022-04-15 13:14:40,219 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 46 proven. 4 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2022-04-15 13:14:40,219 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 13:14:40,354 INFO L290 TraceCheckUtils]: 42: Hoare triple {1688#false} assume !false; {1688#false} is VALID [2022-04-15 13:14:40,355 INFO L290 TraceCheckUtils]: 41: Hoare triple {1688#false} assume !((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0); {1688#false} is VALID [2022-04-15 13:14:40,355 INFO L290 TraceCheckUtils]: 40: Hoare triple {1688#false} assume !(~a~0 < 6); {1688#false} is VALID [2022-04-15 13:14:40,355 INFO L290 TraceCheckUtils]: 39: Hoare triple {1688#false} #t~pre4 := 1 + ~a~0;~a~0 := 1 + ~a~0;havoc #t~pre4; {1688#false} is VALID [2022-04-15 13:14:40,355 INFO L290 TraceCheckUtils]: 38: Hoare triple {1688#false} assume !(~b~0 < 6); {1688#false} is VALID [2022-04-15 13:14:40,355 INFO L290 TraceCheckUtils]: 37: Hoare triple {1688#false} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {1688#false} is VALID [2022-04-15 13:14:40,355 INFO L290 TraceCheckUtils]: 36: Hoare triple {1688#false} assume !(~c~0 < 6); {1688#false} is VALID [2022-04-15 13:14:40,355 INFO L290 TraceCheckUtils]: 35: Hoare triple {1688#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {1688#false} is VALID [2022-04-15 13:14:40,355 INFO L290 TraceCheckUtils]: 34: Hoare triple {1688#false} assume !!(~c~0 < 6); {1688#false} is VALID [2022-04-15 13:14:40,355 INFO L290 TraceCheckUtils]: 33: Hoare triple {1688#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {1688#false} is VALID [2022-04-15 13:14:40,355 INFO L290 TraceCheckUtils]: 32: Hoare triple {1688#false} assume !!(~c~0 < 6); {1688#false} is VALID [2022-04-15 13:14:40,355 INFO L290 TraceCheckUtils]: 31: Hoare triple {1688#false} assume !!(~b~0 < 6);~c~0 := 0; {1688#false} is VALID [2022-04-15 13:14:40,356 INFO L290 TraceCheckUtils]: 30: Hoare triple {1688#false} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {1688#false} is VALID [2022-04-15 13:14:40,356 INFO L290 TraceCheckUtils]: 29: Hoare triple {1688#false} assume !(~c~0 < 6); {1688#false} is VALID [2022-04-15 13:14:40,356 INFO L290 TraceCheckUtils]: 28: Hoare triple {1688#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {1688#false} is VALID [2022-04-15 13:14:40,356 INFO L290 TraceCheckUtils]: 27: Hoare triple {1688#false} assume !!(~c~0 < 6); {1688#false} is VALID [2022-04-15 13:14:40,356 INFO L290 TraceCheckUtils]: 26: Hoare triple {1688#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {1688#false} is VALID [2022-04-15 13:14:40,356 INFO L290 TraceCheckUtils]: 25: Hoare triple {1688#false} assume !!(~c~0 < 6); {1688#false} is VALID [2022-04-15 13:14:40,356 INFO L290 TraceCheckUtils]: 24: Hoare triple {1688#false} assume !!(~b~0 < 6);~c~0 := 0; {1688#false} is VALID [2022-04-15 13:14:40,356 INFO L290 TraceCheckUtils]: 23: Hoare triple {1688#false} assume !!(~a~0 < 6);~b~0 := 0; {1688#false} is VALID [2022-04-15 13:14:40,356 INFO L290 TraceCheckUtils]: 22: Hoare triple {1688#false} #t~pre4 := 1 + ~a~0;~a~0 := 1 + ~a~0;havoc #t~pre4; {1688#false} is VALID [2022-04-15 13:14:40,356 INFO L290 TraceCheckUtils]: 21: Hoare triple {1688#false} assume !(~b~0 < 6); {1688#false} is VALID [2022-04-15 13:14:40,357 INFO L290 TraceCheckUtils]: 20: Hoare triple {1688#false} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {1688#false} is VALID [2022-04-15 13:14:40,357 INFO L290 TraceCheckUtils]: 19: Hoare triple {1688#false} assume !(~c~0 < 6); {1688#false} is VALID [2022-04-15 13:14:40,357 INFO L290 TraceCheckUtils]: 18: Hoare triple {1688#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {1688#false} is VALID [2022-04-15 13:14:40,357 INFO L290 TraceCheckUtils]: 17: Hoare triple {1688#false} assume !!(~c~0 < 6); {1688#false} is VALID [2022-04-15 13:14:40,357 INFO L290 TraceCheckUtils]: 16: Hoare triple {1688#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {1688#false} is VALID [2022-04-15 13:14:40,357 INFO L290 TraceCheckUtils]: 15: Hoare triple {1688#false} assume !!(~c~0 < 6); {1688#false} is VALID [2022-04-15 13:14:40,357 INFO L290 TraceCheckUtils]: 14: Hoare triple {1688#false} assume !!(~b~0 < 6);~c~0 := 0; {1688#false} is VALID [2022-04-15 13:14:40,357 INFO L290 TraceCheckUtils]: 13: Hoare triple {1688#false} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {1688#false} is VALID [2022-04-15 13:14:40,359 INFO L290 TraceCheckUtils]: 12: Hoare triple {1916#(< main_~c~0 6)} assume !(~c~0 < 6); {1688#false} is VALID [2022-04-15 13:14:40,363 INFO L290 TraceCheckUtils]: 11: Hoare triple {1920#(< main_~c~0 5)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {1916#(< main_~c~0 6)} is VALID [2022-04-15 13:14:40,363 INFO L290 TraceCheckUtils]: 10: Hoare triple {1920#(< main_~c~0 5)} assume !!(~c~0 < 6); {1920#(< main_~c~0 5)} is VALID [2022-04-15 13:14:40,365 INFO L290 TraceCheckUtils]: 9: Hoare triple {1927#(< main_~c~0 4)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {1920#(< main_~c~0 5)} is VALID [2022-04-15 13:14:40,365 INFO L290 TraceCheckUtils]: 8: Hoare triple {1927#(< main_~c~0 4)} assume !!(~c~0 < 6); {1927#(< main_~c~0 4)} is VALID [2022-04-15 13:14:40,365 INFO L290 TraceCheckUtils]: 7: Hoare triple {1687#true} assume !!(~b~0 < 6);~c~0 := 0; {1927#(< main_~c~0 4)} is VALID [2022-04-15 13:14:40,366 INFO L290 TraceCheckUtils]: 6: Hoare triple {1687#true} assume !!(~a~0 < 6);~b~0 := 0; {1687#true} is VALID [2022-04-15 13:14:40,366 INFO L290 TraceCheckUtils]: 5: Hoare triple {1687#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~a~0 := 0; {1687#true} is VALID [2022-04-15 13:14:40,366 INFO L272 TraceCheckUtils]: 4: Hoare triple {1687#true} call #t~ret7 := main(); {1687#true} is VALID [2022-04-15 13:14:40,366 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1687#true} {1687#true} #56#return; {1687#true} is VALID [2022-04-15 13:14:40,366 INFO L290 TraceCheckUtils]: 2: Hoare triple {1687#true} assume true; {1687#true} is VALID [2022-04-15 13:14:40,366 INFO L290 TraceCheckUtils]: 1: Hoare triple {1687#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); {1687#true} is VALID [2022-04-15 13:14:40,366 INFO L272 TraceCheckUtils]: 0: Hoare triple {1687#true} call ULTIMATE.init(); {1687#true} is VALID [2022-04-15 13:14:40,367 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 46 proven. 4 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2022-04-15 13:14:40,367 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1710854687] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 13:14:40,367 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 13:14:40,367 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 10 [2022-04-15 13:14:40,367 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:14:40,367 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1452451264] [2022-04-15 13:14:40,368 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1452451264] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:14:40,368 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:14:40,368 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 13:14:40,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1400279045] [2022-04-15 13:14:40,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:14:40,368 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 43 [2022-04-15 13:14:40,369 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:14:40,369 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:14:40,386 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:14:40,386 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 13:14:40,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:14:40,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 13:14:40,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2022-04-15 13:14:40,387 INFO L87 Difference]: Start difference. First operand 44 states and 50 transitions. Second operand has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:14:40,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:14:40,522 INFO L93 Difference]: Finished difference Result 87 states and 102 transitions. [2022-04-15 13:14:40,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-15 13:14:40,523 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 43 [2022-04-15 13:14:40,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:14:40,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:14:40,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 35 transitions. [2022-04-15 13:14:40,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:14:40,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 35 transitions. [2022-04-15 13:14:40,525 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 35 transitions. [2022-04-15 13:14:40,555 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:14:40,556 INFO L225 Difference]: With dead ends: 87 [2022-04-15 13:14:40,556 INFO L226 Difference]: Without dead ends: 56 [2022-04-15 13:14:40,557 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=66, Invalid=90, Unknown=0, NotChecked=0, Total=156 [2022-04-15 13:14:40,557 INFO L913 BasicCegarLoop]: 15 mSDtfsCounter, 18 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 13:14:40,558 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [18 Valid, 32 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 13:14:40,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2022-04-15 13:14:40,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 52. [2022-04-15 13:14:40,596 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:14:40,597 INFO L82 GeneralOperation]: Start isEquivalent. First operand 56 states. Second operand has 52 states, 48 states have (on average 1.1458333333333333) internal successors, (55), 48 states have internal predecessors, (55), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:14:40,597 INFO L74 IsIncluded]: Start isIncluded. First operand 56 states. Second operand has 52 states, 48 states have (on average 1.1458333333333333) internal successors, (55), 48 states have internal predecessors, (55), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:14:40,597 INFO L87 Difference]: Start difference. First operand 56 states. Second operand has 52 states, 48 states have (on average 1.1458333333333333) internal successors, (55), 48 states have internal predecessors, (55), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:14:40,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:14:40,599 INFO L93 Difference]: Finished difference Result 56 states and 62 transitions. [2022-04-15 13:14:40,599 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 62 transitions. [2022-04-15 13:14:40,599 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:14:40,599 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:14:40,599 INFO L74 IsIncluded]: Start isIncluded. First operand has 52 states, 48 states have (on average 1.1458333333333333) internal successors, (55), 48 states have internal predecessors, (55), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 56 states. [2022-04-15 13:14:40,600 INFO L87 Difference]: Start difference. First operand has 52 states, 48 states have (on average 1.1458333333333333) internal successors, (55), 48 states have internal predecessors, (55), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 56 states. [2022-04-15 13:14:40,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:14:40,601 INFO L93 Difference]: Finished difference Result 56 states and 62 transitions. [2022-04-15 13:14:40,601 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 62 transitions. [2022-04-15 13:14:40,601 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:14:40,602 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:14:40,602 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:14:40,602 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:14:40,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 48 states have (on average 1.1458333333333333) internal successors, (55), 48 states have internal predecessors, (55), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:14:40,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 58 transitions. [2022-04-15 13:14:40,603 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 58 transitions. Word has length 43 [2022-04-15 13:14:40,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:14:40,604 INFO L478 AbstractCegarLoop]: Abstraction has 52 states and 58 transitions. [2022-04-15 13:14:40,604 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:14:40,604 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 52 states and 58 transitions. [2022-04-15 13:14:40,662 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:14:40,663 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 58 transitions. [2022-04-15 13:14:40,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-04-15 13:14:40,663 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:14:40,664 INFO L499 BasicCegarLoop]: trace histogram [12, 12, 4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 13:14:40,689 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-04-15 13:14:40,886 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,SelfDestructingSolverStorable12,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 13:14:40,886 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:14:40,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:14:40,887 INFO L85 PathProgramCache]: Analyzing trace with hash 735564927, now seen corresponding path program 9 times [2022-04-15 13:14:40,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:14:40,887 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [234958740] [2022-04-15 13:14:41,513 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 13:14:41,514 INFO L85 PathProgramCache]: Analyzing trace with hash 1694307855, now seen corresponding path program 1 times [2022-04-15 13:14:41,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:14:41,514 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [348375796] [2022-04-15 13:14:41,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:14:41,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:14:41,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 13:14:41,519 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 13:14:41,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 13:14:41,523 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 13:14:41,523 INFO L85 PathProgramCache]: Analyzing trace with hash 735564927, now seen corresponding path program 10 times [2022-04-15 13:14:41,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:14:41,524 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1565726906] [2022-04-15 13:14:41,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:14:41,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:14:41,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:14:41,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 13:14:41,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:14:41,575 INFO L290 TraceCheckUtils]: 0: Hoare triple {2362#(and (= |#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); {2353#true} is VALID [2022-04-15 13:14:41,575 INFO L290 TraceCheckUtils]: 1: Hoare triple {2353#true} assume true; {2353#true} is VALID [2022-04-15 13:14:41,575 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2353#true} {2353#true} #56#return; {2353#true} is VALID [2022-04-15 13:14:41,575 INFO L272 TraceCheckUtils]: 0: Hoare triple {2353#true} call ULTIMATE.init(); {2362#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 13:14:41,576 INFO L290 TraceCheckUtils]: 1: Hoare triple {2362#(and (= |#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); {2353#true} is VALID [2022-04-15 13:14:41,576 INFO L290 TraceCheckUtils]: 2: Hoare triple {2353#true} assume true; {2353#true} is VALID [2022-04-15 13:14:41,576 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2353#true} {2353#true} #56#return; {2353#true} is VALID [2022-04-15 13:14:41,576 INFO L272 TraceCheckUtils]: 4: Hoare triple {2353#true} call #t~ret7 := main(); {2353#true} is VALID [2022-04-15 13:14:41,576 INFO L290 TraceCheckUtils]: 5: Hoare triple {2353#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~a~0 := 0; {2353#true} is VALID [2022-04-15 13:14:41,576 INFO L290 TraceCheckUtils]: 6: Hoare triple {2353#true} assume !!(~a~0 < 6);~b~0 := 0; {2353#true} is VALID [2022-04-15 13:14:41,576 INFO L290 TraceCheckUtils]: 7: Hoare triple {2353#true} assume !!(~b~0 < 6);~c~0 := 0; {2358#(= main_~c~0 0)} is VALID [2022-04-15 13:14:41,577 INFO L290 TraceCheckUtils]: 8: Hoare triple {2358#(= main_~c~0 0)} assume !!(~c~0 < 6); {2358#(= main_~c~0 0)} is VALID [2022-04-15 13:14:41,577 INFO L290 TraceCheckUtils]: 9: Hoare triple {2358#(= main_~c~0 0)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {2359#(<= main_~c~0 1)} is VALID [2022-04-15 13:14:41,577 INFO L290 TraceCheckUtils]: 10: Hoare triple {2359#(<= main_~c~0 1)} assume !!(~c~0 < 6); {2359#(<= main_~c~0 1)} is VALID [2022-04-15 13:14:41,578 INFO L290 TraceCheckUtils]: 11: Hoare triple {2359#(<= main_~c~0 1)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {2360#(<= main_~c~0 2)} is VALID [2022-04-15 13:14:41,578 INFO L290 TraceCheckUtils]: 12: Hoare triple {2360#(<= main_~c~0 2)} assume !!(~c~0 < 6); {2360#(<= main_~c~0 2)} is VALID [2022-04-15 13:14:41,579 INFO L290 TraceCheckUtils]: 13: Hoare triple {2360#(<= main_~c~0 2)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {2361#(<= main_~c~0 3)} is VALID [2022-04-15 13:14:41,579 INFO L290 TraceCheckUtils]: 14: Hoare triple {2361#(<= main_~c~0 3)} assume !(~c~0 < 6); {2354#false} is VALID [2022-04-15 13:14:41,579 INFO L290 TraceCheckUtils]: 15: Hoare triple {2354#false} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {2354#false} is VALID [2022-04-15 13:14:41,579 INFO L290 TraceCheckUtils]: 16: Hoare triple {2354#false} assume !!(~b~0 < 6);~c~0 := 0; {2354#false} is VALID [2022-04-15 13:14:41,579 INFO L290 TraceCheckUtils]: 17: Hoare triple {2354#false} assume !!(~c~0 < 6); {2354#false} is VALID [2022-04-15 13:14:41,580 INFO L290 TraceCheckUtils]: 18: Hoare triple {2354#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {2354#false} is VALID [2022-04-15 13:14:41,580 INFO L290 TraceCheckUtils]: 19: Hoare triple {2354#false} assume !!(~c~0 < 6); {2354#false} is VALID [2022-04-15 13:14:41,580 INFO L290 TraceCheckUtils]: 20: Hoare triple {2354#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {2354#false} is VALID [2022-04-15 13:14:41,580 INFO L290 TraceCheckUtils]: 21: Hoare triple {2354#false} assume !!(~c~0 < 6); {2354#false} is VALID [2022-04-15 13:14:41,580 INFO L290 TraceCheckUtils]: 22: Hoare triple {2354#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {2354#false} is VALID [2022-04-15 13:14:41,580 INFO L290 TraceCheckUtils]: 23: Hoare triple {2354#false} assume !(~c~0 < 6); {2354#false} is VALID [2022-04-15 13:14:41,580 INFO L290 TraceCheckUtils]: 24: Hoare triple {2354#false} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {2354#false} is VALID [2022-04-15 13:14:41,580 INFO L290 TraceCheckUtils]: 25: Hoare triple {2354#false} assume !(~b~0 < 6); {2354#false} is VALID [2022-04-15 13:14:41,580 INFO L290 TraceCheckUtils]: 26: Hoare triple {2354#false} #t~pre4 := 1 + ~a~0;~a~0 := 1 + ~a~0;havoc #t~pre4; {2354#false} is VALID [2022-04-15 13:14:41,581 INFO L290 TraceCheckUtils]: 27: Hoare triple {2354#false} assume !!(~a~0 < 6);~b~0 := 0; {2354#false} is VALID [2022-04-15 13:14:41,581 INFO L290 TraceCheckUtils]: 28: Hoare triple {2354#false} assume !!(~b~0 < 6);~c~0 := 0; {2354#false} is VALID [2022-04-15 13:14:41,581 INFO L290 TraceCheckUtils]: 29: Hoare triple {2354#false} assume !!(~c~0 < 6); {2354#false} is VALID [2022-04-15 13:14:41,581 INFO L290 TraceCheckUtils]: 30: Hoare triple {2354#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {2354#false} is VALID [2022-04-15 13:14:41,581 INFO L290 TraceCheckUtils]: 31: Hoare triple {2354#false} assume !!(~c~0 < 6); {2354#false} is VALID [2022-04-15 13:14:41,581 INFO L290 TraceCheckUtils]: 32: Hoare triple {2354#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {2354#false} is VALID [2022-04-15 13:14:41,581 INFO L290 TraceCheckUtils]: 33: Hoare triple {2354#false} assume !!(~c~0 < 6); {2354#false} is VALID [2022-04-15 13:14:41,581 INFO L290 TraceCheckUtils]: 34: Hoare triple {2354#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {2354#false} is VALID [2022-04-15 13:14:41,581 INFO L290 TraceCheckUtils]: 35: Hoare triple {2354#false} assume !(~c~0 < 6); {2354#false} is VALID [2022-04-15 13:14:41,581 INFO L290 TraceCheckUtils]: 36: Hoare triple {2354#false} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {2354#false} is VALID [2022-04-15 13:14:41,582 INFO L290 TraceCheckUtils]: 37: Hoare triple {2354#false} assume !!(~b~0 < 6);~c~0 := 0; {2354#false} is VALID [2022-04-15 13:14:41,582 INFO L290 TraceCheckUtils]: 38: Hoare triple {2354#false} assume !!(~c~0 < 6); {2354#false} is VALID [2022-04-15 13:14:41,582 INFO L290 TraceCheckUtils]: 39: Hoare triple {2354#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {2354#false} is VALID [2022-04-15 13:14:41,582 INFO L290 TraceCheckUtils]: 40: Hoare triple {2354#false} assume !!(~c~0 < 6); {2354#false} is VALID [2022-04-15 13:14:41,582 INFO L290 TraceCheckUtils]: 41: Hoare triple {2354#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {2354#false} is VALID [2022-04-15 13:14:41,582 INFO L290 TraceCheckUtils]: 42: Hoare triple {2354#false} assume !!(~c~0 < 6); {2354#false} is VALID [2022-04-15 13:14:41,582 INFO L290 TraceCheckUtils]: 43: Hoare triple {2354#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {2354#false} is VALID [2022-04-15 13:14:41,582 INFO L290 TraceCheckUtils]: 44: Hoare triple {2354#false} assume !(~c~0 < 6); {2354#false} is VALID [2022-04-15 13:14:41,582 INFO L290 TraceCheckUtils]: 45: Hoare triple {2354#false} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {2354#false} is VALID [2022-04-15 13:14:41,583 INFO L290 TraceCheckUtils]: 46: Hoare triple {2354#false} assume !(~b~0 < 6); {2354#false} is VALID [2022-04-15 13:14:41,583 INFO L290 TraceCheckUtils]: 47: Hoare triple {2354#false} #t~pre4 := 1 + ~a~0;~a~0 := 1 + ~a~0;havoc #t~pre4; {2354#false} is VALID [2022-04-15 13:14:41,583 INFO L290 TraceCheckUtils]: 48: Hoare triple {2354#false} assume !(~a~0 < 6); {2354#false} is VALID [2022-04-15 13:14:41,583 INFO L290 TraceCheckUtils]: 49: Hoare triple {2354#false} assume !((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0); {2354#false} is VALID [2022-04-15 13:14:41,583 INFO L290 TraceCheckUtils]: 50: Hoare triple {2354#false} assume !false; {2354#false} is VALID [2022-04-15 13:14:41,583 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 82 proven. 9 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2022-04-15 13:14:41,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:14:41,584 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1565726906] [2022-04-15 13:14:41,584 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1565726906] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 13:14:41,584 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [625607087] [2022-04-15 13:14:41,584 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 13:14:41,584 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 13:14:41,584 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 13:14:41,585 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 13:14:41,597 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-04-15 13:14:41,646 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 13:14:41,646 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 13:14:41,651 INFO L263 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-15 13:14:41,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:14:41,662 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 13:14:41,785 INFO L272 TraceCheckUtils]: 0: Hoare triple {2353#true} call ULTIMATE.init(); {2353#true} is VALID [2022-04-15 13:14:41,785 INFO L290 TraceCheckUtils]: 1: Hoare triple {2353#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); {2353#true} is VALID [2022-04-15 13:14:41,786 INFO L290 TraceCheckUtils]: 2: Hoare triple {2353#true} assume true; {2353#true} is VALID [2022-04-15 13:14:41,786 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2353#true} {2353#true} #56#return; {2353#true} is VALID [2022-04-15 13:14:41,786 INFO L272 TraceCheckUtils]: 4: Hoare triple {2353#true} call #t~ret7 := main(); {2353#true} is VALID [2022-04-15 13:14:41,786 INFO L290 TraceCheckUtils]: 5: Hoare triple {2353#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~a~0 := 0; {2353#true} is VALID [2022-04-15 13:14:41,786 INFO L290 TraceCheckUtils]: 6: Hoare triple {2353#true} assume !!(~a~0 < 6);~b~0 := 0; {2353#true} is VALID [2022-04-15 13:14:41,786 INFO L290 TraceCheckUtils]: 7: Hoare triple {2353#true} assume !!(~b~0 < 6);~c~0 := 0; {2387#(<= main_~c~0 0)} is VALID [2022-04-15 13:14:41,786 INFO L290 TraceCheckUtils]: 8: Hoare triple {2387#(<= main_~c~0 0)} assume !!(~c~0 < 6); {2387#(<= main_~c~0 0)} is VALID [2022-04-15 13:14:41,787 INFO L290 TraceCheckUtils]: 9: Hoare triple {2387#(<= main_~c~0 0)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {2359#(<= main_~c~0 1)} is VALID [2022-04-15 13:14:41,787 INFO L290 TraceCheckUtils]: 10: Hoare triple {2359#(<= main_~c~0 1)} assume !!(~c~0 < 6); {2359#(<= main_~c~0 1)} is VALID [2022-04-15 13:14:41,788 INFO L290 TraceCheckUtils]: 11: Hoare triple {2359#(<= main_~c~0 1)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {2360#(<= main_~c~0 2)} is VALID [2022-04-15 13:14:41,788 INFO L290 TraceCheckUtils]: 12: Hoare triple {2360#(<= main_~c~0 2)} assume !!(~c~0 < 6); {2360#(<= main_~c~0 2)} is VALID [2022-04-15 13:14:41,788 INFO L290 TraceCheckUtils]: 13: Hoare triple {2360#(<= main_~c~0 2)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {2361#(<= main_~c~0 3)} is VALID [2022-04-15 13:14:41,789 INFO L290 TraceCheckUtils]: 14: Hoare triple {2361#(<= main_~c~0 3)} assume !(~c~0 < 6); {2354#false} is VALID [2022-04-15 13:14:41,789 INFO L290 TraceCheckUtils]: 15: Hoare triple {2354#false} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {2354#false} is VALID [2022-04-15 13:14:41,789 INFO L290 TraceCheckUtils]: 16: Hoare triple {2354#false} assume !!(~b~0 < 6);~c~0 := 0; {2354#false} is VALID [2022-04-15 13:14:41,789 INFO L290 TraceCheckUtils]: 17: Hoare triple {2354#false} assume !!(~c~0 < 6); {2354#false} is VALID [2022-04-15 13:14:41,789 INFO L290 TraceCheckUtils]: 18: Hoare triple {2354#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {2354#false} is VALID [2022-04-15 13:14:41,789 INFO L290 TraceCheckUtils]: 19: Hoare triple {2354#false} assume !!(~c~0 < 6); {2354#false} is VALID [2022-04-15 13:14:41,789 INFO L290 TraceCheckUtils]: 20: Hoare triple {2354#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {2354#false} is VALID [2022-04-15 13:14:41,789 INFO L290 TraceCheckUtils]: 21: Hoare triple {2354#false} assume !!(~c~0 < 6); {2354#false} is VALID [2022-04-15 13:14:41,789 INFO L290 TraceCheckUtils]: 22: Hoare triple {2354#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {2354#false} is VALID [2022-04-15 13:14:41,789 INFO L290 TraceCheckUtils]: 23: Hoare triple {2354#false} assume !(~c~0 < 6); {2354#false} is VALID [2022-04-15 13:14:41,789 INFO L290 TraceCheckUtils]: 24: Hoare triple {2354#false} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {2354#false} is VALID [2022-04-15 13:14:41,790 INFO L290 TraceCheckUtils]: 25: Hoare triple {2354#false} assume !(~b~0 < 6); {2354#false} is VALID [2022-04-15 13:14:41,790 INFO L290 TraceCheckUtils]: 26: Hoare triple {2354#false} #t~pre4 := 1 + ~a~0;~a~0 := 1 + ~a~0;havoc #t~pre4; {2354#false} is VALID [2022-04-15 13:14:41,790 INFO L290 TraceCheckUtils]: 27: Hoare triple {2354#false} assume !!(~a~0 < 6);~b~0 := 0; {2354#false} is VALID [2022-04-15 13:14:41,790 INFO L290 TraceCheckUtils]: 28: Hoare triple {2354#false} assume !!(~b~0 < 6);~c~0 := 0; {2354#false} is VALID [2022-04-15 13:14:41,790 INFO L290 TraceCheckUtils]: 29: Hoare triple {2354#false} assume !!(~c~0 < 6); {2354#false} is VALID [2022-04-15 13:14:41,790 INFO L290 TraceCheckUtils]: 30: Hoare triple {2354#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {2354#false} is VALID [2022-04-15 13:14:41,790 INFO L290 TraceCheckUtils]: 31: Hoare triple {2354#false} assume !!(~c~0 < 6); {2354#false} is VALID [2022-04-15 13:14:41,790 INFO L290 TraceCheckUtils]: 32: Hoare triple {2354#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {2354#false} is VALID [2022-04-15 13:14:41,790 INFO L290 TraceCheckUtils]: 33: Hoare triple {2354#false} assume !!(~c~0 < 6); {2354#false} is VALID [2022-04-15 13:14:41,791 INFO L290 TraceCheckUtils]: 34: Hoare triple {2354#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {2354#false} is VALID [2022-04-15 13:14:41,791 INFO L290 TraceCheckUtils]: 35: Hoare triple {2354#false} assume !(~c~0 < 6); {2354#false} is VALID [2022-04-15 13:14:41,791 INFO L290 TraceCheckUtils]: 36: Hoare triple {2354#false} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {2354#false} is VALID [2022-04-15 13:14:41,791 INFO L290 TraceCheckUtils]: 37: Hoare triple {2354#false} assume !!(~b~0 < 6);~c~0 := 0; {2354#false} is VALID [2022-04-15 13:14:41,791 INFO L290 TraceCheckUtils]: 38: Hoare triple {2354#false} assume !!(~c~0 < 6); {2354#false} is VALID [2022-04-15 13:14:41,791 INFO L290 TraceCheckUtils]: 39: Hoare triple {2354#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {2354#false} is VALID [2022-04-15 13:14:41,791 INFO L290 TraceCheckUtils]: 40: Hoare triple {2354#false} assume !!(~c~0 < 6); {2354#false} is VALID [2022-04-15 13:14:41,791 INFO L290 TraceCheckUtils]: 41: Hoare triple {2354#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {2354#false} is VALID [2022-04-15 13:14:41,791 INFO L290 TraceCheckUtils]: 42: Hoare triple {2354#false} assume !!(~c~0 < 6); {2354#false} is VALID [2022-04-15 13:14:41,791 INFO L290 TraceCheckUtils]: 43: Hoare triple {2354#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {2354#false} is VALID [2022-04-15 13:14:41,791 INFO L290 TraceCheckUtils]: 44: Hoare triple {2354#false} assume !(~c~0 < 6); {2354#false} is VALID [2022-04-15 13:14:41,792 INFO L290 TraceCheckUtils]: 45: Hoare triple {2354#false} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {2354#false} is VALID [2022-04-15 13:14:41,792 INFO L290 TraceCheckUtils]: 46: Hoare triple {2354#false} assume !(~b~0 < 6); {2354#false} is VALID [2022-04-15 13:14:41,792 INFO L290 TraceCheckUtils]: 47: Hoare triple {2354#false} #t~pre4 := 1 + ~a~0;~a~0 := 1 + ~a~0;havoc #t~pre4; {2354#false} is VALID [2022-04-15 13:14:41,792 INFO L290 TraceCheckUtils]: 48: Hoare triple {2354#false} assume !(~a~0 < 6); {2354#false} is VALID [2022-04-15 13:14:41,792 INFO L290 TraceCheckUtils]: 49: Hoare triple {2354#false} assume !((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0); {2354#false} is VALID [2022-04-15 13:14:41,792 INFO L290 TraceCheckUtils]: 50: Hoare triple {2354#false} assume !false; {2354#false} is VALID [2022-04-15 13:14:41,792 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 82 proven. 9 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2022-04-15 13:14:41,792 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 13:14:41,957 INFO L290 TraceCheckUtils]: 50: Hoare triple {2354#false} assume !false; {2354#false} is VALID [2022-04-15 13:14:41,957 INFO L290 TraceCheckUtils]: 49: Hoare triple {2354#false} assume !((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0); {2354#false} is VALID [2022-04-15 13:14:41,957 INFO L290 TraceCheckUtils]: 48: Hoare triple {2354#false} assume !(~a~0 < 6); {2354#false} is VALID [2022-04-15 13:14:41,957 INFO L290 TraceCheckUtils]: 47: Hoare triple {2354#false} #t~pre4 := 1 + ~a~0;~a~0 := 1 + ~a~0;havoc #t~pre4; {2354#false} is VALID [2022-04-15 13:14:41,957 INFO L290 TraceCheckUtils]: 46: Hoare triple {2354#false} assume !(~b~0 < 6); {2354#false} is VALID [2022-04-15 13:14:41,957 INFO L290 TraceCheckUtils]: 45: Hoare triple {2354#false} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {2354#false} is VALID [2022-04-15 13:14:41,957 INFO L290 TraceCheckUtils]: 44: Hoare triple {2354#false} assume !(~c~0 < 6); {2354#false} is VALID [2022-04-15 13:14:41,957 INFO L290 TraceCheckUtils]: 43: Hoare triple {2354#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {2354#false} is VALID [2022-04-15 13:14:41,958 INFO L290 TraceCheckUtils]: 42: Hoare triple {2354#false} assume !!(~c~0 < 6); {2354#false} is VALID [2022-04-15 13:14:41,958 INFO L290 TraceCheckUtils]: 41: Hoare triple {2354#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {2354#false} is VALID [2022-04-15 13:14:41,958 INFO L290 TraceCheckUtils]: 40: Hoare triple {2354#false} assume !!(~c~0 < 6); {2354#false} is VALID [2022-04-15 13:14:41,958 INFO L290 TraceCheckUtils]: 39: Hoare triple {2354#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {2354#false} is VALID [2022-04-15 13:14:41,958 INFO L290 TraceCheckUtils]: 38: Hoare triple {2354#false} assume !!(~c~0 < 6); {2354#false} is VALID [2022-04-15 13:14:41,958 INFO L290 TraceCheckUtils]: 37: Hoare triple {2354#false} assume !!(~b~0 < 6);~c~0 := 0; {2354#false} is VALID [2022-04-15 13:14:41,958 INFO L290 TraceCheckUtils]: 36: Hoare triple {2354#false} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {2354#false} is VALID [2022-04-15 13:14:41,958 INFO L290 TraceCheckUtils]: 35: Hoare triple {2354#false} assume !(~c~0 < 6); {2354#false} is VALID [2022-04-15 13:14:41,958 INFO L290 TraceCheckUtils]: 34: Hoare triple {2354#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {2354#false} is VALID [2022-04-15 13:14:41,959 INFO L290 TraceCheckUtils]: 33: Hoare triple {2354#false} assume !!(~c~0 < 6); {2354#false} is VALID [2022-04-15 13:14:41,959 INFO L290 TraceCheckUtils]: 32: Hoare triple {2354#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {2354#false} is VALID [2022-04-15 13:14:41,959 INFO L290 TraceCheckUtils]: 31: Hoare triple {2354#false} assume !!(~c~0 < 6); {2354#false} is VALID [2022-04-15 13:14:41,959 INFO L290 TraceCheckUtils]: 30: Hoare triple {2354#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {2354#false} is VALID [2022-04-15 13:14:41,959 INFO L290 TraceCheckUtils]: 29: Hoare triple {2354#false} assume !!(~c~0 < 6); {2354#false} is VALID [2022-04-15 13:14:41,959 INFO L290 TraceCheckUtils]: 28: Hoare triple {2354#false} assume !!(~b~0 < 6);~c~0 := 0; {2354#false} is VALID [2022-04-15 13:14:41,959 INFO L290 TraceCheckUtils]: 27: Hoare triple {2354#false} assume !!(~a~0 < 6);~b~0 := 0; {2354#false} is VALID [2022-04-15 13:14:41,959 INFO L290 TraceCheckUtils]: 26: Hoare triple {2354#false} #t~pre4 := 1 + ~a~0;~a~0 := 1 + ~a~0;havoc #t~pre4; {2354#false} is VALID [2022-04-15 13:14:41,959 INFO L290 TraceCheckUtils]: 25: Hoare triple {2354#false} assume !(~b~0 < 6); {2354#false} is VALID [2022-04-15 13:14:41,959 INFO L290 TraceCheckUtils]: 24: Hoare triple {2354#false} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {2354#false} is VALID [2022-04-15 13:14:41,960 INFO L290 TraceCheckUtils]: 23: Hoare triple {2354#false} assume !(~c~0 < 6); {2354#false} is VALID [2022-04-15 13:14:41,960 INFO L290 TraceCheckUtils]: 22: Hoare triple {2354#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {2354#false} is VALID [2022-04-15 13:14:41,960 INFO L290 TraceCheckUtils]: 21: Hoare triple {2354#false} assume !!(~c~0 < 6); {2354#false} is VALID [2022-04-15 13:14:41,960 INFO L290 TraceCheckUtils]: 20: Hoare triple {2354#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {2354#false} is VALID [2022-04-15 13:14:41,960 INFO L290 TraceCheckUtils]: 19: Hoare triple {2354#false} assume !!(~c~0 < 6); {2354#false} is VALID [2022-04-15 13:14:41,960 INFO L290 TraceCheckUtils]: 18: Hoare triple {2354#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {2354#false} is VALID [2022-04-15 13:14:41,960 INFO L290 TraceCheckUtils]: 17: Hoare triple {2354#false} assume !!(~c~0 < 6); {2354#false} is VALID [2022-04-15 13:14:41,960 INFO L290 TraceCheckUtils]: 16: Hoare triple {2354#false} assume !!(~b~0 < 6);~c~0 := 0; {2354#false} is VALID [2022-04-15 13:14:41,960 INFO L290 TraceCheckUtils]: 15: Hoare triple {2354#false} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {2354#false} is VALID [2022-04-15 13:14:41,961 INFO L290 TraceCheckUtils]: 14: Hoare triple {2625#(< main_~c~0 6)} assume !(~c~0 < 6); {2354#false} is VALID [2022-04-15 13:14:41,962 INFO L290 TraceCheckUtils]: 13: Hoare triple {2629#(< main_~c~0 5)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {2625#(< main_~c~0 6)} is VALID [2022-04-15 13:14:41,962 INFO L290 TraceCheckUtils]: 12: Hoare triple {2629#(< main_~c~0 5)} assume !!(~c~0 < 6); {2629#(< main_~c~0 5)} is VALID [2022-04-15 13:14:41,963 INFO L290 TraceCheckUtils]: 11: Hoare triple {2361#(<= main_~c~0 3)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {2629#(< main_~c~0 5)} is VALID [2022-04-15 13:14:41,963 INFO L290 TraceCheckUtils]: 10: Hoare triple {2361#(<= main_~c~0 3)} assume !!(~c~0 < 6); {2361#(<= main_~c~0 3)} is VALID [2022-04-15 13:14:41,963 INFO L290 TraceCheckUtils]: 9: Hoare triple {2360#(<= main_~c~0 2)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {2361#(<= main_~c~0 3)} is VALID [2022-04-15 13:14:41,964 INFO L290 TraceCheckUtils]: 8: Hoare triple {2360#(<= main_~c~0 2)} assume !!(~c~0 < 6); {2360#(<= main_~c~0 2)} is VALID [2022-04-15 13:14:41,964 INFO L290 TraceCheckUtils]: 7: Hoare triple {2353#true} assume !!(~b~0 < 6);~c~0 := 0; {2360#(<= main_~c~0 2)} is VALID [2022-04-15 13:14:41,964 INFO L290 TraceCheckUtils]: 6: Hoare triple {2353#true} assume !!(~a~0 < 6);~b~0 := 0; {2353#true} is VALID [2022-04-15 13:14:41,965 INFO L290 TraceCheckUtils]: 5: Hoare triple {2353#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~a~0 := 0; {2353#true} is VALID [2022-04-15 13:14:41,965 INFO L272 TraceCheckUtils]: 4: Hoare triple {2353#true} call #t~ret7 := main(); {2353#true} is VALID [2022-04-15 13:14:41,965 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2353#true} {2353#true} #56#return; {2353#true} is VALID [2022-04-15 13:14:41,965 INFO L290 TraceCheckUtils]: 2: Hoare triple {2353#true} assume true; {2353#true} is VALID [2022-04-15 13:14:41,965 INFO L290 TraceCheckUtils]: 1: Hoare triple {2353#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); {2353#true} is VALID [2022-04-15 13:14:41,965 INFO L272 TraceCheckUtils]: 0: Hoare triple {2353#true} call ULTIMATE.init(); {2353#true} is VALID [2022-04-15 13:14:41,965 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 82 proven. 9 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2022-04-15 13:14:41,966 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [625607087] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 13:14:41,966 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 13:14:41,966 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 10 [2022-04-15 13:14:41,966 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:14:41,966 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [234958740] [2022-04-15 13:14:41,966 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [234958740] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:14:41,966 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:14:41,966 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-15 13:14:41,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1114090451] [2022-04-15 13:14:41,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:14:41,967 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 6 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 51 [2022-04-15 13:14:41,968 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:14:41,968 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 6 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:14:41,986 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:14:41,986 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-15 13:14:41,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:14:41,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-15 13:14:41,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2022-04-15 13:14:41,986 INFO L87 Difference]: Start difference. First operand 52 states and 58 transitions. Second operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 6 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:14:42,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:14:42,133 INFO L93 Difference]: Finished difference Result 101 states and 116 transitions. [2022-04-15 13:14:42,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-15 13:14:42,133 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 6 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 51 [2022-04-15 13:14:42,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:14:42,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 6 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:14:42,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 37 transitions. [2022-04-15 13:14:42,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 6 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:14:42,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 37 transitions. [2022-04-15 13:14:42,136 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 37 transitions. [2022-04-15 13:14:42,165 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:14:42,166 INFO L225 Difference]: With dead ends: 101 [2022-04-15 13:14:42,166 INFO L226 Difference]: Without dead ends: 64 [2022-04-15 13:14:42,167 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 100 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=75, Invalid=107, Unknown=0, NotChecked=0, Total=182 [2022-04-15 13:14:42,167 INFO L913 BasicCegarLoop]: 15 mSDtfsCounter, 20 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 13:14:42,167 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [20 Valid, 32 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 13:14:42,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2022-04-15 13:14:42,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 60. [2022-04-15 13:14:42,221 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:14:42,221 INFO L82 GeneralOperation]: Start isEquivalent. First operand 64 states. Second operand has 60 states, 56 states have (on average 1.125) internal successors, (63), 56 states have internal predecessors, (63), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:14:42,221 INFO L74 IsIncluded]: Start isIncluded. First operand 64 states. Second operand has 60 states, 56 states have (on average 1.125) internal successors, (63), 56 states have internal predecessors, (63), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:14:42,222 INFO L87 Difference]: Start difference. First operand 64 states. Second operand has 60 states, 56 states have (on average 1.125) internal successors, (63), 56 states have internal predecessors, (63), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:14:42,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:14:42,223 INFO L93 Difference]: Finished difference Result 64 states and 70 transitions. [2022-04-15 13:14:42,223 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 70 transitions. [2022-04-15 13:14:42,224 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:14:42,224 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:14:42,224 INFO L74 IsIncluded]: Start isIncluded. First operand has 60 states, 56 states have (on average 1.125) internal successors, (63), 56 states have internal predecessors, (63), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 64 states. [2022-04-15 13:14:42,224 INFO L87 Difference]: Start difference. First operand has 60 states, 56 states have (on average 1.125) internal successors, (63), 56 states have internal predecessors, (63), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 64 states. [2022-04-15 13:14:42,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:14:42,226 INFO L93 Difference]: Finished difference Result 64 states and 70 transitions. [2022-04-15 13:14:42,226 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 70 transitions. [2022-04-15 13:14:42,226 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:14:42,226 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:14:42,226 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:14:42,226 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:14:42,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 56 states have (on average 1.125) internal successors, (63), 56 states have internal predecessors, (63), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:14:42,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 66 transitions. [2022-04-15 13:14:42,228 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 66 transitions. Word has length 51 [2022-04-15 13:14:42,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:14:42,228 INFO L478 AbstractCegarLoop]: Abstraction has 60 states and 66 transitions. [2022-04-15 13:14:42,228 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 6 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:14:42,228 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 60 states and 66 transitions. [2022-04-15 13:14:42,294 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:14:42,294 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 66 transitions. [2022-04-15 13:14:42,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-04-15 13:14:42,294 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:14:42,295 INFO L499 BasicCegarLoop]: trace histogram [16, 16, 4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 13:14:42,311 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-04-15 13:14:42,499 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13,SelfDestructingSolverStorable14 [2022-04-15 13:14:42,499 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:14:42,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:14:42,500 INFO L85 PathProgramCache]: Analyzing trace with hash 954849791, now seen corresponding path program 11 times [2022-04-15 13:14:42,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:14:42,500 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [612452614] [2022-04-15 13:14:43,086 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 13:14:43,088 INFO L85 PathProgramCache]: Analyzing trace with hash 1694369359, now seen corresponding path program 1 times [2022-04-15 13:14:43,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:14:43,089 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [388084089] [2022-04-15 13:14:43,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:14:43,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:14:43,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 13:14:43,094 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 13:14:43,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 13:14:43,098 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 13:14:43,098 INFO L85 PathProgramCache]: Analyzing trace with hash 954849791, now seen corresponding path program 12 times [2022-04-15 13:14:43,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:14:43,098 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1285216142] [2022-04-15 13:14:43,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:14:43,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:14:43,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:14:43,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 13:14:43,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:14:43,158 INFO L290 TraceCheckUtils]: 0: Hoare triple {3139#(and (= |#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); {3129#true} is VALID [2022-04-15 13:14:43,158 INFO L290 TraceCheckUtils]: 1: Hoare triple {3129#true} assume true; {3129#true} is VALID [2022-04-15 13:14:43,158 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3129#true} {3129#true} #56#return; {3129#true} is VALID [2022-04-15 13:14:43,158 INFO L272 TraceCheckUtils]: 0: Hoare triple {3129#true} call ULTIMATE.init(); {3139#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 13:14:43,159 INFO L290 TraceCheckUtils]: 1: Hoare triple {3139#(and (= |#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); {3129#true} is VALID [2022-04-15 13:14:43,159 INFO L290 TraceCheckUtils]: 2: Hoare triple {3129#true} assume true; {3129#true} is VALID [2022-04-15 13:14:43,159 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3129#true} {3129#true} #56#return; {3129#true} is VALID [2022-04-15 13:14:43,159 INFO L272 TraceCheckUtils]: 4: Hoare triple {3129#true} call #t~ret7 := main(); {3129#true} is VALID [2022-04-15 13:14:43,159 INFO L290 TraceCheckUtils]: 5: Hoare triple {3129#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~a~0 := 0; {3129#true} is VALID [2022-04-15 13:14:43,159 INFO L290 TraceCheckUtils]: 6: Hoare triple {3129#true} assume !!(~a~0 < 6);~b~0 := 0; {3129#true} is VALID [2022-04-15 13:14:43,159 INFO L290 TraceCheckUtils]: 7: Hoare triple {3129#true} assume !!(~b~0 < 6);~c~0 := 0; {3134#(= main_~c~0 0)} is VALID [2022-04-15 13:14:43,160 INFO L290 TraceCheckUtils]: 8: Hoare triple {3134#(= main_~c~0 0)} assume !!(~c~0 < 6); {3134#(= main_~c~0 0)} is VALID [2022-04-15 13:14:43,160 INFO L290 TraceCheckUtils]: 9: Hoare triple {3134#(= main_~c~0 0)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {3135#(<= main_~c~0 1)} is VALID [2022-04-15 13:14:43,160 INFO L290 TraceCheckUtils]: 10: Hoare triple {3135#(<= main_~c~0 1)} assume !!(~c~0 < 6); {3135#(<= main_~c~0 1)} is VALID [2022-04-15 13:14:43,161 INFO L290 TraceCheckUtils]: 11: Hoare triple {3135#(<= main_~c~0 1)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {3136#(<= main_~c~0 2)} is VALID [2022-04-15 13:14:43,161 INFO L290 TraceCheckUtils]: 12: Hoare triple {3136#(<= main_~c~0 2)} assume !!(~c~0 < 6); {3136#(<= main_~c~0 2)} is VALID [2022-04-15 13:14:43,162 INFO L290 TraceCheckUtils]: 13: Hoare triple {3136#(<= main_~c~0 2)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {3137#(<= main_~c~0 3)} is VALID [2022-04-15 13:14:43,162 INFO L290 TraceCheckUtils]: 14: Hoare triple {3137#(<= main_~c~0 3)} assume !!(~c~0 < 6); {3137#(<= main_~c~0 3)} is VALID [2022-04-15 13:14:43,162 INFO L290 TraceCheckUtils]: 15: Hoare triple {3137#(<= main_~c~0 3)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {3138#(<= main_~c~0 4)} is VALID [2022-04-15 13:14:43,163 INFO L290 TraceCheckUtils]: 16: Hoare triple {3138#(<= main_~c~0 4)} assume !(~c~0 < 6); {3130#false} is VALID [2022-04-15 13:14:43,163 INFO L290 TraceCheckUtils]: 17: Hoare triple {3130#false} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {3130#false} is VALID [2022-04-15 13:14:43,163 INFO L290 TraceCheckUtils]: 18: Hoare triple {3130#false} assume !!(~b~0 < 6);~c~0 := 0; {3130#false} is VALID [2022-04-15 13:14:43,163 INFO L290 TraceCheckUtils]: 19: Hoare triple {3130#false} assume !!(~c~0 < 6); {3130#false} is VALID [2022-04-15 13:14:43,163 INFO L290 TraceCheckUtils]: 20: Hoare triple {3130#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {3130#false} is VALID [2022-04-15 13:14:43,163 INFO L290 TraceCheckUtils]: 21: Hoare triple {3130#false} assume !!(~c~0 < 6); {3130#false} is VALID [2022-04-15 13:14:43,163 INFO L290 TraceCheckUtils]: 22: Hoare triple {3130#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {3130#false} is VALID [2022-04-15 13:14:43,163 INFO L290 TraceCheckUtils]: 23: Hoare triple {3130#false} assume !!(~c~0 < 6); {3130#false} is VALID [2022-04-15 13:14:43,163 INFO L290 TraceCheckUtils]: 24: Hoare triple {3130#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {3130#false} is VALID [2022-04-15 13:14:43,163 INFO L290 TraceCheckUtils]: 25: Hoare triple {3130#false} assume !!(~c~0 < 6); {3130#false} is VALID [2022-04-15 13:14:43,163 INFO L290 TraceCheckUtils]: 26: Hoare triple {3130#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {3130#false} is VALID [2022-04-15 13:14:43,163 INFO L290 TraceCheckUtils]: 27: Hoare triple {3130#false} assume !(~c~0 < 6); {3130#false} is VALID [2022-04-15 13:14:43,164 INFO L290 TraceCheckUtils]: 28: Hoare triple {3130#false} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {3130#false} is VALID [2022-04-15 13:14:43,164 INFO L290 TraceCheckUtils]: 29: Hoare triple {3130#false} assume !(~b~0 < 6); {3130#false} is VALID [2022-04-15 13:14:43,164 INFO L290 TraceCheckUtils]: 30: Hoare triple {3130#false} #t~pre4 := 1 + ~a~0;~a~0 := 1 + ~a~0;havoc #t~pre4; {3130#false} is VALID [2022-04-15 13:14:43,164 INFO L290 TraceCheckUtils]: 31: Hoare triple {3130#false} assume !!(~a~0 < 6);~b~0 := 0; {3130#false} is VALID [2022-04-15 13:14:43,164 INFO L290 TraceCheckUtils]: 32: Hoare triple {3130#false} assume !!(~b~0 < 6);~c~0 := 0; {3130#false} is VALID [2022-04-15 13:14:43,164 INFO L290 TraceCheckUtils]: 33: Hoare triple {3130#false} assume !!(~c~0 < 6); {3130#false} is VALID [2022-04-15 13:14:43,164 INFO L290 TraceCheckUtils]: 34: Hoare triple {3130#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {3130#false} is VALID [2022-04-15 13:14:43,164 INFO L290 TraceCheckUtils]: 35: Hoare triple {3130#false} assume !!(~c~0 < 6); {3130#false} is VALID [2022-04-15 13:14:43,164 INFO L290 TraceCheckUtils]: 36: Hoare triple {3130#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {3130#false} is VALID [2022-04-15 13:14:43,164 INFO L290 TraceCheckUtils]: 37: Hoare triple {3130#false} assume !!(~c~0 < 6); {3130#false} is VALID [2022-04-15 13:14:43,164 INFO L290 TraceCheckUtils]: 38: Hoare triple {3130#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {3130#false} is VALID [2022-04-15 13:14:43,164 INFO L290 TraceCheckUtils]: 39: Hoare triple {3130#false} assume !!(~c~0 < 6); {3130#false} is VALID [2022-04-15 13:14:43,164 INFO L290 TraceCheckUtils]: 40: Hoare triple {3130#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {3130#false} is VALID [2022-04-15 13:14:43,164 INFO L290 TraceCheckUtils]: 41: Hoare triple {3130#false} assume !(~c~0 < 6); {3130#false} is VALID [2022-04-15 13:14:43,165 INFO L290 TraceCheckUtils]: 42: Hoare triple {3130#false} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {3130#false} is VALID [2022-04-15 13:14:43,165 INFO L290 TraceCheckUtils]: 43: Hoare triple {3130#false} assume !!(~b~0 < 6);~c~0 := 0; {3130#false} is VALID [2022-04-15 13:14:43,165 INFO L290 TraceCheckUtils]: 44: Hoare triple {3130#false} assume !!(~c~0 < 6); {3130#false} is VALID [2022-04-15 13:14:43,165 INFO L290 TraceCheckUtils]: 45: Hoare triple {3130#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {3130#false} is VALID [2022-04-15 13:14:43,165 INFO L290 TraceCheckUtils]: 46: Hoare triple {3130#false} assume !!(~c~0 < 6); {3130#false} is VALID [2022-04-15 13:14:43,165 INFO L290 TraceCheckUtils]: 47: Hoare triple {3130#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {3130#false} is VALID [2022-04-15 13:14:43,165 INFO L290 TraceCheckUtils]: 48: Hoare triple {3130#false} assume !!(~c~0 < 6); {3130#false} is VALID [2022-04-15 13:14:43,165 INFO L290 TraceCheckUtils]: 49: Hoare triple {3130#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {3130#false} is VALID [2022-04-15 13:14:43,165 INFO L290 TraceCheckUtils]: 50: Hoare triple {3130#false} assume !!(~c~0 < 6); {3130#false} is VALID [2022-04-15 13:14:43,165 INFO L290 TraceCheckUtils]: 51: Hoare triple {3130#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {3130#false} is VALID [2022-04-15 13:14:43,165 INFO L290 TraceCheckUtils]: 52: Hoare triple {3130#false} assume !(~c~0 < 6); {3130#false} is VALID [2022-04-15 13:14:43,165 INFO L290 TraceCheckUtils]: 53: Hoare triple {3130#false} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {3130#false} is VALID [2022-04-15 13:14:43,165 INFO L290 TraceCheckUtils]: 54: Hoare triple {3130#false} assume !(~b~0 < 6); {3130#false} is VALID [2022-04-15 13:14:43,165 INFO L290 TraceCheckUtils]: 55: Hoare triple {3130#false} #t~pre4 := 1 + ~a~0;~a~0 := 1 + ~a~0;havoc #t~pre4; {3130#false} is VALID [2022-04-15 13:14:43,166 INFO L290 TraceCheckUtils]: 56: Hoare triple {3130#false} assume !(~a~0 < 6); {3130#false} is VALID [2022-04-15 13:14:43,166 INFO L290 TraceCheckUtils]: 57: Hoare triple {3130#false} assume !((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0); {3130#false} is VALID [2022-04-15 13:14:43,166 INFO L290 TraceCheckUtils]: 58: Hoare triple {3130#false} assume !false; {3130#false} is VALID [2022-04-15 13:14:43,166 INFO L134 CoverageAnalysis]: Checked inductivity of 335 backedges. 130 proven. 16 refuted. 0 times theorem prover too weak. 189 trivial. 0 not checked. [2022-04-15 13:14:43,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:14:43,166 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1285216142] [2022-04-15 13:14:43,166 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1285216142] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 13:14:43,167 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1074687255] [2022-04-15 13:14:43,167 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 13:14:43,167 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 13:14:43,167 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 13:14:43,172 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 13:14:43,175 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-04-15 13:14:43,233 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 10 check-sat command(s) [2022-04-15 13:14:43,233 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 13:14:43,233 INFO L263 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 6 conjunts are in the unsatisfiable core [2022-04-15 13:14:43,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:14:43,253 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 13:14:43,410 INFO L272 TraceCheckUtils]: 0: Hoare triple {3129#true} call ULTIMATE.init(); {3129#true} is VALID [2022-04-15 13:14:43,411 INFO L290 TraceCheckUtils]: 1: Hoare triple {3129#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); {3129#true} is VALID [2022-04-15 13:14:43,411 INFO L290 TraceCheckUtils]: 2: Hoare triple {3129#true} assume true; {3129#true} is VALID [2022-04-15 13:14:43,411 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3129#true} {3129#true} #56#return; {3129#true} is VALID [2022-04-15 13:14:43,411 INFO L272 TraceCheckUtils]: 4: Hoare triple {3129#true} call #t~ret7 := main(); {3129#true} is VALID [2022-04-15 13:14:43,411 INFO L290 TraceCheckUtils]: 5: Hoare triple {3129#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~a~0 := 0; {3129#true} is VALID [2022-04-15 13:14:43,411 INFO L290 TraceCheckUtils]: 6: Hoare triple {3129#true} assume !!(~a~0 < 6);~b~0 := 0; {3129#true} is VALID [2022-04-15 13:14:43,411 INFO L290 TraceCheckUtils]: 7: Hoare triple {3129#true} assume !!(~b~0 < 6);~c~0 := 0; {3129#true} is VALID [2022-04-15 13:14:43,411 INFO L290 TraceCheckUtils]: 8: Hoare triple {3129#true} assume !!(~c~0 < 6); {3129#true} is VALID [2022-04-15 13:14:43,412 INFO L290 TraceCheckUtils]: 9: Hoare triple {3129#true} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {3129#true} is VALID [2022-04-15 13:14:43,412 INFO L290 TraceCheckUtils]: 10: Hoare triple {3129#true} assume !!(~c~0 < 6); {3129#true} is VALID [2022-04-15 13:14:43,412 INFO L290 TraceCheckUtils]: 11: Hoare triple {3129#true} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {3129#true} is VALID [2022-04-15 13:14:43,412 INFO L290 TraceCheckUtils]: 12: Hoare triple {3129#true} assume !!(~c~0 < 6); {3129#true} is VALID [2022-04-15 13:14:43,412 INFO L290 TraceCheckUtils]: 13: Hoare triple {3129#true} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {3129#true} is VALID [2022-04-15 13:14:43,412 INFO L290 TraceCheckUtils]: 14: Hoare triple {3129#true} assume !!(~c~0 < 6); {3129#true} is VALID [2022-04-15 13:14:43,412 INFO L290 TraceCheckUtils]: 15: Hoare triple {3129#true} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {3129#true} is VALID [2022-04-15 13:14:43,412 INFO L290 TraceCheckUtils]: 16: Hoare triple {3129#true} assume !(~c~0 < 6); {3129#true} is VALID [2022-04-15 13:14:43,412 INFO L290 TraceCheckUtils]: 17: Hoare triple {3129#true} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {3129#true} is VALID [2022-04-15 13:14:43,413 INFO L290 TraceCheckUtils]: 18: Hoare triple {3129#true} assume !!(~b~0 < 6);~c~0 := 0; {3197#(<= main_~c~0 0)} is VALID [2022-04-15 13:14:43,413 INFO L290 TraceCheckUtils]: 19: Hoare triple {3197#(<= main_~c~0 0)} assume !!(~c~0 < 6); {3197#(<= main_~c~0 0)} is VALID [2022-04-15 13:14:43,414 INFO L290 TraceCheckUtils]: 20: Hoare triple {3197#(<= main_~c~0 0)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {3135#(<= main_~c~0 1)} is VALID [2022-04-15 13:14:43,414 INFO L290 TraceCheckUtils]: 21: Hoare triple {3135#(<= main_~c~0 1)} assume !!(~c~0 < 6); {3135#(<= main_~c~0 1)} is VALID [2022-04-15 13:14:43,415 INFO L290 TraceCheckUtils]: 22: Hoare triple {3135#(<= main_~c~0 1)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {3136#(<= main_~c~0 2)} is VALID [2022-04-15 13:14:43,415 INFO L290 TraceCheckUtils]: 23: Hoare triple {3136#(<= main_~c~0 2)} assume !!(~c~0 < 6); {3136#(<= main_~c~0 2)} is VALID [2022-04-15 13:14:43,416 INFO L290 TraceCheckUtils]: 24: Hoare triple {3136#(<= main_~c~0 2)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {3137#(<= main_~c~0 3)} is VALID [2022-04-15 13:14:43,416 INFO L290 TraceCheckUtils]: 25: Hoare triple {3137#(<= main_~c~0 3)} assume !!(~c~0 < 6); {3137#(<= main_~c~0 3)} is VALID [2022-04-15 13:14:43,417 INFO L290 TraceCheckUtils]: 26: Hoare triple {3137#(<= main_~c~0 3)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {3138#(<= main_~c~0 4)} is VALID [2022-04-15 13:14:43,417 INFO L290 TraceCheckUtils]: 27: Hoare triple {3138#(<= main_~c~0 4)} assume !(~c~0 < 6); {3130#false} is VALID [2022-04-15 13:14:43,417 INFO L290 TraceCheckUtils]: 28: Hoare triple {3130#false} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {3130#false} is VALID [2022-04-15 13:14:43,418 INFO L290 TraceCheckUtils]: 29: Hoare triple {3130#false} assume !(~b~0 < 6); {3130#false} is VALID [2022-04-15 13:14:43,418 INFO L290 TraceCheckUtils]: 30: Hoare triple {3130#false} #t~pre4 := 1 + ~a~0;~a~0 := 1 + ~a~0;havoc #t~pre4; {3130#false} is VALID [2022-04-15 13:14:43,418 INFO L290 TraceCheckUtils]: 31: Hoare triple {3130#false} assume !!(~a~0 < 6);~b~0 := 0; {3130#false} is VALID [2022-04-15 13:14:43,418 INFO L290 TraceCheckUtils]: 32: Hoare triple {3130#false} assume !!(~b~0 < 6);~c~0 := 0; {3130#false} is VALID [2022-04-15 13:14:43,418 INFO L290 TraceCheckUtils]: 33: Hoare triple {3130#false} assume !!(~c~0 < 6); {3130#false} is VALID [2022-04-15 13:14:43,418 INFO L290 TraceCheckUtils]: 34: Hoare triple {3130#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {3130#false} is VALID [2022-04-15 13:14:43,418 INFO L290 TraceCheckUtils]: 35: Hoare triple {3130#false} assume !!(~c~0 < 6); {3130#false} is VALID [2022-04-15 13:14:43,418 INFO L290 TraceCheckUtils]: 36: Hoare triple {3130#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {3130#false} is VALID [2022-04-15 13:14:43,418 INFO L290 TraceCheckUtils]: 37: Hoare triple {3130#false} assume !!(~c~0 < 6); {3130#false} is VALID [2022-04-15 13:14:43,418 INFO L290 TraceCheckUtils]: 38: Hoare triple {3130#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {3130#false} is VALID [2022-04-15 13:14:43,419 INFO L290 TraceCheckUtils]: 39: Hoare triple {3130#false} assume !!(~c~0 < 6); {3130#false} is VALID [2022-04-15 13:14:43,419 INFO L290 TraceCheckUtils]: 40: Hoare triple {3130#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {3130#false} is VALID [2022-04-15 13:14:43,419 INFO L290 TraceCheckUtils]: 41: Hoare triple {3130#false} assume !(~c~0 < 6); {3130#false} is VALID [2022-04-15 13:14:43,419 INFO L290 TraceCheckUtils]: 42: Hoare triple {3130#false} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {3130#false} is VALID [2022-04-15 13:14:43,419 INFO L290 TraceCheckUtils]: 43: Hoare triple {3130#false} assume !!(~b~0 < 6);~c~0 := 0; {3130#false} is VALID [2022-04-15 13:14:43,419 INFO L290 TraceCheckUtils]: 44: Hoare triple {3130#false} assume !!(~c~0 < 6); {3130#false} is VALID [2022-04-15 13:14:43,419 INFO L290 TraceCheckUtils]: 45: Hoare triple {3130#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {3130#false} is VALID [2022-04-15 13:14:43,419 INFO L290 TraceCheckUtils]: 46: Hoare triple {3130#false} assume !!(~c~0 < 6); {3130#false} is VALID [2022-04-15 13:14:43,419 INFO L290 TraceCheckUtils]: 47: Hoare triple {3130#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {3130#false} is VALID [2022-04-15 13:14:43,419 INFO L290 TraceCheckUtils]: 48: Hoare triple {3130#false} assume !!(~c~0 < 6); {3130#false} is VALID [2022-04-15 13:14:43,420 INFO L290 TraceCheckUtils]: 49: Hoare triple {3130#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {3130#false} is VALID [2022-04-15 13:14:43,420 INFO L290 TraceCheckUtils]: 50: Hoare triple {3130#false} assume !!(~c~0 < 6); {3130#false} is VALID [2022-04-15 13:14:43,420 INFO L290 TraceCheckUtils]: 51: Hoare triple {3130#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {3130#false} is VALID [2022-04-15 13:14:43,420 INFO L290 TraceCheckUtils]: 52: Hoare triple {3130#false} assume !(~c~0 < 6); {3130#false} is VALID [2022-04-15 13:14:43,420 INFO L290 TraceCheckUtils]: 53: Hoare triple {3130#false} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {3130#false} is VALID [2022-04-15 13:14:43,420 INFO L290 TraceCheckUtils]: 54: Hoare triple {3130#false} assume !(~b~0 < 6); {3130#false} is VALID [2022-04-15 13:14:43,420 INFO L290 TraceCheckUtils]: 55: Hoare triple {3130#false} #t~pre4 := 1 + ~a~0;~a~0 := 1 + ~a~0;havoc #t~pre4; {3130#false} is VALID [2022-04-15 13:14:43,420 INFO L290 TraceCheckUtils]: 56: Hoare triple {3130#false} assume !(~a~0 < 6); {3130#false} is VALID [2022-04-15 13:14:43,420 INFO L290 TraceCheckUtils]: 57: Hoare triple {3130#false} assume !((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0); {3130#false} is VALID [2022-04-15 13:14:43,421 INFO L290 TraceCheckUtils]: 58: Hoare triple {3130#false} assume !false; {3130#false} is VALID [2022-04-15 13:14:43,421 INFO L134 CoverageAnalysis]: Checked inductivity of 335 backedges. 218 proven. 16 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2022-04-15 13:14:43,421 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 13:14:43,598 INFO L290 TraceCheckUtils]: 58: Hoare triple {3130#false} assume !false; {3130#false} is VALID [2022-04-15 13:14:43,598 INFO L290 TraceCheckUtils]: 57: Hoare triple {3130#false} assume !((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0); {3130#false} is VALID [2022-04-15 13:14:43,598 INFO L290 TraceCheckUtils]: 56: Hoare triple {3130#false} assume !(~a~0 < 6); {3130#false} is VALID [2022-04-15 13:14:43,598 INFO L290 TraceCheckUtils]: 55: Hoare triple {3130#false} #t~pre4 := 1 + ~a~0;~a~0 := 1 + ~a~0;havoc #t~pre4; {3130#false} is VALID [2022-04-15 13:14:43,598 INFO L290 TraceCheckUtils]: 54: Hoare triple {3130#false} assume !(~b~0 < 6); {3130#false} is VALID [2022-04-15 13:14:43,598 INFO L290 TraceCheckUtils]: 53: Hoare triple {3130#false} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {3130#false} is VALID [2022-04-15 13:14:43,598 INFO L290 TraceCheckUtils]: 52: Hoare triple {3130#false} assume !(~c~0 < 6); {3130#false} is VALID [2022-04-15 13:14:43,598 INFO L290 TraceCheckUtils]: 51: Hoare triple {3130#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {3130#false} is VALID [2022-04-15 13:14:43,598 INFO L290 TraceCheckUtils]: 50: Hoare triple {3130#false} assume !!(~c~0 < 6); {3130#false} is VALID [2022-04-15 13:14:43,599 INFO L290 TraceCheckUtils]: 49: Hoare triple {3130#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {3130#false} is VALID [2022-04-15 13:14:43,599 INFO L290 TraceCheckUtils]: 48: Hoare triple {3130#false} assume !!(~c~0 < 6); {3130#false} is VALID [2022-04-15 13:14:43,599 INFO L290 TraceCheckUtils]: 47: Hoare triple {3130#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {3130#false} is VALID [2022-04-15 13:14:43,599 INFO L290 TraceCheckUtils]: 46: Hoare triple {3130#false} assume !!(~c~0 < 6); {3130#false} is VALID [2022-04-15 13:14:43,599 INFO L290 TraceCheckUtils]: 45: Hoare triple {3130#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {3130#false} is VALID [2022-04-15 13:14:43,599 INFO L290 TraceCheckUtils]: 44: Hoare triple {3130#false} assume !!(~c~0 < 6); {3130#false} is VALID [2022-04-15 13:14:43,599 INFO L290 TraceCheckUtils]: 43: Hoare triple {3130#false} assume !!(~b~0 < 6);~c~0 := 0; {3130#false} is VALID [2022-04-15 13:14:43,599 INFO L290 TraceCheckUtils]: 42: Hoare triple {3130#false} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {3130#false} is VALID [2022-04-15 13:14:43,599 INFO L290 TraceCheckUtils]: 41: Hoare triple {3130#false} assume !(~c~0 < 6); {3130#false} is VALID [2022-04-15 13:14:43,599 INFO L290 TraceCheckUtils]: 40: Hoare triple {3130#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {3130#false} is VALID [2022-04-15 13:14:43,599 INFO L290 TraceCheckUtils]: 39: Hoare triple {3130#false} assume !!(~c~0 < 6); {3130#false} is VALID [2022-04-15 13:14:43,599 INFO L290 TraceCheckUtils]: 38: Hoare triple {3130#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {3130#false} is VALID [2022-04-15 13:14:43,599 INFO L290 TraceCheckUtils]: 37: Hoare triple {3130#false} assume !!(~c~0 < 6); {3130#false} is VALID [2022-04-15 13:14:43,599 INFO L290 TraceCheckUtils]: 36: Hoare triple {3130#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {3130#false} is VALID [2022-04-15 13:14:43,600 INFO L290 TraceCheckUtils]: 35: Hoare triple {3130#false} assume !!(~c~0 < 6); {3130#false} is VALID [2022-04-15 13:14:43,600 INFO L290 TraceCheckUtils]: 34: Hoare triple {3130#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {3130#false} is VALID [2022-04-15 13:14:43,600 INFO L290 TraceCheckUtils]: 33: Hoare triple {3130#false} assume !!(~c~0 < 6); {3130#false} is VALID [2022-04-15 13:14:43,600 INFO L290 TraceCheckUtils]: 32: Hoare triple {3130#false} assume !!(~b~0 < 6);~c~0 := 0; {3130#false} is VALID [2022-04-15 13:14:43,600 INFO L290 TraceCheckUtils]: 31: Hoare triple {3130#false} assume !!(~a~0 < 6);~b~0 := 0; {3130#false} is VALID [2022-04-15 13:14:43,600 INFO L290 TraceCheckUtils]: 30: Hoare triple {3130#false} #t~pre4 := 1 + ~a~0;~a~0 := 1 + ~a~0;havoc #t~pre4; {3130#false} is VALID [2022-04-15 13:14:43,600 INFO L290 TraceCheckUtils]: 29: Hoare triple {3130#false} assume !(~b~0 < 6); {3130#false} is VALID [2022-04-15 13:14:43,600 INFO L290 TraceCheckUtils]: 28: Hoare triple {3130#false} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {3130#false} is VALID [2022-04-15 13:14:43,600 INFO L290 TraceCheckUtils]: 27: Hoare triple {3411#(< main_~c~0 6)} assume !(~c~0 < 6); {3130#false} is VALID [2022-04-15 13:14:43,601 INFO L290 TraceCheckUtils]: 26: Hoare triple {3138#(<= main_~c~0 4)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {3411#(< main_~c~0 6)} is VALID [2022-04-15 13:14:43,601 INFO L290 TraceCheckUtils]: 25: Hoare triple {3138#(<= main_~c~0 4)} assume !!(~c~0 < 6); {3138#(<= main_~c~0 4)} is VALID [2022-04-15 13:14:43,602 INFO L290 TraceCheckUtils]: 24: Hoare triple {3137#(<= main_~c~0 3)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {3138#(<= main_~c~0 4)} is VALID [2022-04-15 13:14:43,602 INFO L290 TraceCheckUtils]: 23: Hoare triple {3137#(<= main_~c~0 3)} assume !!(~c~0 < 6); {3137#(<= main_~c~0 3)} is VALID [2022-04-15 13:14:43,602 INFO L290 TraceCheckUtils]: 22: Hoare triple {3136#(<= main_~c~0 2)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {3137#(<= main_~c~0 3)} is VALID [2022-04-15 13:14:43,603 INFO L290 TraceCheckUtils]: 21: Hoare triple {3136#(<= main_~c~0 2)} assume !!(~c~0 < 6); {3136#(<= main_~c~0 2)} is VALID [2022-04-15 13:14:43,603 INFO L290 TraceCheckUtils]: 20: Hoare triple {3135#(<= main_~c~0 1)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {3136#(<= main_~c~0 2)} is VALID [2022-04-15 13:14:43,603 INFO L290 TraceCheckUtils]: 19: Hoare triple {3135#(<= main_~c~0 1)} assume !!(~c~0 < 6); {3135#(<= main_~c~0 1)} is VALID [2022-04-15 13:14:43,604 INFO L290 TraceCheckUtils]: 18: Hoare triple {3129#true} assume !!(~b~0 < 6);~c~0 := 0; {3135#(<= main_~c~0 1)} is VALID [2022-04-15 13:14:43,604 INFO L290 TraceCheckUtils]: 17: Hoare triple {3129#true} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {3129#true} is VALID [2022-04-15 13:14:43,604 INFO L290 TraceCheckUtils]: 16: Hoare triple {3129#true} assume !(~c~0 < 6); {3129#true} is VALID [2022-04-15 13:14:43,604 INFO L290 TraceCheckUtils]: 15: Hoare triple {3129#true} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {3129#true} is VALID [2022-04-15 13:14:43,604 INFO L290 TraceCheckUtils]: 14: Hoare triple {3129#true} assume !!(~c~0 < 6); {3129#true} is VALID [2022-04-15 13:14:43,604 INFO L290 TraceCheckUtils]: 13: Hoare triple {3129#true} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {3129#true} is VALID [2022-04-15 13:14:43,604 INFO L290 TraceCheckUtils]: 12: Hoare triple {3129#true} assume !!(~c~0 < 6); {3129#true} is VALID [2022-04-15 13:14:43,604 INFO L290 TraceCheckUtils]: 11: Hoare triple {3129#true} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {3129#true} is VALID [2022-04-15 13:14:43,604 INFO L290 TraceCheckUtils]: 10: Hoare triple {3129#true} assume !!(~c~0 < 6); {3129#true} is VALID [2022-04-15 13:14:43,604 INFO L290 TraceCheckUtils]: 9: Hoare triple {3129#true} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {3129#true} is VALID [2022-04-15 13:14:43,604 INFO L290 TraceCheckUtils]: 8: Hoare triple {3129#true} assume !!(~c~0 < 6); {3129#true} is VALID [2022-04-15 13:14:43,605 INFO L290 TraceCheckUtils]: 7: Hoare triple {3129#true} assume !!(~b~0 < 6);~c~0 := 0; {3129#true} is VALID [2022-04-15 13:14:43,605 INFO L290 TraceCheckUtils]: 6: Hoare triple {3129#true} assume !!(~a~0 < 6);~b~0 := 0; {3129#true} is VALID [2022-04-15 13:14:43,605 INFO L290 TraceCheckUtils]: 5: Hoare triple {3129#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~a~0 := 0; {3129#true} is VALID [2022-04-15 13:14:43,605 INFO L272 TraceCheckUtils]: 4: Hoare triple {3129#true} call #t~ret7 := main(); {3129#true} is VALID [2022-04-15 13:14:43,605 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3129#true} {3129#true} #56#return; {3129#true} is VALID [2022-04-15 13:14:43,605 INFO L290 TraceCheckUtils]: 2: Hoare triple {3129#true} assume true; {3129#true} is VALID [2022-04-15 13:14:43,605 INFO L290 TraceCheckUtils]: 1: Hoare triple {3129#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); {3129#true} is VALID [2022-04-15 13:14:43,605 INFO L272 TraceCheckUtils]: 0: Hoare triple {3129#true} call ULTIMATE.init(); {3129#true} is VALID [2022-04-15 13:14:43,606 INFO L134 CoverageAnalysis]: Checked inductivity of 335 backedges. 218 proven. 16 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2022-04-15 13:14:43,606 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1074687255] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 13:14:43,606 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 13:14:43,606 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 10 [2022-04-15 13:14:43,606 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:14:43,606 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [612452614] [2022-04-15 13:14:43,607 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [612452614] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:14:43,607 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:14:43,607 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-15 13:14:43,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [660992949] [2022-04-15 13:14:43,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:14:43,607 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.125) internal successors, (25), 7 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 59 [2022-04-15 13:14:43,607 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:14:43,608 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 3.125) internal successors, (25), 7 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:14:43,644 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:14:43,644 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-15 13:14:43,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:14:43,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-15 13:14:43,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2022-04-15 13:14:43,645 INFO L87 Difference]: Start difference. First operand 60 states and 66 transitions. Second operand has 8 states, 8 states have (on average 3.125) internal successors, (25), 7 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:14:43,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:14:43,811 INFO L93 Difference]: Finished difference Result 115 states and 130 transitions. [2022-04-15 13:14:43,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-15 13:14:43,811 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.125) internal successors, (25), 7 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 59 [2022-04-15 13:14:43,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:14:43,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 3.125) internal successors, (25), 7 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:14:43,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 39 transitions. [2022-04-15 13:14:43,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 3.125) internal successors, (25), 7 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:14:43,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 39 transitions. [2022-04-15 13:14:43,813 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 39 transitions. [2022-04-15 13:14:43,848 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:14:43,849 INFO L225 Difference]: With dead ends: 115 [2022-04-15 13:14:43,850 INFO L226 Difference]: Without dead ends: 72 [2022-04-15 13:14:43,850 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 117 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=84, Invalid=126, Unknown=0, NotChecked=0, Total=210 [2022-04-15 13:14:43,851 INFO L913 BasicCegarLoop]: 15 mSDtfsCounter, 22 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 13:14:43,851 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 22 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 13:14:43,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2022-04-15 13:14:43,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 68. [2022-04-15 13:14:43,908 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:14:43,908 INFO L82 GeneralOperation]: Start isEquivalent. First operand 72 states. Second operand has 68 states, 64 states have (on average 1.109375) internal successors, (71), 64 states have internal predecessors, (71), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:14:43,908 INFO L74 IsIncluded]: Start isIncluded. First operand 72 states. Second operand has 68 states, 64 states have (on average 1.109375) internal successors, (71), 64 states have internal predecessors, (71), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:14:43,909 INFO L87 Difference]: Start difference. First operand 72 states. Second operand has 68 states, 64 states have (on average 1.109375) internal successors, (71), 64 states have internal predecessors, (71), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:14:43,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:14:43,910 INFO L93 Difference]: Finished difference Result 72 states and 78 transitions. [2022-04-15 13:14:43,910 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 78 transitions. [2022-04-15 13:14:43,910 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:14:43,910 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:14:43,911 INFO L74 IsIncluded]: Start isIncluded. First operand has 68 states, 64 states have (on average 1.109375) internal successors, (71), 64 states have internal predecessors, (71), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 72 states. [2022-04-15 13:14:43,911 INFO L87 Difference]: Start difference. First operand has 68 states, 64 states have (on average 1.109375) internal successors, (71), 64 states have internal predecessors, (71), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 72 states. [2022-04-15 13:14:43,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:14:43,912 INFO L93 Difference]: Finished difference Result 72 states and 78 transitions. [2022-04-15 13:14:43,912 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 78 transitions. [2022-04-15 13:14:43,913 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:14:43,913 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:14:43,913 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:14:43,913 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:14:43,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 64 states have (on average 1.109375) internal successors, (71), 64 states have internal predecessors, (71), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:14:43,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 74 transitions. [2022-04-15 13:14:43,914 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 74 transitions. Word has length 59 [2022-04-15 13:14:43,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:14:43,915 INFO L478 AbstractCegarLoop]: Abstraction has 68 states and 74 transitions. [2022-04-15 13:14:43,915 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.125) internal successors, (25), 7 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:14:43,915 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 68 states and 74 transitions. [2022-04-15 13:14:43,985 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:14:43,986 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 74 transitions. [2022-04-15 13:14:43,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-04-15 13:14:43,986 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:14:43,986 INFO L499 BasicCegarLoop]: trace histogram [20, 20, 4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 13:14:44,004 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-04-15 13:14:44,195 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15,SelfDestructingSolverStorable16 [2022-04-15 13:14:44,196 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:14:44,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:14:44,196 INFO L85 PathProgramCache]: Analyzing trace with hash 2144436095, now seen corresponding path program 13 times [2022-04-15 13:14:44,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:14:44,196 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [219367001] [2022-04-15 13:14:44,844 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 13:14:44,845 INFO L85 PathProgramCache]: Analyzing trace with hash 1694430863, now seen corresponding path program 1 times [2022-04-15 13:14:44,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:14:44,845 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488911278] [2022-04-15 13:14:44,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:14:44,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:14:44,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 13:14:44,851 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 13:14:44,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 13:14:44,854 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 13:14:44,855 INFO L85 PathProgramCache]: Analyzing trace with hash 2144436095, now seen corresponding path program 14 times [2022-04-15 13:14:44,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:14:44,855 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [182422272] [2022-04-15 13:14:44,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:14:44,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:14:44,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:14:44,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 13:14:44,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:14:44,930 INFO L290 TraceCheckUtils]: 0: Hoare triple {4026#(and (= |#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); {4015#true} is VALID [2022-04-15 13:14:44,930 INFO L290 TraceCheckUtils]: 1: Hoare triple {4015#true} assume true; {4015#true} is VALID [2022-04-15 13:14:44,930 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4015#true} {4015#true} #56#return; {4015#true} is VALID [2022-04-15 13:14:44,930 INFO L272 TraceCheckUtils]: 0: Hoare triple {4015#true} call ULTIMATE.init(); {4026#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 13:14:44,930 INFO L290 TraceCheckUtils]: 1: Hoare triple {4026#(and (= |#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); {4015#true} is VALID [2022-04-15 13:14:44,930 INFO L290 TraceCheckUtils]: 2: Hoare triple {4015#true} assume true; {4015#true} is VALID [2022-04-15 13:14:44,931 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4015#true} {4015#true} #56#return; {4015#true} is VALID [2022-04-15 13:14:44,931 INFO L272 TraceCheckUtils]: 4: Hoare triple {4015#true} call #t~ret7 := main(); {4015#true} is VALID [2022-04-15 13:14:44,931 INFO L290 TraceCheckUtils]: 5: Hoare triple {4015#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~a~0 := 0; {4015#true} is VALID [2022-04-15 13:14:44,931 INFO L290 TraceCheckUtils]: 6: Hoare triple {4015#true} assume !!(~a~0 < 6);~b~0 := 0; {4015#true} is VALID [2022-04-15 13:14:44,931 INFO L290 TraceCheckUtils]: 7: Hoare triple {4015#true} assume !!(~b~0 < 6);~c~0 := 0; {4020#(= main_~c~0 0)} is VALID [2022-04-15 13:14:44,931 INFO L290 TraceCheckUtils]: 8: Hoare triple {4020#(= main_~c~0 0)} assume !!(~c~0 < 6); {4020#(= main_~c~0 0)} is VALID [2022-04-15 13:14:44,932 INFO L290 TraceCheckUtils]: 9: Hoare triple {4020#(= main_~c~0 0)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {4021#(<= main_~c~0 1)} is VALID [2022-04-15 13:14:44,932 INFO L290 TraceCheckUtils]: 10: Hoare triple {4021#(<= main_~c~0 1)} assume !!(~c~0 < 6); {4021#(<= main_~c~0 1)} is VALID [2022-04-15 13:14:44,932 INFO L290 TraceCheckUtils]: 11: Hoare triple {4021#(<= main_~c~0 1)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {4022#(<= main_~c~0 2)} is VALID [2022-04-15 13:14:44,933 INFO L290 TraceCheckUtils]: 12: Hoare triple {4022#(<= main_~c~0 2)} assume !!(~c~0 < 6); {4022#(<= main_~c~0 2)} is VALID [2022-04-15 13:14:44,933 INFO L290 TraceCheckUtils]: 13: Hoare triple {4022#(<= main_~c~0 2)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {4023#(<= main_~c~0 3)} is VALID [2022-04-15 13:14:44,933 INFO L290 TraceCheckUtils]: 14: Hoare triple {4023#(<= main_~c~0 3)} assume !!(~c~0 < 6); {4023#(<= main_~c~0 3)} is VALID [2022-04-15 13:14:44,934 INFO L290 TraceCheckUtils]: 15: Hoare triple {4023#(<= main_~c~0 3)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {4024#(<= main_~c~0 4)} is VALID [2022-04-15 13:14:44,934 INFO L290 TraceCheckUtils]: 16: Hoare triple {4024#(<= main_~c~0 4)} assume !!(~c~0 < 6); {4024#(<= main_~c~0 4)} is VALID [2022-04-15 13:14:44,935 INFO L290 TraceCheckUtils]: 17: Hoare triple {4024#(<= main_~c~0 4)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {4025#(<= main_~c~0 5)} is VALID [2022-04-15 13:14:44,935 INFO L290 TraceCheckUtils]: 18: Hoare triple {4025#(<= main_~c~0 5)} assume !(~c~0 < 6); {4016#false} is VALID [2022-04-15 13:14:44,935 INFO L290 TraceCheckUtils]: 19: Hoare triple {4016#false} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {4016#false} is VALID [2022-04-15 13:14:44,935 INFO L290 TraceCheckUtils]: 20: Hoare triple {4016#false} assume !!(~b~0 < 6);~c~0 := 0; {4016#false} is VALID [2022-04-15 13:14:44,935 INFO L290 TraceCheckUtils]: 21: Hoare triple {4016#false} assume !!(~c~0 < 6); {4016#false} is VALID [2022-04-15 13:14:44,935 INFO L290 TraceCheckUtils]: 22: Hoare triple {4016#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {4016#false} is VALID [2022-04-15 13:14:44,935 INFO L290 TraceCheckUtils]: 23: Hoare triple {4016#false} assume !!(~c~0 < 6); {4016#false} is VALID [2022-04-15 13:14:44,935 INFO L290 TraceCheckUtils]: 24: Hoare triple {4016#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {4016#false} is VALID [2022-04-15 13:14:44,935 INFO L290 TraceCheckUtils]: 25: Hoare triple {4016#false} assume !!(~c~0 < 6); {4016#false} is VALID [2022-04-15 13:14:44,935 INFO L290 TraceCheckUtils]: 26: Hoare triple {4016#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {4016#false} is VALID [2022-04-15 13:14:44,936 INFO L290 TraceCheckUtils]: 27: Hoare triple {4016#false} assume !!(~c~0 < 6); {4016#false} is VALID [2022-04-15 13:14:44,936 INFO L290 TraceCheckUtils]: 28: Hoare triple {4016#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {4016#false} is VALID [2022-04-15 13:14:44,936 INFO L290 TraceCheckUtils]: 29: Hoare triple {4016#false} assume !!(~c~0 < 6); {4016#false} is VALID [2022-04-15 13:14:44,936 INFO L290 TraceCheckUtils]: 30: Hoare triple {4016#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {4016#false} is VALID [2022-04-15 13:14:44,936 INFO L290 TraceCheckUtils]: 31: Hoare triple {4016#false} assume !(~c~0 < 6); {4016#false} is VALID [2022-04-15 13:14:44,936 INFO L290 TraceCheckUtils]: 32: Hoare triple {4016#false} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {4016#false} is VALID [2022-04-15 13:14:44,936 INFO L290 TraceCheckUtils]: 33: Hoare triple {4016#false} assume !(~b~0 < 6); {4016#false} is VALID [2022-04-15 13:14:44,936 INFO L290 TraceCheckUtils]: 34: Hoare triple {4016#false} #t~pre4 := 1 + ~a~0;~a~0 := 1 + ~a~0;havoc #t~pre4; {4016#false} is VALID [2022-04-15 13:14:44,936 INFO L290 TraceCheckUtils]: 35: Hoare triple {4016#false} assume !!(~a~0 < 6);~b~0 := 0; {4016#false} is VALID [2022-04-15 13:14:44,936 INFO L290 TraceCheckUtils]: 36: Hoare triple {4016#false} assume !!(~b~0 < 6);~c~0 := 0; {4016#false} is VALID [2022-04-15 13:14:44,936 INFO L290 TraceCheckUtils]: 37: Hoare triple {4016#false} assume !!(~c~0 < 6); {4016#false} is VALID [2022-04-15 13:14:44,936 INFO L290 TraceCheckUtils]: 38: Hoare triple {4016#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {4016#false} is VALID [2022-04-15 13:14:44,936 INFO L290 TraceCheckUtils]: 39: Hoare triple {4016#false} assume !!(~c~0 < 6); {4016#false} is VALID [2022-04-15 13:14:44,936 INFO L290 TraceCheckUtils]: 40: Hoare triple {4016#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {4016#false} is VALID [2022-04-15 13:14:44,937 INFO L290 TraceCheckUtils]: 41: Hoare triple {4016#false} assume !!(~c~0 < 6); {4016#false} is VALID [2022-04-15 13:14:44,937 INFO L290 TraceCheckUtils]: 42: Hoare triple {4016#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {4016#false} is VALID [2022-04-15 13:14:44,937 INFO L290 TraceCheckUtils]: 43: Hoare triple {4016#false} assume !!(~c~0 < 6); {4016#false} is VALID [2022-04-15 13:14:44,937 INFO L290 TraceCheckUtils]: 44: Hoare triple {4016#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {4016#false} is VALID [2022-04-15 13:14:44,937 INFO L290 TraceCheckUtils]: 45: Hoare triple {4016#false} assume !!(~c~0 < 6); {4016#false} is VALID [2022-04-15 13:14:44,937 INFO L290 TraceCheckUtils]: 46: Hoare triple {4016#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {4016#false} is VALID [2022-04-15 13:14:44,937 INFO L290 TraceCheckUtils]: 47: Hoare triple {4016#false} assume !(~c~0 < 6); {4016#false} is VALID [2022-04-15 13:14:44,937 INFO L290 TraceCheckUtils]: 48: Hoare triple {4016#false} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {4016#false} is VALID [2022-04-15 13:14:44,937 INFO L290 TraceCheckUtils]: 49: Hoare triple {4016#false} assume !!(~b~0 < 6);~c~0 := 0; {4016#false} is VALID [2022-04-15 13:14:44,937 INFO L290 TraceCheckUtils]: 50: Hoare triple {4016#false} assume !!(~c~0 < 6); {4016#false} is VALID [2022-04-15 13:14:44,937 INFO L290 TraceCheckUtils]: 51: Hoare triple {4016#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {4016#false} is VALID [2022-04-15 13:14:44,937 INFO L290 TraceCheckUtils]: 52: Hoare triple {4016#false} assume !!(~c~0 < 6); {4016#false} is VALID [2022-04-15 13:14:44,937 INFO L290 TraceCheckUtils]: 53: Hoare triple {4016#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {4016#false} is VALID [2022-04-15 13:14:44,937 INFO L290 TraceCheckUtils]: 54: Hoare triple {4016#false} assume !!(~c~0 < 6); {4016#false} is VALID [2022-04-15 13:14:44,938 INFO L290 TraceCheckUtils]: 55: Hoare triple {4016#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {4016#false} is VALID [2022-04-15 13:14:44,938 INFO L290 TraceCheckUtils]: 56: Hoare triple {4016#false} assume !!(~c~0 < 6); {4016#false} is VALID [2022-04-15 13:14:44,938 INFO L290 TraceCheckUtils]: 57: Hoare triple {4016#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {4016#false} is VALID [2022-04-15 13:14:44,938 INFO L290 TraceCheckUtils]: 58: Hoare triple {4016#false} assume !!(~c~0 < 6); {4016#false} is VALID [2022-04-15 13:14:44,938 INFO L290 TraceCheckUtils]: 59: Hoare triple {4016#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {4016#false} is VALID [2022-04-15 13:14:44,938 INFO L290 TraceCheckUtils]: 60: Hoare triple {4016#false} assume !(~c~0 < 6); {4016#false} is VALID [2022-04-15 13:14:44,938 INFO L290 TraceCheckUtils]: 61: Hoare triple {4016#false} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {4016#false} is VALID [2022-04-15 13:14:44,938 INFO L290 TraceCheckUtils]: 62: Hoare triple {4016#false} assume !(~b~0 < 6); {4016#false} is VALID [2022-04-15 13:14:44,938 INFO L290 TraceCheckUtils]: 63: Hoare triple {4016#false} #t~pre4 := 1 + ~a~0;~a~0 := 1 + ~a~0;havoc #t~pre4; {4016#false} is VALID [2022-04-15 13:14:44,938 INFO L290 TraceCheckUtils]: 64: Hoare triple {4016#false} assume !(~a~0 < 6); {4016#false} is VALID [2022-04-15 13:14:44,939 INFO L290 TraceCheckUtils]: 65: Hoare triple {4016#false} assume !((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0); {4016#false} is VALID [2022-04-15 13:14:44,939 INFO L290 TraceCheckUtils]: 66: Hoare triple {4016#false} assume !false; {4016#false} is VALID [2022-04-15 13:14:44,939 INFO L134 CoverageAnalysis]: Checked inductivity of 491 backedges. 190 proven. 25 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2022-04-15 13:14:44,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:14:44,939 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [182422272] [2022-04-15 13:14:44,939 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [182422272] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 13:14:44,940 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1501169818] [2022-04-15 13:14:44,940 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 13:14:44,940 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 13:14:44,940 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 13:14:44,943 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 13:14:44,967 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-04-15 13:14:44,996 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 13:14:44,996 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 13:14:44,996 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-15 13:14:45,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:14:45,014 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 13:14:45,172 INFO L272 TraceCheckUtils]: 0: Hoare triple {4015#true} call ULTIMATE.init(); {4015#true} is VALID [2022-04-15 13:14:45,172 INFO L290 TraceCheckUtils]: 1: Hoare triple {4015#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); {4015#true} is VALID [2022-04-15 13:14:45,172 INFO L290 TraceCheckUtils]: 2: Hoare triple {4015#true} assume true; {4015#true} is VALID [2022-04-15 13:14:45,172 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4015#true} {4015#true} #56#return; {4015#true} is VALID [2022-04-15 13:14:45,172 INFO L272 TraceCheckUtils]: 4: Hoare triple {4015#true} call #t~ret7 := main(); {4015#true} is VALID [2022-04-15 13:14:45,172 INFO L290 TraceCheckUtils]: 5: Hoare triple {4015#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~a~0 := 0; {4015#true} is VALID [2022-04-15 13:14:45,173 INFO L290 TraceCheckUtils]: 6: Hoare triple {4015#true} assume !!(~a~0 < 6);~b~0 := 0; {4015#true} is VALID [2022-04-15 13:14:45,173 INFO L290 TraceCheckUtils]: 7: Hoare triple {4015#true} assume !!(~b~0 < 6);~c~0 := 0; {4051#(<= main_~c~0 0)} is VALID [2022-04-15 13:14:45,173 INFO L290 TraceCheckUtils]: 8: Hoare triple {4051#(<= main_~c~0 0)} assume !!(~c~0 < 6); {4051#(<= main_~c~0 0)} is VALID [2022-04-15 13:14:45,174 INFO L290 TraceCheckUtils]: 9: Hoare triple {4051#(<= main_~c~0 0)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {4021#(<= main_~c~0 1)} is VALID [2022-04-15 13:14:45,174 INFO L290 TraceCheckUtils]: 10: Hoare triple {4021#(<= main_~c~0 1)} assume !!(~c~0 < 6); {4021#(<= main_~c~0 1)} is VALID [2022-04-15 13:14:45,174 INFO L290 TraceCheckUtils]: 11: Hoare triple {4021#(<= main_~c~0 1)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {4022#(<= main_~c~0 2)} is VALID [2022-04-15 13:14:45,175 INFO L290 TraceCheckUtils]: 12: Hoare triple {4022#(<= main_~c~0 2)} assume !!(~c~0 < 6); {4022#(<= main_~c~0 2)} is VALID [2022-04-15 13:14:45,175 INFO L290 TraceCheckUtils]: 13: Hoare triple {4022#(<= main_~c~0 2)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {4023#(<= main_~c~0 3)} is VALID [2022-04-15 13:14:45,175 INFO L290 TraceCheckUtils]: 14: Hoare triple {4023#(<= main_~c~0 3)} assume !!(~c~0 < 6); {4023#(<= main_~c~0 3)} is VALID [2022-04-15 13:14:45,176 INFO L290 TraceCheckUtils]: 15: Hoare triple {4023#(<= main_~c~0 3)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {4024#(<= main_~c~0 4)} is VALID [2022-04-15 13:14:45,176 INFO L290 TraceCheckUtils]: 16: Hoare triple {4024#(<= main_~c~0 4)} assume !!(~c~0 < 6); {4024#(<= main_~c~0 4)} is VALID [2022-04-15 13:14:45,176 INFO L290 TraceCheckUtils]: 17: Hoare triple {4024#(<= main_~c~0 4)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {4025#(<= main_~c~0 5)} is VALID [2022-04-15 13:14:45,177 INFO L290 TraceCheckUtils]: 18: Hoare triple {4025#(<= main_~c~0 5)} assume !(~c~0 < 6); {4016#false} is VALID [2022-04-15 13:14:45,177 INFO L290 TraceCheckUtils]: 19: Hoare triple {4016#false} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {4016#false} is VALID [2022-04-15 13:14:45,177 INFO L290 TraceCheckUtils]: 20: Hoare triple {4016#false} assume !!(~b~0 < 6);~c~0 := 0; {4016#false} is VALID [2022-04-15 13:14:45,177 INFO L290 TraceCheckUtils]: 21: Hoare triple {4016#false} assume !!(~c~0 < 6); {4016#false} is VALID [2022-04-15 13:14:45,177 INFO L290 TraceCheckUtils]: 22: Hoare triple {4016#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {4016#false} is VALID [2022-04-15 13:14:45,177 INFO L290 TraceCheckUtils]: 23: Hoare triple {4016#false} assume !!(~c~0 < 6); {4016#false} is VALID [2022-04-15 13:14:45,177 INFO L290 TraceCheckUtils]: 24: Hoare triple {4016#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {4016#false} is VALID [2022-04-15 13:14:45,177 INFO L290 TraceCheckUtils]: 25: Hoare triple {4016#false} assume !!(~c~0 < 6); {4016#false} is VALID [2022-04-15 13:14:45,177 INFO L290 TraceCheckUtils]: 26: Hoare triple {4016#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {4016#false} is VALID [2022-04-15 13:14:45,177 INFO L290 TraceCheckUtils]: 27: Hoare triple {4016#false} assume !!(~c~0 < 6); {4016#false} is VALID [2022-04-15 13:14:45,178 INFO L290 TraceCheckUtils]: 28: Hoare triple {4016#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {4016#false} is VALID [2022-04-15 13:14:45,178 INFO L290 TraceCheckUtils]: 29: Hoare triple {4016#false} assume !!(~c~0 < 6); {4016#false} is VALID [2022-04-15 13:14:45,178 INFO L290 TraceCheckUtils]: 30: Hoare triple {4016#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {4016#false} is VALID [2022-04-15 13:14:45,178 INFO L290 TraceCheckUtils]: 31: Hoare triple {4016#false} assume !(~c~0 < 6); {4016#false} is VALID [2022-04-15 13:14:45,178 INFO L290 TraceCheckUtils]: 32: Hoare triple {4016#false} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {4016#false} is VALID [2022-04-15 13:14:45,178 INFO L290 TraceCheckUtils]: 33: Hoare triple {4016#false} assume !(~b~0 < 6); {4016#false} is VALID [2022-04-15 13:14:45,178 INFO L290 TraceCheckUtils]: 34: Hoare triple {4016#false} #t~pre4 := 1 + ~a~0;~a~0 := 1 + ~a~0;havoc #t~pre4; {4016#false} is VALID [2022-04-15 13:14:45,178 INFO L290 TraceCheckUtils]: 35: Hoare triple {4016#false} assume !!(~a~0 < 6);~b~0 := 0; {4016#false} is VALID [2022-04-15 13:14:45,178 INFO L290 TraceCheckUtils]: 36: Hoare triple {4016#false} assume !!(~b~0 < 6);~c~0 := 0; {4016#false} is VALID [2022-04-15 13:14:45,178 INFO L290 TraceCheckUtils]: 37: Hoare triple {4016#false} assume !!(~c~0 < 6); {4016#false} is VALID [2022-04-15 13:14:45,178 INFO L290 TraceCheckUtils]: 38: Hoare triple {4016#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {4016#false} is VALID [2022-04-15 13:14:45,178 INFO L290 TraceCheckUtils]: 39: Hoare triple {4016#false} assume !!(~c~0 < 6); {4016#false} is VALID [2022-04-15 13:14:45,178 INFO L290 TraceCheckUtils]: 40: Hoare triple {4016#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {4016#false} is VALID [2022-04-15 13:14:45,178 INFO L290 TraceCheckUtils]: 41: Hoare triple {4016#false} assume !!(~c~0 < 6); {4016#false} is VALID [2022-04-15 13:14:45,179 INFO L290 TraceCheckUtils]: 42: Hoare triple {4016#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {4016#false} is VALID [2022-04-15 13:14:45,179 INFO L290 TraceCheckUtils]: 43: Hoare triple {4016#false} assume !!(~c~0 < 6); {4016#false} is VALID [2022-04-15 13:14:45,179 INFO L290 TraceCheckUtils]: 44: Hoare triple {4016#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {4016#false} is VALID [2022-04-15 13:14:45,179 INFO L290 TraceCheckUtils]: 45: Hoare triple {4016#false} assume !!(~c~0 < 6); {4016#false} is VALID [2022-04-15 13:14:45,179 INFO L290 TraceCheckUtils]: 46: Hoare triple {4016#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {4016#false} is VALID [2022-04-15 13:14:45,179 INFO L290 TraceCheckUtils]: 47: Hoare triple {4016#false} assume !(~c~0 < 6); {4016#false} is VALID [2022-04-15 13:14:45,179 INFO L290 TraceCheckUtils]: 48: Hoare triple {4016#false} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {4016#false} is VALID [2022-04-15 13:14:45,179 INFO L290 TraceCheckUtils]: 49: Hoare triple {4016#false} assume !!(~b~0 < 6);~c~0 := 0; {4016#false} is VALID [2022-04-15 13:14:45,179 INFO L290 TraceCheckUtils]: 50: Hoare triple {4016#false} assume !!(~c~0 < 6); {4016#false} is VALID [2022-04-15 13:14:45,179 INFO L290 TraceCheckUtils]: 51: Hoare triple {4016#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {4016#false} is VALID [2022-04-15 13:14:45,179 INFO L290 TraceCheckUtils]: 52: Hoare triple {4016#false} assume !!(~c~0 < 6); {4016#false} is VALID [2022-04-15 13:14:45,179 INFO L290 TraceCheckUtils]: 53: Hoare triple {4016#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {4016#false} is VALID [2022-04-15 13:14:45,179 INFO L290 TraceCheckUtils]: 54: Hoare triple {4016#false} assume !!(~c~0 < 6); {4016#false} is VALID [2022-04-15 13:14:45,179 INFO L290 TraceCheckUtils]: 55: Hoare triple {4016#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {4016#false} is VALID [2022-04-15 13:14:45,180 INFO L290 TraceCheckUtils]: 56: Hoare triple {4016#false} assume !!(~c~0 < 6); {4016#false} is VALID [2022-04-15 13:14:45,180 INFO L290 TraceCheckUtils]: 57: Hoare triple {4016#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {4016#false} is VALID [2022-04-15 13:14:45,180 INFO L290 TraceCheckUtils]: 58: Hoare triple {4016#false} assume !!(~c~0 < 6); {4016#false} is VALID [2022-04-15 13:14:45,180 INFO L290 TraceCheckUtils]: 59: Hoare triple {4016#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {4016#false} is VALID [2022-04-15 13:14:45,180 INFO L290 TraceCheckUtils]: 60: Hoare triple {4016#false} assume !(~c~0 < 6); {4016#false} is VALID [2022-04-15 13:14:45,180 INFO L290 TraceCheckUtils]: 61: Hoare triple {4016#false} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {4016#false} is VALID [2022-04-15 13:14:45,180 INFO L290 TraceCheckUtils]: 62: Hoare triple {4016#false} assume !(~b~0 < 6); {4016#false} is VALID [2022-04-15 13:14:45,180 INFO L290 TraceCheckUtils]: 63: Hoare triple {4016#false} #t~pre4 := 1 + ~a~0;~a~0 := 1 + ~a~0;havoc #t~pre4; {4016#false} is VALID [2022-04-15 13:14:45,180 INFO L290 TraceCheckUtils]: 64: Hoare triple {4016#false} assume !(~a~0 < 6); {4016#false} is VALID [2022-04-15 13:14:45,181 INFO L290 TraceCheckUtils]: 65: Hoare triple {4016#false} assume !((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0); {4016#false} is VALID [2022-04-15 13:14:45,181 INFO L290 TraceCheckUtils]: 66: Hoare triple {4016#false} assume !false; {4016#false} is VALID [2022-04-15 13:14:45,181 INFO L134 CoverageAnalysis]: Checked inductivity of 491 backedges. 190 proven. 25 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2022-04-15 13:14:45,181 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 13:14:45,379 INFO L290 TraceCheckUtils]: 66: Hoare triple {4016#false} assume !false; {4016#false} is VALID [2022-04-15 13:14:45,381 INFO L290 TraceCheckUtils]: 65: Hoare triple {4016#false} assume !((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0); {4016#false} is VALID [2022-04-15 13:14:45,381 INFO L290 TraceCheckUtils]: 64: Hoare triple {4016#false} assume !(~a~0 < 6); {4016#false} is VALID [2022-04-15 13:14:45,382 INFO L290 TraceCheckUtils]: 63: Hoare triple {4016#false} #t~pre4 := 1 + ~a~0;~a~0 := 1 + ~a~0;havoc #t~pre4; {4016#false} is VALID [2022-04-15 13:14:45,382 INFO L290 TraceCheckUtils]: 62: Hoare triple {4016#false} assume !(~b~0 < 6); {4016#false} is VALID [2022-04-15 13:14:45,382 INFO L290 TraceCheckUtils]: 61: Hoare triple {4016#false} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {4016#false} is VALID [2022-04-15 13:14:45,382 INFO L290 TraceCheckUtils]: 60: Hoare triple {4016#false} assume !(~c~0 < 6); {4016#false} is VALID [2022-04-15 13:14:45,382 INFO L290 TraceCheckUtils]: 59: Hoare triple {4016#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {4016#false} is VALID [2022-04-15 13:14:45,382 INFO L290 TraceCheckUtils]: 58: Hoare triple {4016#false} assume !!(~c~0 < 6); {4016#false} is VALID [2022-04-15 13:14:45,382 INFO L290 TraceCheckUtils]: 57: Hoare triple {4016#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {4016#false} is VALID [2022-04-15 13:14:45,382 INFO L290 TraceCheckUtils]: 56: Hoare triple {4016#false} assume !!(~c~0 < 6); {4016#false} is VALID [2022-04-15 13:14:45,382 INFO L290 TraceCheckUtils]: 55: Hoare triple {4016#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {4016#false} is VALID [2022-04-15 13:14:45,382 INFO L290 TraceCheckUtils]: 54: Hoare triple {4016#false} assume !!(~c~0 < 6); {4016#false} is VALID [2022-04-15 13:14:45,383 INFO L290 TraceCheckUtils]: 53: Hoare triple {4016#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {4016#false} is VALID [2022-04-15 13:14:45,383 INFO L290 TraceCheckUtils]: 52: Hoare triple {4016#false} assume !!(~c~0 < 6); {4016#false} is VALID [2022-04-15 13:14:45,383 INFO L290 TraceCheckUtils]: 51: Hoare triple {4016#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {4016#false} is VALID [2022-04-15 13:14:45,383 INFO L290 TraceCheckUtils]: 50: Hoare triple {4016#false} assume !!(~c~0 < 6); {4016#false} is VALID [2022-04-15 13:14:45,383 INFO L290 TraceCheckUtils]: 49: Hoare triple {4016#false} assume !!(~b~0 < 6);~c~0 := 0; {4016#false} is VALID [2022-04-15 13:14:45,383 INFO L290 TraceCheckUtils]: 48: Hoare triple {4016#false} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {4016#false} is VALID [2022-04-15 13:14:45,383 INFO L290 TraceCheckUtils]: 47: Hoare triple {4016#false} assume !(~c~0 < 6); {4016#false} is VALID [2022-04-15 13:14:45,383 INFO L290 TraceCheckUtils]: 46: Hoare triple {4016#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {4016#false} is VALID [2022-04-15 13:14:45,383 INFO L290 TraceCheckUtils]: 45: Hoare triple {4016#false} assume !!(~c~0 < 6); {4016#false} is VALID [2022-04-15 13:14:45,383 INFO L290 TraceCheckUtils]: 44: Hoare triple {4016#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {4016#false} is VALID [2022-04-15 13:14:45,384 INFO L290 TraceCheckUtils]: 43: Hoare triple {4016#false} assume !!(~c~0 < 6); {4016#false} is VALID [2022-04-15 13:14:45,384 INFO L290 TraceCheckUtils]: 42: Hoare triple {4016#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {4016#false} is VALID [2022-04-15 13:14:45,384 INFO L290 TraceCheckUtils]: 41: Hoare triple {4016#false} assume !!(~c~0 < 6); {4016#false} is VALID [2022-04-15 13:14:45,384 INFO L290 TraceCheckUtils]: 40: Hoare triple {4016#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {4016#false} is VALID [2022-04-15 13:14:45,384 INFO L290 TraceCheckUtils]: 39: Hoare triple {4016#false} assume !!(~c~0 < 6); {4016#false} is VALID [2022-04-15 13:14:45,384 INFO L290 TraceCheckUtils]: 38: Hoare triple {4016#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {4016#false} is VALID [2022-04-15 13:14:45,384 INFO L290 TraceCheckUtils]: 37: Hoare triple {4016#false} assume !!(~c~0 < 6); {4016#false} is VALID [2022-04-15 13:14:45,384 INFO L290 TraceCheckUtils]: 36: Hoare triple {4016#false} assume !!(~b~0 < 6);~c~0 := 0; {4016#false} is VALID [2022-04-15 13:14:45,384 INFO L290 TraceCheckUtils]: 35: Hoare triple {4016#false} assume !!(~a~0 < 6);~b~0 := 0; {4016#false} is VALID [2022-04-15 13:14:45,384 INFO L290 TraceCheckUtils]: 34: Hoare triple {4016#false} #t~pre4 := 1 + ~a~0;~a~0 := 1 + ~a~0;havoc #t~pre4; {4016#false} is VALID [2022-04-15 13:14:45,385 INFO L290 TraceCheckUtils]: 33: Hoare triple {4016#false} assume !(~b~0 < 6); {4016#false} is VALID [2022-04-15 13:14:45,385 INFO L290 TraceCheckUtils]: 32: Hoare triple {4016#false} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {4016#false} is VALID [2022-04-15 13:14:45,385 INFO L290 TraceCheckUtils]: 31: Hoare triple {4016#false} assume !(~c~0 < 6); {4016#false} is VALID [2022-04-15 13:14:45,385 INFO L290 TraceCheckUtils]: 30: Hoare triple {4016#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {4016#false} is VALID [2022-04-15 13:14:45,385 INFO L290 TraceCheckUtils]: 29: Hoare triple {4016#false} assume !!(~c~0 < 6); {4016#false} is VALID [2022-04-15 13:14:45,385 INFO L290 TraceCheckUtils]: 28: Hoare triple {4016#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {4016#false} is VALID [2022-04-15 13:14:45,385 INFO L290 TraceCheckUtils]: 27: Hoare triple {4016#false} assume !!(~c~0 < 6); {4016#false} is VALID [2022-04-15 13:14:45,386 INFO L290 TraceCheckUtils]: 26: Hoare triple {4016#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {4016#false} is VALID [2022-04-15 13:14:45,386 INFO L290 TraceCheckUtils]: 25: Hoare triple {4016#false} assume !!(~c~0 < 6); {4016#false} is VALID [2022-04-15 13:14:45,386 INFO L290 TraceCheckUtils]: 24: Hoare triple {4016#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {4016#false} is VALID [2022-04-15 13:14:45,386 INFO L290 TraceCheckUtils]: 23: Hoare triple {4016#false} assume !!(~c~0 < 6); {4016#false} is VALID [2022-04-15 13:14:45,386 INFO L290 TraceCheckUtils]: 22: Hoare triple {4016#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {4016#false} is VALID [2022-04-15 13:14:45,386 INFO L290 TraceCheckUtils]: 21: Hoare triple {4016#false} assume !!(~c~0 < 6); {4016#false} is VALID [2022-04-15 13:14:45,386 INFO L290 TraceCheckUtils]: 20: Hoare triple {4016#false} assume !!(~b~0 < 6);~c~0 := 0; {4016#false} is VALID [2022-04-15 13:14:45,386 INFO L290 TraceCheckUtils]: 19: Hoare triple {4016#false} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {4016#false} is VALID [2022-04-15 13:14:45,387 INFO L290 TraceCheckUtils]: 18: Hoare triple {4025#(<= main_~c~0 5)} assume !(~c~0 < 6); {4016#false} is VALID [2022-04-15 13:14:45,387 INFO L290 TraceCheckUtils]: 17: Hoare triple {4024#(<= main_~c~0 4)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {4025#(<= main_~c~0 5)} is VALID [2022-04-15 13:14:45,388 INFO L290 TraceCheckUtils]: 16: Hoare triple {4024#(<= main_~c~0 4)} assume !!(~c~0 < 6); {4024#(<= main_~c~0 4)} is VALID [2022-04-15 13:14:45,388 INFO L290 TraceCheckUtils]: 15: Hoare triple {4023#(<= main_~c~0 3)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {4024#(<= main_~c~0 4)} is VALID [2022-04-15 13:14:45,389 INFO L290 TraceCheckUtils]: 14: Hoare triple {4023#(<= main_~c~0 3)} assume !!(~c~0 < 6); {4023#(<= main_~c~0 3)} is VALID [2022-04-15 13:14:45,389 INFO L290 TraceCheckUtils]: 13: Hoare triple {4022#(<= main_~c~0 2)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {4023#(<= main_~c~0 3)} is VALID [2022-04-15 13:14:45,389 INFO L290 TraceCheckUtils]: 12: Hoare triple {4022#(<= main_~c~0 2)} assume !!(~c~0 < 6); {4022#(<= main_~c~0 2)} is VALID [2022-04-15 13:14:45,390 INFO L290 TraceCheckUtils]: 11: Hoare triple {4021#(<= main_~c~0 1)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {4022#(<= main_~c~0 2)} is VALID [2022-04-15 13:14:45,390 INFO L290 TraceCheckUtils]: 10: Hoare triple {4021#(<= main_~c~0 1)} assume !!(~c~0 < 6); {4021#(<= main_~c~0 1)} is VALID [2022-04-15 13:14:45,391 INFO L290 TraceCheckUtils]: 9: Hoare triple {4051#(<= main_~c~0 0)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {4021#(<= main_~c~0 1)} is VALID [2022-04-15 13:14:45,391 INFO L290 TraceCheckUtils]: 8: Hoare triple {4051#(<= main_~c~0 0)} assume !!(~c~0 < 6); {4051#(<= main_~c~0 0)} is VALID [2022-04-15 13:14:45,391 INFO L290 TraceCheckUtils]: 7: Hoare triple {4015#true} assume !!(~b~0 < 6);~c~0 := 0; {4051#(<= main_~c~0 0)} is VALID [2022-04-15 13:14:45,391 INFO L290 TraceCheckUtils]: 6: Hoare triple {4015#true} assume !!(~a~0 < 6);~b~0 := 0; {4015#true} is VALID [2022-04-15 13:14:45,392 INFO L290 TraceCheckUtils]: 5: Hoare triple {4015#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~a~0 := 0; {4015#true} is VALID [2022-04-15 13:14:45,392 INFO L272 TraceCheckUtils]: 4: Hoare triple {4015#true} call #t~ret7 := main(); {4015#true} is VALID [2022-04-15 13:14:45,392 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4015#true} {4015#true} #56#return; {4015#true} is VALID [2022-04-15 13:14:45,392 INFO L290 TraceCheckUtils]: 2: Hoare triple {4015#true} assume true; {4015#true} is VALID [2022-04-15 13:14:45,392 INFO L290 TraceCheckUtils]: 1: Hoare triple {4015#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); {4015#true} is VALID [2022-04-15 13:14:45,392 INFO L272 TraceCheckUtils]: 0: Hoare triple {4015#true} call ULTIMATE.init(); {4015#true} is VALID [2022-04-15 13:14:45,392 INFO L134 CoverageAnalysis]: Checked inductivity of 491 backedges. 190 proven. 25 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2022-04-15 13:14:45,393 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1501169818] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 13:14:45,393 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 13:14:45,393 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 10 [2022-04-15 13:14:45,393 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:14:45,393 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [219367001] [2022-04-15 13:14:45,393 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [219367001] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:14:45,393 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:14:45,393 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-15 13:14:45,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1712517182] [2022-04-15 13:14:45,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:14:45,394 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.0) internal successors, (27), 8 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 67 [2022-04-15 13:14:45,394 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:14:45,394 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 3.0) internal successors, (27), 8 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:14:45,414 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:14:45,414 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-15 13:14:45,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:14:45,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-15 13:14:45,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2022-04-15 13:14:45,415 INFO L87 Difference]: Start difference. First operand 68 states and 74 transitions. Second operand has 9 states, 9 states have (on average 3.0) internal successors, (27), 8 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:14:45,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:14:45,585 INFO L93 Difference]: Finished difference Result 125 states and 140 transitions. [2022-04-15 13:14:45,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-15 13:14:45,585 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.0) internal successors, (27), 8 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 67 [2022-04-15 13:14:45,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:14:45,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 3.0) internal successors, (27), 8 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:14:45,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 40 transitions. [2022-04-15 13:14:45,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 3.0) internal successors, (27), 8 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:14:45,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 40 transitions. [2022-04-15 13:14:45,587 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 40 transitions. [2022-04-15 13:14:45,635 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 13:14:45,636 INFO L225 Difference]: With dead ends: 125 [2022-04-15 13:14:45,636 INFO L226 Difference]: Without dead ends: 76 [2022-04-15 13:14:45,637 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 134 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=93, Invalid=147, Unknown=0, NotChecked=0, Total=240 [2022-04-15 13:14:45,637 INFO L913 BasicCegarLoop]: 15 mSDtfsCounter, 23 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 13:14:45,638 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [23 Valid, 22 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 13:14:45,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2022-04-15 13:14:45,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2022-04-15 13:14:45,721 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:14:45,722 INFO L82 GeneralOperation]: Start isEquivalent. First operand 76 states. Second operand has 76 states, 72 states have (on average 1.0972222222222223) internal successors, (79), 72 states have internal predecessors, (79), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:14:45,722 INFO L74 IsIncluded]: Start isIncluded. First operand 76 states. Second operand has 76 states, 72 states have (on average 1.0972222222222223) internal successors, (79), 72 states have internal predecessors, (79), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:14:45,723 INFO L87 Difference]: Start difference. First operand 76 states. Second operand has 76 states, 72 states have (on average 1.0972222222222223) internal successors, (79), 72 states have internal predecessors, (79), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:14:45,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:14:45,728 INFO L93 Difference]: Finished difference Result 76 states and 82 transitions. [2022-04-15 13:14:45,728 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 82 transitions. [2022-04-15 13:14:45,728 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:14:45,729 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:14:45,730 INFO L74 IsIncluded]: Start isIncluded. First operand has 76 states, 72 states have (on average 1.0972222222222223) internal successors, (79), 72 states have internal predecessors, (79), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 76 states. [2022-04-15 13:14:45,730 INFO L87 Difference]: Start difference. First operand has 76 states, 72 states have (on average 1.0972222222222223) internal successors, (79), 72 states have internal predecessors, (79), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 76 states. [2022-04-15 13:14:45,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:14:45,736 INFO L93 Difference]: Finished difference Result 76 states and 82 transitions. [2022-04-15 13:14:45,736 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 82 transitions. [2022-04-15 13:14:45,737 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:14:45,737 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:14:45,737 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:14:45,737 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:14:45,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 72 states have (on average 1.0972222222222223) internal successors, (79), 72 states have internal predecessors, (79), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:14:45,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 82 transitions. [2022-04-15 13:14:45,738 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 82 transitions. Word has length 67 [2022-04-15 13:14:45,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:14:45,739 INFO L478 AbstractCegarLoop]: Abstraction has 76 states and 82 transitions. [2022-04-15 13:14:45,739 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.0) internal successors, (27), 8 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:14:45,739 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 76 states and 82 transitions. [2022-04-15 13:14:45,812 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 82 edges. 82 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:14:45,812 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 82 transitions. [2022-04-15 13:14:45,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-04-15 13:14:45,812 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:14:45,813 INFO L499 BasicCegarLoop]: trace histogram [24, 24, 4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 13:14:45,831 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-04-15 13:14:46,015 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,SelfDestructingSolverStorable17,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 13:14:46,016 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:14:46,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:14:46,016 INFO L85 PathProgramCache]: Analyzing trace with hash 275596543, now seen corresponding path program 15 times [2022-04-15 13:14:46,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:14:46,016 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [402925453] [2022-04-15 13:14:46,843 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 13:14:46,844 INFO L85 PathProgramCache]: Analyzing trace with hash 1694492367, now seen corresponding path program 1 times [2022-04-15 13:14:46,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:14:46,845 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1627165619] [2022-04-15 13:14:46,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:14:46,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:14:46,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 13:14:46,848 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 13:14:46,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 13:14:46,852 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 13:14:46,852 INFO L85 PathProgramCache]: Analyzing trace with hash 275596543, now seen corresponding path program 16 times [2022-04-15 13:14:46,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:14:46,852 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [287300995] [2022-04-15 13:14:46,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:14:46,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:14:46,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:14:46,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 13:14:46,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:14:46,906 INFO L290 TraceCheckUtils]: 0: Hoare triple {5003#(and (= |#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); {4995#true} is VALID [2022-04-15 13:14:46,906 INFO L290 TraceCheckUtils]: 1: Hoare triple {4995#true} assume true; {4995#true} is VALID [2022-04-15 13:14:46,906 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4995#true} {4995#true} #56#return; {4995#true} is VALID [2022-04-15 13:14:46,907 INFO L272 TraceCheckUtils]: 0: Hoare triple {4995#true} call ULTIMATE.init(); {5003#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 13:14:46,907 INFO L290 TraceCheckUtils]: 1: Hoare triple {5003#(and (= |#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); {4995#true} is VALID [2022-04-15 13:14:46,907 INFO L290 TraceCheckUtils]: 2: Hoare triple {4995#true} assume true; {4995#true} is VALID [2022-04-15 13:14:46,907 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4995#true} {4995#true} #56#return; {4995#true} is VALID [2022-04-15 13:14:46,907 INFO L272 TraceCheckUtils]: 4: Hoare triple {4995#true} call #t~ret7 := main(); {4995#true} is VALID [2022-04-15 13:14:46,907 INFO L290 TraceCheckUtils]: 5: Hoare triple {4995#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~a~0 := 0; {4995#true} is VALID [2022-04-15 13:14:46,908 INFO L290 TraceCheckUtils]: 6: Hoare triple {4995#true} assume !!(~a~0 < 6);~b~0 := 0; {5000#(= main_~b~0 0)} is VALID [2022-04-15 13:14:46,908 INFO L290 TraceCheckUtils]: 7: Hoare triple {5000#(= main_~b~0 0)} assume !!(~b~0 < 6);~c~0 := 0; {5000#(= main_~b~0 0)} is VALID [2022-04-15 13:14:46,908 INFO L290 TraceCheckUtils]: 8: Hoare triple {5000#(= main_~b~0 0)} assume !!(~c~0 < 6); {5000#(= main_~b~0 0)} is VALID [2022-04-15 13:14:46,908 INFO L290 TraceCheckUtils]: 9: Hoare triple {5000#(= main_~b~0 0)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {5000#(= main_~b~0 0)} is VALID [2022-04-15 13:14:46,909 INFO L290 TraceCheckUtils]: 10: Hoare triple {5000#(= main_~b~0 0)} assume !!(~c~0 < 6); {5000#(= main_~b~0 0)} is VALID [2022-04-15 13:14:46,909 INFO L290 TraceCheckUtils]: 11: Hoare triple {5000#(= main_~b~0 0)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {5000#(= main_~b~0 0)} is VALID [2022-04-15 13:14:46,909 INFO L290 TraceCheckUtils]: 12: Hoare triple {5000#(= main_~b~0 0)} assume !!(~c~0 < 6); {5000#(= main_~b~0 0)} is VALID [2022-04-15 13:14:46,910 INFO L290 TraceCheckUtils]: 13: Hoare triple {5000#(= main_~b~0 0)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {5000#(= main_~b~0 0)} is VALID [2022-04-15 13:14:46,910 INFO L290 TraceCheckUtils]: 14: Hoare triple {5000#(= main_~b~0 0)} assume !!(~c~0 < 6); {5000#(= main_~b~0 0)} is VALID [2022-04-15 13:14:46,910 INFO L290 TraceCheckUtils]: 15: Hoare triple {5000#(= main_~b~0 0)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {5000#(= main_~b~0 0)} is VALID [2022-04-15 13:14:46,911 INFO L290 TraceCheckUtils]: 16: Hoare triple {5000#(= main_~b~0 0)} assume !!(~c~0 < 6); {5000#(= main_~b~0 0)} is VALID [2022-04-15 13:14:46,911 INFO L290 TraceCheckUtils]: 17: Hoare triple {5000#(= main_~b~0 0)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {5000#(= main_~b~0 0)} is VALID [2022-04-15 13:14:46,911 INFO L290 TraceCheckUtils]: 18: Hoare triple {5000#(= main_~b~0 0)} assume !!(~c~0 < 6); {5000#(= main_~b~0 0)} is VALID [2022-04-15 13:14:46,912 INFO L290 TraceCheckUtils]: 19: Hoare triple {5000#(= main_~b~0 0)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {5000#(= main_~b~0 0)} is VALID [2022-04-15 13:14:46,912 INFO L290 TraceCheckUtils]: 20: Hoare triple {5000#(= main_~b~0 0)} assume !(~c~0 < 6); {5000#(= main_~b~0 0)} is VALID [2022-04-15 13:14:46,912 INFO L290 TraceCheckUtils]: 21: Hoare triple {5000#(= main_~b~0 0)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {5001#(<= main_~b~0 1)} is VALID [2022-04-15 13:14:46,912 INFO L290 TraceCheckUtils]: 22: Hoare triple {5001#(<= main_~b~0 1)} assume !!(~b~0 < 6);~c~0 := 0; {5001#(<= main_~b~0 1)} is VALID [2022-04-15 13:14:46,913 INFO L290 TraceCheckUtils]: 23: Hoare triple {5001#(<= main_~b~0 1)} assume !!(~c~0 < 6); {5001#(<= main_~b~0 1)} is VALID [2022-04-15 13:14:46,913 INFO L290 TraceCheckUtils]: 24: Hoare triple {5001#(<= main_~b~0 1)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {5001#(<= main_~b~0 1)} is VALID [2022-04-15 13:14:46,914 INFO L290 TraceCheckUtils]: 25: Hoare triple {5001#(<= main_~b~0 1)} assume !!(~c~0 < 6); {5001#(<= main_~b~0 1)} is VALID [2022-04-15 13:14:46,914 INFO L290 TraceCheckUtils]: 26: Hoare triple {5001#(<= main_~b~0 1)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {5001#(<= main_~b~0 1)} is VALID [2022-04-15 13:14:46,914 INFO L290 TraceCheckUtils]: 27: Hoare triple {5001#(<= main_~b~0 1)} assume !!(~c~0 < 6); {5001#(<= main_~b~0 1)} is VALID [2022-04-15 13:14:46,914 INFO L290 TraceCheckUtils]: 28: Hoare triple {5001#(<= main_~b~0 1)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {5001#(<= main_~b~0 1)} is VALID [2022-04-15 13:14:46,915 INFO L290 TraceCheckUtils]: 29: Hoare triple {5001#(<= main_~b~0 1)} assume !!(~c~0 < 6); {5001#(<= main_~b~0 1)} is VALID [2022-04-15 13:14:46,915 INFO L290 TraceCheckUtils]: 30: Hoare triple {5001#(<= main_~b~0 1)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {5001#(<= main_~b~0 1)} is VALID [2022-04-15 13:14:46,915 INFO L290 TraceCheckUtils]: 31: Hoare triple {5001#(<= main_~b~0 1)} assume !!(~c~0 < 6); {5001#(<= main_~b~0 1)} is VALID [2022-04-15 13:14:46,916 INFO L290 TraceCheckUtils]: 32: Hoare triple {5001#(<= main_~b~0 1)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {5001#(<= main_~b~0 1)} is VALID [2022-04-15 13:14:46,916 INFO L290 TraceCheckUtils]: 33: Hoare triple {5001#(<= main_~b~0 1)} assume !!(~c~0 < 6); {5001#(<= main_~b~0 1)} is VALID [2022-04-15 13:14:46,916 INFO L290 TraceCheckUtils]: 34: Hoare triple {5001#(<= main_~b~0 1)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {5001#(<= main_~b~0 1)} is VALID [2022-04-15 13:14:46,917 INFO L290 TraceCheckUtils]: 35: Hoare triple {5001#(<= main_~b~0 1)} assume !(~c~0 < 6); {5001#(<= main_~b~0 1)} is VALID [2022-04-15 13:14:46,917 INFO L290 TraceCheckUtils]: 36: Hoare triple {5001#(<= main_~b~0 1)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {5002#(<= main_~b~0 2)} is VALID [2022-04-15 13:14:46,918 INFO L290 TraceCheckUtils]: 37: Hoare triple {5002#(<= main_~b~0 2)} assume !(~b~0 < 6); {4996#false} is VALID [2022-04-15 13:14:46,918 INFO L290 TraceCheckUtils]: 38: Hoare triple {4996#false} #t~pre4 := 1 + ~a~0;~a~0 := 1 + ~a~0;havoc #t~pre4; {4996#false} is VALID [2022-04-15 13:14:46,918 INFO L290 TraceCheckUtils]: 39: Hoare triple {4996#false} assume !!(~a~0 < 6);~b~0 := 0; {4996#false} is VALID [2022-04-15 13:14:46,918 INFO L290 TraceCheckUtils]: 40: Hoare triple {4996#false} assume !!(~b~0 < 6);~c~0 := 0; {4996#false} is VALID [2022-04-15 13:14:46,918 INFO L290 TraceCheckUtils]: 41: Hoare triple {4996#false} assume !!(~c~0 < 6); {4996#false} is VALID [2022-04-15 13:14:46,918 INFO L290 TraceCheckUtils]: 42: Hoare triple {4996#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {4996#false} is VALID [2022-04-15 13:14:46,918 INFO L290 TraceCheckUtils]: 43: Hoare triple {4996#false} assume !!(~c~0 < 6); {4996#false} is VALID [2022-04-15 13:14:46,918 INFO L290 TraceCheckUtils]: 44: Hoare triple {4996#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {4996#false} is VALID [2022-04-15 13:14:46,918 INFO L290 TraceCheckUtils]: 45: Hoare triple {4996#false} assume !!(~c~0 < 6); {4996#false} is VALID [2022-04-15 13:14:46,919 INFO L290 TraceCheckUtils]: 46: Hoare triple {4996#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {4996#false} is VALID [2022-04-15 13:14:46,919 INFO L290 TraceCheckUtils]: 47: Hoare triple {4996#false} assume !!(~c~0 < 6); {4996#false} is VALID [2022-04-15 13:14:46,919 INFO L290 TraceCheckUtils]: 48: Hoare triple {4996#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {4996#false} is VALID [2022-04-15 13:14:46,919 INFO L290 TraceCheckUtils]: 49: Hoare triple {4996#false} assume !!(~c~0 < 6); {4996#false} is VALID [2022-04-15 13:14:46,919 INFO L290 TraceCheckUtils]: 50: Hoare triple {4996#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {4996#false} is VALID [2022-04-15 13:14:46,919 INFO L290 TraceCheckUtils]: 51: Hoare triple {4996#false} assume !!(~c~0 < 6); {4996#false} is VALID [2022-04-15 13:14:46,919 INFO L290 TraceCheckUtils]: 52: Hoare triple {4996#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {4996#false} is VALID [2022-04-15 13:14:46,919 INFO L290 TraceCheckUtils]: 53: Hoare triple {4996#false} assume !(~c~0 < 6); {4996#false} is VALID [2022-04-15 13:14:46,919 INFO L290 TraceCheckUtils]: 54: Hoare triple {4996#false} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {4996#false} is VALID [2022-04-15 13:14:46,919 INFO L290 TraceCheckUtils]: 55: Hoare triple {4996#false} assume !!(~b~0 < 6);~c~0 := 0; {4996#false} is VALID [2022-04-15 13:14:46,920 INFO L290 TraceCheckUtils]: 56: Hoare triple {4996#false} assume !!(~c~0 < 6); {4996#false} is VALID [2022-04-15 13:14:46,920 INFO L290 TraceCheckUtils]: 57: Hoare triple {4996#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {4996#false} is VALID [2022-04-15 13:14:46,920 INFO L290 TraceCheckUtils]: 58: Hoare triple {4996#false} assume !!(~c~0 < 6); {4996#false} is VALID [2022-04-15 13:14:46,920 INFO L290 TraceCheckUtils]: 59: Hoare triple {4996#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {4996#false} is VALID [2022-04-15 13:14:46,920 INFO L290 TraceCheckUtils]: 60: Hoare triple {4996#false} assume !!(~c~0 < 6); {4996#false} is VALID [2022-04-15 13:14:46,920 INFO L290 TraceCheckUtils]: 61: Hoare triple {4996#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {4996#false} is VALID [2022-04-15 13:14:46,920 INFO L290 TraceCheckUtils]: 62: Hoare triple {4996#false} assume !!(~c~0 < 6); {4996#false} is VALID [2022-04-15 13:14:46,920 INFO L290 TraceCheckUtils]: 63: Hoare triple {4996#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {4996#false} is VALID [2022-04-15 13:14:46,920 INFO L290 TraceCheckUtils]: 64: Hoare triple {4996#false} assume !!(~c~0 < 6); {4996#false} is VALID [2022-04-15 13:14:46,920 INFO L290 TraceCheckUtils]: 65: Hoare triple {4996#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {4996#false} is VALID [2022-04-15 13:14:46,920 INFO L290 TraceCheckUtils]: 66: Hoare triple {4996#false} assume !!(~c~0 < 6); {4996#false} is VALID [2022-04-15 13:14:46,921 INFO L290 TraceCheckUtils]: 67: Hoare triple {4996#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {4996#false} is VALID [2022-04-15 13:14:46,921 INFO L290 TraceCheckUtils]: 68: Hoare triple {4996#false} assume !(~c~0 < 6); {4996#false} is VALID [2022-04-15 13:14:46,921 INFO L290 TraceCheckUtils]: 69: Hoare triple {4996#false} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {4996#false} is VALID [2022-04-15 13:14:46,921 INFO L290 TraceCheckUtils]: 70: Hoare triple {4996#false} assume !(~b~0 < 6); {4996#false} is VALID [2022-04-15 13:14:46,921 INFO L290 TraceCheckUtils]: 71: Hoare triple {4996#false} #t~pre4 := 1 + ~a~0;~a~0 := 1 + ~a~0;havoc #t~pre4; {4996#false} is VALID [2022-04-15 13:14:46,921 INFO L290 TraceCheckUtils]: 72: Hoare triple {4996#false} assume !(~a~0 < 6); {4996#false} is VALID [2022-04-15 13:14:46,921 INFO L290 TraceCheckUtils]: 73: Hoare triple {4996#false} assume !((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0); {4996#false} is VALID [2022-04-15 13:14:46,921 INFO L290 TraceCheckUtils]: 74: Hoare triple {4996#false} assume !false; {4996#false} is VALID [2022-04-15 13:14:46,922 INFO L134 CoverageAnalysis]: Checked inductivity of 679 backedges. 355 proven. 89 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-04-15 13:14:46,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:14:46,922 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [287300995] [2022-04-15 13:14:46,922 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [287300995] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 13:14:46,922 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1792436434] [2022-04-15 13:14:46,922 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 13:14:46,923 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 13:14:46,923 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 13:14:46,925 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 13:14:46,926 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-04-15 13:14:46,973 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 13:14:46,973 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 13:14:46,973 INFO L263 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 4 conjunts are in the unsatisfiable core [2022-04-15 13:14:46,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:14:46,985 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 13:14:47,198 INFO L272 TraceCheckUtils]: 0: Hoare triple {4995#true} call ULTIMATE.init(); {4995#true} is VALID [2022-04-15 13:14:47,199 INFO L290 TraceCheckUtils]: 1: Hoare triple {4995#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); {4995#true} is VALID [2022-04-15 13:14:47,199 INFO L290 TraceCheckUtils]: 2: Hoare triple {4995#true} assume true; {4995#true} is VALID [2022-04-15 13:14:47,199 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4995#true} {4995#true} #56#return; {4995#true} is VALID [2022-04-15 13:14:47,199 INFO L272 TraceCheckUtils]: 4: Hoare triple {4995#true} call #t~ret7 := main(); {4995#true} is VALID [2022-04-15 13:14:47,199 INFO L290 TraceCheckUtils]: 5: Hoare triple {4995#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~a~0 := 0; {4995#true} is VALID [2022-04-15 13:14:47,200 INFO L290 TraceCheckUtils]: 6: Hoare triple {4995#true} assume !!(~a~0 < 6);~b~0 := 0; {5025#(<= main_~b~0 0)} is VALID [2022-04-15 13:14:47,200 INFO L290 TraceCheckUtils]: 7: Hoare triple {5025#(<= main_~b~0 0)} assume !!(~b~0 < 6);~c~0 := 0; {5025#(<= main_~b~0 0)} is VALID [2022-04-15 13:14:47,201 INFO L290 TraceCheckUtils]: 8: Hoare triple {5025#(<= main_~b~0 0)} assume !!(~c~0 < 6); {5025#(<= main_~b~0 0)} is VALID [2022-04-15 13:14:47,201 INFO L290 TraceCheckUtils]: 9: Hoare triple {5025#(<= main_~b~0 0)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {5025#(<= main_~b~0 0)} is VALID [2022-04-15 13:14:47,202 INFO L290 TraceCheckUtils]: 10: Hoare triple {5025#(<= main_~b~0 0)} assume !!(~c~0 < 6); {5025#(<= main_~b~0 0)} is VALID [2022-04-15 13:14:47,202 INFO L290 TraceCheckUtils]: 11: Hoare triple {5025#(<= main_~b~0 0)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {5025#(<= main_~b~0 0)} is VALID [2022-04-15 13:14:47,202 INFO L290 TraceCheckUtils]: 12: Hoare triple {5025#(<= main_~b~0 0)} assume !!(~c~0 < 6); {5025#(<= main_~b~0 0)} is VALID [2022-04-15 13:14:47,203 INFO L290 TraceCheckUtils]: 13: Hoare triple {5025#(<= main_~b~0 0)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {5025#(<= main_~b~0 0)} is VALID [2022-04-15 13:14:47,204 INFO L290 TraceCheckUtils]: 14: Hoare triple {5025#(<= main_~b~0 0)} assume !!(~c~0 < 6); {5025#(<= main_~b~0 0)} is VALID [2022-04-15 13:14:47,204 INFO L290 TraceCheckUtils]: 15: Hoare triple {5025#(<= main_~b~0 0)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {5025#(<= main_~b~0 0)} is VALID [2022-04-15 13:14:47,205 INFO L290 TraceCheckUtils]: 16: Hoare triple {5025#(<= main_~b~0 0)} assume !!(~c~0 < 6); {5025#(<= main_~b~0 0)} is VALID [2022-04-15 13:14:47,205 INFO L290 TraceCheckUtils]: 17: Hoare triple {5025#(<= main_~b~0 0)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {5025#(<= main_~b~0 0)} is VALID [2022-04-15 13:14:47,205 INFO L290 TraceCheckUtils]: 18: Hoare triple {5025#(<= main_~b~0 0)} assume !!(~c~0 < 6); {5025#(<= main_~b~0 0)} is VALID [2022-04-15 13:14:47,206 INFO L290 TraceCheckUtils]: 19: Hoare triple {5025#(<= main_~b~0 0)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {5025#(<= main_~b~0 0)} is VALID [2022-04-15 13:14:47,206 INFO L290 TraceCheckUtils]: 20: Hoare triple {5025#(<= main_~b~0 0)} assume !(~c~0 < 6); {5025#(<= main_~b~0 0)} is VALID [2022-04-15 13:14:47,206 INFO L290 TraceCheckUtils]: 21: Hoare triple {5025#(<= main_~b~0 0)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {5001#(<= main_~b~0 1)} is VALID [2022-04-15 13:14:47,207 INFO L290 TraceCheckUtils]: 22: Hoare triple {5001#(<= main_~b~0 1)} assume !!(~b~0 < 6);~c~0 := 0; {5001#(<= main_~b~0 1)} is VALID [2022-04-15 13:14:47,207 INFO L290 TraceCheckUtils]: 23: Hoare triple {5001#(<= main_~b~0 1)} assume !!(~c~0 < 6); {5001#(<= main_~b~0 1)} is VALID [2022-04-15 13:14:47,209 INFO L290 TraceCheckUtils]: 24: Hoare triple {5001#(<= main_~b~0 1)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {5001#(<= main_~b~0 1)} is VALID [2022-04-15 13:14:47,210 INFO L290 TraceCheckUtils]: 25: Hoare triple {5001#(<= main_~b~0 1)} assume !!(~c~0 < 6); {5001#(<= main_~b~0 1)} is VALID [2022-04-15 13:14:47,210 INFO L290 TraceCheckUtils]: 26: Hoare triple {5001#(<= main_~b~0 1)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {5001#(<= main_~b~0 1)} is VALID [2022-04-15 13:14:47,210 INFO L290 TraceCheckUtils]: 27: Hoare triple {5001#(<= main_~b~0 1)} assume !!(~c~0 < 6); {5001#(<= main_~b~0 1)} is VALID [2022-04-15 13:14:47,210 INFO L290 TraceCheckUtils]: 28: Hoare triple {5001#(<= main_~b~0 1)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {5001#(<= main_~b~0 1)} is VALID [2022-04-15 13:14:47,211 INFO L290 TraceCheckUtils]: 29: Hoare triple {5001#(<= main_~b~0 1)} assume !!(~c~0 < 6); {5001#(<= main_~b~0 1)} is VALID [2022-04-15 13:14:47,211 INFO L290 TraceCheckUtils]: 30: Hoare triple {5001#(<= main_~b~0 1)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {5001#(<= main_~b~0 1)} is VALID [2022-04-15 13:14:47,211 INFO L290 TraceCheckUtils]: 31: Hoare triple {5001#(<= main_~b~0 1)} assume !!(~c~0 < 6); {5001#(<= main_~b~0 1)} is VALID [2022-04-15 13:14:47,212 INFO L290 TraceCheckUtils]: 32: Hoare triple {5001#(<= main_~b~0 1)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {5001#(<= main_~b~0 1)} is VALID [2022-04-15 13:14:47,212 INFO L290 TraceCheckUtils]: 33: Hoare triple {5001#(<= main_~b~0 1)} assume !!(~c~0 < 6); {5001#(<= main_~b~0 1)} is VALID [2022-04-15 13:14:47,212 INFO L290 TraceCheckUtils]: 34: Hoare triple {5001#(<= main_~b~0 1)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {5001#(<= main_~b~0 1)} is VALID [2022-04-15 13:14:47,212 INFO L290 TraceCheckUtils]: 35: Hoare triple {5001#(<= main_~b~0 1)} assume !(~c~0 < 6); {5001#(<= main_~b~0 1)} is VALID [2022-04-15 13:14:47,213 INFO L290 TraceCheckUtils]: 36: Hoare triple {5001#(<= main_~b~0 1)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {5002#(<= main_~b~0 2)} is VALID [2022-04-15 13:14:47,213 INFO L290 TraceCheckUtils]: 37: Hoare triple {5002#(<= main_~b~0 2)} assume !(~b~0 < 6); {4996#false} is VALID [2022-04-15 13:14:47,213 INFO L290 TraceCheckUtils]: 38: Hoare triple {4996#false} #t~pre4 := 1 + ~a~0;~a~0 := 1 + ~a~0;havoc #t~pre4; {4996#false} is VALID [2022-04-15 13:14:47,213 INFO L290 TraceCheckUtils]: 39: Hoare triple {4996#false} assume !!(~a~0 < 6);~b~0 := 0; {4996#false} is VALID [2022-04-15 13:14:47,213 INFO L290 TraceCheckUtils]: 40: Hoare triple {4996#false} assume !!(~b~0 < 6);~c~0 := 0; {4996#false} is VALID [2022-04-15 13:14:47,213 INFO L290 TraceCheckUtils]: 41: Hoare triple {4996#false} assume !!(~c~0 < 6); {4996#false} is VALID [2022-04-15 13:14:47,214 INFO L290 TraceCheckUtils]: 42: Hoare triple {4996#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {4996#false} is VALID [2022-04-15 13:14:47,214 INFO L290 TraceCheckUtils]: 43: Hoare triple {4996#false} assume !!(~c~0 < 6); {4996#false} is VALID [2022-04-15 13:14:47,214 INFO L290 TraceCheckUtils]: 44: Hoare triple {4996#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {4996#false} is VALID [2022-04-15 13:14:47,214 INFO L290 TraceCheckUtils]: 45: Hoare triple {4996#false} assume !!(~c~0 < 6); {4996#false} is VALID [2022-04-15 13:14:47,214 INFO L290 TraceCheckUtils]: 46: Hoare triple {4996#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {4996#false} is VALID [2022-04-15 13:14:47,214 INFO L290 TraceCheckUtils]: 47: Hoare triple {4996#false} assume !!(~c~0 < 6); {4996#false} is VALID [2022-04-15 13:14:47,214 INFO L290 TraceCheckUtils]: 48: Hoare triple {4996#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {4996#false} is VALID [2022-04-15 13:14:47,214 INFO L290 TraceCheckUtils]: 49: Hoare triple {4996#false} assume !!(~c~0 < 6); {4996#false} is VALID [2022-04-15 13:14:47,214 INFO L290 TraceCheckUtils]: 50: Hoare triple {4996#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {4996#false} is VALID [2022-04-15 13:14:47,214 INFO L290 TraceCheckUtils]: 51: Hoare triple {4996#false} assume !!(~c~0 < 6); {4996#false} is VALID [2022-04-15 13:14:47,214 INFO L290 TraceCheckUtils]: 52: Hoare triple {4996#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {4996#false} is VALID [2022-04-15 13:14:47,214 INFO L290 TraceCheckUtils]: 53: Hoare triple {4996#false} assume !(~c~0 < 6); {4996#false} is VALID [2022-04-15 13:14:47,214 INFO L290 TraceCheckUtils]: 54: Hoare triple {4996#false} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {4996#false} is VALID [2022-04-15 13:14:47,214 INFO L290 TraceCheckUtils]: 55: Hoare triple {4996#false} assume !!(~b~0 < 6);~c~0 := 0; {4996#false} is VALID [2022-04-15 13:14:47,215 INFO L290 TraceCheckUtils]: 56: Hoare triple {4996#false} assume !!(~c~0 < 6); {4996#false} is VALID [2022-04-15 13:14:47,215 INFO L290 TraceCheckUtils]: 57: Hoare triple {4996#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {4996#false} is VALID [2022-04-15 13:14:47,215 INFO L290 TraceCheckUtils]: 58: Hoare triple {4996#false} assume !!(~c~0 < 6); {4996#false} is VALID [2022-04-15 13:14:47,215 INFO L290 TraceCheckUtils]: 59: Hoare triple {4996#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {4996#false} is VALID [2022-04-15 13:14:47,215 INFO L290 TraceCheckUtils]: 60: Hoare triple {4996#false} assume !!(~c~0 < 6); {4996#false} is VALID [2022-04-15 13:14:47,215 INFO L290 TraceCheckUtils]: 61: Hoare triple {4996#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {4996#false} is VALID [2022-04-15 13:14:47,215 INFO L290 TraceCheckUtils]: 62: Hoare triple {4996#false} assume !!(~c~0 < 6); {4996#false} is VALID [2022-04-15 13:14:47,215 INFO L290 TraceCheckUtils]: 63: Hoare triple {4996#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {4996#false} is VALID [2022-04-15 13:14:47,215 INFO L290 TraceCheckUtils]: 64: Hoare triple {4996#false} assume !!(~c~0 < 6); {4996#false} is VALID [2022-04-15 13:14:47,215 INFO L290 TraceCheckUtils]: 65: Hoare triple {4996#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {4996#false} is VALID [2022-04-15 13:14:47,215 INFO L290 TraceCheckUtils]: 66: Hoare triple {4996#false} assume !!(~c~0 < 6); {4996#false} is VALID [2022-04-15 13:14:47,215 INFO L290 TraceCheckUtils]: 67: Hoare triple {4996#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {4996#false} is VALID [2022-04-15 13:14:47,215 INFO L290 TraceCheckUtils]: 68: Hoare triple {4996#false} assume !(~c~0 < 6); {4996#false} is VALID [2022-04-15 13:14:47,216 INFO L290 TraceCheckUtils]: 69: Hoare triple {4996#false} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {4996#false} is VALID [2022-04-15 13:14:47,216 INFO L290 TraceCheckUtils]: 70: Hoare triple {4996#false} assume !(~b~0 < 6); {4996#false} is VALID [2022-04-15 13:14:47,216 INFO L290 TraceCheckUtils]: 71: Hoare triple {4996#false} #t~pre4 := 1 + ~a~0;~a~0 := 1 + ~a~0;havoc #t~pre4; {4996#false} is VALID [2022-04-15 13:14:47,216 INFO L290 TraceCheckUtils]: 72: Hoare triple {4996#false} assume !(~a~0 < 6); {4996#false} is VALID [2022-04-15 13:14:47,216 INFO L290 TraceCheckUtils]: 73: Hoare triple {4996#false} assume !((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0); {4996#false} is VALID [2022-04-15 13:14:47,216 INFO L290 TraceCheckUtils]: 74: Hoare triple {4996#false} assume !false; {4996#false} is VALID [2022-04-15 13:14:47,216 INFO L134 CoverageAnalysis]: Checked inductivity of 679 backedges. 355 proven. 89 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-04-15 13:14:47,216 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 13:14:47,438 INFO L290 TraceCheckUtils]: 74: Hoare triple {4996#false} assume !false; {4996#false} is VALID [2022-04-15 13:14:47,439 INFO L290 TraceCheckUtils]: 73: Hoare triple {4996#false} assume !((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0); {4996#false} is VALID [2022-04-15 13:14:47,439 INFO L290 TraceCheckUtils]: 72: Hoare triple {4996#false} assume !(~a~0 < 6); {4996#false} is VALID [2022-04-15 13:14:47,439 INFO L290 TraceCheckUtils]: 71: Hoare triple {4996#false} #t~pre4 := 1 + ~a~0;~a~0 := 1 + ~a~0;havoc #t~pre4; {4996#false} is VALID [2022-04-15 13:14:47,439 INFO L290 TraceCheckUtils]: 70: Hoare triple {4996#false} assume !(~b~0 < 6); {4996#false} is VALID [2022-04-15 13:14:47,439 INFO L290 TraceCheckUtils]: 69: Hoare triple {4996#false} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {4996#false} is VALID [2022-04-15 13:14:47,439 INFO L290 TraceCheckUtils]: 68: Hoare triple {4996#false} assume !(~c~0 < 6); {4996#false} is VALID [2022-04-15 13:14:47,439 INFO L290 TraceCheckUtils]: 67: Hoare triple {4996#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {4996#false} is VALID [2022-04-15 13:14:47,439 INFO L290 TraceCheckUtils]: 66: Hoare triple {4996#false} assume !!(~c~0 < 6); {4996#false} is VALID [2022-04-15 13:14:47,439 INFO L290 TraceCheckUtils]: 65: Hoare triple {4996#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {4996#false} is VALID [2022-04-15 13:14:47,440 INFO L290 TraceCheckUtils]: 64: Hoare triple {4996#false} assume !!(~c~0 < 6); {4996#false} is VALID [2022-04-15 13:14:47,440 INFO L290 TraceCheckUtils]: 63: Hoare triple {4996#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {4996#false} is VALID [2022-04-15 13:14:47,440 INFO L290 TraceCheckUtils]: 62: Hoare triple {4996#false} assume !!(~c~0 < 6); {4996#false} is VALID [2022-04-15 13:14:47,440 INFO L290 TraceCheckUtils]: 61: Hoare triple {4996#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {4996#false} is VALID [2022-04-15 13:14:47,440 INFO L290 TraceCheckUtils]: 60: Hoare triple {4996#false} assume !!(~c~0 < 6); {4996#false} is VALID [2022-04-15 13:14:47,440 INFO L290 TraceCheckUtils]: 59: Hoare triple {4996#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {4996#false} is VALID [2022-04-15 13:14:47,440 INFO L290 TraceCheckUtils]: 58: Hoare triple {4996#false} assume !!(~c~0 < 6); {4996#false} is VALID [2022-04-15 13:14:47,440 INFO L290 TraceCheckUtils]: 57: Hoare triple {4996#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {4996#false} is VALID [2022-04-15 13:14:47,440 INFO L290 TraceCheckUtils]: 56: Hoare triple {4996#false} assume !!(~c~0 < 6); {4996#false} is VALID [2022-04-15 13:14:47,440 INFO L290 TraceCheckUtils]: 55: Hoare triple {4996#false} assume !!(~b~0 < 6);~c~0 := 0; {4996#false} is VALID [2022-04-15 13:14:47,441 INFO L290 TraceCheckUtils]: 54: Hoare triple {4996#false} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {4996#false} is VALID [2022-04-15 13:14:47,441 INFO L290 TraceCheckUtils]: 53: Hoare triple {4996#false} assume !(~c~0 < 6); {4996#false} is VALID [2022-04-15 13:14:47,441 INFO L290 TraceCheckUtils]: 52: Hoare triple {4996#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {4996#false} is VALID [2022-04-15 13:14:47,441 INFO L290 TraceCheckUtils]: 51: Hoare triple {4996#false} assume !!(~c~0 < 6); {4996#false} is VALID [2022-04-15 13:14:47,441 INFO L290 TraceCheckUtils]: 50: Hoare triple {4996#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {4996#false} is VALID [2022-04-15 13:14:47,441 INFO L290 TraceCheckUtils]: 49: Hoare triple {4996#false} assume !!(~c~0 < 6); {4996#false} is VALID [2022-04-15 13:14:47,441 INFO L290 TraceCheckUtils]: 48: Hoare triple {4996#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {4996#false} is VALID [2022-04-15 13:14:47,441 INFO L290 TraceCheckUtils]: 47: Hoare triple {4996#false} assume !!(~c~0 < 6); {4996#false} is VALID [2022-04-15 13:14:47,441 INFO L290 TraceCheckUtils]: 46: Hoare triple {4996#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {4996#false} is VALID [2022-04-15 13:14:47,441 INFO L290 TraceCheckUtils]: 45: Hoare triple {4996#false} assume !!(~c~0 < 6); {4996#false} is VALID [2022-04-15 13:14:47,442 INFO L290 TraceCheckUtils]: 44: Hoare triple {4996#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {4996#false} is VALID [2022-04-15 13:14:47,442 INFO L290 TraceCheckUtils]: 43: Hoare triple {4996#false} assume !!(~c~0 < 6); {4996#false} is VALID [2022-04-15 13:14:47,442 INFO L290 TraceCheckUtils]: 42: Hoare triple {4996#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {4996#false} is VALID [2022-04-15 13:14:47,442 INFO L290 TraceCheckUtils]: 41: Hoare triple {4996#false} assume !!(~c~0 < 6); {4996#false} is VALID [2022-04-15 13:14:47,442 INFO L290 TraceCheckUtils]: 40: Hoare triple {4996#false} assume !!(~b~0 < 6);~c~0 := 0; {4996#false} is VALID [2022-04-15 13:14:47,442 INFO L290 TraceCheckUtils]: 39: Hoare triple {4996#false} assume !!(~a~0 < 6);~b~0 := 0; {4996#false} is VALID [2022-04-15 13:14:47,442 INFO L290 TraceCheckUtils]: 38: Hoare triple {4996#false} #t~pre4 := 1 + ~a~0;~a~0 := 1 + ~a~0;havoc #t~pre4; {4996#false} is VALID [2022-04-15 13:14:47,442 INFO L290 TraceCheckUtils]: 37: Hoare triple {5341#(< main_~b~0 6)} assume !(~b~0 < 6); {4996#false} is VALID [2022-04-15 13:14:47,443 INFO L290 TraceCheckUtils]: 36: Hoare triple {5345#(< main_~b~0 5)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {5341#(< main_~b~0 6)} is VALID [2022-04-15 13:14:47,444 INFO L290 TraceCheckUtils]: 35: Hoare triple {5345#(< main_~b~0 5)} assume !(~c~0 < 6); {5345#(< main_~b~0 5)} is VALID [2022-04-15 13:14:47,444 INFO L290 TraceCheckUtils]: 34: Hoare triple {5345#(< main_~b~0 5)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {5345#(< main_~b~0 5)} is VALID [2022-04-15 13:14:47,444 INFO L290 TraceCheckUtils]: 33: Hoare triple {5345#(< main_~b~0 5)} assume !!(~c~0 < 6); {5345#(< main_~b~0 5)} is VALID [2022-04-15 13:14:47,445 INFO L290 TraceCheckUtils]: 32: Hoare triple {5345#(< main_~b~0 5)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {5345#(< main_~b~0 5)} is VALID [2022-04-15 13:14:47,445 INFO L290 TraceCheckUtils]: 31: Hoare triple {5345#(< main_~b~0 5)} assume !!(~c~0 < 6); {5345#(< main_~b~0 5)} is VALID [2022-04-15 13:14:47,445 INFO L290 TraceCheckUtils]: 30: Hoare triple {5345#(< main_~b~0 5)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {5345#(< main_~b~0 5)} is VALID [2022-04-15 13:14:47,446 INFO L290 TraceCheckUtils]: 29: Hoare triple {5345#(< main_~b~0 5)} assume !!(~c~0 < 6); {5345#(< main_~b~0 5)} is VALID [2022-04-15 13:14:47,446 INFO L290 TraceCheckUtils]: 28: Hoare triple {5345#(< main_~b~0 5)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {5345#(< main_~b~0 5)} is VALID [2022-04-15 13:14:47,447 INFO L290 TraceCheckUtils]: 27: Hoare triple {5345#(< main_~b~0 5)} assume !!(~c~0 < 6); {5345#(< main_~b~0 5)} is VALID [2022-04-15 13:14:47,447 INFO L290 TraceCheckUtils]: 26: Hoare triple {5345#(< main_~b~0 5)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {5345#(< main_~b~0 5)} is VALID [2022-04-15 13:14:47,447 INFO L290 TraceCheckUtils]: 25: Hoare triple {5345#(< main_~b~0 5)} assume !!(~c~0 < 6); {5345#(< main_~b~0 5)} is VALID [2022-04-15 13:14:47,448 INFO L290 TraceCheckUtils]: 24: Hoare triple {5345#(< main_~b~0 5)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {5345#(< main_~b~0 5)} is VALID [2022-04-15 13:14:47,448 INFO L290 TraceCheckUtils]: 23: Hoare triple {5345#(< main_~b~0 5)} assume !!(~c~0 < 6); {5345#(< main_~b~0 5)} is VALID [2022-04-15 13:14:47,449 INFO L290 TraceCheckUtils]: 22: Hoare triple {5345#(< main_~b~0 5)} assume !!(~b~0 < 6);~c~0 := 0; {5345#(< main_~b~0 5)} is VALID [2022-04-15 13:14:47,449 INFO L290 TraceCheckUtils]: 21: Hoare triple {5391#(< main_~b~0 4)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {5345#(< main_~b~0 5)} is VALID [2022-04-15 13:14:47,450 INFO L290 TraceCheckUtils]: 20: Hoare triple {5391#(< main_~b~0 4)} assume !(~c~0 < 6); {5391#(< main_~b~0 4)} is VALID [2022-04-15 13:14:47,450 INFO L290 TraceCheckUtils]: 19: Hoare triple {5391#(< main_~b~0 4)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {5391#(< main_~b~0 4)} is VALID [2022-04-15 13:14:47,450 INFO L290 TraceCheckUtils]: 18: Hoare triple {5391#(< main_~b~0 4)} assume !!(~c~0 < 6); {5391#(< main_~b~0 4)} is VALID [2022-04-15 13:14:47,451 INFO L290 TraceCheckUtils]: 17: Hoare triple {5391#(< main_~b~0 4)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {5391#(< main_~b~0 4)} is VALID [2022-04-15 13:14:47,451 INFO L290 TraceCheckUtils]: 16: Hoare triple {5391#(< main_~b~0 4)} assume !!(~c~0 < 6); {5391#(< main_~b~0 4)} is VALID [2022-04-15 13:14:47,452 INFO L290 TraceCheckUtils]: 15: Hoare triple {5391#(< main_~b~0 4)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {5391#(< main_~b~0 4)} is VALID [2022-04-15 13:14:47,452 INFO L290 TraceCheckUtils]: 14: Hoare triple {5391#(< main_~b~0 4)} assume !!(~c~0 < 6); {5391#(< main_~b~0 4)} is VALID [2022-04-15 13:14:47,452 INFO L290 TraceCheckUtils]: 13: Hoare triple {5391#(< main_~b~0 4)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {5391#(< main_~b~0 4)} is VALID [2022-04-15 13:14:47,453 INFO L290 TraceCheckUtils]: 12: Hoare triple {5391#(< main_~b~0 4)} assume !!(~c~0 < 6); {5391#(< main_~b~0 4)} is VALID [2022-04-15 13:14:47,453 INFO L290 TraceCheckUtils]: 11: Hoare triple {5391#(< main_~b~0 4)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {5391#(< main_~b~0 4)} is VALID [2022-04-15 13:14:47,453 INFO L290 TraceCheckUtils]: 10: Hoare triple {5391#(< main_~b~0 4)} assume !!(~c~0 < 6); {5391#(< main_~b~0 4)} is VALID [2022-04-15 13:14:47,453 INFO L290 TraceCheckUtils]: 9: Hoare triple {5391#(< main_~b~0 4)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {5391#(< main_~b~0 4)} is VALID [2022-04-15 13:14:47,454 INFO L290 TraceCheckUtils]: 8: Hoare triple {5391#(< main_~b~0 4)} assume !!(~c~0 < 6); {5391#(< main_~b~0 4)} is VALID [2022-04-15 13:14:47,454 INFO L290 TraceCheckUtils]: 7: Hoare triple {5391#(< main_~b~0 4)} assume !!(~b~0 < 6);~c~0 := 0; {5391#(< main_~b~0 4)} is VALID [2022-04-15 13:14:47,454 INFO L290 TraceCheckUtils]: 6: Hoare triple {4995#true} assume !!(~a~0 < 6);~b~0 := 0; {5391#(< main_~b~0 4)} is VALID [2022-04-15 13:14:47,454 INFO L290 TraceCheckUtils]: 5: Hoare triple {4995#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~a~0 := 0; {4995#true} is VALID [2022-04-15 13:14:47,454 INFO L272 TraceCheckUtils]: 4: Hoare triple {4995#true} call #t~ret7 := main(); {4995#true} is VALID [2022-04-15 13:14:47,455 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4995#true} {4995#true} #56#return; {4995#true} is VALID [2022-04-15 13:14:47,455 INFO L290 TraceCheckUtils]: 2: Hoare triple {4995#true} assume true; {4995#true} is VALID [2022-04-15 13:14:47,455 INFO L290 TraceCheckUtils]: 1: Hoare triple {4995#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); {4995#true} is VALID [2022-04-15 13:14:47,455 INFO L272 TraceCheckUtils]: 0: Hoare triple {4995#true} call ULTIMATE.init(); {4995#true} is VALID [2022-04-15 13:14:47,455 INFO L134 CoverageAnalysis]: Checked inductivity of 679 backedges. 355 proven. 89 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-04-15 13:14:47,455 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1792436434] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 13:14:47,455 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 13:14:47,455 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 10 [2022-04-15 13:14:47,456 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:14:47,456 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [402925453] [2022-04-15 13:14:47,456 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [402925453] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:14:47,456 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:14:47,456 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 13:14:47,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1896522792] [2022-04-15 13:14:47,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:14:47,456 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 75 [2022-04-15 13:14:47,456 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:14:47,457 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:14:47,473 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 13:14:47,473 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 13:14:47,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:14:47,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 13:14:47,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2022-04-15 13:14:47,474 INFO L87 Difference]: Start difference. First operand 76 states and 82 transitions. Second operand has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:14:47,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:14:47,742 INFO L93 Difference]: Finished difference Result 172 states and 187 transitions. [2022-04-15 13:14:47,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-15 13:14:47,742 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 75 [2022-04-15 13:14:47,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:14:47,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:14:47,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 44 transitions. [2022-04-15 13:14:47,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:14:47,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 44 transitions. [2022-04-15 13:14:47,746 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 44 transitions. [2022-04-15 13:14:47,778 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:14:47,780 INFO L225 Difference]: With dead ends: 172 [2022-04-15 13:14:47,781 INFO L226 Difference]: Without dead ends: 134 [2022-04-15 13:14:47,781 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=66, Invalid=90, Unknown=0, NotChecked=0, Total=156 [2022-04-15 13:14:47,781 INFO L913 BasicCegarLoop]: 15 mSDtfsCounter, 36 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 13:14:47,782 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [36 Valid, 27 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 13:14:47,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2022-04-15 13:14:47,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 106. [2022-04-15 13:14:47,896 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:14:47,896 INFO L82 GeneralOperation]: Start isEquivalent. First operand 134 states. Second operand has 106 states, 102 states have (on average 1.088235294117647) internal successors, (111), 102 states have internal predecessors, (111), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:14:47,896 INFO L74 IsIncluded]: Start isIncluded. First operand 134 states. Second operand has 106 states, 102 states have (on average 1.088235294117647) internal successors, (111), 102 states have internal predecessors, (111), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:14:47,897 INFO L87 Difference]: Start difference. First operand 134 states. Second operand has 106 states, 102 states have (on average 1.088235294117647) internal successors, (111), 102 states have internal predecessors, (111), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:14:47,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:14:47,899 INFO L93 Difference]: Finished difference Result 134 states and 144 transitions. [2022-04-15 13:14:47,899 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 144 transitions. [2022-04-15 13:14:47,900 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:14:47,900 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:14:47,900 INFO L74 IsIncluded]: Start isIncluded. First operand has 106 states, 102 states have (on average 1.088235294117647) internal successors, (111), 102 states have internal predecessors, (111), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 134 states. [2022-04-15 13:14:47,900 INFO L87 Difference]: Start difference. First operand has 106 states, 102 states have (on average 1.088235294117647) internal successors, (111), 102 states have internal predecessors, (111), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 134 states. [2022-04-15 13:14:47,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:14:47,902 INFO L93 Difference]: Finished difference Result 134 states and 144 transitions. [2022-04-15 13:14:47,903 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 144 transitions. [2022-04-15 13:14:47,903 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:14:47,903 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:14:47,903 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:14:47,903 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:14:47,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 102 states have (on average 1.088235294117647) internal successors, (111), 102 states have internal predecessors, (111), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:14:47,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 114 transitions. [2022-04-15 13:14:47,905 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 114 transitions. Word has length 75 [2022-04-15 13:14:47,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:14:47,905 INFO L478 AbstractCegarLoop]: Abstraction has 106 states and 114 transitions. [2022-04-15 13:14:47,906 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:14:47,906 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 106 states and 114 transitions. [2022-04-15 13:14:48,010 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 114 edges. 114 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:14:48,010 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 114 transitions. [2022-04-15 13:14:48,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-04-15 13:14:48,011 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:14:48,011 INFO L499 BasicCegarLoop]: trace histogram [36, 36, 6, 6, 6, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 13:14:48,027 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-04-15 13:14:48,215 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2022-04-15 13:14:48,216 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:14:48,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:14:48,216 INFO L85 PathProgramCache]: Analyzing trace with hash 2068267583, now seen corresponding path program 17 times [2022-04-15 13:14:48,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:14:48,216 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2085112591] [2022-04-15 13:14:49,205 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 13:14:49,206 INFO L85 PathProgramCache]: Analyzing trace with hash 1694553871, now seen corresponding path program 1 times [2022-04-15 13:14:49,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:14:49,206 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165170238] [2022-04-15 13:14:49,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:14:49,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:14:49,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 13:14:49,210 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 13:14:49,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 13:14:49,213 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 13:14:49,213 INFO L85 PathProgramCache]: Analyzing trace with hash 2068267583, now seen corresponding path program 18 times [2022-04-15 13:14:49,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:14:49,213 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1667873442] [2022-04-15 13:14:49,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:14:49,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:14:49,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:14:49,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 13:14:49,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:14:49,318 INFO L290 TraceCheckUtils]: 0: Hoare triple {6296#(and (= |#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); {6287#true} is VALID [2022-04-15 13:14:49,318 INFO L290 TraceCheckUtils]: 1: Hoare triple {6287#true} assume true; {6287#true} is VALID [2022-04-15 13:14:49,318 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {6287#true} {6287#true} #56#return; {6287#true} is VALID [2022-04-15 13:14:49,318 INFO L272 TraceCheckUtils]: 0: Hoare triple {6287#true} call ULTIMATE.init(); {6296#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 13:14:49,318 INFO L290 TraceCheckUtils]: 1: Hoare triple {6296#(and (= |#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); {6287#true} is VALID [2022-04-15 13:14:49,319 INFO L290 TraceCheckUtils]: 2: Hoare triple {6287#true} assume true; {6287#true} is VALID [2022-04-15 13:14:49,319 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6287#true} {6287#true} #56#return; {6287#true} is VALID [2022-04-15 13:14:49,319 INFO L272 TraceCheckUtils]: 4: Hoare triple {6287#true} call #t~ret7 := main(); {6287#true} is VALID [2022-04-15 13:14:49,319 INFO L290 TraceCheckUtils]: 5: Hoare triple {6287#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~a~0 := 0; {6287#true} is VALID [2022-04-15 13:14:49,321 INFO L290 TraceCheckUtils]: 6: Hoare triple {6287#true} assume !!(~a~0 < 6);~b~0 := 0; {6292#(= main_~b~0 0)} is VALID [2022-04-15 13:14:49,321 INFO L290 TraceCheckUtils]: 7: Hoare triple {6292#(= main_~b~0 0)} assume !!(~b~0 < 6);~c~0 := 0; {6292#(= main_~b~0 0)} is VALID [2022-04-15 13:14:49,322 INFO L290 TraceCheckUtils]: 8: Hoare triple {6292#(= main_~b~0 0)} assume !!(~c~0 < 6); {6292#(= main_~b~0 0)} is VALID [2022-04-15 13:14:49,322 INFO L290 TraceCheckUtils]: 9: Hoare triple {6292#(= main_~b~0 0)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {6292#(= main_~b~0 0)} is VALID [2022-04-15 13:14:49,322 INFO L290 TraceCheckUtils]: 10: Hoare triple {6292#(= main_~b~0 0)} assume !!(~c~0 < 6); {6292#(= main_~b~0 0)} is VALID [2022-04-15 13:14:49,323 INFO L290 TraceCheckUtils]: 11: Hoare triple {6292#(= main_~b~0 0)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {6292#(= main_~b~0 0)} is VALID [2022-04-15 13:14:49,323 INFO L290 TraceCheckUtils]: 12: Hoare triple {6292#(= main_~b~0 0)} assume !!(~c~0 < 6); {6292#(= main_~b~0 0)} is VALID [2022-04-15 13:14:49,323 INFO L290 TraceCheckUtils]: 13: Hoare triple {6292#(= main_~b~0 0)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {6292#(= main_~b~0 0)} is VALID [2022-04-15 13:14:49,323 INFO L290 TraceCheckUtils]: 14: Hoare triple {6292#(= main_~b~0 0)} assume !!(~c~0 < 6); {6292#(= main_~b~0 0)} is VALID [2022-04-15 13:14:49,324 INFO L290 TraceCheckUtils]: 15: Hoare triple {6292#(= main_~b~0 0)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {6292#(= main_~b~0 0)} is VALID [2022-04-15 13:14:49,324 INFO L290 TraceCheckUtils]: 16: Hoare triple {6292#(= main_~b~0 0)} assume !!(~c~0 < 6); {6292#(= main_~b~0 0)} is VALID [2022-04-15 13:14:49,324 INFO L290 TraceCheckUtils]: 17: Hoare triple {6292#(= main_~b~0 0)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {6292#(= main_~b~0 0)} is VALID [2022-04-15 13:14:49,324 INFO L290 TraceCheckUtils]: 18: Hoare triple {6292#(= main_~b~0 0)} assume !!(~c~0 < 6); {6292#(= main_~b~0 0)} is VALID [2022-04-15 13:14:49,325 INFO L290 TraceCheckUtils]: 19: Hoare triple {6292#(= main_~b~0 0)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {6292#(= main_~b~0 0)} is VALID [2022-04-15 13:14:49,325 INFO L290 TraceCheckUtils]: 20: Hoare triple {6292#(= main_~b~0 0)} assume !(~c~0 < 6); {6292#(= main_~b~0 0)} is VALID [2022-04-15 13:14:49,325 INFO L290 TraceCheckUtils]: 21: Hoare triple {6292#(= main_~b~0 0)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {6293#(<= main_~b~0 1)} is VALID [2022-04-15 13:14:49,326 INFO L290 TraceCheckUtils]: 22: Hoare triple {6293#(<= main_~b~0 1)} assume !!(~b~0 < 6);~c~0 := 0; {6293#(<= main_~b~0 1)} is VALID [2022-04-15 13:14:49,326 INFO L290 TraceCheckUtils]: 23: Hoare triple {6293#(<= main_~b~0 1)} assume !!(~c~0 < 6); {6293#(<= main_~b~0 1)} is VALID [2022-04-15 13:14:49,326 INFO L290 TraceCheckUtils]: 24: Hoare triple {6293#(<= main_~b~0 1)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {6293#(<= main_~b~0 1)} is VALID [2022-04-15 13:14:49,326 INFO L290 TraceCheckUtils]: 25: Hoare triple {6293#(<= main_~b~0 1)} assume !!(~c~0 < 6); {6293#(<= main_~b~0 1)} is VALID [2022-04-15 13:14:49,327 INFO L290 TraceCheckUtils]: 26: Hoare triple {6293#(<= main_~b~0 1)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {6293#(<= main_~b~0 1)} is VALID [2022-04-15 13:14:49,327 INFO L290 TraceCheckUtils]: 27: Hoare triple {6293#(<= main_~b~0 1)} assume !!(~c~0 < 6); {6293#(<= main_~b~0 1)} is VALID [2022-04-15 13:14:49,327 INFO L290 TraceCheckUtils]: 28: Hoare triple {6293#(<= main_~b~0 1)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {6293#(<= main_~b~0 1)} is VALID [2022-04-15 13:14:49,328 INFO L290 TraceCheckUtils]: 29: Hoare triple {6293#(<= main_~b~0 1)} assume !!(~c~0 < 6); {6293#(<= main_~b~0 1)} is VALID [2022-04-15 13:14:49,328 INFO L290 TraceCheckUtils]: 30: Hoare triple {6293#(<= main_~b~0 1)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {6293#(<= main_~b~0 1)} is VALID [2022-04-15 13:14:49,328 INFO L290 TraceCheckUtils]: 31: Hoare triple {6293#(<= main_~b~0 1)} assume !!(~c~0 < 6); {6293#(<= main_~b~0 1)} is VALID [2022-04-15 13:14:49,328 INFO L290 TraceCheckUtils]: 32: Hoare triple {6293#(<= main_~b~0 1)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {6293#(<= main_~b~0 1)} is VALID [2022-04-15 13:14:49,329 INFO L290 TraceCheckUtils]: 33: Hoare triple {6293#(<= main_~b~0 1)} assume !!(~c~0 < 6); {6293#(<= main_~b~0 1)} is VALID [2022-04-15 13:14:49,329 INFO L290 TraceCheckUtils]: 34: Hoare triple {6293#(<= main_~b~0 1)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {6293#(<= main_~b~0 1)} is VALID [2022-04-15 13:14:49,329 INFO L290 TraceCheckUtils]: 35: Hoare triple {6293#(<= main_~b~0 1)} assume !(~c~0 < 6); {6293#(<= main_~b~0 1)} is VALID [2022-04-15 13:14:49,330 INFO L290 TraceCheckUtils]: 36: Hoare triple {6293#(<= main_~b~0 1)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {6294#(<= main_~b~0 2)} is VALID [2022-04-15 13:14:49,330 INFO L290 TraceCheckUtils]: 37: Hoare triple {6294#(<= main_~b~0 2)} assume !!(~b~0 < 6);~c~0 := 0; {6294#(<= main_~b~0 2)} is VALID [2022-04-15 13:14:49,330 INFO L290 TraceCheckUtils]: 38: Hoare triple {6294#(<= main_~b~0 2)} assume !!(~c~0 < 6); {6294#(<= main_~b~0 2)} is VALID [2022-04-15 13:14:49,331 INFO L290 TraceCheckUtils]: 39: Hoare triple {6294#(<= main_~b~0 2)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {6294#(<= main_~b~0 2)} is VALID [2022-04-15 13:14:49,331 INFO L290 TraceCheckUtils]: 40: Hoare triple {6294#(<= main_~b~0 2)} assume !!(~c~0 < 6); {6294#(<= main_~b~0 2)} is VALID [2022-04-15 13:14:49,331 INFO L290 TraceCheckUtils]: 41: Hoare triple {6294#(<= main_~b~0 2)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {6294#(<= main_~b~0 2)} is VALID [2022-04-15 13:14:49,331 INFO L290 TraceCheckUtils]: 42: Hoare triple {6294#(<= main_~b~0 2)} assume !!(~c~0 < 6); {6294#(<= main_~b~0 2)} is VALID [2022-04-15 13:14:49,332 INFO L290 TraceCheckUtils]: 43: Hoare triple {6294#(<= main_~b~0 2)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {6294#(<= main_~b~0 2)} is VALID [2022-04-15 13:14:49,332 INFO L290 TraceCheckUtils]: 44: Hoare triple {6294#(<= main_~b~0 2)} assume !!(~c~0 < 6); {6294#(<= main_~b~0 2)} is VALID [2022-04-15 13:14:49,332 INFO L290 TraceCheckUtils]: 45: Hoare triple {6294#(<= main_~b~0 2)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {6294#(<= main_~b~0 2)} is VALID [2022-04-15 13:14:49,332 INFO L290 TraceCheckUtils]: 46: Hoare triple {6294#(<= main_~b~0 2)} assume !!(~c~0 < 6); {6294#(<= main_~b~0 2)} is VALID [2022-04-15 13:14:49,333 INFO L290 TraceCheckUtils]: 47: Hoare triple {6294#(<= main_~b~0 2)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {6294#(<= main_~b~0 2)} is VALID [2022-04-15 13:14:49,333 INFO L290 TraceCheckUtils]: 48: Hoare triple {6294#(<= main_~b~0 2)} assume !!(~c~0 < 6); {6294#(<= main_~b~0 2)} is VALID [2022-04-15 13:14:49,333 INFO L290 TraceCheckUtils]: 49: Hoare triple {6294#(<= main_~b~0 2)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {6294#(<= main_~b~0 2)} is VALID [2022-04-15 13:14:49,334 INFO L290 TraceCheckUtils]: 50: Hoare triple {6294#(<= main_~b~0 2)} assume !(~c~0 < 6); {6294#(<= main_~b~0 2)} is VALID [2022-04-15 13:14:49,334 INFO L290 TraceCheckUtils]: 51: Hoare triple {6294#(<= main_~b~0 2)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {6295#(<= main_~b~0 3)} is VALID [2022-04-15 13:14:49,334 INFO L290 TraceCheckUtils]: 52: Hoare triple {6295#(<= main_~b~0 3)} assume !(~b~0 < 6); {6288#false} is VALID [2022-04-15 13:14:49,334 INFO L290 TraceCheckUtils]: 53: Hoare triple {6288#false} #t~pre4 := 1 + ~a~0;~a~0 := 1 + ~a~0;havoc #t~pre4; {6288#false} is VALID [2022-04-15 13:14:49,334 INFO L290 TraceCheckUtils]: 54: Hoare triple {6288#false} assume !!(~a~0 < 6);~b~0 := 0; {6288#false} is VALID [2022-04-15 13:14:49,334 INFO L290 TraceCheckUtils]: 55: Hoare triple {6288#false} assume !!(~b~0 < 6);~c~0 := 0; {6288#false} is VALID [2022-04-15 13:14:49,335 INFO L290 TraceCheckUtils]: 56: Hoare triple {6288#false} assume !!(~c~0 < 6); {6288#false} is VALID [2022-04-15 13:14:49,335 INFO L290 TraceCheckUtils]: 57: Hoare triple {6288#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {6288#false} is VALID [2022-04-15 13:14:49,335 INFO L290 TraceCheckUtils]: 58: Hoare triple {6288#false} assume !!(~c~0 < 6); {6288#false} is VALID [2022-04-15 13:14:49,335 INFO L290 TraceCheckUtils]: 59: Hoare triple {6288#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {6288#false} is VALID [2022-04-15 13:14:49,335 INFO L290 TraceCheckUtils]: 60: Hoare triple {6288#false} assume !!(~c~0 < 6); {6288#false} is VALID [2022-04-15 13:14:49,335 INFO L290 TraceCheckUtils]: 61: Hoare triple {6288#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {6288#false} is VALID [2022-04-15 13:14:49,335 INFO L290 TraceCheckUtils]: 62: Hoare triple {6288#false} assume !!(~c~0 < 6); {6288#false} is VALID [2022-04-15 13:14:49,335 INFO L290 TraceCheckUtils]: 63: Hoare triple {6288#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {6288#false} is VALID [2022-04-15 13:14:49,335 INFO L290 TraceCheckUtils]: 64: Hoare triple {6288#false} assume !!(~c~0 < 6); {6288#false} is VALID [2022-04-15 13:14:49,335 INFO L290 TraceCheckUtils]: 65: Hoare triple {6288#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {6288#false} is VALID [2022-04-15 13:14:49,336 INFO L290 TraceCheckUtils]: 66: Hoare triple {6288#false} assume !!(~c~0 < 6); {6288#false} is VALID [2022-04-15 13:14:49,336 INFO L290 TraceCheckUtils]: 67: Hoare triple {6288#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {6288#false} is VALID [2022-04-15 13:14:49,336 INFO L290 TraceCheckUtils]: 68: Hoare triple {6288#false} assume !(~c~0 < 6); {6288#false} is VALID [2022-04-15 13:14:49,336 INFO L290 TraceCheckUtils]: 69: Hoare triple {6288#false} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {6288#false} is VALID [2022-04-15 13:14:49,336 INFO L290 TraceCheckUtils]: 70: Hoare triple {6288#false} assume !!(~b~0 < 6);~c~0 := 0; {6288#false} is VALID [2022-04-15 13:14:49,336 INFO L290 TraceCheckUtils]: 71: Hoare triple {6288#false} assume !!(~c~0 < 6); {6288#false} is VALID [2022-04-15 13:14:49,336 INFO L290 TraceCheckUtils]: 72: Hoare triple {6288#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {6288#false} is VALID [2022-04-15 13:14:49,336 INFO L290 TraceCheckUtils]: 73: Hoare triple {6288#false} assume !!(~c~0 < 6); {6288#false} is VALID [2022-04-15 13:14:49,336 INFO L290 TraceCheckUtils]: 74: Hoare triple {6288#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {6288#false} is VALID [2022-04-15 13:14:49,336 INFO L290 TraceCheckUtils]: 75: Hoare triple {6288#false} assume !!(~c~0 < 6); {6288#false} is VALID [2022-04-15 13:14:49,336 INFO L290 TraceCheckUtils]: 76: Hoare triple {6288#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {6288#false} is VALID [2022-04-15 13:14:49,336 INFO L290 TraceCheckUtils]: 77: Hoare triple {6288#false} assume !!(~c~0 < 6); {6288#false} is VALID [2022-04-15 13:14:49,336 INFO L290 TraceCheckUtils]: 78: Hoare triple {6288#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {6288#false} is VALID [2022-04-15 13:14:49,336 INFO L290 TraceCheckUtils]: 79: Hoare triple {6288#false} assume !!(~c~0 < 6); {6288#false} is VALID [2022-04-15 13:14:49,336 INFO L290 TraceCheckUtils]: 80: Hoare triple {6288#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {6288#false} is VALID [2022-04-15 13:14:49,337 INFO L290 TraceCheckUtils]: 81: Hoare triple {6288#false} assume !!(~c~0 < 6); {6288#false} is VALID [2022-04-15 13:14:49,337 INFO L290 TraceCheckUtils]: 82: Hoare triple {6288#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {6288#false} is VALID [2022-04-15 13:14:49,337 INFO L290 TraceCheckUtils]: 83: Hoare triple {6288#false} assume !(~c~0 < 6); {6288#false} is VALID [2022-04-15 13:14:49,337 INFO L290 TraceCheckUtils]: 84: Hoare triple {6288#false} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {6288#false} is VALID [2022-04-15 13:14:49,337 INFO L290 TraceCheckUtils]: 85: Hoare triple {6288#false} assume !!(~b~0 < 6);~c~0 := 0; {6288#false} is VALID [2022-04-15 13:14:49,337 INFO L290 TraceCheckUtils]: 86: Hoare triple {6288#false} assume !!(~c~0 < 6); {6288#false} is VALID [2022-04-15 13:14:49,337 INFO L290 TraceCheckUtils]: 87: Hoare triple {6288#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {6288#false} is VALID [2022-04-15 13:14:49,337 INFO L290 TraceCheckUtils]: 88: Hoare triple {6288#false} assume !!(~c~0 < 6); {6288#false} is VALID [2022-04-15 13:14:49,337 INFO L290 TraceCheckUtils]: 89: Hoare triple {6288#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {6288#false} is VALID [2022-04-15 13:14:49,337 INFO L290 TraceCheckUtils]: 90: Hoare triple {6288#false} assume !!(~c~0 < 6); {6288#false} is VALID [2022-04-15 13:14:49,337 INFO L290 TraceCheckUtils]: 91: Hoare triple {6288#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {6288#false} is VALID [2022-04-15 13:14:49,337 INFO L290 TraceCheckUtils]: 92: Hoare triple {6288#false} assume !!(~c~0 < 6); {6288#false} is VALID [2022-04-15 13:14:49,337 INFO L290 TraceCheckUtils]: 93: Hoare triple {6288#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {6288#false} is VALID [2022-04-15 13:14:49,338 INFO L290 TraceCheckUtils]: 94: Hoare triple {6288#false} assume !!(~c~0 < 6); {6288#false} is VALID [2022-04-15 13:14:49,338 INFO L290 TraceCheckUtils]: 95: Hoare triple {6288#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {6288#false} is VALID [2022-04-15 13:14:49,338 INFO L290 TraceCheckUtils]: 96: Hoare triple {6288#false} assume !!(~c~0 < 6); {6288#false} is VALID [2022-04-15 13:14:49,338 INFO L290 TraceCheckUtils]: 97: Hoare triple {6288#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {6288#false} is VALID [2022-04-15 13:14:49,338 INFO L290 TraceCheckUtils]: 98: Hoare triple {6288#false} assume !(~c~0 < 6); {6288#false} is VALID [2022-04-15 13:14:49,338 INFO L290 TraceCheckUtils]: 99: Hoare triple {6288#false} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {6288#false} is VALID [2022-04-15 13:14:49,338 INFO L290 TraceCheckUtils]: 100: Hoare triple {6288#false} assume !(~b~0 < 6); {6288#false} is VALID [2022-04-15 13:14:49,338 INFO L290 TraceCheckUtils]: 101: Hoare triple {6288#false} #t~pre4 := 1 + ~a~0;~a~0 := 1 + ~a~0;havoc #t~pre4; {6288#false} is VALID [2022-04-15 13:14:49,338 INFO L290 TraceCheckUtils]: 102: Hoare triple {6288#false} assume !(~a~0 < 6); {6288#false} is VALID [2022-04-15 13:14:49,338 INFO L290 TraceCheckUtils]: 103: Hoare triple {6288#false} assume !((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0); {6288#false} is VALID [2022-04-15 13:14:49,338 INFO L290 TraceCheckUtils]: 104: Hoare triple {6288#false} assume !false; {6288#false} is VALID [2022-04-15 13:14:49,339 INFO L134 CoverageAnalysis]: Checked inductivity of 1538 backedges. 792 proven. 264 refuted. 0 times theorem prover too weak. 482 trivial. 0 not checked. [2022-04-15 13:14:49,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:14:49,339 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1667873442] [2022-04-15 13:14:49,339 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1667873442] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 13:14:49,339 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1260555456] [2022-04-15 13:14:49,339 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 13:14:49,340 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 13:14:49,340 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 13:14:49,343 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 13:14:49,344 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-04-15 13:14:49,387 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 14 check-sat command(s) [2022-04-15 13:14:49,388 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 13:14:49,388 INFO L263 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 4 conjunts are in the unsatisfiable core [2022-04-15 13:14:49,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:14:49,403 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 13:14:49,730 INFO L272 TraceCheckUtils]: 0: Hoare triple {6287#true} call ULTIMATE.init(); {6287#true} is VALID [2022-04-15 13:14:49,731 INFO L290 TraceCheckUtils]: 1: Hoare triple {6287#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); {6287#true} is VALID [2022-04-15 13:14:49,731 INFO L290 TraceCheckUtils]: 2: Hoare triple {6287#true} assume true; {6287#true} is VALID [2022-04-15 13:14:49,731 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6287#true} {6287#true} #56#return; {6287#true} is VALID [2022-04-15 13:14:49,731 INFO L272 TraceCheckUtils]: 4: Hoare triple {6287#true} call #t~ret7 := main(); {6287#true} is VALID [2022-04-15 13:14:49,731 INFO L290 TraceCheckUtils]: 5: Hoare triple {6287#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~a~0 := 0; {6315#(<= main_~a~0 0)} is VALID [2022-04-15 13:14:49,732 INFO L290 TraceCheckUtils]: 6: Hoare triple {6315#(<= main_~a~0 0)} assume !!(~a~0 < 6);~b~0 := 0; {6315#(<= main_~a~0 0)} is VALID [2022-04-15 13:14:49,736 INFO L290 TraceCheckUtils]: 7: Hoare triple {6315#(<= main_~a~0 0)} assume !!(~b~0 < 6);~c~0 := 0; {6315#(<= main_~a~0 0)} is VALID [2022-04-15 13:14:49,736 INFO L290 TraceCheckUtils]: 8: Hoare triple {6315#(<= main_~a~0 0)} assume !!(~c~0 < 6); {6315#(<= main_~a~0 0)} is VALID [2022-04-15 13:14:49,737 INFO L290 TraceCheckUtils]: 9: Hoare triple {6315#(<= main_~a~0 0)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {6315#(<= main_~a~0 0)} is VALID [2022-04-15 13:14:49,737 INFO L290 TraceCheckUtils]: 10: Hoare triple {6315#(<= main_~a~0 0)} assume !!(~c~0 < 6); {6315#(<= main_~a~0 0)} is VALID [2022-04-15 13:14:49,737 INFO L290 TraceCheckUtils]: 11: Hoare triple {6315#(<= main_~a~0 0)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {6315#(<= main_~a~0 0)} is VALID [2022-04-15 13:14:49,737 INFO L290 TraceCheckUtils]: 12: Hoare triple {6315#(<= main_~a~0 0)} assume !!(~c~0 < 6); {6315#(<= main_~a~0 0)} is VALID [2022-04-15 13:14:49,738 INFO L290 TraceCheckUtils]: 13: Hoare triple {6315#(<= main_~a~0 0)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {6315#(<= main_~a~0 0)} is VALID [2022-04-15 13:14:49,738 INFO L290 TraceCheckUtils]: 14: Hoare triple {6315#(<= main_~a~0 0)} assume !!(~c~0 < 6); {6315#(<= main_~a~0 0)} is VALID [2022-04-15 13:14:49,738 INFO L290 TraceCheckUtils]: 15: Hoare triple {6315#(<= main_~a~0 0)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {6315#(<= main_~a~0 0)} is VALID [2022-04-15 13:14:49,738 INFO L290 TraceCheckUtils]: 16: Hoare triple {6315#(<= main_~a~0 0)} assume !!(~c~0 < 6); {6315#(<= main_~a~0 0)} is VALID [2022-04-15 13:14:49,739 INFO L290 TraceCheckUtils]: 17: Hoare triple {6315#(<= main_~a~0 0)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {6315#(<= main_~a~0 0)} is VALID [2022-04-15 13:14:49,739 INFO L290 TraceCheckUtils]: 18: Hoare triple {6315#(<= main_~a~0 0)} assume !!(~c~0 < 6); {6315#(<= main_~a~0 0)} is VALID [2022-04-15 13:14:49,739 INFO L290 TraceCheckUtils]: 19: Hoare triple {6315#(<= main_~a~0 0)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {6315#(<= main_~a~0 0)} is VALID [2022-04-15 13:14:49,740 INFO L290 TraceCheckUtils]: 20: Hoare triple {6315#(<= main_~a~0 0)} assume !(~c~0 < 6); {6315#(<= main_~a~0 0)} is VALID [2022-04-15 13:14:49,740 INFO L290 TraceCheckUtils]: 21: Hoare triple {6315#(<= main_~a~0 0)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {6315#(<= main_~a~0 0)} is VALID [2022-04-15 13:14:49,740 INFO L290 TraceCheckUtils]: 22: Hoare triple {6315#(<= main_~a~0 0)} assume !!(~b~0 < 6);~c~0 := 0; {6315#(<= main_~a~0 0)} is VALID [2022-04-15 13:14:49,740 INFO L290 TraceCheckUtils]: 23: Hoare triple {6315#(<= main_~a~0 0)} assume !!(~c~0 < 6); {6315#(<= main_~a~0 0)} is VALID [2022-04-15 13:14:49,741 INFO L290 TraceCheckUtils]: 24: Hoare triple {6315#(<= main_~a~0 0)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {6315#(<= main_~a~0 0)} is VALID [2022-04-15 13:14:49,741 INFO L290 TraceCheckUtils]: 25: Hoare triple {6315#(<= main_~a~0 0)} assume !!(~c~0 < 6); {6315#(<= main_~a~0 0)} is VALID [2022-04-15 13:14:49,741 INFO L290 TraceCheckUtils]: 26: Hoare triple {6315#(<= main_~a~0 0)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {6315#(<= main_~a~0 0)} is VALID [2022-04-15 13:14:49,741 INFO L290 TraceCheckUtils]: 27: Hoare triple {6315#(<= main_~a~0 0)} assume !!(~c~0 < 6); {6315#(<= main_~a~0 0)} is VALID [2022-04-15 13:14:49,742 INFO L290 TraceCheckUtils]: 28: Hoare triple {6315#(<= main_~a~0 0)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {6315#(<= main_~a~0 0)} is VALID [2022-04-15 13:14:49,742 INFO L290 TraceCheckUtils]: 29: Hoare triple {6315#(<= main_~a~0 0)} assume !!(~c~0 < 6); {6315#(<= main_~a~0 0)} is VALID [2022-04-15 13:14:49,742 INFO L290 TraceCheckUtils]: 30: Hoare triple {6315#(<= main_~a~0 0)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {6315#(<= main_~a~0 0)} is VALID [2022-04-15 13:14:49,743 INFO L290 TraceCheckUtils]: 31: Hoare triple {6315#(<= main_~a~0 0)} assume !!(~c~0 < 6); {6315#(<= main_~a~0 0)} is VALID [2022-04-15 13:14:49,743 INFO L290 TraceCheckUtils]: 32: Hoare triple {6315#(<= main_~a~0 0)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {6315#(<= main_~a~0 0)} is VALID [2022-04-15 13:14:49,743 INFO L290 TraceCheckUtils]: 33: Hoare triple {6315#(<= main_~a~0 0)} assume !!(~c~0 < 6); {6315#(<= main_~a~0 0)} is VALID [2022-04-15 13:14:49,743 INFO L290 TraceCheckUtils]: 34: Hoare triple {6315#(<= main_~a~0 0)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {6315#(<= main_~a~0 0)} is VALID [2022-04-15 13:14:49,744 INFO L290 TraceCheckUtils]: 35: Hoare triple {6315#(<= main_~a~0 0)} assume !(~c~0 < 6); {6315#(<= main_~a~0 0)} is VALID [2022-04-15 13:14:49,744 INFO L290 TraceCheckUtils]: 36: Hoare triple {6315#(<= main_~a~0 0)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {6315#(<= main_~a~0 0)} is VALID [2022-04-15 13:14:49,744 INFO L290 TraceCheckUtils]: 37: Hoare triple {6315#(<= main_~a~0 0)} assume !!(~b~0 < 6);~c~0 := 0; {6315#(<= main_~a~0 0)} is VALID [2022-04-15 13:14:49,745 INFO L290 TraceCheckUtils]: 38: Hoare triple {6315#(<= main_~a~0 0)} assume !!(~c~0 < 6); {6315#(<= main_~a~0 0)} is VALID [2022-04-15 13:14:49,745 INFO L290 TraceCheckUtils]: 39: Hoare triple {6315#(<= main_~a~0 0)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {6315#(<= main_~a~0 0)} is VALID [2022-04-15 13:14:49,745 INFO L290 TraceCheckUtils]: 40: Hoare triple {6315#(<= main_~a~0 0)} assume !!(~c~0 < 6); {6315#(<= main_~a~0 0)} is VALID [2022-04-15 13:14:49,745 INFO L290 TraceCheckUtils]: 41: Hoare triple {6315#(<= main_~a~0 0)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {6315#(<= main_~a~0 0)} is VALID [2022-04-15 13:14:49,746 INFO L290 TraceCheckUtils]: 42: Hoare triple {6315#(<= main_~a~0 0)} assume !!(~c~0 < 6); {6315#(<= main_~a~0 0)} is VALID [2022-04-15 13:14:49,746 INFO L290 TraceCheckUtils]: 43: Hoare triple {6315#(<= main_~a~0 0)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {6315#(<= main_~a~0 0)} is VALID [2022-04-15 13:14:49,746 INFO L290 TraceCheckUtils]: 44: Hoare triple {6315#(<= main_~a~0 0)} assume !!(~c~0 < 6); {6315#(<= main_~a~0 0)} is VALID [2022-04-15 13:14:49,747 INFO L290 TraceCheckUtils]: 45: Hoare triple {6315#(<= main_~a~0 0)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {6315#(<= main_~a~0 0)} is VALID [2022-04-15 13:14:49,747 INFO L290 TraceCheckUtils]: 46: Hoare triple {6315#(<= main_~a~0 0)} assume !!(~c~0 < 6); {6315#(<= main_~a~0 0)} is VALID [2022-04-15 13:14:49,747 INFO L290 TraceCheckUtils]: 47: Hoare triple {6315#(<= main_~a~0 0)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {6315#(<= main_~a~0 0)} is VALID [2022-04-15 13:14:49,747 INFO L290 TraceCheckUtils]: 48: Hoare triple {6315#(<= main_~a~0 0)} assume !!(~c~0 < 6); {6315#(<= main_~a~0 0)} is VALID [2022-04-15 13:14:49,748 INFO L290 TraceCheckUtils]: 49: Hoare triple {6315#(<= main_~a~0 0)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {6315#(<= main_~a~0 0)} is VALID [2022-04-15 13:14:49,748 INFO L290 TraceCheckUtils]: 50: Hoare triple {6315#(<= main_~a~0 0)} assume !(~c~0 < 6); {6315#(<= main_~a~0 0)} is VALID [2022-04-15 13:14:49,748 INFO L290 TraceCheckUtils]: 51: Hoare triple {6315#(<= main_~a~0 0)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {6315#(<= main_~a~0 0)} is VALID [2022-04-15 13:14:49,748 INFO L290 TraceCheckUtils]: 52: Hoare triple {6315#(<= main_~a~0 0)} assume !(~b~0 < 6); {6315#(<= main_~a~0 0)} is VALID [2022-04-15 13:14:49,749 INFO L290 TraceCheckUtils]: 53: Hoare triple {6315#(<= main_~a~0 0)} #t~pre4 := 1 + ~a~0;~a~0 := 1 + ~a~0;havoc #t~pre4; {6460#(<= main_~a~0 1)} is VALID [2022-04-15 13:14:49,749 INFO L290 TraceCheckUtils]: 54: Hoare triple {6460#(<= main_~a~0 1)} assume !!(~a~0 < 6);~b~0 := 0; {6460#(<= main_~a~0 1)} is VALID [2022-04-15 13:14:49,749 INFO L290 TraceCheckUtils]: 55: Hoare triple {6460#(<= main_~a~0 1)} assume !!(~b~0 < 6);~c~0 := 0; {6460#(<= main_~a~0 1)} is VALID [2022-04-15 13:14:49,750 INFO L290 TraceCheckUtils]: 56: Hoare triple {6460#(<= main_~a~0 1)} assume !!(~c~0 < 6); {6460#(<= main_~a~0 1)} is VALID [2022-04-15 13:14:49,750 INFO L290 TraceCheckUtils]: 57: Hoare triple {6460#(<= main_~a~0 1)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {6460#(<= main_~a~0 1)} is VALID [2022-04-15 13:14:49,750 INFO L290 TraceCheckUtils]: 58: Hoare triple {6460#(<= main_~a~0 1)} assume !!(~c~0 < 6); {6460#(<= main_~a~0 1)} is VALID [2022-04-15 13:14:49,751 INFO L290 TraceCheckUtils]: 59: Hoare triple {6460#(<= main_~a~0 1)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {6460#(<= main_~a~0 1)} is VALID [2022-04-15 13:14:49,751 INFO L290 TraceCheckUtils]: 60: Hoare triple {6460#(<= main_~a~0 1)} assume !!(~c~0 < 6); {6460#(<= main_~a~0 1)} is VALID [2022-04-15 13:14:49,751 INFO L290 TraceCheckUtils]: 61: Hoare triple {6460#(<= main_~a~0 1)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {6460#(<= main_~a~0 1)} is VALID [2022-04-15 13:14:49,751 INFO L290 TraceCheckUtils]: 62: Hoare triple {6460#(<= main_~a~0 1)} assume !!(~c~0 < 6); {6460#(<= main_~a~0 1)} is VALID [2022-04-15 13:14:49,752 INFO L290 TraceCheckUtils]: 63: Hoare triple {6460#(<= main_~a~0 1)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {6460#(<= main_~a~0 1)} is VALID [2022-04-15 13:14:49,752 INFO L290 TraceCheckUtils]: 64: Hoare triple {6460#(<= main_~a~0 1)} assume !!(~c~0 < 6); {6460#(<= main_~a~0 1)} is VALID [2022-04-15 13:14:49,752 INFO L290 TraceCheckUtils]: 65: Hoare triple {6460#(<= main_~a~0 1)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {6460#(<= main_~a~0 1)} is VALID [2022-04-15 13:14:49,753 INFO L290 TraceCheckUtils]: 66: Hoare triple {6460#(<= main_~a~0 1)} assume !!(~c~0 < 6); {6460#(<= main_~a~0 1)} is VALID [2022-04-15 13:14:49,753 INFO L290 TraceCheckUtils]: 67: Hoare triple {6460#(<= main_~a~0 1)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {6460#(<= main_~a~0 1)} is VALID [2022-04-15 13:14:49,753 INFO L290 TraceCheckUtils]: 68: Hoare triple {6460#(<= main_~a~0 1)} assume !(~c~0 < 6); {6460#(<= main_~a~0 1)} is VALID [2022-04-15 13:14:49,753 INFO L290 TraceCheckUtils]: 69: Hoare triple {6460#(<= main_~a~0 1)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {6460#(<= main_~a~0 1)} is VALID [2022-04-15 13:14:49,754 INFO L290 TraceCheckUtils]: 70: Hoare triple {6460#(<= main_~a~0 1)} assume !!(~b~0 < 6);~c~0 := 0; {6460#(<= main_~a~0 1)} is VALID [2022-04-15 13:14:49,754 INFO L290 TraceCheckUtils]: 71: Hoare triple {6460#(<= main_~a~0 1)} assume !!(~c~0 < 6); {6460#(<= main_~a~0 1)} is VALID [2022-04-15 13:14:49,754 INFO L290 TraceCheckUtils]: 72: Hoare triple {6460#(<= main_~a~0 1)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {6460#(<= main_~a~0 1)} is VALID [2022-04-15 13:14:49,755 INFO L290 TraceCheckUtils]: 73: Hoare triple {6460#(<= main_~a~0 1)} assume !!(~c~0 < 6); {6460#(<= main_~a~0 1)} is VALID [2022-04-15 13:14:49,755 INFO L290 TraceCheckUtils]: 74: Hoare triple {6460#(<= main_~a~0 1)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {6460#(<= main_~a~0 1)} is VALID [2022-04-15 13:14:49,755 INFO L290 TraceCheckUtils]: 75: Hoare triple {6460#(<= main_~a~0 1)} assume !!(~c~0 < 6); {6460#(<= main_~a~0 1)} is VALID [2022-04-15 13:14:49,755 INFO L290 TraceCheckUtils]: 76: Hoare triple {6460#(<= main_~a~0 1)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {6460#(<= main_~a~0 1)} is VALID [2022-04-15 13:14:49,756 INFO L290 TraceCheckUtils]: 77: Hoare triple {6460#(<= main_~a~0 1)} assume !!(~c~0 < 6); {6460#(<= main_~a~0 1)} is VALID [2022-04-15 13:14:49,756 INFO L290 TraceCheckUtils]: 78: Hoare triple {6460#(<= main_~a~0 1)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {6460#(<= main_~a~0 1)} is VALID [2022-04-15 13:14:49,756 INFO L290 TraceCheckUtils]: 79: Hoare triple {6460#(<= main_~a~0 1)} assume !!(~c~0 < 6); {6460#(<= main_~a~0 1)} is VALID [2022-04-15 13:14:49,756 INFO L290 TraceCheckUtils]: 80: Hoare triple {6460#(<= main_~a~0 1)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {6460#(<= main_~a~0 1)} is VALID [2022-04-15 13:14:49,757 INFO L290 TraceCheckUtils]: 81: Hoare triple {6460#(<= main_~a~0 1)} assume !!(~c~0 < 6); {6460#(<= main_~a~0 1)} is VALID [2022-04-15 13:14:49,757 INFO L290 TraceCheckUtils]: 82: Hoare triple {6460#(<= main_~a~0 1)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {6460#(<= main_~a~0 1)} is VALID [2022-04-15 13:14:49,758 INFO L290 TraceCheckUtils]: 83: Hoare triple {6460#(<= main_~a~0 1)} assume !(~c~0 < 6); {6460#(<= main_~a~0 1)} is VALID [2022-04-15 13:14:49,758 INFO L290 TraceCheckUtils]: 84: Hoare triple {6460#(<= main_~a~0 1)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {6460#(<= main_~a~0 1)} is VALID [2022-04-15 13:14:49,758 INFO L290 TraceCheckUtils]: 85: Hoare triple {6460#(<= main_~a~0 1)} assume !!(~b~0 < 6);~c~0 := 0; {6460#(<= main_~a~0 1)} is VALID [2022-04-15 13:14:49,758 INFO L290 TraceCheckUtils]: 86: Hoare triple {6460#(<= main_~a~0 1)} assume !!(~c~0 < 6); {6460#(<= main_~a~0 1)} is VALID [2022-04-15 13:14:49,759 INFO L290 TraceCheckUtils]: 87: Hoare triple {6460#(<= main_~a~0 1)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {6460#(<= main_~a~0 1)} is VALID [2022-04-15 13:14:49,759 INFO L290 TraceCheckUtils]: 88: Hoare triple {6460#(<= main_~a~0 1)} assume !!(~c~0 < 6); {6460#(<= main_~a~0 1)} is VALID [2022-04-15 13:14:49,759 INFO L290 TraceCheckUtils]: 89: Hoare triple {6460#(<= main_~a~0 1)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {6460#(<= main_~a~0 1)} is VALID [2022-04-15 13:14:49,760 INFO L290 TraceCheckUtils]: 90: Hoare triple {6460#(<= main_~a~0 1)} assume !!(~c~0 < 6); {6460#(<= main_~a~0 1)} is VALID [2022-04-15 13:14:49,760 INFO L290 TraceCheckUtils]: 91: Hoare triple {6460#(<= main_~a~0 1)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {6460#(<= main_~a~0 1)} is VALID [2022-04-15 13:14:49,760 INFO L290 TraceCheckUtils]: 92: Hoare triple {6460#(<= main_~a~0 1)} assume !!(~c~0 < 6); {6460#(<= main_~a~0 1)} is VALID [2022-04-15 13:14:49,760 INFO L290 TraceCheckUtils]: 93: Hoare triple {6460#(<= main_~a~0 1)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {6460#(<= main_~a~0 1)} is VALID [2022-04-15 13:14:49,761 INFO L290 TraceCheckUtils]: 94: Hoare triple {6460#(<= main_~a~0 1)} assume !!(~c~0 < 6); {6460#(<= main_~a~0 1)} is VALID [2022-04-15 13:14:49,761 INFO L290 TraceCheckUtils]: 95: Hoare triple {6460#(<= main_~a~0 1)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {6460#(<= main_~a~0 1)} is VALID [2022-04-15 13:14:49,761 INFO L290 TraceCheckUtils]: 96: Hoare triple {6460#(<= main_~a~0 1)} assume !!(~c~0 < 6); {6460#(<= main_~a~0 1)} is VALID [2022-04-15 13:14:49,762 INFO L290 TraceCheckUtils]: 97: Hoare triple {6460#(<= main_~a~0 1)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {6460#(<= main_~a~0 1)} is VALID [2022-04-15 13:14:49,762 INFO L290 TraceCheckUtils]: 98: Hoare triple {6460#(<= main_~a~0 1)} assume !(~c~0 < 6); {6460#(<= main_~a~0 1)} is VALID [2022-04-15 13:14:49,762 INFO L290 TraceCheckUtils]: 99: Hoare triple {6460#(<= main_~a~0 1)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {6460#(<= main_~a~0 1)} is VALID [2022-04-15 13:14:49,762 INFO L290 TraceCheckUtils]: 100: Hoare triple {6460#(<= main_~a~0 1)} assume !(~b~0 < 6); {6460#(<= main_~a~0 1)} is VALID [2022-04-15 13:14:49,763 INFO L290 TraceCheckUtils]: 101: Hoare triple {6460#(<= main_~a~0 1)} #t~pre4 := 1 + ~a~0;~a~0 := 1 + ~a~0;havoc #t~pre4; {6605#(<= main_~a~0 2)} is VALID [2022-04-15 13:14:49,763 INFO L290 TraceCheckUtils]: 102: Hoare triple {6605#(<= main_~a~0 2)} assume !(~a~0 < 6); {6288#false} is VALID [2022-04-15 13:14:49,763 INFO L290 TraceCheckUtils]: 103: Hoare triple {6288#false} assume !((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0); {6288#false} is VALID [2022-04-15 13:14:49,763 INFO L290 TraceCheckUtils]: 104: Hoare triple {6288#false} assume !false; {6288#false} is VALID [2022-04-15 13:14:49,764 INFO L134 CoverageAnalysis]: Checked inductivity of 1538 backedges. 0 proven. 794 refuted. 0 times theorem prover too weak. 744 trivial. 0 not checked. [2022-04-15 13:14:49,764 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 13:14:50,096 INFO L290 TraceCheckUtils]: 104: Hoare triple {6288#false} assume !false; {6288#false} is VALID [2022-04-15 13:14:50,096 INFO L290 TraceCheckUtils]: 103: Hoare triple {6288#false} assume !((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0); {6288#false} is VALID [2022-04-15 13:14:50,097 INFO L290 TraceCheckUtils]: 102: Hoare triple {6621#(< main_~a~0 6)} assume !(~a~0 < 6); {6288#false} is VALID [2022-04-15 13:14:50,097 INFO L290 TraceCheckUtils]: 101: Hoare triple {6625#(< main_~a~0 5)} #t~pre4 := 1 + ~a~0;~a~0 := 1 + ~a~0;havoc #t~pre4; {6621#(< main_~a~0 6)} is VALID [2022-04-15 13:14:50,097 INFO L290 TraceCheckUtils]: 100: Hoare triple {6625#(< main_~a~0 5)} assume !(~b~0 < 6); {6625#(< main_~a~0 5)} is VALID [2022-04-15 13:14:50,098 INFO L290 TraceCheckUtils]: 99: Hoare triple {6625#(< main_~a~0 5)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {6625#(< main_~a~0 5)} is VALID [2022-04-15 13:14:50,098 INFO L290 TraceCheckUtils]: 98: Hoare triple {6625#(< main_~a~0 5)} assume !(~c~0 < 6); {6625#(< main_~a~0 5)} is VALID [2022-04-15 13:14:50,098 INFO L290 TraceCheckUtils]: 97: Hoare triple {6625#(< main_~a~0 5)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {6625#(< main_~a~0 5)} is VALID [2022-04-15 13:14:50,099 INFO L290 TraceCheckUtils]: 96: Hoare triple {6625#(< main_~a~0 5)} assume !!(~c~0 < 6); {6625#(< main_~a~0 5)} is VALID [2022-04-15 13:14:50,099 INFO L290 TraceCheckUtils]: 95: Hoare triple {6625#(< main_~a~0 5)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {6625#(< main_~a~0 5)} is VALID [2022-04-15 13:14:50,099 INFO L290 TraceCheckUtils]: 94: Hoare triple {6625#(< main_~a~0 5)} assume !!(~c~0 < 6); {6625#(< main_~a~0 5)} is VALID [2022-04-15 13:14:50,099 INFO L290 TraceCheckUtils]: 93: Hoare triple {6625#(< main_~a~0 5)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {6625#(< main_~a~0 5)} is VALID [2022-04-15 13:14:50,100 INFO L290 TraceCheckUtils]: 92: Hoare triple {6625#(< main_~a~0 5)} assume !!(~c~0 < 6); {6625#(< main_~a~0 5)} is VALID [2022-04-15 13:14:50,100 INFO L290 TraceCheckUtils]: 91: Hoare triple {6625#(< main_~a~0 5)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {6625#(< main_~a~0 5)} is VALID [2022-04-15 13:14:50,100 INFO L290 TraceCheckUtils]: 90: Hoare triple {6625#(< main_~a~0 5)} assume !!(~c~0 < 6); {6625#(< main_~a~0 5)} is VALID [2022-04-15 13:14:50,101 INFO L290 TraceCheckUtils]: 89: Hoare triple {6625#(< main_~a~0 5)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {6625#(< main_~a~0 5)} is VALID [2022-04-15 13:14:50,101 INFO L290 TraceCheckUtils]: 88: Hoare triple {6625#(< main_~a~0 5)} assume !!(~c~0 < 6); {6625#(< main_~a~0 5)} is VALID [2022-04-15 13:14:50,101 INFO L290 TraceCheckUtils]: 87: Hoare triple {6625#(< main_~a~0 5)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {6625#(< main_~a~0 5)} is VALID [2022-04-15 13:14:50,101 INFO L290 TraceCheckUtils]: 86: Hoare triple {6625#(< main_~a~0 5)} assume !!(~c~0 < 6); {6625#(< main_~a~0 5)} is VALID [2022-04-15 13:14:50,102 INFO L290 TraceCheckUtils]: 85: Hoare triple {6625#(< main_~a~0 5)} assume !!(~b~0 < 6);~c~0 := 0; {6625#(< main_~a~0 5)} is VALID [2022-04-15 13:14:50,102 INFO L290 TraceCheckUtils]: 84: Hoare triple {6625#(< main_~a~0 5)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {6625#(< main_~a~0 5)} is VALID [2022-04-15 13:14:50,102 INFO L290 TraceCheckUtils]: 83: Hoare triple {6625#(< main_~a~0 5)} assume !(~c~0 < 6); {6625#(< main_~a~0 5)} is VALID [2022-04-15 13:14:50,102 INFO L290 TraceCheckUtils]: 82: Hoare triple {6625#(< main_~a~0 5)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {6625#(< main_~a~0 5)} is VALID [2022-04-15 13:14:50,103 INFO L290 TraceCheckUtils]: 81: Hoare triple {6625#(< main_~a~0 5)} assume !!(~c~0 < 6); {6625#(< main_~a~0 5)} is VALID [2022-04-15 13:14:50,103 INFO L290 TraceCheckUtils]: 80: Hoare triple {6625#(< main_~a~0 5)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {6625#(< main_~a~0 5)} is VALID [2022-04-15 13:14:50,103 INFO L290 TraceCheckUtils]: 79: Hoare triple {6625#(< main_~a~0 5)} assume !!(~c~0 < 6); {6625#(< main_~a~0 5)} is VALID [2022-04-15 13:14:50,104 INFO L290 TraceCheckUtils]: 78: Hoare triple {6625#(< main_~a~0 5)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {6625#(< main_~a~0 5)} is VALID [2022-04-15 13:14:50,104 INFO L290 TraceCheckUtils]: 77: Hoare triple {6625#(< main_~a~0 5)} assume !!(~c~0 < 6); {6625#(< main_~a~0 5)} is VALID [2022-04-15 13:14:50,104 INFO L290 TraceCheckUtils]: 76: Hoare triple {6625#(< main_~a~0 5)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {6625#(< main_~a~0 5)} is VALID [2022-04-15 13:14:50,104 INFO L290 TraceCheckUtils]: 75: Hoare triple {6625#(< main_~a~0 5)} assume !!(~c~0 < 6); {6625#(< main_~a~0 5)} is VALID [2022-04-15 13:14:50,105 INFO L290 TraceCheckUtils]: 74: Hoare triple {6625#(< main_~a~0 5)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {6625#(< main_~a~0 5)} is VALID [2022-04-15 13:14:50,105 INFO L290 TraceCheckUtils]: 73: Hoare triple {6625#(< main_~a~0 5)} assume !!(~c~0 < 6); {6625#(< main_~a~0 5)} is VALID [2022-04-15 13:14:50,105 INFO L290 TraceCheckUtils]: 72: Hoare triple {6625#(< main_~a~0 5)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {6625#(< main_~a~0 5)} is VALID [2022-04-15 13:14:50,106 INFO L290 TraceCheckUtils]: 71: Hoare triple {6625#(< main_~a~0 5)} assume !!(~c~0 < 6); {6625#(< main_~a~0 5)} is VALID [2022-04-15 13:14:50,106 INFO L290 TraceCheckUtils]: 70: Hoare triple {6625#(< main_~a~0 5)} assume !!(~b~0 < 6);~c~0 := 0; {6625#(< main_~a~0 5)} is VALID [2022-04-15 13:14:50,106 INFO L290 TraceCheckUtils]: 69: Hoare triple {6625#(< main_~a~0 5)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {6625#(< main_~a~0 5)} is VALID [2022-04-15 13:14:50,106 INFO L290 TraceCheckUtils]: 68: Hoare triple {6625#(< main_~a~0 5)} assume !(~c~0 < 6); {6625#(< main_~a~0 5)} is VALID [2022-04-15 13:14:50,107 INFO L290 TraceCheckUtils]: 67: Hoare triple {6625#(< main_~a~0 5)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {6625#(< main_~a~0 5)} is VALID [2022-04-15 13:14:50,107 INFO L290 TraceCheckUtils]: 66: Hoare triple {6625#(< main_~a~0 5)} assume !!(~c~0 < 6); {6625#(< main_~a~0 5)} is VALID [2022-04-15 13:14:50,107 INFO L290 TraceCheckUtils]: 65: Hoare triple {6625#(< main_~a~0 5)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {6625#(< main_~a~0 5)} is VALID [2022-04-15 13:14:50,107 INFO L290 TraceCheckUtils]: 64: Hoare triple {6625#(< main_~a~0 5)} assume !!(~c~0 < 6); {6625#(< main_~a~0 5)} is VALID [2022-04-15 13:14:50,108 INFO L290 TraceCheckUtils]: 63: Hoare triple {6625#(< main_~a~0 5)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {6625#(< main_~a~0 5)} is VALID [2022-04-15 13:14:50,108 INFO L290 TraceCheckUtils]: 62: Hoare triple {6625#(< main_~a~0 5)} assume !!(~c~0 < 6); {6625#(< main_~a~0 5)} is VALID [2022-04-15 13:14:50,109 INFO L290 TraceCheckUtils]: 61: Hoare triple {6625#(< main_~a~0 5)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {6625#(< main_~a~0 5)} is VALID [2022-04-15 13:14:50,109 INFO L290 TraceCheckUtils]: 60: Hoare triple {6625#(< main_~a~0 5)} assume !!(~c~0 < 6); {6625#(< main_~a~0 5)} is VALID [2022-04-15 13:14:50,109 INFO L290 TraceCheckUtils]: 59: Hoare triple {6625#(< main_~a~0 5)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {6625#(< main_~a~0 5)} is VALID [2022-04-15 13:14:50,109 INFO L290 TraceCheckUtils]: 58: Hoare triple {6625#(< main_~a~0 5)} assume !!(~c~0 < 6); {6625#(< main_~a~0 5)} is VALID [2022-04-15 13:14:50,110 INFO L290 TraceCheckUtils]: 57: Hoare triple {6625#(< main_~a~0 5)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {6625#(< main_~a~0 5)} is VALID [2022-04-15 13:14:50,110 INFO L290 TraceCheckUtils]: 56: Hoare triple {6625#(< main_~a~0 5)} assume !!(~c~0 < 6); {6625#(< main_~a~0 5)} is VALID [2022-04-15 13:14:50,110 INFO L290 TraceCheckUtils]: 55: Hoare triple {6625#(< main_~a~0 5)} assume !!(~b~0 < 6);~c~0 := 0; {6625#(< main_~a~0 5)} is VALID [2022-04-15 13:14:50,110 INFO L290 TraceCheckUtils]: 54: Hoare triple {6625#(< main_~a~0 5)} assume !!(~a~0 < 6);~b~0 := 0; {6625#(< main_~a~0 5)} is VALID [2022-04-15 13:14:50,111 INFO L290 TraceCheckUtils]: 53: Hoare triple {6770#(< main_~a~0 4)} #t~pre4 := 1 + ~a~0;~a~0 := 1 + ~a~0;havoc #t~pre4; {6625#(< main_~a~0 5)} is VALID [2022-04-15 13:14:50,111 INFO L290 TraceCheckUtils]: 52: Hoare triple {6770#(< main_~a~0 4)} assume !(~b~0 < 6); {6770#(< main_~a~0 4)} is VALID [2022-04-15 13:14:50,112 INFO L290 TraceCheckUtils]: 51: Hoare triple {6770#(< main_~a~0 4)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {6770#(< main_~a~0 4)} is VALID [2022-04-15 13:14:50,112 INFO L290 TraceCheckUtils]: 50: Hoare triple {6770#(< main_~a~0 4)} assume !(~c~0 < 6); {6770#(< main_~a~0 4)} is VALID [2022-04-15 13:14:50,112 INFO L290 TraceCheckUtils]: 49: Hoare triple {6770#(< main_~a~0 4)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {6770#(< main_~a~0 4)} is VALID [2022-04-15 13:14:50,112 INFO L290 TraceCheckUtils]: 48: Hoare triple {6770#(< main_~a~0 4)} assume !!(~c~0 < 6); {6770#(< main_~a~0 4)} is VALID [2022-04-15 13:14:50,113 INFO L290 TraceCheckUtils]: 47: Hoare triple {6770#(< main_~a~0 4)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {6770#(< main_~a~0 4)} is VALID [2022-04-15 13:14:50,113 INFO L290 TraceCheckUtils]: 46: Hoare triple {6770#(< main_~a~0 4)} assume !!(~c~0 < 6); {6770#(< main_~a~0 4)} is VALID [2022-04-15 13:14:50,113 INFO L290 TraceCheckUtils]: 45: Hoare triple {6770#(< main_~a~0 4)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {6770#(< main_~a~0 4)} is VALID [2022-04-15 13:14:50,113 INFO L290 TraceCheckUtils]: 44: Hoare triple {6770#(< main_~a~0 4)} assume !!(~c~0 < 6); {6770#(< main_~a~0 4)} is VALID [2022-04-15 13:14:50,119 INFO L290 TraceCheckUtils]: 43: Hoare triple {6770#(< main_~a~0 4)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {6770#(< main_~a~0 4)} is VALID [2022-04-15 13:14:50,119 INFO L290 TraceCheckUtils]: 42: Hoare triple {6770#(< main_~a~0 4)} assume !!(~c~0 < 6); {6770#(< main_~a~0 4)} is VALID [2022-04-15 13:14:50,120 INFO L290 TraceCheckUtils]: 41: Hoare triple {6770#(< main_~a~0 4)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {6770#(< main_~a~0 4)} is VALID [2022-04-15 13:14:50,120 INFO L290 TraceCheckUtils]: 40: Hoare triple {6770#(< main_~a~0 4)} assume !!(~c~0 < 6); {6770#(< main_~a~0 4)} is VALID [2022-04-15 13:14:50,120 INFO L290 TraceCheckUtils]: 39: Hoare triple {6770#(< main_~a~0 4)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {6770#(< main_~a~0 4)} is VALID [2022-04-15 13:14:50,121 INFO L290 TraceCheckUtils]: 38: Hoare triple {6770#(< main_~a~0 4)} assume !!(~c~0 < 6); {6770#(< main_~a~0 4)} is VALID [2022-04-15 13:14:50,121 INFO L290 TraceCheckUtils]: 37: Hoare triple {6770#(< main_~a~0 4)} assume !!(~b~0 < 6);~c~0 := 0; {6770#(< main_~a~0 4)} is VALID [2022-04-15 13:14:50,122 INFO L290 TraceCheckUtils]: 36: Hoare triple {6770#(< main_~a~0 4)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {6770#(< main_~a~0 4)} is VALID [2022-04-15 13:14:50,122 INFO L290 TraceCheckUtils]: 35: Hoare triple {6770#(< main_~a~0 4)} assume !(~c~0 < 6); {6770#(< main_~a~0 4)} is VALID [2022-04-15 13:14:50,122 INFO L290 TraceCheckUtils]: 34: Hoare triple {6770#(< main_~a~0 4)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {6770#(< main_~a~0 4)} is VALID [2022-04-15 13:14:50,123 INFO L290 TraceCheckUtils]: 33: Hoare triple {6770#(< main_~a~0 4)} assume !!(~c~0 < 6); {6770#(< main_~a~0 4)} is VALID [2022-04-15 13:14:50,123 INFO L290 TraceCheckUtils]: 32: Hoare triple {6770#(< main_~a~0 4)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {6770#(< main_~a~0 4)} is VALID [2022-04-15 13:14:50,123 INFO L290 TraceCheckUtils]: 31: Hoare triple {6770#(< main_~a~0 4)} assume !!(~c~0 < 6); {6770#(< main_~a~0 4)} is VALID [2022-04-15 13:14:50,124 INFO L290 TraceCheckUtils]: 30: Hoare triple {6770#(< main_~a~0 4)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {6770#(< main_~a~0 4)} is VALID [2022-04-15 13:14:50,124 INFO L290 TraceCheckUtils]: 29: Hoare triple {6770#(< main_~a~0 4)} assume !!(~c~0 < 6); {6770#(< main_~a~0 4)} is VALID [2022-04-15 13:14:50,124 INFO L290 TraceCheckUtils]: 28: Hoare triple {6770#(< main_~a~0 4)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {6770#(< main_~a~0 4)} is VALID [2022-04-15 13:14:50,125 INFO L290 TraceCheckUtils]: 27: Hoare triple {6770#(< main_~a~0 4)} assume !!(~c~0 < 6); {6770#(< main_~a~0 4)} is VALID [2022-04-15 13:14:50,125 INFO L290 TraceCheckUtils]: 26: Hoare triple {6770#(< main_~a~0 4)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {6770#(< main_~a~0 4)} is VALID [2022-04-15 13:14:50,125 INFO L290 TraceCheckUtils]: 25: Hoare triple {6770#(< main_~a~0 4)} assume !!(~c~0 < 6); {6770#(< main_~a~0 4)} is VALID [2022-04-15 13:14:50,126 INFO L290 TraceCheckUtils]: 24: Hoare triple {6770#(< main_~a~0 4)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {6770#(< main_~a~0 4)} is VALID [2022-04-15 13:14:50,126 INFO L290 TraceCheckUtils]: 23: Hoare triple {6770#(< main_~a~0 4)} assume !!(~c~0 < 6); {6770#(< main_~a~0 4)} is VALID [2022-04-15 13:14:50,126 INFO L290 TraceCheckUtils]: 22: Hoare triple {6770#(< main_~a~0 4)} assume !!(~b~0 < 6);~c~0 := 0; {6770#(< main_~a~0 4)} is VALID [2022-04-15 13:14:50,126 INFO L290 TraceCheckUtils]: 21: Hoare triple {6770#(< main_~a~0 4)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {6770#(< main_~a~0 4)} is VALID [2022-04-15 13:14:50,127 INFO L290 TraceCheckUtils]: 20: Hoare triple {6770#(< main_~a~0 4)} assume !(~c~0 < 6); {6770#(< main_~a~0 4)} is VALID [2022-04-15 13:14:50,127 INFO L290 TraceCheckUtils]: 19: Hoare triple {6770#(< main_~a~0 4)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {6770#(< main_~a~0 4)} is VALID [2022-04-15 13:14:50,127 INFO L290 TraceCheckUtils]: 18: Hoare triple {6770#(< main_~a~0 4)} assume !!(~c~0 < 6); {6770#(< main_~a~0 4)} is VALID [2022-04-15 13:14:50,128 INFO L290 TraceCheckUtils]: 17: Hoare triple {6770#(< main_~a~0 4)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {6770#(< main_~a~0 4)} is VALID [2022-04-15 13:14:50,128 INFO L290 TraceCheckUtils]: 16: Hoare triple {6770#(< main_~a~0 4)} assume !!(~c~0 < 6); {6770#(< main_~a~0 4)} is VALID [2022-04-15 13:14:50,128 INFO L290 TraceCheckUtils]: 15: Hoare triple {6770#(< main_~a~0 4)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {6770#(< main_~a~0 4)} is VALID [2022-04-15 13:14:50,128 INFO L290 TraceCheckUtils]: 14: Hoare triple {6770#(< main_~a~0 4)} assume !!(~c~0 < 6); {6770#(< main_~a~0 4)} is VALID [2022-04-15 13:14:50,129 INFO L290 TraceCheckUtils]: 13: Hoare triple {6770#(< main_~a~0 4)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {6770#(< main_~a~0 4)} is VALID [2022-04-15 13:14:50,129 INFO L290 TraceCheckUtils]: 12: Hoare triple {6770#(< main_~a~0 4)} assume !!(~c~0 < 6); {6770#(< main_~a~0 4)} is VALID [2022-04-15 13:14:50,129 INFO L290 TraceCheckUtils]: 11: Hoare triple {6770#(< main_~a~0 4)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {6770#(< main_~a~0 4)} is VALID [2022-04-15 13:14:50,129 INFO L290 TraceCheckUtils]: 10: Hoare triple {6770#(< main_~a~0 4)} assume !!(~c~0 < 6); {6770#(< main_~a~0 4)} is VALID [2022-04-15 13:14:50,130 INFO L290 TraceCheckUtils]: 9: Hoare triple {6770#(< main_~a~0 4)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {6770#(< main_~a~0 4)} is VALID [2022-04-15 13:14:50,130 INFO L290 TraceCheckUtils]: 8: Hoare triple {6770#(< main_~a~0 4)} assume !!(~c~0 < 6); {6770#(< main_~a~0 4)} is VALID [2022-04-15 13:14:50,130 INFO L290 TraceCheckUtils]: 7: Hoare triple {6770#(< main_~a~0 4)} assume !!(~b~0 < 6);~c~0 := 0; {6770#(< main_~a~0 4)} is VALID [2022-04-15 13:14:50,131 INFO L290 TraceCheckUtils]: 6: Hoare triple {6770#(< main_~a~0 4)} assume !!(~a~0 < 6);~b~0 := 0; {6770#(< main_~a~0 4)} is VALID [2022-04-15 13:14:50,131 INFO L290 TraceCheckUtils]: 5: Hoare triple {6287#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~a~0 := 0; {6770#(< main_~a~0 4)} is VALID [2022-04-15 13:14:50,131 INFO L272 TraceCheckUtils]: 4: Hoare triple {6287#true} call #t~ret7 := main(); {6287#true} is VALID [2022-04-15 13:14:50,131 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6287#true} {6287#true} #56#return; {6287#true} is VALID [2022-04-15 13:14:50,131 INFO L290 TraceCheckUtils]: 2: Hoare triple {6287#true} assume true; {6287#true} is VALID [2022-04-15 13:14:50,131 INFO L290 TraceCheckUtils]: 1: Hoare triple {6287#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); {6287#true} is VALID [2022-04-15 13:14:50,131 INFO L272 TraceCheckUtils]: 0: Hoare triple {6287#true} call ULTIMATE.init(); {6287#true} is VALID [2022-04-15 13:14:50,132 INFO L134 CoverageAnalysis]: Checked inductivity of 1538 backedges. 0 proven. 794 refuted. 0 times theorem prover too weak. 744 trivial. 0 not checked. [2022-04-15 13:14:50,132 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1260555456] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 13:14:50,132 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 13:14:50,132 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 13 [2022-04-15 13:14:50,133 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:14:50,133 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2085112591] [2022-04-15 13:14:50,133 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2085112591] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:14:50,133 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:14:50,133 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-15 13:14:50,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [892118259] [2022-04-15 13:14:50,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:14:50,134 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 6 states have internal predecessors, (31), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 105 [2022-04-15 13:14:50,134 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:14:50,134 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 6 states have internal predecessors, (31), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:14:50,161 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:14:50,161 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-15 13:14:50,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:14:50,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-15 13:14:50,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2022-04-15 13:14:50,162 INFO L87 Difference]: Start difference. First operand 106 states and 114 transitions. Second operand has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 6 states have internal predecessors, (31), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:14:50,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:14:50,498 INFO L93 Difference]: Finished difference Result 217 states and 235 transitions. [2022-04-15 13:14:50,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-15 13:14:50,499 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 6 states have internal predecessors, (31), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 105 [2022-04-15 13:14:50,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:14:50,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 6 states have internal predecessors, (31), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:14:50,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 49 transitions. [2022-04-15 13:14:50,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 6 states have internal predecessors, (31), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:14:50,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 49 transitions. [2022-04-15 13:14:50,501 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 49 transitions. [2022-04-15 13:14:50,540 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:14:50,542 INFO L225 Difference]: With dead ends: 217 [2022-04-15 13:14:50,542 INFO L226 Difference]: Without dead ends: 164 [2022-04-15 13:14:50,542 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 221 GetRequests, 206 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2022-04-15 13:14:50,543 INFO L913 BasicCegarLoop]: 15 mSDtfsCounter, 44 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 13:14:50,543 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [44 Valid, 32 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 13:14:50,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2022-04-15 13:14:50,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 136. [2022-04-15 13:14:50,718 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:14:50,718 INFO L82 GeneralOperation]: Start isEquivalent. First operand 164 states. Second operand has 136 states, 132 states have (on average 1.0833333333333333) internal successors, (143), 132 states have internal predecessors, (143), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:14:50,718 INFO L74 IsIncluded]: Start isIncluded. First operand 164 states. Second operand has 136 states, 132 states have (on average 1.0833333333333333) internal successors, (143), 132 states have internal predecessors, (143), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:14:50,718 INFO L87 Difference]: Start difference. First operand 164 states. Second operand has 136 states, 132 states have (on average 1.0833333333333333) internal successors, (143), 132 states have internal predecessors, (143), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:14:50,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:14:50,722 INFO L93 Difference]: Finished difference Result 164 states and 176 transitions. [2022-04-15 13:14:50,722 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 176 transitions. [2022-04-15 13:14:50,722 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:14:50,722 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:14:50,722 INFO L74 IsIncluded]: Start isIncluded. First operand has 136 states, 132 states have (on average 1.0833333333333333) internal successors, (143), 132 states have internal predecessors, (143), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 164 states. [2022-04-15 13:14:50,723 INFO L87 Difference]: Start difference. First operand has 136 states, 132 states have (on average 1.0833333333333333) internal successors, (143), 132 states have internal predecessors, (143), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 164 states. [2022-04-15 13:14:50,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:14:50,726 INFO L93 Difference]: Finished difference Result 164 states and 176 transitions. [2022-04-15 13:14:50,726 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 176 transitions. [2022-04-15 13:14:50,726 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:14:50,726 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:14:50,726 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:14:50,726 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:14:50,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 132 states have (on average 1.0833333333333333) internal successors, (143), 132 states have internal predecessors, (143), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:14:50,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 146 transitions. [2022-04-15 13:14:50,729 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 146 transitions. Word has length 105 [2022-04-15 13:14:50,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:14:50,729 INFO L478 AbstractCegarLoop]: Abstraction has 136 states and 146 transitions. [2022-04-15 13:14:50,729 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 6 states have internal predecessors, (31), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:14:50,729 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 136 states and 146 transitions. [2022-04-15 13:14:50,872 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 146 edges. 146 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:14:50,872 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 146 transitions. [2022-04-15 13:14:50,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2022-04-15 13:14:50,873 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:14:50,873 INFO L499 BasicCegarLoop]: trace histogram [48, 48, 8, 8, 8, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 13:14:50,891 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-04-15 13:14:51,083 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,SelfDestructingSolverStorable22,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 13:14:51,083 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:14:51,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:14:51,084 INFO L85 PathProgramCache]: Analyzing trace with hash 1520409151, now seen corresponding path program 19 times [2022-04-15 13:14:51,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:14:51,084 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1946767606] [2022-04-15 13:14:51,971 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 13:14:51,972 INFO L85 PathProgramCache]: Analyzing trace with hash 1694615375, now seen corresponding path program 1 times [2022-04-15 13:14:51,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:14:51,972 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [651163081] [2022-04-15 13:14:51,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:14:51,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:14:51,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 13:14:51,977 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 13:14:51,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 13:14:51,980 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 13:14:51,980 INFO L85 PathProgramCache]: Analyzing trace with hash 1520409151, now seen corresponding path program 20 times [2022-04-15 13:14:51,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:14:51,980 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [103372966] [2022-04-15 13:14:51,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:14:51,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:14:52,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:14:52,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 13:14:52,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:14:52,085 INFO L290 TraceCheckUtils]: 0: Hoare triple {7984#(and (= |#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); {7974#true} is VALID [2022-04-15 13:14:52,085 INFO L290 TraceCheckUtils]: 1: Hoare triple {7974#true} assume true; {7974#true} is VALID [2022-04-15 13:14:52,085 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7974#true} {7974#true} #56#return; {7974#true} is VALID [2022-04-15 13:14:52,086 INFO L272 TraceCheckUtils]: 0: Hoare triple {7974#true} call ULTIMATE.init(); {7984#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 13:14:52,086 INFO L290 TraceCheckUtils]: 1: Hoare triple {7984#(and (= |#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); {7974#true} is VALID [2022-04-15 13:14:52,086 INFO L290 TraceCheckUtils]: 2: Hoare triple {7974#true} assume true; {7974#true} is VALID [2022-04-15 13:14:52,086 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7974#true} {7974#true} #56#return; {7974#true} is VALID [2022-04-15 13:14:52,086 INFO L272 TraceCheckUtils]: 4: Hoare triple {7974#true} call #t~ret7 := main(); {7974#true} is VALID [2022-04-15 13:14:52,086 INFO L290 TraceCheckUtils]: 5: Hoare triple {7974#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~a~0 := 0; {7974#true} is VALID [2022-04-15 13:14:52,087 INFO L290 TraceCheckUtils]: 6: Hoare triple {7974#true} assume !!(~a~0 < 6);~b~0 := 0; {7979#(= main_~b~0 0)} is VALID [2022-04-15 13:14:52,087 INFO L290 TraceCheckUtils]: 7: Hoare triple {7979#(= main_~b~0 0)} assume !!(~b~0 < 6);~c~0 := 0; {7979#(= main_~b~0 0)} is VALID [2022-04-15 13:14:52,087 INFO L290 TraceCheckUtils]: 8: Hoare triple {7979#(= main_~b~0 0)} assume !!(~c~0 < 6); {7979#(= main_~b~0 0)} is VALID [2022-04-15 13:14:52,088 INFO L290 TraceCheckUtils]: 9: Hoare triple {7979#(= main_~b~0 0)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {7979#(= main_~b~0 0)} is VALID [2022-04-15 13:14:52,088 INFO L290 TraceCheckUtils]: 10: Hoare triple {7979#(= main_~b~0 0)} assume !!(~c~0 < 6); {7979#(= main_~b~0 0)} is VALID [2022-04-15 13:14:52,088 INFO L290 TraceCheckUtils]: 11: Hoare triple {7979#(= main_~b~0 0)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {7979#(= main_~b~0 0)} is VALID [2022-04-15 13:14:52,089 INFO L290 TraceCheckUtils]: 12: Hoare triple {7979#(= main_~b~0 0)} assume !!(~c~0 < 6); {7979#(= main_~b~0 0)} is VALID [2022-04-15 13:14:52,089 INFO L290 TraceCheckUtils]: 13: Hoare triple {7979#(= main_~b~0 0)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {7979#(= main_~b~0 0)} is VALID [2022-04-15 13:14:52,089 INFO L290 TraceCheckUtils]: 14: Hoare triple {7979#(= main_~b~0 0)} assume !!(~c~0 < 6); {7979#(= main_~b~0 0)} is VALID [2022-04-15 13:14:52,090 INFO L290 TraceCheckUtils]: 15: Hoare triple {7979#(= main_~b~0 0)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {7979#(= main_~b~0 0)} is VALID [2022-04-15 13:14:52,090 INFO L290 TraceCheckUtils]: 16: Hoare triple {7979#(= main_~b~0 0)} assume !!(~c~0 < 6); {7979#(= main_~b~0 0)} is VALID [2022-04-15 13:14:52,090 INFO L290 TraceCheckUtils]: 17: Hoare triple {7979#(= main_~b~0 0)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {7979#(= main_~b~0 0)} is VALID [2022-04-15 13:14:52,091 INFO L290 TraceCheckUtils]: 18: Hoare triple {7979#(= main_~b~0 0)} assume !!(~c~0 < 6); {7979#(= main_~b~0 0)} is VALID [2022-04-15 13:14:52,091 INFO L290 TraceCheckUtils]: 19: Hoare triple {7979#(= main_~b~0 0)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {7979#(= main_~b~0 0)} is VALID [2022-04-15 13:14:52,091 INFO L290 TraceCheckUtils]: 20: Hoare triple {7979#(= main_~b~0 0)} assume !(~c~0 < 6); {7979#(= main_~b~0 0)} is VALID [2022-04-15 13:14:52,092 INFO L290 TraceCheckUtils]: 21: Hoare triple {7979#(= main_~b~0 0)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {7980#(<= main_~b~0 1)} is VALID [2022-04-15 13:14:52,092 INFO L290 TraceCheckUtils]: 22: Hoare triple {7980#(<= main_~b~0 1)} assume !!(~b~0 < 6);~c~0 := 0; {7980#(<= main_~b~0 1)} is VALID [2022-04-15 13:14:52,092 INFO L290 TraceCheckUtils]: 23: Hoare triple {7980#(<= main_~b~0 1)} assume !!(~c~0 < 6); {7980#(<= main_~b~0 1)} is VALID [2022-04-15 13:14:52,093 INFO L290 TraceCheckUtils]: 24: Hoare triple {7980#(<= main_~b~0 1)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {7980#(<= main_~b~0 1)} is VALID [2022-04-15 13:14:52,093 INFO L290 TraceCheckUtils]: 25: Hoare triple {7980#(<= main_~b~0 1)} assume !!(~c~0 < 6); {7980#(<= main_~b~0 1)} is VALID [2022-04-15 13:14:52,093 INFO L290 TraceCheckUtils]: 26: Hoare triple {7980#(<= main_~b~0 1)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {7980#(<= main_~b~0 1)} is VALID [2022-04-15 13:14:52,094 INFO L290 TraceCheckUtils]: 27: Hoare triple {7980#(<= main_~b~0 1)} assume !!(~c~0 < 6); {7980#(<= main_~b~0 1)} is VALID [2022-04-15 13:14:52,094 INFO L290 TraceCheckUtils]: 28: Hoare triple {7980#(<= main_~b~0 1)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {7980#(<= main_~b~0 1)} is VALID [2022-04-15 13:14:52,094 INFO L290 TraceCheckUtils]: 29: Hoare triple {7980#(<= main_~b~0 1)} assume !!(~c~0 < 6); {7980#(<= main_~b~0 1)} is VALID [2022-04-15 13:14:52,095 INFO L290 TraceCheckUtils]: 30: Hoare triple {7980#(<= main_~b~0 1)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {7980#(<= main_~b~0 1)} is VALID [2022-04-15 13:14:52,095 INFO L290 TraceCheckUtils]: 31: Hoare triple {7980#(<= main_~b~0 1)} assume !!(~c~0 < 6); {7980#(<= main_~b~0 1)} is VALID [2022-04-15 13:14:52,095 INFO L290 TraceCheckUtils]: 32: Hoare triple {7980#(<= main_~b~0 1)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {7980#(<= main_~b~0 1)} is VALID [2022-04-15 13:14:52,096 INFO L290 TraceCheckUtils]: 33: Hoare triple {7980#(<= main_~b~0 1)} assume !!(~c~0 < 6); {7980#(<= main_~b~0 1)} is VALID [2022-04-15 13:14:52,096 INFO L290 TraceCheckUtils]: 34: Hoare triple {7980#(<= main_~b~0 1)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {7980#(<= main_~b~0 1)} is VALID [2022-04-15 13:14:52,096 INFO L290 TraceCheckUtils]: 35: Hoare triple {7980#(<= main_~b~0 1)} assume !(~c~0 < 6); {7980#(<= main_~b~0 1)} is VALID [2022-04-15 13:14:52,097 INFO L290 TraceCheckUtils]: 36: Hoare triple {7980#(<= main_~b~0 1)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {7981#(<= main_~b~0 2)} is VALID [2022-04-15 13:14:52,097 INFO L290 TraceCheckUtils]: 37: Hoare triple {7981#(<= main_~b~0 2)} assume !!(~b~0 < 6);~c~0 := 0; {7981#(<= main_~b~0 2)} is VALID [2022-04-15 13:14:52,098 INFO L290 TraceCheckUtils]: 38: Hoare triple {7981#(<= main_~b~0 2)} assume !!(~c~0 < 6); {7981#(<= main_~b~0 2)} is VALID [2022-04-15 13:14:52,098 INFO L290 TraceCheckUtils]: 39: Hoare triple {7981#(<= main_~b~0 2)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {7981#(<= main_~b~0 2)} is VALID [2022-04-15 13:14:52,098 INFO L290 TraceCheckUtils]: 40: Hoare triple {7981#(<= main_~b~0 2)} assume !!(~c~0 < 6); {7981#(<= main_~b~0 2)} is VALID [2022-04-15 13:14:52,099 INFO L290 TraceCheckUtils]: 41: Hoare triple {7981#(<= main_~b~0 2)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {7981#(<= main_~b~0 2)} is VALID [2022-04-15 13:14:52,099 INFO L290 TraceCheckUtils]: 42: Hoare triple {7981#(<= main_~b~0 2)} assume !!(~c~0 < 6); {7981#(<= main_~b~0 2)} is VALID [2022-04-15 13:14:52,099 INFO L290 TraceCheckUtils]: 43: Hoare triple {7981#(<= main_~b~0 2)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {7981#(<= main_~b~0 2)} is VALID [2022-04-15 13:14:52,100 INFO L290 TraceCheckUtils]: 44: Hoare triple {7981#(<= main_~b~0 2)} assume !!(~c~0 < 6); {7981#(<= main_~b~0 2)} is VALID [2022-04-15 13:14:52,100 INFO L290 TraceCheckUtils]: 45: Hoare triple {7981#(<= main_~b~0 2)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {7981#(<= main_~b~0 2)} is VALID [2022-04-15 13:14:52,100 INFO L290 TraceCheckUtils]: 46: Hoare triple {7981#(<= main_~b~0 2)} assume !!(~c~0 < 6); {7981#(<= main_~b~0 2)} is VALID [2022-04-15 13:14:52,101 INFO L290 TraceCheckUtils]: 47: Hoare triple {7981#(<= main_~b~0 2)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {7981#(<= main_~b~0 2)} is VALID [2022-04-15 13:14:52,101 INFO L290 TraceCheckUtils]: 48: Hoare triple {7981#(<= main_~b~0 2)} assume !!(~c~0 < 6); {7981#(<= main_~b~0 2)} is VALID [2022-04-15 13:14:52,101 INFO L290 TraceCheckUtils]: 49: Hoare triple {7981#(<= main_~b~0 2)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {7981#(<= main_~b~0 2)} is VALID [2022-04-15 13:14:52,101 INFO L290 TraceCheckUtils]: 50: Hoare triple {7981#(<= main_~b~0 2)} assume !(~c~0 < 6); {7981#(<= main_~b~0 2)} is VALID [2022-04-15 13:14:52,102 INFO L290 TraceCheckUtils]: 51: Hoare triple {7981#(<= main_~b~0 2)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {7982#(<= main_~b~0 3)} is VALID [2022-04-15 13:14:52,102 INFO L290 TraceCheckUtils]: 52: Hoare triple {7982#(<= main_~b~0 3)} assume !!(~b~0 < 6);~c~0 := 0; {7982#(<= main_~b~0 3)} is VALID [2022-04-15 13:14:52,103 INFO L290 TraceCheckUtils]: 53: Hoare triple {7982#(<= main_~b~0 3)} assume !!(~c~0 < 6); {7982#(<= main_~b~0 3)} is VALID [2022-04-15 13:14:52,103 INFO L290 TraceCheckUtils]: 54: Hoare triple {7982#(<= main_~b~0 3)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {7982#(<= main_~b~0 3)} is VALID [2022-04-15 13:14:52,103 INFO L290 TraceCheckUtils]: 55: Hoare triple {7982#(<= main_~b~0 3)} assume !!(~c~0 < 6); {7982#(<= main_~b~0 3)} is VALID [2022-04-15 13:14:52,104 INFO L290 TraceCheckUtils]: 56: Hoare triple {7982#(<= main_~b~0 3)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {7982#(<= main_~b~0 3)} is VALID [2022-04-15 13:14:52,104 INFO L290 TraceCheckUtils]: 57: Hoare triple {7982#(<= main_~b~0 3)} assume !!(~c~0 < 6); {7982#(<= main_~b~0 3)} is VALID [2022-04-15 13:14:52,104 INFO L290 TraceCheckUtils]: 58: Hoare triple {7982#(<= main_~b~0 3)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {7982#(<= main_~b~0 3)} is VALID [2022-04-15 13:14:52,105 INFO L290 TraceCheckUtils]: 59: Hoare triple {7982#(<= main_~b~0 3)} assume !!(~c~0 < 6); {7982#(<= main_~b~0 3)} is VALID [2022-04-15 13:14:52,105 INFO L290 TraceCheckUtils]: 60: Hoare triple {7982#(<= main_~b~0 3)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {7982#(<= main_~b~0 3)} is VALID [2022-04-15 13:14:52,105 INFO L290 TraceCheckUtils]: 61: Hoare triple {7982#(<= main_~b~0 3)} assume !!(~c~0 < 6); {7982#(<= main_~b~0 3)} is VALID [2022-04-15 13:14:52,105 INFO L290 TraceCheckUtils]: 62: Hoare triple {7982#(<= main_~b~0 3)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {7982#(<= main_~b~0 3)} is VALID [2022-04-15 13:14:52,106 INFO L290 TraceCheckUtils]: 63: Hoare triple {7982#(<= main_~b~0 3)} assume !!(~c~0 < 6); {7982#(<= main_~b~0 3)} is VALID [2022-04-15 13:14:52,106 INFO L290 TraceCheckUtils]: 64: Hoare triple {7982#(<= main_~b~0 3)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {7982#(<= main_~b~0 3)} is VALID [2022-04-15 13:14:52,106 INFO L290 TraceCheckUtils]: 65: Hoare triple {7982#(<= main_~b~0 3)} assume !(~c~0 < 6); {7982#(<= main_~b~0 3)} is VALID [2022-04-15 13:14:52,107 INFO L290 TraceCheckUtils]: 66: Hoare triple {7982#(<= main_~b~0 3)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {7983#(<= main_~b~0 4)} is VALID [2022-04-15 13:14:52,107 INFO L290 TraceCheckUtils]: 67: Hoare triple {7983#(<= main_~b~0 4)} assume !(~b~0 < 6); {7975#false} is VALID [2022-04-15 13:14:52,107 INFO L290 TraceCheckUtils]: 68: Hoare triple {7975#false} #t~pre4 := 1 + ~a~0;~a~0 := 1 + ~a~0;havoc #t~pre4; {7975#false} is VALID [2022-04-15 13:14:52,108 INFO L290 TraceCheckUtils]: 69: Hoare triple {7975#false} assume !!(~a~0 < 6);~b~0 := 0; {7975#false} is VALID [2022-04-15 13:14:52,108 INFO L290 TraceCheckUtils]: 70: Hoare triple {7975#false} assume !!(~b~0 < 6);~c~0 := 0; {7975#false} is VALID [2022-04-15 13:14:52,108 INFO L290 TraceCheckUtils]: 71: Hoare triple {7975#false} assume !!(~c~0 < 6); {7975#false} is VALID [2022-04-15 13:14:52,108 INFO L290 TraceCheckUtils]: 72: Hoare triple {7975#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {7975#false} is VALID [2022-04-15 13:14:52,108 INFO L290 TraceCheckUtils]: 73: Hoare triple {7975#false} assume !!(~c~0 < 6); {7975#false} is VALID [2022-04-15 13:14:52,108 INFO L290 TraceCheckUtils]: 74: Hoare triple {7975#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {7975#false} is VALID [2022-04-15 13:14:52,108 INFO L290 TraceCheckUtils]: 75: Hoare triple {7975#false} assume !!(~c~0 < 6); {7975#false} is VALID [2022-04-15 13:14:52,108 INFO L290 TraceCheckUtils]: 76: Hoare triple {7975#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {7975#false} is VALID [2022-04-15 13:14:52,108 INFO L290 TraceCheckUtils]: 77: Hoare triple {7975#false} assume !!(~c~0 < 6); {7975#false} is VALID [2022-04-15 13:14:52,109 INFO L290 TraceCheckUtils]: 78: Hoare triple {7975#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {7975#false} is VALID [2022-04-15 13:14:52,109 INFO L290 TraceCheckUtils]: 79: Hoare triple {7975#false} assume !!(~c~0 < 6); {7975#false} is VALID [2022-04-15 13:14:52,109 INFO L290 TraceCheckUtils]: 80: Hoare triple {7975#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {7975#false} is VALID [2022-04-15 13:14:52,109 INFO L290 TraceCheckUtils]: 81: Hoare triple {7975#false} assume !!(~c~0 < 6); {7975#false} is VALID [2022-04-15 13:14:52,109 INFO L290 TraceCheckUtils]: 82: Hoare triple {7975#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {7975#false} is VALID [2022-04-15 13:14:52,109 INFO L290 TraceCheckUtils]: 83: Hoare triple {7975#false} assume !(~c~0 < 6); {7975#false} is VALID [2022-04-15 13:14:52,109 INFO L290 TraceCheckUtils]: 84: Hoare triple {7975#false} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {7975#false} is VALID [2022-04-15 13:14:52,109 INFO L290 TraceCheckUtils]: 85: Hoare triple {7975#false} assume !!(~b~0 < 6);~c~0 := 0; {7975#false} is VALID [2022-04-15 13:14:52,109 INFO L290 TraceCheckUtils]: 86: Hoare triple {7975#false} assume !!(~c~0 < 6); {7975#false} is VALID [2022-04-15 13:14:52,109 INFO L290 TraceCheckUtils]: 87: Hoare triple {7975#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {7975#false} is VALID [2022-04-15 13:14:52,110 INFO L290 TraceCheckUtils]: 88: Hoare triple {7975#false} assume !!(~c~0 < 6); {7975#false} is VALID [2022-04-15 13:14:52,110 INFO L290 TraceCheckUtils]: 89: Hoare triple {7975#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {7975#false} is VALID [2022-04-15 13:14:52,110 INFO L290 TraceCheckUtils]: 90: Hoare triple {7975#false} assume !!(~c~0 < 6); {7975#false} is VALID [2022-04-15 13:14:52,110 INFO L290 TraceCheckUtils]: 91: Hoare triple {7975#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {7975#false} is VALID [2022-04-15 13:14:52,110 INFO L290 TraceCheckUtils]: 92: Hoare triple {7975#false} assume !!(~c~0 < 6); {7975#false} is VALID [2022-04-15 13:14:52,110 INFO L290 TraceCheckUtils]: 93: Hoare triple {7975#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {7975#false} is VALID [2022-04-15 13:14:52,110 INFO L290 TraceCheckUtils]: 94: Hoare triple {7975#false} assume !!(~c~0 < 6); {7975#false} is VALID [2022-04-15 13:14:52,110 INFO L290 TraceCheckUtils]: 95: Hoare triple {7975#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {7975#false} is VALID [2022-04-15 13:14:52,110 INFO L290 TraceCheckUtils]: 96: Hoare triple {7975#false} assume !!(~c~0 < 6); {7975#false} is VALID [2022-04-15 13:14:52,110 INFO L290 TraceCheckUtils]: 97: Hoare triple {7975#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {7975#false} is VALID [2022-04-15 13:14:52,111 INFO L290 TraceCheckUtils]: 98: Hoare triple {7975#false} assume !(~c~0 < 6); {7975#false} is VALID [2022-04-15 13:14:52,111 INFO L290 TraceCheckUtils]: 99: Hoare triple {7975#false} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {7975#false} is VALID [2022-04-15 13:14:52,111 INFO L290 TraceCheckUtils]: 100: Hoare triple {7975#false} assume !!(~b~0 < 6);~c~0 := 0; {7975#false} is VALID [2022-04-15 13:14:52,111 INFO L290 TraceCheckUtils]: 101: Hoare triple {7975#false} assume !!(~c~0 < 6); {7975#false} is VALID [2022-04-15 13:14:52,111 INFO L290 TraceCheckUtils]: 102: Hoare triple {7975#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {7975#false} is VALID [2022-04-15 13:14:52,111 INFO L290 TraceCheckUtils]: 103: Hoare triple {7975#false} assume !!(~c~0 < 6); {7975#false} is VALID [2022-04-15 13:14:52,111 INFO L290 TraceCheckUtils]: 104: Hoare triple {7975#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {7975#false} is VALID [2022-04-15 13:14:52,111 INFO L290 TraceCheckUtils]: 105: Hoare triple {7975#false} assume !!(~c~0 < 6); {7975#false} is VALID [2022-04-15 13:14:52,111 INFO L290 TraceCheckUtils]: 106: Hoare triple {7975#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {7975#false} is VALID [2022-04-15 13:14:52,111 INFO L290 TraceCheckUtils]: 107: Hoare triple {7975#false} assume !!(~c~0 < 6); {7975#false} is VALID [2022-04-15 13:14:52,112 INFO L290 TraceCheckUtils]: 108: Hoare triple {7975#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {7975#false} is VALID [2022-04-15 13:14:52,112 INFO L290 TraceCheckUtils]: 109: Hoare triple {7975#false} assume !!(~c~0 < 6); {7975#false} is VALID [2022-04-15 13:14:52,112 INFO L290 TraceCheckUtils]: 110: Hoare triple {7975#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {7975#false} is VALID [2022-04-15 13:14:52,112 INFO L290 TraceCheckUtils]: 111: Hoare triple {7975#false} assume !!(~c~0 < 6); {7975#false} is VALID [2022-04-15 13:14:52,112 INFO L290 TraceCheckUtils]: 112: Hoare triple {7975#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {7975#false} is VALID [2022-04-15 13:14:52,112 INFO L290 TraceCheckUtils]: 113: Hoare triple {7975#false} assume !(~c~0 < 6); {7975#false} is VALID [2022-04-15 13:14:52,112 INFO L290 TraceCheckUtils]: 114: Hoare triple {7975#false} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {7975#false} is VALID [2022-04-15 13:14:52,112 INFO L290 TraceCheckUtils]: 115: Hoare triple {7975#false} assume !!(~b~0 < 6);~c~0 := 0; {7975#false} is VALID [2022-04-15 13:14:52,112 INFO L290 TraceCheckUtils]: 116: Hoare triple {7975#false} assume !!(~c~0 < 6); {7975#false} is VALID [2022-04-15 13:14:52,112 INFO L290 TraceCheckUtils]: 117: Hoare triple {7975#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {7975#false} is VALID [2022-04-15 13:14:52,112 INFO L290 TraceCheckUtils]: 118: Hoare triple {7975#false} assume !!(~c~0 < 6); {7975#false} is VALID [2022-04-15 13:14:52,113 INFO L290 TraceCheckUtils]: 119: Hoare triple {7975#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {7975#false} is VALID [2022-04-15 13:14:52,113 INFO L290 TraceCheckUtils]: 120: Hoare triple {7975#false} assume !!(~c~0 < 6); {7975#false} is VALID [2022-04-15 13:14:52,113 INFO L290 TraceCheckUtils]: 121: Hoare triple {7975#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {7975#false} is VALID [2022-04-15 13:14:52,113 INFO L290 TraceCheckUtils]: 122: Hoare triple {7975#false} assume !!(~c~0 < 6); {7975#false} is VALID [2022-04-15 13:14:52,113 INFO L290 TraceCheckUtils]: 123: Hoare triple {7975#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {7975#false} is VALID [2022-04-15 13:14:52,113 INFO L290 TraceCheckUtils]: 124: Hoare triple {7975#false} assume !!(~c~0 < 6); {7975#false} is VALID [2022-04-15 13:14:52,113 INFO L290 TraceCheckUtils]: 125: Hoare triple {7975#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {7975#false} is VALID [2022-04-15 13:14:52,113 INFO L290 TraceCheckUtils]: 126: Hoare triple {7975#false} assume !!(~c~0 < 6); {7975#false} is VALID [2022-04-15 13:14:52,113 INFO L290 TraceCheckUtils]: 127: Hoare triple {7975#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {7975#false} is VALID [2022-04-15 13:14:52,113 INFO L290 TraceCheckUtils]: 128: Hoare triple {7975#false} assume !(~c~0 < 6); {7975#false} is VALID [2022-04-15 13:14:52,114 INFO L290 TraceCheckUtils]: 129: Hoare triple {7975#false} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {7975#false} is VALID [2022-04-15 13:14:52,114 INFO L290 TraceCheckUtils]: 130: Hoare triple {7975#false} assume !(~b~0 < 6); {7975#false} is VALID [2022-04-15 13:14:52,114 INFO L290 TraceCheckUtils]: 131: Hoare triple {7975#false} #t~pre4 := 1 + ~a~0;~a~0 := 1 + ~a~0;havoc #t~pre4; {7975#false} is VALID [2022-04-15 13:14:52,114 INFO L290 TraceCheckUtils]: 132: Hoare triple {7975#false} assume !(~a~0 < 6); {7975#false} is VALID [2022-04-15 13:14:52,114 INFO L290 TraceCheckUtils]: 133: Hoare triple {7975#false} assume !((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0); {7975#false} is VALID [2022-04-15 13:14:52,114 INFO L290 TraceCheckUtils]: 134: Hoare triple {7975#false} assume !false; {7975#false} is VALID [2022-04-15 13:14:52,115 INFO L134 CoverageAnalysis]: Checked inductivity of 2745 backedges. 1403 proven. 526 refuted. 0 times theorem prover too weak. 816 trivial. 0 not checked. [2022-04-15 13:14:52,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:14:52,116 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [103372966] [2022-04-15 13:14:52,116 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [103372966] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 13:14:52,116 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [918968209] [2022-04-15 13:14:52,116 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 13:14:52,116 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 13:14:52,116 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 13:14:52,120 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 13:14:52,145 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-04-15 13:14:52,201 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 13:14:52,201 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 13:14:52,202 INFO L263 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 6 conjunts are in the unsatisfiable core [2022-04-15 13:14:52,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:14:52,220 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 13:14:52,546 INFO L272 TraceCheckUtils]: 0: Hoare triple {7974#true} call ULTIMATE.init(); {7974#true} is VALID [2022-04-15 13:14:52,547 INFO L290 TraceCheckUtils]: 1: Hoare triple {7974#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); {7974#true} is VALID [2022-04-15 13:14:52,547 INFO L290 TraceCheckUtils]: 2: Hoare triple {7974#true} assume true; {7974#true} is VALID [2022-04-15 13:14:52,547 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7974#true} {7974#true} #56#return; {7974#true} is VALID [2022-04-15 13:14:52,547 INFO L272 TraceCheckUtils]: 4: Hoare triple {7974#true} call #t~ret7 := main(); {7974#true} is VALID [2022-04-15 13:14:52,547 INFO L290 TraceCheckUtils]: 5: Hoare triple {7974#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~a~0 := 0; {7974#true} is VALID [2022-04-15 13:14:52,547 INFO L290 TraceCheckUtils]: 6: Hoare triple {7974#true} assume !!(~a~0 < 6);~b~0 := 0; {8006#(<= main_~b~0 0)} is VALID [2022-04-15 13:14:52,548 INFO L290 TraceCheckUtils]: 7: Hoare triple {8006#(<= main_~b~0 0)} assume !!(~b~0 < 6);~c~0 := 0; {8006#(<= main_~b~0 0)} is VALID [2022-04-15 13:14:52,548 INFO L290 TraceCheckUtils]: 8: Hoare triple {8006#(<= main_~b~0 0)} assume !!(~c~0 < 6); {8006#(<= main_~b~0 0)} is VALID [2022-04-15 13:14:52,548 INFO L290 TraceCheckUtils]: 9: Hoare triple {8006#(<= main_~b~0 0)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {8006#(<= main_~b~0 0)} is VALID [2022-04-15 13:14:52,548 INFO L290 TraceCheckUtils]: 10: Hoare triple {8006#(<= main_~b~0 0)} assume !!(~c~0 < 6); {8006#(<= main_~b~0 0)} is VALID [2022-04-15 13:14:52,549 INFO L290 TraceCheckUtils]: 11: Hoare triple {8006#(<= main_~b~0 0)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {8006#(<= main_~b~0 0)} is VALID [2022-04-15 13:14:52,549 INFO L290 TraceCheckUtils]: 12: Hoare triple {8006#(<= main_~b~0 0)} assume !!(~c~0 < 6); {8006#(<= main_~b~0 0)} is VALID [2022-04-15 13:14:52,549 INFO L290 TraceCheckUtils]: 13: Hoare triple {8006#(<= main_~b~0 0)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {8006#(<= main_~b~0 0)} is VALID [2022-04-15 13:14:52,549 INFO L290 TraceCheckUtils]: 14: Hoare triple {8006#(<= main_~b~0 0)} assume !!(~c~0 < 6); {8006#(<= main_~b~0 0)} is VALID [2022-04-15 13:14:52,550 INFO L290 TraceCheckUtils]: 15: Hoare triple {8006#(<= main_~b~0 0)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {8006#(<= main_~b~0 0)} is VALID [2022-04-15 13:14:52,550 INFO L290 TraceCheckUtils]: 16: Hoare triple {8006#(<= main_~b~0 0)} assume !!(~c~0 < 6); {8006#(<= main_~b~0 0)} is VALID [2022-04-15 13:14:52,550 INFO L290 TraceCheckUtils]: 17: Hoare triple {8006#(<= main_~b~0 0)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {8006#(<= main_~b~0 0)} is VALID [2022-04-15 13:14:52,551 INFO L290 TraceCheckUtils]: 18: Hoare triple {8006#(<= main_~b~0 0)} assume !!(~c~0 < 6); {8006#(<= main_~b~0 0)} is VALID [2022-04-15 13:14:52,551 INFO L290 TraceCheckUtils]: 19: Hoare triple {8006#(<= main_~b~0 0)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {8006#(<= main_~b~0 0)} is VALID [2022-04-15 13:14:52,551 INFO L290 TraceCheckUtils]: 20: Hoare triple {8006#(<= main_~b~0 0)} assume !(~c~0 < 6); {8006#(<= main_~b~0 0)} is VALID [2022-04-15 13:14:52,552 INFO L290 TraceCheckUtils]: 21: Hoare triple {8006#(<= main_~b~0 0)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {7980#(<= main_~b~0 1)} is VALID [2022-04-15 13:14:52,552 INFO L290 TraceCheckUtils]: 22: Hoare triple {7980#(<= main_~b~0 1)} assume !!(~b~0 < 6);~c~0 := 0; {7980#(<= main_~b~0 1)} is VALID [2022-04-15 13:14:52,552 INFO L290 TraceCheckUtils]: 23: Hoare triple {7980#(<= main_~b~0 1)} assume !!(~c~0 < 6); {7980#(<= main_~b~0 1)} is VALID [2022-04-15 13:14:52,553 INFO L290 TraceCheckUtils]: 24: Hoare triple {7980#(<= main_~b~0 1)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {7980#(<= main_~b~0 1)} is VALID [2022-04-15 13:14:52,553 INFO L290 TraceCheckUtils]: 25: Hoare triple {7980#(<= main_~b~0 1)} assume !!(~c~0 < 6); {7980#(<= main_~b~0 1)} is VALID [2022-04-15 13:14:52,553 INFO L290 TraceCheckUtils]: 26: Hoare triple {7980#(<= main_~b~0 1)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {7980#(<= main_~b~0 1)} is VALID [2022-04-15 13:14:52,553 INFO L290 TraceCheckUtils]: 27: Hoare triple {7980#(<= main_~b~0 1)} assume !!(~c~0 < 6); {7980#(<= main_~b~0 1)} is VALID [2022-04-15 13:14:52,554 INFO L290 TraceCheckUtils]: 28: Hoare triple {7980#(<= main_~b~0 1)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {7980#(<= main_~b~0 1)} is VALID [2022-04-15 13:14:52,554 INFO L290 TraceCheckUtils]: 29: Hoare triple {7980#(<= main_~b~0 1)} assume !!(~c~0 < 6); {7980#(<= main_~b~0 1)} is VALID [2022-04-15 13:14:52,554 INFO L290 TraceCheckUtils]: 30: Hoare triple {7980#(<= main_~b~0 1)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {7980#(<= main_~b~0 1)} is VALID [2022-04-15 13:14:52,554 INFO L290 TraceCheckUtils]: 31: Hoare triple {7980#(<= main_~b~0 1)} assume !!(~c~0 < 6); {7980#(<= main_~b~0 1)} is VALID [2022-04-15 13:14:52,555 INFO L290 TraceCheckUtils]: 32: Hoare triple {7980#(<= main_~b~0 1)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {7980#(<= main_~b~0 1)} is VALID [2022-04-15 13:14:52,555 INFO L290 TraceCheckUtils]: 33: Hoare triple {7980#(<= main_~b~0 1)} assume !!(~c~0 < 6); {7980#(<= main_~b~0 1)} is VALID [2022-04-15 13:14:52,556 INFO L290 TraceCheckUtils]: 34: Hoare triple {7980#(<= main_~b~0 1)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {7980#(<= main_~b~0 1)} is VALID [2022-04-15 13:14:52,556 INFO L290 TraceCheckUtils]: 35: Hoare triple {7980#(<= main_~b~0 1)} assume !(~c~0 < 6); {7980#(<= main_~b~0 1)} is VALID [2022-04-15 13:14:52,557 INFO L290 TraceCheckUtils]: 36: Hoare triple {7980#(<= main_~b~0 1)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {7981#(<= main_~b~0 2)} is VALID [2022-04-15 13:14:52,557 INFO L290 TraceCheckUtils]: 37: Hoare triple {7981#(<= main_~b~0 2)} assume !!(~b~0 < 6);~c~0 := 0; {7981#(<= main_~b~0 2)} is VALID [2022-04-15 13:14:52,557 INFO L290 TraceCheckUtils]: 38: Hoare triple {7981#(<= main_~b~0 2)} assume !!(~c~0 < 6); {7981#(<= main_~b~0 2)} is VALID [2022-04-15 13:14:52,558 INFO L290 TraceCheckUtils]: 39: Hoare triple {7981#(<= main_~b~0 2)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {7981#(<= main_~b~0 2)} is VALID [2022-04-15 13:14:52,558 INFO L290 TraceCheckUtils]: 40: Hoare triple {7981#(<= main_~b~0 2)} assume !!(~c~0 < 6); {7981#(<= main_~b~0 2)} is VALID [2022-04-15 13:14:52,558 INFO L290 TraceCheckUtils]: 41: Hoare triple {7981#(<= main_~b~0 2)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {7981#(<= main_~b~0 2)} is VALID [2022-04-15 13:14:52,558 INFO L290 TraceCheckUtils]: 42: Hoare triple {7981#(<= main_~b~0 2)} assume !!(~c~0 < 6); {7981#(<= main_~b~0 2)} is VALID [2022-04-15 13:14:52,559 INFO L290 TraceCheckUtils]: 43: Hoare triple {7981#(<= main_~b~0 2)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {7981#(<= main_~b~0 2)} is VALID [2022-04-15 13:14:52,559 INFO L290 TraceCheckUtils]: 44: Hoare triple {7981#(<= main_~b~0 2)} assume !!(~c~0 < 6); {7981#(<= main_~b~0 2)} is VALID [2022-04-15 13:14:52,559 INFO L290 TraceCheckUtils]: 45: Hoare triple {7981#(<= main_~b~0 2)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {7981#(<= main_~b~0 2)} is VALID [2022-04-15 13:14:52,559 INFO L290 TraceCheckUtils]: 46: Hoare triple {7981#(<= main_~b~0 2)} assume !!(~c~0 < 6); {7981#(<= main_~b~0 2)} is VALID [2022-04-15 13:14:52,560 INFO L290 TraceCheckUtils]: 47: Hoare triple {7981#(<= main_~b~0 2)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {7981#(<= main_~b~0 2)} is VALID [2022-04-15 13:14:52,560 INFO L290 TraceCheckUtils]: 48: Hoare triple {7981#(<= main_~b~0 2)} assume !!(~c~0 < 6); {7981#(<= main_~b~0 2)} is VALID [2022-04-15 13:14:52,560 INFO L290 TraceCheckUtils]: 49: Hoare triple {7981#(<= main_~b~0 2)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {7981#(<= main_~b~0 2)} is VALID [2022-04-15 13:14:52,561 INFO L290 TraceCheckUtils]: 50: Hoare triple {7981#(<= main_~b~0 2)} assume !(~c~0 < 6); {7981#(<= main_~b~0 2)} is VALID [2022-04-15 13:14:52,561 INFO L290 TraceCheckUtils]: 51: Hoare triple {7981#(<= main_~b~0 2)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {7982#(<= main_~b~0 3)} is VALID [2022-04-15 13:14:52,561 INFO L290 TraceCheckUtils]: 52: Hoare triple {7982#(<= main_~b~0 3)} assume !!(~b~0 < 6);~c~0 := 0; {7982#(<= main_~b~0 3)} is VALID [2022-04-15 13:14:52,562 INFO L290 TraceCheckUtils]: 53: Hoare triple {7982#(<= main_~b~0 3)} assume !!(~c~0 < 6); {7982#(<= main_~b~0 3)} is VALID [2022-04-15 13:14:52,562 INFO L290 TraceCheckUtils]: 54: Hoare triple {7982#(<= main_~b~0 3)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {7982#(<= main_~b~0 3)} is VALID [2022-04-15 13:14:52,562 INFO L290 TraceCheckUtils]: 55: Hoare triple {7982#(<= main_~b~0 3)} assume !!(~c~0 < 6); {7982#(<= main_~b~0 3)} is VALID [2022-04-15 13:14:52,562 INFO L290 TraceCheckUtils]: 56: Hoare triple {7982#(<= main_~b~0 3)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {7982#(<= main_~b~0 3)} is VALID [2022-04-15 13:14:52,563 INFO L290 TraceCheckUtils]: 57: Hoare triple {7982#(<= main_~b~0 3)} assume !!(~c~0 < 6); {7982#(<= main_~b~0 3)} is VALID [2022-04-15 13:14:52,563 INFO L290 TraceCheckUtils]: 58: Hoare triple {7982#(<= main_~b~0 3)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {7982#(<= main_~b~0 3)} is VALID [2022-04-15 13:14:52,563 INFO L290 TraceCheckUtils]: 59: Hoare triple {7982#(<= main_~b~0 3)} assume !!(~c~0 < 6); {7982#(<= main_~b~0 3)} is VALID [2022-04-15 13:14:52,563 INFO L290 TraceCheckUtils]: 60: Hoare triple {7982#(<= main_~b~0 3)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {7982#(<= main_~b~0 3)} is VALID [2022-04-15 13:14:52,564 INFO L290 TraceCheckUtils]: 61: Hoare triple {7982#(<= main_~b~0 3)} assume !!(~c~0 < 6); {7982#(<= main_~b~0 3)} is VALID [2022-04-15 13:14:52,564 INFO L290 TraceCheckUtils]: 62: Hoare triple {7982#(<= main_~b~0 3)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {7982#(<= main_~b~0 3)} is VALID [2022-04-15 13:14:52,564 INFO L290 TraceCheckUtils]: 63: Hoare triple {7982#(<= main_~b~0 3)} assume !!(~c~0 < 6); {7982#(<= main_~b~0 3)} is VALID [2022-04-15 13:14:52,565 INFO L290 TraceCheckUtils]: 64: Hoare triple {7982#(<= main_~b~0 3)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {7982#(<= main_~b~0 3)} is VALID [2022-04-15 13:14:52,565 INFO L290 TraceCheckUtils]: 65: Hoare triple {7982#(<= main_~b~0 3)} assume !(~c~0 < 6); {7982#(<= main_~b~0 3)} is VALID [2022-04-15 13:14:52,565 INFO L290 TraceCheckUtils]: 66: Hoare triple {7982#(<= main_~b~0 3)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {7983#(<= main_~b~0 4)} is VALID [2022-04-15 13:14:52,566 INFO L290 TraceCheckUtils]: 67: Hoare triple {7983#(<= main_~b~0 4)} assume !(~b~0 < 6); {7975#false} is VALID [2022-04-15 13:14:52,566 INFO L290 TraceCheckUtils]: 68: Hoare triple {7975#false} #t~pre4 := 1 + ~a~0;~a~0 := 1 + ~a~0;havoc #t~pre4; {7975#false} is VALID [2022-04-15 13:14:52,566 INFO L290 TraceCheckUtils]: 69: Hoare triple {7975#false} assume !!(~a~0 < 6);~b~0 := 0; {7975#false} is VALID [2022-04-15 13:14:52,566 INFO L290 TraceCheckUtils]: 70: Hoare triple {7975#false} assume !!(~b~0 < 6);~c~0 := 0; {7975#false} is VALID [2022-04-15 13:14:52,566 INFO L290 TraceCheckUtils]: 71: Hoare triple {7975#false} assume !!(~c~0 < 6); {7975#false} is VALID [2022-04-15 13:14:52,566 INFO L290 TraceCheckUtils]: 72: Hoare triple {7975#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {7975#false} is VALID [2022-04-15 13:14:52,566 INFO L290 TraceCheckUtils]: 73: Hoare triple {7975#false} assume !!(~c~0 < 6); {7975#false} is VALID [2022-04-15 13:14:52,566 INFO L290 TraceCheckUtils]: 74: Hoare triple {7975#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {7975#false} is VALID [2022-04-15 13:14:52,566 INFO L290 TraceCheckUtils]: 75: Hoare triple {7975#false} assume !!(~c~0 < 6); {7975#false} is VALID [2022-04-15 13:14:52,566 INFO L290 TraceCheckUtils]: 76: Hoare triple {7975#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {7975#false} is VALID [2022-04-15 13:14:52,566 INFO L290 TraceCheckUtils]: 77: Hoare triple {7975#false} assume !!(~c~0 < 6); {7975#false} is VALID [2022-04-15 13:14:52,566 INFO L290 TraceCheckUtils]: 78: Hoare triple {7975#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {7975#false} is VALID [2022-04-15 13:14:52,566 INFO L290 TraceCheckUtils]: 79: Hoare triple {7975#false} assume !!(~c~0 < 6); {7975#false} is VALID [2022-04-15 13:14:52,567 INFO L290 TraceCheckUtils]: 80: Hoare triple {7975#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {7975#false} is VALID [2022-04-15 13:14:52,567 INFO L290 TraceCheckUtils]: 81: Hoare triple {7975#false} assume !!(~c~0 < 6); {7975#false} is VALID [2022-04-15 13:14:52,567 INFO L290 TraceCheckUtils]: 82: Hoare triple {7975#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {7975#false} is VALID [2022-04-15 13:14:52,567 INFO L290 TraceCheckUtils]: 83: Hoare triple {7975#false} assume !(~c~0 < 6); {7975#false} is VALID [2022-04-15 13:14:52,567 INFO L290 TraceCheckUtils]: 84: Hoare triple {7975#false} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {7975#false} is VALID [2022-04-15 13:14:52,567 INFO L290 TraceCheckUtils]: 85: Hoare triple {7975#false} assume !!(~b~0 < 6);~c~0 := 0; {7975#false} is VALID [2022-04-15 13:14:52,567 INFO L290 TraceCheckUtils]: 86: Hoare triple {7975#false} assume !!(~c~0 < 6); {7975#false} is VALID [2022-04-15 13:14:52,567 INFO L290 TraceCheckUtils]: 87: Hoare triple {7975#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {7975#false} is VALID [2022-04-15 13:14:52,567 INFO L290 TraceCheckUtils]: 88: Hoare triple {7975#false} assume !!(~c~0 < 6); {7975#false} is VALID [2022-04-15 13:14:52,567 INFO L290 TraceCheckUtils]: 89: Hoare triple {7975#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {7975#false} is VALID [2022-04-15 13:14:52,567 INFO L290 TraceCheckUtils]: 90: Hoare triple {7975#false} assume !!(~c~0 < 6); {7975#false} is VALID [2022-04-15 13:14:52,567 INFO L290 TraceCheckUtils]: 91: Hoare triple {7975#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {7975#false} is VALID [2022-04-15 13:14:52,567 INFO L290 TraceCheckUtils]: 92: Hoare triple {7975#false} assume !!(~c~0 < 6); {7975#false} is VALID [2022-04-15 13:14:52,567 INFO L290 TraceCheckUtils]: 93: Hoare triple {7975#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {7975#false} is VALID [2022-04-15 13:14:52,568 INFO L290 TraceCheckUtils]: 94: Hoare triple {7975#false} assume !!(~c~0 < 6); {7975#false} is VALID [2022-04-15 13:14:52,568 INFO L290 TraceCheckUtils]: 95: Hoare triple {7975#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {7975#false} is VALID [2022-04-15 13:14:52,568 INFO L290 TraceCheckUtils]: 96: Hoare triple {7975#false} assume !!(~c~0 < 6); {7975#false} is VALID [2022-04-15 13:14:52,568 INFO L290 TraceCheckUtils]: 97: Hoare triple {7975#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {7975#false} is VALID [2022-04-15 13:14:52,568 INFO L290 TraceCheckUtils]: 98: Hoare triple {7975#false} assume !(~c~0 < 6); {7975#false} is VALID [2022-04-15 13:14:52,568 INFO L290 TraceCheckUtils]: 99: Hoare triple {7975#false} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {7975#false} is VALID [2022-04-15 13:14:52,568 INFO L290 TraceCheckUtils]: 100: Hoare triple {7975#false} assume !!(~b~0 < 6);~c~0 := 0; {7975#false} is VALID [2022-04-15 13:14:52,568 INFO L290 TraceCheckUtils]: 101: Hoare triple {7975#false} assume !!(~c~0 < 6); {7975#false} is VALID [2022-04-15 13:14:52,568 INFO L290 TraceCheckUtils]: 102: Hoare triple {7975#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {7975#false} is VALID [2022-04-15 13:14:52,568 INFO L290 TraceCheckUtils]: 103: Hoare triple {7975#false} assume !!(~c~0 < 6); {7975#false} is VALID [2022-04-15 13:14:52,568 INFO L290 TraceCheckUtils]: 104: Hoare triple {7975#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {7975#false} is VALID [2022-04-15 13:14:52,569 INFO L290 TraceCheckUtils]: 105: Hoare triple {7975#false} assume !!(~c~0 < 6); {7975#false} is VALID [2022-04-15 13:14:52,569 INFO L290 TraceCheckUtils]: 106: Hoare triple {7975#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {7975#false} is VALID [2022-04-15 13:14:52,569 INFO L290 TraceCheckUtils]: 107: Hoare triple {7975#false} assume !!(~c~0 < 6); {7975#false} is VALID [2022-04-15 13:14:52,569 INFO L290 TraceCheckUtils]: 108: Hoare triple {7975#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {7975#false} is VALID [2022-04-15 13:14:52,569 INFO L290 TraceCheckUtils]: 109: Hoare triple {7975#false} assume !!(~c~0 < 6); {7975#false} is VALID [2022-04-15 13:14:52,569 INFO L290 TraceCheckUtils]: 110: Hoare triple {7975#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {7975#false} is VALID [2022-04-15 13:14:52,569 INFO L290 TraceCheckUtils]: 111: Hoare triple {7975#false} assume !!(~c~0 < 6); {7975#false} is VALID [2022-04-15 13:14:52,569 INFO L290 TraceCheckUtils]: 112: Hoare triple {7975#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {7975#false} is VALID [2022-04-15 13:14:52,569 INFO L290 TraceCheckUtils]: 113: Hoare triple {7975#false} assume !(~c~0 < 6); {7975#false} is VALID [2022-04-15 13:14:52,569 INFO L290 TraceCheckUtils]: 114: Hoare triple {7975#false} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {7975#false} is VALID [2022-04-15 13:14:52,570 INFO L290 TraceCheckUtils]: 115: Hoare triple {7975#false} assume !!(~b~0 < 6);~c~0 := 0; {7975#false} is VALID [2022-04-15 13:14:52,570 INFO L290 TraceCheckUtils]: 116: Hoare triple {7975#false} assume !!(~c~0 < 6); {7975#false} is VALID [2022-04-15 13:14:52,570 INFO L290 TraceCheckUtils]: 117: Hoare triple {7975#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {7975#false} is VALID [2022-04-15 13:14:52,570 INFO L290 TraceCheckUtils]: 118: Hoare triple {7975#false} assume !!(~c~0 < 6); {7975#false} is VALID [2022-04-15 13:14:52,570 INFO L290 TraceCheckUtils]: 119: Hoare triple {7975#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {7975#false} is VALID [2022-04-15 13:14:52,570 INFO L290 TraceCheckUtils]: 120: Hoare triple {7975#false} assume !!(~c~0 < 6); {7975#false} is VALID [2022-04-15 13:14:52,570 INFO L290 TraceCheckUtils]: 121: Hoare triple {7975#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {7975#false} is VALID [2022-04-15 13:14:52,570 INFO L290 TraceCheckUtils]: 122: Hoare triple {7975#false} assume !!(~c~0 < 6); {7975#false} is VALID [2022-04-15 13:14:52,570 INFO L290 TraceCheckUtils]: 123: Hoare triple {7975#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {7975#false} is VALID [2022-04-15 13:14:52,571 INFO L290 TraceCheckUtils]: 124: Hoare triple {7975#false} assume !!(~c~0 < 6); {7975#false} is VALID [2022-04-15 13:14:52,571 INFO L290 TraceCheckUtils]: 125: Hoare triple {7975#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {7975#false} is VALID [2022-04-15 13:14:52,571 INFO L290 TraceCheckUtils]: 126: Hoare triple {7975#false} assume !!(~c~0 < 6); {7975#false} is VALID [2022-04-15 13:14:52,571 INFO L290 TraceCheckUtils]: 127: Hoare triple {7975#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {7975#false} is VALID [2022-04-15 13:14:52,571 INFO L290 TraceCheckUtils]: 128: Hoare triple {7975#false} assume !(~c~0 < 6); {7975#false} is VALID [2022-04-15 13:14:52,571 INFO L290 TraceCheckUtils]: 129: Hoare triple {7975#false} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {7975#false} is VALID [2022-04-15 13:14:52,571 INFO L290 TraceCheckUtils]: 130: Hoare triple {7975#false} assume !(~b~0 < 6); {7975#false} is VALID [2022-04-15 13:14:52,571 INFO L290 TraceCheckUtils]: 131: Hoare triple {7975#false} #t~pre4 := 1 + ~a~0;~a~0 := 1 + ~a~0;havoc #t~pre4; {7975#false} is VALID [2022-04-15 13:14:52,571 INFO L290 TraceCheckUtils]: 132: Hoare triple {7975#false} assume !(~a~0 < 6); {7975#false} is VALID [2022-04-15 13:14:52,571 INFO L290 TraceCheckUtils]: 133: Hoare triple {7975#false} assume !((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0); {7975#false} is VALID [2022-04-15 13:14:52,572 INFO L290 TraceCheckUtils]: 134: Hoare triple {7975#false} assume !false; {7975#false} is VALID [2022-04-15 13:14:52,573 INFO L134 CoverageAnalysis]: Checked inductivity of 2745 backedges. 1403 proven. 526 refuted. 0 times theorem prover too weak. 816 trivial. 0 not checked. [2022-04-15 13:14:52,573 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 13:14:52,918 INFO L290 TraceCheckUtils]: 134: Hoare triple {7975#false} assume !false; {7975#false} is VALID [2022-04-15 13:14:52,918 INFO L290 TraceCheckUtils]: 133: Hoare triple {7975#false} assume !((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0); {7975#false} is VALID [2022-04-15 13:14:52,918 INFO L290 TraceCheckUtils]: 132: Hoare triple {7975#false} assume !(~a~0 < 6); {7975#false} is VALID [2022-04-15 13:14:52,918 INFO L290 TraceCheckUtils]: 131: Hoare triple {7975#false} #t~pre4 := 1 + ~a~0;~a~0 := 1 + ~a~0;havoc #t~pre4; {7975#false} is VALID [2022-04-15 13:14:52,918 INFO L290 TraceCheckUtils]: 130: Hoare triple {7975#false} assume !(~b~0 < 6); {7975#false} is VALID [2022-04-15 13:14:52,918 INFO L290 TraceCheckUtils]: 129: Hoare triple {7975#false} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {7975#false} is VALID [2022-04-15 13:14:52,918 INFO L290 TraceCheckUtils]: 128: Hoare triple {7975#false} assume !(~c~0 < 6); {7975#false} is VALID [2022-04-15 13:14:52,919 INFO L290 TraceCheckUtils]: 127: Hoare triple {7975#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {7975#false} is VALID [2022-04-15 13:14:52,919 INFO L290 TraceCheckUtils]: 126: Hoare triple {7975#false} assume !!(~c~0 < 6); {7975#false} is VALID [2022-04-15 13:14:52,919 INFO L290 TraceCheckUtils]: 125: Hoare triple {7975#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {7975#false} is VALID [2022-04-15 13:14:52,919 INFO L290 TraceCheckUtils]: 124: Hoare triple {7975#false} assume !!(~c~0 < 6); {7975#false} is VALID [2022-04-15 13:14:52,919 INFO L290 TraceCheckUtils]: 123: Hoare triple {7975#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {7975#false} is VALID [2022-04-15 13:14:52,919 INFO L290 TraceCheckUtils]: 122: Hoare triple {7975#false} assume !!(~c~0 < 6); {7975#false} is VALID [2022-04-15 13:14:52,919 INFO L290 TraceCheckUtils]: 121: Hoare triple {7975#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {7975#false} is VALID [2022-04-15 13:14:52,919 INFO L290 TraceCheckUtils]: 120: Hoare triple {7975#false} assume !!(~c~0 < 6); {7975#false} is VALID [2022-04-15 13:14:52,919 INFO L290 TraceCheckUtils]: 119: Hoare triple {7975#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {7975#false} is VALID [2022-04-15 13:14:52,920 INFO L290 TraceCheckUtils]: 118: Hoare triple {7975#false} assume !!(~c~0 < 6); {7975#false} is VALID [2022-04-15 13:14:52,920 INFO L290 TraceCheckUtils]: 117: Hoare triple {7975#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {7975#false} is VALID [2022-04-15 13:14:52,920 INFO L290 TraceCheckUtils]: 116: Hoare triple {7975#false} assume !!(~c~0 < 6); {7975#false} is VALID [2022-04-15 13:14:52,920 INFO L290 TraceCheckUtils]: 115: Hoare triple {7975#false} assume !!(~b~0 < 6);~c~0 := 0; {7975#false} is VALID [2022-04-15 13:14:52,920 INFO L290 TraceCheckUtils]: 114: Hoare triple {7975#false} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {7975#false} is VALID [2022-04-15 13:14:52,920 INFO L290 TraceCheckUtils]: 113: Hoare triple {7975#false} assume !(~c~0 < 6); {7975#false} is VALID [2022-04-15 13:14:52,920 INFO L290 TraceCheckUtils]: 112: Hoare triple {7975#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {7975#false} is VALID [2022-04-15 13:14:52,920 INFO L290 TraceCheckUtils]: 111: Hoare triple {7975#false} assume !!(~c~0 < 6); {7975#false} is VALID [2022-04-15 13:14:52,920 INFO L290 TraceCheckUtils]: 110: Hoare triple {7975#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {7975#false} is VALID [2022-04-15 13:14:52,920 INFO L290 TraceCheckUtils]: 109: Hoare triple {7975#false} assume !!(~c~0 < 6); {7975#false} is VALID [2022-04-15 13:14:52,921 INFO L290 TraceCheckUtils]: 108: Hoare triple {7975#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {7975#false} is VALID [2022-04-15 13:14:52,921 INFO L290 TraceCheckUtils]: 107: Hoare triple {7975#false} assume !!(~c~0 < 6); {7975#false} is VALID [2022-04-15 13:14:52,921 INFO L290 TraceCheckUtils]: 106: Hoare triple {7975#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {7975#false} is VALID [2022-04-15 13:14:52,921 INFO L290 TraceCheckUtils]: 105: Hoare triple {7975#false} assume !!(~c~0 < 6); {7975#false} is VALID [2022-04-15 13:14:52,921 INFO L290 TraceCheckUtils]: 104: Hoare triple {7975#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {7975#false} is VALID [2022-04-15 13:14:52,921 INFO L290 TraceCheckUtils]: 103: Hoare triple {7975#false} assume !!(~c~0 < 6); {7975#false} is VALID [2022-04-15 13:14:52,921 INFO L290 TraceCheckUtils]: 102: Hoare triple {7975#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {7975#false} is VALID [2022-04-15 13:14:52,921 INFO L290 TraceCheckUtils]: 101: Hoare triple {7975#false} assume !!(~c~0 < 6); {7975#false} is VALID [2022-04-15 13:14:52,921 INFO L290 TraceCheckUtils]: 100: Hoare triple {7975#false} assume !!(~b~0 < 6);~c~0 := 0; {7975#false} is VALID [2022-04-15 13:14:52,922 INFO L290 TraceCheckUtils]: 99: Hoare triple {7975#false} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {7975#false} is VALID [2022-04-15 13:14:52,922 INFO L290 TraceCheckUtils]: 98: Hoare triple {7975#false} assume !(~c~0 < 6); {7975#false} is VALID [2022-04-15 13:14:52,922 INFO L290 TraceCheckUtils]: 97: Hoare triple {7975#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {7975#false} is VALID [2022-04-15 13:14:52,922 INFO L290 TraceCheckUtils]: 96: Hoare triple {7975#false} assume !!(~c~0 < 6); {7975#false} is VALID [2022-04-15 13:14:52,922 INFO L290 TraceCheckUtils]: 95: Hoare triple {7975#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {7975#false} is VALID [2022-04-15 13:14:52,922 INFO L290 TraceCheckUtils]: 94: Hoare triple {7975#false} assume !!(~c~0 < 6); {7975#false} is VALID [2022-04-15 13:14:52,922 INFO L290 TraceCheckUtils]: 93: Hoare triple {7975#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {7975#false} is VALID [2022-04-15 13:14:52,922 INFO L290 TraceCheckUtils]: 92: Hoare triple {7975#false} assume !!(~c~0 < 6); {7975#false} is VALID [2022-04-15 13:14:52,922 INFO L290 TraceCheckUtils]: 91: Hoare triple {7975#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {7975#false} is VALID [2022-04-15 13:14:52,923 INFO L290 TraceCheckUtils]: 90: Hoare triple {7975#false} assume !!(~c~0 < 6); {7975#false} is VALID [2022-04-15 13:14:52,923 INFO L290 TraceCheckUtils]: 89: Hoare triple {7975#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {7975#false} is VALID [2022-04-15 13:14:52,923 INFO L290 TraceCheckUtils]: 88: Hoare triple {7975#false} assume !!(~c~0 < 6); {7975#false} is VALID [2022-04-15 13:14:52,923 INFO L290 TraceCheckUtils]: 87: Hoare triple {7975#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {7975#false} is VALID [2022-04-15 13:14:52,923 INFO L290 TraceCheckUtils]: 86: Hoare triple {7975#false} assume !!(~c~0 < 6); {7975#false} is VALID [2022-04-15 13:14:52,923 INFO L290 TraceCheckUtils]: 85: Hoare triple {7975#false} assume !!(~b~0 < 6);~c~0 := 0; {7975#false} is VALID [2022-04-15 13:14:52,923 INFO L290 TraceCheckUtils]: 84: Hoare triple {7975#false} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {7975#false} is VALID [2022-04-15 13:14:52,923 INFO L290 TraceCheckUtils]: 83: Hoare triple {7975#false} assume !(~c~0 < 6); {7975#false} is VALID [2022-04-15 13:14:52,923 INFO L290 TraceCheckUtils]: 82: Hoare triple {7975#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {7975#false} is VALID [2022-04-15 13:14:52,923 INFO L290 TraceCheckUtils]: 81: Hoare triple {7975#false} assume !!(~c~0 < 6); {7975#false} is VALID [2022-04-15 13:14:52,924 INFO L290 TraceCheckUtils]: 80: Hoare triple {7975#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {7975#false} is VALID [2022-04-15 13:14:52,924 INFO L290 TraceCheckUtils]: 79: Hoare triple {7975#false} assume !!(~c~0 < 6); {7975#false} is VALID [2022-04-15 13:14:52,924 INFO L290 TraceCheckUtils]: 78: Hoare triple {7975#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {7975#false} is VALID [2022-04-15 13:14:52,924 INFO L290 TraceCheckUtils]: 77: Hoare triple {7975#false} assume !!(~c~0 < 6); {7975#false} is VALID [2022-04-15 13:14:52,924 INFO L290 TraceCheckUtils]: 76: Hoare triple {7975#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {7975#false} is VALID [2022-04-15 13:14:52,924 INFO L290 TraceCheckUtils]: 75: Hoare triple {7975#false} assume !!(~c~0 < 6); {7975#false} is VALID [2022-04-15 13:14:52,924 INFO L290 TraceCheckUtils]: 74: Hoare triple {7975#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {7975#false} is VALID [2022-04-15 13:14:52,924 INFO L290 TraceCheckUtils]: 73: Hoare triple {7975#false} assume !!(~c~0 < 6); {7975#false} is VALID [2022-04-15 13:14:52,924 INFO L290 TraceCheckUtils]: 72: Hoare triple {7975#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {7975#false} is VALID [2022-04-15 13:14:52,925 INFO L290 TraceCheckUtils]: 71: Hoare triple {7975#false} assume !!(~c~0 < 6); {7975#false} is VALID [2022-04-15 13:14:52,925 INFO L290 TraceCheckUtils]: 70: Hoare triple {7975#false} assume !!(~b~0 < 6);~c~0 := 0; {7975#false} is VALID [2022-04-15 13:14:52,925 INFO L290 TraceCheckUtils]: 69: Hoare triple {7975#false} assume !!(~a~0 < 6);~b~0 := 0; {7975#false} is VALID [2022-04-15 13:14:52,925 INFO L290 TraceCheckUtils]: 68: Hoare triple {7975#false} #t~pre4 := 1 + ~a~0;~a~0 := 1 + ~a~0;havoc #t~pre4; {7975#false} is VALID [2022-04-15 13:14:52,931 INFO L290 TraceCheckUtils]: 67: Hoare triple {8592#(< main_~b~0 6)} assume !(~b~0 < 6); {7975#false} is VALID [2022-04-15 13:14:52,932 INFO L290 TraceCheckUtils]: 66: Hoare triple {7983#(<= main_~b~0 4)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {8592#(< main_~b~0 6)} is VALID [2022-04-15 13:14:52,932 INFO L290 TraceCheckUtils]: 65: Hoare triple {7983#(<= main_~b~0 4)} assume !(~c~0 < 6); {7983#(<= main_~b~0 4)} is VALID [2022-04-15 13:14:52,932 INFO L290 TraceCheckUtils]: 64: Hoare triple {7983#(<= main_~b~0 4)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {7983#(<= main_~b~0 4)} is VALID [2022-04-15 13:14:52,933 INFO L290 TraceCheckUtils]: 63: Hoare triple {7983#(<= main_~b~0 4)} assume !!(~c~0 < 6); {7983#(<= main_~b~0 4)} is VALID [2022-04-15 13:14:52,933 INFO L290 TraceCheckUtils]: 62: Hoare triple {7983#(<= main_~b~0 4)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {7983#(<= main_~b~0 4)} is VALID [2022-04-15 13:14:52,933 INFO L290 TraceCheckUtils]: 61: Hoare triple {7983#(<= main_~b~0 4)} assume !!(~c~0 < 6); {7983#(<= main_~b~0 4)} is VALID [2022-04-15 13:14:52,934 INFO L290 TraceCheckUtils]: 60: Hoare triple {7983#(<= main_~b~0 4)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {7983#(<= main_~b~0 4)} is VALID [2022-04-15 13:14:52,934 INFO L290 TraceCheckUtils]: 59: Hoare triple {7983#(<= main_~b~0 4)} assume !!(~c~0 < 6); {7983#(<= main_~b~0 4)} is VALID [2022-04-15 13:14:52,934 INFO L290 TraceCheckUtils]: 58: Hoare triple {7983#(<= main_~b~0 4)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {7983#(<= main_~b~0 4)} is VALID [2022-04-15 13:14:52,935 INFO L290 TraceCheckUtils]: 57: Hoare triple {7983#(<= main_~b~0 4)} assume !!(~c~0 < 6); {7983#(<= main_~b~0 4)} is VALID [2022-04-15 13:14:52,935 INFO L290 TraceCheckUtils]: 56: Hoare triple {7983#(<= main_~b~0 4)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {7983#(<= main_~b~0 4)} is VALID [2022-04-15 13:14:52,935 INFO L290 TraceCheckUtils]: 55: Hoare triple {7983#(<= main_~b~0 4)} assume !!(~c~0 < 6); {7983#(<= main_~b~0 4)} is VALID [2022-04-15 13:14:52,936 INFO L290 TraceCheckUtils]: 54: Hoare triple {7983#(<= main_~b~0 4)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {7983#(<= main_~b~0 4)} is VALID [2022-04-15 13:14:52,936 INFO L290 TraceCheckUtils]: 53: Hoare triple {7983#(<= main_~b~0 4)} assume !!(~c~0 < 6); {7983#(<= main_~b~0 4)} is VALID [2022-04-15 13:14:52,936 INFO L290 TraceCheckUtils]: 52: Hoare triple {7983#(<= main_~b~0 4)} assume !!(~b~0 < 6);~c~0 := 0; {7983#(<= main_~b~0 4)} is VALID [2022-04-15 13:14:52,937 INFO L290 TraceCheckUtils]: 51: Hoare triple {7982#(<= main_~b~0 3)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {7983#(<= main_~b~0 4)} is VALID [2022-04-15 13:14:52,937 INFO L290 TraceCheckUtils]: 50: Hoare triple {7982#(<= main_~b~0 3)} assume !(~c~0 < 6); {7982#(<= main_~b~0 3)} is VALID [2022-04-15 13:14:52,937 INFO L290 TraceCheckUtils]: 49: Hoare triple {7982#(<= main_~b~0 3)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {7982#(<= main_~b~0 3)} is VALID [2022-04-15 13:14:52,938 INFO L290 TraceCheckUtils]: 48: Hoare triple {7982#(<= main_~b~0 3)} assume !!(~c~0 < 6); {7982#(<= main_~b~0 3)} is VALID [2022-04-15 13:14:52,938 INFO L290 TraceCheckUtils]: 47: Hoare triple {7982#(<= main_~b~0 3)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {7982#(<= main_~b~0 3)} is VALID [2022-04-15 13:14:52,938 INFO L290 TraceCheckUtils]: 46: Hoare triple {7982#(<= main_~b~0 3)} assume !!(~c~0 < 6); {7982#(<= main_~b~0 3)} is VALID [2022-04-15 13:14:52,939 INFO L290 TraceCheckUtils]: 45: Hoare triple {7982#(<= main_~b~0 3)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {7982#(<= main_~b~0 3)} is VALID [2022-04-15 13:14:52,939 INFO L290 TraceCheckUtils]: 44: Hoare triple {7982#(<= main_~b~0 3)} assume !!(~c~0 < 6); {7982#(<= main_~b~0 3)} is VALID [2022-04-15 13:14:52,939 INFO L290 TraceCheckUtils]: 43: Hoare triple {7982#(<= main_~b~0 3)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {7982#(<= main_~b~0 3)} is VALID [2022-04-15 13:14:52,940 INFO L290 TraceCheckUtils]: 42: Hoare triple {7982#(<= main_~b~0 3)} assume !!(~c~0 < 6); {7982#(<= main_~b~0 3)} is VALID [2022-04-15 13:14:52,940 INFO L290 TraceCheckUtils]: 41: Hoare triple {7982#(<= main_~b~0 3)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {7982#(<= main_~b~0 3)} is VALID [2022-04-15 13:14:52,940 INFO L290 TraceCheckUtils]: 40: Hoare triple {7982#(<= main_~b~0 3)} assume !!(~c~0 < 6); {7982#(<= main_~b~0 3)} is VALID [2022-04-15 13:14:52,941 INFO L290 TraceCheckUtils]: 39: Hoare triple {7982#(<= main_~b~0 3)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {7982#(<= main_~b~0 3)} is VALID [2022-04-15 13:14:52,941 INFO L290 TraceCheckUtils]: 38: Hoare triple {7982#(<= main_~b~0 3)} assume !!(~c~0 < 6); {7982#(<= main_~b~0 3)} is VALID [2022-04-15 13:14:52,941 INFO L290 TraceCheckUtils]: 37: Hoare triple {7982#(<= main_~b~0 3)} assume !!(~b~0 < 6);~c~0 := 0; {7982#(<= main_~b~0 3)} is VALID [2022-04-15 13:14:52,942 INFO L290 TraceCheckUtils]: 36: Hoare triple {7981#(<= main_~b~0 2)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {7982#(<= main_~b~0 3)} is VALID [2022-04-15 13:14:52,942 INFO L290 TraceCheckUtils]: 35: Hoare triple {7981#(<= main_~b~0 2)} assume !(~c~0 < 6); {7981#(<= main_~b~0 2)} is VALID [2022-04-15 13:14:52,942 INFO L290 TraceCheckUtils]: 34: Hoare triple {7981#(<= main_~b~0 2)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {7981#(<= main_~b~0 2)} is VALID [2022-04-15 13:14:52,943 INFO L290 TraceCheckUtils]: 33: Hoare triple {7981#(<= main_~b~0 2)} assume !!(~c~0 < 6); {7981#(<= main_~b~0 2)} is VALID [2022-04-15 13:14:52,943 INFO L290 TraceCheckUtils]: 32: Hoare triple {7981#(<= main_~b~0 2)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {7981#(<= main_~b~0 2)} is VALID [2022-04-15 13:14:52,943 INFO L290 TraceCheckUtils]: 31: Hoare triple {7981#(<= main_~b~0 2)} assume !!(~c~0 < 6); {7981#(<= main_~b~0 2)} is VALID [2022-04-15 13:14:52,943 INFO L290 TraceCheckUtils]: 30: Hoare triple {7981#(<= main_~b~0 2)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {7981#(<= main_~b~0 2)} is VALID [2022-04-15 13:14:52,944 INFO L290 TraceCheckUtils]: 29: Hoare triple {7981#(<= main_~b~0 2)} assume !!(~c~0 < 6); {7981#(<= main_~b~0 2)} is VALID [2022-04-15 13:14:52,944 INFO L290 TraceCheckUtils]: 28: Hoare triple {7981#(<= main_~b~0 2)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {7981#(<= main_~b~0 2)} is VALID [2022-04-15 13:14:52,944 INFO L290 TraceCheckUtils]: 27: Hoare triple {7981#(<= main_~b~0 2)} assume !!(~c~0 < 6); {7981#(<= main_~b~0 2)} is VALID [2022-04-15 13:14:52,945 INFO L290 TraceCheckUtils]: 26: Hoare triple {7981#(<= main_~b~0 2)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {7981#(<= main_~b~0 2)} is VALID [2022-04-15 13:14:52,945 INFO L290 TraceCheckUtils]: 25: Hoare triple {7981#(<= main_~b~0 2)} assume !!(~c~0 < 6); {7981#(<= main_~b~0 2)} is VALID [2022-04-15 13:14:52,945 INFO L290 TraceCheckUtils]: 24: Hoare triple {7981#(<= main_~b~0 2)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {7981#(<= main_~b~0 2)} is VALID [2022-04-15 13:14:52,945 INFO L290 TraceCheckUtils]: 23: Hoare triple {7981#(<= main_~b~0 2)} assume !!(~c~0 < 6); {7981#(<= main_~b~0 2)} is VALID [2022-04-15 13:14:52,946 INFO L290 TraceCheckUtils]: 22: Hoare triple {7981#(<= main_~b~0 2)} assume !!(~b~0 < 6);~c~0 := 0; {7981#(<= main_~b~0 2)} is VALID [2022-04-15 13:14:52,946 INFO L290 TraceCheckUtils]: 21: Hoare triple {7980#(<= main_~b~0 1)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {7981#(<= main_~b~0 2)} is VALID [2022-04-15 13:14:52,946 INFO L290 TraceCheckUtils]: 20: Hoare triple {7980#(<= main_~b~0 1)} assume !(~c~0 < 6); {7980#(<= main_~b~0 1)} is VALID [2022-04-15 13:14:52,947 INFO L290 TraceCheckUtils]: 19: Hoare triple {7980#(<= main_~b~0 1)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {7980#(<= main_~b~0 1)} is VALID [2022-04-15 13:14:52,947 INFO L290 TraceCheckUtils]: 18: Hoare triple {7980#(<= main_~b~0 1)} assume !!(~c~0 < 6); {7980#(<= main_~b~0 1)} is VALID [2022-04-15 13:14:52,947 INFO L290 TraceCheckUtils]: 17: Hoare triple {7980#(<= main_~b~0 1)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {7980#(<= main_~b~0 1)} is VALID [2022-04-15 13:14:52,947 INFO L290 TraceCheckUtils]: 16: Hoare triple {7980#(<= main_~b~0 1)} assume !!(~c~0 < 6); {7980#(<= main_~b~0 1)} is VALID [2022-04-15 13:14:52,948 INFO L290 TraceCheckUtils]: 15: Hoare triple {7980#(<= main_~b~0 1)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {7980#(<= main_~b~0 1)} is VALID [2022-04-15 13:14:52,948 INFO L290 TraceCheckUtils]: 14: Hoare triple {7980#(<= main_~b~0 1)} assume !!(~c~0 < 6); {7980#(<= main_~b~0 1)} is VALID [2022-04-15 13:14:52,948 INFO L290 TraceCheckUtils]: 13: Hoare triple {7980#(<= main_~b~0 1)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {7980#(<= main_~b~0 1)} is VALID [2022-04-15 13:14:52,949 INFO L290 TraceCheckUtils]: 12: Hoare triple {7980#(<= main_~b~0 1)} assume !!(~c~0 < 6); {7980#(<= main_~b~0 1)} is VALID [2022-04-15 13:14:52,949 INFO L290 TraceCheckUtils]: 11: Hoare triple {7980#(<= main_~b~0 1)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {7980#(<= main_~b~0 1)} is VALID [2022-04-15 13:14:52,949 INFO L290 TraceCheckUtils]: 10: Hoare triple {7980#(<= main_~b~0 1)} assume !!(~c~0 < 6); {7980#(<= main_~b~0 1)} is VALID [2022-04-15 13:14:52,949 INFO L290 TraceCheckUtils]: 9: Hoare triple {7980#(<= main_~b~0 1)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {7980#(<= main_~b~0 1)} is VALID [2022-04-15 13:14:52,950 INFO L290 TraceCheckUtils]: 8: Hoare triple {7980#(<= main_~b~0 1)} assume !!(~c~0 < 6); {7980#(<= main_~b~0 1)} is VALID [2022-04-15 13:14:52,950 INFO L290 TraceCheckUtils]: 7: Hoare triple {7980#(<= main_~b~0 1)} assume !!(~b~0 < 6);~c~0 := 0; {7980#(<= main_~b~0 1)} is VALID [2022-04-15 13:14:52,950 INFO L290 TraceCheckUtils]: 6: Hoare triple {7974#true} assume !!(~a~0 < 6);~b~0 := 0; {7980#(<= main_~b~0 1)} is VALID [2022-04-15 13:14:52,950 INFO L290 TraceCheckUtils]: 5: Hoare triple {7974#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~a~0 := 0; {7974#true} is VALID [2022-04-15 13:14:52,950 INFO L272 TraceCheckUtils]: 4: Hoare triple {7974#true} call #t~ret7 := main(); {7974#true} is VALID [2022-04-15 13:14:52,950 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7974#true} {7974#true} #56#return; {7974#true} is VALID [2022-04-15 13:14:52,951 INFO L290 TraceCheckUtils]: 2: Hoare triple {7974#true} assume true; {7974#true} is VALID [2022-04-15 13:14:52,951 INFO L290 TraceCheckUtils]: 1: Hoare triple {7974#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); {7974#true} is VALID [2022-04-15 13:14:52,951 INFO L272 TraceCheckUtils]: 0: Hoare triple {7974#true} call ULTIMATE.init(); {7974#true} is VALID [2022-04-15 13:14:52,952 INFO L134 CoverageAnalysis]: Checked inductivity of 2745 backedges. 1403 proven. 526 refuted. 0 times theorem prover too weak. 816 trivial. 0 not checked. [2022-04-15 13:14:52,952 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [918968209] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 13:14:52,952 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 13:14:52,952 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 10 [2022-04-15 13:14:52,952 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:14:52,952 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1946767606] [2022-04-15 13:14:52,953 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1946767606] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:14:52,953 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:14:52,953 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-15 13:14:52,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2037464838] [2022-04-15 13:14:52,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:14:52,953 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.5) internal successors, (36), 7 states have internal predecessors, (36), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 135 [2022-04-15 13:14:52,953 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:14:52,953 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 4.5) internal successors, (36), 7 states have internal predecessors, (36), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:14:52,976 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:14:52,976 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-15 13:14:52,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:14:52,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-15 13:14:52,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2022-04-15 13:14:52,977 INFO L87 Difference]: Start difference. First operand 136 states and 146 transitions. Second operand has 8 states, 8 states have (on average 4.5) internal successors, (36), 7 states have internal predecessors, (36), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:14:53,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:14:53,400 INFO L93 Difference]: Finished difference Result 262 states and 283 transitions. [2022-04-15 13:14:53,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-15 13:14:53,400 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.5) internal successors, (36), 7 states have internal predecessors, (36), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 135 [2022-04-15 13:14:53,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:14:53,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 4.5) internal successors, (36), 7 states have internal predecessors, (36), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:14:53,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 54 transitions. [2022-04-15 13:14:53,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 4.5) internal successors, (36), 7 states have internal predecessors, (36), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:14:53,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 54 transitions. [2022-04-15 13:14:53,402 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 54 transitions. [2022-04-15 13:14:53,443 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:14:53,447 INFO L225 Difference]: With dead ends: 262 [2022-04-15 13:14:53,447 INFO L226 Difference]: Without dead ends: 194 [2022-04-15 13:14:53,447 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 283 GetRequests, 269 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=84, Invalid=126, Unknown=0, NotChecked=0, Total=210 [2022-04-15 13:14:53,448 INFO L913 BasicCegarLoop]: 15 mSDtfsCounter, 52 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 13:14:53,448 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [52 Valid, 32 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 13:14:53,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2022-04-15 13:14:53,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 166. [2022-04-15 13:14:53,706 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:14:53,707 INFO L82 GeneralOperation]: Start isEquivalent. First operand 194 states. Second operand has 166 states, 162 states have (on average 1.0802469135802468) internal successors, (175), 162 states have internal predecessors, (175), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:14:53,707 INFO L74 IsIncluded]: Start isIncluded. First operand 194 states. Second operand has 166 states, 162 states have (on average 1.0802469135802468) internal successors, (175), 162 states have internal predecessors, (175), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:14:53,707 INFO L87 Difference]: Start difference. First operand 194 states. Second operand has 166 states, 162 states have (on average 1.0802469135802468) internal successors, (175), 162 states have internal predecessors, (175), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:14:53,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:14:53,711 INFO L93 Difference]: Finished difference Result 194 states and 208 transitions. [2022-04-15 13:14:53,711 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 208 transitions. [2022-04-15 13:14:53,712 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:14:53,712 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:14:53,712 INFO L74 IsIncluded]: Start isIncluded. First operand has 166 states, 162 states have (on average 1.0802469135802468) internal successors, (175), 162 states have internal predecessors, (175), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 194 states. [2022-04-15 13:14:53,712 INFO L87 Difference]: Start difference. First operand has 166 states, 162 states have (on average 1.0802469135802468) internal successors, (175), 162 states have internal predecessors, (175), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 194 states. [2022-04-15 13:14:53,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:14:53,716 INFO L93 Difference]: Finished difference Result 194 states and 208 transitions. [2022-04-15 13:14:53,716 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 208 transitions. [2022-04-15 13:14:53,716 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:14:53,716 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:14:53,716 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:14:53,717 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:14:53,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 162 states have (on average 1.0802469135802468) internal successors, (175), 162 states have internal predecessors, (175), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:14:53,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 178 transitions. [2022-04-15 13:14:53,720 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 178 transitions. Word has length 135 [2022-04-15 13:14:53,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:14:53,720 INFO L478 AbstractCegarLoop]: Abstraction has 166 states and 178 transitions. [2022-04-15 13:14:53,720 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.5) internal successors, (36), 7 states have internal predecessors, (36), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:14:53,720 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 166 states and 178 transitions. [2022-04-15 13:14:53,903 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 178 edges. 178 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:14:53,903 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 178 transitions. [2022-04-15 13:14:53,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2022-04-15 13:14:53,905 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:14:53,905 INFO L499 BasicCegarLoop]: trace histogram [60, 60, 10, 10, 10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 13:14:53,926 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2022-04-15 13:14:54,111 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23,SelfDestructingSolverStorable24 [2022-04-15 13:14:54,111 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:14:54,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:14:54,112 INFO L85 PathProgramCache]: Analyzing trace with hash 404361087, now seen corresponding path program 21 times [2022-04-15 13:14:54,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:14:54,112 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [179072489] [2022-04-15 13:14:55,151 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 13:14:55,152 INFO L85 PathProgramCache]: Analyzing trace with hash 1694676879, now seen corresponding path program 1 times [2022-04-15 13:14:55,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:14:55,152 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81542744] [2022-04-15 13:14:55,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:14:55,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:14:55,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 13:14:55,157 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 13:14:55,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 13:14:55,160 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 13:14:55,160 INFO L85 PathProgramCache]: Analyzing trace with hash 404361087, now seen corresponding path program 22 times [2022-04-15 13:14:55,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:14:55,160 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1586878096] [2022-04-15 13:14:55,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:14:55,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:14:55,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:14:55,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 13:14:55,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:14:55,265 INFO L290 TraceCheckUtils]: 0: Hoare triple {10061#(and (= |#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); {10050#true} is VALID [2022-04-15 13:14:55,265 INFO L290 TraceCheckUtils]: 1: Hoare triple {10050#true} assume true; {10050#true} is VALID [2022-04-15 13:14:55,265 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {10050#true} {10050#true} #56#return; {10050#true} is VALID [2022-04-15 13:14:55,266 INFO L272 TraceCheckUtils]: 0: Hoare triple {10050#true} call ULTIMATE.init(); {10061#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 13:14:55,266 INFO L290 TraceCheckUtils]: 1: Hoare triple {10061#(and (= |#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); {10050#true} is VALID [2022-04-15 13:14:55,266 INFO L290 TraceCheckUtils]: 2: Hoare triple {10050#true} assume true; {10050#true} is VALID [2022-04-15 13:14:55,266 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10050#true} {10050#true} #56#return; {10050#true} is VALID [2022-04-15 13:14:55,266 INFO L272 TraceCheckUtils]: 4: Hoare triple {10050#true} call #t~ret7 := main(); {10050#true} is VALID [2022-04-15 13:14:55,266 INFO L290 TraceCheckUtils]: 5: Hoare triple {10050#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~a~0 := 0; {10050#true} is VALID [2022-04-15 13:14:55,266 INFO L290 TraceCheckUtils]: 6: Hoare triple {10050#true} assume !!(~a~0 < 6);~b~0 := 0; {10055#(= main_~b~0 0)} is VALID [2022-04-15 13:14:55,267 INFO L290 TraceCheckUtils]: 7: Hoare triple {10055#(= main_~b~0 0)} assume !!(~b~0 < 6);~c~0 := 0; {10055#(= main_~b~0 0)} is VALID [2022-04-15 13:14:55,267 INFO L290 TraceCheckUtils]: 8: Hoare triple {10055#(= main_~b~0 0)} assume !!(~c~0 < 6); {10055#(= main_~b~0 0)} is VALID [2022-04-15 13:14:55,267 INFO L290 TraceCheckUtils]: 9: Hoare triple {10055#(= main_~b~0 0)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {10055#(= main_~b~0 0)} is VALID [2022-04-15 13:14:55,268 INFO L290 TraceCheckUtils]: 10: Hoare triple {10055#(= main_~b~0 0)} assume !!(~c~0 < 6); {10055#(= main_~b~0 0)} is VALID [2022-04-15 13:14:55,268 INFO L290 TraceCheckUtils]: 11: Hoare triple {10055#(= main_~b~0 0)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {10055#(= main_~b~0 0)} is VALID [2022-04-15 13:14:55,268 INFO L290 TraceCheckUtils]: 12: Hoare triple {10055#(= main_~b~0 0)} assume !!(~c~0 < 6); {10055#(= main_~b~0 0)} is VALID [2022-04-15 13:14:55,269 INFO L290 TraceCheckUtils]: 13: Hoare triple {10055#(= main_~b~0 0)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {10055#(= main_~b~0 0)} is VALID [2022-04-15 13:14:55,269 INFO L290 TraceCheckUtils]: 14: Hoare triple {10055#(= main_~b~0 0)} assume !!(~c~0 < 6); {10055#(= main_~b~0 0)} is VALID [2022-04-15 13:14:55,269 INFO L290 TraceCheckUtils]: 15: Hoare triple {10055#(= main_~b~0 0)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {10055#(= main_~b~0 0)} is VALID [2022-04-15 13:14:55,269 INFO L290 TraceCheckUtils]: 16: Hoare triple {10055#(= main_~b~0 0)} assume !!(~c~0 < 6); {10055#(= main_~b~0 0)} is VALID [2022-04-15 13:14:55,270 INFO L290 TraceCheckUtils]: 17: Hoare triple {10055#(= main_~b~0 0)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {10055#(= main_~b~0 0)} is VALID [2022-04-15 13:14:55,270 INFO L290 TraceCheckUtils]: 18: Hoare triple {10055#(= main_~b~0 0)} assume !!(~c~0 < 6); {10055#(= main_~b~0 0)} is VALID [2022-04-15 13:14:55,270 INFO L290 TraceCheckUtils]: 19: Hoare triple {10055#(= main_~b~0 0)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {10055#(= main_~b~0 0)} is VALID [2022-04-15 13:14:55,271 INFO L290 TraceCheckUtils]: 20: Hoare triple {10055#(= main_~b~0 0)} assume !(~c~0 < 6); {10055#(= main_~b~0 0)} is VALID [2022-04-15 13:14:55,271 INFO L290 TraceCheckUtils]: 21: Hoare triple {10055#(= main_~b~0 0)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {10056#(<= main_~b~0 1)} is VALID [2022-04-15 13:14:55,271 INFO L290 TraceCheckUtils]: 22: Hoare triple {10056#(<= main_~b~0 1)} assume !!(~b~0 < 6);~c~0 := 0; {10056#(<= main_~b~0 1)} is VALID [2022-04-15 13:14:55,272 INFO L290 TraceCheckUtils]: 23: Hoare triple {10056#(<= main_~b~0 1)} assume !!(~c~0 < 6); {10056#(<= main_~b~0 1)} is VALID [2022-04-15 13:14:55,272 INFO L290 TraceCheckUtils]: 24: Hoare triple {10056#(<= main_~b~0 1)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {10056#(<= main_~b~0 1)} is VALID [2022-04-15 13:14:55,272 INFO L290 TraceCheckUtils]: 25: Hoare triple {10056#(<= main_~b~0 1)} assume !!(~c~0 < 6); {10056#(<= main_~b~0 1)} is VALID [2022-04-15 13:14:55,273 INFO L290 TraceCheckUtils]: 26: Hoare triple {10056#(<= main_~b~0 1)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {10056#(<= main_~b~0 1)} is VALID [2022-04-15 13:14:55,273 INFO L290 TraceCheckUtils]: 27: Hoare triple {10056#(<= main_~b~0 1)} assume !!(~c~0 < 6); {10056#(<= main_~b~0 1)} is VALID [2022-04-15 13:14:55,273 INFO L290 TraceCheckUtils]: 28: Hoare triple {10056#(<= main_~b~0 1)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {10056#(<= main_~b~0 1)} is VALID [2022-04-15 13:14:55,274 INFO L290 TraceCheckUtils]: 29: Hoare triple {10056#(<= main_~b~0 1)} assume !!(~c~0 < 6); {10056#(<= main_~b~0 1)} is VALID [2022-04-15 13:14:55,274 INFO L290 TraceCheckUtils]: 30: Hoare triple {10056#(<= main_~b~0 1)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {10056#(<= main_~b~0 1)} is VALID [2022-04-15 13:14:55,274 INFO L290 TraceCheckUtils]: 31: Hoare triple {10056#(<= main_~b~0 1)} assume !!(~c~0 < 6); {10056#(<= main_~b~0 1)} is VALID [2022-04-15 13:14:55,275 INFO L290 TraceCheckUtils]: 32: Hoare triple {10056#(<= main_~b~0 1)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {10056#(<= main_~b~0 1)} is VALID [2022-04-15 13:14:55,275 INFO L290 TraceCheckUtils]: 33: Hoare triple {10056#(<= main_~b~0 1)} assume !!(~c~0 < 6); {10056#(<= main_~b~0 1)} is VALID [2022-04-15 13:14:55,275 INFO L290 TraceCheckUtils]: 34: Hoare triple {10056#(<= main_~b~0 1)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {10056#(<= main_~b~0 1)} is VALID [2022-04-15 13:14:55,276 INFO L290 TraceCheckUtils]: 35: Hoare triple {10056#(<= main_~b~0 1)} assume !(~c~0 < 6); {10056#(<= main_~b~0 1)} is VALID [2022-04-15 13:14:55,276 INFO L290 TraceCheckUtils]: 36: Hoare triple {10056#(<= main_~b~0 1)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {10057#(<= main_~b~0 2)} is VALID [2022-04-15 13:14:55,277 INFO L290 TraceCheckUtils]: 37: Hoare triple {10057#(<= main_~b~0 2)} assume !!(~b~0 < 6);~c~0 := 0; {10057#(<= main_~b~0 2)} is VALID [2022-04-15 13:14:55,277 INFO L290 TraceCheckUtils]: 38: Hoare triple {10057#(<= main_~b~0 2)} assume !!(~c~0 < 6); {10057#(<= main_~b~0 2)} is VALID [2022-04-15 13:14:55,277 INFO L290 TraceCheckUtils]: 39: Hoare triple {10057#(<= main_~b~0 2)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {10057#(<= main_~b~0 2)} is VALID [2022-04-15 13:14:55,278 INFO L290 TraceCheckUtils]: 40: Hoare triple {10057#(<= main_~b~0 2)} assume !!(~c~0 < 6); {10057#(<= main_~b~0 2)} is VALID [2022-04-15 13:14:55,278 INFO L290 TraceCheckUtils]: 41: Hoare triple {10057#(<= main_~b~0 2)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {10057#(<= main_~b~0 2)} is VALID [2022-04-15 13:14:55,278 INFO L290 TraceCheckUtils]: 42: Hoare triple {10057#(<= main_~b~0 2)} assume !!(~c~0 < 6); {10057#(<= main_~b~0 2)} is VALID [2022-04-15 13:14:55,278 INFO L290 TraceCheckUtils]: 43: Hoare triple {10057#(<= main_~b~0 2)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {10057#(<= main_~b~0 2)} is VALID [2022-04-15 13:14:55,279 INFO L290 TraceCheckUtils]: 44: Hoare triple {10057#(<= main_~b~0 2)} assume !!(~c~0 < 6); {10057#(<= main_~b~0 2)} is VALID [2022-04-15 13:14:55,279 INFO L290 TraceCheckUtils]: 45: Hoare triple {10057#(<= main_~b~0 2)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {10057#(<= main_~b~0 2)} is VALID [2022-04-15 13:14:55,279 INFO L290 TraceCheckUtils]: 46: Hoare triple {10057#(<= main_~b~0 2)} assume !!(~c~0 < 6); {10057#(<= main_~b~0 2)} is VALID [2022-04-15 13:14:55,280 INFO L290 TraceCheckUtils]: 47: Hoare triple {10057#(<= main_~b~0 2)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {10057#(<= main_~b~0 2)} is VALID [2022-04-15 13:14:55,280 INFO L290 TraceCheckUtils]: 48: Hoare triple {10057#(<= main_~b~0 2)} assume !!(~c~0 < 6); {10057#(<= main_~b~0 2)} is VALID [2022-04-15 13:14:55,280 INFO L290 TraceCheckUtils]: 49: Hoare triple {10057#(<= main_~b~0 2)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {10057#(<= main_~b~0 2)} is VALID [2022-04-15 13:14:55,281 INFO L290 TraceCheckUtils]: 50: Hoare triple {10057#(<= main_~b~0 2)} assume !(~c~0 < 6); {10057#(<= main_~b~0 2)} is VALID [2022-04-15 13:14:55,281 INFO L290 TraceCheckUtils]: 51: Hoare triple {10057#(<= main_~b~0 2)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {10058#(<= main_~b~0 3)} is VALID [2022-04-15 13:14:55,281 INFO L290 TraceCheckUtils]: 52: Hoare triple {10058#(<= main_~b~0 3)} assume !!(~b~0 < 6);~c~0 := 0; {10058#(<= main_~b~0 3)} is VALID [2022-04-15 13:14:55,282 INFO L290 TraceCheckUtils]: 53: Hoare triple {10058#(<= main_~b~0 3)} assume !!(~c~0 < 6); {10058#(<= main_~b~0 3)} is VALID [2022-04-15 13:14:55,282 INFO L290 TraceCheckUtils]: 54: Hoare triple {10058#(<= main_~b~0 3)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {10058#(<= main_~b~0 3)} is VALID [2022-04-15 13:14:55,282 INFO L290 TraceCheckUtils]: 55: Hoare triple {10058#(<= main_~b~0 3)} assume !!(~c~0 < 6); {10058#(<= main_~b~0 3)} is VALID [2022-04-15 13:14:55,283 INFO L290 TraceCheckUtils]: 56: Hoare triple {10058#(<= main_~b~0 3)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {10058#(<= main_~b~0 3)} is VALID [2022-04-15 13:14:55,283 INFO L290 TraceCheckUtils]: 57: Hoare triple {10058#(<= main_~b~0 3)} assume !!(~c~0 < 6); {10058#(<= main_~b~0 3)} is VALID [2022-04-15 13:14:55,283 INFO L290 TraceCheckUtils]: 58: Hoare triple {10058#(<= main_~b~0 3)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {10058#(<= main_~b~0 3)} is VALID [2022-04-15 13:14:55,284 INFO L290 TraceCheckUtils]: 59: Hoare triple {10058#(<= main_~b~0 3)} assume !!(~c~0 < 6); {10058#(<= main_~b~0 3)} is VALID [2022-04-15 13:14:55,284 INFO L290 TraceCheckUtils]: 60: Hoare triple {10058#(<= main_~b~0 3)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {10058#(<= main_~b~0 3)} is VALID [2022-04-15 13:14:55,284 INFO L290 TraceCheckUtils]: 61: Hoare triple {10058#(<= main_~b~0 3)} assume !!(~c~0 < 6); {10058#(<= main_~b~0 3)} is VALID [2022-04-15 13:14:55,285 INFO L290 TraceCheckUtils]: 62: Hoare triple {10058#(<= main_~b~0 3)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {10058#(<= main_~b~0 3)} is VALID [2022-04-15 13:14:55,285 INFO L290 TraceCheckUtils]: 63: Hoare triple {10058#(<= main_~b~0 3)} assume !!(~c~0 < 6); {10058#(<= main_~b~0 3)} is VALID [2022-04-15 13:14:55,285 INFO L290 TraceCheckUtils]: 64: Hoare triple {10058#(<= main_~b~0 3)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {10058#(<= main_~b~0 3)} is VALID [2022-04-15 13:14:55,285 INFO L290 TraceCheckUtils]: 65: Hoare triple {10058#(<= main_~b~0 3)} assume !(~c~0 < 6); {10058#(<= main_~b~0 3)} is VALID [2022-04-15 13:14:55,286 INFO L290 TraceCheckUtils]: 66: Hoare triple {10058#(<= main_~b~0 3)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {10059#(<= main_~b~0 4)} is VALID [2022-04-15 13:14:55,286 INFO L290 TraceCheckUtils]: 67: Hoare triple {10059#(<= main_~b~0 4)} assume !!(~b~0 < 6);~c~0 := 0; {10059#(<= main_~b~0 4)} is VALID [2022-04-15 13:14:55,287 INFO L290 TraceCheckUtils]: 68: Hoare triple {10059#(<= main_~b~0 4)} assume !!(~c~0 < 6); {10059#(<= main_~b~0 4)} is VALID [2022-04-15 13:14:55,287 INFO L290 TraceCheckUtils]: 69: Hoare triple {10059#(<= main_~b~0 4)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {10059#(<= main_~b~0 4)} is VALID [2022-04-15 13:14:55,287 INFO L290 TraceCheckUtils]: 70: Hoare triple {10059#(<= main_~b~0 4)} assume !!(~c~0 < 6); {10059#(<= main_~b~0 4)} is VALID [2022-04-15 13:14:55,287 INFO L290 TraceCheckUtils]: 71: Hoare triple {10059#(<= main_~b~0 4)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {10059#(<= main_~b~0 4)} is VALID [2022-04-15 13:14:55,288 INFO L290 TraceCheckUtils]: 72: Hoare triple {10059#(<= main_~b~0 4)} assume !!(~c~0 < 6); {10059#(<= main_~b~0 4)} is VALID [2022-04-15 13:14:55,288 INFO L290 TraceCheckUtils]: 73: Hoare triple {10059#(<= main_~b~0 4)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {10059#(<= main_~b~0 4)} is VALID [2022-04-15 13:14:55,288 INFO L290 TraceCheckUtils]: 74: Hoare triple {10059#(<= main_~b~0 4)} assume !!(~c~0 < 6); {10059#(<= main_~b~0 4)} is VALID [2022-04-15 13:14:55,289 INFO L290 TraceCheckUtils]: 75: Hoare triple {10059#(<= main_~b~0 4)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {10059#(<= main_~b~0 4)} is VALID [2022-04-15 13:14:55,289 INFO L290 TraceCheckUtils]: 76: Hoare triple {10059#(<= main_~b~0 4)} assume !!(~c~0 < 6); {10059#(<= main_~b~0 4)} is VALID [2022-04-15 13:14:55,289 INFO L290 TraceCheckUtils]: 77: Hoare triple {10059#(<= main_~b~0 4)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {10059#(<= main_~b~0 4)} is VALID [2022-04-15 13:14:55,290 INFO L290 TraceCheckUtils]: 78: Hoare triple {10059#(<= main_~b~0 4)} assume !!(~c~0 < 6); {10059#(<= main_~b~0 4)} is VALID [2022-04-15 13:14:55,290 INFO L290 TraceCheckUtils]: 79: Hoare triple {10059#(<= main_~b~0 4)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {10059#(<= main_~b~0 4)} is VALID [2022-04-15 13:14:55,290 INFO L290 TraceCheckUtils]: 80: Hoare triple {10059#(<= main_~b~0 4)} assume !(~c~0 < 6); {10059#(<= main_~b~0 4)} is VALID [2022-04-15 13:14:55,291 INFO L290 TraceCheckUtils]: 81: Hoare triple {10059#(<= main_~b~0 4)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {10060#(<= main_~b~0 5)} is VALID [2022-04-15 13:14:55,291 INFO L290 TraceCheckUtils]: 82: Hoare triple {10060#(<= main_~b~0 5)} assume !(~b~0 < 6); {10051#false} is VALID [2022-04-15 13:14:55,291 INFO L290 TraceCheckUtils]: 83: Hoare triple {10051#false} #t~pre4 := 1 + ~a~0;~a~0 := 1 + ~a~0;havoc #t~pre4; {10051#false} is VALID [2022-04-15 13:14:55,291 INFO L290 TraceCheckUtils]: 84: Hoare triple {10051#false} assume !!(~a~0 < 6);~b~0 := 0; {10051#false} is VALID [2022-04-15 13:14:55,291 INFO L290 TraceCheckUtils]: 85: Hoare triple {10051#false} assume !!(~b~0 < 6);~c~0 := 0; {10051#false} is VALID [2022-04-15 13:14:55,292 INFO L290 TraceCheckUtils]: 86: Hoare triple {10051#false} assume !!(~c~0 < 6); {10051#false} is VALID [2022-04-15 13:14:55,292 INFO L290 TraceCheckUtils]: 87: Hoare triple {10051#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {10051#false} is VALID [2022-04-15 13:14:55,292 INFO L290 TraceCheckUtils]: 88: Hoare triple {10051#false} assume !!(~c~0 < 6); {10051#false} is VALID [2022-04-15 13:14:55,292 INFO L290 TraceCheckUtils]: 89: Hoare triple {10051#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {10051#false} is VALID [2022-04-15 13:14:55,292 INFO L290 TraceCheckUtils]: 90: Hoare triple {10051#false} assume !!(~c~0 < 6); {10051#false} is VALID [2022-04-15 13:14:55,292 INFO L290 TraceCheckUtils]: 91: Hoare triple {10051#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {10051#false} is VALID [2022-04-15 13:14:55,292 INFO L290 TraceCheckUtils]: 92: Hoare triple {10051#false} assume !!(~c~0 < 6); {10051#false} is VALID [2022-04-15 13:14:55,292 INFO L290 TraceCheckUtils]: 93: Hoare triple {10051#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {10051#false} is VALID [2022-04-15 13:14:55,292 INFO L290 TraceCheckUtils]: 94: Hoare triple {10051#false} assume !!(~c~0 < 6); {10051#false} is VALID [2022-04-15 13:14:55,292 INFO L290 TraceCheckUtils]: 95: Hoare triple {10051#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {10051#false} is VALID [2022-04-15 13:14:55,292 INFO L290 TraceCheckUtils]: 96: Hoare triple {10051#false} assume !!(~c~0 < 6); {10051#false} is VALID [2022-04-15 13:14:55,293 INFO L290 TraceCheckUtils]: 97: Hoare triple {10051#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {10051#false} is VALID [2022-04-15 13:14:55,293 INFO L290 TraceCheckUtils]: 98: Hoare triple {10051#false} assume !(~c~0 < 6); {10051#false} is VALID [2022-04-15 13:14:55,293 INFO L290 TraceCheckUtils]: 99: Hoare triple {10051#false} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {10051#false} is VALID [2022-04-15 13:14:55,293 INFO L290 TraceCheckUtils]: 100: Hoare triple {10051#false} assume !!(~b~0 < 6);~c~0 := 0; {10051#false} is VALID [2022-04-15 13:14:55,293 INFO L290 TraceCheckUtils]: 101: Hoare triple {10051#false} assume !!(~c~0 < 6); {10051#false} is VALID [2022-04-15 13:14:55,293 INFO L290 TraceCheckUtils]: 102: Hoare triple {10051#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {10051#false} is VALID [2022-04-15 13:14:55,293 INFO L290 TraceCheckUtils]: 103: Hoare triple {10051#false} assume !!(~c~0 < 6); {10051#false} is VALID [2022-04-15 13:14:55,293 INFO L290 TraceCheckUtils]: 104: Hoare triple {10051#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {10051#false} is VALID [2022-04-15 13:14:55,293 INFO L290 TraceCheckUtils]: 105: Hoare triple {10051#false} assume !!(~c~0 < 6); {10051#false} is VALID [2022-04-15 13:14:55,293 INFO L290 TraceCheckUtils]: 106: Hoare triple {10051#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {10051#false} is VALID [2022-04-15 13:14:55,293 INFO L290 TraceCheckUtils]: 107: Hoare triple {10051#false} assume !!(~c~0 < 6); {10051#false} is VALID [2022-04-15 13:14:55,294 INFO L290 TraceCheckUtils]: 108: Hoare triple {10051#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {10051#false} is VALID [2022-04-15 13:14:55,294 INFO L290 TraceCheckUtils]: 109: Hoare triple {10051#false} assume !!(~c~0 < 6); {10051#false} is VALID [2022-04-15 13:14:55,294 INFO L290 TraceCheckUtils]: 110: Hoare triple {10051#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {10051#false} is VALID [2022-04-15 13:14:55,294 INFO L290 TraceCheckUtils]: 111: Hoare triple {10051#false} assume !!(~c~0 < 6); {10051#false} is VALID [2022-04-15 13:14:55,294 INFO L290 TraceCheckUtils]: 112: Hoare triple {10051#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {10051#false} is VALID [2022-04-15 13:14:55,294 INFO L290 TraceCheckUtils]: 113: Hoare triple {10051#false} assume !(~c~0 < 6); {10051#false} is VALID [2022-04-15 13:14:55,294 INFO L290 TraceCheckUtils]: 114: Hoare triple {10051#false} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {10051#false} is VALID [2022-04-15 13:14:55,294 INFO L290 TraceCheckUtils]: 115: Hoare triple {10051#false} assume !!(~b~0 < 6);~c~0 := 0; {10051#false} is VALID [2022-04-15 13:14:55,294 INFO L290 TraceCheckUtils]: 116: Hoare triple {10051#false} assume !!(~c~0 < 6); {10051#false} is VALID [2022-04-15 13:14:55,294 INFO L290 TraceCheckUtils]: 117: Hoare triple {10051#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {10051#false} is VALID [2022-04-15 13:14:55,295 INFO L290 TraceCheckUtils]: 118: Hoare triple {10051#false} assume !!(~c~0 < 6); {10051#false} is VALID [2022-04-15 13:14:55,295 INFO L290 TraceCheckUtils]: 119: Hoare triple {10051#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {10051#false} is VALID [2022-04-15 13:14:55,295 INFO L290 TraceCheckUtils]: 120: Hoare triple {10051#false} assume !!(~c~0 < 6); {10051#false} is VALID [2022-04-15 13:14:55,295 INFO L290 TraceCheckUtils]: 121: Hoare triple {10051#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {10051#false} is VALID [2022-04-15 13:14:55,295 INFO L290 TraceCheckUtils]: 122: Hoare triple {10051#false} assume !!(~c~0 < 6); {10051#false} is VALID [2022-04-15 13:14:55,295 INFO L290 TraceCheckUtils]: 123: Hoare triple {10051#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {10051#false} is VALID [2022-04-15 13:14:55,295 INFO L290 TraceCheckUtils]: 124: Hoare triple {10051#false} assume !!(~c~0 < 6); {10051#false} is VALID [2022-04-15 13:14:55,295 INFO L290 TraceCheckUtils]: 125: Hoare triple {10051#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {10051#false} is VALID [2022-04-15 13:14:55,295 INFO L290 TraceCheckUtils]: 126: Hoare triple {10051#false} assume !!(~c~0 < 6); {10051#false} is VALID [2022-04-15 13:14:55,295 INFO L290 TraceCheckUtils]: 127: Hoare triple {10051#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {10051#false} is VALID [2022-04-15 13:14:55,295 INFO L290 TraceCheckUtils]: 128: Hoare triple {10051#false} assume !(~c~0 < 6); {10051#false} is VALID [2022-04-15 13:14:55,296 INFO L290 TraceCheckUtils]: 129: Hoare triple {10051#false} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {10051#false} is VALID [2022-04-15 13:14:55,296 INFO L290 TraceCheckUtils]: 130: Hoare triple {10051#false} assume !!(~b~0 < 6);~c~0 := 0; {10051#false} is VALID [2022-04-15 13:14:55,296 INFO L290 TraceCheckUtils]: 131: Hoare triple {10051#false} assume !!(~c~0 < 6); {10051#false} is VALID [2022-04-15 13:14:55,296 INFO L290 TraceCheckUtils]: 132: Hoare triple {10051#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {10051#false} is VALID [2022-04-15 13:14:55,296 INFO L290 TraceCheckUtils]: 133: Hoare triple {10051#false} assume !!(~c~0 < 6); {10051#false} is VALID [2022-04-15 13:14:55,296 INFO L290 TraceCheckUtils]: 134: Hoare triple {10051#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {10051#false} is VALID [2022-04-15 13:14:55,296 INFO L290 TraceCheckUtils]: 135: Hoare triple {10051#false} assume !!(~c~0 < 6); {10051#false} is VALID [2022-04-15 13:14:55,296 INFO L290 TraceCheckUtils]: 136: Hoare triple {10051#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {10051#false} is VALID [2022-04-15 13:14:55,296 INFO L290 TraceCheckUtils]: 137: Hoare triple {10051#false} assume !!(~c~0 < 6); {10051#false} is VALID [2022-04-15 13:14:55,296 INFO L290 TraceCheckUtils]: 138: Hoare triple {10051#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {10051#false} is VALID [2022-04-15 13:14:55,297 INFO L290 TraceCheckUtils]: 139: Hoare triple {10051#false} assume !!(~c~0 < 6); {10051#false} is VALID [2022-04-15 13:14:55,297 INFO L290 TraceCheckUtils]: 140: Hoare triple {10051#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {10051#false} is VALID [2022-04-15 13:14:55,297 INFO L290 TraceCheckUtils]: 141: Hoare triple {10051#false} assume !!(~c~0 < 6); {10051#false} is VALID [2022-04-15 13:14:55,297 INFO L290 TraceCheckUtils]: 142: Hoare triple {10051#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {10051#false} is VALID [2022-04-15 13:14:55,297 INFO L290 TraceCheckUtils]: 143: Hoare triple {10051#false} assume !(~c~0 < 6); {10051#false} is VALID [2022-04-15 13:14:55,297 INFO L290 TraceCheckUtils]: 144: Hoare triple {10051#false} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {10051#false} is VALID [2022-04-15 13:14:55,297 INFO L290 TraceCheckUtils]: 145: Hoare triple {10051#false} assume !!(~b~0 < 6);~c~0 := 0; {10051#false} is VALID [2022-04-15 13:14:55,297 INFO L290 TraceCheckUtils]: 146: Hoare triple {10051#false} assume !!(~c~0 < 6); {10051#false} is VALID [2022-04-15 13:14:55,297 INFO L290 TraceCheckUtils]: 147: Hoare triple {10051#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {10051#false} is VALID [2022-04-15 13:14:55,297 INFO L290 TraceCheckUtils]: 148: Hoare triple {10051#false} assume !!(~c~0 < 6); {10051#false} is VALID [2022-04-15 13:14:55,298 INFO L290 TraceCheckUtils]: 149: Hoare triple {10051#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {10051#false} is VALID [2022-04-15 13:14:55,298 INFO L290 TraceCheckUtils]: 150: Hoare triple {10051#false} assume !!(~c~0 < 6); {10051#false} is VALID [2022-04-15 13:14:55,298 INFO L290 TraceCheckUtils]: 151: Hoare triple {10051#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {10051#false} is VALID [2022-04-15 13:14:55,298 INFO L290 TraceCheckUtils]: 152: Hoare triple {10051#false} assume !!(~c~0 < 6); {10051#false} is VALID [2022-04-15 13:14:55,298 INFO L290 TraceCheckUtils]: 153: Hoare triple {10051#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {10051#false} is VALID [2022-04-15 13:14:55,298 INFO L290 TraceCheckUtils]: 154: Hoare triple {10051#false} assume !!(~c~0 < 6); {10051#false} is VALID [2022-04-15 13:14:55,298 INFO L290 TraceCheckUtils]: 155: Hoare triple {10051#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {10051#false} is VALID [2022-04-15 13:14:55,298 INFO L290 TraceCheckUtils]: 156: Hoare triple {10051#false} assume !!(~c~0 < 6); {10051#false} is VALID [2022-04-15 13:14:55,298 INFO L290 TraceCheckUtils]: 157: Hoare triple {10051#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {10051#false} is VALID [2022-04-15 13:14:55,298 INFO L290 TraceCheckUtils]: 158: Hoare triple {10051#false} assume !(~c~0 < 6); {10051#false} is VALID [2022-04-15 13:14:55,298 INFO L290 TraceCheckUtils]: 159: Hoare triple {10051#false} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {10051#false} is VALID [2022-04-15 13:14:55,299 INFO L290 TraceCheckUtils]: 160: Hoare triple {10051#false} assume !(~b~0 < 6); {10051#false} is VALID [2022-04-15 13:14:55,299 INFO L290 TraceCheckUtils]: 161: Hoare triple {10051#false} #t~pre4 := 1 + ~a~0;~a~0 := 1 + ~a~0;havoc #t~pre4; {10051#false} is VALID [2022-04-15 13:14:55,299 INFO L290 TraceCheckUtils]: 162: Hoare triple {10051#false} assume !(~a~0 < 6); {10051#false} is VALID [2022-04-15 13:14:55,299 INFO L290 TraceCheckUtils]: 163: Hoare triple {10051#false} assume !((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0); {10051#false} is VALID [2022-04-15 13:14:55,299 INFO L290 TraceCheckUtils]: 164: Hoare triple {10051#false} assume !false; {10051#false} is VALID [2022-04-15 13:14:55,301 INFO L134 CoverageAnalysis]: Checked inductivity of 4300 backedges. 2188 proven. 875 refuted. 0 times theorem prover too weak. 1237 trivial. 0 not checked. [2022-04-15 13:14:55,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:14:55,301 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1586878096] [2022-04-15 13:14:55,301 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1586878096] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 13:14:55,301 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2010833641] [2022-04-15 13:14:55,301 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 13:14:55,302 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 13:14:55,302 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 13:14:55,303 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 13:14:55,327 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-04-15 13:14:55,388 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 13:14:55,388 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 13:14:55,389 INFO L263 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-15 13:14:55,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:14:55,411 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 13:14:55,853 INFO L272 TraceCheckUtils]: 0: Hoare triple {10050#true} call ULTIMATE.init(); {10050#true} is VALID [2022-04-15 13:14:55,853 INFO L290 TraceCheckUtils]: 1: Hoare triple {10050#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); {10050#true} is VALID [2022-04-15 13:14:55,853 INFO L290 TraceCheckUtils]: 2: Hoare triple {10050#true} assume true; {10050#true} is VALID [2022-04-15 13:14:55,853 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10050#true} {10050#true} #56#return; {10050#true} is VALID [2022-04-15 13:14:55,854 INFO L272 TraceCheckUtils]: 4: Hoare triple {10050#true} call #t~ret7 := main(); {10050#true} is VALID [2022-04-15 13:14:55,854 INFO L290 TraceCheckUtils]: 5: Hoare triple {10050#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~a~0 := 0; {10050#true} is VALID [2022-04-15 13:14:55,854 INFO L290 TraceCheckUtils]: 6: Hoare triple {10050#true} assume !!(~a~0 < 6);~b~0 := 0; {10083#(<= main_~b~0 0)} is VALID [2022-04-15 13:14:55,854 INFO L290 TraceCheckUtils]: 7: Hoare triple {10083#(<= main_~b~0 0)} assume !!(~b~0 < 6);~c~0 := 0; {10083#(<= main_~b~0 0)} is VALID [2022-04-15 13:14:55,855 INFO L290 TraceCheckUtils]: 8: Hoare triple {10083#(<= main_~b~0 0)} assume !!(~c~0 < 6); {10083#(<= main_~b~0 0)} is VALID [2022-04-15 13:14:55,855 INFO L290 TraceCheckUtils]: 9: Hoare triple {10083#(<= main_~b~0 0)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {10083#(<= main_~b~0 0)} is VALID [2022-04-15 13:14:55,856 INFO L290 TraceCheckUtils]: 10: Hoare triple {10083#(<= main_~b~0 0)} assume !!(~c~0 < 6); {10083#(<= main_~b~0 0)} is VALID [2022-04-15 13:14:55,856 INFO L290 TraceCheckUtils]: 11: Hoare triple {10083#(<= main_~b~0 0)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {10083#(<= main_~b~0 0)} is VALID [2022-04-15 13:14:55,856 INFO L290 TraceCheckUtils]: 12: Hoare triple {10083#(<= main_~b~0 0)} assume !!(~c~0 < 6); {10083#(<= main_~b~0 0)} is VALID [2022-04-15 13:14:55,857 INFO L290 TraceCheckUtils]: 13: Hoare triple {10083#(<= main_~b~0 0)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {10083#(<= main_~b~0 0)} is VALID [2022-04-15 13:14:55,857 INFO L290 TraceCheckUtils]: 14: Hoare triple {10083#(<= main_~b~0 0)} assume !!(~c~0 < 6); {10083#(<= main_~b~0 0)} is VALID [2022-04-15 13:14:55,857 INFO L290 TraceCheckUtils]: 15: Hoare triple {10083#(<= main_~b~0 0)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {10083#(<= main_~b~0 0)} is VALID [2022-04-15 13:14:55,858 INFO L290 TraceCheckUtils]: 16: Hoare triple {10083#(<= main_~b~0 0)} assume !!(~c~0 < 6); {10083#(<= main_~b~0 0)} is VALID [2022-04-15 13:14:55,858 INFO L290 TraceCheckUtils]: 17: Hoare triple {10083#(<= main_~b~0 0)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {10083#(<= main_~b~0 0)} is VALID [2022-04-15 13:14:55,858 INFO L290 TraceCheckUtils]: 18: Hoare triple {10083#(<= main_~b~0 0)} assume !!(~c~0 < 6); {10083#(<= main_~b~0 0)} is VALID [2022-04-15 13:14:55,858 INFO L290 TraceCheckUtils]: 19: Hoare triple {10083#(<= main_~b~0 0)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {10083#(<= main_~b~0 0)} is VALID [2022-04-15 13:14:55,859 INFO L290 TraceCheckUtils]: 20: Hoare triple {10083#(<= main_~b~0 0)} assume !(~c~0 < 6); {10083#(<= main_~b~0 0)} is VALID [2022-04-15 13:14:55,860 INFO L290 TraceCheckUtils]: 21: Hoare triple {10083#(<= main_~b~0 0)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {10056#(<= main_~b~0 1)} is VALID [2022-04-15 13:14:55,860 INFO L290 TraceCheckUtils]: 22: Hoare triple {10056#(<= main_~b~0 1)} assume !!(~b~0 < 6);~c~0 := 0; {10056#(<= main_~b~0 1)} is VALID [2022-04-15 13:14:55,860 INFO L290 TraceCheckUtils]: 23: Hoare triple {10056#(<= main_~b~0 1)} assume !!(~c~0 < 6); {10056#(<= main_~b~0 1)} is VALID [2022-04-15 13:14:55,861 INFO L290 TraceCheckUtils]: 24: Hoare triple {10056#(<= main_~b~0 1)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {10056#(<= main_~b~0 1)} is VALID [2022-04-15 13:14:55,861 INFO L290 TraceCheckUtils]: 25: Hoare triple {10056#(<= main_~b~0 1)} assume !!(~c~0 < 6); {10056#(<= main_~b~0 1)} is VALID [2022-04-15 13:14:55,861 INFO L290 TraceCheckUtils]: 26: Hoare triple {10056#(<= main_~b~0 1)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {10056#(<= main_~b~0 1)} is VALID [2022-04-15 13:14:55,862 INFO L290 TraceCheckUtils]: 27: Hoare triple {10056#(<= main_~b~0 1)} assume !!(~c~0 < 6); {10056#(<= main_~b~0 1)} is VALID [2022-04-15 13:14:55,862 INFO L290 TraceCheckUtils]: 28: Hoare triple {10056#(<= main_~b~0 1)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {10056#(<= main_~b~0 1)} is VALID [2022-04-15 13:14:55,862 INFO L290 TraceCheckUtils]: 29: Hoare triple {10056#(<= main_~b~0 1)} assume !!(~c~0 < 6); {10056#(<= main_~b~0 1)} is VALID [2022-04-15 13:14:55,863 INFO L290 TraceCheckUtils]: 30: Hoare triple {10056#(<= main_~b~0 1)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {10056#(<= main_~b~0 1)} is VALID [2022-04-15 13:14:55,863 INFO L290 TraceCheckUtils]: 31: Hoare triple {10056#(<= main_~b~0 1)} assume !!(~c~0 < 6); {10056#(<= main_~b~0 1)} is VALID [2022-04-15 13:14:55,863 INFO L290 TraceCheckUtils]: 32: Hoare triple {10056#(<= main_~b~0 1)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {10056#(<= main_~b~0 1)} is VALID [2022-04-15 13:14:55,863 INFO L290 TraceCheckUtils]: 33: Hoare triple {10056#(<= main_~b~0 1)} assume !!(~c~0 < 6); {10056#(<= main_~b~0 1)} is VALID [2022-04-15 13:14:55,864 INFO L290 TraceCheckUtils]: 34: Hoare triple {10056#(<= main_~b~0 1)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {10056#(<= main_~b~0 1)} is VALID [2022-04-15 13:14:55,864 INFO L290 TraceCheckUtils]: 35: Hoare triple {10056#(<= main_~b~0 1)} assume !(~c~0 < 6); {10056#(<= main_~b~0 1)} is VALID [2022-04-15 13:14:55,865 INFO L290 TraceCheckUtils]: 36: Hoare triple {10056#(<= main_~b~0 1)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {10057#(<= main_~b~0 2)} is VALID [2022-04-15 13:14:55,865 INFO L290 TraceCheckUtils]: 37: Hoare triple {10057#(<= main_~b~0 2)} assume !!(~b~0 < 6);~c~0 := 0; {10057#(<= main_~b~0 2)} is VALID [2022-04-15 13:14:55,865 INFO L290 TraceCheckUtils]: 38: Hoare triple {10057#(<= main_~b~0 2)} assume !!(~c~0 < 6); {10057#(<= main_~b~0 2)} is VALID [2022-04-15 13:14:55,866 INFO L290 TraceCheckUtils]: 39: Hoare triple {10057#(<= main_~b~0 2)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {10057#(<= main_~b~0 2)} is VALID [2022-04-15 13:14:55,866 INFO L290 TraceCheckUtils]: 40: Hoare triple {10057#(<= main_~b~0 2)} assume !!(~c~0 < 6); {10057#(<= main_~b~0 2)} is VALID [2022-04-15 13:14:55,866 INFO L290 TraceCheckUtils]: 41: Hoare triple {10057#(<= main_~b~0 2)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {10057#(<= main_~b~0 2)} is VALID [2022-04-15 13:14:55,867 INFO L290 TraceCheckUtils]: 42: Hoare triple {10057#(<= main_~b~0 2)} assume !!(~c~0 < 6); {10057#(<= main_~b~0 2)} is VALID [2022-04-15 13:14:55,867 INFO L290 TraceCheckUtils]: 43: Hoare triple {10057#(<= main_~b~0 2)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {10057#(<= main_~b~0 2)} is VALID [2022-04-15 13:14:55,867 INFO L290 TraceCheckUtils]: 44: Hoare triple {10057#(<= main_~b~0 2)} assume !!(~c~0 < 6); {10057#(<= main_~b~0 2)} is VALID [2022-04-15 13:14:55,868 INFO L290 TraceCheckUtils]: 45: Hoare triple {10057#(<= main_~b~0 2)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {10057#(<= main_~b~0 2)} is VALID [2022-04-15 13:14:55,868 INFO L290 TraceCheckUtils]: 46: Hoare triple {10057#(<= main_~b~0 2)} assume !!(~c~0 < 6); {10057#(<= main_~b~0 2)} is VALID [2022-04-15 13:14:55,868 INFO L290 TraceCheckUtils]: 47: Hoare triple {10057#(<= main_~b~0 2)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {10057#(<= main_~b~0 2)} is VALID [2022-04-15 13:14:55,869 INFO L290 TraceCheckUtils]: 48: Hoare triple {10057#(<= main_~b~0 2)} assume !!(~c~0 < 6); {10057#(<= main_~b~0 2)} is VALID [2022-04-15 13:14:55,869 INFO L290 TraceCheckUtils]: 49: Hoare triple {10057#(<= main_~b~0 2)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {10057#(<= main_~b~0 2)} is VALID [2022-04-15 13:14:55,869 INFO L290 TraceCheckUtils]: 50: Hoare triple {10057#(<= main_~b~0 2)} assume !(~c~0 < 6); {10057#(<= main_~b~0 2)} is VALID [2022-04-15 13:14:55,870 INFO L290 TraceCheckUtils]: 51: Hoare triple {10057#(<= main_~b~0 2)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {10058#(<= main_~b~0 3)} is VALID [2022-04-15 13:14:55,870 INFO L290 TraceCheckUtils]: 52: Hoare triple {10058#(<= main_~b~0 3)} assume !!(~b~0 < 6);~c~0 := 0; {10058#(<= main_~b~0 3)} is VALID [2022-04-15 13:14:55,870 INFO L290 TraceCheckUtils]: 53: Hoare triple {10058#(<= main_~b~0 3)} assume !!(~c~0 < 6); {10058#(<= main_~b~0 3)} is VALID [2022-04-15 13:14:55,871 INFO L290 TraceCheckUtils]: 54: Hoare triple {10058#(<= main_~b~0 3)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {10058#(<= main_~b~0 3)} is VALID [2022-04-15 13:14:55,871 INFO L290 TraceCheckUtils]: 55: Hoare triple {10058#(<= main_~b~0 3)} assume !!(~c~0 < 6); {10058#(<= main_~b~0 3)} is VALID [2022-04-15 13:14:55,871 INFO L290 TraceCheckUtils]: 56: Hoare triple {10058#(<= main_~b~0 3)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {10058#(<= main_~b~0 3)} is VALID [2022-04-15 13:14:55,872 INFO L290 TraceCheckUtils]: 57: Hoare triple {10058#(<= main_~b~0 3)} assume !!(~c~0 < 6); {10058#(<= main_~b~0 3)} is VALID [2022-04-15 13:14:55,872 INFO L290 TraceCheckUtils]: 58: Hoare triple {10058#(<= main_~b~0 3)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {10058#(<= main_~b~0 3)} is VALID [2022-04-15 13:14:55,872 INFO L290 TraceCheckUtils]: 59: Hoare triple {10058#(<= main_~b~0 3)} assume !!(~c~0 < 6); {10058#(<= main_~b~0 3)} is VALID [2022-04-15 13:14:55,872 INFO L290 TraceCheckUtils]: 60: Hoare triple {10058#(<= main_~b~0 3)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {10058#(<= main_~b~0 3)} is VALID [2022-04-15 13:14:55,873 INFO L290 TraceCheckUtils]: 61: Hoare triple {10058#(<= main_~b~0 3)} assume !!(~c~0 < 6); {10058#(<= main_~b~0 3)} is VALID [2022-04-15 13:14:55,873 INFO L290 TraceCheckUtils]: 62: Hoare triple {10058#(<= main_~b~0 3)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {10058#(<= main_~b~0 3)} is VALID [2022-04-15 13:14:55,873 INFO L290 TraceCheckUtils]: 63: Hoare triple {10058#(<= main_~b~0 3)} assume !!(~c~0 < 6); {10058#(<= main_~b~0 3)} is VALID [2022-04-15 13:14:55,874 INFO L290 TraceCheckUtils]: 64: Hoare triple {10058#(<= main_~b~0 3)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {10058#(<= main_~b~0 3)} is VALID [2022-04-15 13:14:55,874 INFO L290 TraceCheckUtils]: 65: Hoare triple {10058#(<= main_~b~0 3)} assume !(~c~0 < 6); {10058#(<= main_~b~0 3)} is VALID [2022-04-15 13:14:55,874 INFO L290 TraceCheckUtils]: 66: Hoare triple {10058#(<= main_~b~0 3)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {10059#(<= main_~b~0 4)} is VALID [2022-04-15 13:14:55,875 INFO L290 TraceCheckUtils]: 67: Hoare triple {10059#(<= main_~b~0 4)} assume !!(~b~0 < 6);~c~0 := 0; {10059#(<= main_~b~0 4)} is VALID [2022-04-15 13:14:55,875 INFO L290 TraceCheckUtils]: 68: Hoare triple {10059#(<= main_~b~0 4)} assume !!(~c~0 < 6); {10059#(<= main_~b~0 4)} is VALID [2022-04-15 13:14:55,875 INFO L290 TraceCheckUtils]: 69: Hoare triple {10059#(<= main_~b~0 4)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {10059#(<= main_~b~0 4)} is VALID [2022-04-15 13:14:55,876 INFO L290 TraceCheckUtils]: 70: Hoare triple {10059#(<= main_~b~0 4)} assume !!(~c~0 < 6); {10059#(<= main_~b~0 4)} is VALID [2022-04-15 13:14:55,876 INFO L290 TraceCheckUtils]: 71: Hoare triple {10059#(<= main_~b~0 4)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {10059#(<= main_~b~0 4)} is VALID [2022-04-15 13:14:55,876 INFO L290 TraceCheckUtils]: 72: Hoare triple {10059#(<= main_~b~0 4)} assume !!(~c~0 < 6); {10059#(<= main_~b~0 4)} is VALID [2022-04-15 13:14:55,877 INFO L290 TraceCheckUtils]: 73: Hoare triple {10059#(<= main_~b~0 4)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {10059#(<= main_~b~0 4)} is VALID [2022-04-15 13:14:55,877 INFO L290 TraceCheckUtils]: 74: Hoare triple {10059#(<= main_~b~0 4)} assume !!(~c~0 < 6); {10059#(<= main_~b~0 4)} is VALID [2022-04-15 13:14:55,877 INFO L290 TraceCheckUtils]: 75: Hoare triple {10059#(<= main_~b~0 4)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {10059#(<= main_~b~0 4)} is VALID [2022-04-15 13:14:55,878 INFO L290 TraceCheckUtils]: 76: Hoare triple {10059#(<= main_~b~0 4)} assume !!(~c~0 < 6); {10059#(<= main_~b~0 4)} is VALID [2022-04-15 13:14:55,878 INFO L290 TraceCheckUtils]: 77: Hoare triple {10059#(<= main_~b~0 4)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {10059#(<= main_~b~0 4)} is VALID [2022-04-15 13:14:55,878 INFO L290 TraceCheckUtils]: 78: Hoare triple {10059#(<= main_~b~0 4)} assume !!(~c~0 < 6); {10059#(<= main_~b~0 4)} is VALID [2022-04-15 13:14:55,878 INFO L290 TraceCheckUtils]: 79: Hoare triple {10059#(<= main_~b~0 4)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {10059#(<= main_~b~0 4)} is VALID [2022-04-15 13:14:55,879 INFO L290 TraceCheckUtils]: 80: Hoare triple {10059#(<= main_~b~0 4)} assume !(~c~0 < 6); {10059#(<= main_~b~0 4)} is VALID [2022-04-15 13:14:55,879 INFO L290 TraceCheckUtils]: 81: Hoare triple {10059#(<= main_~b~0 4)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {10060#(<= main_~b~0 5)} is VALID [2022-04-15 13:14:55,880 INFO L290 TraceCheckUtils]: 82: Hoare triple {10060#(<= main_~b~0 5)} assume !(~b~0 < 6); {10051#false} is VALID [2022-04-15 13:14:55,880 INFO L290 TraceCheckUtils]: 83: Hoare triple {10051#false} #t~pre4 := 1 + ~a~0;~a~0 := 1 + ~a~0;havoc #t~pre4; {10051#false} is VALID [2022-04-15 13:14:55,880 INFO L290 TraceCheckUtils]: 84: Hoare triple {10051#false} assume !!(~a~0 < 6);~b~0 := 0; {10051#false} is VALID [2022-04-15 13:14:55,880 INFO L290 TraceCheckUtils]: 85: Hoare triple {10051#false} assume !!(~b~0 < 6);~c~0 := 0; {10051#false} is VALID [2022-04-15 13:14:55,880 INFO L290 TraceCheckUtils]: 86: Hoare triple {10051#false} assume !!(~c~0 < 6); {10051#false} is VALID [2022-04-15 13:14:55,880 INFO L290 TraceCheckUtils]: 87: Hoare triple {10051#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {10051#false} is VALID [2022-04-15 13:14:55,880 INFO L290 TraceCheckUtils]: 88: Hoare triple {10051#false} assume !!(~c~0 < 6); {10051#false} is VALID [2022-04-15 13:14:55,880 INFO L290 TraceCheckUtils]: 89: Hoare triple {10051#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {10051#false} is VALID [2022-04-15 13:14:55,880 INFO L290 TraceCheckUtils]: 90: Hoare triple {10051#false} assume !!(~c~0 < 6); {10051#false} is VALID [2022-04-15 13:14:55,881 INFO L290 TraceCheckUtils]: 91: Hoare triple {10051#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {10051#false} is VALID [2022-04-15 13:14:55,881 INFO L290 TraceCheckUtils]: 92: Hoare triple {10051#false} assume !!(~c~0 < 6); {10051#false} is VALID [2022-04-15 13:14:55,881 INFO L290 TraceCheckUtils]: 93: Hoare triple {10051#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {10051#false} is VALID [2022-04-15 13:14:55,881 INFO L290 TraceCheckUtils]: 94: Hoare triple {10051#false} assume !!(~c~0 < 6); {10051#false} is VALID [2022-04-15 13:14:55,881 INFO L290 TraceCheckUtils]: 95: Hoare triple {10051#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {10051#false} is VALID [2022-04-15 13:14:55,881 INFO L290 TraceCheckUtils]: 96: Hoare triple {10051#false} assume !!(~c~0 < 6); {10051#false} is VALID [2022-04-15 13:14:55,881 INFO L290 TraceCheckUtils]: 97: Hoare triple {10051#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {10051#false} is VALID [2022-04-15 13:14:55,881 INFO L290 TraceCheckUtils]: 98: Hoare triple {10051#false} assume !(~c~0 < 6); {10051#false} is VALID [2022-04-15 13:14:55,881 INFO L290 TraceCheckUtils]: 99: Hoare triple {10051#false} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {10051#false} is VALID [2022-04-15 13:14:55,881 INFO L290 TraceCheckUtils]: 100: Hoare triple {10051#false} assume !!(~b~0 < 6);~c~0 := 0; {10051#false} is VALID [2022-04-15 13:14:55,882 INFO L290 TraceCheckUtils]: 101: Hoare triple {10051#false} assume !!(~c~0 < 6); {10051#false} is VALID [2022-04-15 13:14:55,882 INFO L290 TraceCheckUtils]: 102: Hoare triple {10051#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {10051#false} is VALID [2022-04-15 13:14:55,882 INFO L290 TraceCheckUtils]: 103: Hoare triple {10051#false} assume !!(~c~0 < 6); {10051#false} is VALID [2022-04-15 13:14:55,882 INFO L290 TraceCheckUtils]: 104: Hoare triple {10051#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {10051#false} is VALID [2022-04-15 13:14:55,882 INFO L290 TraceCheckUtils]: 105: Hoare triple {10051#false} assume !!(~c~0 < 6); {10051#false} is VALID [2022-04-15 13:14:55,882 INFO L290 TraceCheckUtils]: 106: Hoare triple {10051#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {10051#false} is VALID [2022-04-15 13:14:55,882 INFO L290 TraceCheckUtils]: 107: Hoare triple {10051#false} assume !!(~c~0 < 6); {10051#false} is VALID [2022-04-15 13:14:55,882 INFO L290 TraceCheckUtils]: 108: Hoare triple {10051#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {10051#false} is VALID [2022-04-15 13:14:55,882 INFO L290 TraceCheckUtils]: 109: Hoare triple {10051#false} assume !!(~c~0 < 6); {10051#false} is VALID [2022-04-15 13:14:55,882 INFO L290 TraceCheckUtils]: 110: Hoare triple {10051#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {10051#false} is VALID [2022-04-15 13:14:55,882 INFO L290 TraceCheckUtils]: 111: Hoare triple {10051#false} assume !!(~c~0 < 6); {10051#false} is VALID [2022-04-15 13:14:55,883 INFO L290 TraceCheckUtils]: 112: Hoare triple {10051#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {10051#false} is VALID [2022-04-15 13:14:55,883 INFO L290 TraceCheckUtils]: 113: Hoare triple {10051#false} assume !(~c~0 < 6); {10051#false} is VALID [2022-04-15 13:14:55,883 INFO L290 TraceCheckUtils]: 114: Hoare triple {10051#false} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {10051#false} is VALID [2022-04-15 13:14:55,883 INFO L290 TraceCheckUtils]: 115: Hoare triple {10051#false} assume !!(~b~0 < 6);~c~0 := 0; {10051#false} is VALID [2022-04-15 13:14:55,883 INFO L290 TraceCheckUtils]: 116: Hoare triple {10051#false} assume !!(~c~0 < 6); {10051#false} is VALID [2022-04-15 13:14:55,883 INFO L290 TraceCheckUtils]: 117: Hoare triple {10051#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {10051#false} is VALID [2022-04-15 13:14:55,883 INFO L290 TraceCheckUtils]: 118: Hoare triple {10051#false} assume !!(~c~0 < 6); {10051#false} is VALID [2022-04-15 13:14:55,883 INFO L290 TraceCheckUtils]: 119: Hoare triple {10051#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {10051#false} is VALID [2022-04-15 13:14:55,883 INFO L290 TraceCheckUtils]: 120: Hoare triple {10051#false} assume !!(~c~0 < 6); {10051#false} is VALID [2022-04-15 13:14:55,883 INFO L290 TraceCheckUtils]: 121: Hoare triple {10051#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {10051#false} is VALID [2022-04-15 13:14:55,884 INFO L290 TraceCheckUtils]: 122: Hoare triple {10051#false} assume !!(~c~0 < 6); {10051#false} is VALID [2022-04-15 13:14:55,884 INFO L290 TraceCheckUtils]: 123: Hoare triple {10051#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {10051#false} is VALID [2022-04-15 13:14:55,884 INFO L290 TraceCheckUtils]: 124: Hoare triple {10051#false} assume !!(~c~0 < 6); {10051#false} is VALID [2022-04-15 13:14:55,884 INFO L290 TraceCheckUtils]: 125: Hoare triple {10051#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {10051#false} is VALID [2022-04-15 13:14:55,884 INFO L290 TraceCheckUtils]: 126: Hoare triple {10051#false} assume !!(~c~0 < 6); {10051#false} is VALID [2022-04-15 13:14:55,884 INFO L290 TraceCheckUtils]: 127: Hoare triple {10051#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {10051#false} is VALID [2022-04-15 13:14:55,884 INFO L290 TraceCheckUtils]: 128: Hoare triple {10051#false} assume !(~c~0 < 6); {10051#false} is VALID [2022-04-15 13:14:55,884 INFO L290 TraceCheckUtils]: 129: Hoare triple {10051#false} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {10051#false} is VALID [2022-04-15 13:14:55,884 INFO L290 TraceCheckUtils]: 130: Hoare triple {10051#false} assume !!(~b~0 < 6);~c~0 := 0; {10051#false} is VALID [2022-04-15 13:14:55,884 INFO L290 TraceCheckUtils]: 131: Hoare triple {10051#false} assume !!(~c~0 < 6); {10051#false} is VALID [2022-04-15 13:14:55,884 INFO L290 TraceCheckUtils]: 132: Hoare triple {10051#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {10051#false} is VALID [2022-04-15 13:14:55,885 INFO L290 TraceCheckUtils]: 133: Hoare triple {10051#false} assume !!(~c~0 < 6); {10051#false} is VALID [2022-04-15 13:14:55,885 INFO L290 TraceCheckUtils]: 134: Hoare triple {10051#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {10051#false} is VALID [2022-04-15 13:14:55,885 INFO L290 TraceCheckUtils]: 135: Hoare triple {10051#false} assume !!(~c~0 < 6); {10051#false} is VALID [2022-04-15 13:14:55,885 INFO L290 TraceCheckUtils]: 136: Hoare triple {10051#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {10051#false} is VALID [2022-04-15 13:14:55,885 INFO L290 TraceCheckUtils]: 137: Hoare triple {10051#false} assume !!(~c~0 < 6); {10051#false} is VALID [2022-04-15 13:14:55,885 INFO L290 TraceCheckUtils]: 138: Hoare triple {10051#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {10051#false} is VALID [2022-04-15 13:14:55,885 INFO L290 TraceCheckUtils]: 139: Hoare triple {10051#false} assume !!(~c~0 < 6); {10051#false} is VALID [2022-04-15 13:14:55,885 INFO L290 TraceCheckUtils]: 140: Hoare triple {10051#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {10051#false} is VALID [2022-04-15 13:14:55,885 INFO L290 TraceCheckUtils]: 141: Hoare triple {10051#false} assume !!(~c~0 < 6); {10051#false} is VALID [2022-04-15 13:14:55,885 INFO L290 TraceCheckUtils]: 142: Hoare triple {10051#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {10051#false} is VALID [2022-04-15 13:14:55,885 INFO L290 TraceCheckUtils]: 143: Hoare triple {10051#false} assume !(~c~0 < 6); {10051#false} is VALID [2022-04-15 13:14:55,886 INFO L290 TraceCheckUtils]: 144: Hoare triple {10051#false} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {10051#false} is VALID [2022-04-15 13:14:55,886 INFO L290 TraceCheckUtils]: 145: Hoare triple {10051#false} assume !!(~b~0 < 6);~c~0 := 0; {10051#false} is VALID [2022-04-15 13:14:55,886 INFO L290 TraceCheckUtils]: 146: Hoare triple {10051#false} assume !!(~c~0 < 6); {10051#false} is VALID [2022-04-15 13:14:55,886 INFO L290 TraceCheckUtils]: 147: Hoare triple {10051#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {10051#false} is VALID [2022-04-15 13:14:55,886 INFO L290 TraceCheckUtils]: 148: Hoare triple {10051#false} assume !!(~c~0 < 6); {10051#false} is VALID [2022-04-15 13:14:55,886 INFO L290 TraceCheckUtils]: 149: Hoare triple {10051#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {10051#false} is VALID [2022-04-15 13:14:55,886 INFO L290 TraceCheckUtils]: 150: Hoare triple {10051#false} assume !!(~c~0 < 6); {10051#false} is VALID [2022-04-15 13:14:55,886 INFO L290 TraceCheckUtils]: 151: Hoare triple {10051#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {10051#false} is VALID [2022-04-15 13:14:55,886 INFO L290 TraceCheckUtils]: 152: Hoare triple {10051#false} assume !!(~c~0 < 6); {10051#false} is VALID [2022-04-15 13:14:55,886 INFO L290 TraceCheckUtils]: 153: Hoare triple {10051#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {10051#false} is VALID [2022-04-15 13:14:55,887 INFO L290 TraceCheckUtils]: 154: Hoare triple {10051#false} assume !!(~c~0 < 6); {10051#false} is VALID [2022-04-15 13:14:55,887 INFO L290 TraceCheckUtils]: 155: Hoare triple {10051#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {10051#false} is VALID [2022-04-15 13:14:55,887 INFO L290 TraceCheckUtils]: 156: Hoare triple {10051#false} assume !!(~c~0 < 6); {10051#false} is VALID [2022-04-15 13:14:55,887 INFO L290 TraceCheckUtils]: 157: Hoare triple {10051#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {10051#false} is VALID [2022-04-15 13:14:55,887 INFO L290 TraceCheckUtils]: 158: Hoare triple {10051#false} assume !(~c~0 < 6); {10051#false} is VALID [2022-04-15 13:14:55,887 INFO L290 TraceCheckUtils]: 159: Hoare triple {10051#false} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {10051#false} is VALID [2022-04-15 13:14:55,887 INFO L290 TraceCheckUtils]: 160: Hoare triple {10051#false} assume !(~b~0 < 6); {10051#false} is VALID [2022-04-15 13:14:55,887 INFO L290 TraceCheckUtils]: 161: Hoare triple {10051#false} #t~pre4 := 1 + ~a~0;~a~0 := 1 + ~a~0;havoc #t~pre4; {10051#false} is VALID [2022-04-15 13:14:55,887 INFO L290 TraceCheckUtils]: 162: Hoare triple {10051#false} assume !(~a~0 < 6); {10051#false} is VALID [2022-04-15 13:14:55,887 INFO L290 TraceCheckUtils]: 163: Hoare triple {10051#false} assume !((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0); {10051#false} is VALID [2022-04-15 13:14:55,888 INFO L290 TraceCheckUtils]: 164: Hoare triple {10051#false} assume !false; {10051#false} is VALID [2022-04-15 13:14:55,889 INFO L134 CoverageAnalysis]: Checked inductivity of 4300 backedges. 2188 proven. 875 refuted. 0 times theorem prover too weak. 1237 trivial. 0 not checked. [2022-04-15 13:14:55,890 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 13:14:56,352 INFO L290 TraceCheckUtils]: 164: Hoare triple {10051#false} assume !false; {10051#false} is VALID [2022-04-15 13:14:56,352 INFO L290 TraceCheckUtils]: 163: Hoare triple {10051#false} assume !((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0); {10051#false} is VALID [2022-04-15 13:14:56,352 INFO L290 TraceCheckUtils]: 162: Hoare triple {10051#false} assume !(~a~0 < 6); {10051#false} is VALID [2022-04-15 13:14:56,352 INFO L290 TraceCheckUtils]: 161: Hoare triple {10051#false} #t~pre4 := 1 + ~a~0;~a~0 := 1 + ~a~0;havoc #t~pre4; {10051#false} is VALID [2022-04-15 13:14:56,353 INFO L290 TraceCheckUtils]: 160: Hoare triple {10051#false} assume !(~b~0 < 6); {10051#false} is VALID [2022-04-15 13:14:56,353 INFO L290 TraceCheckUtils]: 159: Hoare triple {10051#false} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {10051#false} is VALID [2022-04-15 13:14:56,353 INFO L290 TraceCheckUtils]: 158: Hoare triple {10051#false} assume !(~c~0 < 6); {10051#false} is VALID [2022-04-15 13:14:56,353 INFO L290 TraceCheckUtils]: 157: Hoare triple {10051#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {10051#false} is VALID [2022-04-15 13:14:56,353 INFO L290 TraceCheckUtils]: 156: Hoare triple {10051#false} assume !!(~c~0 < 6); {10051#false} is VALID [2022-04-15 13:14:56,353 INFO L290 TraceCheckUtils]: 155: Hoare triple {10051#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {10051#false} is VALID [2022-04-15 13:14:56,353 INFO L290 TraceCheckUtils]: 154: Hoare triple {10051#false} assume !!(~c~0 < 6); {10051#false} is VALID [2022-04-15 13:14:56,353 INFO L290 TraceCheckUtils]: 153: Hoare triple {10051#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {10051#false} is VALID [2022-04-15 13:14:56,353 INFO L290 TraceCheckUtils]: 152: Hoare triple {10051#false} assume !!(~c~0 < 6); {10051#false} is VALID [2022-04-15 13:14:56,353 INFO L290 TraceCheckUtils]: 151: Hoare triple {10051#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {10051#false} is VALID [2022-04-15 13:14:56,353 INFO L290 TraceCheckUtils]: 150: Hoare triple {10051#false} assume !!(~c~0 < 6); {10051#false} is VALID [2022-04-15 13:14:56,353 INFO L290 TraceCheckUtils]: 149: Hoare triple {10051#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {10051#false} is VALID [2022-04-15 13:14:56,353 INFO L290 TraceCheckUtils]: 148: Hoare triple {10051#false} assume !!(~c~0 < 6); {10051#false} is VALID [2022-04-15 13:14:56,353 INFO L290 TraceCheckUtils]: 147: Hoare triple {10051#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {10051#false} is VALID [2022-04-15 13:14:56,354 INFO L290 TraceCheckUtils]: 146: Hoare triple {10051#false} assume !!(~c~0 < 6); {10051#false} is VALID [2022-04-15 13:14:56,354 INFO L290 TraceCheckUtils]: 145: Hoare triple {10051#false} assume !!(~b~0 < 6);~c~0 := 0; {10051#false} is VALID [2022-04-15 13:14:56,354 INFO L290 TraceCheckUtils]: 144: Hoare triple {10051#false} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {10051#false} is VALID [2022-04-15 13:14:56,354 INFO L290 TraceCheckUtils]: 143: Hoare triple {10051#false} assume !(~c~0 < 6); {10051#false} is VALID [2022-04-15 13:14:56,354 INFO L290 TraceCheckUtils]: 142: Hoare triple {10051#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {10051#false} is VALID [2022-04-15 13:14:56,354 INFO L290 TraceCheckUtils]: 141: Hoare triple {10051#false} assume !!(~c~0 < 6); {10051#false} is VALID [2022-04-15 13:14:56,354 INFO L290 TraceCheckUtils]: 140: Hoare triple {10051#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {10051#false} is VALID [2022-04-15 13:14:56,354 INFO L290 TraceCheckUtils]: 139: Hoare triple {10051#false} assume !!(~c~0 < 6); {10051#false} is VALID [2022-04-15 13:14:56,354 INFO L290 TraceCheckUtils]: 138: Hoare triple {10051#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {10051#false} is VALID [2022-04-15 13:14:56,354 INFO L290 TraceCheckUtils]: 137: Hoare triple {10051#false} assume !!(~c~0 < 6); {10051#false} is VALID [2022-04-15 13:14:56,354 INFO L290 TraceCheckUtils]: 136: Hoare triple {10051#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {10051#false} is VALID [2022-04-15 13:14:56,354 INFO L290 TraceCheckUtils]: 135: Hoare triple {10051#false} assume !!(~c~0 < 6); {10051#false} is VALID [2022-04-15 13:14:56,354 INFO L290 TraceCheckUtils]: 134: Hoare triple {10051#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {10051#false} is VALID [2022-04-15 13:14:56,354 INFO L290 TraceCheckUtils]: 133: Hoare triple {10051#false} assume !!(~c~0 < 6); {10051#false} is VALID [2022-04-15 13:14:56,355 INFO L290 TraceCheckUtils]: 132: Hoare triple {10051#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {10051#false} is VALID [2022-04-15 13:14:56,355 INFO L290 TraceCheckUtils]: 131: Hoare triple {10051#false} assume !!(~c~0 < 6); {10051#false} is VALID [2022-04-15 13:14:56,355 INFO L290 TraceCheckUtils]: 130: Hoare triple {10051#false} assume !!(~b~0 < 6);~c~0 := 0; {10051#false} is VALID [2022-04-15 13:14:56,355 INFO L290 TraceCheckUtils]: 129: Hoare triple {10051#false} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {10051#false} is VALID [2022-04-15 13:14:56,355 INFO L290 TraceCheckUtils]: 128: Hoare triple {10051#false} assume !(~c~0 < 6); {10051#false} is VALID [2022-04-15 13:14:56,355 INFO L290 TraceCheckUtils]: 127: Hoare triple {10051#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {10051#false} is VALID [2022-04-15 13:14:56,355 INFO L290 TraceCheckUtils]: 126: Hoare triple {10051#false} assume !!(~c~0 < 6); {10051#false} is VALID [2022-04-15 13:14:56,355 INFO L290 TraceCheckUtils]: 125: Hoare triple {10051#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {10051#false} is VALID [2022-04-15 13:14:56,355 INFO L290 TraceCheckUtils]: 124: Hoare triple {10051#false} assume !!(~c~0 < 6); {10051#false} is VALID [2022-04-15 13:14:56,355 INFO L290 TraceCheckUtils]: 123: Hoare triple {10051#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {10051#false} is VALID [2022-04-15 13:14:56,355 INFO L290 TraceCheckUtils]: 122: Hoare triple {10051#false} assume !!(~c~0 < 6); {10051#false} is VALID [2022-04-15 13:14:56,355 INFO L290 TraceCheckUtils]: 121: Hoare triple {10051#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {10051#false} is VALID [2022-04-15 13:14:56,355 INFO L290 TraceCheckUtils]: 120: Hoare triple {10051#false} assume !!(~c~0 < 6); {10051#false} is VALID [2022-04-15 13:14:56,355 INFO L290 TraceCheckUtils]: 119: Hoare triple {10051#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {10051#false} is VALID [2022-04-15 13:14:56,356 INFO L290 TraceCheckUtils]: 118: Hoare triple {10051#false} assume !!(~c~0 < 6); {10051#false} is VALID [2022-04-15 13:14:56,356 INFO L290 TraceCheckUtils]: 117: Hoare triple {10051#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {10051#false} is VALID [2022-04-15 13:14:56,356 INFO L290 TraceCheckUtils]: 116: Hoare triple {10051#false} assume !!(~c~0 < 6); {10051#false} is VALID [2022-04-15 13:14:56,356 INFO L290 TraceCheckUtils]: 115: Hoare triple {10051#false} assume !!(~b~0 < 6);~c~0 := 0; {10051#false} is VALID [2022-04-15 13:14:56,356 INFO L290 TraceCheckUtils]: 114: Hoare triple {10051#false} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {10051#false} is VALID [2022-04-15 13:14:56,356 INFO L290 TraceCheckUtils]: 113: Hoare triple {10051#false} assume !(~c~0 < 6); {10051#false} is VALID [2022-04-15 13:14:56,356 INFO L290 TraceCheckUtils]: 112: Hoare triple {10051#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {10051#false} is VALID [2022-04-15 13:14:56,356 INFO L290 TraceCheckUtils]: 111: Hoare triple {10051#false} assume !!(~c~0 < 6); {10051#false} is VALID [2022-04-15 13:14:56,356 INFO L290 TraceCheckUtils]: 110: Hoare triple {10051#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {10051#false} is VALID [2022-04-15 13:14:56,356 INFO L290 TraceCheckUtils]: 109: Hoare triple {10051#false} assume !!(~c~0 < 6); {10051#false} is VALID [2022-04-15 13:14:56,356 INFO L290 TraceCheckUtils]: 108: Hoare triple {10051#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {10051#false} is VALID [2022-04-15 13:14:56,356 INFO L290 TraceCheckUtils]: 107: Hoare triple {10051#false} assume !!(~c~0 < 6); {10051#false} is VALID [2022-04-15 13:14:56,356 INFO L290 TraceCheckUtils]: 106: Hoare triple {10051#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {10051#false} is VALID [2022-04-15 13:14:56,356 INFO L290 TraceCheckUtils]: 105: Hoare triple {10051#false} assume !!(~c~0 < 6); {10051#false} is VALID [2022-04-15 13:14:56,357 INFO L290 TraceCheckUtils]: 104: Hoare triple {10051#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {10051#false} is VALID [2022-04-15 13:14:56,357 INFO L290 TraceCheckUtils]: 103: Hoare triple {10051#false} assume !!(~c~0 < 6); {10051#false} is VALID [2022-04-15 13:14:56,357 INFO L290 TraceCheckUtils]: 102: Hoare triple {10051#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {10051#false} is VALID [2022-04-15 13:14:56,357 INFO L290 TraceCheckUtils]: 101: Hoare triple {10051#false} assume !!(~c~0 < 6); {10051#false} is VALID [2022-04-15 13:14:56,357 INFO L290 TraceCheckUtils]: 100: Hoare triple {10051#false} assume !!(~b~0 < 6);~c~0 := 0; {10051#false} is VALID [2022-04-15 13:14:56,357 INFO L290 TraceCheckUtils]: 99: Hoare triple {10051#false} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {10051#false} is VALID [2022-04-15 13:14:56,357 INFO L290 TraceCheckUtils]: 98: Hoare triple {10051#false} assume !(~c~0 < 6); {10051#false} is VALID [2022-04-15 13:14:56,357 INFO L290 TraceCheckUtils]: 97: Hoare triple {10051#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {10051#false} is VALID [2022-04-15 13:14:56,357 INFO L290 TraceCheckUtils]: 96: Hoare triple {10051#false} assume !!(~c~0 < 6); {10051#false} is VALID [2022-04-15 13:14:56,357 INFO L290 TraceCheckUtils]: 95: Hoare triple {10051#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {10051#false} is VALID [2022-04-15 13:14:56,358 INFO L290 TraceCheckUtils]: 94: Hoare triple {10051#false} assume !!(~c~0 < 6); {10051#false} is VALID [2022-04-15 13:14:56,358 INFO L290 TraceCheckUtils]: 93: Hoare triple {10051#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {10051#false} is VALID [2022-04-15 13:14:56,358 INFO L290 TraceCheckUtils]: 92: Hoare triple {10051#false} assume !!(~c~0 < 6); {10051#false} is VALID [2022-04-15 13:14:56,358 INFO L290 TraceCheckUtils]: 91: Hoare triple {10051#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {10051#false} is VALID [2022-04-15 13:14:56,358 INFO L290 TraceCheckUtils]: 90: Hoare triple {10051#false} assume !!(~c~0 < 6); {10051#false} is VALID [2022-04-15 13:14:56,358 INFO L290 TraceCheckUtils]: 89: Hoare triple {10051#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {10051#false} is VALID [2022-04-15 13:14:56,358 INFO L290 TraceCheckUtils]: 88: Hoare triple {10051#false} assume !!(~c~0 < 6); {10051#false} is VALID [2022-04-15 13:14:56,358 INFO L290 TraceCheckUtils]: 87: Hoare triple {10051#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {10051#false} is VALID [2022-04-15 13:14:56,358 INFO L290 TraceCheckUtils]: 86: Hoare triple {10051#false} assume !!(~c~0 < 6); {10051#false} is VALID [2022-04-15 13:14:56,358 INFO L290 TraceCheckUtils]: 85: Hoare triple {10051#false} assume !!(~b~0 < 6);~c~0 := 0; {10051#false} is VALID [2022-04-15 13:14:56,358 INFO L290 TraceCheckUtils]: 84: Hoare triple {10051#false} assume !!(~a~0 < 6);~b~0 := 0; {10051#false} is VALID [2022-04-15 13:14:56,358 INFO L290 TraceCheckUtils]: 83: Hoare triple {10051#false} #t~pre4 := 1 + ~a~0;~a~0 := 1 + ~a~0;havoc #t~pre4; {10051#false} is VALID [2022-04-15 13:14:56,359 INFO L290 TraceCheckUtils]: 82: Hoare triple {10060#(<= main_~b~0 5)} assume !(~b~0 < 6); {10051#false} is VALID [2022-04-15 13:14:56,359 INFO L290 TraceCheckUtils]: 81: Hoare triple {10059#(<= main_~b~0 4)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {10060#(<= main_~b~0 5)} is VALID [2022-04-15 13:14:56,360 INFO L290 TraceCheckUtils]: 80: Hoare triple {10059#(<= main_~b~0 4)} assume !(~c~0 < 6); {10059#(<= main_~b~0 4)} is VALID [2022-04-15 13:14:56,360 INFO L290 TraceCheckUtils]: 79: Hoare triple {10059#(<= main_~b~0 4)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {10059#(<= main_~b~0 4)} is VALID [2022-04-15 13:14:56,360 INFO L290 TraceCheckUtils]: 78: Hoare triple {10059#(<= main_~b~0 4)} assume !!(~c~0 < 6); {10059#(<= main_~b~0 4)} is VALID [2022-04-15 13:14:56,360 INFO L290 TraceCheckUtils]: 77: Hoare triple {10059#(<= main_~b~0 4)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {10059#(<= main_~b~0 4)} is VALID [2022-04-15 13:14:56,361 INFO L290 TraceCheckUtils]: 76: Hoare triple {10059#(<= main_~b~0 4)} assume !!(~c~0 < 6); {10059#(<= main_~b~0 4)} is VALID [2022-04-15 13:14:56,361 INFO L290 TraceCheckUtils]: 75: Hoare triple {10059#(<= main_~b~0 4)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {10059#(<= main_~b~0 4)} is VALID [2022-04-15 13:14:56,361 INFO L290 TraceCheckUtils]: 74: Hoare triple {10059#(<= main_~b~0 4)} assume !!(~c~0 < 6); {10059#(<= main_~b~0 4)} is VALID [2022-04-15 13:14:56,362 INFO L290 TraceCheckUtils]: 73: Hoare triple {10059#(<= main_~b~0 4)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {10059#(<= main_~b~0 4)} is VALID [2022-04-15 13:14:56,362 INFO L290 TraceCheckUtils]: 72: Hoare triple {10059#(<= main_~b~0 4)} assume !!(~c~0 < 6); {10059#(<= main_~b~0 4)} is VALID [2022-04-15 13:14:56,362 INFO L290 TraceCheckUtils]: 71: Hoare triple {10059#(<= main_~b~0 4)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {10059#(<= main_~b~0 4)} is VALID [2022-04-15 13:14:56,362 INFO L290 TraceCheckUtils]: 70: Hoare triple {10059#(<= main_~b~0 4)} assume !!(~c~0 < 6); {10059#(<= main_~b~0 4)} is VALID [2022-04-15 13:14:56,363 INFO L290 TraceCheckUtils]: 69: Hoare triple {10059#(<= main_~b~0 4)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {10059#(<= main_~b~0 4)} is VALID [2022-04-15 13:14:56,363 INFO L290 TraceCheckUtils]: 68: Hoare triple {10059#(<= main_~b~0 4)} assume !!(~c~0 < 6); {10059#(<= main_~b~0 4)} is VALID [2022-04-15 13:14:56,364 INFO L290 TraceCheckUtils]: 67: Hoare triple {10059#(<= main_~b~0 4)} assume !!(~b~0 < 6);~c~0 := 0; {10059#(<= main_~b~0 4)} is VALID [2022-04-15 13:14:56,364 INFO L290 TraceCheckUtils]: 66: Hoare triple {10058#(<= main_~b~0 3)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {10059#(<= main_~b~0 4)} is VALID [2022-04-15 13:14:56,364 INFO L290 TraceCheckUtils]: 65: Hoare triple {10058#(<= main_~b~0 3)} assume !(~c~0 < 6); {10058#(<= main_~b~0 3)} is VALID [2022-04-15 13:14:56,365 INFO L290 TraceCheckUtils]: 64: Hoare triple {10058#(<= main_~b~0 3)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {10058#(<= main_~b~0 3)} is VALID [2022-04-15 13:14:56,365 INFO L290 TraceCheckUtils]: 63: Hoare triple {10058#(<= main_~b~0 3)} assume !!(~c~0 < 6); {10058#(<= main_~b~0 3)} is VALID [2022-04-15 13:14:56,365 INFO L290 TraceCheckUtils]: 62: Hoare triple {10058#(<= main_~b~0 3)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {10058#(<= main_~b~0 3)} is VALID [2022-04-15 13:14:56,365 INFO L290 TraceCheckUtils]: 61: Hoare triple {10058#(<= main_~b~0 3)} assume !!(~c~0 < 6); {10058#(<= main_~b~0 3)} is VALID [2022-04-15 13:14:56,366 INFO L290 TraceCheckUtils]: 60: Hoare triple {10058#(<= main_~b~0 3)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {10058#(<= main_~b~0 3)} is VALID [2022-04-15 13:14:56,366 INFO L290 TraceCheckUtils]: 59: Hoare triple {10058#(<= main_~b~0 3)} assume !!(~c~0 < 6); {10058#(<= main_~b~0 3)} is VALID [2022-04-15 13:14:56,366 INFO L290 TraceCheckUtils]: 58: Hoare triple {10058#(<= main_~b~0 3)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {10058#(<= main_~b~0 3)} is VALID [2022-04-15 13:14:56,367 INFO L290 TraceCheckUtils]: 57: Hoare triple {10058#(<= main_~b~0 3)} assume !!(~c~0 < 6); {10058#(<= main_~b~0 3)} is VALID [2022-04-15 13:14:56,367 INFO L290 TraceCheckUtils]: 56: Hoare triple {10058#(<= main_~b~0 3)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {10058#(<= main_~b~0 3)} is VALID [2022-04-15 13:14:56,367 INFO L290 TraceCheckUtils]: 55: Hoare triple {10058#(<= main_~b~0 3)} assume !!(~c~0 < 6); {10058#(<= main_~b~0 3)} is VALID [2022-04-15 13:14:56,367 INFO L290 TraceCheckUtils]: 54: Hoare triple {10058#(<= main_~b~0 3)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {10058#(<= main_~b~0 3)} is VALID [2022-04-15 13:14:56,368 INFO L290 TraceCheckUtils]: 53: Hoare triple {10058#(<= main_~b~0 3)} assume !!(~c~0 < 6); {10058#(<= main_~b~0 3)} is VALID [2022-04-15 13:14:56,368 INFO L290 TraceCheckUtils]: 52: Hoare triple {10058#(<= main_~b~0 3)} assume !!(~b~0 < 6);~c~0 := 0; {10058#(<= main_~b~0 3)} is VALID [2022-04-15 13:14:56,368 INFO L290 TraceCheckUtils]: 51: Hoare triple {10057#(<= main_~b~0 2)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {10058#(<= main_~b~0 3)} is VALID [2022-04-15 13:14:56,369 INFO L290 TraceCheckUtils]: 50: Hoare triple {10057#(<= main_~b~0 2)} assume !(~c~0 < 6); {10057#(<= main_~b~0 2)} is VALID [2022-04-15 13:14:56,369 INFO L290 TraceCheckUtils]: 49: Hoare triple {10057#(<= main_~b~0 2)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {10057#(<= main_~b~0 2)} is VALID [2022-04-15 13:14:56,369 INFO L290 TraceCheckUtils]: 48: Hoare triple {10057#(<= main_~b~0 2)} assume !!(~c~0 < 6); {10057#(<= main_~b~0 2)} is VALID [2022-04-15 13:14:56,370 INFO L290 TraceCheckUtils]: 47: Hoare triple {10057#(<= main_~b~0 2)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {10057#(<= main_~b~0 2)} is VALID [2022-04-15 13:14:56,370 INFO L290 TraceCheckUtils]: 46: Hoare triple {10057#(<= main_~b~0 2)} assume !!(~c~0 < 6); {10057#(<= main_~b~0 2)} is VALID [2022-04-15 13:14:56,370 INFO L290 TraceCheckUtils]: 45: Hoare triple {10057#(<= main_~b~0 2)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {10057#(<= main_~b~0 2)} is VALID [2022-04-15 13:14:56,370 INFO L290 TraceCheckUtils]: 44: Hoare triple {10057#(<= main_~b~0 2)} assume !!(~c~0 < 6); {10057#(<= main_~b~0 2)} is VALID [2022-04-15 13:14:56,371 INFO L290 TraceCheckUtils]: 43: Hoare triple {10057#(<= main_~b~0 2)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {10057#(<= main_~b~0 2)} is VALID [2022-04-15 13:14:56,371 INFO L290 TraceCheckUtils]: 42: Hoare triple {10057#(<= main_~b~0 2)} assume !!(~c~0 < 6); {10057#(<= main_~b~0 2)} is VALID [2022-04-15 13:14:56,371 INFO L290 TraceCheckUtils]: 41: Hoare triple {10057#(<= main_~b~0 2)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {10057#(<= main_~b~0 2)} is VALID [2022-04-15 13:14:56,372 INFO L290 TraceCheckUtils]: 40: Hoare triple {10057#(<= main_~b~0 2)} assume !!(~c~0 < 6); {10057#(<= main_~b~0 2)} is VALID [2022-04-15 13:14:56,372 INFO L290 TraceCheckUtils]: 39: Hoare triple {10057#(<= main_~b~0 2)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {10057#(<= main_~b~0 2)} is VALID [2022-04-15 13:14:56,372 INFO L290 TraceCheckUtils]: 38: Hoare triple {10057#(<= main_~b~0 2)} assume !!(~c~0 < 6); {10057#(<= main_~b~0 2)} is VALID [2022-04-15 13:14:56,372 INFO L290 TraceCheckUtils]: 37: Hoare triple {10057#(<= main_~b~0 2)} assume !!(~b~0 < 6);~c~0 := 0; {10057#(<= main_~b~0 2)} is VALID [2022-04-15 13:14:56,373 INFO L290 TraceCheckUtils]: 36: Hoare triple {10056#(<= main_~b~0 1)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {10057#(<= main_~b~0 2)} is VALID [2022-04-15 13:14:56,373 INFO L290 TraceCheckUtils]: 35: Hoare triple {10056#(<= main_~b~0 1)} assume !(~c~0 < 6); {10056#(<= main_~b~0 1)} is VALID [2022-04-15 13:14:56,373 INFO L290 TraceCheckUtils]: 34: Hoare triple {10056#(<= main_~b~0 1)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {10056#(<= main_~b~0 1)} is VALID [2022-04-15 13:14:56,374 INFO L290 TraceCheckUtils]: 33: Hoare triple {10056#(<= main_~b~0 1)} assume !!(~c~0 < 6); {10056#(<= main_~b~0 1)} is VALID [2022-04-15 13:14:56,374 INFO L290 TraceCheckUtils]: 32: Hoare triple {10056#(<= main_~b~0 1)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {10056#(<= main_~b~0 1)} is VALID [2022-04-15 13:14:56,374 INFO L290 TraceCheckUtils]: 31: Hoare triple {10056#(<= main_~b~0 1)} assume !!(~c~0 < 6); {10056#(<= main_~b~0 1)} is VALID [2022-04-15 13:14:56,374 INFO L290 TraceCheckUtils]: 30: Hoare triple {10056#(<= main_~b~0 1)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {10056#(<= main_~b~0 1)} is VALID [2022-04-15 13:14:56,375 INFO L290 TraceCheckUtils]: 29: Hoare triple {10056#(<= main_~b~0 1)} assume !!(~c~0 < 6); {10056#(<= main_~b~0 1)} is VALID [2022-04-15 13:14:56,375 INFO L290 TraceCheckUtils]: 28: Hoare triple {10056#(<= main_~b~0 1)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {10056#(<= main_~b~0 1)} is VALID [2022-04-15 13:14:56,375 INFO L290 TraceCheckUtils]: 27: Hoare triple {10056#(<= main_~b~0 1)} assume !!(~c~0 < 6); {10056#(<= main_~b~0 1)} is VALID [2022-04-15 13:14:56,376 INFO L290 TraceCheckUtils]: 26: Hoare triple {10056#(<= main_~b~0 1)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {10056#(<= main_~b~0 1)} is VALID [2022-04-15 13:14:56,376 INFO L290 TraceCheckUtils]: 25: Hoare triple {10056#(<= main_~b~0 1)} assume !!(~c~0 < 6); {10056#(<= main_~b~0 1)} is VALID [2022-04-15 13:14:56,376 INFO L290 TraceCheckUtils]: 24: Hoare triple {10056#(<= main_~b~0 1)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {10056#(<= main_~b~0 1)} is VALID [2022-04-15 13:14:56,376 INFO L290 TraceCheckUtils]: 23: Hoare triple {10056#(<= main_~b~0 1)} assume !!(~c~0 < 6); {10056#(<= main_~b~0 1)} is VALID [2022-04-15 13:14:56,383 INFO L290 TraceCheckUtils]: 22: Hoare triple {10056#(<= main_~b~0 1)} assume !!(~b~0 < 6);~c~0 := 0; {10056#(<= main_~b~0 1)} is VALID [2022-04-15 13:14:56,384 INFO L290 TraceCheckUtils]: 21: Hoare triple {10083#(<= main_~b~0 0)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {10056#(<= main_~b~0 1)} is VALID [2022-04-15 13:14:56,384 INFO L290 TraceCheckUtils]: 20: Hoare triple {10083#(<= main_~b~0 0)} assume !(~c~0 < 6); {10083#(<= main_~b~0 0)} is VALID [2022-04-15 13:14:56,384 INFO L290 TraceCheckUtils]: 19: Hoare triple {10083#(<= main_~b~0 0)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {10083#(<= main_~b~0 0)} is VALID [2022-04-15 13:14:56,385 INFO L290 TraceCheckUtils]: 18: Hoare triple {10083#(<= main_~b~0 0)} assume !!(~c~0 < 6); {10083#(<= main_~b~0 0)} is VALID [2022-04-15 13:14:56,385 INFO L290 TraceCheckUtils]: 17: Hoare triple {10083#(<= main_~b~0 0)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {10083#(<= main_~b~0 0)} is VALID [2022-04-15 13:14:56,385 INFO L290 TraceCheckUtils]: 16: Hoare triple {10083#(<= main_~b~0 0)} assume !!(~c~0 < 6); {10083#(<= main_~b~0 0)} is VALID [2022-04-15 13:14:56,386 INFO L290 TraceCheckUtils]: 15: Hoare triple {10083#(<= main_~b~0 0)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {10083#(<= main_~b~0 0)} is VALID [2022-04-15 13:14:56,386 INFO L290 TraceCheckUtils]: 14: Hoare triple {10083#(<= main_~b~0 0)} assume !!(~c~0 < 6); {10083#(<= main_~b~0 0)} is VALID [2022-04-15 13:14:56,386 INFO L290 TraceCheckUtils]: 13: Hoare triple {10083#(<= main_~b~0 0)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {10083#(<= main_~b~0 0)} is VALID [2022-04-15 13:14:56,387 INFO L290 TraceCheckUtils]: 12: Hoare triple {10083#(<= main_~b~0 0)} assume !!(~c~0 < 6); {10083#(<= main_~b~0 0)} is VALID [2022-04-15 13:14:56,387 INFO L290 TraceCheckUtils]: 11: Hoare triple {10083#(<= main_~b~0 0)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {10083#(<= main_~b~0 0)} is VALID [2022-04-15 13:14:56,387 INFO L290 TraceCheckUtils]: 10: Hoare triple {10083#(<= main_~b~0 0)} assume !!(~c~0 < 6); {10083#(<= main_~b~0 0)} is VALID [2022-04-15 13:14:56,388 INFO L290 TraceCheckUtils]: 9: Hoare triple {10083#(<= main_~b~0 0)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {10083#(<= main_~b~0 0)} is VALID [2022-04-15 13:14:56,388 INFO L290 TraceCheckUtils]: 8: Hoare triple {10083#(<= main_~b~0 0)} assume !!(~c~0 < 6); {10083#(<= main_~b~0 0)} is VALID [2022-04-15 13:14:56,388 INFO L290 TraceCheckUtils]: 7: Hoare triple {10083#(<= main_~b~0 0)} assume !!(~b~0 < 6);~c~0 := 0; {10083#(<= main_~b~0 0)} is VALID [2022-04-15 13:14:56,388 INFO L290 TraceCheckUtils]: 6: Hoare triple {10050#true} assume !!(~a~0 < 6);~b~0 := 0; {10083#(<= main_~b~0 0)} is VALID [2022-04-15 13:14:56,389 INFO L290 TraceCheckUtils]: 5: Hoare triple {10050#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~a~0 := 0; {10050#true} is VALID [2022-04-15 13:14:56,389 INFO L272 TraceCheckUtils]: 4: Hoare triple {10050#true} call #t~ret7 := main(); {10050#true} is VALID [2022-04-15 13:14:56,389 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10050#true} {10050#true} #56#return; {10050#true} is VALID [2022-04-15 13:14:56,389 INFO L290 TraceCheckUtils]: 2: Hoare triple {10050#true} assume true; {10050#true} is VALID [2022-04-15 13:14:56,389 INFO L290 TraceCheckUtils]: 1: Hoare triple {10050#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); {10050#true} is VALID [2022-04-15 13:14:56,389 INFO L272 TraceCheckUtils]: 0: Hoare triple {10050#true} call ULTIMATE.init(); {10050#true} is VALID [2022-04-15 13:14:56,390 INFO L134 CoverageAnalysis]: Checked inductivity of 4300 backedges. 2188 proven. 875 refuted. 0 times theorem prover too weak. 1237 trivial. 0 not checked. [2022-04-15 13:14:56,390 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2010833641] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 13:14:56,390 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 13:14:56,391 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 10 [2022-04-15 13:14:56,391 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:14:56,391 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [179072489] [2022-04-15 13:14:56,391 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [179072489] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:14:56,391 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:14:56,391 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-15 13:14:56,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382691463] [2022-04-15 13:14:56,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:14:56,392 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.555555555555555) internal successors, (41), 8 states have internal predecessors, (41), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 165 [2022-04-15 13:14:56,392 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:14:56,392 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 4.555555555555555) internal successors, (41), 8 states have internal predecessors, (41), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:14:56,421 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:14:56,421 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-15 13:14:56,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:14:56,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-15 13:14:56,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2022-04-15 13:14:56,422 INFO L87 Difference]: Start difference. First operand 166 states and 178 transitions. Second operand has 9 states, 9 states have (on average 4.555555555555555) internal successors, (41), 8 states have internal predecessors, (41), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:14:56,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:14:56,895 INFO L93 Difference]: Finished difference Result 279 states and 301 transitions. [2022-04-15 13:14:56,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-15 13:14:56,895 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.555555555555555) internal successors, (41), 8 states have internal predecessors, (41), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 165 [2022-04-15 13:14:56,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:14:56,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 4.555555555555555) internal successors, (41), 8 states have internal predecessors, (41), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:14:56,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 55 transitions. [2022-04-15 13:14:56,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 4.555555555555555) internal successors, (41), 8 states have internal predecessors, (41), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:14:56,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 55 transitions. [2022-04-15 13:14:56,898 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 55 transitions. [2022-04-15 13:14:56,941 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:14:56,944 INFO L225 Difference]: With dead ends: 279 [2022-04-15 13:14:56,944 INFO L226 Difference]: Without dead ends: 196 [2022-04-15 13:14:56,945 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 345 GetRequests, 330 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=93, Invalid=147, Unknown=0, NotChecked=0, Total=240 [2022-04-15 13:14:56,945 INFO L913 BasicCegarLoop]: 15 mSDtfsCounter, 56 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 13:14:56,946 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [56 Valid, 22 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 13:14:56,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2022-04-15 13:14:57,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 196. [2022-04-15 13:14:57,286 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:14:57,287 INFO L82 GeneralOperation]: Start isEquivalent. First operand 196 states. Second operand has 196 states, 192 states have (on average 1.078125) internal successors, (207), 192 states have internal predecessors, (207), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:14:57,287 INFO L74 IsIncluded]: Start isIncluded. First operand 196 states. Second operand has 196 states, 192 states have (on average 1.078125) internal successors, (207), 192 states have internal predecessors, (207), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:14:57,288 INFO L87 Difference]: Start difference. First operand 196 states. Second operand has 196 states, 192 states have (on average 1.078125) internal successors, (207), 192 states have internal predecessors, (207), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:14:57,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:14:57,291 INFO L93 Difference]: Finished difference Result 196 states and 210 transitions. [2022-04-15 13:14:57,291 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 210 transitions. [2022-04-15 13:14:57,292 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:14:57,292 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:14:57,292 INFO L74 IsIncluded]: Start isIncluded. First operand has 196 states, 192 states have (on average 1.078125) internal successors, (207), 192 states have internal predecessors, (207), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 196 states. [2022-04-15 13:14:57,293 INFO L87 Difference]: Start difference. First operand has 196 states, 192 states have (on average 1.078125) internal successors, (207), 192 states have internal predecessors, (207), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 196 states. [2022-04-15 13:14:57,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:14:57,296 INFO L93 Difference]: Finished difference Result 196 states and 210 transitions. [2022-04-15 13:14:57,296 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 210 transitions. [2022-04-15 13:14:57,296 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:14:57,297 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:14:57,297 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:14:57,297 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:14:57,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 192 states have (on average 1.078125) internal successors, (207), 192 states have internal predecessors, (207), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:14:57,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 210 transitions. [2022-04-15 13:14:57,301 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 210 transitions. Word has length 165 [2022-04-15 13:14:57,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:14:57,301 INFO L478 AbstractCegarLoop]: Abstraction has 196 states and 210 transitions. [2022-04-15 13:14:57,301 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.555555555555555) internal successors, (41), 8 states have internal predecessors, (41), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:14:57,302 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 196 states and 210 transitions. [2022-04-15 13:14:57,510 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 210 edges. 210 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:14:57,510 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 210 transitions. [2022-04-15 13:14:57,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2022-04-15 13:14:57,512 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:14:57,512 INFO L499 BasicCegarLoop]: trace histogram [72, 72, 12, 12, 12, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 13:14:57,529 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-04-15 13:14:57,715 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25,SelfDestructingSolverStorable26 [2022-04-15 13:14:57,715 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:14:57,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:14:57,716 INFO L85 PathProgramCache]: Analyzing trace with hash 1201246079, now seen corresponding path program 23 times [2022-04-15 13:14:57,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:14:57,716 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [34868391] [2022-04-15 13:14:58,856 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 13:14:58,857 INFO L85 PathProgramCache]: Analyzing trace with hash 1694738383, now seen corresponding path program 1 times [2022-04-15 13:14:58,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:14:58,858 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1631181312] [2022-04-15 13:14:58,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:14:58,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:14:58,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:14:58,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 13:14:58,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:14:58,900 INFO L290 TraceCheckUtils]: 0: Hoare triple {12413#(and (= |#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); {12406#true} is VALID [2022-04-15 13:14:58,900 INFO L290 TraceCheckUtils]: 1: Hoare triple {12406#true} assume true; {12406#true} is VALID [2022-04-15 13:14:58,900 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {12406#true} {12406#true} #56#return; {12406#true} is VALID [2022-04-15 13:14:58,901 INFO L272 TraceCheckUtils]: 0: Hoare triple {12406#true} call ULTIMATE.init(); {12413#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 13:14:58,901 INFO L290 TraceCheckUtils]: 1: Hoare triple {12413#(and (= |#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); {12406#true} is VALID [2022-04-15 13:14:58,901 INFO L290 TraceCheckUtils]: 2: Hoare triple {12406#true} assume true; {12406#true} is VALID [2022-04-15 13:14:58,901 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12406#true} {12406#true} #56#return; {12406#true} is VALID [2022-04-15 13:14:58,901 INFO L272 TraceCheckUtils]: 4: Hoare triple {12406#true} call #t~ret7 := main(); {12406#true} is VALID [2022-04-15 13:14:58,901 INFO L290 TraceCheckUtils]: 5: Hoare triple {12406#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~a~0 := 0; {12411#(= main_~a~0 0)} is VALID [2022-04-15 13:14:58,903 INFO L290 TraceCheckUtils]: 6: Hoare triple {12411#(= main_~a~0 0)} [84] L21-3-->L21-4_primed: Formula: (or (let ((.cse0 (* 6 v_main_~a~0_Out_46))) (and (= (* 6 |v_main_#t~pre5_Out_56|) 0) (= (* 6 |v_main_#t~pre6_Out_60|) 0) (< v_main_~a~0_Out_46 7) (= .cse0 0) (= 6 v_main_~b~0_Out_58) (= (* 6 v_main_~b~0_Out_58) (* 6 v_main_~c~0_Out_64)) (= (* 6 v_main_~a~0_In_18) .cse0) (= 6 v_main_~c~0_Out_64))) (= v_main_~a~0_In_18 v_main_~a~0_Out_46)) InVars {main_~a~0=v_main_~a~0_In_18} OutVars{main_~c~0=v_main_~c~0_Out_64, main_~b~0=v_main_~b~0_Out_58, main_#t~pre4=|v_main_#t~pre4_Out_46|, main_#t~pre5=|v_main_#t~pre5_Out_56|, main_~a~0=v_main_~a~0_Out_46, main_#t~pre6=|v_main_#t~pre6_Out_60|} AuxVars[] AssignedVars[main_~c~0, main_~b~0, main_#t~pre4, main_#t~pre5, main_~a~0, main_#t~pre6] {12412#(<= main_~a~0 0)} is VALID [2022-04-15 13:14:58,904 INFO L290 TraceCheckUtils]: 7: Hoare triple {12412#(<= main_~a~0 0)} [83] L21-4_primed-->L21-4: Formula: (not (< v_main_~a~0_5 6)) InVars {main_~a~0=v_main_~a~0_5} OutVars{main_~a~0=v_main_~a~0_5} AuxVars[] AssignedVars[] {12407#false} is VALID [2022-04-15 13:14:58,904 INFO L290 TraceCheckUtils]: 8: Hoare triple {12407#false} assume !((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0); {12407#false} is VALID [2022-04-15 13:14:58,904 INFO L290 TraceCheckUtils]: 9: Hoare triple {12407#false} assume !false; {12407#false} is VALID [2022-04-15 13:14:58,904 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 13:14:58,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:14:58,905 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1631181312] [2022-04-15 13:14:58,905 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1631181312] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:14:58,905 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:14:58,905 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 13:15:02,871 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:15:02,871 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [34868391] [2022-04-15 13:15:02,871 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [34868391] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:15:02,871 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:15:02,872 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [92] imperfect sequences [] total 92 [2022-04-15 13:15:02,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079409274] [2022-04-15 13:15:02,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:15:02,873 INFO L78 Accepts]: Start accepts. Automaton has has 92 states, 92 states have (on average 2.0869565217391304) internal successors, (192), 91 states have internal predecessors, (192), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 195 [2022-04-15 13:15:02,873 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:15:02,873 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 92 states, 92 states have (on average 2.0869565217391304) internal successors, (192), 91 states have internal predecessors, (192), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:15:03,037 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 195 edges. 195 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:15:03,037 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 92 states [2022-04-15 13:15:03,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:15:03,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2022-04-15 13:15:03,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=279, Invalid=8277, Unknown=0, NotChecked=0, Total=8556 [2022-04-15 13:15:03,040 INFO L87 Difference]: Start difference. First operand 196 states and 210 transitions. Second operand has 92 states, 92 states have (on average 2.0869565217391304) internal successors, (192), 91 states have internal predecessors, (192), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:15:24,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:15:24,896 INFO L93 Difference]: Finished difference Result 466 states and 502 transitions. [2022-04-15 13:15:24,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2022-04-15 13:15:24,896 INFO L78 Accepts]: Start accepts. Automaton has has 92 states, 92 states have (on average 2.0869565217391304) internal successors, (192), 91 states have internal predecessors, (192), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 195 [2022-04-15 13:15:24,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:15:24,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 92 states have (on average 2.0869565217391304) internal successors, (192), 91 states have internal predecessors, (192), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:15:24,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 230 transitions. [2022-04-15 13:15:24,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 92 states have (on average 2.0869565217391304) internal successors, (192), 91 states have internal predecessors, (192), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:15:24,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 230 transitions. [2022-04-15 13:15:24,902 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 90 states and 230 transitions. [2022-04-15 13:15:25,106 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 230 edges. 230 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:15:25,112 INFO L225 Difference]: With dead ends: 466 [2022-04-15 13:15:25,112 INFO L226 Difference]: Without dead ends: 289 [2022-04-15 13:15:25,118 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 282 GetRequests, 61 SyntacticMatches, 43 SemanticMatches, 178 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9451 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=720, Invalid=31500, Unknown=0, NotChecked=0, Total=32220 [2022-04-15 13:15:25,118 INFO L913 BasicCegarLoop]: 9 mSDtfsCounter, 141 mSDsluCounter, 392 mSDsCounter, 0 mSdLazyCounter, 15580 mSolverCounterSat, 166 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 401 SdHoareTripleChecker+Invalid, 15746 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 166 IncrementalHoareTripleChecker+Valid, 15580 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.7s IncrementalHoareTripleChecker+Time [2022-04-15 13:15:25,119 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [141 Valid, 401 Invalid, 15746 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [166 Valid, 15580 Invalid, 0 Unknown, 0 Unchecked, 10.7s Time] [2022-04-15 13:15:25,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2022-04-15 13:15:25,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 289. [2022-04-15 13:15:25,638 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:15:25,638 INFO L82 GeneralOperation]: Start isEquivalent. First operand 289 states. Second operand has 289 states, 285 states have (on average 1.0280701754385966) internal successors, (293), 285 states have internal predecessors, (293), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:15:25,639 INFO L74 IsIncluded]: Start isIncluded. First operand 289 states. Second operand has 289 states, 285 states have (on average 1.0280701754385966) internal successors, (293), 285 states have internal predecessors, (293), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:15:25,639 INFO L87 Difference]: Start difference. First operand 289 states. Second operand has 289 states, 285 states have (on average 1.0280701754385966) internal successors, (293), 285 states have internal predecessors, (293), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:15:25,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:15:25,645 INFO L93 Difference]: Finished difference Result 289 states and 296 transitions. [2022-04-15 13:15:25,645 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 296 transitions. [2022-04-15 13:15:25,645 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:15:25,645 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:15:25,646 INFO L74 IsIncluded]: Start isIncluded. First operand has 289 states, 285 states have (on average 1.0280701754385966) internal successors, (293), 285 states have internal predecessors, (293), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 289 states. [2022-04-15 13:15:25,646 INFO L87 Difference]: Start difference. First operand has 289 states, 285 states have (on average 1.0280701754385966) internal successors, (293), 285 states have internal predecessors, (293), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 289 states. [2022-04-15 13:15:25,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:15:25,652 INFO L93 Difference]: Finished difference Result 289 states and 296 transitions. [2022-04-15 13:15:25,652 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 296 transitions. [2022-04-15 13:15:25,652 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:15:25,652 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:15:25,652 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:15:25,652 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:15:25,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 289 states, 285 states have (on average 1.0280701754385966) internal successors, (293), 285 states have internal predecessors, (293), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:15:25,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 296 transitions. [2022-04-15 13:15:25,659 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 296 transitions. Word has length 195 [2022-04-15 13:15:25,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:15:25,659 INFO L478 AbstractCegarLoop]: Abstraction has 289 states and 296 transitions. [2022-04-15 13:15:25,660 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 92 states, 92 states have (on average 2.0869565217391304) internal successors, (192), 91 states have internal predecessors, (192), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:15:25,660 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 289 states and 296 transitions. [2022-04-15 13:15:26,061 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 296 edges. 296 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:15:26,061 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 296 transitions. [2022-04-15 13:15:26,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 289 [2022-04-15 13:15:26,064 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:15:26,064 INFO L499 BasicCegarLoop]: trace histogram [108, 108, 18, 18, 18, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 13:15:26,065 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-04-15 13:15:26,065 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:15:26,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:15:26,065 INFO L85 PathProgramCache]: Analyzing trace with hash -122323846, now seen corresponding path program 24 times [2022-04-15 13:15:26,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:15:26,065 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1258963428] [2022-04-15 13:15:27,167 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 13:15:27,169 INFO L85 PathProgramCache]: Analyzing trace with hash 1694799887, now seen corresponding path program 1 times [2022-04-15 13:15:27,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:15:27,169 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236524680] [2022-04-15 13:15:27,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:15:27,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:15:27,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:15:27,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 13:15:27,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:15:27,215 INFO L290 TraceCheckUtils]: 0: Hoare triple {14773#(and (= |#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); {14766#true} is VALID [2022-04-15 13:15:27,215 INFO L290 TraceCheckUtils]: 1: Hoare triple {14766#true} assume true; {14766#true} is VALID [2022-04-15 13:15:27,215 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {14766#true} {14766#true} #56#return; {14766#true} is VALID [2022-04-15 13:15:27,216 INFO L272 TraceCheckUtils]: 0: Hoare triple {14766#true} call ULTIMATE.init(); {14773#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 13:15:27,216 INFO L290 TraceCheckUtils]: 1: Hoare triple {14773#(and (= |#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); {14766#true} is VALID [2022-04-15 13:15:27,216 INFO L290 TraceCheckUtils]: 2: Hoare triple {14766#true} assume true; {14766#true} is VALID [2022-04-15 13:15:27,216 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14766#true} {14766#true} #56#return; {14766#true} is VALID [2022-04-15 13:15:27,216 INFO L272 TraceCheckUtils]: 4: Hoare triple {14766#true} call #t~ret7 := main(); {14766#true} is VALID [2022-04-15 13:15:27,216 INFO L290 TraceCheckUtils]: 5: Hoare triple {14766#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~a~0 := 0; {14771#(= main_~a~0 0)} is VALID [2022-04-15 13:15:27,217 INFO L290 TraceCheckUtils]: 6: Hoare triple {14771#(= main_~a~0 0)} [86] L21-3-->L21-4_primed: Formula: (or (= v_main_~a~0_In_20 v_main_~a~0_Out_50) (let ((.cse0 (* 6 v_main_~a~0_Out_50))) (and (= (* 6 |v_main_#t~pre6_Out_64|) 0) (= 6 v_main_~c~0_Out_68) (= .cse0 0) (= (* 6 |v_main_#t~pre5_Out_60|) 0) (= (* 6 v_main_~b~0_Out_62) (* 6 v_main_~c~0_Out_68)) (= 6 v_main_~b~0_Out_62) (= .cse0 (* 6 v_main_~a~0_In_20)) (< v_main_~a~0_Out_50 7)))) InVars {main_~a~0=v_main_~a~0_In_20} OutVars{main_~c~0=v_main_~c~0_Out_68, main_~b~0=v_main_~b~0_Out_62, main_#t~pre4=|v_main_#t~pre4_Out_50|, main_#t~pre5=|v_main_#t~pre5_Out_60|, main_~a~0=v_main_~a~0_Out_50, main_#t~pre6=|v_main_#t~pre6_Out_64|} AuxVars[] AssignedVars[main_~c~0, main_~b~0, main_#t~pre4, main_#t~pre5, main_~a~0, main_#t~pre6] {14772#(<= main_~a~0 0)} is VALID [2022-04-15 13:15:27,218 INFO L290 TraceCheckUtils]: 7: Hoare triple {14772#(<= main_~a~0 0)} [85] L21-4_primed-->L21-4: Formula: (not (< v_main_~a~0_5 6)) InVars {main_~a~0=v_main_~a~0_5} OutVars{main_~a~0=v_main_~a~0_5} AuxVars[] AssignedVars[] {14767#false} is VALID [2022-04-15 13:15:27,218 INFO L290 TraceCheckUtils]: 8: Hoare triple {14767#false} assume !((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0); {14767#false} is VALID [2022-04-15 13:15:27,218 INFO L290 TraceCheckUtils]: 9: Hoare triple {14767#false} assume !false; {14767#false} is VALID [2022-04-15 13:15:27,218 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 13:15:27,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:15:27,218 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1236524680] [2022-04-15 13:15:27,218 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1236524680] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:15:27,219 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:15:27,219 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 13:15:35,214 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:15:35,215 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1258963428] [2022-04-15 13:15:35,215 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1258963428] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:15:35,215 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:15:35,215 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [135] imperfect sequences [] total 135 [2022-04-15 13:15:35,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [458794134] [2022-04-15 13:15:35,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:15:35,216 INFO L78 Accepts]: Start accepts. Automaton has has 135 states, 135 states have (on average 2.111111111111111) internal successors, (285), 134 states have internal predecessors, (285), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 288 [2022-04-15 13:15:35,216 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:15:35,217 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 135 states, 135 states have (on average 2.111111111111111) internal successors, (285), 134 states have internal predecessors, (285), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:15:35,456 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 288 edges. 288 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:15:35,456 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 135 states [2022-04-15 13:15:35,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:15:35,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 135 interpolants. [2022-04-15 13:15:35,460 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=365, Invalid=17995, Unknown=0, NotChecked=0, Total=18360 [2022-04-15 13:15:35,460 INFO L87 Difference]: Start difference. First operand 289 states and 296 transitions. Second operand has 135 states, 135 states have (on average 2.111111111111111) internal successors, (285), 134 states have internal predecessors, (285), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:16:21,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:16:21,019 INFO L93 Difference]: Finished difference Result 478 states and 500 transitions. [2022-04-15 13:16:21,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 133 states. [2022-04-15 13:16:21,020 INFO L78 Accepts]: Start accepts. Automaton has has 135 states, 135 states have (on average 2.111111111111111) internal successors, (285), 134 states have internal predecessors, (285), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 288 [2022-04-15 13:16:21,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:16:21,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 135 states have (on average 2.111111111111111) internal successors, (285), 134 states have internal predecessors, (285), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:16:21,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 316 transitions. [2022-04-15 13:16:21,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 135 states have (on average 2.111111111111111) internal successors, (285), 134 states have internal predecessors, (285), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:16:21,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 316 transitions. [2022-04-15 13:16:21,027 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 133 states and 316 transitions. [2022-04-15 13:16:21,451 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 316 edges. 316 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:16:21,460 INFO L225 Difference]: With dead ends: 478 [2022-04-15 13:16:21,460 INFO L226 Difference]: Without dead ends: 382 [2022-04-15 13:16:21,468 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 418 GetRequests, 88 SyntacticMatches, 66 SemanticMatches, 264 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18972 ImplicationChecksByTransitivity, 12.8s TimeCoverageRelationStatistics Valid=978, Invalid=69512, Unknown=0, NotChecked=0, Total=70490 [2022-04-15 13:16:21,469 INFO L913 BasicCegarLoop]: 9 mSDtfsCounter, 191 mSDsluCounter, 467 mSDsCounter, 0 mSdLazyCounter, 29698 mSolverCounterSat, 217 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 22.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 SdHoareTripleChecker+Valid, 476 SdHoareTripleChecker+Invalid, 29915 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 217 IncrementalHoareTripleChecker+Valid, 29698 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 22.9s IncrementalHoareTripleChecker+Time [2022-04-15 13:16:21,469 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [191 Valid, 476 Invalid, 29915 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [217 Valid, 29698 Invalid, 0 Unknown, 0 Unchecked, 22.9s Time] [2022-04-15 13:16:21,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2022-04-15 13:16:22,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 382. [2022-04-15 13:16:22,233 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:16:22,234 INFO L82 GeneralOperation]: Start isEquivalent. First operand 382 states. Second operand has 382 states, 378 states have (on average 1.0211640211640212) internal successors, (386), 378 states have internal predecessors, (386), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:16:22,234 INFO L74 IsIncluded]: Start isIncluded. First operand 382 states. Second operand has 382 states, 378 states have (on average 1.0211640211640212) internal successors, (386), 378 states have internal predecessors, (386), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:16:22,235 INFO L87 Difference]: Start difference. First operand 382 states. Second operand has 382 states, 378 states have (on average 1.0211640211640212) internal successors, (386), 378 states have internal predecessors, (386), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:16:22,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:16:22,245 INFO L93 Difference]: Finished difference Result 382 states and 389 transitions. [2022-04-15 13:16:22,245 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 389 transitions. [2022-04-15 13:16:22,246 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:16:22,246 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:16:22,246 INFO L74 IsIncluded]: Start isIncluded. First operand has 382 states, 378 states have (on average 1.0211640211640212) internal successors, (386), 378 states have internal predecessors, (386), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 382 states. [2022-04-15 13:16:22,247 INFO L87 Difference]: Start difference. First operand has 382 states, 378 states have (on average 1.0211640211640212) internal successors, (386), 378 states have internal predecessors, (386), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 382 states. [2022-04-15 13:16:22,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:16:22,255 INFO L93 Difference]: Finished difference Result 382 states and 389 transitions. [2022-04-15 13:16:22,256 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 389 transitions. [2022-04-15 13:16:22,256 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:16:22,256 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:16:22,256 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:16:22,256 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:16:22,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 382 states, 378 states have (on average 1.0211640211640212) internal successors, (386), 378 states have internal predecessors, (386), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:16:22,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 389 transitions. [2022-04-15 13:16:22,269 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 389 transitions. Word has length 288 [2022-04-15 13:16:22,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:16:22,269 INFO L478 AbstractCegarLoop]: Abstraction has 382 states and 389 transitions. [2022-04-15 13:16:22,270 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 135 states, 135 states have (on average 2.111111111111111) internal successors, (285), 134 states have internal predecessors, (285), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:16:22,270 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 382 states and 389 transitions. [2022-04-15 13:16:22,853 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 389 edges. 389 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:16:22,853 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 389 transitions. [2022-04-15 13:16:22,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 382 [2022-04-15 13:16:22,859 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:16:22,859 INFO L499 BasicCegarLoop]: trace histogram [144, 144, 24, 24, 24, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 13:16:22,859 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-04-15 13:16:22,859 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:16:22,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:16:22,860 INFO L85 PathProgramCache]: Analyzing trace with hash 981708127, now seen corresponding path program 25 times [2022-04-15 13:16:22,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:16:22,860 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1357044246] [2022-04-15 13:16:24,028 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 13:16:24,029 INFO L85 PathProgramCache]: Analyzing trace with hash 1694861391, now seen corresponding path program 1 times [2022-04-15 13:16:24,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:16:24,030 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [414850664] [2022-04-15 13:16:24,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:16:24,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:16:24,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:16:24,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 13:16:24,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:16:24,062 INFO L290 TraceCheckUtils]: 0: Hoare triple {17658#(and (= |#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); {17651#true} is VALID [2022-04-15 13:16:24,063 INFO L290 TraceCheckUtils]: 1: Hoare triple {17651#true} assume true; {17651#true} is VALID [2022-04-15 13:16:24,063 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {17651#true} {17651#true} #56#return; {17651#true} is VALID [2022-04-15 13:16:24,063 INFO L272 TraceCheckUtils]: 0: Hoare triple {17651#true} call ULTIMATE.init(); {17658#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 13:16:24,063 INFO L290 TraceCheckUtils]: 1: Hoare triple {17658#(and (= |#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); {17651#true} is VALID [2022-04-15 13:16:24,063 INFO L290 TraceCheckUtils]: 2: Hoare triple {17651#true} assume true; {17651#true} is VALID [2022-04-15 13:16:24,063 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17651#true} {17651#true} #56#return; {17651#true} is VALID [2022-04-15 13:16:24,063 INFO L272 TraceCheckUtils]: 4: Hoare triple {17651#true} call #t~ret7 := main(); {17651#true} is VALID [2022-04-15 13:16:24,064 INFO L290 TraceCheckUtils]: 5: Hoare triple {17651#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~a~0 := 0; {17656#(= main_~a~0 0)} is VALID [2022-04-15 13:16:24,067 INFO L290 TraceCheckUtils]: 6: Hoare triple {17656#(= main_~a~0 0)} [88] L21-3-->L21-4_primed: Formula: (or (= v_main_~a~0_In_22 v_main_~a~0_Out_54) (let ((.cse0 (* 6 v_main_~a~0_Out_54))) (and (= 6 v_main_~c~0_Out_72) (= (* 6 v_main_~c~0_Out_72) (* 6 v_main_~b~0_Out_66)) (= (* 6 v_main_~a~0_In_22) .cse0) (= 6 v_main_~b~0_Out_66) (= .cse0 0) (= (* 6 |v_main_#t~pre6_Out_68|) 0) (< v_main_~a~0_Out_54 7) (= (* 6 |v_main_#t~pre5_Out_64|) 0)))) InVars {main_~a~0=v_main_~a~0_In_22} OutVars{main_~c~0=v_main_~c~0_Out_72, main_~b~0=v_main_~b~0_Out_66, main_#t~pre4=|v_main_#t~pre4_Out_54|, main_#t~pre5=|v_main_#t~pre5_Out_64|, main_~a~0=v_main_~a~0_Out_54, main_#t~pre6=|v_main_#t~pre6_Out_68|} AuxVars[] AssignedVars[main_~c~0, main_~b~0, main_#t~pre4, main_#t~pre5, main_~a~0, main_#t~pre6] {17657#(<= main_~a~0 0)} is VALID [2022-04-15 13:16:24,068 INFO L290 TraceCheckUtils]: 7: Hoare triple {17657#(<= main_~a~0 0)} [87] L21-4_primed-->L21-4: Formula: (not (< v_main_~a~0_5 6)) InVars {main_~a~0=v_main_~a~0_5} OutVars{main_~a~0=v_main_~a~0_5} AuxVars[] AssignedVars[] {17652#false} is VALID [2022-04-15 13:16:24,068 INFO L290 TraceCheckUtils]: 8: Hoare triple {17652#false} assume !((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0); {17652#false} is VALID [2022-04-15 13:16:24,068 INFO L290 TraceCheckUtils]: 9: Hoare triple {17652#false} assume !false; {17652#false} is VALID [2022-04-15 13:16:24,068 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 13:16:24,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:16:24,068 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [414850664] [2022-04-15 13:16:24,068 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [414850664] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:16:24,068 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:16:24,068 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 13:16:38,455 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:16:38,455 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1357044246] [2022-04-15 13:16:38,455 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1357044246] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:16:38,455 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:16:38,455 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [178] imperfect sequences [] total 178 [2022-04-15 13:16:38,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [355960576] [2022-04-15 13:16:38,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:16:38,457 INFO L78 Accepts]: Start accepts. Automaton has has 178 states, 178 states have (on average 2.1235955056179776) internal successors, (378), 177 states have internal predecessors, (378), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 381 [2022-04-15 13:16:38,457 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:16:38,457 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 178 states, 178 states have (on average 2.1235955056179776) internal successors, (378), 177 states have internal predecessors, (378), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:16:38,892 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 381 edges. 381 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:16:38,893 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 178 states [2022-04-15 13:16:38,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:16:38,893 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 178 interpolants. [2022-04-15 13:16:38,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=451, Invalid=31411, Unknown=0, NotChecked=0, Total=31862 [2022-04-15 13:16:38,897 INFO L87 Difference]: Start difference. First operand 382 states and 389 transitions. Second operand has 178 states, 178 states have (on average 2.1235955056179776) internal successors, (378), 177 states have internal predecessors, (378), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:18:34,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:18:34,193 INFO L93 Difference]: Finished difference Result 571 states and 593 transitions. [2022-04-15 13:18:34,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 176 states. [2022-04-15 13:18:34,194 INFO L78 Accepts]: Start accepts. Automaton has has 178 states, 178 states have (on average 2.1235955056179776) internal successors, (378), 177 states have internal predecessors, (378), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 381 [2022-04-15 13:18:34,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:18:34,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 178 states have (on average 2.1235955056179776) internal successors, (378), 177 states have internal predecessors, (378), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:18:34,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 409 transitions. [2022-04-15 13:18:34,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 178 states have (on average 2.1235955056179776) internal successors, (378), 177 states have internal predecessors, (378), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:18:34,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 409 transitions. [2022-04-15 13:18:34,205 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 176 states and 409 transitions. [2022-04-15 13:18:35,349 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 409 edges. 409 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:18:35,367 INFO L225 Difference]: With dead ends: 571 [2022-04-15 13:18:35,367 INFO L226 Difference]: Without dead ends: 475 [2022-04-15 13:18:35,379 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 554 GetRequests, 106 SyntacticMatches, 98 SemanticMatches, 350 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30652 ImplicationChecksByTransitivity, 23.8s TimeCoverageRelationStatistics Valid=1236, Invalid=122316, Unknown=0, NotChecked=0, Total=123552 [2022-04-15 13:18:35,379 INFO L913 BasicCegarLoop]: 9 mSDtfsCounter, 234 mSDsluCounter, 762 mSDsCounter, 0 mSdLazyCounter, 59336 mSolverCounterSat, 267 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 62.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 234 SdHoareTripleChecker+Valid, 771 SdHoareTripleChecker+Invalid, 59603 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 267 IncrementalHoareTripleChecker+Valid, 59336 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 62.3s IncrementalHoareTripleChecker+Time [2022-04-15 13:18:35,380 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [234 Valid, 771 Invalid, 59603 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [267 Valid, 59336 Invalid, 0 Unknown, 0 Unchecked, 62.3s Time] [2022-04-15 13:18:35,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 475 states. [2022-04-15 13:18:36,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 475 to 475. [2022-04-15 13:18:36,376 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:18:36,379 INFO L82 GeneralOperation]: Start isEquivalent. First operand 475 states. Second operand has 475 states, 471 states have (on average 1.0169851380042463) internal successors, (479), 471 states have internal predecessors, (479), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:18:36,380 INFO L74 IsIncluded]: Start isIncluded. First operand 475 states. Second operand has 475 states, 471 states have (on average 1.0169851380042463) internal successors, (479), 471 states have internal predecessors, (479), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:18:36,380 INFO L87 Difference]: Start difference. First operand 475 states. Second operand has 475 states, 471 states have (on average 1.0169851380042463) internal successors, (479), 471 states have internal predecessors, (479), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:18:36,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:18:36,394 INFO L93 Difference]: Finished difference Result 475 states and 482 transitions. [2022-04-15 13:18:36,394 INFO L276 IsEmpty]: Start isEmpty. Operand 475 states and 482 transitions. [2022-04-15 13:18:36,395 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:18:36,395 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:18:36,396 INFO L74 IsIncluded]: Start isIncluded. First operand has 475 states, 471 states have (on average 1.0169851380042463) internal successors, (479), 471 states have internal predecessors, (479), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 475 states. [2022-04-15 13:18:36,397 INFO L87 Difference]: Start difference. First operand has 475 states, 471 states have (on average 1.0169851380042463) internal successors, (479), 471 states have internal predecessors, (479), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 475 states. [2022-04-15 13:18:36,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:18:36,409 INFO L93 Difference]: Finished difference Result 475 states and 482 transitions. [2022-04-15 13:18:36,409 INFO L276 IsEmpty]: Start isEmpty. Operand 475 states and 482 transitions. [2022-04-15 13:18:36,410 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:18:36,410 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:18:36,410 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:18:36,410 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:18:36,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 475 states, 471 states have (on average 1.0169851380042463) internal successors, (479), 471 states have internal predecessors, (479), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:18:36,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 475 states to 475 states and 482 transitions. [2022-04-15 13:18:36,436 INFO L78 Accepts]: Start accepts. Automaton has 475 states and 482 transitions. Word has length 381 [2022-04-15 13:18:36,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:18:36,436 INFO L478 AbstractCegarLoop]: Abstraction has 475 states and 482 transitions. [2022-04-15 13:18:36,436 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 178 states, 178 states have (on average 2.1235955056179776) internal successors, (378), 177 states have internal predecessors, (378), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:18:36,437 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 475 states and 482 transitions. [2022-04-15 13:18:37,639 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 482 edges. 482 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:18:37,639 INFO L276 IsEmpty]: Start isEmpty. Operand 475 states and 482 transitions. [2022-04-15 13:18:37,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 475 [2022-04-15 13:18:37,649 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:18:37,649 INFO L499 BasicCegarLoop]: trace histogram [180, 180, 30, 30, 30, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 13:18:37,649 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-04-15 13:18:37,649 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:18:37,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:18:37,650 INFO L85 PathProgramCache]: Analyzing trace with hash 68266650, now seen corresponding path program 26 times [2022-04-15 13:18:37,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:18:37,650 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1070983467] [2022-04-15 13:18:39,098 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 13:18:39,100 INFO L85 PathProgramCache]: Analyzing trace with hash 1694922895, now seen corresponding path program 1 times [2022-04-15 13:18:39,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:18:39,100 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [45750104] [2022-04-15 13:18:39,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:18:39,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:18:39,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:18:39,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 13:18:39,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:18:39,147 INFO L290 TraceCheckUtils]: 0: Hoare triple {21230#(and (= |#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); {21223#true} is VALID [2022-04-15 13:18:39,147 INFO L290 TraceCheckUtils]: 1: Hoare triple {21223#true} assume true; {21223#true} is VALID [2022-04-15 13:18:39,148 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {21223#true} {21223#true} #56#return; {21223#true} is VALID [2022-04-15 13:18:39,148 INFO L272 TraceCheckUtils]: 0: Hoare triple {21223#true} call ULTIMATE.init(); {21230#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 13:18:39,148 INFO L290 TraceCheckUtils]: 1: Hoare triple {21230#(and (= |#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); {21223#true} is VALID [2022-04-15 13:18:39,148 INFO L290 TraceCheckUtils]: 2: Hoare triple {21223#true} assume true; {21223#true} is VALID [2022-04-15 13:18:39,148 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21223#true} {21223#true} #56#return; {21223#true} is VALID [2022-04-15 13:18:39,149 INFO L272 TraceCheckUtils]: 4: Hoare triple {21223#true} call #t~ret7 := main(); {21223#true} is VALID [2022-04-15 13:18:39,149 INFO L290 TraceCheckUtils]: 5: Hoare triple {21223#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~a~0 := 0; {21228#(= main_~a~0 0)} is VALID [2022-04-15 13:18:39,150 INFO L290 TraceCheckUtils]: 6: Hoare triple {21228#(= main_~a~0 0)} [90] L21-3-->L21-4_primed: Formula: (or (let ((.cse0 (* 6 v_main_~a~0_Out_58))) (and (= 6 v_main_~b~0_Out_70) (= (* 6 |v_main_#t~pre5_Out_68|) 0) (= (* 6 v_main_~a~0_In_24) .cse0) (< v_main_~a~0_Out_58 7) (= .cse0 0) (= (* 6 |v_main_#t~pre6_Out_72|) 0) (= 6 v_main_~c~0_Out_76) (= (* 6 v_main_~b~0_Out_70) (* 6 v_main_~c~0_Out_76)))) (= v_main_~a~0_In_24 v_main_~a~0_Out_58)) InVars {main_~a~0=v_main_~a~0_In_24} OutVars{main_~c~0=v_main_~c~0_Out_76, main_~b~0=v_main_~b~0_Out_70, main_#t~pre4=|v_main_#t~pre4_Out_58|, main_#t~pre5=|v_main_#t~pre5_Out_68|, main_~a~0=v_main_~a~0_Out_58, main_#t~pre6=|v_main_#t~pre6_Out_72|} AuxVars[] AssignedVars[main_~c~0, main_~b~0, main_#t~pre4, main_#t~pre5, main_~a~0, main_#t~pre6] {21229#(<= main_~a~0 0)} is VALID [2022-04-15 13:18:39,151 INFO L290 TraceCheckUtils]: 7: Hoare triple {21229#(<= main_~a~0 0)} [89] L21-4_primed-->L21-4: Formula: (not (< v_main_~a~0_5 6)) InVars {main_~a~0=v_main_~a~0_5} OutVars{main_~a~0=v_main_~a~0_5} AuxVars[] AssignedVars[] {21224#false} is VALID [2022-04-15 13:18:39,151 INFO L290 TraceCheckUtils]: 8: Hoare triple {21224#false} assume !((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0); {21224#false} is VALID [2022-04-15 13:18:39,151 INFO L290 TraceCheckUtils]: 9: Hoare triple {21224#false} assume !false; {21224#false} is VALID [2022-04-15 13:18:39,151 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 13:18:39,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:18:39,151 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [45750104] [2022-04-15 13:18:39,151 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [45750104] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:18:39,151 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:18:39,151 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 13:19:01,316 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:19:01,317 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1070983467] [2022-04-15 13:19:01,317 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1070983467] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:19:01,317 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:19:01,317 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [221] imperfect sequences [] total 221 [2022-04-15 13:19:01,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1887459713] [2022-04-15 13:19:01,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:19:01,318 INFO L78 Accepts]: Start accepts. Automaton has has 221 states, 221 states have (on average 2.1312217194570136) internal successors, (471), 220 states have internal predecessors, (471), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 474 [2022-04-15 13:19:01,319 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:19:01,319 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 221 states, 221 states have (on average 2.1312217194570136) internal successors, (471), 220 states have internal predecessors, (471), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:19:02,113 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 474 edges. 474 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:19:02,113 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 221 states [2022-04-15 13:19:02,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:19:02,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 221 interpolants. [2022-04-15 13:19:02,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=537, Invalid=48525, Unknown=0, NotChecked=0, Total=49062 [2022-04-15 13:19:02,116 INFO L87 Difference]: Start difference. First operand 475 states and 482 transitions. Second operand has 221 states, 221 states have (on average 2.1312217194570136) internal successors, (471), 220 states have internal predecessors, (471), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)