/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-34549b5 [2022-04-08 10:32:33,983 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-08 10:32:33,984 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-08 10:32:34,022 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-08 10:32:34,022 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-08 10:32:34,023 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-08 10:32:34,025 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-08 10:32:34,027 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-08 10:32:34,029 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-08 10:32:34,033 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-08 10:32:34,033 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-08 10:32:34,034 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-08 10:32:34,034 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-08 10:32:34,034 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-08 10:32:34,035 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-08 10:32:34,036 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-08 10:32:34,036 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-08 10:32:34,036 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-08 10:32:34,037 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-08 10:32:34,038 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-08 10:32:34,039 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-08 10:32:34,041 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-08 10:32:34,042 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-08 10:32:34,045 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-08 10:32:34,046 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-08 10:32:34,051 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-08 10:32:34,052 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-08 10:32:34,052 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-08 10:32:34,052 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-08 10:32:34,053 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-08 10:32:34,053 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-08 10:32:34,054 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-08 10:32:34,055 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-08 10:32:34,055 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-08 10:32:34,055 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-08 10:32:34,056 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-08 10:32:34,056 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-08 10:32:34,057 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-08 10:32:34,057 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-08 10:32:34,057 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-08 10:32:34,057 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-08 10:32:34,059 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-08 10:32:34,059 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-04-08 10:32:34,069 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-08 10:32:34,070 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-08 10:32:34,070 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-08 10:32:34,070 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-08 10:32:34,070 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-08 10:32:34,071 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-08 10:32:34,071 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-08 10:32:34,071 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-08 10:32:34,071 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-08 10:32:34,071 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-08 10:32:34,072 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-08 10:32:34,072 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-08 10:32:34,072 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-08 10:32:34,072 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-08 10:32:34,072 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-08 10:32:34,072 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 10:32:34,072 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-08 10:32:34,072 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-08 10:32:34,072 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-08 10:32:34,072 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-08 10:32:34,072 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-08 10:32:34,072 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-08 10:32:34,073 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-08 10:32:34,235 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-08 10:32:34,255 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-08 10:32:34,257 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-08 10:32:34,257 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-08 10:32:34,258 INFO L275 PluginConnector]: CDTParser initialized [2022-04-08 10:32:34,258 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-08 10:32:34,307 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a6ef94559/e9affef3102b47c4968ed949b5028966/FLAG886e520ed [2022-04-08 10:32:34,662 INFO L306 CDTParser]: Found 1 translation units. [2022-04-08 10:32:34,662 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-simple/nested_3.c [2022-04-08 10:32:34,666 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a6ef94559/e9affef3102b47c4968ed949b5028966/FLAG886e520ed [2022-04-08 10:32:35,094 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a6ef94559/e9affef3102b47c4968ed949b5028966 [2022-04-08 10:32:35,096 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-08 10:32:35,096 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-08 10:32:35,098 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-08 10:32:35,098 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-08 10:32:35,100 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-08 10:32:35,100 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 10:32:35" (1/1) ... [2022-04-08 10:32:35,101 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3dbe49b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 10:32:35, skipping insertion in model container [2022-04-08 10:32:35,101 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 10:32:35" (1/1) ... [2022-04-08 10:32:35,105 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-08 10:32:35,112 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-08 10:32:35,220 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-08 10:32:35,222 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 10:32:35,227 INFO L203 MainTranslator]: Completed pre-run [2022-04-08 10:32:35,236 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-08 10:32:35,236 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 10:32:35,244 INFO L208 MainTranslator]: Completed translation [2022-04-08 10:32:35,244 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 10:32:35 WrapperNode [2022-04-08 10:32:35,244 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-08 10:32:35,245 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-08 10:32:35,245 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-08 10:32:35,245 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-08 10:32:35,251 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 10:32:35" (1/1) ... [2022-04-08 10:32:35,251 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 10:32:35" (1/1) ... [2022-04-08 10:32:35,254 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 10:32:35" (1/1) ... [2022-04-08 10:32:35,255 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 10:32:35" (1/1) ... [2022-04-08 10:32:35,258 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 10:32:35" (1/1) ... [2022-04-08 10:32:35,261 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 10:32:35" (1/1) ... [2022-04-08 10:32:35,261 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 10:32:35" (1/1) ... [2022-04-08 10:32:35,262 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-08 10:32:35,263 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-08 10:32:35,263 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-08 10:32:35,263 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-08 10:32:35,267 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 10:32:35" (1/1) ... [2022-04-08 10:32:35,272 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 10:32:35,278 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:32:35,286 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-08 10:32:35,291 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-08 10:32:35,313 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-08 10:32:35,314 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-08 10:32:35,314 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-08 10:32:35,314 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-08 10:32:35,314 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-08 10:32:35,315 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-08 10:32:35,315 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-08 10:32:35,315 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-08 10:32:35,315 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-08 10:32:35,315 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-08 10:32:35,315 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-08 10:32:35,315 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-08 10:32:35,316 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-08 10:32:35,316 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-08 10:32:35,357 INFO L234 CfgBuilder]: Building ICFG [2022-04-08 10:32:35,358 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-08 10:32:35,493 INFO L275 CfgBuilder]: Performing block encoding [2022-04-08 10:32:35,508 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-08 10:32:35,508 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-04-08 10:32:35,509 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 10:32:35 BoogieIcfgContainer [2022-04-08 10:32:35,509 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-08 10:32:35,510 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-08 10:32:35,511 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-08 10:32:35,513 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-08 10:32:35,513 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.04 10:32:35" (1/3) ... [2022-04-08 10:32:35,513 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e008602 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 10:32:35, skipping insertion in model container [2022-04-08 10:32:35,513 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 10:32:35" (2/3) ... [2022-04-08 10:32:35,513 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e008602 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 10:32:35, skipping insertion in model container [2022-04-08 10:32:35,514 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 10:32:35" (3/3) ... [2022-04-08 10:32:35,514 INFO L111 eAbstractionObserver]: Analyzing ICFG nested_3.c [2022-04-08 10:32:35,517 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-08 10:32:35,517 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-08 10:32:35,573 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-08 10:32:35,577 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-08 10:32:35,577 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-08 10:32:35,603 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-08 10:32:35,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-04-08 10:32:35,608 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:32:35,609 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:32:35,610 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:32:35,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:32:35,616 INFO L85 PathProgramCache]: Analyzing trace with hash -1607939523, now seen corresponding path program 1 times [2022-04-08 10:32:35,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:32:35,622 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1553746854] [2022-04-08 10:32:35,630 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 10:32:35,630 INFO L85 PathProgramCache]: Analyzing trace with hash -1607939523, now seen corresponding path program 2 times [2022-04-08 10:32:35,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:32:35,633 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1349087399] [2022-04-08 10:32:35,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:32:35,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:32:35,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:32:35,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:32:35,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:32:35,789 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-08 10:32:35,789 INFO L290 TraceCheckUtils]: 1: Hoare triple {23#true} assume true; {23#true} is VALID [2022-04-08 10:32:35,790 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {23#true} {23#true} #56#return; {23#true} is VALID [2022-04-08 10:32:35,793 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-08 10:32:35,793 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-08 10:32:35,793 INFO L290 TraceCheckUtils]: 2: Hoare triple {23#true} assume true; {23#true} is VALID [2022-04-08 10:32:35,793 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23#true} {23#true} #56#return; {23#true} is VALID [2022-04-08 10:32:35,793 INFO L272 TraceCheckUtils]: 4: Hoare triple {23#true} call #t~ret7 := main(); {23#true} is VALID [2022-04-08 10:32:35,794 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-08 10:32:35,794 INFO L290 TraceCheckUtils]: 6: Hoare triple {23#true} assume !true; {24#false} is VALID [2022-04-08 10:32:35,795 INFO L290 TraceCheckUtils]: 7: Hoare triple {24#false} assume !((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0); {24#false} is VALID [2022-04-08 10:32:35,795 INFO L290 TraceCheckUtils]: 8: Hoare triple {24#false} assume !false; {24#false} is VALID [2022-04-08 10:32:35,795 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-08 10:32:35,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:32:35,796 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1349087399] [2022-04-08 10:32:35,797 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1349087399] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:32:35,797 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:32:35,797 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-08 10:32:35,800 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:32:35,800 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1553746854] [2022-04-08 10:32:35,801 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1553746854] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:32:35,801 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:32:35,801 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-08 10:32:35,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [115188169] [2022-04-08 10:32:35,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:32:35,805 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-08 10:32:35,806 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:32:35,808 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-08 10:32:35,823 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-08 10:32:35,823 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-08 10:32:35,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:32:35,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-08 10:32:35,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-08 10:32:35,842 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-08 10:32:35,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:32:35,906 INFO L93 Difference]: Finished difference Result 34 states and 46 transitions. [2022-04-08 10:32:35,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-08 10:32:35,907 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-08 10:32:35,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:32:35,908 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-08 10:32:35,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 46 transitions. [2022-04-08 10:32:35,917 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-08 10:32:35,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 46 transitions. [2022-04-08 10:32:35,921 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 46 transitions. [2022-04-08 10:32:35,984 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-08 10:32:35,989 INFO L225 Difference]: With dead ends: 34 [2022-04-08 10:32:35,989 INFO L226 Difference]: Without dead ends: 15 [2022-04-08 10:32:35,990 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-08 10:32:35,992 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-08 10:32:35,993 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-08 10:32:36,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2022-04-08 10:32:36,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2022-04-08 10:32:36,034 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:32:36,035 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-08 10:32:36,035 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-08 10:32:36,036 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-08 10:32:36,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:32:36,040 INFO L93 Difference]: Finished difference Result 15 states and 17 transitions. [2022-04-08 10:32:36,040 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 17 transitions. [2022-04-08 10:32:36,040 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:32:36,040 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:32:36,041 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-08 10:32:36,041 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-08 10:32:36,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:32:36,042 INFO L93 Difference]: Finished difference Result 15 states and 17 transitions. [2022-04-08 10:32:36,042 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 17 transitions. [2022-04-08 10:32:36,043 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:32:36,043 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:32:36,043 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:32:36,043 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:32:36,043 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-08 10:32:36,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 17 transitions. [2022-04-08 10:32:36,045 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 17 transitions. Word has length 9 [2022-04-08 10:32:36,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:32:36,045 INFO L478 AbstractCegarLoop]: Abstraction has 15 states and 17 transitions. [2022-04-08 10:32:36,045 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-08 10:32:36,045 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 17 transitions. [2022-04-08 10:32:36,067 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-08 10:32:36,068 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 17 transitions. [2022-04-08 10:32:36,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-04-08 10:32:36,068 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:32:36,068 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:32:36,069 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-08 10:32:36,070 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:32:36,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:32:36,072 INFO L85 PathProgramCache]: Analyzing trace with hash -1607968353, now seen corresponding path program 1 times [2022-04-08 10:32:36,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:32:36,072 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [918943312] [2022-04-08 10:32:36,073 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 10:32:36,073 INFO L85 PathProgramCache]: Analyzing trace with hash -1607968353, now seen corresponding path program 2 times [2022-04-08 10:32:36,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:32:36,073 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [331369814] [2022-04-08 10:32:36,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:32:36,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:32:36,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:32:36,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:32:36,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:32:36,121 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-08 10:32:36,122 INFO L290 TraceCheckUtils]: 1: Hoare triple {159#true} assume true; {159#true} is VALID [2022-04-08 10:32:36,122 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {159#true} {159#true} #56#return; {159#true} is VALID [2022-04-08 10:32:36,122 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-08 10:32:36,123 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-08 10:32:36,123 INFO L290 TraceCheckUtils]: 2: Hoare triple {159#true} assume true; {159#true} is VALID [2022-04-08 10:32:36,123 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {159#true} {159#true} #56#return; {159#true} is VALID [2022-04-08 10:32:36,123 INFO L272 TraceCheckUtils]: 4: Hoare triple {159#true} call #t~ret7 := main(); {159#true} is VALID [2022-04-08 10:32:36,124 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-08 10:32:36,124 INFO L290 TraceCheckUtils]: 6: Hoare triple {164#(= main_~a~0 0)} assume !(~a~0 < 6); {160#false} is VALID [2022-04-08 10:32:36,124 INFO L290 TraceCheckUtils]: 7: Hoare triple {160#false} assume !((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0); {160#false} is VALID [2022-04-08 10:32:36,124 INFO L290 TraceCheckUtils]: 8: Hoare triple {160#false} assume !false; {160#false} is VALID [2022-04-08 10:32:36,125 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-08 10:32:36,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:32:36,125 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [331369814] [2022-04-08 10:32:36,125 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [331369814] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:32:36,125 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:32:36,125 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 10:32:36,125 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:32:36,126 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [918943312] [2022-04-08 10:32:36,126 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [918943312] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:32:36,126 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:32:36,126 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 10:32:36,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1294645853] [2022-04-08 10:32:36,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:32:36,127 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-08 10:32:36,127 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:32:36,127 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-08 10:32:36,134 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-08 10:32:36,134 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 10:32:36,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:32:36,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 10:32:36,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 10:32:36,135 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-08 10:32:36,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:32:36,205 INFO L93 Difference]: Finished difference Result 24 states and 28 transitions. [2022-04-08 10:32:36,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 10:32:36,206 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-08 10:32:36,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:32:36,206 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-08 10:32:36,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 28 transitions. [2022-04-08 10:32:36,207 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-08 10:32:36,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 28 transitions. [2022-04-08 10:32:36,208 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 28 transitions. [2022-04-08 10:32:36,230 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-08 10:32:36,231 INFO L225 Difference]: With dead ends: 24 [2022-04-08 10:32:36,231 INFO L226 Difference]: Without dead ends: 21 [2022-04-08 10:32:36,232 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-08 10:32:36,232 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-08 10:32:36,233 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-08 10:32:36,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2022-04-08 10:32:36,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 16. [2022-04-08 10:32:36,236 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:32:36,236 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-08 10:32:36,246 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-08 10:32:36,246 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-08 10:32:36,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:32:36,251 INFO L93 Difference]: Finished difference Result 21 states and 25 transitions. [2022-04-08 10:32:36,251 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2022-04-08 10:32:36,252 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:32:36,252 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:32:36,253 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-08 10:32:36,253 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-08 10:32:36,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:32:36,257 INFO L93 Difference]: Finished difference Result 21 states and 25 transitions. [2022-04-08 10:32:36,257 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2022-04-08 10:32:36,258 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:32:36,258 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:32:36,258 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:32:36,258 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:32:36,258 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-08 10:32:36,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 18 transitions. [2022-04-08 10:32:36,260 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 18 transitions. Word has length 9 [2022-04-08 10:32:36,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:32:36,261 INFO L478 AbstractCegarLoop]: Abstraction has 16 states and 18 transitions. [2022-04-08 10:32:36,261 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-08 10:32:36,261 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 18 transitions. [2022-04-08 10:32:36,277 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-08 10:32:36,277 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 18 transitions. [2022-04-08 10:32:36,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-08 10:32:36,278 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:32:36,278 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:32:36,278 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-08 10:32:36,278 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:32:36,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:32:36,279 INFO L85 PathProgramCache]: Analyzing trace with hash -1181899718, now seen corresponding path program 1 times [2022-04-08 10:32:36,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:32:36,279 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [922606712] [2022-04-08 10:32:36,291 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:32:36,291 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:32:36,291 INFO L85 PathProgramCache]: Analyzing trace with hash -1181899718, now seen corresponding path program 2 times [2022-04-08 10:32:36,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:32:36,292 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1947915004] [2022-04-08 10:32:36,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:32:36,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:32:36,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:32:36,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:32:36,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:32:36,328 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-08 10:32:36,328 INFO L290 TraceCheckUtils]: 1: Hoare triple {292#true} assume true; {292#true} is VALID [2022-04-08 10:32:36,328 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {292#true} {292#true} #56#return; {292#true} is VALID [2022-04-08 10:32:36,329 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-08 10:32:36,329 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-08 10:32:36,329 INFO L290 TraceCheckUtils]: 2: Hoare triple {292#true} assume true; {292#true} is VALID [2022-04-08 10:32:36,329 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {292#true} {292#true} #56#return; {292#true} is VALID [2022-04-08 10:32:36,330 INFO L272 TraceCheckUtils]: 4: Hoare triple {292#true} call #t~ret7 := main(); {292#true} is VALID [2022-04-08 10:32:36,330 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-08 10:32:36,330 INFO L290 TraceCheckUtils]: 6: Hoare triple {292#true} assume !!(~a~0 < 6);~b~0 := 0; {297#(= main_~b~0 0)} is VALID [2022-04-08 10:32:36,331 INFO L290 TraceCheckUtils]: 7: Hoare triple {297#(= main_~b~0 0)} assume !(~b~0 < 6); {293#false} is VALID [2022-04-08 10:32:36,331 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-08 10:32:36,331 INFO L290 TraceCheckUtils]: 9: Hoare triple {293#false} assume !(~a~0 < 6); {293#false} is VALID [2022-04-08 10:32:36,331 INFO L290 TraceCheckUtils]: 10: Hoare triple {293#false} assume !((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0); {293#false} is VALID [2022-04-08 10:32:36,331 INFO L290 TraceCheckUtils]: 11: Hoare triple {293#false} assume !false; {293#false} is VALID [2022-04-08 10:32:36,331 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-08 10:32:36,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:32:36,332 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1947915004] [2022-04-08 10:32:36,332 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1947915004] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:32:36,332 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:32:36,332 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 10:32:36,332 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:32:36,332 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [922606712] [2022-04-08 10:32:36,332 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [922606712] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:32:36,332 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:32:36,333 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 10:32:36,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1558628372] [2022-04-08 10:32:36,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:32:36,333 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-08 10:32:36,333 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:32:36,333 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-08 10:32:36,341 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-08 10:32:36,341 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 10:32:36,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:32:36,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 10:32:36,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 10:32:36,342 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-08 10:32:36,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:32:36,403 INFO L93 Difference]: Finished difference Result 29 states and 35 transitions. [2022-04-08 10:32:36,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 10:32:36,408 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-08 10:32:36,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:32:36,408 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-08 10:32:36,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 34 transitions. [2022-04-08 10:32:36,411 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-08 10:32:36,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 34 transitions. [2022-04-08 10:32:36,412 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 34 transitions. [2022-04-08 10:32:36,439 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-08 10:32:36,440 INFO L225 Difference]: With dead ends: 29 [2022-04-08 10:32:36,440 INFO L226 Difference]: Without dead ends: 20 [2022-04-08 10:32:36,441 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-08 10:32:36,443 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-08 10:32:36,447 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-08 10:32:36,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2022-04-08 10:32:36,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 17. [2022-04-08 10:32:36,457 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:32:36,457 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-08 10:32:36,458 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-08 10:32:36,459 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-08 10:32:36,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:32:36,460 INFO L93 Difference]: Finished difference Result 20 states and 23 transitions. [2022-04-08 10:32:36,460 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2022-04-08 10:32:36,461 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:32:36,461 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:32:36,461 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-08 10:32:36,461 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-08 10:32:36,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:32:36,463 INFO L93 Difference]: Finished difference Result 20 states and 23 transitions. [2022-04-08 10:32:36,463 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2022-04-08 10:32:36,463 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:32:36,463 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:32:36,463 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:32:36,463 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:32:36,463 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-08 10:32:36,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2022-04-08 10:32:36,468 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 12 [2022-04-08 10:32:36,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:32:36,468 INFO L478 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2022-04-08 10:32:36,469 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-08 10:32:36,469 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 19 transitions. [2022-04-08 10:32:36,485 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-08 10:32:36,485 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2022-04-08 10:32:36,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-08 10:32:36,486 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:32:36,486 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:32:36,486 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-08 10:32:36,487 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:32:36,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:32:36,488 INFO L85 PathProgramCache]: Analyzing trace with hash -2039168997, now seen corresponding path program 1 times [2022-04-08 10:32:36,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:32:36,491 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [821445974] [2022-04-08 10:32:36,499 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:32:36,510 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:32:36,510 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:32:36,510 INFO L85 PathProgramCache]: Analyzing trace with hash -2039168997, now seen corresponding path program 2 times [2022-04-08 10:32:36,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:32:36,510 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [673083721] [2022-04-08 10:32:36,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:32:36,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:32:36,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:32:36,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:32:36,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:32:36,548 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-08 10:32:36,548 INFO L290 TraceCheckUtils]: 1: Hoare triple {435#true} assume true; {435#true} is VALID [2022-04-08 10:32:36,548 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {435#true} {435#true} #56#return; {435#true} is VALID [2022-04-08 10:32:36,549 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-08 10:32:36,549 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-08 10:32:36,549 INFO L290 TraceCheckUtils]: 2: Hoare triple {435#true} assume true; {435#true} is VALID [2022-04-08 10:32:36,549 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {435#true} {435#true} #56#return; {435#true} is VALID [2022-04-08 10:32:36,549 INFO L272 TraceCheckUtils]: 4: Hoare triple {435#true} call #t~ret7 := main(); {435#true} is VALID [2022-04-08 10:32:36,549 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-08 10:32:36,549 INFO L290 TraceCheckUtils]: 6: Hoare triple {435#true} assume !!(~a~0 < 6);~b~0 := 0; {435#true} is VALID [2022-04-08 10:32:36,550 INFO L290 TraceCheckUtils]: 7: Hoare triple {435#true} assume !!(~b~0 < 6);~c~0 := 0; {440#(= main_~c~0 0)} is VALID [2022-04-08 10:32:36,550 INFO L290 TraceCheckUtils]: 8: Hoare triple {440#(= main_~c~0 0)} assume !(~c~0 < 6); {436#false} is VALID [2022-04-08 10:32:36,550 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-08 10:32:36,550 INFO L290 TraceCheckUtils]: 10: Hoare triple {436#false} assume !(~b~0 < 6); {436#false} is VALID [2022-04-08 10:32:36,551 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-08 10:32:36,551 INFO L290 TraceCheckUtils]: 12: Hoare triple {436#false} assume !(~a~0 < 6); {436#false} is VALID [2022-04-08 10:32:36,551 INFO L290 TraceCheckUtils]: 13: Hoare triple {436#false} assume !((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0); {436#false} is VALID [2022-04-08 10:32:36,551 INFO L290 TraceCheckUtils]: 14: Hoare triple {436#false} assume !false; {436#false} is VALID [2022-04-08 10:32:36,551 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-08 10:32:36,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:32:36,551 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [673083721] [2022-04-08 10:32:36,551 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [673083721] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:32:36,552 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:32:36,552 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 10:32:36,552 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:32:36,552 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [821445974] [2022-04-08 10:32:36,552 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [821445974] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:32:36,552 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:32:36,552 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 10:32:36,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1225752370] [2022-04-08 10:32:36,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:32:36,553 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-08 10:32:36,553 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:32:36,553 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-08 10:32:36,563 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-08 10:32:36,563 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 10:32:36,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:32:36,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 10:32:36,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 10:32:36,564 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-08 10:32:36,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:32:36,619 INFO L93 Difference]: Finished difference Result 29 states and 34 transitions. [2022-04-08 10:32:36,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 10:32:36,620 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-08 10:32:36,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:32:36,620 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-08 10:32:36,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 31 transitions. [2022-04-08 10:32:36,621 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-08 10:32:36,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 31 transitions. [2022-04-08 10:32:36,622 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 31 transitions. [2022-04-08 10:32:36,642 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-08 10:32:36,643 INFO L225 Difference]: With dead ends: 29 [2022-04-08 10:32:36,643 INFO L226 Difference]: Without dead ends: 19 [2022-04-08 10:32:36,643 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-08 10:32:36,644 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-08 10:32:36,644 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-08 10:32:36,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2022-04-08 10:32:36,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 18. [2022-04-08 10:32:36,647 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:32:36,647 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-08 10:32:36,648 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-08 10:32:36,648 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-08 10:32:36,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:32:36,649 INFO L93 Difference]: Finished difference Result 19 states and 21 transitions. [2022-04-08 10:32:36,649 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2022-04-08 10:32:36,649 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:32:36,649 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:32:36,649 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-08 10:32:36,649 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-08 10:32:36,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:32:36,650 INFO L93 Difference]: Finished difference Result 19 states and 21 transitions. [2022-04-08 10:32:36,650 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2022-04-08 10:32:36,650 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:32:36,650 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:32:36,650 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:32:36,651 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:32:36,651 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-08 10:32:36,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2022-04-08 10:32:36,651 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 20 transitions. Word has length 15 [2022-04-08 10:32:36,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:32:36,652 INFO L478 AbstractCegarLoop]: Abstraction has 18 states and 20 transitions. [2022-04-08 10:32:36,652 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-08 10:32:36,652 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 20 transitions. [2022-04-08 10:32:36,668 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-08 10:32:36,668 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2022-04-08 10:32:36,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-08 10:32:36,669 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:32:36,669 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:32:36,669 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-08 10:32:36,669 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:32:36,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:32:36,669 INFO L85 PathProgramCache]: Analyzing trace with hash -434811975, now seen corresponding path program 1 times [2022-04-08 10:32:36,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:32:36,670 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1737012736] [2022-04-08 10:32:36,690 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:32:36,690 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:32:36,691 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:32:36,704 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:32:36,705 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:32:36,705 INFO L85 PathProgramCache]: Analyzing trace with hash -434811975, now seen corresponding path program 2 times [2022-04-08 10:32:36,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:32:36,705 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1988735498] [2022-04-08 10:32:36,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:32:36,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:32:36,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:32:36,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:32:36,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:32:36,740 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-08 10:32:36,740 INFO L290 TraceCheckUtils]: 1: Hoare triple {578#true} assume true; {578#true} is VALID [2022-04-08 10:32:36,740 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {578#true} {578#true} #56#return; {578#true} is VALID [2022-04-08 10:32:36,741 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-08 10:32:36,741 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-08 10:32:36,741 INFO L290 TraceCheckUtils]: 2: Hoare triple {578#true} assume true; {578#true} is VALID [2022-04-08 10:32:36,741 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {578#true} {578#true} #56#return; {578#true} is VALID [2022-04-08 10:32:36,742 INFO L272 TraceCheckUtils]: 4: Hoare triple {578#true} call #t~ret7 := main(); {578#true} is VALID [2022-04-08 10:32:36,742 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-08 10:32:36,742 INFO L290 TraceCheckUtils]: 6: Hoare triple {578#true} assume !!(~a~0 < 6);~b~0 := 0; {578#true} is VALID [2022-04-08 10:32:36,742 INFO L290 TraceCheckUtils]: 7: Hoare triple {578#true} assume !!(~b~0 < 6);~c~0 := 0; {583#(= main_~c~0 0)} is VALID [2022-04-08 10:32:36,743 INFO L290 TraceCheckUtils]: 8: Hoare triple {583#(= main_~c~0 0)} assume !!(~c~0 < 6); {583#(= main_~c~0 0)} is VALID [2022-04-08 10:32:36,743 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-08 10:32:36,743 INFO L290 TraceCheckUtils]: 10: Hoare triple {584#(<= main_~c~0 1)} assume !(~c~0 < 6); {579#false} is VALID [2022-04-08 10:32:36,744 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-08 10:32:36,744 INFO L290 TraceCheckUtils]: 12: Hoare triple {579#false} assume !(~b~0 < 6); {579#false} is VALID [2022-04-08 10:32:36,744 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-08 10:32:36,744 INFO L290 TraceCheckUtils]: 14: Hoare triple {579#false} assume !(~a~0 < 6); {579#false} is VALID [2022-04-08 10:32:36,744 INFO L290 TraceCheckUtils]: 15: Hoare triple {579#false} assume !((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0); {579#false} is VALID [2022-04-08 10:32:36,744 INFO L290 TraceCheckUtils]: 16: Hoare triple {579#false} assume !false; {579#false} is VALID [2022-04-08 10:32:36,744 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-08 10:32:36,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:32:36,746 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1988735498] [2022-04-08 10:32:36,746 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1988735498] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:32:36,746 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [893015928] [2022-04-08 10:32:36,747 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 10:32:36,747 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:32:36,747 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:32:36,748 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-08 10:32:36,761 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-08 10:32:36,783 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 10:32:36,784 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:32:36,785 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 3 conjunts are in the unsatisfiable core [2022-04-08 10:32:36,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:32:36,806 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:32:36,922 INFO L272 TraceCheckUtils]: 0: Hoare triple {578#true} call ULTIMATE.init(); {578#true} is VALID [2022-04-08 10:32:36,922 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-08 10:32:36,922 INFO L290 TraceCheckUtils]: 2: Hoare triple {578#true} assume true; {578#true} is VALID [2022-04-08 10:32:36,922 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {578#true} {578#true} #56#return; {578#true} is VALID [2022-04-08 10:32:36,922 INFO L272 TraceCheckUtils]: 4: Hoare triple {578#true} call #t~ret7 := main(); {578#true} is VALID [2022-04-08 10:32:36,922 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-08 10:32:36,923 INFO L290 TraceCheckUtils]: 6: Hoare triple {578#true} assume !!(~a~0 < 6);~b~0 := 0; {578#true} is VALID [2022-04-08 10:32:36,923 INFO L290 TraceCheckUtils]: 7: Hoare triple {578#true} assume !!(~b~0 < 6);~c~0 := 0; {610#(<= main_~c~0 0)} is VALID [2022-04-08 10:32:36,923 INFO L290 TraceCheckUtils]: 8: Hoare triple {610#(<= main_~c~0 0)} assume !!(~c~0 < 6); {610#(<= main_~c~0 0)} is VALID [2022-04-08 10:32:36,924 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-08 10:32:36,924 INFO L290 TraceCheckUtils]: 10: Hoare triple {584#(<= main_~c~0 1)} assume !(~c~0 < 6); {579#false} is VALID [2022-04-08 10:32:36,925 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-08 10:32:36,925 INFO L290 TraceCheckUtils]: 12: Hoare triple {579#false} assume !(~b~0 < 6); {579#false} is VALID [2022-04-08 10:32:36,925 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-08 10:32:36,925 INFO L290 TraceCheckUtils]: 14: Hoare triple {579#false} assume !(~a~0 < 6); {579#false} is VALID [2022-04-08 10:32:36,925 INFO L290 TraceCheckUtils]: 15: Hoare triple {579#false} assume !((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0); {579#false} is VALID [2022-04-08 10:32:36,925 INFO L290 TraceCheckUtils]: 16: Hoare triple {579#false} assume !false; {579#false} is VALID [2022-04-08 10:32:36,925 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-08 10:32:36,925 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:32:37,015 INFO L290 TraceCheckUtils]: 16: Hoare triple {579#false} assume !false; {579#false} is VALID [2022-04-08 10:32:37,015 INFO L290 TraceCheckUtils]: 15: Hoare triple {579#false} assume !((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0); {579#false} is VALID [2022-04-08 10:32:37,015 INFO L290 TraceCheckUtils]: 14: Hoare triple {579#false} assume !(~a~0 < 6); {579#false} is VALID [2022-04-08 10:32:37,015 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-08 10:32:37,015 INFO L290 TraceCheckUtils]: 12: Hoare triple {579#false} assume !(~b~0 < 6); {579#false} is VALID [2022-04-08 10:32:37,015 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-08 10:32:37,016 INFO L290 TraceCheckUtils]: 10: Hoare triple {656#(< main_~c~0 6)} assume !(~c~0 < 6); {579#false} is VALID [2022-04-08 10:32:37,016 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-08 10:32:37,017 INFO L290 TraceCheckUtils]: 8: Hoare triple {660#(< main_~c~0 5)} assume !!(~c~0 < 6); {660#(< main_~c~0 5)} is VALID [2022-04-08 10:32:37,017 INFO L290 TraceCheckUtils]: 7: Hoare triple {578#true} assume !!(~b~0 < 6);~c~0 := 0; {660#(< main_~c~0 5)} is VALID [2022-04-08 10:32:37,017 INFO L290 TraceCheckUtils]: 6: Hoare triple {578#true} assume !!(~a~0 < 6);~b~0 := 0; {578#true} is VALID [2022-04-08 10:32:37,017 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-08 10:32:37,017 INFO L272 TraceCheckUtils]: 4: Hoare triple {578#true} call #t~ret7 := main(); {578#true} is VALID [2022-04-08 10:32:37,017 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {578#true} {578#true} #56#return; {578#true} is VALID [2022-04-08 10:32:37,018 INFO L290 TraceCheckUtils]: 2: Hoare triple {578#true} assume true; {578#true} is VALID [2022-04-08 10:32:37,018 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-08 10:32:37,018 INFO L272 TraceCheckUtils]: 0: Hoare triple {578#true} call ULTIMATE.init(); {578#true} is VALID [2022-04-08 10:32:37,018 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-08 10:32:37,018 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [893015928] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:32:37,018 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:32:37,019 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 8 [2022-04-08 10:32:37,019 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:32:37,019 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1737012736] [2022-04-08 10:32:37,019 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1737012736] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:32:37,019 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:32:37,020 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 10:32:37,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723886139] [2022-04-08 10:32:37,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:32:37,020 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-08 10:32:37,020 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:32:37,021 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-08 10:32:37,032 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-08 10:32:37,032 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 10:32:37,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:32:37,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 10:32:37,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2022-04-08 10:32:37,033 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-08 10:32:37,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:32:37,106 INFO L93 Difference]: Finished difference Result 32 states and 37 transitions. [2022-04-08 10:32:37,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 10:32:37,107 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-08 10:32:37,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:32:37,107 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-08 10:32:37,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 33 transitions. [2022-04-08 10:32:37,108 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-08 10:32:37,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 33 transitions. [2022-04-08 10:32:37,109 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 33 transitions. [2022-04-08 10:32:37,131 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-08 10:32:37,132 INFO L225 Difference]: With dead ends: 32 [2022-04-08 10:32:37,132 INFO L226 Difference]: Without dead ends: 21 [2022-04-08 10:32:37,133 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-08 10:32:37,133 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-08 10:32:37,134 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-08 10:32:37,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2022-04-08 10:32:37,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 20. [2022-04-08 10:32:37,143 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:32:37,143 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-08 10:32:37,143 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-08 10:32:37,143 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-08 10:32:37,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:32:37,144 INFO L93 Difference]: Finished difference Result 21 states and 23 transitions. [2022-04-08 10:32:37,144 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2022-04-08 10:32:37,145 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:32:37,145 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:32:37,145 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-08 10:32:37,145 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-08 10:32:37,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:32:37,147 INFO L93 Difference]: Finished difference Result 21 states and 23 transitions. [2022-04-08 10:32:37,147 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2022-04-08 10:32:37,150 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:32:37,151 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:32:37,151 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:32:37,151 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:32:37,151 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-08 10:32:37,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 22 transitions. [2022-04-08 10:32:37,152 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 22 transitions. Word has length 17 [2022-04-08 10:32:37,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:32:37,152 INFO L478 AbstractCegarLoop]: Abstraction has 20 states and 22 transitions. [2022-04-08 10:32:37,152 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-08 10:32:37,152 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 20 states and 22 transitions. [2022-04-08 10:32:37,170 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-08 10:32:37,170 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2022-04-08 10:32:37,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-04-08 10:32:37,171 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:32:37,171 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:32:37,195 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-08 10:32:37,391 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:32:37,391 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:32:37,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:32:37,392 INFO L85 PathProgramCache]: Analyzing trace with hash -540973097, now seen corresponding path program 3 times [2022-04-08 10:32:37,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:32:37,392 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1593357546] [2022-04-08 10:32:37,420 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:32:37,421 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:32:37,421 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:32:37,437 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:32:37,438 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:32:37,438 INFO L85 PathProgramCache]: Analyzing trace with hash -540973097, now seen corresponding path program 4 times [2022-04-08 10:32:37,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:32:37,438 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [782892545] [2022-04-08 10:32:37,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:32:37,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:32:37,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:32:37,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:32:37,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:32:37,474 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-08 10:32:37,475 INFO L290 TraceCheckUtils]: 1: Hoare triple {840#true} assume true; {840#true} is VALID [2022-04-08 10:32:37,475 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {840#true} {840#true} #56#return; {840#true} is VALID [2022-04-08 10:32:37,475 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-08 10:32:37,475 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-08 10:32:37,475 INFO L290 TraceCheckUtils]: 2: Hoare triple {840#true} assume true; {840#true} is VALID [2022-04-08 10:32:37,476 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {840#true} {840#true} #56#return; {840#true} is VALID [2022-04-08 10:32:37,476 INFO L272 TraceCheckUtils]: 4: Hoare triple {840#true} call #t~ret7 := main(); {840#true} is VALID [2022-04-08 10:32:37,476 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-08 10:32:37,476 INFO L290 TraceCheckUtils]: 6: Hoare triple {840#true} assume !!(~a~0 < 6);~b~0 := 0; {845#(= main_~b~0 0)} is VALID [2022-04-08 10:32:37,476 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-08 10:32:37,477 INFO L290 TraceCheckUtils]: 8: Hoare triple {845#(= main_~b~0 0)} assume !!(~c~0 < 6); {845#(= main_~b~0 0)} is VALID [2022-04-08 10:32:37,477 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-08 10:32:37,477 INFO L290 TraceCheckUtils]: 10: Hoare triple {845#(= main_~b~0 0)} assume !!(~c~0 < 6); {845#(= main_~b~0 0)} is VALID [2022-04-08 10:32:37,478 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-08 10:32:37,478 INFO L290 TraceCheckUtils]: 12: Hoare triple {845#(= main_~b~0 0)} assume !(~c~0 < 6); {845#(= main_~b~0 0)} is VALID [2022-04-08 10:32:37,478 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-08 10:32:37,479 INFO L290 TraceCheckUtils]: 14: Hoare triple {846#(<= main_~b~0 1)} assume !(~b~0 < 6); {841#false} is VALID [2022-04-08 10:32:37,479 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-08 10:32:37,479 INFO L290 TraceCheckUtils]: 16: Hoare triple {841#false} assume !(~a~0 < 6); {841#false} is VALID [2022-04-08 10:32:37,479 INFO L290 TraceCheckUtils]: 17: Hoare triple {841#false} assume !((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0); {841#false} is VALID [2022-04-08 10:32:37,479 INFO L290 TraceCheckUtils]: 18: Hoare triple {841#false} assume !false; {841#false} is VALID [2022-04-08 10:32:37,479 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-08 10:32:37,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:32:37,479 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [782892545] [2022-04-08 10:32:37,480 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [782892545] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:32:37,480 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [175632622] [2022-04-08 10:32:37,480 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 10:32:37,480 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:32:37,480 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:32:37,483 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-08 10:32:37,484 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-08 10:32:37,510 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 10:32:37,510 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:32:37,511 INFO L263 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 4 conjunts are in the unsatisfiable core [2022-04-08 10:32:37,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:32:37,518 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:32:37,583 INFO L272 TraceCheckUtils]: 0: Hoare triple {840#true} call ULTIMATE.init(); {840#true} is VALID [2022-04-08 10:32:37,583 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-08 10:32:37,583 INFO L290 TraceCheckUtils]: 2: Hoare triple {840#true} assume true; {840#true} is VALID [2022-04-08 10:32:37,583 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {840#true} {840#true} #56#return; {840#true} is VALID [2022-04-08 10:32:37,583 INFO L272 TraceCheckUtils]: 4: Hoare triple {840#true} call #t~ret7 := main(); {840#true} is VALID [2022-04-08 10:32:37,584 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-08 10:32:37,584 INFO L290 TraceCheckUtils]: 6: Hoare triple {840#true} assume !!(~a~0 < 6);~b~0 := 0; {840#true} is VALID [2022-04-08 10:32:37,584 INFO L290 TraceCheckUtils]: 7: Hoare triple {840#true} assume !!(~b~0 < 6);~c~0 := 0; {872#(<= main_~c~0 0)} is VALID [2022-04-08 10:32:37,584 INFO L290 TraceCheckUtils]: 8: Hoare triple {872#(<= main_~c~0 0)} assume !!(~c~0 < 6); {872#(<= main_~c~0 0)} is VALID [2022-04-08 10:32:37,585 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-08 10:32:37,585 INFO L290 TraceCheckUtils]: 10: Hoare triple {879#(<= main_~c~0 1)} assume !!(~c~0 < 6); {879#(<= main_~c~0 1)} is VALID [2022-04-08 10:32:37,585 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-08 10:32:37,586 INFO L290 TraceCheckUtils]: 12: Hoare triple {886#(<= main_~c~0 2)} assume !(~c~0 < 6); {841#false} is VALID [2022-04-08 10:32:37,586 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-08 10:32:37,586 INFO L290 TraceCheckUtils]: 14: Hoare triple {841#false} assume !(~b~0 < 6); {841#false} is VALID [2022-04-08 10:32:37,586 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-08 10:32:37,586 INFO L290 TraceCheckUtils]: 16: Hoare triple {841#false} assume !(~a~0 < 6); {841#false} is VALID [2022-04-08 10:32:37,586 INFO L290 TraceCheckUtils]: 17: Hoare triple {841#false} assume !((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0); {841#false} is VALID [2022-04-08 10:32:37,586 INFO L290 TraceCheckUtils]: 18: Hoare triple {841#false} assume !false; {841#false} is VALID [2022-04-08 10:32:37,587 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-08 10:32:37,587 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:32:37,658 INFO L290 TraceCheckUtils]: 18: Hoare triple {841#false} assume !false; {841#false} is VALID [2022-04-08 10:32:37,659 INFO L290 TraceCheckUtils]: 17: Hoare triple {841#false} assume !((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0); {841#false} is VALID [2022-04-08 10:32:37,659 INFO L290 TraceCheckUtils]: 16: Hoare triple {841#false} assume !(~a~0 < 6); {841#false} is VALID [2022-04-08 10:32:37,659 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-08 10:32:37,659 INFO L290 TraceCheckUtils]: 14: Hoare triple {841#false} assume !(~b~0 < 6); {841#false} is VALID [2022-04-08 10:32:37,659 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-08 10:32:37,659 INFO L290 TraceCheckUtils]: 12: Hoare triple {926#(< main_~c~0 6)} assume !(~c~0 < 6); {841#false} is VALID [2022-04-08 10:32:37,660 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-08 10:32:37,660 INFO L290 TraceCheckUtils]: 10: Hoare triple {930#(< main_~c~0 5)} assume !!(~c~0 < 6); {930#(< main_~c~0 5)} is VALID [2022-04-08 10:32:37,661 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-08 10:32:37,661 INFO L290 TraceCheckUtils]: 8: Hoare triple {937#(< main_~c~0 4)} assume !!(~c~0 < 6); {937#(< main_~c~0 4)} is VALID [2022-04-08 10:32:37,661 INFO L290 TraceCheckUtils]: 7: Hoare triple {840#true} assume !!(~b~0 < 6);~c~0 := 0; {937#(< main_~c~0 4)} is VALID [2022-04-08 10:32:37,661 INFO L290 TraceCheckUtils]: 6: Hoare triple {840#true} assume !!(~a~0 < 6);~b~0 := 0; {840#true} is VALID [2022-04-08 10:32:37,661 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-08 10:32:37,662 INFO L272 TraceCheckUtils]: 4: Hoare triple {840#true} call #t~ret7 := main(); {840#true} is VALID [2022-04-08 10:32:37,662 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {840#true} {840#true} #56#return; {840#true} is VALID [2022-04-08 10:32:37,662 INFO L290 TraceCheckUtils]: 2: Hoare triple {840#true} assume true; {840#true} is VALID [2022-04-08 10:32:37,662 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-08 10:32:37,662 INFO L272 TraceCheckUtils]: 0: Hoare triple {840#true} call ULTIMATE.init(); {840#true} is VALID [2022-04-08 10:32:37,662 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-08 10:32:37,662 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [175632622] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:32:37,662 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:32:37,662 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2022-04-08 10:32:37,662 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:32:37,663 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1593357546] [2022-04-08 10:32:37,663 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1593357546] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:32:37,663 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:32:37,663 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 10:32:37,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1889645351] [2022-04-08 10:32:37,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:32:37,663 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-08 10:32:37,663 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:32:37,663 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-08 10:32:37,673 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-08 10:32:37,673 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 10:32:37,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:32:37,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 10:32:37,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2022-04-08 10:32:37,674 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-08 10:32:37,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:32:37,733 INFO L93 Difference]: Finished difference Result 46 states and 53 transitions. [2022-04-08 10:32:37,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 10:32:37,733 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-08 10:32:37,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:32:37,733 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-08 10:32:37,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 39 transitions. [2022-04-08 10:32:37,734 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-08 10:32:37,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 39 transitions. [2022-04-08 10:32:37,735 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 39 transitions. [2022-04-08 10:32:37,758 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-08 10:32:37,759 INFO L225 Difference]: With dead ends: 46 [2022-04-08 10:32:37,759 INFO L226 Difference]: Without dead ends: 33 [2022-04-08 10:32:37,760 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2022-04-08 10:32:37,760 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-08 10:32:37,760 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-08 10:32:37,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-04-08 10:32:37,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 27. [2022-04-08 10:32:37,768 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:32:37,768 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-08 10:32:37,768 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-08 10:32:37,769 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-08 10:32:37,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:32:37,770 INFO L93 Difference]: Finished difference Result 33 states and 37 transitions. [2022-04-08 10:32:37,770 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2022-04-08 10:32:37,770 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:32:37,770 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:32:37,770 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-08 10:32:37,770 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-08 10:32:37,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:32:37,771 INFO L93 Difference]: Finished difference Result 33 states and 37 transitions. [2022-04-08 10:32:37,771 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2022-04-08 10:32:37,771 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:32:37,771 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:32:37,771 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:32:37,771 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:32:37,771 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-08 10:32:37,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 30 transitions. [2022-04-08 10:32:37,772 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 30 transitions. Word has length 19 [2022-04-08 10:32:37,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:32:37,772 INFO L478 AbstractCegarLoop]: Abstraction has 27 states and 30 transitions. [2022-04-08 10:32:37,772 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-08 10:32:37,772 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 27 states and 30 transitions. [2022-04-08 10:32:37,807 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-08 10:32:37,807 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2022-04-08 10:32:37,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-08 10:32:37,808 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:32:37,808 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:32:37,824 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-04-08 10:32:38,024 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,SelfDestructingSolverStorable5 [2022-04-08 10:32:38,024 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:32:38,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:32:38,025 INFO L85 PathProgramCache]: Analyzing trace with hash 611633562, now seen corresponding path program 5 times [2022-04-08 10:32:38,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:32:38,025 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [736852067] [2022-04-08 10:32:38,096 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:32:38,096 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:32:38,096 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:32:38,107 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:32:38,107 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:32:38,107 INFO L85 PathProgramCache]: Analyzing trace with hash 611633562, now seen corresponding path program 6 times [2022-04-08 10:32:38,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:32:38,108 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [933295054] [2022-04-08 10:32:38,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:32:38,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:32:38,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:32:38,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:32:38,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:32:38,165 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-08 10:32:38,165 INFO L290 TraceCheckUtils]: 1: Hoare triple {1183#true} assume true; {1183#true} is VALID [2022-04-08 10:32:38,171 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1183#true} {1183#true} #56#return; {1183#true} is VALID [2022-04-08 10:32:38,172 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-08 10:32:38,172 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-08 10:32:38,172 INFO L290 TraceCheckUtils]: 2: Hoare triple {1183#true} assume true; {1183#true} is VALID [2022-04-08 10:32:38,172 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1183#true} {1183#true} #56#return; {1183#true} is VALID [2022-04-08 10:32:38,172 INFO L272 TraceCheckUtils]: 4: Hoare triple {1183#true} call #t~ret7 := main(); {1183#true} is VALID [2022-04-08 10:32:38,173 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-08 10:32:38,173 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-08 10:32:38,173 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-08 10:32:38,174 INFO L290 TraceCheckUtils]: 8: Hoare triple {1188#(= main_~a~0 0)} assume !!(~c~0 < 6); {1188#(= main_~a~0 0)} is VALID [2022-04-08 10:32:38,174 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-08 10:32:38,175 INFO L290 TraceCheckUtils]: 10: Hoare triple {1188#(= main_~a~0 0)} assume !!(~c~0 < 6); {1188#(= main_~a~0 0)} is VALID [2022-04-08 10:32:38,176 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-08 10:32:38,176 INFO L290 TraceCheckUtils]: 12: Hoare triple {1188#(= main_~a~0 0)} assume !(~c~0 < 6); {1188#(= main_~a~0 0)} is VALID [2022-04-08 10:32:38,176 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-08 10:32:38,178 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-08 10:32:38,179 INFO L290 TraceCheckUtils]: 15: Hoare triple {1188#(= main_~a~0 0)} assume !!(~c~0 < 6); {1188#(= main_~a~0 0)} is VALID [2022-04-08 10:32:38,179 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-08 10:32:38,179 INFO L290 TraceCheckUtils]: 17: Hoare triple {1188#(= main_~a~0 0)} assume !!(~c~0 < 6); {1188#(= main_~a~0 0)} is VALID [2022-04-08 10:32:38,180 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-08 10:32:38,180 INFO L290 TraceCheckUtils]: 19: Hoare triple {1188#(= main_~a~0 0)} assume !(~c~0 < 6); {1188#(= main_~a~0 0)} is VALID [2022-04-08 10:32:38,180 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-08 10:32:38,180 INFO L290 TraceCheckUtils]: 21: Hoare triple {1188#(= main_~a~0 0)} assume !(~b~0 < 6); {1188#(= main_~a~0 0)} is VALID [2022-04-08 10:32:38,181 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-08 10:32:38,181 INFO L290 TraceCheckUtils]: 23: Hoare triple {1189#(<= main_~a~0 1)} assume !(~a~0 < 6); {1184#false} is VALID [2022-04-08 10:32:38,181 INFO L290 TraceCheckUtils]: 24: Hoare triple {1184#false} assume !((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0); {1184#false} is VALID [2022-04-08 10:32:38,181 INFO L290 TraceCheckUtils]: 25: Hoare triple {1184#false} assume !false; {1184#false} is VALID [2022-04-08 10:32:38,181 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-08 10:32:38,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:32:38,182 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [933295054] [2022-04-08 10:32:38,182 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [933295054] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:32:38,182 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1968631251] [2022-04-08 10:32:38,182 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 10:32:38,182 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:32:38,182 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:32:38,183 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-08 10:32:38,184 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-08 10:32:38,209 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-04-08 10:32:38,210 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:32:38,210 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 3 conjunts are in the unsatisfiable core [2022-04-08 10:32:38,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:32:38,215 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:32:38,291 INFO L272 TraceCheckUtils]: 0: Hoare triple {1183#true} call ULTIMATE.init(); {1183#true} is VALID [2022-04-08 10:32:38,291 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-08 10:32:38,292 INFO L290 TraceCheckUtils]: 2: Hoare triple {1183#true} assume true; {1183#true} is VALID [2022-04-08 10:32:38,292 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1183#true} {1183#true} #56#return; {1183#true} is VALID [2022-04-08 10:32:38,293 INFO L272 TraceCheckUtils]: 4: Hoare triple {1183#true} call #t~ret7 := main(); {1183#true} is VALID [2022-04-08 10:32:38,293 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-08 10:32:38,294 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-08 10:32:38,294 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-08 10:32:38,294 INFO L290 TraceCheckUtils]: 8: Hoare triple {1209#(<= main_~a~0 0)} assume !!(~c~0 < 6); {1209#(<= main_~a~0 0)} is VALID [2022-04-08 10:32:38,294 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-08 10:32:38,295 INFO L290 TraceCheckUtils]: 10: Hoare triple {1209#(<= main_~a~0 0)} assume !!(~c~0 < 6); {1209#(<= main_~a~0 0)} is VALID [2022-04-08 10:32:38,295 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-08 10:32:38,295 INFO L290 TraceCheckUtils]: 12: Hoare triple {1209#(<= main_~a~0 0)} assume !(~c~0 < 6); {1209#(<= main_~a~0 0)} is VALID [2022-04-08 10:32:38,295 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-08 10:32:38,296 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-08 10:32:38,296 INFO L290 TraceCheckUtils]: 15: Hoare triple {1209#(<= main_~a~0 0)} assume !!(~c~0 < 6); {1209#(<= main_~a~0 0)} is VALID [2022-04-08 10:32:38,297 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-08 10:32:38,297 INFO L290 TraceCheckUtils]: 17: Hoare triple {1209#(<= main_~a~0 0)} assume !!(~c~0 < 6); {1209#(<= main_~a~0 0)} is VALID [2022-04-08 10:32:38,298 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-08 10:32:38,298 INFO L290 TraceCheckUtils]: 19: Hoare triple {1209#(<= main_~a~0 0)} assume !(~c~0 < 6); {1209#(<= main_~a~0 0)} is VALID [2022-04-08 10:32:38,298 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-08 10:32:38,298 INFO L290 TraceCheckUtils]: 21: Hoare triple {1209#(<= main_~a~0 0)} assume !(~b~0 < 6); {1209#(<= main_~a~0 0)} is VALID [2022-04-08 10:32:38,299 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-08 10:32:38,299 INFO L290 TraceCheckUtils]: 23: Hoare triple {1189#(<= main_~a~0 1)} assume !(~a~0 < 6); {1184#false} is VALID [2022-04-08 10:32:38,299 INFO L290 TraceCheckUtils]: 24: Hoare triple {1184#false} assume !((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0); {1184#false} is VALID [2022-04-08 10:32:38,299 INFO L290 TraceCheckUtils]: 25: Hoare triple {1184#false} assume !false; {1184#false} is VALID [2022-04-08 10:32:38,299 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-08 10:32:38,299 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:32:38,383 INFO L290 TraceCheckUtils]: 25: Hoare triple {1184#false} assume !false; {1184#false} is VALID [2022-04-08 10:32:38,383 INFO L290 TraceCheckUtils]: 24: Hoare triple {1184#false} assume !((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0); {1184#false} is VALID [2022-04-08 10:32:38,383 INFO L290 TraceCheckUtils]: 23: Hoare triple {1276#(< main_~a~0 6)} assume !(~a~0 < 6); {1184#false} is VALID [2022-04-08 10:32:38,384 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-08 10:32:38,384 INFO L290 TraceCheckUtils]: 21: Hoare triple {1280#(< main_~a~0 5)} assume !(~b~0 < 6); {1280#(< main_~a~0 5)} is VALID [2022-04-08 10:32:38,384 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-08 10:32:38,384 INFO L290 TraceCheckUtils]: 19: Hoare triple {1280#(< main_~a~0 5)} assume !(~c~0 < 6); {1280#(< main_~a~0 5)} is VALID [2022-04-08 10:32:38,385 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-08 10:32:38,385 INFO L290 TraceCheckUtils]: 17: Hoare triple {1280#(< main_~a~0 5)} assume !!(~c~0 < 6); {1280#(< main_~a~0 5)} is VALID [2022-04-08 10:32:38,385 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-08 10:32:38,385 INFO L290 TraceCheckUtils]: 15: Hoare triple {1280#(< main_~a~0 5)} assume !!(~c~0 < 6); {1280#(< main_~a~0 5)} is VALID [2022-04-08 10:32:38,386 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-08 10:32:38,386 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-08 10:32:38,387 INFO L290 TraceCheckUtils]: 12: Hoare triple {1280#(< main_~a~0 5)} assume !(~c~0 < 6); {1280#(< main_~a~0 5)} is VALID [2022-04-08 10:32:38,387 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-08 10:32:38,387 INFO L290 TraceCheckUtils]: 10: Hoare triple {1280#(< main_~a~0 5)} assume !!(~c~0 < 6); {1280#(< main_~a~0 5)} is VALID [2022-04-08 10:32:38,387 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-08 10:32:38,388 INFO L290 TraceCheckUtils]: 8: Hoare triple {1280#(< main_~a~0 5)} assume !!(~c~0 < 6); {1280#(< main_~a~0 5)} is VALID [2022-04-08 10:32:38,388 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-08 10:32:38,388 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-08 10:32:38,388 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-08 10:32:38,388 INFO L272 TraceCheckUtils]: 4: Hoare triple {1183#true} call #t~ret7 := main(); {1183#true} is VALID [2022-04-08 10:32:38,389 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1183#true} {1183#true} #56#return; {1183#true} is VALID [2022-04-08 10:32:38,391 INFO L290 TraceCheckUtils]: 2: Hoare triple {1183#true} assume true; {1183#true} is VALID [2022-04-08 10:32:38,392 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-08 10:32:38,397 INFO L272 TraceCheckUtils]: 0: Hoare triple {1183#true} call ULTIMATE.init(); {1183#true} is VALID [2022-04-08 10:32:38,398 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-08 10:32:38,398 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1968631251] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:32:38,398 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:32:38,398 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 8 [2022-04-08 10:32:38,399 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:32:38,399 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [736852067] [2022-04-08 10:32:38,399 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [736852067] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:32:38,399 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:32:38,399 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 10:32:38,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1038243034] [2022-04-08 10:32:38,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:32:38,401 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-08 10:32:38,401 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:32:38,401 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-08 10:32:38,410 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-08 10:32:38,410 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 10:32:38,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:32:38,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 10:32:38,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2022-04-08 10:32:38,411 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-08 10:32:38,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:32:38,491 INFO L93 Difference]: Finished difference Result 63 states and 72 transitions. [2022-04-08 10:32:38,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 10:32:38,491 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-08 10:32:38,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:32:38,492 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-08 10:32:38,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 36 transitions. [2022-04-08 10:32:38,493 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-08 10:32:38,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 36 transitions. [2022-04-08 10:32:38,493 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 36 transitions. [2022-04-08 10:32:38,515 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-08 10:32:38,516 INFO L225 Difference]: With dead ends: 63 [2022-04-08 10:32:38,516 INFO L226 Difference]: Without dead ends: 60 [2022-04-08 10:32:38,517 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-08 10:32:38,517 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-08 10:32:38,517 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-08 10:32:38,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2022-04-08 10:32:38,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 44. [2022-04-08 10:32:38,542 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:32:38,542 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-08 10:32:38,542 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-08 10:32:38,542 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-08 10:32:38,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:32:38,544 INFO L93 Difference]: Finished difference Result 60 states and 69 transitions. [2022-04-08 10:32:38,544 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 69 transitions. [2022-04-08 10:32:38,544 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:32:38,544 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:32:38,544 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-08 10:32:38,545 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-08 10:32:38,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:32:38,546 INFO L93 Difference]: Finished difference Result 60 states and 69 transitions. [2022-04-08 10:32:38,546 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 69 transitions. [2022-04-08 10:32:38,546 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:32:38,546 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:32:38,546 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:32:38,546 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:32:38,547 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-08 10:32:38,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 50 transitions. [2022-04-08 10:32:38,548 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 50 transitions. Word has length 26 [2022-04-08 10:32:38,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:32:38,548 INFO L478 AbstractCegarLoop]: Abstraction has 44 states and 50 transitions. [2022-04-08 10:32:38,548 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-08 10:32:38,549 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 44 states and 50 transitions. [2022-04-08 10:32:38,583 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-08 10:32:38,583 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 50 transitions. [2022-04-08 10:32:38,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-04-08 10:32:38,584 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:32:38,584 INFO L499 BasicCegarLoop]: trace histogram [8, 8, 4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:32:38,602 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-08 10:32:38,798 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:32:38,799 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:32:38,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:32:38,799 INFO L85 PathProgramCache]: Analyzing trace with hash 1035792127, now seen corresponding path program 7 times [2022-04-08 10:32:38,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:32:38,799 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [558616024] [2022-04-08 10:32:38,973 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:32:38,989 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:32:38,989 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:32:38,989 INFO L85 PathProgramCache]: Analyzing trace with hash 1035792127, now seen corresponding path program 8 times [2022-04-08 10:32:38,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:32:38,989 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [46931758] [2022-04-08 10:32:38,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:32:38,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:32:39,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:32:39,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:32:39,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:32:39,048 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-08 10:32:39,048 INFO L290 TraceCheckUtils]: 1: Hoare triple {1687#true} assume true; {1687#true} is VALID [2022-04-08 10:32:39,048 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1687#true} {1687#true} #56#return; {1687#true} is VALID [2022-04-08 10:32:39,048 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-08 10:32:39,048 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-08 10:32:39,048 INFO L290 TraceCheckUtils]: 2: Hoare triple {1687#true} assume true; {1687#true} is VALID [2022-04-08 10:32:39,048 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1687#true} {1687#true} #56#return; {1687#true} is VALID [2022-04-08 10:32:39,048 INFO L272 TraceCheckUtils]: 4: Hoare triple {1687#true} call #t~ret7 := main(); {1687#true} is VALID [2022-04-08 10:32:39,049 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-08 10:32:39,049 INFO L290 TraceCheckUtils]: 6: Hoare triple {1687#true} assume !!(~a~0 < 6);~b~0 := 0; {1687#true} is VALID [2022-04-08 10:32:39,049 INFO L290 TraceCheckUtils]: 7: Hoare triple {1687#true} assume !!(~b~0 < 6);~c~0 := 0; {1692#(= main_~c~0 0)} is VALID [2022-04-08 10:32:39,049 INFO L290 TraceCheckUtils]: 8: Hoare triple {1692#(= main_~c~0 0)} assume !!(~c~0 < 6); {1692#(= main_~c~0 0)} is VALID [2022-04-08 10:32:39,049 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-08 10:32:39,050 INFO L290 TraceCheckUtils]: 10: Hoare triple {1693#(<= main_~c~0 1)} assume !!(~c~0 < 6); {1693#(<= main_~c~0 1)} is VALID [2022-04-08 10:32:39,050 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-08 10:32:39,050 INFO L290 TraceCheckUtils]: 12: Hoare triple {1694#(<= main_~c~0 2)} assume !(~c~0 < 6); {1688#false} is VALID [2022-04-08 10:32:39,051 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-08 10:32:39,051 INFO L290 TraceCheckUtils]: 14: Hoare triple {1688#false} assume !!(~b~0 < 6);~c~0 := 0; {1688#false} is VALID [2022-04-08 10:32:39,051 INFO L290 TraceCheckUtils]: 15: Hoare triple {1688#false} assume !!(~c~0 < 6); {1688#false} is VALID [2022-04-08 10:32:39,051 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-08 10:32:39,051 INFO L290 TraceCheckUtils]: 17: Hoare triple {1688#false} assume !!(~c~0 < 6); {1688#false} is VALID [2022-04-08 10:32:39,051 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-08 10:32:39,051 INFO L290 TraceCheckUtils]: 19: Hoare triple {1688#false} assume !(~c~0 < 6); {1688#false} is VALID [2022-04-08 10:32:39,051 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-08 10:32:39,051 INFO L290 TraceCheckUtils]: 21: Hoare triple {1688#false} assume !(~b~0 < 6); {1688#false} is VALID [2022-04-08 10:32:39,051 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-08 10:32:39,051 INFO L290 TraceCheckUtils]: 23: Hoare triple {1688#false} assume !!(~a~0 < 6);~b~0 := 0; {1688#false} is VALID [2022-04-08 10:32:39,051 INFO L290 TraceCheckUtils]: 24: Hoare triple {1688#false} assume !!(~b~0 < 6);~c~0 := 0; {1688#false} is VALID [2022-04-08 10:32:39,051 INFO L290 TraceCheckUtils]: 25: Hoare triple {1688#false} assume !!(~c~0 < 6); {1688#false} is VALID [2022-04-08 10:32:39,051 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-08 10:32:39,051 INFO L290 TraceCheckUtils]: 27: Hoare triple {1688#false} assume !!(~c~0 < 6); {1688#false} is VALID [2022-04-08 10:32:39,052 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-08 10:32:39,052 INFO L290 TraceCheckUtils]: 29: Hoare triple {1688#false} assume !(~c~0 < 6); {1688#false} is VALID [2022-04-08 10:32:39,052 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-08 10:32:39,052 INFO L290 TraceCheckUtils]: 31: Hoare triple {1688#false} assume !!(~b~0 < 6);~c~0 := 0; {1688#false} is VALID [2022-04-08 10:32:39,052 INFO L290 TraceCheckUtils]: 32: Hoare triple {1688#false} assume !!(~c~0 < 6); {1688#false} is VALID [2022-04-08 10:32:39,052 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-08 10:32:39,052 INFO L290 TraceCheckUtils]: 34: Hoare triple {1688#false} assume !!(~c~0 < 6); {1688#false} is VALID [2022-04-08 10:32:39,052 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-08 10:32:39,052 INFO L290 TraceCheckUtils]: 36: Hoare triple {1688#false} assume !(~c~0 < 6); {1688#false} is VALID [2022-04-08 10:32:39,052 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-08 10:32:39,052 INFO L290 TraceCheckUtils]: 38: Hoare triple {1688#false} assume !(~b~0 < 6); {1688#false} is VALID [2022-04-08 10:32:39,052 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-08 10:32:39,052 INFO L290 TraceCheckUtils]: 40: Hoare triple {1688#false} assume !(~a~0 < 6); {1688#false} is VALID [2022-04-08 10:32:39,052 INFO L290 TraceCheckUtils]: 41: Hoare triple {1688#false} assume !((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0); {1688#false} is VALID [2022-04-08 10:32:39,052 INFO L290 TraceCheckUtils]: 42: Hoare triple {1688#false} assume !false; {1688#false} is VALID [2022-04-08 10:32:39,053 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-08 10:32:39,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:32:39,053 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [46931758] [2022-04-08 10:32:39,053 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [46931758] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:32:39,053 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1430153618] [2022-04-08 10:32:39,053 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 10:32:39,053 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:32:39,053 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:32:39,054 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-08 10:32:39,055 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-08 10:32:39,087 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 10:32:39,087 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:32:39,087 INFO L263 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 4 conjunts are in the unsatisfiable core [2022-04-08 10:32:39,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:32:39,093 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:32:39,169 INFO L272 TraceCheckUtils]: 0: Hoare triple {1687#true} call ULTIMATE.init(); {1687#true} is VALID [2022-04-08 10:32:39,170 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-08 10:32:39,170 INFO L290 TraceCheckUtils]: 2: Hoare triple {1687#true} assume true; {1687#true} is VALID [2022-04-08 10:32:39,170 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1687#true} {1687#true} #56#return; {1687#true} is VALID [2022-04-08 10:32:39,170 INFO L272 TraceCheckUtils]: 4: Hoare triple {1687#true} call #t~ret7 := main(); {1687#true} is VALID [2022-04-08 10:32:39,170 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-08 10:32:39,170 INFO L290 TraceCheckUtils]: 6: Hoare triple {1687#true} assume !!(~a~0 < 6);~b~0 := 0; {1687#true} is VALID [2022-04-08 10:32:39,171 INFO L290 TraceCheckUtils]: 7: Hoare triple {1687#true} assume !!(~b~0 < 6);~c~0 := 0; {1720#(<= main_~c~0 0)} is VALID [2022-04-08 10:32:39,171 INFO L290 TraceCheckUtils]: 8: Hoare triple {1720#(<= main_~c~0 0)} assume !!(~c~0 < 6); {1720#(<= main_~c~0 0)} is VALID [2022-04-08 10:32:39,172 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-08 10:32:39,172 INFO L290 TraceCheckUtils]: 10: Hoare triple {1693#(<= main_~c~0 1)} assume !!(~c~0 < 6); {1693#(<= main_~c~0 1)} is VALID [2022-04-08 10:32:39,173 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-08 10:32:39,173 INFO L290 TraceCheckUtils]: 12: Hoare triple {1694#(<= main_~c~0 2)} assume !(~c~0 < 6); {1688#false} is VALID [2022-04-08 10:32:39,173 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-08 10:32:39,173 INFO L290 TraceCheckUtils]: 14: Hoare triple {1688#false} assume !!(~b~0 < 6);~c~0 := 0; {1688#false} is VALID [2022-04-08 10:32:39,173 INFO L290 TraceCheckUtils]: 15: Hoare triple {1688#false} assume !!(~c~0 < 6); {1688#false} is VALID [2022-04-08 10:32:39,174 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-08 10:32:39,174 INFO L290 TraceCheckUtils]: 17: Hoare triple {1688#false} assume !!(~c~0 < 6); {1688#false} is VALID [2022-04-08 10:32:39,174 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-08 10:32:39,174 INFO L290 TraceCheckUtils]: 19: Hoare triple {1688#false} assume !(~c~0 < 6); {1688#false} is VALID [2022-04-08 10:32:39,174 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-08 10:32:39,174 INFO L290 TraceCheckUtils]: 21: Hoare triple {1688#false} assume !(~b~0 < 6); {1688#false} is VALID [2022-04-08 10:32:39,174 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-08 10:32:39,174 INFO L290 TraceCheckUtils]: 23: Hoare triple {1688#false} assume !!(~a~0 < 6);~b~0 := 0; {1688#false} is VALID [2022-04-08 10:32:39,174 INFO L290 TraceCheckUtils]: 24: Hoare triple {1688#false} assume !!(~b~0 < 6);~c~0 := 0; {1688#false} is VALID [2022-04-08 10:32:39,174 INFO L290 TraceCheckUtils]: 25: Hoare triple {1688#false} assume !!(~c~0 < 6); {1688#false} is VALID [2022-04-08 10:32:39,174 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-08 10:32:39,174 INFO L290 TraceCheckUtils]: 27: Hoare triple {1688#false} assume !!(~c~0 < 6); {1688#false} is VALID [2022-04-08 10:32:39,174 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-08 10:32:39,174 INFO L290 TraceCheckUtils]: 29: Hoare triple {1688#false} assume !(~c~0 < 6); {1688#false} is VALID [2022-04-08 10:32:39,174 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-08 10:32:39,174 INFO L290 TraceCheckUtils]: 31: Hoare triple {1688#false} assume !!(~b~0 < 6);~c~0 := 0; {1688#false} is VALID [2022-04-08 10:32:39,175 INFO L290 TraceCheckUtils]: 32: Hoare triple {1688#false} assume !!(~c~0 < 6); {1688#false} is VALID [2022-04-08 10:32:39,175 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-08 10:32:39,175 INFO L290 TraceCheckUtils]: 34: Hoare triple {1688#false} assume !!(~c~0 < 6); {1688#false} is VALID [2022-04-08 10:32:39,175 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-08 10:32:39,175 INFO L290 TraceCheckUtils]: 36: Hoare triple {1688#false} assume !(~c~0 < 6); {1688#false} is VALID [2022-04-08 10:32:39,175 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-08 10:32:39,175 INFO L290 TraceCheckUtils]: 38: Hoare triple {1688#false} assume !(~b~0 < 6); {1688#false} is VALID [2022-04-08 10:32:39,175 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-08 10:32:39,175 INFO L290 TraceCheckUtils]: 40: Hoare triple {1688#false} assume !(~a~0 < 6); {1688#false} is VALID [2022-04-08 10:32:39,175 INFO L290 TraceCheckUtils]: 41: Hoare triple {1688#false} assume !((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0); {1688#false} is VALID [2022-04-08 10:32:39,175 INFO L290 TraceCheckUtils]: 42: Hoare triple {1688#false} assume !false; {1688#false} is VALID [2022-04-08 10:32:39,175 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-08 10:32:39,175 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:32:39,281 INFO L290 TraceCheckUtils]: 42: Hoare triple {1688#false} assume !false; {1688#false} is VALID [2022-04-08 10:32:39,282 INFO L290 TraceCheckUtils]: 41: Hoare triple {1688#false} assume !((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0); {1688#false} is VALID [2022-04-08 10:32:39,282 INFO L290 TraceCheckUtils]: 40: Hoare triple {1688#false} assume !(~a~0 < 6); {1688#false} is VALID [2022-04-08 10:32:39,282 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-08 10:32:39,282 INFO L290 TraceCheckUtils]: 38: Hoare triple {1688#false} assume !(~b~0 < 6); {1688#false} is VALID [2022-04-08 10:32:39,282 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-08 10:32:39,282 INFO L290 TraceCheckUtils]: 36: Hoare triple {1688#false} assume !(~c~0 < 6); {1688#false} is VALID [2022-04-08 10:32:39,282 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-08 10:32:39,282 INFO L290 TraceCheckUtils]: 34: Hoare triple {1688#false} assume !!(~c~0 < 6); {1688#false} is VALID [2022-04-08 10:32:39,282 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-08 10:32:39,282 INFO L290 TraceCheckUtils]: 32: Hoare triple {1688#false} assume !!(~c~0 < 6); {1688#false} is VALID [2022-04-08 10:32:39,282 INFO L290 TraceCheckUtils]: 31: Hoare triple {1688#false} assume !!(~b~0 < 6);~c~0 := 0; {1688#false} is VALID [2022-04-08 10:32:39,282 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-08 10:32:39,282 INFO L290 TraceCheckUtils]: 29: Hoare triple {1688#false} assume !(~c~0 < 6); {1688#false} is VALID [2022-04-08 10:32:39,283 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-08 10:32:39,283 INFO L290 TraceCheckUtils]: 27: Hoare triple {1688#false} assume !!(~c~0 < 6); {1688#false} is VALID [2022-04-08 10:32:39,283 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-08 10:32:39,283 INFO L290 TraceCheckUtils]: 25: Hoare triple {1688#false} assume !!(~c~0 < 6); {1688#false} is VALID [2022-04-08 10:32:39,283 INFO L290 TraceCheckUtils]: 24: Hoare triple {1688#false} assume !!(~b~0 < 6);~c~0 := 0; {1688#false} is VALID [2022-04-08 10:32:39,283 INFO L290 TraceCheckUtils]: 23: Hoare triple {1688#false} assume !!(~a~0 < 6);~b~0 := 0; {1688#false} is VALID [2022-04-08 10:32:39,283 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-08 10:32:39,283 INFO L290 TraceCheckUtils]: 21: Hoare triple {1688#false} assume !(~b~0 < 6); {1688#false} is VALID [2022-04-08 10:32:39,283 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-08 10:32:39,283 INFO L290 TraceCheckUtils]: 19: Hoare triple {1688#false} assume !(~c~0 < 6); {1688#false} is VALID [2022-04-08 10:32:39,283 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-08 10:32:39,284 INFO L290 TraceCheckUtils]: 17: Hoare triple {1688#false} assume !!(~c~0 < 6); {1688#false} is VALID [2022-04-08 10:32:39,284 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-08 10:32:39,284 INFO L290 TraceCheckUtils]: 15: Hoare triple {1688#false} assume !!(~c~0 < 6); {1688#false} is VALID [2022-04-08 10:32:39,284 INFO L290 TraceCheckUtils]: 14: Hoare triple {1688#false} assume !!(~b~0 < 6);~c~0 := 0; {1688#false} is VALID [2022-04-08 10:32:39,284 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-08 10:32:39,284 INFO L290 TraceCheckUtils]: 12: Hoare triple {1916#(< main_~c~0 6)} assume !(~c~0 < 6); {1688#false} is VALID [2022-04-08 10:32:39,285 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-08 10:32:39,285 INFO L290 TraceCheckUtils]: 10: Hoare triple {1920#(< main_~c~0 5)} assume !!(~c~0 < 6); {1920#(< main_~c~0 5)} is VALID [2022-04-08 10:32:39,285 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-08 10:32:39,285 INFO L290 TraceCheckUtils]: 8: Hoare triple {1927#(< main_~c~0 4)} assume !!(~c~0 < 6); {1927#(< main_~c~0 4)} is VALID [2022-04-08 10:32:39,287 INFO L290 TraceCheckUtils]: 7: Hoare triple {1687#true} assume !!(~b~0 < 6);~c~0 := 0; {1927#(< main_~c~0 4)} is VALID [2022-04-08 10:32:39,288 INFO L290 TraceCheckUtils]: 6: Hoare triple {1687#true} assume !!(~a~0 < 6);~b~0 := 0; {1687#true} is VALID [2022-04-08 10:32:39,289 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-08 10:32:39,289 INFO L272 TraceCheckUtils]: 4: Hoare triple {1687#true} call #t~ret7 := main(); {1687#true} is VALID [2022-04-08 10:32:39,289 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1687#true} {1687#true} #56#return; {1687#true} is VALID [2022-04-08 10:32:39,290 INFO L290 TraceCheckUtils]: 2: Hoare triple {1687#true} assume true; {1687#true} is VALID [2022-04-08 10:32:39,290 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-08 10:32:39,291 INFO L272 TraceCheckUtils]: 0: Hoare triple {1687#true} call ULTIMATE.init(); {1687#true} is VALID [2022-04-08 10:32:39,291 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-08 10:32:39,291 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1430153618] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:32:39,292 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:32:39,292 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 10 [2022-04-08 10:32:39,292 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:32:39,292 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [558616024] [2022-04-08 10:32:39,292 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [558616024] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:32:39,292 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:32:39,292 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 10:32:39,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1137603764] [2022-04-08 10:32:39,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:32:39,293 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-08 10:32:39,293 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:32:39,293 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-08 10:32:39,304 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-08 10:32:39,304 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-08 10:32:39,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:32:39,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-08 10:32:39,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2022-04-08 10:32:39,305 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-08 10:32:39,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:32:39,410 INFO L93 Difference]: Finished difference Result 87 states and 102 transitions. [2022-04-08 10:32:39,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-08 10:32:39,410 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-08 10:32:39,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:32:39,410 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-08 10:32:39,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 35 transitions. [2022-04-08 10:32:39,412 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-08 10:32:39,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 35 transitions. [2022-04-08 10:32:39,413 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 35 transitions. [2022-04-08 10:32:39,431 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-08 10:32:39,433 INFO L225 Difference]: With dead ends: 87 [2022-04-08 10:32:39,433 INFO L226 Difference]: Without dead ends: 56 [2022-04-08 10:32:39,433 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-08 10:32:39,433 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-08 10:32:39,433 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-08 10:32:39,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2022-04-08 10:32:39,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 52. [2022-04-08 10:32:39,464 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:32:39,464 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-08 10:32:39,464 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-08 10:32:39,464 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-08 10:32:39,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:32:39,465 INFO L93 Difference]: Finished difference Result 56 states and 62 transitions. [2022-04-08 10:32:39,465 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 62 transitions. [2022-04-08 10:32:39,466 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:32:39,466 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:32:39,466 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-08 10:32:39,466 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-08 10:32:39,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:32:39,467 INFO L93 Difference]: Finished difference Result 56 states and 62 transitions. [2022-04-08 10:32:39,467 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 62 transitions. [2022-04-08 10:32:39,467 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:32:39,467 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:32:39,467 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:32:39,467 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:32:39,467 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-08 10:32:39,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 58 transitions. [2022-04-08 10:32:39,468 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 58 transitions. Word has length 43 [2022-04-08 10:32:39,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:32:39,469 INFO L478 AbstractCegarLoop]: Abstraction has 52 states and 58 transitions. [2022-04-08 10:32:39,469 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-08 10:32:39,469 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 52 states and 58 transitions. [2022-04-08 10:32:39,523 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-08 10:32:39,523 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 58 transitions. [2022-04-08 10:32:39,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-04-08 10:32:39,523 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:32:39,524 INFO L499 BasicCegarLoop]: trace histogram [12, 12, 4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:32:39,539 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-08 10:32:39,739 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:32:39,739 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:32:39,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:32:39,740 INFO L85 PathProgramCache]: Analyzing trace with hash 735564927, now seen corresponding path program 9 times [2022-04-08 10:32:39,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:32:39,740 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [311628507] [2022-04-08 10:32:39,904 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:32:39,919 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:32:39,919 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:32:39,919 INFO L85 PathProgramCache]: Analyzing trace with hash 735564927, now seen corresponding path program 10 times [2022-04-08 10:32:39,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:32:39,919 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [833311343] [2022-04-08 10:32:39,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:32:39,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:32:39,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:32:39,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:32:39,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:32:39,980 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-08 10:32:39,980 INFO L290 TraceCheckUtils]: 1: Hoare triple {2353#true} assume true; {2353#true} is VALID [2022-04-08 10:32:39,980 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2353#true} {2353#true} #56#return; {2353#true} is VALID [2022-04-08 10:32:39,981 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-08 10:32:39,981 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-08 10:32:39,981 INFO L290 TraceCheckUtils]: 2: Hoare triple {2353#true} assume true; {2353#true} is VALID [2022-04-08 10:32:39,981 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2353#true} {2353#true} #56#return; {2353#true} is VALID [2022-04-08 10:32:39,981 INFO L272 TraceCheckUtils]: 4: Hoare triple {2353#true} call #t~ret7 := main(); {2353#true} is VALID [2022-04-08 10:32:39,981 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-08 10:32:39,981 INFO L290 TraceCheckUtils]: 6: Hoare triple {2353#true} assume !!(~a~0 < 6);~b~0 := 0; {2353#true} is VALID [2022-04-08 10:32:39,981 INFO L290 TraceCheckUtils]: 7: Hoare triple {2353#true} assume !!(~b~0 < 6);~c~0 := 0; {2358#(= main_~c~0 0)} is VALID [2022-04-08 10:32:39,981 INFO L290 TraceCheckUtils]: 8: Hoare triple {2358#(= main_~c~0 0)} assume !!(~c~0 < 6); {2358#(= main_~c~0 0)} is VALID [2022-04-08 10:32:39,982 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-08 10:32:39,982 INFO L290 TraceCheckUtils]: 10: Hoare triple {2359#(<= main_~c~0 1)} assume !!(~c~0 < 6); {2359#(<= main_~c~0 1)} is VALID [2022-04-08 10:32:39,982 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-08 10:32:39,983 INFO L290 TraceCheckUtils]: 12: Hoare triple {2360#(<= main_~c~0 2)} assume !!(~c~0 < 6); {2360#(<= main_~c~0 2)} is VALID [2022-04-08 10:32:39,983 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-08 10:32:39,983 INFO L290 TraceCheckUtils]: 14: Hoare triple {2361#(<= main_~c~0 3)} assume !(~c~0 < 6); {2354#false} is VALID [2022-04-08 10:32:39,983 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-08 10:32:39,983 INFO L290 TraceCheckUtils]: 16: Hoare triple {2354#false} assume !!(~b~0 < 6);~c~0 := 0; {2354#false} is VALID [2022-04-08 10:32:39,983 INFO L290 TraceCheckUtils]: 17: Hoare triple {2354#false} assume !!(~c~0 < 6); {2354#false} is VALID [2022-04-08 10:32:39,983 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-08 10:32:39,984 INFO L290 TraceCheckUtils]: 19: Hoare triple {2354#false} assume !!(~c~0 < 6); {2354#false} is VALID [2022-04-08 10:32:39,984 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-08 10:32:39,984 INFO L290 TraceCheckUtils]: 21: Hoare triple {2354#false} assume !!(~c~0 < 6); {2354#false} is VALID [2022-04-08 10:32:39,984 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-08 10:32:39,984 INFO L290 TraceCheckUtils]: 23: Hoare triple {2354#false} assume !(~c~0 < 6); {2354#false} is VALID [2022-04-08 10:32:39,984 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-08 10:32:39,984 INFO L290 TraceCheckUtils]: 25: Hoare triple {2354#false} assume !(~b~0 < 6); {2354#false} is VALID [2022-04-08 10:32:39,984 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-08 10:32:39,984 INFO L290 TraceCheckUtils]: 27: Hoare triple {2354#false} assume !!(~a~0 < 6);~b~0 := 0; {2354#false} is VALID [2022-04-08 10:32:39,984 INFO L290 TraceCheckUtils]: 28: Hoare triple {2354#false} assume !!(~b~0 < 6);~c~0 := 0; {2354#false} is VALID [2022-04-08 10:32:39,984 INFO L290 TraceCheckUtils]: 29: Hoare triple {2354#false} assume !!(~c~0 < 6); {2354#false} is VALID [2022-04-08 10:32:39,984 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-08 10:32:39,984 INFO L290 TraceCheckUtils]: 31: Hoare triple {2354#false} assume !!(~c~0 < 6); {2354#false} is VALID [2022-04-08 10:32:39,985 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-08 10:32:39,985 INFO L290 TraceCheckUtils]: 33: Hoare triple {2354#false} assume !!(~c~0 < 6); {2354#false} is VALID [2022-04-08 10:32:39,985 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-08 10:32:39,985 INFO L290 TraceCheckUtils]: 35: Hoare triple {2354#false} assume !(~c~0 < 6); {2354#false} is VALID [2022-04-08 10:32:39,985 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-08 10:32:39,985 INFO L290 TraceCheckUtils]: 37: Hoare triple {2354#false} assume !!(~b~0 < 6);~c~0 := 0; {2354#false} is VALID [2022-04-08 10:32:39,985 INFO L290 TraceCheckUtils]: 38: Hoare triple {2354#false} assume !!(~c~0 < 6); {2354#false} is VALID [2022-04-08 10:32:39,985 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-08 10:32:39,985 INFO L290 TraceCheckUtils]: 40: Hoare triple {2354#false} assume !!(~c~0 < 6); {2354#false} is VALID [2022-04-08 10:32:39,985 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-08 10:32:39,985 INFO L290 TraceCheckUtils]: 42: Hoare triple {2354#false} assume !!(~c~0 < 6); {2354#false} is VALID [2022-04-08 10:32:39,985 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-08 10:32:39,986 INFO L290 TraceCheckUtils]: 44: Hoare triple {2354#false} assume !(~c~0 < 6); {2354#false} is VALID [2022-04-08 10:32:39,986 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-08 10:32:39,986 INFO L290 TraceCheckUtils]: 46: Hoare triple {2354#false} assume !(~b~0 < 6); {2354#false} is VALID [2022-04-08 10:32:39,986 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-08 10:32:39,986 INFO L290 TraceCheckUtils]: 48: Hoare triple {2354#false} assume !(~a~0 < 6); {2354#false} is VALID [2022-04-08 10:32:39,986 INFO L290 TraceCheckUtils]: 49: Hoare triple {2354#false} assume !((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0); {2354#false} is VALID [2022-04-08 10:32:39,986 INFO L290 TraceCheckUtils]: 50: Hoare triple {2354#false} assume !false; {2354#false} is VALID [2022-04-08 10:32:39,987 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-08 10:32:39,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:32:39,988 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [833311343] [2022-04-08 10:32:39,988 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [833311343] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:32:39,988 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2112241449] [2022-04-08 10:32:39,988 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 10:32:39,988 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:32:39,988 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:32:39,989 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-08 10:32:39,989 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-08 10:32:40,021 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 10:32:40,022 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:32:40,022 INFO L263 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-08 10:32:40,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:32:40,030 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:32:40,116 INFO L272 TraceCheckUtils]: 0: Hoare triple {2353#true} call ULTIMATE.init(); {2353#true} is VALID [2022-04-08 10:32:40,116 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-08 10:32:40,116 INFO L290 TraceCheckUtils]: 2: Hoare triple {2353#true} assume true; {2353#true} is VALID [2022-04-08 10:32:40,116 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2353#true} {2353#true} #56#return; {2353#true} is VALID [2022-04-08 10:32:40,117 INFO L272 TraceCheckUtils]: 4: Hoare triple {2353#true} call #t~ret7 := main(); {2353#true} is VALID [2022-04-08 10:32:40,117 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-08 10:32:40,117 INFO L290 TraceCheckUtils]: 6: Hoare triple {2353#true} assume !!(~a~0 < 6);~b~0 := 0; {2353#true} is VALID [2022-04-08 10:32:40,117 INFO L290 TraceCheckUtils]: 7: Hoare triple {2353#true} assume !!(~b~0 < 6);~c~0 := 0; {2387#(<= main_~c~0 0)} is VALID [2022-04-08 10:32:40,117 INFO L290 TraceCheckUtils]: 8: Hoare triple {2387#(<= main_~c~0 0)} assume !!(~c~0 < 6); {2387#(<= main_~c~0 0)} is VALID [2022-04-08 10:32:40,118 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-08 10:32:40,118 INFO L290 TraceCheckUtils]: 10: Hoare triple {2359#(<= main_~c~0 1)} assume !!(~c~0 < 6); {2359#(<= main_~c~0 1)} is VALID [2022-04-08 10:32:40,118 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-08 10:32:40,118 INFO L290 TraceCheckUtils]: 12: Hoare triple {2360#(<= main_~c~0 2)} assume !!(~c~0 < 6); {2360#(<= main_~c~0 2)} is VALID [2022-04-08 10:32:40,119 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-08 10:32:40,119 INFO L290 TraceCheckUtils]: 14: Hoare triple {2361#(<= main_~c~0 3)} assume !(~c~0 < 6); {2354#false} is VALID [2022-04-08 10:32:40,119 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-08 10:32:40,119 INFO L290 TraceCheckUtils]: 16: Hoare triple {2354#false} assume !!(~b~0 < 6);~c~0 := 0; {2354#false} is VALID [2022-04-08 10:32:40,119 INFO L290 TraceCheckUtils]: 17: Hoare triple {2354#false} assume !!(~c~0 < 6); {2354#false} is VALID [2022-04-08 10:32:40,119 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-08 10:32:40,119 INFO L290 TraceCheckUtils]: 19: Hoare triple {2354#false} assume !!(~c~0 < 6); {2354#false} is VALID [2022-04-08 10:32:40,119 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-08 10:32:40,119 INFO L290 TraceCheckUtils]: 21: Hoare triple {2354#false} assume !!(~c~0 < 6); {2354#false} is VALID [2022-04-08 10:32:40,119 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-08 10:32:40,119 INFO L290 TraceCheckUtils]: 23: Hoare triple {2354#false} assume !(~c~0 < 6); {2354#false} is VALID [2022-04-08 10:32:40,120 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-08 10:32:40,120 INFO L290 TraceCheckUtils]: 25: Hoare triple {2354#false} assume !(~b~0 < 6); {2354#false} is VALID [2022-04-08 10:32:40,120 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-08 10:32:40,120 INFO L290 TraceCheckUtils]: 27: Hoare triple {2354#false} assume !!(~a~0 < 6);~b~0 := 0; {2354#false} is VALID [2022-04-08 10:32:40,120 INFO L290 TraceCheckUtils]: 28: Hoare triple {2354#false} assume !!(~b~0 < 6);~c~0 := 0; {2354#false} is VALID [2022-04-08 10:32:40,120 INFO L290 TraceCheckUtils]: 29: Hoare triple {2354#false} assume !!(~c~0 < 6); {2354#false} is VALID [2022-04-08 10:32:40,120 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-08 10:32:40,120 INFO L290 TraceCheckUtils]: 31: Hoare triple {2354#false} assume !!(~c~0 < 6); {2354#false} is VALID [2022-04-08 10:32:40,120 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-08 10:32:40,120 INFO L290 TraceCheckUtils]: 33: Hoare triple {2354#false} assume !!(~c~0 < 6); {2354#false} is VALID [2022-04-08 10:32:40,120 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-08 10:32:40,120 INFO L290 TraceCheckUtils]: 35: Hoare triple {2354#false} assume !(~c~0 < 6); {2354#false} is VALID [2022-04-08 10:32:40,120 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-08 10:32:40,120 INFO L290 TraceCheckUtils]: 37: Hoare triple {2354#false} assume !!(~b~0 < 6);~c~0 := 0; {2354#false} is VALID [2022-04-08 10:32:40,120 INFO L290 TraceCheckUtils]: 38: Hoare triple {2354#false} assume !!(~c~0 < 6); {2354#false} is VALID [2022-04-08 10:32:40,120 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-08 10:32:40,120 INFO L290 TraceCheckUtils]: 40: Hoare triple {2354#false} assume !!(~c~0 < 6); {2354#false} is VALID [2022-04-08 10:32:40,121 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-08 10:32:40,121 INFO L290 TraceCheckUtils]: 42: Hoare triple {2354#false} assume !!(~c~0 < 6); {2354#false} is VALID [2022-04-08 10:32:40,121 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-08 10:32:40,121 INFO L290 TraceCheckUtils]: 44: Hoare triple {2354#false} assume !(~c~0 < 6); {2354#false} is VALID [2022-04-08 10:32:40,121 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-08 10:32:40,121 INFO L290 TraceCheckUtils]: 46: Hoare triple {2354#false} assume !(~b~0 < 6); {2354#false} is VALID [2022-04-08 10:32:40,121 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-08 10:32:40,121 INFO L290 TraceCheckUtils]: 48: Hoare triple {2354#false} assume !(~a~0 < 6); {2354#false} is VALID [2022-04-08 10:32:40,121 INFO L290 TraceCheckUtils]: 49: Hoare triple {2354#false} assume !((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0); {2354#false} is VALID [2022-04-08 10:32:40,121 INFO L290 TraceCheckUtils]: 50: Hoare triple {2354#false} assume !false; {2354#false} is VALID [2022-04-08 10:32:40,121 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-08 10:32:40,121 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:32:40,243 INFO L290 TraceCheckUtils]: 50: Hoare triple {2354#false} assume !false; {2354#false} is VALID [2022-04-08 10:32:40,243 INFO L290 TraceCheckUtils]: 49: Hoare triple {2354#false} assume !((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0); {2354#false} is VALID [2022-04-08 10:32:40,243 INFO L290 TraceCheckUtils]: 48: Hoare triple {2354#false} assume !(~a~0 < 6); {2354#false} is VALID [2022-04-08 10:32:40,243 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-08 10:32:40,243 INFO L290 TraceCheckUtils]: 46: Hoare triple {2354#false} assume !(~b~0 < 6); {2354#false} is VALID [2022-04-08 10:32:40,243 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-08 10:32:40,243 INFO L290 TraceCheckUtils]: 44: Hoare triple {2354#false} assume !(~c~0 < 6); {2354#false} is VALID [2022-04-08 10:32:40,244 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-08 10:32:40,244 INFO L290 TraceCheckUtils]: 42: Hoare triple {2354#false} assume !!(~c~0 < 6); {2354#false} is VALID [2022-04-08 10:32:40,244 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-08 10:32:40,244 INFO L290 TraceCheckUtils]: 40: Hoare triple {2354#false} assume !!(~c~0 < 6); {2354#false} is VALID [2022-04-08 10:32:40,244 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-08 10:32:40,244 INFO L290 TraceCheckUtils]: 38: Hoare triple {2354#false} assume !!(~c~0 < 6); {2354#false} is VALID [2022-04-08 10:32:40,244 INFO L290 TraceCheckUtils]: 37: Hoare triple {2354#false} assume !!(~b~0 < 6);~c~0 := 0; {2354#false} is VALID [2022-04-08 10:32:40,244 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-08 10:32:40,244 INFO L290 TraceCheckUtils]: 35: Hoare triple {2354#false} assume !(~c~0 < 6); {2354#false} is VALID [2022-04-08 10:32:40,244 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-08 10:32:40,245 INFO L290 TraceCheckUtils]: 33: Hoare triple {2354#false} assume !!(~c~0 < 6); {2354#false} is VALID [2022-04-08 10:32:40,245 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-08 10:32:40,246 INFO L290 TraceCheckUtils]: 31: Hoare triple {2354#false} assume !!(~c~0 < 6); {2354#false} is VALID [2022-04-08 10:32:40,246 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-08 10:32:40,246 INFO L290 TraceCheckUtils]: 29: Hoare triple {2354#false} assume !!(~c~0 < 6); {2354#false} is VALID [2022-04-08 10:32:40,246 INFO L290 TraceCheckUtils]: 28: Hoare triple {2354#false} assume !!(~b~0 < 6);~c~0 := 0; {2354#false} is VALID [2022-04-08 10:32:40,246 INFO L290 TraceCheckUtils]: 27: Hoare triple {2354#false} assume !!(~a~0 < 6);~b~0 := 0; {2354#false} is VALID [2022-04-08 10:32:40,246 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-08 10:32:40,246 INFO L290 TraceCheckUtils]: 25: Hoare triple {2354#false} assume !(~b~0 < 6); {2354#false} is VALID [2022-04-08 10:32:40,246 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-08 10:32:40,246 INFO L290 TraceCheckUtils]: 23: Hoare triple {2354#false} assume !(~c~0 < 6); {2354#false} is VALID [2022-04-08 10:32:40,246 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-08 10:32:40,246 INFO L290 TraceCheckUtils]: 21: Hoare triple {2354#false} assume !!(~c~0 < 6); {2354#false} is VALID [2022-04-08 10:32:40,246 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-08 10:32:40,246 INFO L290 TraceCheckUtils]: 19: Hoare triple {2354#false} assume !!(~c~0 < 6); {2354#false} is VALID [2022-04-08 10:32:40,246 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-08 10:32:40,246 INFO L290 TraceCheckUtils]: 17: Hoare triple {2354#false} assume !!(~c~0 < 6); {2354#false} is VALID [2022-04-08 10:32:40,246 INFO L290 TraceCheckUtils]: 16: Hoare triple {2354#false} assume !!(~b~0 < 6);~c~0 := 0; {2354#false} is VALID [2022-04-08 10:32:40,246 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-08 10:32:40,247 INFO L290 TraceCheckUtils]: 14: Hoare triple {2625#(< main_~c~0 6)} assume !(~c~0 < 6); {2354#false} is VALID [2022-04-08 10:32:40,247 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-08 10:32:40,247 INFO L290 TraceCheckUtils]: 12: Hoare triple {2629#(< main_~c~0 5)} assume !!(~c~0 < 6); {2629#(< main_~c~0 5)} is VALID [2022-04-08 10:32:40,248 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-08 10:32:40,248 INFO L290 TraceCheckUtils]: 10: Hoare triple {2361#(<= main_~c~0 3)} assume !!(~c~0 < 6); {2361#(<= main_~c~0 3)} is VALID [2022-04-08 10:32:40,248 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-08 10:32:40,249 INFO L290 TraceCheckUtils]: 8: Hoare triple {2360#(<= main_~c~0 2)} assume !!(~c~0 < 6); {2360#(<= main_~c~0 2)} is VALID [2022-04-08 10:32:40,249 INFO L290 TraceCheckUtils]: 7: Hoare triple {2353#true} assume !!(~b~0 < 6);~c~0 := 0; {2360#(<= main_~c~0 2)} is VALID [2022-04-08 10:32:40,249 INFO L290 TraceCheckUtils]: 6: Hoare triple {2353#true} assume !!(~a~0 < 6);~b~0 := 0; {2353#true} is VALID [2022-04-08 10:32:40,249 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-08 10:32:40,249 INFO L272 TraceCheckUtils]: 4: Hoare triple {2353#true} call #t~ret7 := main(); {2353#true} is VALID [2022-04-08 10:32:40,249 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2353#true} {2353#true} #56#return; {2353#true} is VALID [2022-04-08 10:32:40,249 INFO L290 TraceCheckUtils]: 2: Hoare triple {2353#true} assume true; {2353#true} is VALID [2022-04-08 10:32:40,249 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-08 10:32:40,249 INFO L272 TraceCheckUtils]: 0: Hoare triple {2353#true} call ULTIMATE.init(); {2353#true} is VALID [2022-04-08 10:32:40,249 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-08 10:32:40,250 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2112241449] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:32:40,250 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:32:40,250 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 10 [2022-04-08 10:32:40,250 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:32:40,250 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [311628507] [2022-04-08 10:32:40,250 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [311628507] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:32:40,250 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:32:40,250 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-08 10:32:40,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [220762476] [2022-04-08 10:32:40,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:32:40,251 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-08 10:32:40,251 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:32:40,251 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-08 10:32:40,265 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-08 10:32:40,265 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-08 10:32:40,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:32:40,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-08 10:32:40,266 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2022-04-08 10:32:40,266 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-08 10:32:40,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:32:40,395 INFO L93 Difference]: Finished difference Result 101 states and 116 transitions. [2022-04-08 10:32:40,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-08 10:32:40,395 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-08 10:32:40,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:32:40,396 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-08 10:32:40,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 37 transitions. [2022-04-08 10:32:40,396 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-08 10:32:40,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 37 transitions. [2022-04-08 10:32:40,397 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 37 transitions. [2022-04-08 10:32:40,418 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-08 10:32:40,419 INFO L225 Difference]: With dead ends: 101 [2022-04-08 10:32:40,419 INFO L226 Difference]: Without dead ends: 64 [2022-04-08 10:32:40,420 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-08 10:32:40,420 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-08 10:32:40,420 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-08 10:32:40,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2022-04-08 10:32:40,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 60. [2022-04-08 10:32:40,464 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:32:40,464 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-08 10:32:40,465 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-08 10:32:40,466 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-08 10:32:40,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:32:40,471 INFO L93 Difference]: Finished difference Result 64 states and 70 transitions. [2022-04-08 10:32:40,472 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 70 transitions. [2022-04-08 10:32:40,472 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:32:40,472 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:32:40,472 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-08 10:32:40,472 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-08 10:32:40,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:32:40,474 INFO L93 Difference]: Finished difference Result 64 states and 70 transitions. [2022-04-08 10:32:40,474 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 70 transitions. [2022-04-08 10:32:40,474 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:32:40,474 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:32:40,474 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:32:40,474 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:32:40,474 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-08 10:32:40,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 66 transitions. [2022-04-08 10:32:40,475 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 66 transitions. Word has length 51 [2022-04-08 10:32:40,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:32:40,475 INFO L478 AbstractCegarLoop]: Abstraction has 60 states and 66 transitions. [2022-04-08 10:32:40,475 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-08 10:32:40,476 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 60 states and 66 transitions. [2022-04-08 10:32:40,522 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-08 10:32:40,522 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 66 transitions. [2022-04-08 10:32:40,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-04-08 10:32:40,523 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:32:40,523 INFO L499 BasicCegarLoop]: trace histogram [16, 16, 4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:32:40,541 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-08 10:32:40,738 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:32:40,738 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:32:40,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:32:40,739 INFO L85 PathProgramCache]: Analyzing trace with hash 954849791, now seen corresponding path program 11 times [2022-04-08 10:32:40,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:32:40,739 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [666279660] [2022-04-08 10:32:40,909 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:32:40,932 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:32:40,932 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:32:40,932 INFO L85 PathProgramCache]: Analyzing trace with hash 954849791, now seen corresponding path program 12 times [2022-04-08 10:32:40,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:32:40,932 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [521661235] [2022-04-08 10:32:40,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:32:40,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:32:40,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:32:40,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:32:40,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:32:40,996 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-08 10:32:40,996 INFO L290 TraceCheckUtils]: 1: Hoare triple {3129#true} assume true; {3129#true} is VALID [2022-04-08 10:32:40,996 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3129#true} {3129#true} #56#return; {3129#true} is VALID [2022-04-08 10:32:40,996 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-08 10:32:40,996 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-08 10:32:40,996 INFO L290 TraceCheckUtils]: 2: Hoare triple {3129#true} assume true; {3129#true} is VALID [2022-04-08 10:32:40,996 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3129#true} {3129#true} #56#return; {3129#true} is VALID [2022-04-08 10:32:40,997 INFO L272 TraceCheckUtils]: 4: Hoare triple {3129#true} call #t~ret7 := main(); {3129#true} is VALID [2022-04-08 10:32:40,997 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-08 10:32:40,997 INFO L290 TraceCheckUtils]: 6: Hoare triple {3129#true} assume !!(~a~0 < 6);~b~0 := 0; {3129#true} is VALID [2022-04-08 10:32:40,997 INFO L290 TraceCheckUtils]: 7: Hoare triple {3129#true} assume !!(~b~0 < 6);~c~0 := 0; {3134#(= main_~c~0 0)} is VALID [2022-04-08 10:32:40,997 INFO L290 TraceCheckUtils]: 8: Hoare triple {3134#(= main_~c~0 0)} assume !!(~c~0 < 6); {3134#(= main_~c~0 0)} is VALID [2022-04-08 10:32:40,997 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-08 10:32:40,998 INFO L290 TraceCheckUtils]: 10: Hoare triple {3135#(<= main_~c~0 1)} assume !!(~c~0 < 6); {3135#(<= main_~c~0 1)} is VALID [2022-04-08 10:32:40,998 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-08 10:32:40,998 INFO L290 TraceCheckUtils]: 12: Hoare triple {3136#(<= main_~c~0 2)} assume !!(~c~0 < 6); {3136#(<= main_~c~0 2)} is VALID [2022-04-08 10:32:40,998 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-08 10:32:40,999 INFO L290 TraceCheckUtils]: 14: Hoare triple {3137#(<= main_~c~0 3)} assume !!(~c~0 < 6); {3137#(<= main_~c~0 3)} is VALID [2022-04-08 10:32:40,999 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-08 10:32:40,999 INFO L290 TraceCheckUtils]: 16: Hoare triple {3138#(<= main_~c~0 4)} assume !(~c~0 < 6); {3130#false} is VALID [2022-04-08 10:32:40,999 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-08 10:32:40,999 INFO L290 TraceCheckUtils]: 18: Hoare triple {3130#false} assume !!(~b~0 < 6);~c~0 := 0; {3130#false} is VALID [2022-04-08 10:32:40,999 INFO L290 TraceCheckUtils]: 19: Hoare triple {3130#false} assume !!(~c~0 < 6); {3130#false} is VALID [2022-04-08 10:32:41,000 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-08 10:32:41,000 INFO L290 TraceCheckUtils]: 21: Hoare triple {3130#false} assume !!(~c~0 < 6); {3130#false} is VALID [2022-04-08 10:32:41,000 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-08 10:32:41,000 INFO L290 TraceCheckUtils]: 23: Hoare triple {3130#false} assume !!(~c~0 < 6); {3130#false} is VALID [2022-04-08 10:32:41,000 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-08 10:32:41,000 INFO L290 TraceCheckUtils]: 25: Hoare triple {3130#false} assume !!(~c~0 < 6); {3130#false} is VALID [2022-04-08 10:32:41,000 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-08 10:32:41,000 INFO L290 TraceCheckUtils]: 27: Hoare triple {3130#false} assume !(~c~0 < 6); {3130#false} is VALID [2022-04-08 10:32:41,000 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-08 10:32:41,000 INFO L290 TraceCheckUtils]: 29: Hoare triple {3130#false} assume !(~b~0 < 6); {3130#false} is VALID [2022-04-08 10:32:41,000 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-08 10:32:41,000 INFO L290 TraceCheckUtils]: 31: Hoare triple {3130#false} assume !!(~a~0 < 6);~b~0 := 0; {3130#false} is VALID [2022-04-08 10:32:41,000 INFO L290 TraceCheckUtils]: 32: Hoare triple {3130#false} assume !!(~b~0 < 6);~c~0 := 0; {3130#false} is VALID [2022-04-08 10:32:41,000 INFO L290 TraceCheckUtils]: 33: Hoare triple {3130#false} assume !!(~c~0 < 6); {3130#false} is VALID [2022-04-08 10:32:41,000 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-08 10:32:41,000 INFO L290 TraceCheckUtils]: 35: Hoare triple {3130#false} assume !!(~c~0 < 6); {3130#false} is VALID [2022-04-08 10:32:41,000 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-08 10:32:41,000 INFO L290 TraceCheckUtils]: 37: Hoare triple {3130#false} assume !!(~c~0 < 6); {3130#false} is VALID [2022-04-08 10:32:41,001 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-08 10:32:41,001 INFO L290 TraceCheckUtils]: 39: Hoare triple {3130#false} assume !!(~c~0 < 6); {3130#false} is VALID [2022-04-08 10:32:41,001 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-08 10:32:41,001 INFO L290 TraceCheckUtils]: 41: Hoare triple {3130#false} assume !(~c~0 < 6); {3130#false} is VALID [2022-04-08 10:32:41,001 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-08 10:32:41,001 INFO L290 TraceCheckUtils]: 43: Hoare triple {3130#false} assume !!(~b~0 < 6);~c~0 := 0; {3130#false} is VALID [2022-04-08 10:32:41,001 INFO L290 TraceCheckUtils]: 44: Hoare triple {3130#false} assume !!(~c~0 < 6); {3130#false} is VALID [2022-04-08 10:32:41,001 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-08 10:32:41,001 INFO L290 TraceCheckUtils]: 46: Hoare triple {3130#false} assume !!(~c~0 < 6); {3130#false} is VALID [2022-04-08 10:32:41,001 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-08 10:32:41,001 INFO L290 TraceCheckUtils]: 48: Hoare triple {3130#false} assume !!(~c~0 < 6); {3130#false} is VALID [2022-04-08 10:32:41,001 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-08 10:32:41,001 INFO L290 TraceCheckUtils]: 50: Hoare triple {3130#false} assume !!(~c~0 < 6); {3130#false} is VALID [2022-04-08 10:32:41,001 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-08 10:32:41,001 INFO L290 TraceCheckUtils]: 52: Hoare triple {3130#false} assume !(~c~0 < 6); {3130#false} is VALID [2022-04-08 10:32:41,001 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-08 10:32:41,001 INFO L290 TraceCheckUtils]: 54: Hoare triple {3130#false} assume !(~b~0 < 6); {3130#false} is VALID [2022-04-08 10:32:41,001 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-08 10:32:41,001 INFO L290 TraceCheckUtils]: 56: Hoare triple {3130#false} assume !(~a~0 < 6); {3130#false} is VALID [2022-04-08 10:32:41,002 INFO L290 TraceCheckUtils]: 57: Hoare triple {3130#false} assume !((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0); {3130#false} is VALID [2022-04-08 10:32:41,002 INFO L290 TraceCheckUtils]: 58: Hoare triple {3130#false} assume !false; {3130#false} is VALID [2022-04-08 10:32:41,002 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-08 10:32:41,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:32:41,002 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [521661235] [2022-04-08 10:32:41,002 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [521661235] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:32:41,002 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [405766347] [2022-04-08 10:32:41,002 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 10:32:41,002 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:32:41,002 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:32:41,003 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-08 10:32:41,028 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-08 10:32:41,057 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 10 check-sat command(s) [2022-04-08 10:32:41,057 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:32:41,058 INFO L263 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 6 conjunts are in the unsatisfiable core [2022-04-08 10:32:41,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:32:41,066 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:32:41,176 INFO L272 TraceCheckUtils]: 0: Hoare triple {3129#true} call ULTIMATE.init(); {3129#true} is VALID [2022-04-08 10:32:41,176 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-08 10:32:41,176 INFO L290 TraceCheckUtils]: 2: Hoare triple {3129#true} assume true; {3129#true} is VALID [2022-04-08 10:32:41,176 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3129#true} {3129#true} #56#return; {3129#true} is VALID [2022-04-08 10:32:41,176 INFO L272 TraceCheckUtils]: 4: Hoare triple {3129#true} call #t~ret7 := main(); {3129#true} is VALID [2022-04-08 10:32:41,176 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-08 10:32:41,176 INFO L290 TraceCheckUtils]: 6: Hoare triple {3129#true} assume !!(~a~0 < 6);~b~0 := 0; {3129#true} is VALID [2022-04-08 10:32:41,176 INFO L290 TraceCheckUtils]: 7: Hoare triple {3129#true} assume !!(~b~0 < 6);~c~0 := 0; {3129#true} is VALID [2022-04-08 10:32:41,176 INFO L290 TraceCheckUtils]: 8: Hoare triple {3129#true} assume !!(~c~0 < 6); {3129#true} is VALID [2022-04-08 10:32:41,176 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-08 10:32:41,176 INFO L290 TraceCheckUtils]: 10: Hoare triple {3129#true} assume !!(~c~0 < 6); {3129#true} is VALID [2022-04-08 10:32:41,176 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-08 10:32:41,176 INFO L290 TraceCheckUtils]: 12: Hoare triple {3129#true} assume !!(~c~0 < 6); {3129#true} is VALID [2022-04-08 10:32:41,176 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-08 10:32:41,177 INFO L290 TraceCheckUtils]: 14: Hoare triple {3129#true} assume !!(~c~0 < 6); {3129#true} is VALID [2022-04-08 10:32:41,177 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-08 10:32:41,177 INFO L290 TraceCheckUtils]: 16: Hoare triple {3129#true} assume !(~c~0 < 6); {3129#true} is VALID [2022-04-08 10:32:41,177 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-08 10:32:41,177 INFO L290 TraceCheckUtils]: 18: Hoare triple {3129#true} assume !!(~b~0 < 6);~c~0 := 0; {3197#(<= main_~c~0 0)} is VALID [2022-04-08 10:32:41,177 INFO L290 TraceCheckUtils]: 19: Hoare triple {3197#(<= main_~c~0 0)} assume !!(~c~0 < 6); {3197#(<= main_~c~0 0)} is VALID [2022-04-08 10:32:41,178 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-08 10:32:41,178 INFO L290 TraceCheckUtils]: 21: Hoare triple {3135#(<= main_~c~0 1)} assume !!(~c~0 < 6); {3135#(<= main_~c~0 1)} is VALID [2022-04-08 10:32:41,178 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-08 10:32:41,178 INFO L290 TraceCheckUtils]: 23: Hoare triple {3136#(<= main_~c~0 2)} assume !!(~c~0 < 6); {3136#(<= main_~c~0 2)} is VALID [2022-04-08 10:32:41,179 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-08 10:32:41,179 INFO L290 TraceCheckUtils]: 25: Hoare triple {3137#(<= main_~c~0 3)} assume !!(~c~0 < 6); {3137#(<= main_~c~0 3)} is VALID [2022-04-08 10:32:41,179 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-08 10:32:41,180 INFO L290 TraceCheckUtils]: 27: Hoare triple {3138#(<= main_~c~0 4)} assume !(~c~0 < 6); {3130#false} is VALID [2022-04-08 10:32:41,180 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-08 10:32:41,180 INFO L290 TraceCheckUtils]: 29: Hoare triple {3130#false} assume !(~b~0 < 6); {3130#false} is VALID [2022-04-08 10:32:41,180 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-08 10:32:41,180 INFO L290 TraceCheckUtils]: 31: Hoare triple {3130#false} assume !!(~a~0 < 6);~b~0 := 0; {3130#false} is VALID [2022-04-08 10:32:41,180 INFO L290 TraceCheckUtils]: 32: Hoare triple {3130#false} assume !!(~b~0 < 6);~c~0 := 0; {3130#false} is VALID [2022-04-08 10:32:41,180 INFO L290 TraceCheckUtils]: 33: Hoare triple {3130#false} assume !!(~c~0 < 6); {3130#false} is VALID [2022-04-08 10:32:41,180 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-08 10:32:41,180 INFO L290 TraceCheckUtils]: 35: Hoare triple {3130#false} assume !!(~c~0 < 6); {3130#false} is VALID [2022-04-08 10:32:41,180 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-08 10:32:41,180 INFO L290 TraceCheckUtils]: 37: Hoare triple {3130#false} assume !!(~c~0 < 6); {3130#false} is VALID [2022-04-08 10:32:41,180 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-08 10:32:41,180 INFO L290 TraceCheckUtils]: 39: Hoare triple {3130#false} assume !!(~c~0 < 6); {3130#false} is VALID [2022-04-08 10:32:41,180 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-08 10:32:41,180 INFO L290 TraceCheckUtils]: 41: Hoare triple {3130#false} assume !(~c~0 < 6); {3130#false} is VALID [2022-04-08 10:32:41,180 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-08 10:32:41,180 INFO L290 TraceCheckUtils]: 43: Hoare triple {3130#false} assume !!(~b~0 < 6);~c~0 := 0; {3130#false} is VALID [2022-04-08 10:32:41,181 INFO L290 TraceCheckUtils]: 44: Hoare triple {3130#false} assume !!(~c~0 < 6); {3130#false} is VALID [2022-04-08 10:32:41,181 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-08 10:32:41,181 INFO L290 TraceCheckUtils]: 46: Hoare triple {3130#false} assume !!(~c~0 < 6); {3130#false} is VALID [2022-04-08 10:32:41,181 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-08 10:32:41,181 INFO L290 TraceCheckUtils]: 48: Hoare triple {3130#false} assume !!(~c~0 < 6); {3130#false} is VALID [2022-04-08 10:32:41,181 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-08 10:32:41,181 INFO L290 TraceCheckUtils]: 50: Hoare triple {3130#false} assume !!(~c~0 < 6); {3130#false} is VALID [2022-04-08 10:32:41,181 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-08 10:32:41,181 INFO L290 TraceCheckUtils]: 52: Hoare triple {3130#false} assume !(~c~0 < 6); {3130#false} is VALID [2022-04-08 10:32:41,181 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-08 10:32:41,181 INFO L290 TraceCheckUtils]: 54: Hoare triple {3130#false} assume !(~b~0 < 6); {3130#false} is VALID [2022-04-08 10:32:41,181 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-08 10:32:41,181 INFO L290 TraceCheckUtils]: 56: Hoare triple {3130#false} assume !(~a~0 < 6); {3130#false} is VALID [2022-04-08 10:32:41,181 INFO L290 TraceCheckUtils]: 57: Hoare triple {3130#false} assume !((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0); {3130#false} is VALID [2022-04-08 10:32:41,181 INFO L290 TraceCheckUtils]: 58: Hoare triple {3130#false} assume !false; {3130#false} is VALID [2022-04-08 10:32:41,182 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-08 10:32:41,182 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:32:41,325 INFO L290 TraceCheckUtils]: 58: Hoare triple {3130#false} assume !false; {3130#false} is VALID [2022-04-08 10:32:41,325 INFO L290 TraceCheckUtils]: 57: Hoare triple {3130#false} assume !((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0); {3130#false} is VALID [2022-04-08 10:32:41,325 INFO L290 TraceCheckUtils]: 56: Hoare triple {3130#false} assume !(~a~0 < 6); {3130#false} is VALID [2022-04-08 10:32:41,325 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-08 10:32:41,325 INFO L290 TraceCheckUtils]: 54: Hoare triple {3130#false} assume !(~b~0 < 6); {3130#false} is VALID [2022-04-08 10:32:41,326 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-08 10:32:41,326 INFO L290 TraceCheckUtils]: 52: Hoare triple {3130#false} assume !(~c~0 < 6); {3130#false} is VALID [2022-04-08 10:32:41,326 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-08 10:32:41,326 INFO L290 TraceCheckUtils]: 50: Hoare triple {3130#false} assume !!(~c~0 < 6); {3130#false} is VALID [2022-04-08 10:32:41,326 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-08 10:32:41,326 INFO L290 TraceCheckUtils]: 48: Hoare triple {3130#false} assume !!(~c~0 < 6); {3130#false} is VALID [2022-04-08 10:32:41,326 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-08 10:32:41,326 INFO L290 TraceCheckUtils]: 46: Hoare triple {3130#false} assume !!(~c~0 < 6); {3130#false} is VALID [2022-04-08 10:32:41,326 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-08 10:32:41,326 INFO L290 TraceCheckUtils]: 44: Hoare triple {3130#false} assume !!(~c~0 < 6); {3130#false} is VALID [2022-04-08 10:32:41,326 INFO L290 TraceCheckUtils]: 43: Hoare triple {3130#false} assume !!(~b~0 < 6);~c~0 := 0; {3130#false} is VALID [2022-04-08 10:32:41,326 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-08 10:32:41,326 INFO L290 TraceCheckUtils]: 41: Hoare triple {3130#false} assume !(~c~0 < 6); {3130#false} is VALID [2022-04-08 10:32:41,326 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-08 10:32:41,326 INFO L290 TraceCheckUtils]: 39: Hoare triple {3130#false} assume !!(~c~0 < 6); {3130#false} is VALID [2022-04-08 10:32:41,326 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-08 10:32:41,326 INFO L290 TraceCheckUtils]: 37: Hoare triple {3130#false} assume !!(~c~0 < 6); {3130#false} is VALID [2022-04-08 10:32:41,326 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-08 10:32:41,326 INFO L290 TraceCheckUtils]: 35: Hoare triple {3130#false} assume !!(~c~0 < 6); {3130#false} is VALID [2022-04-08 10:32:41,327 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-08 10:32:41,327 INFO L290 TraceCheckUtils]: 33: Hoare triple {3130#false} assume !!(~c~0 < 6); {3130#false} is VALID [2022-04-08 10:32:41,327 INFO L290 TraceCheckUtils]: 32: Hoare triple {3130#false} assume !!(~b~0 < 6);~c~0 := 0; {3130#false} is VALID [2022-04-08 10:32:41,327 INFO L290 TraceCheckUtils]: 31: Hoare triple {3130#false} assume !!(~a~0 < 6);~b~0 := 0; {3130#false} is VALID [2022-04-08 10:32:41,327 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-08 10:32:41,327 INFO L290 TraceCheckUtils]: 29: Hoare triple {3130#false} assume !(~b~0 < 6); {3130#false} is VALID [2022-04-08 10:32:41,327 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-08 10:32:41,327 INFO L290 TraceCheckUtils]: 27: Hoare triple {3411#(< main_~c~0 6)} assume !(~c~0 < 6); {3130#false} is VALID [2022-04-08 10:32:41,327 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-08 10:32:41,328 INFO L290 TraceCheckUtils]: 25: Hoare triple {3138#(<= main_~c~0 4)} assume !!(~c~0 < 6); {3138#(<= main_~c~0 4)} is VALID [2022-04-08 10:32:41,328 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-08 10:32:41,329 INFO L290 TraceCheckUtils]: 23: Hoare triple {3137#(<= main_~c~0 3)} assume !!(~c~0 < 6); {3137#(<= main_~c~0 3)} is VALID [2022-04-08 10:32:41,329 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-08 10:32:41,329 INFO L290 TraceCheckUtils]: 21: Hoare triple {3136#(<= main_~c~0 2)} assume !!(~c~0 < 6); {3136#(<= main_~c~0 2)} is VALID [2022-04-08 10:32:41,329 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-08 10:32:41,330 INFO L290 TraceCheckUtils]: 19: Hoare triple {3135#(<= main_~c~0 1)} assume !!(~c~0 < 6); {3135#(<= main_~c~0 1)} is VALID [2022-04-08 10:32:41,331 INFO L290 TraceCheckUtils]: 18: Hoare triple {3129#true} assume !!(~b~0 < 6);~c~0 := 0; {3135#(<= main_~c~0 1)} is VALID [2022-04-08 10:32:41,331 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-08 10:32:41,331 INFO L290 TraceCheckUtils]: 16: Hoare triple {3129#true} assume !(~c~0 < 6); {3129#true} is VALID [2022-04-08 10:32:41,331 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-08 10:32:41,331 INFO L290 TraceCheckUtils]: 14: Hoare triple {3129#true} assume !!(~c~0 < 6); {3129#true} is VALID [2022-04-08 10:32:41,331 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-08 10:32:41,331 INFO L290 TraceCheckUtils]: 12: Hoare triple {3129#true} assume !!(~c~0 < 6); {3129#true} is VALID [2022-04-08 10:32:41,331 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-08 10:32:41,331 INFO L290 TraceCheckUtils]: 10: Hoare triple {3129#true} assume !!(~c~0 < 6); {3129#true} is VALID [2022-04-08 10:32:41,331 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-08 10:32:41,331 INFO L290 TraceCheckUtils]: 8: Hoare triple {3129#true} assume !!(~c~0 < 6); {3129#true} is VALID [2022-04-08 10:32:41,331 INFO L290 TraceCheckUtils]: 7: Hoare triple {3129#true} assume !!(~b~0 < 6);~c~0 := 0; {3129#true} is VALID [2022-04-08 10:32:41,331 INFO L290 TraceCheckUtils]: 6: Hoare triple {3129#true} assume !!(~a~0 < 6);~b~0 := 0; {3129#true} is VALID [2022-04-08 10:32:41,331 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-08 10:32:41,331 INFO L272 TraceCheckUtils]: 4: Hoare triple {3129#true} call #t~ret7 := main(); {3129#true} is VALID [2022-04-08 10:32:41,331 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3129#true} {3129#true} #56#return; {3129#true} is VALID [2022-04-08 10:32:41,332 INFO L290 TraceCheckUtils]: 2: Hoare triple {3129#true} assume true; {3129#true} is VALID [2022-04-08 10:32:41,332 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-08 10:32:41,332 INFO L272 TraceCheckUtils]: 0: Hoare triple {3129#true} call ULTIMATE.init(); {3129#true} is VALID [2022-04-08 10:32:41,332 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-08 10:32:41,332 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [405766347] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:32:41,332 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:32:41,332 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 10 [2022-04-08 10:32:41,332 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:32:41,332 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [666279660] [2022-04-08 10:32:41,332 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [666279660] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:32:41,332 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:32:41,332 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-08 10:32:41,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702920151] [2022-04-08 10:32:41,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:32:41,333 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-08 10:32:41,333 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:32:41,333 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-08 10:32:41,361 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-08 10:32:41,361 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-08 10:32:41,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:32:41,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-08 10:32:41,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2022-04-08 10:32:41,362 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-08 10:32:41,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:32:41,511 INFO L93 Difference]: Finished difference Result 115 states and 130 transitions. [2022-04-08 10:32:41,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-08 10:32:41,511 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-08 10:32:41,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:32:41,511 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-08 10:32:41,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 39 transitions. [2022-04-08 10:32:41,512 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-08 10:32:41,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 39 transitions. [2022-04-08 10:32:41,513 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 39 transitions. [2022-04-08 10:32:41,544 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-08 10:32:41,545 INFO L225 Difference]: With dead ends: 115 [2022-04-08 10:32:41,545 INFO L226 Difference]: Without dead ends: 72 [2022-04-08 10:32:41,545 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-08 10:32:41,546 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-08 10:32:41,546 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-08 10:32:41,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2022-04-08 10:32:41,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 68. [2022-04-08 10:32:41,608 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:32:41,608 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-08 10:32:41,609 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-08 10:32:41,609 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-08 10:32:41,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:32:41,610 INFO L93 Difference]: Finished difference Result 72 states and 78 transitions. [2022-04-08 10:32:41,610 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 78 transitions. [2022-04-08 10:32:41,610 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:32:41,610 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:32:41,610 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-08 10:32:41,610 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-08 10:32:41,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:32:41,611 INFO L93 Difference]: Finished difference Result 72 states and 78 transitions. [2022-04-08 10:32:41,611 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 78 transitions. [2022-04-08 10:32:41,611 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:32:41,611 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:32:41,611 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:32:41,611 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:32:41,612 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-08 10:32:41,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 74 transitions. [2022-04-08 10:32:41,612 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 74 transitions. Word has length 59 [2022-04-08 10:32:41,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:32:41,613 INFO L478 AbstractCegarLoop]: Abstraction has 68 states and 74 transitions. [2022-04-08 10:32:41,613 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-08 10:32:41,613 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 68 states and 74 transitions. [2022-04-08 10:32:41,672 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-08 10:32:41,673 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 74 transitions. [2022-04-08 10:32:41,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-04-08 10:32:41,673 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:32:41,673 INFO L499 BasicCegarLoop]: trace histogram [20, 20, 4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:32:41,693 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-08 10:32:41,887 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:32:41,887 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:32:41,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:32:41,888 INFO L85 PathProgramCache]: Analyzing trace with hash 2144436095, now seen corresponding path program 13 times [2022-04-08 10:32:41,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:32:41,888 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2040762422] [2022-04-08 10:32:42,061 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:32:42,087 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:32:42,087 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:32:42,087 INFO L85 PathProgramCache]: Analyzing trace with hash 2144436095, now seen corresponding path program 14 times [2022-04-08 10:32:42,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:32:42,087 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [479268623] [2022-04-08 10:32:42,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:32:42,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:32:42,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:32:42,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:32:42,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:32:42,151 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-08 10:32:42,151 INFO L290 TraceCheckUtils]: 1: Hoare triple {4015#true} assume true; {4015#true} is VALID [2022-04-08 10:32:42,152 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4015#true} {4015#true} #56#return; {4015#true} is VALID [2022-04-08 10:32:42,152 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-08 10:32:42,152 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-08 10:32:42,152 INFO L290 TraceCheckUtils]: 2: Hoare triple {4015#true} assume true; {4015#true} is VALID [2022-04-08 10:32:42,152 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4015#true} {4015#true} #56#return; {4015#true} is VALID [2022-04-08 10:32:42,152 INFO L272 TraceCheckUtils]: 4: Hoare triple {4015#true} call #t~ret7 := main(); {4015#true} is VALID [2022-04-08 10:32:42,152 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-08 10:32:42,152 INFO L290 TraceCheckUtils]: 6: Hoare triple {4015#true} assume !!(~a~0 < 6);~b~0 := 0; {4015#true} is VALID [2022-04-08 10:32:42,153 INFO L290 TraceCheckUtils]: 7: Hoare triple {4015#true} assume !!(~b~0 < 6);~c~0 := 0; {4020#(= main_~c~0 0)} is VALID [2022-04-08 10:32:42,153 INFO L290 TraceCheckUtils]: 8: Hoare triple {4020#(= main_~c~0 0)} assume !!(~c~0 < 6); {4020#(= main_~c~0 0)} is VALID [2022-04-08 10:32:42,153 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-08 10:32:42,153 INFO L290 TraceCheckUtils]: 10: Hoare triple {4021#(<= main_~c~0 1)} assume !!(~c~0 < 6); {4021#(<= main_~c~0 1)} is VALID [2022-04-08 10:32:42,154 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-08 10:32:42,154 INFO L290 TraceCheckUtils]: 12: Hoare triple {4022#(<= main_~c~0 2)} assume !!(~c~0 < 6); {4022#(<= main_~c~0 2)} is VALID [2022-04-08 10:32:42,154 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-08 10:32:42,154 INFO L290 TraceCheckUtils]: 14: Hoare triple {4023#(<= main_~c~0 3)} assume !!(~c~0 < 6); {4023#(<= main_~c~0 3)} is VALID [2022-04-08 10:32:42,155 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-08 10:32:42,155 INFO L290 TraceCheckUtils]: 16: Hoare triple {4024#(<= main_~c~0 4)} assume !!(~c~0 < 6); {4024#(<= main_~c~0 4)} is VALID [2022-04-08 10:32:42,155 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-08 10:32:42,156 INFO L290 TraceCheckUtils]: 18: Hoare triple {4025#(<= main_~c~0 5)} assume !(~c~0 < 6); {4016#false} is VALID [2022-04-08 10:32:42,156 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-08 10:32:42,156 INFO L290 TraceCheckUtils]: 20: Hoare triple {4016#false} assume !!(~b~0 < 6);~c~0 := 0; {4016#false} is VALID [2022-04-08 10:32:42,156 INFO L290 TraceCheckUtils]: 21: Hoare triple {4016#false} assume !!(~c~0 < 6); {4016#false} is VALID [2022-04-08 10:32:42,156 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-08 10:32:42,156 INFO L290 TraceCheckUtils]: 23: Hoare triple {4016#false} assume !!(~c~0 < 6); {4016#false} is VALID [2022-04-08 10:32:42,156 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-08 10:32:42,156 INFO L290 TraceCheckUtils]: 25: Hoare triple {4016#false} assume !!(~c~0 < 6); {4016#false} is VALID [2022-04-08 10:32:42,156 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-08 10:32:42,156 INFO L290 TraceCheckUtils]: 27: Hoare triple {4016#false} assume !!(~c~0 < 6); {4016#false} is VALID [2022-04-08 10:32:42,156 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-08 10:32:42,156 INFO L290 TraceCheckUtils]: 29: Hoare triple {4016#false} assume !!(~c~0 < 6); {4016#false} is VALID [2022-04-08 10:32:42,156 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-08 10:32:42,156 INFO L290 TraceCheckUtils]: 31: Hoare triple {4016#false} assume !(~c~0 < 6); {4016#false} is VALID [2022-04-08 10:32:42,156 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-08 10:32:42,156 INFO L290 TraceCheckUtils]: 33: Hoare triple {4016#false} assume !(~b~0 < 6); {4016#false} is VALID [2022-04-08 10:32:42,157 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-08 10:32:42,157 INFO L290 TraceCheckUtils]: 35: Hoare triple {4016#false} assume !!(~a~0 < 6);~b~0 := 0; {4016#false} is VALID [2022-04-08 10:32:42,157 INFO L290 TraceCheckUtils]: 36: Hoare triple {4016#false} assume !!(~b~0 < 6);~c~0 := 0; {4016#false} is VALID [2022-04-08 10:32:42,157 INFO L290 TraceCheckUtils]: 37: Hoare triple {4016#false} assume !!(~c~0 < 6); {4016#false} is VALID [2022-04-08 10:32:42,157 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-08 10:32:42,157 INFO L290 TraceCheckUtils]: 39: Hoare triple {4016#false} assume !!(~c~0 < 6); {4016#false} is VALID [2022-04-08 10:32:42,157 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-08 10:32:42,157 INFO L290 TraceCheckUtils]: 41: Hoare triple {4016#false} assume !!(~c~0 < 6); {4016#false} is VALID [2022-04-08 10:32:42,157 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-08 10:32:42,157 INFO L290 TraceCheckUtils]: 43: Hoare triple {4016#false} assume !!(~c~0 < 6); {4016#false} is VALID [2022-04-08 10:32:42,157 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-08 10:32:42,157 INFO L290 TraceCheckUtils]: 45: Hoare triple {4016#false} assume !!(~c~0 < 6); {4016#false} is VALID [2022-04-08 10:32:42,157 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-08 10:32:42,157 INFO L290 TraceCheckUtils]: 47: Hoare triple {4016#false} assume !(~c~0 < 6); {4016#false} is VALID [2022-04-08 10:32:42,157 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-08 10:32:42,157 INFO L290 TraceCheckUtils]: 49: Hoare triple {4016#false} assume !!(~b~0 < 6);~c~0 := 0; {4016#false} is VALID [2022-04-08 10:32:42,157 INFO L290 TraceCheckUtils]: 50: Hoare triple {4016#false} assume !!(~c~0 < 6); {4016#false} is VALID [2022-04-08 10:32:42,157 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-08 10:32:42,157 INFO L290 TraceCheckUtils]: 52: Hoare triple {4016#false} assume !!(~c~0 < 6); {4016#false} is VALID [2022-04-08 10:32:42,158 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-08 10:32:42,158 INFO L290 TraceCheckUtils]: 54: Hoare triple {4016#false} assume !!(~c~0 < 6); {4016#false} is VALID [2022-04-08 10:32:42,158 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-08 10:32:42,158 INFO L290 TraceCheckUtils]: 56: Hoare triple {4016#false} assume !!(~c~0 < 6); {4016#false} is VALID [2022-04-08 10:32:42,158 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-08 10:32:42,158 INFO L290 TraceCheckUtils]: 58: Hoare triple {4016#false} assume !!(~c~0 < 6); {4016#false} is VALID [2022-04-08 10:32:42,158 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-08 10:32:42,158 INFO L290 TraceCheckUtils]: 60: Hoare triple {4016#false} assume !(~c~0 < 6); {4016#false} is VALID [2022-04-08 10:32:42,158 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-08 10:32:42,158 INFO L290 TraceCheckUtils]: 62: Hoare triple {4016#false} assume !(~b~0 < 6); {4016#false} is VALID [2022-04-08 10:32:42,158 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-08 10:32:42,158 INFO L290 TraceCheckUtils]: 64: Hoare triple {4016#false} assume !(~a~0 < 6); {4016#false} is VALID [2022-04-08 10:32:42,158 INFO L290 TraceCheckUtils]: 65: Hoare triple {4016#false} assume !((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0); {4016#false} is VALID [2022-04-08 10:32:42,158 INFO L290 TraceCheckUtils]: 66: Hoare triple {4016#false} assume !false; {4016#false} is VALID [2022-04-08 10:32:42,158 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-08 10:32:42,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:32:42,159 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [479268623] [2022-04-08 10:32:42,159 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [479268623] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:32:42,159 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [931640689] [2022-04-08 10:32:42,159 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 10:32:42,159 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:32:42,159 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:32:42,160 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-08 10:32:42,160 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-08 10:32:42,198 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 10:32:42,199 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:32:42,199 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-08 10:32:42,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:32:42,208 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:32:42,344 INFO L272 TraceCheckUtils]: 0: Hoare triple {4015#true} call ULTIMATE.init(); {4015#true} is VALID [2022-04-08 10:32:42,345 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-08 10:32:42,345 INFO L290 TraceCheckUtils]: 2: Hoare triple {4015#true} assume true; {4015#true} is VALID [2022-04-08 10:32:42,345 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4015#true} {4015#true} #56#return; {4015#true} is VALID [2022-04-08 10:32:42,345 INFO L272 TraceCheckUtils]: 4: Hoare triple {4015#true} call #t~ret7 := main(); {4015#true} is VALID [2022-04-08 10:32:42,345 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-08 10:32:42,345 INFO L290 TraceCheckUtils]: 6: Hoare triple {4015#true} assume !!(~a~0 < 6);~b~0 := 0; {4015#true} is VALID [2022-04-08 10:32:42,345 INFO L290 TraceCheckUtils]: 7: Hoare triple {4015#true} assume !!(~b~0 < 6);~c~0 := 0; {4051#(<= main_~c~0 0)} is VALID [2022-04-08 10:32:42,346 INFO L290 TraceCheckUtils]: 8: Hoare triple {4051#(<= main_~c~0 0)} assume !!(~c~0 < 6); {4051#(<= main_~c~0 0)} is VALID [2022-04-08 10:32:42,346 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-08 10:32:42,346 INFO L290 TraceCheckUtils]: 10: Hoare triple {4021#(<= main_~c~0 1)} assume !!(~c~0 < 6); {4021#(<= main_~c~0 1)} is VALID [2022-04-08 10:32:42,347 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-08 10:32:42,347 INFO L290 TraceCheckUtils]: 12: Hoare triple {4022#(<= main_~c~0 2)} assume !!(~c~0 < 6); {4022#(<= main_~c~0 2)} is VALID [2022-04-08 10:32:42,347 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-08 10:32:42,347 INFO L290 TraceCheckUtils]: 14: Hoare triple {4023#(<= main_~c~0 3)} assume !!(~c~0 < 6); {4023#(<= main_~c~0 3)} is VALID [2022-04-08 10:32:42,348 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-08 10:32:42,348 INFO L290 TraceCheckUtils]: 16: Hoare triple {4024#(<= main_~c~0 4)} assume !!(~c~0 < 6); {4024#(<= main_~c~0 4)} is VALID [2022-04-08 10:32:42,348 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-08 10:32:42,349 INFO L290 TraceCheckUtils]: 18: Hoare triple {4025#(<= main_~c~0 5)} assume !(~c~0 < 6); {4016#false} is VALID [2022-04-08 10:32:42,349 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-08 10:32:42,349 INFO L290 TraceCheckUtils]: 20: Hoare triple {4016#false} assume !!(~b~0 < 6);~c~0 := 0; {4016#false} is VALID [2022-04-08 10:32:42,349 INFO L290 TraceCheckUtils]: 21: Hoare triple {4016#false} assume !!(~c~0 < 6); {4016#false} is VALID [2022-04-08 10:32:42,349 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-08 10:32:42,349 INFO L290 TraceCheckUtils]: 23: Hoare triple {4016#false} assume !!(~c~0 < 6); {4016#false} is VALID [2022-04-08 10:32:42,349 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-08 10:32:42,349 INFO L290 TraceCheckUtils]: 25: Hoare triple {4016#false} assume !!(~c~0 < 6); {4016#false} is VALID [2022-04-08 10:32:42,349 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-08 10:32:42,349 INFO L290 TraceCheckUtils]: 27: Hoare triple {4016#false} assume !!(~c~0 < 6); {4016#false} is VALID [2022-04-08 10:32:42,349 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-08 10:32:42,349 INFO L290 TraceCheckUtils]: 29: Hoare triple {4016#false} assume !!(~c~0 < 6); {4016#false} is VALID [2022-04-08 10:32:42,349 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-08 10:32:42,349 INFO L290 TraceCheckUtils]: 31: Hoare triple {4016#false} assume !(~c~0 < 6); {4016#false} is VALID [2022-04-08 10:32:42,350 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-08 10:32:42,350 INFO L290 TraceCheckUtils]: 33: Hoare triple {4016#false} assume !(~b~0 < 6); {4016#false} is VALID [2022-04-08 10:32:42,350 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-08 10:32:42,350 INFO L290 TraceCheckUtils]: 35: Hoare triple {4016#false} assume !!(~a~0 < 6);~b~0 := 0; {4016#false} is VALID [2022-04-08 10:32:42,350 INFO L290 TraceCheckUtils]: 36: Hoare triple {4016#false} assume !!(~b~0 < 6);~c~0 := 0; {4016#false} is VALID [2022-04-08 10:32:42,350 INFO L290 TraceCheckUtils]: 37: Hoare triple {4016#false} assume !!(~c~0 < 6); {4016#false} is VALID [2022-04-08 10:32:42,350 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-08 10:32:42,350 INFO L290 TraceCheckUtils]: 39: Hoare triple {4016#false} assume !!(~c~0 < 6); {4016#false} is VALID [2022-04-08 10:32:42,350 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-08 10:32:42,350 INFO L290 TraceCheckUtils]: 41: Hoare triple {4016#false} assume !!(~c~0 < 6); {4016#false} is VALID [2022-04-08 10:32:42,350 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-08 10:32:42,350 INFO L290 TraceCheckUtils]: 43: Hoare triple {4016#false} assume !!(~c~0 < 6); {4016#false} is VALID [2022-04-08 10:32:42,350 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-08 10:32:42,362 INFO L290 TraceCheckUtils]: 45: Hoare triple {4016#false} assume !!(~c~0 < 6); {4016#false} is VALID [2022-04-08 10:32:42,362 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-08 10:32:42,362 INFO L290 TraceCheckUtils]: 47: Hoare triple {4016#false} assume !(~c~0 < 6); {4016#false} is VALID [2022-04-08 10:32:42,362 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-08 10:32:42,362 INFO L290 TraceCheckUtils]: 49: Hoare triple {4016#false} assume !!(~b~0 < 6);~c~0 := 0; {4016#false} is VALID [2022-04-08 10:32:42,362 INFO L290 TraceCheckUtils]: 50: Hoare triple {4016#false} assume !!(~c~0 < 6); {4016#false} is VALID [2022-04-08 10:32:42,362 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-08 10:32:42,362 INFO L290 TraceCheckUtils]: 52: Hoare triple {4016#false} assume !!(~c~0 < 6); {4016#false} is VALID [2022-04-08 10:32:42,362 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-08 10:32:42,362 INFO L290 TraceCheckUtils]: 54: Hoare triple {4016#false} assume !!(~c~0 < 6); {4016#false} is VALID [2022-04-08 10:32:42,362 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-08 10:32:42,362 INFO L290 TraceCheckUtils]: 56: Hoare triple {4016#false} assume !!(~c~0 < 6); {4016#false} is VALID [2022-04-08 10:32:42,363 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-08 10:32:42,363 INFO L290 TraceCheckUtils]: 58: Hoare triple {4016#false} assume !!(~c~0 < 6); {4016#false} is VALID [2022-04-08 10:32:42,363 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-08 10:32:42,363 INFO L290 TraceCheckUtils]: 60: Hoare triple {4016#false} assume !(~c~0 < 6); {4016#false} is VALID [2022-04-08 10:32:42,363 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-08 10:32:42,363 INFO L290 TraceCheckUtils]: 62: Hoare triple {4016#false} assume !(~b~0 < 6); {4016#false} is VALID [2022-04-08 10:32:42,363 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-08 10:32:42,363 INFO L290 TraceCheckUtils]: 64: Hoare triple {4016#false} assume !(~a~0 < 6); {4016#false} is VALID [2022-04-08 10:32:42,363 INFO L290 TraceCheckUtils]: 65: Hoare triple {4016#false} assume !((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0); {4016#false} is VALID [2022-04-08 10:32:42,363 INFO L290 TraceCheckUtils]: 66: Hoare triple {4016#false} assume !false; {4016#false} is VALID [2022-04-08 10:32:42,364 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-08 10:32:42,364 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:32:42,550 INFO L290 TraceCheckUtils]: 66: Hoare triple {4016#false} assume !false; {4016#false} is VALID [2022-04-08 10:32:42,550 INFO L290 TraceCheckUtils]: 65: Hoare triple {4016#false} assume !((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0); {4016#false} is VALID [2022-04-08 10:32:42,550 INFO L290 TraceCheckUtils]: 64: Hoare triple {4016#false} assume !(~a~0 < 6); {4016#false} is VALID [2022-04-08 10:32:42,550 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-08 10:32:42,551 INFO L290 TraceCheckUtils]: 62: Hoare triple {4016#false} assume !(~b~0 < 6); {4016#false} is VALID [2022-04-08 10:32:42,551 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-08 10:32:42,551 INFO L290 TraceCheckUtils]: 60: Hoare triple {4016#false} assume !(~c~0 < 6); {4016#false} is VALID [2022-04-08 10:32:42,551 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-08 10:32:42,551 INFO L290 TraceCheckUtils]: 58: Hoare triple {4016#false} assume !!(~c~0 < 6); {4016#false} is VALID [2022-04-08 10:32:42,551 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-08 10:32:42,551 INFO L290 TraceCheckUtils]: 56: Hoare triple {4016#false} assume !!(~c~0 < 6); {4016#false} is VALID [2022-04-08 10:32:42,551 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-08 10:32:42,551 INFO L290 TraceCheckUtils]: 54: Hoare triple {4016#false} assume !!(~c~0 < 6); {4016#false} is VALID [2022-04-08 10:32:42,551 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-08 10:32:42,551 INFO L290 TraceCheckUtils]: 52: Hoare triple {4016#false} assume !!(~c~0 < 6); {4016#false} is VALID [2022-04-08 10:32:42,551 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-08 10:32:42,551 INFO L290 TraceCheckUtils]: 50: Hoare triple {4016#false} assume !!(~c~0 < 6); {4016#false} is VALID [2022-04-08 10:32:42,551 INFO L290 TraceCheckUtils]: 49: Hoare triple {4016#false} assume !!(~b~0 < 6);~c~0 := 0; {4016#false} is VALID [2022-04-08 10:32:42,552 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-08 10:32:42,552 INFO L290 TraceCheckUtils]: 47: Hoare triple {4016#false} assume !(~c~0 < 6); {4016#false} is VALID [2022-04-08 10:32:42,552 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-08 10:32:42,552 INFO L290 TraceCheckUtils]: 45: Hoare triple {4016#false} assume !!(~c~0 < 6); {4016#false} is VALID [2022-04-08 10:32:42,552 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-08 10:32:42,552 INFO L290 TraceCheckUtils]: 43: Hoare triple {4016#false} assume !!(~c~0 < 6); {4016#false} is VALID [2022-04-08 10:32:42,552 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-08 10:32:42,552 INFO L290 TraceCheckUtils]: 41: Hoare triple {4016#false} assume !!(~c~0 < 6); {4016#false} is VALID [2022-04-08 10:32:42,552 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-08 10:32:42,552 INFO L290 TraceCheckUtils]: 39: Hoare triple {4016#false} assume !!(~c~0 < 6); {4016#false} is VALID [2022-04-08 10:32:42,552 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-08 10:32:42,552 INFO L290 TraceCheckUtils]: 37: Hoare triple {4016#false} assume !!(~c~0 < 6); {4016#false} is VALID [2022-04-08 10:32:42,552 INFO L290 TraceCheckUtils]: 36: Hoare triple {4016#false} assume !!(~b~0 < 6);~c~0 := 0; {4016#false} is VALID [2022-04-08 10:32:42,552 INFO L290 TraceCheckUtils]: 35: Hoare triple {4016#false} assume !!(~a~0 < 6);~b~0 := 0; {4016#false} is VALID [2022-04-08 10:32:42,553 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-08 10:32:42,553 INFO L290 TraceCheckUtils]: 33: Hoare triple {4016#false} assume !(~b~0 < 6); {4016#false} is VALID [2022-04-08 10:32:42,553 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-08 10:32:42,553 INFO L290 TraceCheckUtils]: 31: Hoare triple {4016#false} assume !(~c~0 < 6); {4016#false} is VALID [2022-04-08 10:32:42,553 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-08 10:32:42,553 INFO L290 TraceCheckUtils]: 29: Hoare triple {4016#false} assume !!(~c~0 < 6); {4016#false} is VALID [2022-04-08 10:32:42,553 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-08 10:32:42,553 INFO L290 TraceCheckUtils]: 27: Hoare triple {4016#false} assume !!(~c~0 < 6); {4016#false} is VALID [2022-04-08 10:32:42,553 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-08 10:32:42,553 INFO L290 TraceCheckUtils]: 25: Hoare triple {4016#false} assume !!(~c~0 < 6); {4016#false} is VALID [2022-04-08 10:32:42,553 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-08 10:32:42,553 INFO L290 TraceCheckUtils]: 23: Hoare triple {4016#false} assume !!(~c~0 < 6); {4016#false} is VALID [2022-04-08 10:32:42,553 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-08 10:32:42,554 INFO L290 TraceCheckUtils]: 21: Hoare triple {4016#false} assume !!(~c~0 < 6); {4016#false} is VALID [2022-04-08 10:32:42,554 INFO L290 TraceCheckUtils]: 20: Hoare triple {4016#false} assume !!(~b~0 < 6);~c~0 := 0; {4016#false} is VALID [2022-04-08 10:32:42,554 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-08 10:32:42,554 INFO L290 TraceCheckUtils]: 18: Hoare triple {4025#(<= main_~c~0 5)} assume !(~c~0 < 6); {4016#false} is VALID [2022-04-08 10:32:42,555 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-08 10:32:42,555 INFO L290 TraceCheckUtils]: 16: Hoare triple {4024#(<= main_~c~0 4)} assume !!(~c~0 < 6); {4024#(<= main_~c~0 4)} is VALID [2022-04-08 10:32:42,555 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-08 10:32:42,556 INFO L290 TraceCheckUtils]: 14: Hoare triple {4023#(<= main_~c~0 3)} assume !!(~c~0 < 6); {4023#(<= main_~c~0 3)} is VALID [2022-04-08 10:32:42,556 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-08 10:32:42,556 INFO L290 TraceCheckUtils]: 12: Hoare triple {4022#(<= main_~c~0 2)} assume !!(~c~0 < 6); {4022#(<= main_~c~0 2)} is VALID [2022-04-08 10:32:42,557 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-08 10:32:42,557 INFO L290 TraceCheckUtils]: 10: Hoare triple {4021#(<= main_~c~0 1)} assume !!(~c~0 < 6); {4021#(<= main_~c~0 1)} is VALID [2022-04-08 10:32:42,557 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-08 10:32:42,558 INFO L290 TraceCheckUtils]: 8: Hoare triple {4051#(<= main_~c~0 0)} assume !!(~c~0 < 6); {4051#(<= main_~c~0 0)} is VALID [2022-04-08 10:32:42,558 INFO L290 TraceCheckUtils]: 7: Hoare triple {4015#true} assume !!(~b~0 < 6);~c~0 := 0; {4051#(<= main_~c~0 0)} is VALID [2022-04-08 10:32:42,558 INFO L290 TraceCheckUtils]: 6: Hoare triple {4015#true} assume !!(~a~0 < 6);~b~0 := 0; {4015#true} is VALID [2022-04-08 10:32:42,558 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-08 10:32:42,558 INFO L272 TraceCheckUtils]: 4: Hoare triple {4015#true} call #t~ret7 := main(); {4015#true} is VALID [2022-04-08 10:32:42,558 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4015#true} {4015#true} #56#return; {4015#true} is VALID [2022-04-08 10:32:42,558 INFO L290 TraceCheckUtils]: 2: Hoare triple {4015#true} assume true; {4015#true} is VALID [2022-04-08 10:32:42,559 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-08 10:32:42,559 INFO L272 TraceCheckUtils]: 0: Hoare triple {4015#true} call ULTIMATE.init(); {4015#true} is VALID [2022-04-08 10:32:42,559 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-08 10:32:42,559 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [931640689] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:32:42,559 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:32:42,559 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 10 [2022-04-08 10:32:42,559 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:32:42,560 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2040762422] [2022-04-08 10:32:42,560 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2040762422] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:32:42,560 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:32:42,560 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-08 10:32:42,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [121569386] [2022-04-08 10:32:42,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:32:42,560 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-08 10:32:42,560 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:32:42,560 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-08 10:32:42,579 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-08 10:32:42,580 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-08 10:32:42,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:32:42,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-08 10:32:42,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2022-04-08 10:32:42,580 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-08 10:32:42,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:32:42,747 INFO L93 Difference]: Finished difference Result 125 states and 140 transitions. [2022-04-08 10:32:42,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-08 10:32:42,748 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-08 10:32:42,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:32:42,748 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-08 10:32:42,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 40 transitions. [2022-04-08 10:32:42,749 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-08 10:32:42,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 40 transitions. [2022-04-08 10:32:42,749 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 40 transitions. [2022-04-08 10:32:42,776 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-08 10:32:42,777 INFO L225 Difference]: With dead ends: 125 [2022-04-08 10:32:42,777 INFO L226 Difference]: Without dead ends: 76 [2022-04-08 10:32:42,777 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-08 10:32:42,778 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-08 10:32:42,778 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-08 10:32:42,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2022-04-08 10:32:42,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2022-04-08 10:32:42,846 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:32:42,846 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-08 10:32:42,846 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-08 10:32:42,846 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-08 10:32:42,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:32:42,847 INFO L93 Difference]: Finished difference Result 76 states and 82 transitions. [2022-04-08 10:32:42,847 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 82 transitions. [2022-04-08 10:32:42,847 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:32:42,847 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:32:42,847 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-08 10:32:42,848 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-08 10:32:42,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:32:42,848 INFO L93 Difference]: Finished difference Result 76 states and 82 transitions. [2022-04-08 10:32:42,849 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 82 transitions. [2022-04-08 10:32:42,849 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:32:42,849 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:32:42,849 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:32:42,849 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:32:42,849 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-08 10:32:42,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 82 transitions. [2022-04-08 10:32:42,850 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 82 transitions. Word has length 67 [2022-04-08 10:32:42,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:32:42,850 INFO L478 AbstractCegarLoop]: Abstraction has 76 states and 82 transitions. [2022-04-08 10:32:42,850 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-08 10:32:42,850 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 76 states and 82 transitions. [2022-04-08 10:32:42,914 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-08 10:32:42,914 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 82 transitions. [2022-04-08 10:32:42,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-04-08 10:32:42,915 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:32:42,915 INFO L499 BasicCegarLoop]: trace histogram [24, 24, 4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:32:42,931 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-08 10:32:43,115 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:32:43,115 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:32:43,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:32:43,116 INFO L85 PathProgramCache]: Analyzing trace with hash 275596543, now seen corresponding path program 15 times [2022-04-08 10:32:43,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:32:43,116 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1138923470] [2022-04-08 10:32:43,392 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:32:43,434 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:32:43,434 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:32:43,434 INFO L85 PathProgramCache]: Analyzing trace with hash 275596543, now seen corresponding path program 16 times [2022-04-08 10:32:43,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:32:43,434 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2012561645] [2022-04-08 10:32:43,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:32:43,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:32:43,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:32:43,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:32:43,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:32:43,479 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-08 10:32:43,479 INFO L290 TraceCheckUtils]: 1: Hoare triple {4995#true} assume true; {4995#true} is VALID [2022-04-08 10:32:43,479 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4995#true} {4995#true} #56#return; {4995#true} is VALID [2022-04-08 10:32:43,479 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-08 10:32:43,479 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-08 10:32:43,479 INFO L290 TraceCheckUtils]: 2: Hoare triple {4995#true} assume true; {4995#true} is VALID [2022-04-08 10:32:43,479 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4995#true} {4995#true} #56#return; {4995#true} is VALID [2022-04-08 10:32:43,480 INFO L272 TraceCheckUtils]: 4: Hoare triple {4995#true} call #t~ret7 := main(); {4995#true} is VALID [2022-04-08 10:32:43,480 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-08 10:32:43,480 INFO L290 TraceCheckUtils]: 6: Hoare triple {4995#true} assume !!(~a~0 < 6);~b~0 := 0; {5000#(= main_~b~0 0)} is VALID [2022-04-08 10:32:43,480 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-08 10:32:43,480 INFO L290 TraceCheckUtils]: 8: Hoare triple {5000#(= main_~b~0 0)} assume !!(~c~0 < 6); {5000#(= main_~b~0 0)} is VALID [2022-04-08 10:32:43,480 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-08 10:32:43,481 INFO L290 TraceCheckUtils]: 10: Hoare triple {5000#(= main_~b~0 0)} assume !!(~c~0 < 6); {5000#(= main_~b~0 0)} is VALID [2022-04-08 10:32:43,481 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-08 10:32:43,481 INFO L290 TraceCheckUtils]: 12: Hoare triple {5000#(= main_~b~0 0)} assume !!(~c~0 < 6); {5000#(= main_~b~0 0)} is VALID [2022-04-08 10:32:43,481 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-08 10:32:43,482 INFO L290 TraceCheckUtils]: 14: Hoare triple {5000#(= main_~b~0 0)} assume !!(~c~0 < 6); {5000#(= main_~b~0 0)} is VALID [2022-04-08 10:32:43,482 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-08 10:32:43,482 INFO L290 TraceCheckUtils]: 16: Hoare triple {5000#(= main_~b~0 0)} assume !!(~c~0 < 6); {5000#(= main_~b~0 0)} is VALID [2022-04-08 10:32:43,482 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-08 10:32:43,482 INFO L290 TraceCheckUtils]: 18: Hoare triple {5000#(= main_~b~0 0)} assume !!(~c~0 < 6); {5000#(= main_~b~0 0)} is VALID [2022-04-08 10:32:43,483 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-08 10:32:43,483 INFO L290 TraceCheckUtils]: 20: Hoare triple {5000#(= main_~b~0 0)} assume !(~c~0 < 6); {5000#(= main_~b~0 0)} is VALID [2022-04-08 10:32:43,483 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-08 10:32:43,483 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-08 10:32:43,484 INFO L290 TraceCheckUtils]: 23: Hoare triple {5001#(<= main_~b~0 1)} assume !!(~c~0 < 6); {5001#(<= main_~b~0 1)} is VALID [2022-04-08 10:32:43,484 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-08 10:32:43,484 INFO L290 TraceCheckUtils]: 25: Hoare triple {5001#(<= main_~b~0 1)} assume !!(~c~0 < 6); {5001#(<= main_~b~0 1)} is VALID [2022-04-08 10:32:43,484 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-08 10:32:43,484 INFO L290 TraceCheckUtils]: 27: Hoare triple {5001#(<= main_~b~0 1)} assume !!(~c~0 < 6); {5001#(<= main_~b~0 1)} is VALID [2022-04-08 10:32:43,485 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-08 10:32:43,485 INFO L290 TraceCheckUtils]: 29: Hoare triple {5001#(<= main_~b~0 1)} assume !!(~c~0 < 6); {5001#(<= main_~b~0 1)} is VALID [2022-04-08 10:32:43,485 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-08 10:32:43,485 INFO L290 TraceCheckUtils]: 31: Hoare triple {5001#(<= main_~b~0 1)} assume !!(~c~0 < 6); {5001#(<= main_~b~0 1)} is VALID [2022-04-08 10:32:43,486 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-08 10:32:43,486 INFO L290 TraceCheckUtils]: 33: Hoare triple {5001#(<= main_~b~0 1)} assume !!(~c~0 < 6); {5001#(<= main_~b~0 1)} is VALID [2022-04-08 10:32:43,486 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-08 10:32:43,486 INFO L290 TraceCheckUtils]: 35: Hoare triple {5001#(<= main_~b~0 1)} assume !(~c~0 < 6); {5001#(<= main_~b~0 1)} is VALID [2022-04-08 10:32:43,487 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-08 10:32:43,487 INFO L290 TraceCheckUtils]: 37: Hoare triple {5002#(<= main_~b~0 2)} assume !(~b~0 < 6); {4996#false} is VALID [2022-04-08 10:32:43,487 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-08 10:32:43,487 INFO L290 TraceCheckUtils]: 39: Hoare triple {4996#false} assume !!(~a~0 < 6);~b~0 := 0; {4996#false} is VALID [2022-04-08 10:32:43,487 INFO L290 TraceCheckUtils]: 40: Hoare triple {4996#false} assume !!(~b~0 < 6);~c~0 := 0; {4996#false} is VALID [2022-04-08 10:32:43,487 INFO L290 TraceCheckUtils]: 41: Hoare triple {4996#false} assume !!(~c~0 < 6); {4996#false} is VALID [2022-04-08 10:32:43,487 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-08 10:32:43,487 INFO L290 TraceCheckUtils]: 43: Hoare triple {4996#false} assume !!(~c~0 < 6); {4996#false} is VALID [2022-04-08 10:32:43,487 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-08 10:32:43,487 INFO L290 TraceCheckUtils]: 45: Hoare triple {4996#false} assume !!(~c~0 < 6); {4996#false} is VALID [2022-04-08 10:32:43,487 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-08 10:32:43,487 INFO L290 TraceCheckUtils]: 47: Hoare triple {4996#false} assume !!(~c~0 < 6); {4996#false} is VALID [2022-04-08 10:32:43,488 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-08 10:32:43,488 INFO L290 TraceCheckUtils]: 49: Hoare triple {4996#false} assume !!(~c~0 < 6); {4996#false} is VALID [2022-04-08 10:32:43,488 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-08 10:32:43,488 INFO L290 TraceCheckUtils]: 51: Hoare triple {4996#false} assume !!(~c~0 < 6); {4996#false} is VALID [2022-04-08 10:32:43,488 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-08 10:32:43,488 INFO L290 TraceCheckUtils]: 53: Hoare triple {4996#false} assume !(~c~0 < 6); {4996#false} is VALID [2022-04-08 10:32:43,488 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-08 10:32:43,488 INFO L290 TraceCheckUtils]: 55: Hoare triple {4996#false} assume !!(~b~0 < 6);~c~0 := 0; {4996#false} is VALID [2022-04-08 10:32:43,488 INFO L290 TraceCheckUtils]: 56: Hoare triple {4996#false} assume !!(~c~0 < 6); {4996#false} is VALID [2022-04-08 10:32:43,488 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-08 10:32:43,488 INFO L290 TraceCheckUtils]: 58: Hoare triple {4996#false} assume !!(~c~0 < 6); {4996#false} is VALID [2022-04-08 10:32:43,488 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-08 10:32:43,488 INFO L290 TraceCheckUtils]: 60: Hoare triple {4996#false} assume !!(~c~0 < 6); {4996#false} is VALID [2022-04-08 10:32:43,488 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-08 10:32:43,488 INFO L290 TraceCheckUtils]: 62: Hoare triple {4996#false} assume !!(~c~0 < 6); {4996#false} is VALID [2022-04-08 10:32:43,488 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-08 10:32:43,488 INFO L290 TraceCheckUtils]: 64: Hoare triple {4996#false} assume !!(~c~0 < 6); {4996#false} is VALID [2022-04-08 10:32:43,488 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-08 10:32:43,488 INFO L290 TraceCheckUtils]: 66: Hoare triple {4996#false} assume !!(~c~0 < 6); {4996#false} is VALID [2022-04-08 10:32:43,489 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-08 10:32:43,489 INFO L290 TraceCheckUtils]: 68: Hoare triple {4996#false} assume !(~c~0 < 6); {4996#false} is VALID [2022-04-08 10:32:43,489 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-08 10:32:43,489 INFO L290 TraceCheckUtils]: 70: Hoare triple {4996#false} assume !(~b~0 < 6); {4996#false} is VALID [2022-04-08 10:32:43,489 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-08 10:32:43,489 INFO L290 TraceCheckUtils]: 72: Hoare triple {4996#false} assume !(~a~0 < 6); {4996#false} is VALID [2022-04-08 10:32:43,489 INFO L290 TraceCheckUtils]: 73: Hoare triple {4996#false} assume !((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0); {4996#false} is VALID [2022-04-08 10:32:43,489 INFO L290 TraceCheckUtils]: 74: Hoare triple {4996#false} assume !false; {4996#false} is VALID [2022-04-08 10:32:43,489 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-08 10:32:43,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:32:43,489 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2012561645] [2022-04-08 10:32:43,489 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2012561645] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:32:43,489 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [94215573] [2022-04-08 10:32:43,490 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 10:32:43,490 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:32:43,490 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:32:43,490 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-08 10:32:43,491 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-08 10:32:43,530 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 10:32:43,530 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:32:43,531 INFO L263 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 4 conjunts are in the unsatisfiable core [2022-04-08 10:32:43,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:32:43,539 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:32:43,690 INFO L272 TraceCheckUtils]: 0: Hoare triple {4995#true} call ULTIMATE.init(); {4995#true} is VALID [2022-04-08 10:32:43,690 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-08 10:32:43,690 INFO L290 TraceCheckUtils]: 2: Hoare triple {4995#true} assume true; {4995#true} is VALID [2022-04-08 10:32:43,690 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4995#true} {4995#true} #56#return; {4995#true} is VALID [2022-04-08 10:32:43,690 INFO L272 TraceCheckUtils]: 4: Hoare triple {4995#true} call #t~ret7 := main(); {4995#true} is VALID [2022-04-08 10:32:43,690 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-08 10:32:43,690 INFO L290 TraceCheckUtils]: 6: Hoare triple {4995#true} assume !!(~a~0 < 6);~b~0 := 0; {5025#(<= main_~b~0 0)} is VALID [2022-04-08 10:32:43,691 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-08 10:32:43,691 INFO L290 TraceCheckUtils]: 8: Hoare triple {5025#(<= main_~b~0 0)} assume !!(~c~0 < 6); {5025#(<= main_~b~0 0)} is VALID [2022-04-08 10:32:43,691 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-08 10:32:43,692 INFO L290 TraceCheckUtils]: 10: Hoare triple {5025#(<= main_~b~0 0)} assume !!(~c~0 < 6); {5025#(<= main_~b~0 0)} is VALID [2022-04-08 10:32:43,692 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-08 10:32:43,692 INFO L290 TraceCheckUtils]: 12: Hoare triple {5025#(<= main_~b~0 0)} assume !!(~c~0 < 6); {5025#(<= main_~b~0 0)} is VALID [2022-04-08 10:32:43,692 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-08 10:32:43,693 INFO L290 TraceCheckUtils]: 14: Hoare triple {5025#(<= main_~b~0 0)} assume !!(~c~0 < 6); {5025#(<= main_~b~0 0)} is VALID [2022-04-08 10:32:43,693 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-08 10:32:43,693 INFO L290 TraceCheckUtils]: 16: Hoare triple {5025#(<= main_~b~0 0)} assume !!(~c~0 < 6); {5025#(<= main_~b~0 0)} is VALID [2022-04-08 10:32:43,693 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-08 10:32:43,694 INFO L290 TraceCheckUtils]: 18: Hoare triple {5025#(<= main_~b~0 0)} assume !!(~c~0 < 6); {5025#(<= main_~b~0 0)} is VALID [2022-04-08 10:32:43,694 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-08 10:32:43,694 INFO L290 TraceCheckUtils]: 20: Hoare triple {5025#(<= main_~b~0 0)} assume !(~c~0 < 6); {5025#(<= main_~b~0 0)} is VALID [2022-04-08 10:32:43,695 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-08 10:32:43,695 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-08 10:32:43,695 INFO L290 TraceCheckUtils]: 23: Hoare triple {5001#(<= main_~b~0 1)} assume !!(~c~0 < 6); {5001#(<= main_~b~0 1)} is VALID [2022-04-08 10:32:43,695 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-08 10:32:43,696 INFO L290 TraceCheckUtils]: 25: Hoare triple {5001#(<= main_~b~0 1)} assume !!(~c~0 < 6); {5001#(<= main_~b~0 1)} is VALID [2022-04-08 10:32:43,696 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-08 10:32:43,696 INFO L290 TraceCheckUtils]: 27: Hoare triple {5001#(<= main_~b~0 1)} assume !!(~c~0 < 6); {5001#(<= main_~b~0 1)} is VALID [2022-04-08 10:32:43,696 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-08 10:32:43,696 INFO L290 TraceCheckUtils]: 29: Hoare triple {5001#(<= main_~b~0 1)} assume !!(~c~0 < 6); {5001#(<= main_~b~0 1)} is VALID [2022-04-08 10:32:43,697 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-08 10:32:43,697 INFO L290 TraceCheckUtils]: 31: Hoare triple {5001#(<= main_~b~0 1)} assume !!(~c~0 < 6); {5001#(<= main_~b~0 1)} is VALID [2022-04-08 10:32:43,697 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-08 10:32:43,697 INFO L290 TraceCheckUtils]: 33: Hoare triple {5001#(<= main_~b~0 1)} assume !!(~c~0 < 6); {5001#(<= main_~b~0 1)} is VALID [2022-04-08 10:32:43,698 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-08 10:32:43,698 INFO L290 TraceCheckUtils]: 35: Hoare triple {5001#(<= main_~b~0 1)} assume !(~c~0 < 6); {5001#(<= main_~b~0 1)} is VALID [2022-04-08 10:32:43,698 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-08 10:32:43,698 INFO L290 TraceCheckUtils]: 37: Hoare triple {5002#(<= main_~b~0 2)} assume !(~b~0 < 6); {4996#false} is VALID [2022-04-08 10:32:43,698 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-08 10:32:43,699 INFO L290 TraceCheckUtils]: 39: Hoare triple {4996#false} assume !!(~a~0 < 6);~b~0 := 0; {4996#false} is VALID [2022-04-08 10:32:43,699 INFO L290 TraceCheckUtils]: 40: Hoare triple {4996#false} assume !!(~b~0 < 6);~c~0 := 0; {4996#false} is VALID [2022-04-08 10:32:43,699 INFO L290 TraceCheckUtils]: 41: Hoare triple {4996#false} assume !!(~c~0 < 6); {4996#false} is VALID [2022-04-08 10:32:43,699 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-08 10:32:43,699 INFO L290 TraceCheckUtils]: 43: Hoare triple {4996#false} assume !!(~c~0 < 6); {4996#false} is VALID [2022-04-08 10:32:43,699 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-08 10:32:43,699 INFO L290 TraceCheckUtils]: 45: Hoare triple {4996#false} assume !!(~c~0 < 6); {4996#false} is VALID [2022-04-08 10:32:43,699 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-08 10:32:43,699 INFO L290 TraceCheckUtils]: 47: Hoare triple {4996#false} assume !!(~c~0 < 6); {4996#false} is VALID [2022-04-08 10:32:43,699 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-08 10:32:43,699 INFO L290 TraceCheckUtils]: 49: Hoare triple {4996#false} assume !!(~c~0 < 6); {4996#false} is VALID [2022-04-08 10:32:43,699 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-08 10:32:43,699 INFO L290 TraceCheckUtils]: 51: Hoare triple {4996#false} assume !!(~c~0 < 6); {4996#false} is VALID [2022-04-08 10:32:43,699 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-08 10:32:43,699 INFO L290 TraceCheckUtils]: 53: Hoare triple {4996#false} assume !(~c~0 < 6); {4996#false} is VALID [2022-04-08 10:32:43,699 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-08 10:32:43,699 INFO L290 TraceCheckUtils]: 55: Hoare triple {4996#false} assume !!(~b~0 < 6);~c~0 := 0; {4996#false} is VALID [2022-04-08 10:32:43,700 INFO L290 TraceCheckUtils]: 56: Hoare triple {4996#false} assume !!(~c~0 < 6); {4996#false} is VALID [2022-04-08 10:32:43,700 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-08 10:32:43,700 INFO L290 TraceCheckUtils]: 58: Hoare triple {4996#false} assume !!(~c~0 < 6); {4996#false} is VALID [2022-04-08 10:32:43,700 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-08 10:32:43,700 INFO L290 TraceCheckUtils]: 60: Hoare triple {4996#false} assume !!(~c~0 < 6); {4996#false} is VALID [2022-04-08 10:32:43,700 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-08 10:32:43,700 INFO L290 TraceCheckUtils]: 62: Hoare triple {4996#false} assume !!(~c~0 < 6); {4996#false} is VALID [2022-04-08 10:32:43,700 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-08 10:32:43,700 INFO L290 TraceCheckUtils]: 64: Hoare triple {4996#false} assume !!(~c~0 < 6); {4996#false} is VALID [2022-04-08 10:32:43,700 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-08 10:32:43,700 INFO L290 TraceCheckUtils]: 66: Hoare triple {4996#false} assume !!(~c~0 < 6); {4996#false} is VALID [2022-04-08 10:32:43,700 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-08 10:32:43,700 INFO L290 TraceCheckUtils]: 68: Hoare triple {4996#false} assume !(~c~0 < 6); {4996#false} is VALID [2022-04-08 10:32:43,700 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-08 10:32:43,700 INFO L290 TraceCheckUtils]: 70: Hoare triple {4996#false} assume !(~b~0 < 6); {4996#false} is VALID [2022-04-08 10:32:43,700 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-08 10:32:43,700 INFO L290 TraceCheckUtils]: 72: Hoare triple {4996#false} assume !(~a~0 < 6); {4996#false} is VALID [2022-04-08 10:32:43,701 INFO L290 TraceCheckUtils]: 73: Hoare triple {4996#false} assume !((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0); {4996#false} is VALID [2022-04-08 10:32:43,701 INFO L290 TraceCheckUtils]: 74: Hoare triple {4996#false} assume !false; {4996#false} is VALID [2022-04-08 10:32:43,701 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-08 10:32:43,701 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:32:43,913 INFO L290 TraceCheckUtils]: 74: Hoare triple {4996#false} assume !false; {4996#false} is VALID [2022-04-08 10:32:43,914 INFO L290 TraceCheckUtils]: 73: Hoare triple {4996#false} assume !((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0); {4996#false} is VALID [2022-04-08 10:32:43,914 INFO L290 TraceCheckUtils]: 72: Hoare triple {4996#false} assume !(~a~0 < 6); {4996#false} is VALID [2022-04-08 10:32:43,914 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-08 10:32:43,914 INFO L290 TraceCheckUtils]: 70: Hoare triple {4996#false} assume !(~b~0 < 6); {4996#false} is VALID [2022-04-08 10:32:43,914 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-08 10:32:43,914 INFO L290 TraceCheckUtils]: 68: Hoare triple {4996#false} assume !(~c~0 < 6); {4996#false} is VALID [2022-04-08 10:32:43,914 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-08 10:32:43,914 INFO L290 TraceCheckUtils]: 66: Hoare triple {4996#false} assume !!(~c~0 < 6); {4996#false} is VALID [2022-04-08 10:32:43,914 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-08 10:32:43,914 INFO L290 TraceCheckUtils]: 64: Hoare triple {4996#false} assume !!(~c~0 < 6); {4996#false} is VALID [2022-04-08 10:32:43,914 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-08 10:32:43,914 INFO L290 TraceCheckUtils]: 62: Hoare triple {4996#false} assume !!(~c~0 < 6); {4996#false} is VALID [2022-04-08 10:32:43,914 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-08 10:32:43,914 INFO L290 TraceCheckUtils]: 60: Hoare triple {4996#false} assume !!(~c~0 < 6); {4996#false} is VALID [2022-04-08 10:32:43,914 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-08 10:32:43,914 INFO L290 TraceCheckUtils]: 58: Hoare triple {4996#false} assume !!(~c~0 < 6); {4996#false} is VALID [2022-04-08 10:32:43,915 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-08 10:32:43,915 INFO L290 TraceCheckUtils]: 56: Hoare triple {4996#false} assume !!(~c~0 < 6); {4996#false} is VALID [2022-04-08 10:32:43,915 INFO L290 TraceCheckUtils]: 55: Hoare triple {4996#false} assume !!(~b~0 < 6);~c~0 := 0; {4996#false} is VALID [2022-04-08 10:32:43,915 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-08 10:32:43,915 INFO L290 TraceCheckUtils]: 53: Hoare triple {4996#false} assume !(~c~0 < 6); {4996#false} is VALID [2022-04-08 10:32:43,915 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-08 10:32:43,915 INFO L290 TraceCheckUtils]: 51: Hoare triple {4996#false} assume !!(~c~0 < 6); {4996#false} is VALID [2022-04-08 10:32:43,915 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-08 10:32:43,915 INFO L290 TraceCheckUtils]: 49: Hoare triple {4996#false} assume !!(~c~0 < 6); {4996#false} is VALID [2022-04-08 10:32:43,915 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-08 10:32:43,915 INFO L290 TraceCheckUtils]: 47: Hoare triple {4996#false} assume !!(~c~0 < 6); {4996#false} is VALID [2022-04-08 10:32:43,915 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-08 10:32:43,915 INFO L290 TraceCheckUtils]: 45: Hoare triple {4996#false} assume !!(~c~0 < 6); {4996#false} is VALID [2022-04-08 10:32:43,915 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-08 10:32:43,915 INFO L290 TraceCheckUtils]: 43: Hoare triple {4996#false} assume !!(~c~0 < 6); {4996#false} is VALID [2022-04-08 10:32:43,915 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-08 10:32:43,915 INFO L290 TraceCheckUtils]: 41: Hoare triple {4996#false} assume !!(~c~0 < 6); {4996#false} is VALID [2022-04-08 10:32:43,915 INFO L290 TraceCheckUtils]: 40: Hoare triple {4996#false} assume !!(~b~0 < 6);~c~0 := 0; {4996#false} is VALID [2022-04-08 10:32:43,916 INFO L290 TraceCheckUtils]: 39: Hoare triple {4996#false} assume !!(~a~0 < 6);~b~0 := 0; {4996#false} is VALID [2022-04-08 10:32:43,916 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-08 10:32:43,916 INFO L290 TraceCheckUtils]: 37: Hoare triple {5341#(< main_~b~0 6)} assume !(~b~0 < 6); {4996#false} is VALID [2022-04-08 10:32:43,916 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-08 10:32:43,917 INFO L290 TraceCheckUtils]: 35: Hoare triple {5345#(< main_~b~0 5)} assume !(~c~0 < 6); {5345#(< main_~b~0 5)} is VALID [2022-04-08 10:32:43,917 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-08 10:32:43,917 INFO L290 TraceCheckUtils]: 33: Hoare triple {5345#(< main_~b~0 5)} assume !!(~c~0 < 6); {5345#(< main_~b~0 5)} is VALID [2022-04-08 10:32:43,917 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-08 10:32:43,918 INFO L290 TraceCheckUtils]: 31: Hoare triple {5345#(< main_~b~0 5)} assume !!(~c~0 < 6); {5345#(< main_~b~0 5)} is VALID [2022-04-08 10:32:43,918 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-08 10:32:43,918 INFO L290 TraceCheckUtils]: 29: Hoare triple {5345#(< main_~b~0 5)} assume !!(~c~0 < 6); {5345#(< main_~b~0 5)} is VALID [2022-04-08 10:32:43,918 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-08 10:32:43,918 INFO L290 TraceCheckUtils]: 27: Hoare triple {5345#(< main_~b~0 5)} assume !!(~c~0 < 6); {5345#(< main_~b~0 5)} is VALID [2022-04-08 10:32:43,919 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-08 10:32:43,919 INFO L290 TraceCheckUtils]: 25: Hoare triple {5345#(< main_~b~0 5)} assume !!(~c~0 < 6); {5345#(< main_~b~0 5)} is VALID [2022-04-08 10:32:43,919 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-08 10:32:43,919 INFO L290 TraceCheckUtils]: 23: Hoare triple {5345#(< main_~b~0 5)} assume !!(~c~0 < 6); {5345#(< main_~b~0 5)} is VALID [2022-04-08 10:32:43,920 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-08 10:32:43,920 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-08 10:32:43,920 INFO L290 TraceCheckUtils]: 20: Hoare triple {5391#(< main_~b~0 4)} assume !(~c~0 < 6); {5391#(< main_~b~0 4)} is VALID [2022-04-08 10:32:43,921 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-08 10:32:43,921 INFO L290 TraceCheckUtils]: 18: Hoare triple {5391#(< main_~b~0 4)} assume !!(~c~0 < 6); {5391#(< main_~b~0 4)} is VALID [2022-04-08 10:32:43,921 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-08 10:32:43,921 INFO L290 TraceCheckUtils]: 16: Hoare triple {5391#(< main_~b~0 4)} assume !!(~c~0 < 6); {5391#(< main_~b~0 4)} is VALID [2022-04-08 10:32:43,922 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-08 10:32:43,922 INFO L290 TraceCheckUtils]: 14: Hoare triple {5391#(< main_~b~0 4)} assume !!(~c~0 < 6); {5391#(< main_~b~0 4)} is VALID [2022-04-08 10:32:43,922 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-08 10:32:43,922 INFO L290 TraceCheckUtils]: 12: Hoare triple {5391#(< main_~b~0 4)} assume !!(~c~0 < 6); {5391#(< main_~b~0 4)} is VALID [2022-04-08 10:32:43,922 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-08 10:32:43,923 INFO L290 TraceCheckUtils]: 10: Hoare triple {5391#(< main_~b~0 4)} assume !!(~c~0 < 6); {5391#(< main_~b~0 4)} is VALID [2022-04-08 10:32:43,923 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-08 10:32:43,923 INFO L290 TraceCheckUtils]: 8: Hoare triple {5391#(< main_~b~0 4)} assume !!(~c~0 < 6); {5391#(< main_~b~0 4)} is VALID [2022-04-08 10:32:43,923 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-08 10:32:43,924 INFO L290 TraceCheckUtils]: 6: Hoare triple {4995#true} assume !!(~a~0 < 6);~b~0 := 0; {5391#(< main_~b~0 4)} is VALID [2022-04-08 10:32:43,924 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-08 10:32:43,924 INFO L272 TraceCheckUtils]: 4: Hoare triple {4995#true} call #t~ret7 := main(); {4995#true} is VALID [2022-04-08 10:32:43,924 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4995#true} {4995#true} #56#return; {4995#true} is VALID [2022-04-08 10:32:43,924 INFO L290 TraceCheckUtils]: 2: Hoare triple {4995#true} assume true; {4995#true} is VALID [2022-04-08 10:32:43,924 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-08 10:32:43,924 INFO L272 TraceCheckUtils]: 0: Hoare triple {4995#true} call ULTIMATE.init(); {4995#true} is VALID [2022-04-08 10:32:43,924 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-08 10:32:43,925 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [94215573] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:32:43,925 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:32:43,925 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 10 [2022-04-08 10:32:43,925 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:32:43,925 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1138923470] [2022-04-08 10:32:43,925 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1138923470] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:32:43,925 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:32:43,925 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 10:32:43,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [993381851] [2022-04-08 10:32:43,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:32:43,926 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-08 10:32:43,926 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:32:43,926 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-08 10:32:43,944 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-08 10:32:43,944 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-08 10:32:43,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:32:43,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-08 10:32:43,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2022-04-08 10:32:43,945 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-08 10:32:44,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:32:44,179 INFO L93 Difference]: Finished difference Result 172 states and 187 transitions. [2022-04-08 10:32:44,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-08 10:32:44,179 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-08 10:32:44,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:32:44,179 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-08 10:32:44,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 44 transitions. [2022-04-08 10:32:44,180 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-08 10:32:44,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 44 transitions. [2022-04-08 10:32:44,180 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 44 transitions. [2022-04-08 10:32:44,208 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-08 10:32:44,209 INFO L225 Difference]: With dead ends: 172 [2022-04-08 10:32:44,209 INFO L226 Difference]: Without dead ends: 134 [2022-04-08 10:32:44,209 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-08 10:32:44,210 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-08 10:32:44,210 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-08 10:32:44,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2022-04-08 10:32:44,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 106. [2022-04-08 10:32:44,320 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:32:44,321 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-08 10:32:44,321 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-08 10:32:44,321 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-08 10:32:44,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:32:44,323 INFO L93 Difference]: Finished difference Result 134 states and 144 transitions. [2022-04-08 10:32:44,323 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 144 transitions. [2022-04-08 10:32:44,323 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:32:44,323 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:32:44,323 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-08 10:32:44,323 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-08 10:32:44,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:32:44,325 INFO L93 Difference]: Finished difference Result 134 states and 144 transitions. [2022-04-08 10:32:44,325 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 144 transitions. [2022-04-08 10:32:44,325 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:32:44,325 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:32:44,325 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:32:44,325 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:32:44,325 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-08 10:32:44,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 114 transitions. [2022-04-08 10:32:44,326 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 114 transitions. Word has length 75 [2022-04-08 10:32:44,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:32:44,327 INFO L478 AbstractCegarLoop]: Abstraction has 106 states and 114 transitions. [2022-04-08 10:32:44,327 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-08 10:32:44,327 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 106 states and 114 transitions. [2022-04-08 10:32:44,438 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-08 10:32:44,438 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 114 transitions. [2022-04-08 10:32:44,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-04-08 10:32:44,438 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:32:44,438 INFO L499 BasicCegarLoop]: trace histogram [36, 36, 6, 6, 6, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:32:44,456 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-04-08 10:32:44,654 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-04-08 10:32:44,655 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:32:44,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:32:44,655 INFO L85 PathProgramCache]: Analyzing trace with hash 2068267583, now seen corresponding path program 17 times [2022-04-08 10:32:44,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:32:44,655 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1928615674] [2022-04-08 10:32:44,869 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:32:44,924 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:32:44,924 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:32:44,924 INFO L85 PathProgramCache]: Analyzing trace with hash 2068267583, now seen corresponding path program 18 times [2022-04-08 10:32:44,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:32:44,924 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2050723589] [2022-04-08 10:32:44,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:32:44,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:32:44,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:32:44,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:32:44,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:32:44,994 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-08 10:32:44,994 INFO L290 TraceCheckUtils]: 1: Hoare triple {6287#true} assume true; {6287#true} is VALID [2022-04-08 10:32:44,995 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {6287#true} {6287#true} #56#return; {6287#true} is VALID [2022-04-08 10:32:44,995 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-08 10:32:44,995 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-08 10:32:44,995 INFO L290 TraceCheckUtils]: 2: Hoare triple {6287#true} assume true; {6287#true} is VALID [2022-04-08 10:32:44,995 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6287#true} {6287#true} #56#return; {6287#true} is VALID [2022-04-08 10:32:44,995 INFO L272 TraceCheckUtils]: 4: Hoare triple {6287#true} call #t~ret7 := main(); {6287#true} is VALID [2022-04-08 10:32:44,995 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-08 10:32:44,995 INFO L290 TraceCheckUtils]: 6: Hoare triple {6287#true} assume !!(~a~0 < 6);~b~0 := 0; {6292#(= main_~b~0 0)} is VALID [2022-04-08 10:32:44,996 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-08 10:32:44,996 INFO L290 TraceCheckUtils]: 8: Hoare triple {6292#(= main_~b~0 0)} assume !!(~c~0 < 6); {6292#(= main_~b~0 0)} is VALID [2022-04-08 10:32:44,996 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-08 10:32:44,996 INFO L290 TraceCheckUtils]: 10: Hoare triple {6292#(= main_~b~0 0)} assume !!(~c~0 < 6); {6292#(= main_~b~0 0)} is VALID [2022-04-08 10:32:44,997 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-08 10:32:44,997 INFO L290 TraceCheckUtils]: 12: Hoare triple {6292#(= main_~b~0 0)} assume !!(~c~0 < 6); {6292#(= main_~b~0 0)} is VALID [2022-04-08 10:32:44,997 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-08 10:32:44,997 INFO L290 TraceCheckUtils]: 14: Hoare triple {6292#(= main_~b~0 0)} assume !!(~c~0 < 6); {6292#(= main_~b~0 0)} is VALID [2022-04-08 10:32:44,997 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-08 10:32:44,998 INFO L290 TraceCheckUtils]: 16: Hoare triple {6292#(= main_~b~0 0)} assume !!(~c~0 < 6); {6292#(= main_~b~0 0)} is VALID [2022-04-08 10:32:44,998 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-08 10:32:44,998 INFO L290 TraceCheckUtils]: 18: Hoare triple {6292#(= main_~b~0 0)} assume !!(~c~0 < 6); {6292#(= main_~b~0 0)} is VALID [2022-04-08 10:32:44,998 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-08 10:32:44,999 INFO L290 TraceCheckUtils]: 20: Hoare triple {6292#(= main_~b~0 0)} assume !(~c~0 < 6); {6292#(= main_~b~0 0)} is VALID [2022-04-08 10:32:44,999 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-08 10:32:44,999 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-08 10:32:44,999 INFO L290 TraceCheckUtils]: 23: Hoare triple {6293#(<= main_~b~0 1)} assume !!(~c~0 < 6); {6293#(<= main_~b~0 1)} is VALID [2022-04-08 10:32:44,999 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-08 10:32:45,000 INFO L290 TraceCheckUtils]: 25: Hoare triple {6293#(<= main_~b~0 1)} assume !!(~c~0 < 6); {6293#(<= main_~b~0 1)} is VALID [2022-04-08 10:32:45,000 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-08 10:32:45,000 INFO L290 TraceCheckUtils]: 27: Hoare triple {6293#(<= main_~b~0 1)} assume !!(~c~0 < 6); {6293#(<= main_~b~0 1)} is VALID [2022-04-08 10:32:45,000 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-08 10:32:45,001 INFO L290 TraceCheckUtils]: 29: Hoare triple {6293#(<= main_~b~0 1)} assume !!(~c~0 < 6); {6293#(<= main_~b~0 1)} is VALID [2022-04-08 10:32:45,001 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-08 10:32:45,001 INFO L290 TraceCheckUtils]: 31: Hoare triple {6293#(<= main_~b~0 1)} assume !!(~c~0 < 6); {6293#(<= main_~b~0 1)} is VALID [2022-04-08 10:32:45,001 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-08 10:32:45,001 INFO L290 TraceCheckUtils]: 33: Hoare triple {6293#(<= main_~b~0 1)} assume !!(~c~0 < 6); {6293#(<= main_~b~0 1)} is VALID [2022-04-08 10:32:45,002 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-08 10:32:45,002 INFO L290 TraceCheckUtils]: 35: Hoare triple {6293#(<= main_~b~0 1)} assume !(~c~0 < 6); {6293#(<= main_~b~0 1)} is VALID [2022-04-08 10:32:45,002 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-08 10:32:45,002 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-08 10:32:45,003 INFO L290 TraceCheckUtils]: 38: Hoare triple {6294#(<= main_~b~0 2)} assume !!(~c~0 < 6); {6294#(<= main_~b~0 2)} is VALID [2022-04-08 10:32:45,003 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-08 10:32:45,003 INFO L290 TraceCheckUtils]: 40: Hoare triple {6294#(<= main_~b~0 2)} assume !!(~c~0 < 6); {6294#(<= main_~b~0 2)} is VALID [2022-04-08 10:32:45,003 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-08 10:32:45,004 INFO L290 TraceCheckUtils]: 42: Hoare triple {6294#(<= main_~b~0 2)} assume !!(~c~0 < 6); {6294#(<= main_~b~0 2)} is VALID [2022-04-08 10:32:45,004 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-08 10:32:45,004 INFO L290 TraceCheckUtils]: 44: Hoare triple {6294#(<= main_~b~0 2)} assume !!(~c~0 < 6); {6294#(<= main_~b~0 2)} is VALID [2022-04-08 10:32:45,004 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-08 10:32:45,005 INFO L290 TraceCheckUtils]: 46: Hoare triple {6294#(<= main_~b~0 2)} assume !!(~c~0 < 6); {6294#(<= main_~b~0 2)} is VALID [2022-04-08 10:32:45,005 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-08 10:32:45,005 INFO L290 TraceCheckUtils]: 48: Hoare triple {6294#(<= main_~b~0 2)} assume !!(~c~0 < 6); {6294#(<= main_~b~0 2)} is VALID [2022-04-08 10:32:45,005 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-08 10:32:45,005 INFO L290 TraceCheckUtils]: 50: Hoare triple {6294#(<= main_~b~0 2)} assume !(~c~0 < 6); {6294#(<= main_~b~0 2)} is VALID [2022-04-08 10:32:45,006 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-08 10:32:45,006 INFO L290 TraceCheckUtils]: 52: Hoare triple {6295#(<= main_~b~0 3)} assume !(~b~0 < 6); {6288#false} is VALID [2022-04-08 10:32:45,006 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-08 10:32:45,006 INFO L290 TraceCheckUtils]: 54: Hoare triple {6288#false} assume !!(~a~0 < 6);~b~0 := 0; {6288#false} is VALID [2022-04-08 10:32:45,006 INFO L290 TraceCheckUtils]: 55: Hoare triple {6288#false} assume !!(~b~0 < 6);~c~0 := 0; {6288#false} is VALID [2022-04-08 10:32:45,006 INFO L290 TraceCheckUtils]: 56: Hoare triple {6288#false} assume !!(~c~0 < 6); {6288#false} is VALID [2022-04-08 10:32:45,006 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-08 10:32:45,006 INFO L290 TraceCheckUtils]: 58: Hoare triple {6288#false} assume !!(~c~0 < 6); {6288#false} is VALID [2022-04-08 10:32:45,006 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-08 10:32:45,007 INFO L290 TraceCheckUtils]: 60: Hoare triple {6288#false} assume !!(~c~0 < 6); {6288#false} is VALID [2022-04-08 10:32:45,007 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-08 10:32:45,007 INFO L290 TraceCheckUtils]: 62: Hoare triple {6288#false} assume !!(~c~0 < 6); {6288#false} is VALID [2022-04-08 10:32:45,007 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-08 10:32:45,007 INFO L290 TraceCheckUtils]: 64: Hoare triple {6288#false} assume !!(~c~0 < 6); {6288#false} is VALID [2022-04-08 10:32:45,007 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-08 10:32:45,007 INFO L290 TraceCheckUtils]: 66: Hoare triple {6288#false} assume !!(~c~0 < 6); {6288#false} is VALID [2022-04-08 10:32:45,007 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-08 10:32:45,007 INFO L290 TraceCheckUtils]: 68: Hoare triple {6288#false} assume !(~c~0 < 6); {6288#false} is VALID [2022-04-08 10:32:45,007 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-08 10:32:45,007 INFO L290 TraceCheckUtils]: 70: Hoare triple {6288#false} assume !!(~b~0 < 6);~c~0 := 0; {6288#false} is VALID [2022-04-08 10:32:45,007 INFO L290 TraceCheckUtils]: 71: Hoare triple {6288#false} assume !!(~c~0 < 6); {6288#false} is VALID [2022-04-08 10:32:45,007 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-08 10:32:45,007 INFO L290 TraceCheckUtils]: 73: Hoare triple {6288#false} assume !!(~c~0 < 6); {6288#false} is VALID [2022-04-08 10:32:45,007 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-08 10:32:45,007 INFO L290 TraceCheckUtils]: 75: Hoare triple {6288#false} assume !!(~c~0 < 6); {6288#false} is VALID [2022-04-08 10:32:45,007 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-08 10:32:45,007 INFO L290 TraceCheckUtils]: 77: Hoare triple {6288#false} assume !!(~c~0 < 6); {6288#false} is VALID [2022-04-08 10:32:45,008 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-08 10:32:45,008 INFO L290 TraceCheckUtils]: 79: Hoare triple {6288#false} assume !!(~c~0 < 6); {6288#false} is VALID [2022-04-08 10:32:45,008 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-08 10:32:45,008 INFO L290 TraceCheckUtils]: 81: Hoare triple {6288#false} assume !!(~c~0 < 6); {6288#false} is VALID [2022-04-08 10:32:45,008 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-08 10:32:45,008 INFO L290 TraceCheckUtils]: 83: Hoare triple {6288#false} assume !(~c~0 < 6); {6288#false} is VALID [2022-04-08 10:32:45,008 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-08 10:32:45,008 INFO L290 TraceCheckUtils]: 85: Hoare triple {6288#false} assume !!(~b~0 < 6);~c~0 := 0; {6288#false} is VALID [2022-04-08 10:32:45,008 INFO L290 TraceCheckUtils]: 86: Hoare triple {6288#false} assume !!(~c~0 < 6); {6288#false} is VALID [2022-04-08 10:32:45,008 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-08 10:32:45,008 INFO L290 TraceCheckUtils]: 88: Hoare triple {6288#false} assume !!(~c~0 < 6); {6288#false} is VALID [2022-04-08 10:32:45,008 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-08 10:32:45,008 INFO L290 TraceCheckUtils]: 90: Hoare triple {6288#false} assume !!(~c~0 < 6); {6288#false} is VALID [2022-04-08 10:32:45,008 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-08 10:32:45,008 INFO L290 TraceCheckUtils]: 92: Hoare triple {6288#false} assume !!(~c~0 < 6); {6288#false} is VALID [2022-04-08 10:32:45,008 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-08 10:32:45,008 INFO L290 TraceCheckUtils]: 94: Hoare triple {6288#false} assume !!(~c~0 < 6); {6288#false} is VALID [2022-04-08 10:32:45,008 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-08 10:32:45,008 INFO L290 TraceCheckUtils]: 96: Hoare triple {6288#false} assume !!(~c~0 < 6); {6288#false} is VALID [2022-04-08 10:32:45,009 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-08 10:32:45,009 INFO L290 TraceCheckUtils]: 98: Hoare triple {6288#false} assume !(~c~0 < 6); {6288#false} is VALID [2022-04-08 10:32:45,009 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-08 10:32:45,009 INFO L290 TraceCheckUtils]: 100: Hoare triple {6288#false} assume !(~b~0 < 6); {6288#false} is VALID [2022-04-08 10:32:45,009 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-08 10:32:45,009 INFO L290 TraceCheckUtils]: 102: Hoare triple {6288#false} assume !(~a~0 < 6); {6288#false} is VALID [2022-04-08 10:32:45,009 INFO L290 TraceCheckUtils]: 103: Hoare triple {6288#false} assume !((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0); {6288#false} is VALID [2022-04-08 10:32:45,009 INFO L290 TraceCheckUtils]: 104: Hoare triple {6288#false} assume !false; {6288#false} is VALID [2022-04-08 10:32:45,009 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-08 10:32:45,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:32:45,010 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2050723589] [2022-04-08 10:32:45,010 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2050723589] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:32:45,010 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1933404796] [2022-04-08 10:32:45,010 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 10:32:45,010 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:32:45,010 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:32:45,012 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-08 10:32:45,012 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-08 10:32:45,058 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 14 check-sat command(s) [2022-04-08 10:32:45,058 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:32:45,058 INFO L263 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 4 conjunts are in the unsatisfiable core [2022-04-08 10:32:45,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:32:45,070 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:32:45,383 INFO L272 TraceCheckUtils]: 0: Hoare triple {6287#true} call ULTIMATE.init(); {6287#true} is VALID [2022-04-08 10:32:45,384 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-08 10:32:45,384 INFO L290 TraceCheckUtils]: 2: Hoare triple {6287#true} assume true; {6287#true} is VALID [2022-04-08 10:32:45,384 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6287#true} {6287#true} #56#return; {6287#true} is VALID [2022-04-08 10:32:45,384 INFO L272 TraceCheckUtils]: 4: Hoare triple {6287#true} call #t~ret7 := main(); {6287#true} is VALID [2022-04-08 10:32:45,384 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-08 10:32:45,384 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-08 10:32:45,386 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-08 10:32:45,386 INFO L290 TraceCheckUtils]: 8: Hoare triple {6315#(<= main_~a~0 0)} assume !!(~c~0 < 6); {6315#(<= main_~a~0 0)} is VALID [2022-04-08 10:32:45,387 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-08 10:32:45,387 INFO L290 TraceCheckUtils]: 10: Hoare triple {6315#(<= main_~a~0 0)} assume !!(~c~0 < 6); {6315#(<= main_~a~0 0)} is VALID [2022-04-08 10:32:45,387 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-08 10:32:45,387 INFO L290 TraceCheckUtils]: 12: Hoare triple {6315#(<= main_~a~0 0)} assume !!(~c~0 < 6); {6315#(<= main_~a~0 0)} is VALID [2022-04-08 10:32:45,388 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-08 10:32:45,388 INFO L290 TraceCheckUtils]: 14: Hoare triple {6315#(<= main_~a~0 0)} assume !!(~c~0 < 6); {6315#(<= main_~a~0 0)} is VALID [2022-04-08 10:32:45,388 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-08 10:32:45,388 INFO L290 TraceCheckUtils]: 16: Hoare triple {6315#(<= main_~a~0 0)} assume !!(~c~0 < 6); {6315#(<= main_~a~0 0)} is VALID [2022-04-08 10:32:45,388 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-08 10:32:45,389 INFO L290 TraceCheckUtils]: 18: Hoare triple {6315#(<= main_~a~0 0)} assume !!(~c~0 < 6); {6315#(<= main_~a~0 0)} is VALID [2022-04-08 10:32:45,389 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-08 10:32:45,389 INFO L290 TraceCheckUtils]: 20: Hoare triple {6315#(<= main_~a~0 0)} assume !(~c~0 < 6); {6315#(<= main_~a~0 0)} is VALID [2022-04-08 10:32:45,389 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-08 10:32:45,390 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-08 10:32:45,390 INFO L290 TraceCheckUtils]: 23: Hoare triple {6315#(<= main_~a~0 0)} assume !!(~c~0 < 6); {6315#(<= main_~a~0 0)} is VALID [2022-04-08 10:32:45,390 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-08 10:32:45,390 INFO L290 TraceCheckUtils]: 25: Hoare triple {6315#(<= main_~a~0 0)} assume !!(~c~0 < 6); {6315#(<= main_~a~0 0)} is VALID [2022-04-08 10:32:45,391 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-08 10:32:45,391 INFO L290 TraceCheckUtils]: 27: Hoare triple {6315#(<= main_~a~0 0)} assume !!(~c~0 < 6); {6315#(<= main_~a~0 0)} is VALID [2022-04-08 10:32:45,391 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-08 10:32:45,391 INFO L290 TraceCheckUtils]: 29: Hoare triple {6315#(<= main_~a~0 0)} assume !!(~c~0 < 6); {6315#(<= main_~a~0 0)} is VALID [2022-04-08 10:32:45,392 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-08 10:32:45,392 INFO L290 TraceCheckUtils]: 31: Hoare triple {6315#(<= main_~a~0 0)} assume !!(~c~0 < 6); {6315#(<= main_~a~0 0)} is VALID [2022-04-08 10:32:45,392 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-08 10:32:45,392 INFO L290 TraceCheckUtils]: 33: Hoare triple {6315#(<= main_~a~0 0)} assume !!(~c~0 < 6); {6315#(<= main_~a~0 0)} is VALID [2022-04-08 10:32:45,392 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-08 10:32:45,393 INFO L290 TraceCheckUtils]: 35: Hoare triple {6315#(<= main_~a~0 0)} assume !(~c~0 < 6); {6315#(<= main_~a~0 0)} is VALID [2022-04-08 10:32:45,393 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-08 10:32:45,393 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-08 10:32:45,393 INFO L290 TraceCheckUtils]: 38: Hoare triple {6315#(<= main_~a~0 0)} assume !!(~c~0 < 6); {6315#(<= main_~a~0 0)} is VALID [2022-04-08 10:32:45,394 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-08 10:32:45,394 INFO L290 TraceCheckUtils]: 40: Hoare triple {6315#(<= main_~a~0 0)} assume !!(~c~0 < 6); {6315#(<= main_~a~0 0)} is VALID [2022-04-08 10:32:45,394 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-08 10:32:45,394 INFO L290 TraceCheckUtils]: 42: Hoare triple {6315#(<= main_~a~0 0)} assume !!(~c~0 < 6); {6315#(<= main_~a~0 0)} is VALID [2022-04-08 10:32:45,397 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-08 10:32:45,399 INFO L290 TraceCheckUtils]: 44: Hoare triple {6315#(<= main_~a~0 0)} assume !!(~c~0 < 6); {6315#(<= main_~a~0 0)} is VALID [2022-04-08 10:32:45,399 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-08 10:32:45,399 INFO L290 TraceCheckUtils]: 46: Hoare triple {6315#(<= main_~a~0 0)} assume !!(~c~0 < 6); {6315#(<= main_~a~0 0)} is VALID [2022-04-08 10:32:45,400 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-08 10:32:45,400 INFO L290 TraceCheckUtils]: 48: Hoare triple {6315#(<= main_~a~0 0)} assume !!(~c~0 < 6); {6315#(<= main_~a~0 0)} is VALID [2022-04-08 10:32:45,400 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-08 10:32:45,400 INFO L290 TraceCheckUtils]: 50: Hoare triple {6315#(<= main_~a~0 0)} assume !(~c~0 < 6); {6315#(<= main_~a~0 0)} is VALID [2022-04-08 10:32:45,401 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-08 10:32:45,401 INFO L290 TraceCheckUtils]: 52: Hoare triple {6315#(<= main_~a~0 0)} assume !(~b~0 < 6); {6315#(<= main_~a~0 0)} is VALID [2022-04-08 10:32:45,405 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-08 10:32:45,405 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-08 10:32:45,405 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-08 10:32:45,405 INFO L290 TraceCheckUtils]: 56: Hoare triple {6460#(<= main_~a~0 1)} assume !!(~c~0 < 6); {6460#(<= main_~a~0 1)} is VALID [2022-04-08 10:32:45,406 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-08 10:32:45,406 INFO L290 TraceCheckUtils]: 58: Hoare triple {6460#(<= main_~a~0 1)} assume !!(~c~0 < 6); {6460#(<= main_~a~0 1)} is VALID [2022-04-08 10:32:45,406 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-08 10:32:45,406 INFO L290 TraceCheckUtils]: 60: Hoare triple {6460#(<= main_~a~0 1)} assume !!(~c~0 < 6); {6460#(<= main_~a~0 1)} is VALID [2022-04-08 10:32:45,407 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-08 10:32:45,407 INFO L290 TraceCheckUtils]: 62: Hoare triple {6460#(<= main_~a~0 1)} assume !!(~c~0 < 6); {6460#(<= main_~a~0 1)} is VALID [2022-04-08 10:32:45,407 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-08 10:32:45,408 INFO L290 TraceCheckUtils]: 64: Hoare triple {6460#(<= main_~a~0 1)} assume !!(~c~0 < 6); {6460#(<= main_~a~0 1)} is VALID [2022-04-08 10:32:45,408 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-08 10:32:45,408 INFO L290 TraceCheckUtils]: 66: Hoare triple {6460#(<= main_~a~0 1)} assume !!(~c~0 < 6); {6460#(<= main_~a~0 1)} is VALID [2022-04-08 10:32:45,408 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-08 10:32:45,409 INFO L290 TraceCheckUtils]: 68: Hoare triple {6460#(<= main_~a~0 1)} assume !(~c~0 < 6); {6460#(<= main_~a~0 1)} is VALID [2022-04-08 10:32:45,409 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-08 10:32:45,409 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-08 10:32:45,409 INFO L290 TraceCheckUtils]: 71: Hoare triple {6460#(<= main_~a~0 1)} assume !!(~c~0 < 6); {6460#(<= main_~a~0 1)} is VALID [2022-04-08 10:32:45,410 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-08 10:32:45,410 INFO L290 TraceCheckUtils]: 73: Hoare triple {6460#(<= main_~a~0 1)} assume !!(~c~0 < 6); {6460#(<= main_~a~0 1)} is VALID [2022-04-08 10:32:45,410 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-08 10:32:45,410 INFO L290 TraceCheckUtils]: 75: Hoare triple {6460#(<= main_~a~0 1)} assume !!(~c~0 < 6); {6460#(<= main_~a~0 1)} is VALID [2022-04-08 10:32:45,411 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-08 10:32:45,411 INFO L290 TraceCheckUtils]: 77: Hoare triple {6460#(<= main_~a~0 1)} assume !!(~c~0 < 6); {6460#(<= main_~a~0 1)} is VALID [2022-04-08 10:32:45,411 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-08 10:32:45,411 INFO L290 TraceCheckUtils]: 79: Hoare triple {6460#(<= main_~a~0 1)} assume !!(~c~0 < 6); {6460#(<= main_~a~0 1)} is VALID [2022-04-08 10:32:45,412 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-08 10:32:45,412 INFO L290 TraceCheckUtils]: 81: Hoare triple {6460#(<= main_~a~0 1)} assume !!(~c~0 < 6); {6460#(<= main_~a~0 1)} is VALID [2022-04-08 10:32:45,412 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-08 10:32:45,412 INFO L290 TraceCheckUtils]: 83: Hoare triple {6460#(<= main_~a~0 1)} assume !(~c~0 < 6); {6460#(<= main_~a~0 1)} is VALID [2022-04-08 10:32:45,413 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-08 10:32:45,413 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-08 10:32:45,413 INFO L290 TraceCheckUtils]: 86: Hoare triple {6460#(<= main_~a~0 1)} assume !!(~c~0 < 6); {6460#(<= main_~a~0 1)} is VALID [2022-04-08 10:32:45,413 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-08 10:32:45,414 INFO L290 TraceCheckUtils]: 88: Hoare triple {6460#(<= main_~a~0 1)} assume !!(~c~0 < 6); {6460#(<= main_~a~0 1)} is VALID [2022-04-08 10:32:45,414 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-08 10:32:45,414 INFO L290 TraceCheckUtils]: 90: Hoare triple {6460#(<= main_~a~0 1)} assume !!(~c~0 < 6); {6460#(<= main_~a~0 1)} is VALID [2022-04-08 10:32:45,414 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-08 10:32:45,415 INFO L290 TraceCheckUtils]: 92: Hoare triple {6460#(<= main_~a~0 1)} assume !!(~c~0 < 6); {6460#(<= main_~a~0 1)} is VALID [2022-04-08 10:32:45,415 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-08 10:32:45,415 INFO L290 TraceCheckUtils]: 94: Hoare triple {6460#(<= main_~a~0 1)} assume !!(~c~0 < 6); {6460#(<= main_~a~0 1)} is VALID [2022-04-08 10:32:45,415 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-08 10:32:45,416 INFO L290 TraceCheckUtils]: 96: Hoare triple {6460#(<= main_~a~0 1)} assume !!(~c~0 < 6); {6460#(<= main_~a~0 1)} is VALID [2022-04-08 10:32:45,416 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-08 10:32:45,416 INFO L290 TraceCheckUtils]: 98: Hoare triple {6460#(<= main_~a~0 1)} assume !(~c~0 < 6); {6460#(<= main_~a~0 1)} is VALID [2022-04-08 10:32:45,416 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-08 10:32:45,417 INFO L290 TraceCheckUtils]: 100: Hoare triple {6460#(<= main_~a~0 1)} assume !(~b~0 < 6); {6460#(<= main_~a~0 1)} is VALID [2022-04-08 10:32:45,417 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-08 10:32:45,417 INFO L290 TraceCheckUtils]: 102: Hoare triple {6605#(<= main_~a~0 2)} assume !(~a~0 < 6); {6288#false} is VALID [2022-04-08 10:32:45,417 INFO L290 TraceCheckUtils]: 103: Hoare triple {6288#false} assume !((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0); {6288#false} is VALID [2022-04-08 10:32:45,417 INFO L290 TraceCheckUtils]: 104: Hoare triple {6288#false} assume !false; {6288#false} is VALID [2022-04-08 10:32:45,418 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-08 10:32:45,418 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:32:45,749 INFO L290 TraceCheckUtils]: 104: Hoare triple {6288#false} assume !false; {6288#false} is VALID [2022-04-08 10:32:45,749 INFO L290 TraceCheckUtils]: 103: Hoare triple {6288#false} assume !((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0); {6288#false} is VALID [2022-04-08 10:32:45,749 INFO L290 TraceCheckUtils]: 102: Hoare triple {6621#(< main_~a~0 6)} assume !(~a~0 < 6); {6288#false} is VALID [2022-04-08 10:32:45,749 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-08 10:32:45,750 INFO L290 TraceCheckUtils]: 100: Hoare triple {6625#(< main_~a~0 5)} assume !(~b~0 < 6); {6625#(< main_~a~0 5)} is VALID [2022-04-08 10:32:45,750 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-08 10:32:45,750 INFO L290 TraceCheckUtils]: 98: Hoare triple {6625#(< main_~a~0 5)} assume !(~c~0 < 6); {6625#(< main_~a~0 5)} is VALID [2022-04-08 10:32:45,750 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-08 10:32:45,751 INFO L290 TraceCheckUtils]: 96: Hoare triple {6625#(< main_~a~0 5)} assume !!(~c~0 < 6); {6625#(< main_~a~0 5)} is VALID [2022-04-08 10:32:45,751 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-08 10:32:45,752 INFO L290 TraceCheckUtils]: 94: Hoare triple {6625#(< main_~a~0 5)} assume !!(~c~0 < 6); {6625#(< main_~a~0 5)} is VALID [2022-04-08 10:32:45,752 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-08 10:32:45,753 INFO L290 TraceCheckUtils]: 92: Hoare triple {6625#(< main_~a~0 5)} assume !!(~c~0 < 6); {6625#(< main_~a~0 5)} is VALID [2022-04-08 10:32:45,753 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-08 10:32:45,754 INFO L290 TraceCheckUtils]: 90: Hoare triple {6625#(< main_~a~0 5)} assume !!(~c~0 < 6); {6625#(< main_~a~0 5)} is VALID [2022-04-08 10:32:45,754 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-08 10:32:45,754 INFO L290 TraceCheckUtils]: 88: Hoare triple {6625#(< main_~a~0 5)} assume !!(~c~0 < 6); {6625#(< main_~a~0 5)} is VALID [2022-04-08 10:32:45,754 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-08 10:32:45,755 INFO L290 TraceCheckUtils]: 86: Hoare triple {6625#(< main_~a~0 5)} assume !!(~c~0 < 6); {6625#(< main_~a~0 5)} is VALID [2022-04-08 10:32:45,755 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-08 10:32:45,755 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-08 10:32:45,755 INFO L290 TraceCheckUtils]: 83: Hoare triple {6625#(< main_~a~0 5)} assume !(~c~0 < 6); {6625#(< main_~a~0 5)} is VALID [2022-04-08 10:32:45,756 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-08 10:32:45,756 INFO L290 TraceCheckUtils]: 81: Hoare triple {6625#(< main_~a~0 5)} assume !!(~c~0 < 6); {6625#(< main_~a~0 5)} is VALID [2022-04-08 10:32:45,756 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-08 10:32:45,756 INFO L290 TraceCheckUtils]: 79: Hoare triple {6625#(< main_~a~0 5)} assume !!(~c~0 < 6); {6625#(< main_~a~0 5)} is VALID [2022-04-08 10:32:45,760 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-08 10:32:45,760 INFO L290 TraceCheckUtils]: 77: Hoare triple {6625#(< main_~a~0 5)} assume !!(~c~0 < 6); {6625#(< main_~a~0 5)} is VALID [2022-04-08 10:32:45,760 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-08 10:32:45,761 INFO L290 TraceCheckUtils]: 75: Hoare triple {6625#(< main_~a~0 5)} assume !!(~c~0 < 6); {6625#(< main_~a~0 5)} is VALID [2022-04-08 10:32:45,761 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-08 10:32:45,761 INFO L290 TraceCheckUtils]: 73: Hoare triple {6625#(< main_~a~0 5)} assume !!(~c~0 < 6); {6625#(< main_~a~0 5)} is VALID [2022-04-08 10:32:45,761 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-08 10:32:45,762 INFO L290 TraceCheckUtils]: 71: Hoare triple {6625#(< main_~a~0 5)} assume !!(~c~0 < 6); {6625#(< main_~a~0 5)} is VALID [2022-04-08 10:32:45,762 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-08 10:32:45,762 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-08 10:32:45,762 INFO L290 TraceCheckUtils]: 68: Hoare triple {6625#(< main_~a~0 5)} assume !(~c~0 < 6); {6625#(< main_~a~0 5)} is VALID [2022-04-08 10:32:45,763 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-08 10:32:45,763 INFO L290 TraceCheckUtils]: 66: Hoare triple {6625#(< main_~a~0 5)} assume !!(~c~0 < 6); {6625#(< main_~a~0 5)} is VALID [2022-04-08 10:32:45,763 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-08 10:32:45,764 INFO L290 TraceCheckUtils]: 64: Hoare triple {6625#(< main_~a~0 5)} assume !!(~c~0 < 6); {6625#(< main_~a~0 5)} is VALID [2022-04-08 10:32:45,764 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-08 10:32:45,764 INFO L290 TraceCheckUtils]: 62: Hoare triple {6625#(< main_~a~0 5)} assume !!(~c~0 < 6); {6625#(< main_~a~0 5)} is VALID [2022-04-08 10:32:45,764 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-08 10:32:45,765 INFO L290 TraceCheckUtils]: 60: Hoare triple {6625#(< main_~a~0 5)} assume !!(~c~0 < 6); {6625#(< main_~a~0 5)} is VALID [2022-04-08 10:32:45,765 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-08 10:32:45,765 INFO L290 TraceCheckUtils]: 58: Hoare triple {6625#(< main_~a~0 5)} assume !!(~c~0 < 6); {6625#(< main_~a~0 5)} is VALID [2022-04-08 10:32:45,765 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-08 10:32:45,766 INFO L290 TraceCheckUtils]: 56: Hoare triple {6625#(< main_~a~0 5)} assume !!(~c~0 < 6); {6625#(< main_~a~0 5)} is VALID [2022-04-08 10:32:45,766 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-08 10:32:45,766 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-08 10:32:45,766 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-08 10:32:45,767 INFO L290 TraceCheckUtils]: 52: Hoare triple {6770#(< main_~a~0 4)} assume !(~b~0 < 6); {6770#(< main_~a~0 4)} is VALID [2022-04-08 10:32:45,767 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-08 10:32:45,767 INFO L290 TraceCheckUtils]: 50: Hoare triple {6770#(< main_~a~0 4)} assume !(~c~0 < 6); {6770#(< main_~a~0 4)} is VALID [2022-04-08 10:32:45,767 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-08 10:32:45,778 INFO L290 TraceCheckUtils]: 48: Hoare triple {6770#(< main_~a~0 4)} assume !!(~c~0 < 6); {6770#(< main_~a~0 4)} is VALID [2022-04-08 10:32:45,779 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-08 10:32:45,779 INFO L290 TraceCheckUtils]: 46: Hoare triple {6770#(< main_~a~0 4)} assume !!(~c~0 < 6); {6770#(< main_~a~0 4)} is VALID [2022-04-08 10:32:45,779 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-08 10:32:45,779 INFO L290 TraceCheckUtils]: 44: Hoare triple {6770#(< main_~a~0 4)} assume !!(~c~0 < 6); {6770#(< main_~a~0 4)} is VALID [2022-04-08 10:32:45,780 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-08 10:32:45,780 INFO L290 TraceCheckUtils]: 42: Hoare triple {6770#(< main_~a~0 4)} assume !!(~c~0 < 6); {6770#(< main_~a~0 4)} is VALID [2022-04-08 10:32:45,780 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-08 10:32:45,780 INFO L290 TraceCheckUtils]: 40: Hoare triple {6770#(< main_~a~0 4)} assume !!(~c~0 < 6); {6770#(< main_~a~0 4)} is VALID [2022-04-08 10:32:45,780 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-08 10:32:45,781 INFO L290 TraceCheckUtils]: 38: Hoare triple {6770#(< main_~a~0 4)} assume !!(~c~0 < 6); {6770#(< main_~a~0 4)} is VALID [2022-04-08 10:32:45,781 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-08 10:32:45,781 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-08 10:32:45,781 INFO L290 TraceCheckUtils]: 35: Hoare triple {6770#(< main_~a~0 4)} assume !(~c~0 < 6); {6770#(< main_~a~0 4)} is VALID [2022-04-08 10:32:45,782 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-08 10:32:45,782 INFO L290 TraceCheckUtils]: 33: Hoare triple {6770#(< main_~a~0 4)} assume !!(~c~0 < 6); {6770#(< main_~a~0 4)} is VALID [2022-04-08 10:32:45,782 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-08 10:32:45,782 INFO L290 TraceCheckUtils]: 31: Hoare triple {6770#(< main_~a~0 4)} assume !!(~c~0 < 6); {6770#(< main_~a~0 4)} is VALID [2022-04-08 10:32:45,783 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-08 10:32:45,783 INFO L290 TraceCheckUtils]: 29: Hoare triple {6770#(< main_~a~0 4)} assume !!(~c~0 < 6); {6770#(< main_~a~0 4)} is VALID [2022-04-08 10:32:45,783 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-08 10:32:45,783 INFO L290 TraceCheckUtils]: 27: Hoare triple {6770#(< main_~a~0 4)} assume !!(~c~0 < 6); {6770#(< main_~a~0 4)} is VALID [2022-04-08 10:32:45,783 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-08 10:32:45,784 INFO L290 TraceCheckUtils]: 25: Hoare triple {6770#(< main_~a~0 4)} assume !!(~c~0 < 6); {6770#(< main_~a~0 4)} is VALID [2022-04-08 10:32:45,784 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-08 10:32:45,784 INFO L290 TraceCheckUtils]: 23: Hoare triple {6770#(< main_~a~0 4)} assume !!(~c~0 < 6); {6770#(< main_~a~0 4)} is VALID [2022-04-08 10:32:45,784 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-08 10:32:45,785 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-08 10:32:45,785 INFO L290 TraceCheckUtils]: 20: Hoare triple {6770#(< main_~a~0 4)} assume !(~c~0 < 6); {6770#(< main_~a~0 4)} is VALID [2022-04-08 10:32:45,785 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-08 10:32:45,785 INFO L290 TraceCheckUtils]: 18: Hoare triple {6770#(< main_~a~0 4)} assume !!(~c~0 < 6); {6770#(< main_~a~0 4)} is VALID [2022-04-08 10:32:45,786 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-08 10:32:45,786 INFO L290 TraceCheckUtils]: 16: Hoare triple {6770#(< main_~a~0 4)} assume !!(~c~0 < 6); {6770#(< main_~a~0 4)} is VALID [2022-04-08 10:32:45,786 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-08 10:32:45,786 INFO L290 TraceCheckUtils]: 14: Hoare triple {6770#(< main_~a~0 4)} assume !!(~c~0 < 6); {6770#(< main_~a~0 4)} is VALID [2022-04-08 10:32:45,787 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-08 10:32:45,787 INFO L290 TraceCheckUtils]: 12: Hoare triple {6770#(< main_~a~0 4)} assume !!(~c~0 < 6); {6770#(< main_~a~0 4)} is VALID [2022-04-08 10:32:45,787 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-08 10:32:45,787 INFO L290 TraceCheckUtils]: 10: Hoare triple {6770#(< main_~a~0 4)} assume !!(~c~0 < 6); {6770#(< main_~a~0 4)} is VALID [2022-04-08 10:32:45,787 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-08 10:32:45,788 INFO L290 TraceCheckUtils]: 8: Hoare triple {6770#(< main_~a~0 4)} assume !!(~c~0 < 6); {6770#(< main_~a~0 4)} is VALID [2022-04-08 10:32:45,788 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-08 10:32:45,788 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-08 10:32:45,788 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-08 10:32:45,789 INFO L272 TraceCheckUtils]: 4: Hoare triple {6287#true} call #t~ret7 := main(); {6287#true} is VALID [2022-04-08 10:32:45,789 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6287#true} {6287#true} #56#return; {6287#true} is VALID [2022-04-08 10:32:45,789 INFO L290 TraceCheckUtils]: 2: Hoare triple {6287#true} assume true; {6287#true} is VALID [2022-04-08 10:32:45,789 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-08 10:32:45,789 INFO L272 TraceCheckUtils]: 0: Hoare triple {6287#true} call ULTIMATE.init(); {6287#true} is VALID [2022-04-08 10:32:45,789 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-08 10:32:45,789 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1933404796] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:32:45,790 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:32:45,790 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 13 [2022-04-08 10:32:45,790 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:32:45,790 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1928615674] [2022-04-08 10:32:45,790 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1928615674] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:32:45,790 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:32:45,790 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-08 10:32:45,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1822776874] [2022-04-08 10:32:45,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:32:45,790 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-08 10:32:45,791 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:32:45,791 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-08 10:32:45,808 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-08 10:32:45,808 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-08 10:32:45,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:32:45,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-08 10:32:45,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2022-04-08 10:32:45,808 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-08 10:32:46,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:32:46,132 INFO L93 Difference]: Finished difference Result 217 states and 235 transitions. [2022-04-08 10:32:46,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-08 10:32:46,133 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-08 10:32:46,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:32:46,133 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-08 10:32:46,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 49 transitions. [2022-04-08 10:32:46,134 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-08 10:32:46,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 49 transitions. [2022-04-08 10:32:46,134 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 49 transitions. [2022-04-08 10:32:46,181 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-08 10:32:46,182 INFO L225 Difference]: With dead ends: 217 [2022-04-08 10:32:46,182 INFO L226 Difference]: Without dead ends: 164 [2022-04-08 10:32:46,183 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-08 10:32:46,183 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-08 10:32:46,183 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-08 10:32:46,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2022-04-08 10:32:46,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 136. [2022-04-08 10:32:46,336 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:32:46,337 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-08 10:32:46,337 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-08 10:32:46,337 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-08 10:32:46,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:32:46,352 INFO L93 Difference]: Finished difference Result 164 states and 176 transitions. [2022-04-08 10:32:46,352 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 176 transitions. [2022-04-08 10:32:46,352 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:32:46,353 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:32:46,353 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-08 10:32:46,353 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-08 10:32:46,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:32:46,355 INFO L93 Difference]: Finished difference Result 164 states and 176 transitions. [2022-04-08 10:32:46,355 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 176 transitions. [2022-04-08 10:32:46,355 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:32:46,355 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:32:46,355 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:32:46,355 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:32:46,356 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-08 10:32:46,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 146 transitions. [2022-04-08 10:32:46,357 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 146 transitions. Word has length 105 [2022-04-08 10:32:46,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:32:46,357 INFO L478 AbstractCegarLoop]: Abstraction has 136 states and 146 transitions. [2022-04-08 10:32:46,358 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-08 10:32:46,358 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 136 states and 146 transitions. [2022-04-08 10:32:46,475 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-08 10:32:46,475 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 146 transitions. [2022-04-08 10:32:46,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2022-04-08 10:32:46,476 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:32:46,476 INFO L499 BasicCegarLoop]: trace histogram [48, 48, 8, 8, 8, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:32:46,492 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-08 10:32:46,691 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-04-08 10:32:46,691 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:32:46,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:32:46,692 INFO L85 PathProgramCache]: Analyzing trace with hash 1520409151, now seen corresponding path program 19 times [2022-04-08 10:32:46,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:32:46,692 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1266131094] [2022-04-08 10:32:46,880 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:32:46,949 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:32:46,950 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:32:46,950 INFO L85 PathProgramCache]: Analyzing trace with hash 1520409151, now seen corresponding path program 20 times [2022-04-08 10:32:46,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:32:46,950 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1109438384] [2022-04-08 10:32:46,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:32:46,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:32:46,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:32:47,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:32:47,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:32:47,036 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-08 10:32:47,036 INFO L290 TraceCheckUtils]: 1: Hoare triple {7974#true} assume true; {7974#true} is VALID [2022-04-08 10:32:47,036 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7974#true} {7974#true} #56#return; {7974#true} is VALID [2022-04-08 10:32:47,036 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-08 10:32:47,036 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-08 10:32:47,036 INFO L290 TraceCheckUtils]: 2: Hoare triple {7974#true} assume true; {7974#true} is VALID [2022-04-08 10:32:47,036 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7974#true} {7974#true} #56#return; {7974#true} is VALID [2022-04-08 10:32:47,036 INFO L272 TraceCheckUtils]: 4: Hoare triple {7974#true} call #t~ret7 := main(); {7974#true} is VALID [2022-04-08 10:32:47,036 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-08 10:32:47,037 INFO L290 TraceCheckUtils]: 6: Hoare triple {7974#true} assume !!(~a~0 < 6);~b~0 := 0; {7979#(= main_~b~0 0)} is VALID [2022-04-08 10:32:47,037 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-08 10:32:47,037 INFO L290 TraceCheckUtils]: 8: Hoare triple {7979#(= main_~b~0 0)} assume !!(~c~0 < 6); {7979#(= main_~b~0 0)} is VALID [2022-04-08 10:32:47,037 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-08 10:32:47,037 INFO L290 TraceCheckUtils]: 10: Hoare triple {7979#(= main_~b~0 0)} assume !!(~c~0 < 6); {7979#(= main_~b~0 0)} is VALID [2022-04-08 10:32:47,038 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-08 10:32:47,038 INFO L290 TraceCheckUtils]: 12: Hoare triple {7979#(= main_~b~0 0)} assume !!(~c~0 < 6); {7979#(= main_~b~0 0)} is VALID [2022-04-08 10:32:47,038 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-08 10:32:47,038 INFO L290 TraceCheckUtils]: 14: Hoare triple {7979#(= main_~b~0 0)} assume !!(~c~0 < 6); {7979#(= main_~b~0 0)} is VALID [2022-04-08 10:32:47,039 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-08 10:32:47,039 INFO L290 TraceCheckUtils]: 16: Hoare triple {7979#(= main_~b~0 0)} assume !!(~c~0 < 6); {7979#(= main_~b~0 0)} is VALID [2022-04-08 10:32:47,039 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-08 10:32:47,039 INFO L290 TraceCheckUtils]: 18: Hoare triple {7979#(= main_~b~0 0)} assume !!(~c~0 < 6); {7979#(= main_~b~0 0)} is VALID [2022-04-08 10:32:47,039 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-08 10:32:47,040 INFO L290 TraceCheckUtils]: 20: Hoare triple {7979#(= main_~b~0 0)} assume !(~c~0 < 6); {7979#(= main_~b~0 0)} is VALID [2022-04-08 10:32:47,040 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-08 10:32:47,040 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-08 10:32:47,040 INFO L290 TraceCheckUtils]: 23: Hoare triple {7980#(<= main_~b~0 1)} assume !!(~c~0 < 6); {7980#(<= main_~b~0 1)} is VALID [2022-04-08 10:32:47,041 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-08 10:32:47,041 INFO L290 TraceCheckUtils]: 25: Hoare triple {7980#(<= main_~b~0 1)} assume !!(~c~0 < 6); {7980#(<= main_~b~0 1)} is VALID [2022-04-08 10:32:47,041 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-08 10:32:47,041 INFO L290 TraceCheckUtils]: 27: Hoare triple {7980#(<= main_~b~0 1)} assume !!(~c~0 < 6); {7980#(<= main_~b~0 1)} is VALID [2022-04-08 10:32:47,042 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-08 10:32:47,042 INFO L290 TraceCheckUtils]: 29: Hoare triple {7980#(<= main_~b~0 1)} assume !!(~c~0 < 6); {7980#(<= main_~b~0 1)} is VALID [2022-04-08 10:32:47,042 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-08 10:32:47,042 INFO L290 TraceCheckUtils]: 31: Hoare triple {7980#(<= main_~b~0 1)} assume !!(~c~0 < 6); {7980#(<= main_~b~0 1)} is VALID [2022-04-08 10:32:47,042 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-08 10:32:47,043 INFO L290 TraceCheckUtils]: 33: Hoare triple {7980#(<= main_~b~0 1)} assume !!(~c~0 < 6); {7980#(<= main_~b~0 1)} is VALID [2022-04-08 10:32:47,043 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-08 10:32:47,043 INFO L290 TraceCheckUtils]: 35: Hoare triple {7980#(<= main_~b~0 1)} assume !(~c~0 < 6); {7980#(<= main_~b~0 1)} is VALID [2022-04-08 10:32:47,043 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-08 10:32:47,044 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-08 10:32:47,044 INFO L290 TraceCheckUtils]: 38: Hoare triple {7981#(<= main_~b~0 2)} assume !!(~c~0 < 6); {7981#(<= main_~b~0 2)} is VALID [2022-04-08 10:32:47,044 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-08 10:32:47,044 INFO L290 TraceCheckUtils]: 40: Hoare triple {7981#(<= main_~b~0 2)} assume !!(~c~0 < 6); {7981#(<= main_~b~0 2)} is VALID [2022-04-08 10:32:47,045 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-08 10:32:47,045 INFO L290 TraceCheckUtils]: 42: Hoare triple {7981#(<= main_~b~0 2)} assume !!(~c~0 < 6); {7981#(<= main_~b~0 2)} is VALID [2022-04-08 10:32:47,045 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-08 10:32:47,045 INFO L290 TraceCheckUtils]: 44: Hoare triple {7981#(<= main_~b~0 2)} assume !!(~c~0 < 6); {7981#(<= main_~b~0 2)} is VALID [2022-04-08 10:32:47,045 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-08 10:32:47,046 INFO L290 TraceCheckUtils]: 46: Hoare triple {7981#(<= main_~b~0 2)} assume !!(~c~0 < 6); {7981#(<= main_~b~0 2)} is VALID [2022-04-08 10:32:47,046 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-08 10:32:47,046 INFO L290 TraceCheckUtils]: 48: Hoare triple {7981#(<= main_~b~0 2)} assume !!(~c~0 < 6); {7981#(<= main_~b~0 2)} is VALID [2022-04-08 10:32:47,046 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-08 10:32:47,047 INFO L290 TraceCheckUtils]: 50: Hoare triple {7981#(<= main_~b~0 2)} assume !(~c~0 < 6); {7981#(<= main_~b~0 2)} is VALID [2022-04-08 10:32:47,047 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-08 10:32:47,047 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-08 10:32:47,047 INFO L290 TraceCheckUtils]: 53: Hoare triple {7982#(<= main_~b~0 3)} assume !!(~c~0 < 6); {7982#(<= main_~b~0 3)} is VALID [2022-04-08 10:32:47,048 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-08 10:32:47,048 INFO L290 TraceCheckUtils]: 55: Hoare triple {7982#(<= main_~b~0 3)} assume !!(~c~0 < 6); {7982#(<= main_~b~0 3)} is VALID [2022-04-08 10:32:47,048 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-08 10:32:47,048 INFO L290 TraceCheckUtils]: 57: Hoare triple {7982#(<= main_~b~0 3)} assume !!(~c~0 < 6); {7982#(<= main_~b~0 3)} is VALID [2022-04-08 10:32:47,048 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-08 10:32:47,049 INFO L290 TraceCheckUtils]: 59: Hoare triple {7982#(<= main_~b~0 3)} assume !!(~c~0 < 6); {7982#(<= main_~b~0 3)} is VALID [2022-04-08 10:32:47,049 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-08 10:32:47,049 INFO L290 TraceCheckUtils]: 61: Hoare triple {7982#(<= main_~b~0 3)} assume !!(~c~0 < 6); {7982#(<= main_~b~0 3)} is VALID [2022-04-08 10:32:47,049 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-08 10:32:47,050 INFO L290 TraceCheckUtils]: 63: Hoare triple {7982#(<= main_~b~0 3)} assume !!(~c~0 < 6); {7982#(<= main_~b~0 3)} is VALID [2022-04-08 10:32:47,050 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-08 10:32:47,050 INFO L290 TraceCheckUtils]: 65: Hoare triple {7982#(<= main_~b~0 3)} assume !(~c~0 < 6); {7982#(<= main_~b~0 3)} is VALID [2022-04-08 10:32:47,050 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-08 10:32:47,051 INFO L290 TraceCheckUtils]: 67: Hoare triple {7983#(<= main_~b~0 4)} assume !(~b~0 < 6); {7975#false} is VALID [2022-04-08 10:32:47,051 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-08 10:32:47,051 INFO L290 TraceCheckUtils]: 69: Hoare triple {7975#false} assume !!(~a~0 < 6);~b~0 := 0; {7975#false} is VALID [2022-04-08 10:32:47,051 INFO L290 TraceCheckUtils]: 70: Hoare triple {7975#false} assume !!(~b~0 < 6);~c~0 := 0; {7975#false} is VALID [2022-04-08 10:32:47,051 INFO L290 TraceCheckUtils]: 71: Hoare triple {7975#false} assume !!(~c~0 < 6); {7975#false} is VALID [2022-04-08 10:32:47,051 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-08 10:32:47,051 INFO L290 TraceCheckUtils]: 73: Hoare triple {7975#false} assume !!(~c~0 < 6); {7975#false} is VALID [2022-04-08 10:32:47,051 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-08 10:32:47,051 INFO L290 TraceCheckUtils]: 75: Hoare triple {7975#false} assume !!(~c~0 < 6); {7975#false} is VALID [2022-04-08 10:32:47,051 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-08 10:32:47,051 INFO L290 TraceCheckUtils]: 77: Hoare triple {7975#false} assume !!(~c~0 < 6); {7975#false} is VALID [2022-04-08 10:32:47,051 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-08 10:32:47,051 INFO L290 TraceCheckUtils]: 79: Hoare triple {7975#false} assume !!(~c~0 < 6); {7975#false} is VALID [2022-04-08 10:32:47,051 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-08 10:32:47,051 INFO L290 TraceCheckUtils]: 81: Hoare triple {7975#false} assume !!(~c~0 < 6); {7975#false} is VALID [2022-04-08 10:32:47,052 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-08 10:32:47,052 INFO L290 TraceCheckUtils]: 83: Hoare triple {7975#false} assume !(~c~0 < 6); {7975#false} is VALID [2022-04-08 10:32:47,052 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-08 10:32:47,052 INFO L290 TraceCheckUtils]: 85: Hoare triple {7975#false} assume !!(~b~0 < 6);~c~0 := 0; {7975#false} is VALID [2022-04-08 10:32:47,052 INFO L290 TraceCheckUtils]: 86: Hoare triple {7975#false} assume !!(~c~0 < 6); {7975#false} is VALID [2022-04-08 10:32:47,052 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-08 10:32:47,052 INFO L290 TraceCheckUtils]: 88: Hoare triple {7975#false} assume !!(~c~0 < 6); {7975#false} is VALID [2022-04-08 10:32:47,052 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-08 10:32:47,052 INFO L290 TraceCheckUtils]: 90: Hoare triple {7975#false} assume !!(~c~0 < 6); {7975#false} is VALID [2022-04-08 10:32:47,052 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-08 10:32:47,052 INFO L290 TraceCheckUtils]: 92: Hoare triple {7975#false} assume !!(~c~0 < 6); {7975#false} is VALID [2022-04-08 10:32:47,052 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-08 10:32:47,052 INFO L290 TraceCheckUtils]: 94: Hoare triple {7975#false} assume !!(~c~0 < 6); {7975#false} is VALID [2022-04-08 10:32:47,052 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-08 10:32:47,052 INFO L290 TraceCheckUtils]: 96: Hoare triple {7975#false} assume !!(~c~0 < 6); {7975#false} is VALID [2022-04-08 10:32:47,052 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-08 10:32:47,052 INFO L290 TraceCheckUtils]: 98: Hoare triple {7975#false} assume !(~c~0 < 6); {7975#false} is VALID [2022-04-08 10:32:47,052 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-08 10:32:47,052 INFO L290 TraceCheckUtils]: 100: Hoare triple {7975#false} assume !!(~b~0 < 6);~c~0 := 0; {7975#false} is VALID [2022-04-08 10:32:47,053 INFO L290 TraceCheckUtils]: 101: Hoare triple {7975#false} assume !!(~c~0 < 6); {7975#false} is VALID [2022-04-08 10:32:47,053 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-08 10:32:47,053 INFO L290 TraceCheckUtils]: 103: Hoare triple {7975#false} assume !!(~c~0 < 6); {7975#false} is VALID [2022-04-08 10:32:47,053 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-08 10:32:47,053 INFO L290 TraceCheckUtils]: 105: Hoare triple {7975#false} assume !!(~c~0 < 6); {7975#false} is VALID [2022-04-08 10:32:47,053 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-08 10:32:47,053 INFO L290 TraceCheckUtils]: 107: Hoare triple {7975#false} assume !!(~c~0 < 6); {7975#false} is VALID [2022-04-08 10:32:47,053 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-08 10:32:47,053 INFO L290 TraceCheckUtils]: 109: Hoare triple {7975#false} assume !!(~c~0 < 6); {7975#false} is VALID [2022-04-08 10:32:47,053 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-08 10:32:47,053 INFO L290 TraceCheckUtils]: 111: Hoare triple {7975#false} assume !!(~c~0 < 6); {7975#false} is VALID [2022-04-08 10:32:47,053 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-08 10:32:47,053 INFO L290 TraceCheckUtils]: 113: Hoare triple {7975#false} assume !(~c~0 < 6); {7975#false} is VALID [2022-04-08 10:32:47,053 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-08 10:32:47,053 INFO L290 TraceCheckUtils]: 115: Hoare triple {7975#false} assume !!(~b~0 < 6);~c~0 := 0; {7975#false} is VALID [2022-04-08 10:32:47,053 INFO L290 TraceCheckUtils]: 116: Hoare triple {7975#false} assume !!(~c~0 < 6); {7975#false} is VALID [2022-04-08 10:32:47,053 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-08 10:32:47,053 INFO L290 TraceCheckUtils]: 118: Hoare triple {7975#false} assume !!(~c~0 < 6); {7975#false} is VALID [2022-04-08 10:32:47,053 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-08 10:32:47,054 INFO L290 TraceCheckUtils]: 120: Hoare triple {7975#false} assume !!(~c~0 < 6); {7975#false} is VALID [2022-04-08 10:32:47,054 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-08 10:32:47,054 INFO L290 TraceCheckUtils]: 122: Hoare triple {7975#false} assume !!(~c~0 < 6); {7975#false} is VALID [2022-04-08 10:32:47,054 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-08 10:32:47,054 INFO L290 TraceCheckUtils]: 124: Hoare triple {7975#false} assume !!(~c~0 < 6); {7975#false} is VALID [2022-04-08 10:32:47,054 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-08 10:32:47,054 INFO L290 TraceCheckUtils]: 126: Hoare triple {7975#false} assume !!(~c~0 < 6); {7975#false} is VALID [2022-04-08 10:32:47,054 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-08 10:32:47,054 INFO L290 TraceCheckUtils]: 128: Hoare triple {7975#false} assume !(~c~0 < 6); {7975#false} is VALID [2022-04-08 10:32:47,054 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-08 10:32:47,054 INFO L290 TraceCheckUtils]: 130: Hoare triple {7975#false} assume !(~b~0 < 6); {7975#false} is VALID [2022-04-08 10:32:47,054 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-08 10:32:47,054 INFO L290 TraceCheckUtils]: 132: Hoare triple {7975#false} assume !(~a~0 < 6); {7975#false} is VALID [2022-04-08 10:32:47,054 INFO L290 TraceCheckUtils]: 133: Hoare triple {7975#false} assume !((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0); {7975#false} is VALID [2022-04-08 10:32:47,054 INFO L290 TraceCheckUtils]: 134: Hoare triple {7975#false} assume !false; {7975#false} is VALID [2022-04-08 10:32:47,055 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-08 10:32:47,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:32:47,055 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1109438384] [2022-04-08 10:32:47,055 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1109438384] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:32:47,055 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1230327368] [2022-04-08 10:32:47,056 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 10:32:47,056 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:32:47,056 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:32:47,056 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-08 10:32:47,057 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-08 10:32:47,116 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 10:32:47,116 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:32:47,117 INFO L263 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 6 conjunts are in the unsatisfiable core [2022-04-08 10:32:47,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:32:47,133 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:32:47,394 INFO L272 TraceCheckUtils]: 0: Hoare triple {7974#true} call ULTIMATE.init(); {7974#true} is VALID [2022-04-08 10:32:47,394 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-08 10:32:47,394 INFO L290 TraceCheckUtils]: 2: Hoare triple {7974#true} assume true; {7974#true} is VALID [2022-04-08 10:32:47,394 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7974#true} {7974#true} #56#return; {7974#true} is VALID [2022-04-08 10:32:47,394 INFO L272 TraceCheckUtils]: 4: Hoare triple {7974#true} call #t~ret7 := main(); {7974#true} is VALID [2022-04-08 10:32:47,394 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-08 10:32:47,395 INFO L290 TraceCheckUtils]: 6: Hoare triple {7974#true} assume !!(~a~0 < 6);~b~0 := 0; {8006#(<= main_~b~0 0)} is VALID [2022-04-08 10:32:47,395 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-08 10:32:47,395 INFO L290 TraceCheckUtils]: 8: Hoare triple {8006#(<= main_~b~0 0)} assume !!(~c~0 < 6); {8006#(<= main_~b~0 0)} is VALID [2022-04-08 10:32:47,395 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-08 10:32:47,396 INFO L290 TraceCheckUtils]: 10: Hoare triple {8006#(<= main_~b~0 0)} assume !!(~c~0 < 6); {8006#(<= main_~b~0 0)} is VALID [2022-04-08 10:32:47,396 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-08 10:32:47,396 INFO L290 TraceCheckUtils]: 12: Hoare triple {8006#(<= main_~b~0 0)} assume !!(~c~0 < 6); {8006#(<= main_~b~0 0)} is VALID [2022-04-08 10:32:47,396 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-08 10:32:47,397 INFO L290 TraceCheckUtils]: 14: Hoare triple {8006#(<= main_~b~0 0)} assume !!(~c~0 < 6); {8006#(<= main_~b~0 0)} is VALID [2022-04-08 10:32:47,397 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-08 10:32:47,397 INFO L290 TraceCheckUtils]: 16: Hoare triple {8006#(<= main_~b~0 0)} assume !!(~c~0 < 6); {8006#(<= main_~b~0 0)} is VALID [2022-04-08 10:32:47,397 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-08 10:32:47,398 INFO L290 TraceCheckUtils]: 18: Hoare triple {8006#(<= main_~b~0 0)} assume !!(~c~0 < 6); {8006#(<= main_~b~0 0)} is VALID [2022-04-08 10:32:47,398 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-08 10:32:47,398 INFO L290 TraceCheckUtils]: 20: Hoare triple {8006#(<= main_~b~0 0)} assume !(~c~0 < 6); {8006#(<= main_~b~0 0)} is VALID [2022-04-08 10:32:47,399 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-08 10:32:47,399 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-08 10:32:47,399 INFO L290 TraceCheckUtils]: 23: Hoare triple {7980#(<= main_~b~0 1)} assume !!(~c~0 < 6); {7980#(<= main_~b~0 1)} is VALID [2022-04-08 10:32:47,399 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-08 10:32:47,399 INFO L290 TraceCheckUtils]: 25: Hoare triple {7980#(<= main_~b~0 1)} assume !!(~c~0 < 6); {7980#(<= main_~b~0 1)} is VALID [2022-04-08 10:32:47,400 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-08 10:32:47,400 INFO L290 TraceCheckUtils]: 27: Hoare triple {7980#(<= main_~b~0 1)} assume !!(~c~0 < 6); {7980#(<= main_~b~0 1)} is VALID [2022-04-08 10:32:47,400 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-08 10:32:47,400 INFO L290 TraceCheckUtils]: 29: Hoare triple {7980#(<= main_~b~0 1)} assume !!(~c~0 < 6); {7980#(<= main_~b~0 1)} is VALID [2022-04-08 10:32:47,401 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-08 10:32:47,401 INFO L290 TraceCheckUtils]: 31: Hoare triple {7980#(<= main_~b~0 1)} assume !!(~c~0 < 6); {7980#(<= main_~b~0 1)} is VALID [2022-04-08 10:32:47,401 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-08 10:32:47,401 INFO L290 TraceCheckUtils]: 33: Hoare triple {7980#(<= main_~b~0 1)} assume !!(~c~0 < 6); {7980#(<= main_~b~0 1)} is VALID [2022-04-08 10:32:47,402 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-08 10:32:47,402 INFO L290 TraceCheckUtils]: 35: Hoare triple {7980#(<= main_~b~0 1)} assume !(~c~0 < 6); {7980#(<= main_~b~0 1)} is VALID [2022-04-08 10:32:47,402 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-08 10:32:47,402 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-08 10:32:47,403 INFO L290 TraceCheckUtils]: 38: Hoare triple {7981#(<= main_~b~0 2)} assume !!(~c~0 < 6); {7981#(<= main_~b~0 2)} is VALID [2022-04-08 10:32:47,403 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-08 10:32:47,403 INFO L290 TraceCheckUtils]: 40: Hoare triple {7981#(<= main_~b~0 2)} assume !!(~c~0 < 6); {7981#(<= main_~b~0 2)} is VALID [2022-04-08 10:32:47,403 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-08 10:32:47,404 INFO L290 TraceCheckUtils]: 42: Hoare triple {7981#(<= main_~b~0 2)} assume !!(~c~0 < 6); {7981#(<= main_~b~0 2)} is VALID [2022-04-08 10:32:47,404 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-08 10:32:47,404 INFO L290 TraceCheckUtils]: 44: Hoare triple {7981#(<= main_~b~0 2)} assume !!(~c~0 < 6); {7981#(<= main_~b~0 2)} is VALID [2022-04-08 10:32:47,404 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-08 10:32:47,404 INFO L290 TraceCheckUtils]: 46: Hoare triple {7981#(<= main_~b~0 2)} assume !!(~c~0 < 6); {7981#(<= main_~b~0 2)} is VALID [2022-04-08 10:32:47,405 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-08 10:32:47,405 INFO L290 TraceCheckUtils]: 48: Hoare triple {7981#(<= main_~b~0 2)} assume !!(~c~0 < 6); {7981#(<= main_~b~0 2)} is VALID [2022-04-08 10:32:47,405 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-08 10:32:47,405 INFO L290 TraceCheckUtils]: 50: Hoare triple {7981#(<= main_~b~0 2)} assume !(~c~0 < 6); {7981#(<= main_~b~0 2)} is VALID [2022-04-08 10:32:47,406 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-08 10:32:47,406 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-08 10:32:47,406 INFO L290 TraceCheckUtils]: 53: Hoare triple {7982#(<= main_~b~0 3)} assume !!(~c~0 < 6); {7982#(<= main_~b~0 3)} is VALID [2022-04-08 10:32:47,406 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-08 10:32:47,407 INFO L290 TraceCheckUtils]: 55: Hoare triple {7982#(<= main_~b~0 3)} assume !!(~c~0 < 6); {7982#(<= main_~b~0 3)} is VALID [2022-04-08 10:32:47,407 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-08 10:32:47,407 INFO L290 TraceCheckUtils]: 57: Hoare triple {7982#(<= main_~b~0 3)} assume !!(~c~0 < 6); {7982#(<= main_~b~0 3)} is VALID [2022-04-08 10:32:47,407 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-08 10:32:47,408 INFO L290 TraceCheckUtils]: 59: Hoare triple {7982#(<= main_~b~0 3)} assume !!(~c~0 < 6); {7982#(<= main_~b~0 3)} is VALID [2022-04-08 10:32:47,408 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-08 10:32:47,408 INFO L290 TraceCheckUtils]: 61: Hoare triple {7982#(<= main_~b~0 3)} assume !!(~c~0 < 6); {7982#(<= main_~b~0 3)} is VALID [2022-04-08 10:32:47,408 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-08 10:32:47,409 INFO L290 TraceCheckUtils]: 63: Hoare triple {7982#(<= main_~b~0 3)} assume !!(~c~0 < 6); {7982#(<= main_~b~0 3)} is VALID [2022-04-08 10:32:47,409 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-08 10:32:47,427 INFO L290 TraceCheckUtils]: 65: Hoare triple {7982#(<= main_~b~0 3)} assume !(~c~0 < 6); {7982#(<= main_~b~0 3)} is VALID [2022-04-08 10:32:47,428 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-08 10:32:47,428 INFO L290 TraceCheckUtils]: 67: Hoare triple {7983#(<= main_~b~0 4)} assume !(~b~0 < 6); {7975#false} is VALID [2022-04-08 10:32:47,428 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-08 10:32:47,428 INFO L290 TraceCheckUtils]: 69: Hoare triple {7975#false} assume !!(~a~0 < 6);~b~0 := 0; {7975#false} is VALID [2022-04-08 10:32:47,428 INFO L290 TraceCheckUtils]: 70: Hoare triple {7975#false} assume !!(~b~0 < 6);~c~0 := 0; {7975#false} is VALID [2022-04-08 10:32:47,429 INFO L290 TraceCheckUtils]: 71: Hoare triple {7975#false} assume !!(~c~0 < 6); {7975#false} is VALID [2022-04-08 10:32:47,429 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-08 10:32:47,429 INFO L290 TraceCheckUtils]: 73: Hoare triple {7975#false} assume !!(~c~0 < 6); {7975#false} is VALID [2022-04-08 10:32:47,429 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-08 10:32:47,429 INFO L290 TraceCheckUtils]: 75: Hoare triple {7975#false} assume !!(~c~0 < 6); {7975#false} is VALID [2022-04-08 10:32:47,429 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-08 10:32:47,429 INFO L290 TraceCheckUtils]: 77: Hoare triple {7975#false} assume !!(~c~0 < 6); {7975#false} is VALID [2022-04-08 10:32:47,429 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-08 10:32:47,429 INFO L290 TraceCheckUtils]: 79: Hoare triple {7975#false} assume !!(~c~0 < 6); {7975#false} is VALID [2022-04-08 10:32:47,429 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-08 10:32:47,429 INFO L290 TraceCheckUtils]: 81: Hoare triple {7975#false} assume !!(~c~0 < 6); {7975#false} is VALID [2022-04-08 10:32:47,429 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-08 10:32:47,429 INFO L290 TraceCheckUtils]: 83: Hoare triple {7975#false} assume !(~c~0 < 6); {7975#false} is VALID [2022-04-08 10:32:47,429 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-08 10:32:47,429 INFO L290 TraceCheckUtils]: 85: Hoare triple {7975#false} assume !!(~b~0 < 6);~c~0 := 0; {7975#false} is VALID [2022-04-08 10:32:47,429 INFO L290 TraceCheckUtils]: 86: Hoare triple {7975#false} assume !!(~c~0 < 6); {7975#false} is VALID [2022-04-08 10:32:47,429 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-08 10:32:47,429 INFO L290 TraceCheckUtils]: 88: Hoare triple {7975#false} assume !!(~c~0 < 6); {7975#false} is VALID [2022-04-08 10:32:47,430 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-08 10:32:47,430 INFO L290 TraceCheckUtils]: 90: Hoare triple {7975#false} assume !!(~c~0 < 6); {7975#false} is VALID [2022-04-08 10:32:47,430 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-08 10:32:47,430 INFO L290 TraceCheckUtils]: 92: Hoare triple {7975#false} assume !!(~c~0 < 6); {7975#false} is VALID [2022-04-08 10:32:47,430 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-08 10:32:47,430 INFO L290 TraceCheckUtils]: 94: Hoare triple {7975#false} assume !!(~c~0 < 6); {7975#false} is VALID [2022-04-08 10:32:47,430 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-08 10:32:47,430 INFO L290 TraceCheckUtils]: 96: Hoare triple {7975#false} assume !!(~c~0 < 6); {7975#false} is VALID [2022-04-08 10:32:47,430 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-08 10:32:47,430 INFO L290 TraceCheckUtils]: 98: Hoare triple {7975#false} assume !(~c~0 < 6); {7975#false} is VALID [2022-04-08 10:32:47,430 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-08 10:32:47,430 INFO L290 TraceCheckUtils]: 100: Hoare triple {7975#false} assume !!(~b~0 < 6);~c~0 := 0; {7975#false} is VALID [2022-04-08 10:32:47,430 INFO L290 TraceCheckUtils]: 101: Hoare triple {7975#false} assume !!(~c~0 < 6); {7975#false} is VALID [2022-04-08 10:32:47,430 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-08 10:32:47,430 INFO L290 TraceCheckUtils]: 103: Hoare triple {7975#false} assume !!(~c~0 < 6); {7975#false} is VALID [2022-04-08 10:32:47,430 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-08 10:32:47,430 INFO L290 TraceCheckUtils]: 105: Hoare triple {7975#false} assume !!(~c~0 < 6); {7975#false} is VALID [2022-04-08 10:32:47,430 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-08 10:32:47,430 INFO L290 TraceCheckUtils]: 107: Hoare triple {7975#false} assume !!(~c~0 < 6); {7975#false} is VALID [2022-04-08 10:32:47,431 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-08 10:32:47,431 INFO L290 TraceCheckUtils]: 109: Hoare triple {7975#false} assume !!(~c~0 < 6); {7975#false} is VALID [2022-04-08 10:32:47,431 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-08 10:32:47,431 INFO L290 TraceCheckUtils]: 111: Hoare triple {7975#false} assume !!(~c~0 < 6); {7975#false} is VALID [2022-04-08 10:32:47,431 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-08 10:32:47,431 INFO L290 TraceCheckUtils]: 113: Hoare triple {7975#false} assume !(~c~0 < 6); {7975#false} is VALID [2022-04-08 10:32:47,431 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-08 10:32:47,431 INFO L290 TraceCheckUtils]: 115: Hoare triple {7975#false} assume !!(~b~0 < 6);~c~0 := 0; {7975#false} is VALID [2022-04-08 10:32:47,431 INFO L290 TraceCheckUtils]: 116: Hoare triple {7975#false} assume !!(~c~0 < 6); {7975#false} is VALID [2022-04-08 10:32:47,431 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-08 10:32:47,431 INFO L290 TraceCheckUtils]: 118: Hoare triple {7975#false} assume !!(~c~0 < 6); {7975#false} is VALID [2022-04-08 10:32:47,431 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-08 10:32:47,431 INFO L290 TraceCheckUtils]: 120: Hoare triple {7975#false} assume !!(~c~0 < 6); {7975#false} is VALID [2022-04-08 10:32:47,431 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-08 10:32:47,431 INFO L290 TraceCheckUtils]: 122: Hoare triple {7975#false} assume !!(~c~0 < 6); {7975#false} is VALID [2022-04-08 10:32:47,431 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-08 10:32:47,431 INFO L290 TraceCheckUtils]: 124: Hoare triple {7975#false} assume !!(~c~0 < 6); {7975#false} is VALID [2022-04-08 10:32:47,431 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-08 10:32:47,432 INFO L290 TraceCheckUtils]: 126: Hoare triple {7975#false} assume !!(~c~0 < 6); {7975#false} is VALID [2022-04-08 10:32:47,432 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-08 10:32:47,432 INFO L290 TraceCheckUtils]: 128: Hoare triple {7975#false} assume !(~c~0 < 6); {7975#false} is VALID [2022-04-08 10:32:47,432 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-08 10:32:47,432 INFO L290 TraceCheckUtils]: 130: Hoare triple {7975#false} assume !(~b~0 < 6); {7975#false} is VALID [2022-04-08 10:32:47,432 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-08 10:32:47,432 INFO L290 TraceCheckUtils]: 132: Hoare triple {7975#false} assume !(~a~0 < 6); {7975#false} is VALID [2022-04-08 10:32:47,432 INFO L290 TraceCheckUtils]: 133: Hoare triple {7975#false} assume !((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0); {7975#false} is VALID [2022-04-08 10:32:47,432 INFO L290 TraceCheckUtils]: 134: Hoare triple {7975#false} assume !false; {7975#false} is VALID [2022-04-08 10:32:47,433 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-08 10:32:47,433 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:32:47,756 INFO L290 TraceCheckUtils]: 134: Hoare triple {7975#false} assume !false; {7975#false} is VALID [2022-04-08 10:32:47,756 INFO L290 TraceCheckUtils]: 133: Hoare triple {7975#false} assume !((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0); {7975#false} is VALID [2022-04-08 10:32:47,756 INFO L290 TraceCheckUtils]: 132: Hoare triple {7975#false} assume !(~a~0 < 6); {7975#false} is VALID [2022-04-08 10:32:47,756 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-08 10:32:47,756 INFO L290 TraceCheckUtils]: 130: Hoare triple {7975#false} assume !(~b~0 < 6); {7975#false} is VALID [2022-04-08 10:32:47,756 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-08 10:32:47,756 INFO L290 TraceCheckUtils]: 128: Hoare triple {7975#false} assume !(~c~0 < 6); {7975#false} is VALID [2022-04-08 10:32:47,756 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-08 10:32:47,756 INFO L290 TraceCheckUtils]: 126: Hoare triple {7975#false} assume !!(~c~0 < 6); {7975#false} is VALID [2022-04-08 10:32:47,756 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-08 10:32:47,757 INFO L290 TraceCheckUtils]: 124: Hoare triple {7975#false} assume !!(~c~0 < 6); {7975#false} is VALID [2022-04-08 10:32:47,757 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-08 10:32:47,757 INFO L290 TraceCheckUtils]: 122: Hoare triple {7975#false} assume !!(~c~0 < 6); {7975#false} is VALID [2022-04-08 10:32:47,757 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-08 10:32:47,757 INFO L290 TraceCheckUtils]: 120: Hoare triple {7975#false} assume !!(~c~0 < 6); {7975#false} is VALID [2022-04-08 10:32:47,757 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-08 10:32:47,757 INFO L290 TraceCheckUtils]: 118: Hoare triple {7975#false} assume !!(~c~0 < 6); {7975#false} is VALID [2022-04-08 10:32:47,757 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-08 10:32:47,757 INFO L290 TraceCheckUtils]: 116: Hoare triple {7975#false} assume !!(~c~0 < 6); {7975#false} is VALID [2022-04-08 10:32:47,757 INFO L290 TraceCheckUtils]: 115: Hoare triple {7975#false} assume !!(~b~0 < 6);~c~0 := 0; {7975#false} is VALID [2022-04-08 10:32:47,757 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-08 10:32:47,757 INFO L290 TraceCheckUtils]: 113: Hoare triple {7975#false} assume !(~c~0 < 6); {7975#false} is VALID [2022-04-08 10:32:47,757 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-08 10:32:47,757 INFO L290 TraceCheckUtils]: 111: Hoare triple {7975#false} assume !!(~c~0 < 6); {7975#false} is VALID [2022-04-08 10:32:47,757 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-08 10:32:47,757 INFO L290 TraceCheckUtils]: 109: Hoare triple {7975#false} assume !!(~c~0 < 6); {7975#false} is VALID [2022-04-08 10:32:47,757 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-08 10:32:47,757 INFO L290 TraceCheckUtils]: 107: Hoare triple {7975#false} assume !!(~c~0 < 6); {7975#false} is VALID [2022-04-08 10:32:47,758 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-08 10:32:47,758 INFO L290 TraceCheckUtils]: 105: Hoare triple {7975#false} assume !!(~c~0 < 6); {7975#false} is VALID [2022-04-08 10:32:47,758 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-08 10:32:47,758 INFO L290 TraceCheckUtils]: 103: Hoare triple {7975#false} assume !!(~c~0 < 6); {7975#false} is VALID [2022-04-08 10:32:47,758 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-08 10:32:47,758 INFO L290 TraceCheckUtils]: 101: Hoare triple {7975#false} assume !!(~c~0 < 6); {7975#false} is VALID [2022-04-08 10:32:47,758 INFO L290 TraceCheckUtils]: 100: Hoare triple {7975#false} assume !!(~b~0 < 6);~c~0 := 0; {7975#false} is VALID [2022-04-08 10:32:47,758 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-08 10:32:47,758 INFO L290 TraceCheckUtils]: 98: Hoare triple {7975#false} assume !(~c~0 < 6); {7975#false} is VALID [2022-04-08 10:32:47,758 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-08 10:32:47,758 INFO L290 TraceCheckUtils]: 96: Hoare triple {7975#false} assume !!(~c~0 < 6); {7975#false} is VALID [2022-04-08 10:32:47,758 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-08 10:32:47,758 INFO L290 TraceCheckUtils]: 94: Hoare triple {7975#false} assume !!(~c~0 < 6); {7975#false} is VALID [2022-04-08 10:32:47,758 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-08 10:32:47,758 INFO L290 TraceCheckUtils]: 92: Hoare triple {7975#false} assume !!(~c~0 < 6); {7975#false} is VALID [2022-04-08 10:32:47,758 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-08 10:32:47,758 INFO L290 TraceCheckUtils]: 90: Hoare triple {7975#false} assume !!(~c~0 < 6); {7975#false} is VALID [2022-04-08 10:32:47,758 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-08 10:32:47,759 INFO L290 TraceCheckUtils]: 88: Hoare triple {7975#false} assume !!(~c~0 < 6); {7975#false} is VALID [2022-04-08 10:32:47,759 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-08 10:32:47,759 INFO L290 TraceCheckUtils]: 86: Hoare triple {7975#false} assume !!(~c~0 < 6); {7975#false} is VALID [2022-04-08 10:32:47,759 INFO L290 TraceCheckUtils]: 85: Hoare triple {7975#false} assume !!(~b~0 < 6);~c~0 := 0; {7975#false} is VALID [2022-04-08 10:32:47,759 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-08 10:32:47,759 INFO L290 TraceCheckUtils]: 83: Hoare triple {7975#false} assume !(~c~0 < 6); {7975#false} is VALID [2022-04-08 10:32:47,759 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-08 10:32:47,759 INFO L290 TraceCheckUtils]: 81: Hoare triple {7975#false} assume !!(~c~0 < 6); {7975#false} is VALID [2022-04-08 10:32:47,759 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-08 10:32:47,759 INFO L290 TraceCheckUtils]: 79: Hoare triple {7975#false} assume !!(~c~0 < 6); {7975#false} is VALID [2022-04-08 10:32:47,759 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-08 10:32:47,759 INFO L290 TraceCheckUtils]: 77: Hoare triple {7975#false} assume !!(~c~0 < 6); {7975#false} is VALID [2022-04-08 10:32:47,759 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-08 10:32:47,759 INFO L290 TraceCheckUtils]: 75: Hoare triple {7975#false} assume !!(~c~0 < 6); {7975#false} is VALID [2022-04-08 10:32:47,759 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-08 10:32:47,759 INFO L290 TraceCheckUtils]: 73: Hoare triple {7975#false} assume !!(~c~0 < 6); {7975#false} is VALID [2022-04-08 10:32:47,759 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-08 10:32:47,759 INFO L290 TraceCheckUtils]: 71: Hoare triple {7975#false} assume !!(~c~0 < 6); {7975#false} is VALID [2022-04-08 10:32:47,760 INFO L290 TraceCheckUtils]: 70: Hoare triple {7975#false} assume !!(~b~0 < 6);~c~0 := 0; {7975#false} is VALID [2022-04-08 10:32:47,760 INFO L290 TraceCheckUtils]: 69: Hoare triple {7975#false} assume !!(~a~0 < 6);~b~0 := 0; {7975#false} is VALID [2022-04-08 10:32:47,760 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-08 10:32:47,771 INFO L290 TraceCheckUtils]: 67: Hoare triple {8592#(< main_~b~0 6)} assume !(~b~0 < 6); {7975#false} is VALID [2022-04-08 10:32:47,772 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-08 10:32:47,772 INFO L290 TraceCheckUtils]: 65: Hoare triple {7983#(<= main_~b~0 4)} assume !(~c~0 < 6); {7983#(<= main_~b~0 4)} is VALID [2022-04-08 10:32:47,772 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-08 10:32:47,772 INFO L290 TraceCheckUtils]: 63: Hoare triple {7983#(<= main_~b~0 4)} assume !!(~c~0 < 6); {7983#(<= main_~b~0 4)} is VALID [2022-04-08 10:32:47,773 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-08 10:32:47,773 INFO L290 TraceCheckUtils]: 61: Hoare triple {7983#(<= main_~b~0 4)} assume !!(~c~0 < 6); {7983#(<= main_~b~0 4)} is VALID [2022-04-08 10:32:47,773 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-08 10:32:47,773 INFO L290 TraceCheckUtils]: 59: Hoare triple {7983#(<= main_~b~0 4)} assume !!(~c~0 < 6); {7983#(<= main_~b~0 4)} is VALID [2022-04-08 10:32:47,774 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-08 10:32:47,774 INFO L290 TraceCheckUtils]: 57: Hoare triple {7983#(<= main_~b~0 4)} assume !!(~c~0 < 6); {7983#(<= main_~b~0 4)} is VALID [2022-04-08 10:32:47,774 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-08 10:32:47,774 INFO L290 TraceCheckUtils]: 55: Hoare triple {7983#(<= main_~b~0 4)} assume !!(~c~0 < 6); {7983#(<= main_~b~0 4)} is VALID [2022-04-08 10:32:47,775 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-08 10:32:47,775 INFO L290 TraceCheckUtils]: 53: Hoare triple {7983#(<= main_~b~0 4)} assume !!(~c~0 < 6); {7983#(<= main_~b~0 4)} is VALID [2022-04-08 10:32:47,775 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-08 10:32:47,775 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-08 10:32:47,776 INFO L290 TraceCheckUtils]: 50: Hoare triple {7982#(<= main_~b~0 3)} assume !(~c~0 < 6); {7982#(<= main_~b~0 3)} is VALID [2022-04-08 10:32:47,776 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-08 10:32:47,776 INFO L290 TraceCheckUtils]: 48: Hoare triple {7982#(<= main_~b~0 3)} assume !!(~c~0 < 6); {7982#(<= main_~b~0 3)} is VALID [2022-04-08 10:32:47,779 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-08 10:32:47,781 INFO L290 TraceCheckUtils]: 46: Hoare triple {7982#(<= main_~b~0 3)} assume !!(~c~0 < 6); {7982#(<= main_~b~0 3)} is VALID [2022-04-08 10:32:47,781 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-08 10:32:47,782 INFO L290 TraceCheckUtils]: 44: Hoare triple {7982#(<= main_~b~0 3)} assume !!(~c~0 < 6); {7982#(<= main_~b~0 3)} is VALID [2022-04-08 10:32:47,782 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-08 10:32:47,782 INFO L290 TraceCheckUtils]: 42: Hoare triple {7982#(<= main_~b~0 3)} assume !!(~c~0 < 6); {7982#(<= main_~b~0 3)} is VALID [2022-04-08 10:32:47,782 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-08 10:32:47,783 INFO L290 TraceCheckUtils]: 40: Hoare triple {7982#(<= main_~b~0 3)} assume !!(~c~0 < 6); {7982#(<= main_~b~0 3)} is VALID [2022-04-08 10:32:47,783 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-08 10:32:47,783 INFO L290 TraceCheckUtils]: 38: Hoare triple {7982#(<= main_~b~0 3)} assume !!(~c~0 < 6); {7982#(<= main_~b~0 3)} is VALID [2022-04-08 10:32:47,783 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-08 10:32:47,784 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-08 10:32:47,784 INFO L290 TraceCheckUtils]: 35: Hoare triple {7981#(<= main_~b~0 2)} assume !(~c~0 < 6); {7981#(<= main_~b~0 2)} is VALID [2022-04-08 10:32:47,784 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-08 10:32:47,784 INFO L290 TraceCheckUtils]: 33: Hoare triple {7981#(<= main_~b~0 2)} assume !!(~c~0 < 6); {7981#(<= main_~b~0 2)} is VALID [2022-04-08 10:32:47,785 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-08 10:32:47,785 INFO L290 TraceCheckUtils]: 31: Hoare triple {7981#(<= main_~b~0 2)} assume !!(~c~0 < 6); {7981#(<= main_~b~0 2)} is VALID [2022-04-08 10:32:47,785 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-08 10:32:47,785 INFO L290 TraceCheckUtils]: 29: Hoare triple {7981#(<= main_~b~0 2)} assume !!(~c~0 < 6); {7981#(<= main_~b~0 2)} is VALID [2022-04-08 10:32:47,785 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-08 10:32:47,786 INFO L290 TraceCheckUtils]: 27: Hoare triple {7981#(<= main_~b~0 2)} assume !!(~c~0 < 6); {7981#(<= main_~b~0 2)} is VALID [2022-04-08 10:32:47,786 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-08 10:32:47,786 INFO L290 TraceCheckUtils]: 25: Hoare triple {7981#(<= main_~b~0 2)} assume !!(~c~0 < 6); {7981#(<= main_~b~0 2)} is VALID [2022-04-08 10:32:47,786 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-08 10:32:47,787 INFO L290 TraceCheckUtils]: 23: Hoare triple {7981#(<= main_~b~0 2)} assume !!(~c~0 < 6); {7981#(<= main_~b~0 2)} is VALID [2022-04-08 10:32:47,787 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-08 10:32:47,787 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-08 10:32:47,787 INFO L290 TraceCheckUtils]: 20: Hoare triple {7980#(<= main_~b~0 1)} assume !(~c~0 < 6); {7980#(<= main_~b~0 1)} is VALID [2022-04-08 10:32:47,788 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-08 10:32:47,788 INFO L290 TraceCheckUtils]: 18: Hoare triple {7980#(<= main_~b~0 1)} assume !!(~c~0 < 6); {7980#(<= main_~b~0 1)} is VALID [2022-04-08 10:32:47,788 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-08 10:32:47,788 INFO L290 TraceCheckUtils]: 16: Hoare triple {7980#(<= main_~b~0 1)} assume !!(~c~0 < 6); {7980#(<= main_~b~0 1)} is VALID [2022-04-08 10:32:47,789 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-08 10:32:47,789 INFO L290 TraceCheckUtils]: 14: Hoare triple {7980#(<= main_~b~0 1)} assume !!(~c~0 < 6); {7980#(<= main_~b~0 1)} is VALID [2022-04-08 10:32:47,789 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-08 10:32:47,789 INFO L290 TraceCheckUtils]: 12: Hoare triple {7980#(<= main_~b~0 1)} assume !!(~c~0 < 6); {7980#(<= main_~b~0 1)} is VALID [2022-04-08 10:32:47,790 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-08 10:32:47,790 INFO L290 TraceCheckUtils]: 10: Hoare triple {7980#(<= main_~b~0 1)} assume !!(~c~0 < 6); {7980#(<= main_~b~0 1)} is VALID [2022-04-08 10:32:47,790 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-08 10:32:47,790 INFO L290 TraceCheckUtils]: 8: Hoare triple {7980#(<= main_~b~0 1)} assume !!(~c~0 < 6); {7980#(<= main_~b~0 1)} is VALID [2022-04-08 10:32:47,790 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-08 10:32:47,797 INFO L290 TraceCheckUtils]: 6: Hoare triple {7974#true} assume !!(~a~0 < 6);~b~0 := 0; {7980#(<= main_~b~0 1)} is VALID [2022-04-08 10:32:47,797 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-08 10:32:47,797 INFO L272 TraceCheckUtils]: 4: Hoare triple {7974#true} call #t~ret7 := main(); {7974#true} is VALID [2022-04-08 10:32:47,797 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7974#true} {7974#true} #56#return; {7974#true} is VALID [2022-04-08 10:32:47,797 INFO L290 TraceCheckUtils]: 2: Hoare triple {7974#true} assume true; {7974#true} is VALID [2022-04-08 10:32:47,797 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-08 10:32:47,797 INFO L272 TraceCheckUtils]: 0: Hoare triple {7974#true} call ULTIMATE.init(); {7974#true} is VALID [2022-04-08 10:32:47,798 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-08 10:32:47,799 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1230327368] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:32:47,799 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:32:47,799 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 10 [2022-04-08 10:32:47,799 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:32:47,799 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1266131094] [2022-04-08 10:32:47,799 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1266131094] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:32:47,799 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:32:47,799 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-08 10:32:47,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [640577780] [2022-04-08 10:32:47,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:32:47,803 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-08 10:32:47,803 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:32:47,803 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-08 10:32:47,826 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-08 10:32:47,827 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-08 10:32:47,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:32:47,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-08 10:32:47,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2022-04-08 10:32:47,827 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-08 10:32:48,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:32:48,224 INFO L93 Difference]: Finished difference Result 262 states and 283 transitions. [2022-04-08 10:32:48,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-08 10:32:48,224 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-08 10:32:48,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:32:48,225 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-08 10:32:48,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 54 transitions. [2022-04-08 10:32:48,225 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-08 10:32:48,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 54 transitions. [2022-04-08 10:32:48,226 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 54 transitions. [2022-04-08 10:32:48,261 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-08 10:32:48,263 INFO L225 Difference]: With dead ends: 262 [2022-04-08 10:32:48,263 INFO L226 Difference]: Without dead ends: 194 [2022-04-08 10:32:48,263 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-08 10:32:48,264 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-08 10:32:48,264 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-08 10:32:48,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2022-04-08 10:32:48,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 166. [2022-04-08 10:32:48,481 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:32:48,481 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-08 10:32:48,481 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-08 10:32:48,481 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-08 10:32:48,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:32:48,484 INFO L93 Difference]: Finished difference Result 194 states and 208 transitions. [2022-04-08 10:32:48,484 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 208 transitions. [2022-04-08 10:32:48,484 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:32:48,484 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:32:48,485 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-08 10:32:48,485 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-08 10:32:48,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:32:48,487 INFO L93 Difference]: Finished difference Result 194 states and 208 transitions. [2022-04-08 10:32:48,487 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 208 transitions. [2022-04-08 10:32:48,487 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:32:48,488 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:32:48,488 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:32:48,488 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:32:48,488 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-08 10:32:48,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 178 transitions. [2022-04-08 10:32:48,490 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 178 transitions. Word has length 135 [2022-04-08 10:32:48,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:32:48,490 INFO L478 AbstractCegarLoop]: Abstraction has 166 states and 178 transitions. [2022-04-08 10:32:48,490 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-08 10:32:48,490 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 166 states and 178 transitions. [2022-04-08 10:32:48,651 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-08 10:32:48,651 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 178 transitions. [2022-04-08 10:32:48,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2022-04-08 10:32:48,652 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:32:48,652 INFO L499 BasicCegarLoop]: trace histogram [60, 60, 10, 10, 10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:32:48,668 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-04-08 10:32:48,863 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,SelfDestructingSolverStorable13 [2022-04-08 10:32:48,864 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:32:48,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:32:48,864 INFO L85 PathProgramCache]: Analyzing trace with hash 404361087, now seen corresponding path program 21 times [2022-04-08 10:32:48,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:32:48,864 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1447258782] [2022-04-08 10:32:49,065 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:32:49,170 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:32:49,170 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:32:49,170 INFO L85 PathProgramCache]: Analyzing trace with hash 404361087, now seen corresponding path program 22 times [2022-04-08 10:32:49,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:32:49,170 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403620496] [2022-04-08 10:32:49,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:32:49,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:32:49,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:32:49,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:32:49,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:32:49,254 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-08 10:32:49,254 INFO L290 TraceCheckUtils]: 1: Hoare triple {10050#true} assume true; {10050#true} is VALID [2022-04-08 10:32:49,254 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {10050#true} {10050#true} #56#return; {10050#true} is VALID [2022-04-08 10:32:49,255 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-08 10:32:49,255 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-08 10:32:49,255 INFO L290 TraceCheckUtils]: 2: Hoare triple {10050#true} assume true; {10050#true} is VALID [2022-04-08 10:32:49,255 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10050#true} {10050#true} #56#return; {10050#true} is VALID [2022-04-08 10:32:49,255 INFO L272 TraceCheckUtils]: 4: Hoare triple {10050#true} call #t~ret7 := main(); {10050#true} is VALID [2022-04-08 10:32:49,255 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-08 10:32:49,255 INFO L290 TraceCheckUtils]: 6: Hoare triple {10050#true} assume !!(~a~0 < 6);~b~0 := 0; {10055#(= main_~b~0 0)} is VALID [2022-04-08 10:32:49,255 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-08 10:32:49,256 INFO L290 TraceCheckUtils]: 8: Hoare triple {10055#(= main_~b~0 0)} assume !!(~c~0 < 6); {10055#(= main_~b~0 0)} is VALID [2022-04-08 10:32:49,256 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-08 10:32:49,256 INFO L290 TraceCheckUtils]: 10: Hoare triple {10055#(= main_~b~0 0)} assume !!(~c~0 < 6); {10055#(= main_~b~0 0)} is VALID [2022-04-08 10:32:49,256 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-08 10:32:49,256 INFO L290 TraceCheckUtils]: 12: Hoare triple {10055#(= main_~b~0 0)} assume !!(~c~0 < 6); {10055#(= main_~b~0 0)} is VALID [2022-04-08 10:32:49,257 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-08 10:32:49,257 INFO L290 TraceCheckUtils]: 14: Hoare triple {10055#(= main_~b~0 0)} assume !!(~c~0 < 6); {10055#(= main_~b~0 0)} is VALID [2022-04-08 10:32:49,257 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-08 10:32:49,257 INFO L290 TraceCheckUtils]: 16: Hoare triple {10055#(= main_~b~0 0)} assume !!(~c~0 < 6); {10055#(= main_~b~0 0)} is VALID [2022-04-08 10:32:49,257 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-08 10:32:49,258 INFO L290 TraceCheckUtils]: 18: Hoare triple {10055#(= main_~b~0 0)} assume !!(~c~0 < 6); {10055#(= main_~b~0 0)} is VALID [2022-04-08 10:32:49,258 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-08 10:32:49,258 INFO L290 TraceCheckUtils]: 20: Hoare triple {10055#(= main_~b~0 0)} assume !(~c~0 < 6); {10055#(= main_~b~0 0)} is VALID [2022-04-08 10:32:49,258 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-08 10:32:49,259 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-08 10:32:49,259 INFO L290 TraceCheckUtils]: 23: Hoare triple {10056#(<= main_~b~0 1)} assume !!(~c~0 < 6); {10056#(<= main_~b~0 1)} is VALID [2022-04-08 10:32:49,259 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-08 10:32:49,259 INFO L290 TraceCheckUtils]: 25: Hoare triple {10056#(<= main_~b~0 1)} assume !!(~c~0 < 6); {10056#(<= main_~b~0 1)} is VALID [2022-04-08 10:32:49,259 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-08 10:32:49,260 INFO L290 TraceCheckUtils]: 27: Hoare triple {10056#(<= main_~b~0 1)} assume !!(~c~0 < 6); {10056#(<= main_~b~0 1)} is VALID [2022-04-08 10:32:49,260 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-08 10:32:49,260 INFO L290 TraceCheckUtils]: 29: Hoare triple {10056#(<= main_~b~0 1)} assume !!(~c~0 < 6); {10056#(<= main_~b~0 1)} is VALID [2022-04-08 10:32:49,260 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-08 10:32:49,260 INFO L290 TraceCheckUtils]: 31: Hoare triple {10056#(<= main_~b~0 1)} assume !!(~c~0 < 6); {10056#(<= main_~b~0 1)} is VALID [2022-04-08 10:32:49,261 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-08 10:32:49,261 INFO L290 TraceCheckUtils]: 33: Hoare triple {10056#(<= main_~b~0 1)} assume !!(~c~0 < 6); {10056#(<= main_~b~0 1)} is VALID [2022-04-08 10:32:49,261 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-08 10:32:49,261 INFO L290 TraceCheckUtils]: 35: Hoare triple {10056#(<= main_~b~0 1)} assume !(~c~0 < 6); {10056#(<= main_~b~0 1)} is VALID [2022-04-08 10:32:49,262 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-08 10:32:49,262 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-08 10:32:49,262 INFO L290 TraceCheckUtils]: 38: Hoare triple {10057#(<= main_~b~0 2)} assume !!(~c~0 < 6); {10057#(<= main_~b~0 2)} is VALID [2022-04-08 10:32:49,262 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-08 10:32:49,262 INFO L290 TraceCheckUtils]: 40: Hoare triple {10057#(<= main_~b~0 2)} assume !!(~c~0 < 6); {10057#(<= main_~b~0 2)} is VALID [2022-04-08 10:32:49,263 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-08 10:32:49,263 INFO L290 TraceCheckUtils]: 42: Hoare triple {10057#(<= main_~b~0 2)} assume !!(~c~0 < 6); {10057#(<= main_~b~0 2)} is VALID [2022-04-08 10:32:49,263 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-08 10:32:49,263 INFO L290 TraceCheckUtils]: 44: Hoare triple {10057#(<= main_~b~0 2)} assume !!(~c~0 < 6); {10057#(<= main_~b~0 2)} is VALID [2022-04-08 10:32:49,264 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-08 10:32:49,264 INFO L290 TraceCheckUtils]: 46: Hoare triple {10057#(<= main_~b~0 2)} assume !!(~c~0 < 6); {10057#(<= main_~b~0 2)} is VALID [2022-04-08 10:32:49,264 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-08 10:32:49,264 INFO L290 TraceCheckUtils]: 48: Hoare triple {10057#(<= main_~b~0 2)} assume !!(~c~0 < 6); {10057#(<= main_~b~0 2)} is VALID [2022-04-08 10:32:49,264 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-08 10:32:49,265 INFO L290 TraceCheckUtils]: 50: Hoare triple {10057#(<= main_~b~0 2)} assume !(~c~0 < 6); {10057#(<= main_~b~0 2)} is VALID [2022-04-08 10:32:49,265 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-08 10:32:49,265 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-08 10:32:49,265 INFO L290 TraceCheckUtils]: 53: Hoare triple {10058#(<= main_~b~0 3)} assume !!(~c~0 < 6); {10058#(<= main_~b~0 3)} is VALID [2022-04-08 10:32:49,266 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-08 10:32:49,266 INFO L290 TraceCheckUtils]: 55: Hoare triple {10058#(<= main_~b~0 3)} assume !!(~c~0 < 6); {10058#(<= main_~b~0 3)} is VALID [2022-04-08 10:32:49,266 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-08 10:32:49,266 INFO L290 TraceCheckUtils]: 57: Hoare triple {10058#(<= main_~b~0 3)} assume !!(~c~0 < 6); {10058#(<= main_~b~0 3)} is VALID [2022-04-08 10:32:49,266 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-08 10:32:49,267 INFO L290 TraceCheckUtils]: 59: Hoare triple {10058#(<= main_~b~0 3)} assume !!(~c~0 < 6); {10058#(<= main_~b~0 3)} is VALID [2022-04-08 10:32:49,267 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-08 10:32:49,267 INFO L290 TraceCheckUtils]: 61: Hoare triple {10058#(<= main_~b~0 3)} assume !!(~c~0 < 6); {10058#(<= main_~b~0 3)} is VALID [2022-04-08 10:32:49,267 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-08 10:32:49,267 INFO L290 TraceCheckUtils]: 63: Hoare triple {10058#(<= main_~b~0 3)} assume !!(~c~0 < 6); {10058#(<= main_~b~0 3)} is VALID [2022-04-08 10:32:49,268 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-08 10:32:49,268 INFO L290 TraceCheckUtils]: 65: Hoare triple {10058#(<= main_~b~0 3)} assume !(~c~0 < 6); {10058#(<= main_~b~0 3)} is VALID [2022-04-08 10:32:49,268 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-08 10:32:49,268 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-08 10:32:49,269 INFO L290 TraceCheckUtils]: 68: Hoare triple {10059#(<= main_~b~0 4)} assume !!(~c~0 < 6); {10059#(<= main_~b~0 4)} is VALID [2022-04-08 10:32:49,269 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-08 10:32:49,269 INFO L290 TraceCheckUtils]: 70: Hoare triple {10059#(<= main_~b~0 4)} assume !!(~c~0 < 6); {10059#(<= main_~b~0 4)} is VALID [2022-04-08 10:32:49,269 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-08 10:32:49,269 INFO L290 TraceCheckUtils]: 72: Hoare triple {10059#(<= main_~b~0 4)} assume !!(~c~0 < 6); {10059#(<= main_~b~0 4)} is VALID [2022-04-08 10:32:49,270 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-08 10:32:49,270 INFO L290 TraceCheckUtils]: 74: Hoare triple {10059#(<= main_~b~0 4)} assume !!(~c~0 < 6); {10059#(<= main_~b~0 4)} is VALID [2022-04-08 10:32:49,270 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-08 10:32:49,270 INFO L290 TraceCheckUtils]: 76: Hoare triple {10059#(<= main_~b~0 4)} assume !!(~c~0 < 6); {10059#(<= main_~b~0 4)} is VALID [2022-04-08 10:32:49,270 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-08 10:32:49,271 INFO L290 TraceCheckUtils]: 78: Hoare triple {10059#(<= main_~b~0 4)} assume !!(~c~0 < 6); {10059#(<= main_~b~0 4)} is VALID [2022-04-08 10:32:49,271 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-08 10:32:49,271 INFO L290 TraceCheckUtils]: 80: Hoare triple {10059#(<= main_~b~0 4)} assume !(~c~0 < 6); {10059#(<= main_~b~0 4)} is VALID [2022-04-08 10:32:49,272 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-08 10:32:49,272 INFO L290 TraceCheckUtils]: 82: Hoare triple {10060#(<= main_~b~0 5)} assume !(~b~0 < 6); {10051#false} is VALID [2022-04-08 10:32:49,272 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-08 10:32:49,272 INFO L290 TraceCheckUtils]: 84: Hoare triple {10051#false} assume !!(~a~0 < 6);~b~0 := 0; {10051#false} is VALID [2022-04-08 10:32:49,272 INFO L290 TraceCheckUtils]: 85: Hoare triple {10051#false} assume !!(~b~0 < 6);~c~0 := 0; {10051#false} is VALID [2022-04-08 10:32:49,272 INFO L290 TraceCheckUtils]: 86: Hoare triple {10051#false} assume !!(~c~0 < 6); {10051#false} is VALID [2022-04-08 10:32:49,272 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-08 10:32:49,272 INFO L290 TraceCheckUtils]: 88: Hoare triple {10051#false} assume !!(~c~0 < 6); {10051#false} is VALID [2022-04-08 10:32:49,272 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-08 10:32:49,272 INFO L290 TraceCheckUtils]: 90: Hoare triple {10051#false} assume !!(~c~0 < 6); {10051#false} is VALID [2022-04-08 10:32:49,272 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-08 10:32:49,272 INFO L290 TraceCheckUtils]: 92: Hoare triple {10051#false} assume !!(~c~0 < 6); {10051#false} is VALID [2022-04-08 10:32:49,272 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-08 10:32:49,272 INFO L290 TraceCheckUtils]: 94: Hoare triple {10051#false} assume !!(~c~0 < 6); {10051#false} is VALID [2022-04-08 10:32:49,272 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-08 10:32:49,273 INFO L290 TraceCheckUtils]: 96: Hoare triple {10051#false} assume !!(~c~0 < 6); {10051#false} is VALID [2022-04-08 10:32:49,273 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-08 10:32:49,273 INFO L290 TraceCheckUtils]: 98: Hoare triple {10051#false} assume !(~c~0 < 6); {10051#false} is VALID [2022-04-08 10:32:49,273 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-08 10:32:49,273 INFO L290 TraceCheckUtils]: 100: Hoare triple {10051#false} assume !!(~b~0 < 6);~c~0 := 0; {10051#false} is VALID [2022-04-08 10:32:49,273 INFO L290 TraceCheckUtils]: 101: Hoare triple {10051#false} assume !!(~c~0 < 6); {10051#false} is VALID [2022-04-08 10:32:49,273 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-08 10:32:49,273 INFO L290 TraceCheckUtils]: 103: Hoare triple {10051#false} assume !!(~c~0 < 6); {10051#false} is VALID [2022-04-08 10:32:49,273 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-08 10:32:49,273 INFO L290 TraceCheckUtils]: 105: Hoare triple {10051#false} assume !!(~c~0 < 6); {10051#false} is VALID [2022-04-08 10:32:49,273 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-08 10:32:49,273 INFO L290 TraceCheckUtils]: 107: Hoare triple {10051#false} assume !!(~c~0 < 6); {10051#false} is VALID [2022-04-08 10:32:49,273 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-08 10:32:49,273 INFO L290 TraceCheckUtils]: 109: Hoare triple {10051#false} assume !!(~c~0 < 6); {10051#false} is VALID [2022-04-08 10:32:49,273 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-08 10:32:49,273 INFO L290 TraceCheckUtils]: 111: Hoare triple {10051#false} assume !!(~c~0 < 6); {10051#false} is VALID [2022-04-08 10:32:49,273 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-08 10:32:49,273 INFO L290 TraceCheckUtils]: 113: Hoare triple {10051#false} assume !(~c~0 < 6); {10051#false} is VALID [2022-04-08 10:32:49,273 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-08 10:32:49,273 INFO L290 TraceCheckUtils]: 115: Hoare triple {10051#false} assume !!(~b~0 < 6);~c~0 := 0; {10051#false} is VALID [2022-04-08 10:32:49,274 INFO L290 TraceCheckUtils]: 116: Hoare triple {10051#false} assume !!(~c~0 < 6); {10051#false} is VALID [2022-04-08 10:32:49,274 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-08 10:32:49,274 INFO L290 TraceCheckUtils]: 118: Hoare triple {10051#false} assume !!(~c~0 < 6); {10051#false} is VALID [2022-04-08 10:32:49,274 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-08 10:32:49,274 INFO L290 TraceCheckUtils]: 120: Hoare triple {10051#false} assume !!(~c~0 < 6); {10051#false} is VALID [2022-04-08 10:32:49,274 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-08 10:32:49,274 INFO L290 TraceCheckUtils]: 122: Hoare triple {10051#false} assume !!(~c~0 < 6); {10051#false} is VALID [2022-04-08 10:32:49,274 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-08 10:32:49,274 INFO L290 TraceCheckUtils]: 124: Hoare triple {10051#false} assume !!(~c~0 < 6); {10051#false} is VALID [2022-04-08 10:32:49,274 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-08 10:32:49,274 INFO L290 TraceCheckUtils]: 126: Hoare triple {10051#false} assume !!(~c~0 < 6); {10051#false} is VALID [2022-04-08 10:32:49,274 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-08 10:32:49,274 INFO L290 TraceCheckUtils]: 128: Hoare triple {10051#false} assume !(~c~0 < 6); {10051#false} is VALID [2022-04-08 10:32:49,274 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-08 10:32:49,274 INFO L290 TraceCheckUtils]: 130: Hoare triple {10051#false} assume !!(~b~0 < 6);~c~0 := 0; {10051#false} is VALID [2022-04-08 10:32:49,274 INFO L290 TraceCheckUtils]: 131: Hoare triple {10051#false} assume !!(~c~0 < 6); {10051#false} is VALID [2022-04-08 10:32:49,274 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-08 10:32:49,274 INFO L290 TraceCheckUtils]: 133: Hoare triple {10051#false} assume !!(~c~0 < 6); {10051#false} is VALID [2022-04-08 10:32:49,274 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-08 10:32:49,274 INFO L290 TraceCheckUtils]: 135: Hoare triple {10051#false} assume !!(~c~0 < 6); {10051#false} is VALID [2022-04-08 10:32:49,275 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-08 10:32:49,275 INFO L290 TraceCheckUtils]: 137: Hoare triple {10051#false} assume !!(~c~0 < 6); {10051#false} is VALID [2022-04-08 10:32:49,275 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-08 10:32:49,275 INFO L290 TraceCheckUtils]: 139: Hoare triple {10051#false} assume !!(~c~0 < 6); {10051#false} is VALID [2022-04-08 10:32:49,275 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-08 10:32:49,275 INFO L290 TraceCheckUtils]: 141: Hoare triple {10051#false} assume !!(~c~0 < 6); {10051#false} is VALID [2022-04-08 10:32:49,275 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-08 10:32:49,275 INFO L290 TraceCheckUtils]: 143: Hoare triple {10051#false} assume !(~c~0 < 6); {10051#false} is VALID [2022-04-08 10:32:49,275 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-08 10:32:49,275 INFO L290 TraceCheckUtils]: 145: Hoare triple {10051#false} assume !!(~b~0 < 6);~c~0 := 0; {10051#false} is VALID [2022-04-08 10:32:49,275 INFO L290 TraceCheckUtils]: 146: Hoare triple {10051#false} assume !!(~c~0 < 6); {10051#false} is VALID [2022-04-08 10:32:49,275 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-08 10:32:49,275 INFO L290 TraceCheckUtils]: 148: Hoare triple {10051#false} assume !!(~c~0 < 6); {10051#false} is VALID [2022-04-08 10:32:49,275 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-08 10:32:49,275 INFO L290 TraceCheckUtils]: 150: Hoare triple {10051#false} assume !!(~c~0 < 6); {10051#false} is VALID [2022-04-08 10:32:49,275 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-08 10:32:49,275 INFO L290 TraceCheckUtils]: 152: Hoare triple {10051#false} assume !!(~c~0 < 6); {10051#false} is VALID [2022-04-08 10:32:49,275 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-08 10:32:49,275 INFO L290 TraceCheckUtils]: 154: Hoare triple {10051#false} assume !!(~c~0 < 6); {10051#false} is VALID [2022-04-08 10:32:49,276 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-08 10:32:49,276 INFO L290 TraceCheckUtils]: 156: Hoare triple {10051#false} assume !!(~c~0 < 6); {10051#false} is VALID [2022-04-08 10:32:49,276 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-08 10:32:49,276 INFO L290 TraceCheckUtils]: 158: Hoare triple {10051#false} assume !(~c~0 < 6); {10051#false} is VALID [2022-04-08 10:32:49,276 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-08 10:32:49,276 INFO L290 TraceCheckUtils]: 160: Hoare triple {10051#false} assume !(~b~0 < 6); {10051#false} is VALID [2022-04-08 10:32:49,276 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-08 10:32:49,276 INFO L290 TraceCheckUtils]: 162: Hoare triple {10051#false} assume !(~a~0 < 6); {10051#false} is VALID [2022-04-08 10:32:49,276 INFO L290 TraceCheckUtils]: 163: Hoare triple {10051#false} assume !((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0); {10051#false} is VALID [2022-04-08 10:32:49,276 INFO L290 TraceCheckUtils]: 164: Hoare triple {10051#false} assume !false; {10051#false} is VALID [2022-04-08 10:32:49,277 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-08 10:32:49,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:32:49,277 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [403620496] [2022-04-08 10:32:49,278 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [403620496] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:32:49,278 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1566761583] [2022-04-08 10:32:49,278 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 10:32:49,278 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:32:49,278 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:32:49,279 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-08 10:32:49,280 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-08 10:32:49,339 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 10:32:49,339 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:32:49,339 INFO L263 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-08 10:32:49,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:32:49,358 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:32:49,734 INFO L272 TraceCheckUtils]: 0: Hoare triple {10050#true} call ULTIMATE.init(); {10050#true} is VALID [2022-04-08 10:32:49,734 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-08 10:32:49,735 INFO L290 TraceCheckUtils]: 2: Hoare triple {10050#true} assume true; {10050#true} is VALID [2022-04-08 10:32:49,735 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10050#true} {10050#true} #56#return; {10050#true} is VALID [2022-04-08 10:32:49,735 INFO L272 TraceCheckUtils]: 4: Hoare triple {10050#true} call #t~ret7 := main(); {10050#true} is VALID [2022-04-08 10:32:49,735 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-08 10:32:49,737 INFO L290 TraceCheckUtils]: 6: Hoare triple {10050#true} assume !!(~a~0 < 6);~b~0 := 0; {10083#(<= main_~b~0 0)} is VALID [2022-04-08 10:32:49,737 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-08 10:32:49,737 INFO L290 TraceCheckUtils]: 8: Hoare triple {10083#(<= main_~b~0 0)} assume !!(~c~0 < 6); {10083#(<= main_~b~0 0)} is VALID [2022-04-08 10:32:49,738 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-08 10:32:49,738 INFO L290 TraceCheckUtils]: 10: Hoare triple {10083#(<= main_~b~0 0)} assume !!(~c~0 < 6); {10083#(<= main_~b~0 0)} is VALID [2022-04-08 10:32:49,738 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-08 10:32:49,738 INFO L290 TraceCheckUtils]: 12: Hoare triple {10083#(<= main_~b~0 0)} assume !!(~c~0 < 6); {10083#(<= main_~b~0 0)} is VALID [2022-04-08 10:32:49,738 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-08 10:32:49,739 INFO L290 TraceCheckUtils]: 14: Hoare triple {10083#(<= main_~b~0 0)} assume !!(~c~0 < 6); {10083#(<= main_~b~0 0)} is VALID [2022-04-08 10:32:49,739 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-08 10:32:49,739 INFO L290 TraceCheckUtils]: 16: Hoare triple {10083#(<= main_~b~0 0)} assume !!(~c~0 < 6); {10083#(<= main_~b~0 0)} is VALID [2022-04-08 10:32:49,739 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-08 10:32:49,740 INFO L290 TraceCheckUtils]: 18: Hoare triple {10083#(<= main_~b~0 0)} assume !!(~c~0 < 6); {10083#(<= main_~b~0 0)} is VALID [2022-04-08 10:32:49,740 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-08 10:32:49,740 INFO L290 TraceCheckUtils]: 20: Hoare triple {10083#(<= main_~b~0 0)} assume !(~c~0 < 6); {10083#(<= main_~b~0 0)} is VALID [2022-04-08 10:32:49,740 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-08 10:32:49,741 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-08 10:32:49,741 INFO L290 TraceCheckUtils]: 23: Hoare triple {10056#(<= main_~b~0 1)} assume !!(~c~0 < 6); {10056#(<= main_~b~0 1)} is VALID [2022-04-08 10:32:49,741 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-08 10:32:49,741 INFO L290 TraceCheckUtils]: 25: Hoare triple {10056#(<= main_~b~0 1)} assume !!(~c~0 < 6); {10056#(<= main_~b~0 1)} is VALID [2022-04-08 10:32:49,742 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-08 10:32:49,742 INFO L290 TraceCheckUtils]: 27: Hoare triple {10056#(<= main_~b~0 1)} assume !!(~c~0 < 6); {10056#(<= main_~b~0 1)} is VALID [2022-04-08 10:32:49,742 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-08 10:32:49,742 INFO L290 TraceCheckUtils]: 29: Hoare triple {10056#(<= main_~b~0 1)} assume !!(~c~0 < 6); {10056#(<= main_~b~0 1)} is VALID [2022-04-08 10:32:49,743 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-08 10:32:49,743 INFO L290 TraceCheckUtils]: 31: Hoare triple {10056#(<= main_~b~0 1)} assume !!(~c~0 < 6); {10056#(<= main_~b~0 1)} is VALID [2022-04-08 10:32:49,743 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-08 10:32:49,743 INFO L290 TraceCheckUtils]: 33: Hoare triple {10056#(<= main_~b~0 1)} assume !!(~c~0 < 6); {10056#(<= main_~b~0 1)} is VALID [2022-04-08 10:32:49,743 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-08 10:32:49,744 INFO L290 TraceCheckUtils]: 35: Hoare triple {10056#(<= main_~b~0 1)} assume !(~c~0 < 6); {10056#(<= main_~b~0 1)} is VALID [2022-04-08 10:32:49,744 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-08 10:32:49,744 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-08 10:32:49,744 INFO L290 TraceCheckUtils]: 38: Hoare triple {10057#(<= main_~b~0 2)} assume !!(~c~0 < 6); {10057#(<= main_~b~0 2)} is VALID [2022-04-08 10:32:49,745 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-08 10:32:49,745 INFO L290 TraceCheckUtils]: 40: Hoare triple {10057#(<= main_~b~0 2)} assume !!(~c~0 < 6); {10057#(<= main_~b~0 2)} is VALID [2022-04-08 10:32:49,745 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-08 10:32:49,745 INFO L290 TraceCheckUtils]: 42: Hoare triple {10057#(<= main_~b~0 2)} assume !!(~c~0 < 6); {10057#(<= main_~b~0 2)} is VALID [2022-04-08 10:32:49,746 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-08 10:32:49,746 INFO L290 TraceCheckUtils]: 44: Hoare triple {10057#(<= main_~b~0 2)} assume !!(~c~0 < 6); {10057#(<= main_~b~0 2)} is VALID [2022-04-08 10:32:49,746 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-08 10:32:49,746 INFO L290 TraceCheckUtils]: 46: Hoare triple {10057#(<= main_~b~0 2)} assume !!(~c~0 < 6); {10057#(<= main_~b~0 2)} is VALID [2022-04-08 10:32:49,747 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-08 10:32:49,747 INFO L290 TraceCheckUtils]: 48: Hoare triple {10057#(<= main_~b~0 2)} assume !!(~c~0 < 6); {10057#(<= main_~b~0 2)} is VALID [2022-04-08 10:32:49,747 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-08 10:32:49,747 INFO L290 TraceCheckUtils]: 50: Hoare triple {10057#(<= main_~b~0 2)} assume !(~c~0 < 6); {10057#(<= main_~b~0 2)} is VALID [2022-04-08 10:32:49,748 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-08 10:32:49,748 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-08 10:32:49,748 INFO L290 TraceCheckUtils]: 53: Hoare triple {10058#(<= main_~b~0 3)} assume !!(~c~0 < 6); {10058#(<= main_~b~0 3)} is VALID [2022-04-08 10:32:49,748 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-08 10:32:49,748 INFO L290 TraceCheckUtils]: 55: Hoare triple {10058#(<= main_~b~0 3)} assume !!(~c~0 < 6); {10058#(<= main_~b~0 3)} is VALID [2022-04-08 10:32:49,749 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-08 10:32:49,749 INFO L290 TraceCheckUtils]: 57: Hoare triple {10058#(<= main_~b~0 3)} assume !!(~c~0 < 6); {10058#(<= main_~b~0 3)} is VALID [2022-04-08 10:32:49,749 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-08 10:32:49,749 INFO L290 TraceCheckUtils]: 59: Hoare triple {10058#(<= main_~b~0 3)} assume !!(~c~0 < 6); {10058#(<= main_~b~0 3)} is VALID [2022-04-08 10:32:49,750 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-08 10:32:49,750 INFO L290 TraceCheckUtils]: 61: Hoare triple {10058#(<= main_~b~0 3)} assume !!(~c~0 < 6); {10058#(<= main_~b~0 3)} is VALID [2022-04-08 10:32:49,750 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-08 10:32:49,750 INFO L290 TraceCheckUtils]: 63: Hoare triple {10058#(<= main_~b~0 3)} assume !!(~c~0 < 6); {10058#(<= main_~b~0 3)} is VALID [2022-04-08 10:32:49,750 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-08 10:32:49,751 INFO L290 TraceCheckUtils]: 65: Hoare triple {10058#(<= main_~b~0 3)} assume !(~c~0 < 6); {10058#(<= main_~b~0 3)} is VALID [2022-04-08 10:32:49,751 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-08 10:32:49,751 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-08 10:32:49,752 INFO L290 TraceCheckUtils]: 68: Hoare triple {10059#(<= main_~b~0 4)} assume !!(~c~0 < 6); {10059#(<= main_~b~0 4)} is VALID [2022-04-08 10:32:49,752 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-08 10:32:49,752 INFO L290 TraceCheckUtils]: 70: Hoare triple {10059#(<= main_~b~0 4)} assume !!(~c~0 < 6); {10059#(<= main_~b~0 4)} is VALID [2022-04-08 10:32:49,752 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-08 10:32:49,752 INFO L290 TraceCheckUtils]: 72: Hoare triple {10059#(<= main_~b~0 4)} assume !!(~c~0 < 6); {10059#(<= main_~b~0 4)} is VALID [2022-04-08 10:32:49,753 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-08 10:32:49,753 INFO L290 TraceCheckUtils]: 74: Hoare triple {10059#(<= main_~b~0 4)} assume !!(~c~0 < 6); {10059#(<= main_~b~0 4)} is VALID [2022-04-08 10:32:49,753 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-08 10:32:49,753 INFO L290 TraceCheckUtils]: 76: Hoare triple {10059#(<= main_~b~0 4)} assume !!(~c~0 < 6); {10059#(<= main_~b~0 4)} is VALID [2022-04-08 10:32:49,754 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-08 10:32:49,754 INFO L290 TraceCheckUtils]: 78: Hoare triple {10059#(<= main_~b~0 4)} assume !!(~c~0 < 6); {10059#(<= main_~b~0 4)} is VALID [2022-04-08 10:32:49,754 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-08 10:32:49,754 INFO L290 TraceCheckUtils]: 80: Hoare triple {10059#(<= main_~b~0 4)} assume !(~c~0 < 6); {10059#(<= main_~b~0 4)} is VALID [2022-04-08 10:32:49,755 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-08 10:32:49,755 INFO L290 TraceCheckUtils]: 82: Hoare triple {10060#(<= main_~b~0 5)} assume !(~b~0 < 6); {10051#false} is VALID [2022-04-08 10:32:49,755 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-08 10:32:49,755 INFO L290 TraceCheckUtils]: 84: Hoare triple {10051#false} assume !!(~a~0 < 6);~b~0 := 0; {10051#false} is VALID [2022-04-08 10:32:49,755 INFO L290 TraceCheckUtils]: 85: Hoare triple {10051#false} assume !!(~b~0 < 6);~c~0 := 0; {10051#false} is VALID [2022-04-08 10:32:49,755 INFO L290 TraceCheckUtils]: 86: Hoare triple {10051#false} assume !!(~c~0 < 6); {10051#false} is VALID [2022-04-08 10:32:49,755 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-08 10:32:49,755 INFO L290 TraceCheckUtils]: 88: Hoare triple {10051#false} assume !!(~c~0 < 6); {10051#false} is VALID [2022-04-08 10:32:49,755 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-08 10:32:49,755 INFO L290 TraceCheckUtils]: 90: Hoare triple {10051#false} assume !!(~c~0 < 6); {10051#false} is VALID [2022-04-08 10:32:49,755 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-08 10:32:49,755 INFO L290 TraceCheckUtils]: 92: Hoare triple {10051#false} assume !!(~c~0 < 6); {10051#false} is VALID [2022-04-08 10:32:49,755 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-08 10:32:49,756 INFO L290 TraceCheckUtils]: 94: Hoare triple {10051#false} assume !!(~c~0 < 6); {10051#false} is VALID [2022-04-08 10:32:49,756 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-08 10:32:49,756 INFO L290 TraceCheckUtils]: 96: Hoare triple {10051#false} assume !!(~c~0 < 6); {10051#false} is VALID [2022-04-08 10:32:49,756 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-08 10:32:49,756 INFO L290 TraceCheckUtils]: 98: Hoare triple {10051#false} assume !(~c~0 < 6); {10051#false} is VALID [2022-04-08 10:32:49,756 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-08 10:32:49,756 INFO L290 TraceCheckUtils]: 100: Hoare triple {10051#false} assume !!(~b~0 < 6);~c~0 := 0; {10051#false} is VALID [2022-04-08 10:32:49,756 INFO L290 TraceCheckUtils]: 101: Hoare triple {10051#false} assume !!(~c~0 < 6); {10051#false} is VALID [2022-04-08 10:32:49,756 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-08 10:32:49,756 INFO L290 TraceCheckUtils]: 103: Hoare triple {10051#false} assume !!(~c~0 < 6); {10051#false} is VALID [2022-04-08 10:32:49,756 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-08 10:32:49,756 INFO L290 TraceCheckUtils]: 105: Hoare triple {10051#false} assume !!(~c~0 < 6); {10051#false} is VALID [2022-04-08 10:32:49,756 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-08 10:32:49,756 INFO L290 TraceCheckUtils]: 107: Hoare triple {10051#false} assume !!(~c~0 < 6); {10051#false} is VALID [2022-04-08 10:32:49,756 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-08 10:32:49,756 INFO L290 TraceCheckUtils]: 109: Hoare triple {10051#false} assume !!(~c~0 < 6); {10051#false} is VALID [2022-04-08 10:32:49,756 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-08 10:32:49,756 INFO L290 TraceCheckUtils]: 111: Hoare triple {10051#false} assume !!(~c~0 < 6); {10051#false} is VALID [2022-04-08 10:32:49,756 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-08 10:32:49,756 INFO L290 TraceCheckUtils]: 113: Hoare triple {10051#false} assume !(~c~0 < 6); {10051#false} is VALID [2022-04-08 10:32:49,757 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-08 10:32:49,757 INFO L290 TraceCheckUtils]: 115: Hoare triple {10051#false} assume !!(~b~0 < 6);~c~0 := 0; {10051#false} is VALID [2022-04-08 10:32:49,757 INFO L290 TraceCheckUtils]: 116: Hoare triple {10051#false} assume !!(~c~0 < 6); {10051#false} is VALID [2022-04-08 10:32:49,757 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-08 10:32:49,757 INFO L290 TraceCheckUtils]: 118: Hoare triple {10051#false} assume !!(~c~0 < 6); {10051#false} is VALID [2022-04-08 10:32:49,757 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-08 10:32:49,757 INFO L290 TraceCheckUtils]: 120: Hoare triple {10051#false} assume !!(~c~0 < 6); {10051#false} is VALID [2022-04-08 10:32:49,757 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-08 10:32:49,757 INFO L290 TraceCheckUtils]: 122: Hoare triple {10051#false} assume !!(~c~0 < 6); {10051#false} is VALID [2022-04-08 10:32:49,757 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-08 10:32:49,757 INFO L290 TraceCheckUtils]: 124: Hoare triple {10051#false} assume !!(~c~0 < 6); {10051#false} is VALID [2022-04-08 10:32:49,757 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-08 10:32:49,757 INFO L290 TraceCheckUtils]: 126: Hoare triple {10051#false} assume !!(~c~0 < 6); {10051#false} is VALID [2022-04-08 10:32:49,757 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-08 10:32:49,757 INFO L290 TraceCheckUtils]: 128: Hoare triple {10051#false} assume !(~c~0 < 6); {10051#false} is VALID [2022-04-08 10:32:49,757 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-08 10:32:49,757 INFO L290 TraceCheckUtils]: 130: Hoare triple {10051#false} assume !!(~b~0 < 6);~c~0 := 0; {10051#false} is VALID [2022-04-08 10:32:49,757 INFO L290 TraceCheckUtils]: 131: Hoare triple {10051#false} assume !!(~c~0 < 6); {10051#false} is VALID [2022-04-08 10:32:49,757 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-08 10:32:49,758 INFO L290 TraceCheckUtils]: 133: Hoare triple {10051#false} assume !!(~c~0 < 6); {10051#false} is VALID [2022-04-08 10:32:49,758 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-08 10:32:49,758 INFO L290 TraceCheckUtils]: 135: Hoare triple {10051#false} assume !!(~c~0 < 6); {10051#false} is VALID [2022-04-08 10:32:49,758 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-08 10:32:49,758 INFO L290 TraceCheckUtils]: 137: Hoare triple {10051#false} assume !!(~c~0 < 6); {10051#false} is VALID [2022-04-08 10:32:49,758 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-08 10:32:49,758 INFO L290 TraceCheckUtils]: 139: Hoare triple {10051#false} assume !!(~c~0 < 6); {10051#false} is VALID [2022-04-08 10:32:49,758 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-08 10:32:49,758 INFO L290 TraceCheckUtils]: 141: Hoare triple {10051#false} assume !!(~c~0 < 6); {10051#false} is VALID [2022-04-08 10:32:49,758 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-08 10:32:49,758 INFO L290 TraceCheckUtils]: 143: Hoare triple {10051#false} assume !(~c~0 < 6); {10051#false} is VALID [2022-04-08 10:32:49,758 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-08 10:32:49,758 INFO L290 TraceCheckUtils]: 145: Hoare triple {10051#false} assume !!(~b~0 < 6);~c~0 := 0; {10051#false} is VALID [2022-04-08 10:32:49,758 INFO L290 TraceCheckUtils]: 146: Hoare triple {10051#false} assume !!(~c~0 < 6); {10051#false} is VALID [2022-04-08 10:32:49,758 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-08 10:32:49,758 INFO L290 TraceCheckUtils]: 148: Hoare triple {10051#false} assume !!(~c~0 < 6); {10051#false} is VALID [2022-04-08 10:32:49,758 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-08 10:32:49,758 INFO L290 TraceCheckUtils]: 150: Hoare triple {10051#false} assume !!(~c~0 < 6); {10051#false} is VALID [2022-04-08 10:32:49,758 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-08 10:32:49,759 INFO L290 TraceCheckUtils]: 152: Hoare triple {10051#false} assume !!(~c~0 < 6); {10051#false} is VALID [2022-04-08 10:32:49,759 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-08 10:32:49,759 INFO L290 TraceCheckUtils]: 154: Hoare triple {10051#false} assume !!(~c~0 < 6); {10051#false} is VALID [2022-04-08 10:32:49,759 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-08 10:32:49,759 INFO L290 TraceCheckUtils]: 156: Hoare triple {10051#false} assume !!(~c~0 < 6); {10051#false} is VALID [2022-04-08 10:32:49,759 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-08 10:32:49,759 INFO L290 TraceCheckUtils]: 158: Hoare triple {10051#false} assume !(~c~0 < 6); {10051#false} is VALID [2022-04-08 10:32:49,759 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-08 10:32:49,759 INFO L290 TraceCheckUtils]: 160: Hoare triple {10051#false} assume !(~b~0 < 6); {10051#false} is VALID [2022-04-08 10:32:49,759 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-08 10:32:49,759 INFO L290 TraceCheckUtils]: 162: Hoare triple {10051#false} assume !(~a~0 < 6); {10051#false} is VALID [2022-04-08 10:32:49,759 INFO L290 TraceCheckUtils]: 163: Hoare triple {10051#false} assume !((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0); {10051#false} is VALID [2022-04-08 10:32:49,759 INFO L290 TraceCheckUtils]: 164: Hoare triple {10051#false} assume !false; {10051#false} is VALID [2022-04-08 10:32:49,760 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-08 10:32:49,761 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:32:50,172 INFO L290 TraceCheckUtils]: 164: Hoare triple {10051#false} assume !false; {10051#false} is VALID [2022-04-08 10:32:50,172 INFO L290 TraceCheckUtils]: 163: Hoare triple {10051#false} assume !((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0); {10051#false} is VALID [2022-04-08 10:32:50,173 INFO L290 TraceCheckUtils]: 162: Hoare triple {10051#false} assume !(~a~0 < 6); {10051#false} is VALID [2022-04-08 10:32:50,173 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-08 10:32:50,173 INFO L290 TraceCheckUtils]: 160: Hoare triple {10051#false} assume !(~b~0 < 6); {10051#false} is VALID [2022-04-08 10:32:50,173 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-08 10:32:50,173 INFO L290 TraceCheckUtils]: 158: Hoare triple {10051#false} assume !(~c~0 < 6); {10051#false} is VALID [2022-04-08 10:32:50,173 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-08 10:32:50,173 INFO L290 TraceCheckUtils]: 156: Hoare triple {10051#false} assume !!(~c~0 < 6); {10051#false} is VALID [2022-04-08 10:32:50,173 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-08 10:32:50,173 INFO L290 TraceCheckUtils]: 154: Hoare triple {10051#false} assume !!(~c~0 < 6); {10051#false} is VALID [2022-04-08 10:32:50,173 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-08 10:32:50,173 INFO L290 TraceCheckUtils]: 152: Hoare triple {10051#false} assume !!(~c~0 < 6); {10051#false} is VALID [2022-04-08 10:32:50,173 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-08 10:32:50,173 INFO L290 TraceCheckUtils]: 150: Hoare triple {10051#false} assume !!(~c~0 < 6); {10051#false} is VALID [2022-04-08 10:32:50,173 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-08 10:32:50,173 INFO L290 TraceCheckUtils]: 148: Hoare triple {10051#false} assume !!(~c~0 < 6); {10051#false} is VALID [2022-04-08 10:32:50,173 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-08 10:32:50,173 INFO L290 TraceCheckUtils]: 146: Hoare triple {10051#false} assume !!(~c~0 < 6); {10051#false} is VALID [2022-04-08 10:32:50,173 INFO L290 TraceCheckUtils]: 145: Hoare triple {10051#false} assume !!(~b~0 < 6);~c~0 := 0; {10051#false} is VALID [2022-04-08 10:32:50,173 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-08 10:32:50,174 INFO L290 TraceCheckUtils]: 143: Hoare triple {10051#false} assume !(~c~0 < 6); {10051#false} is VALID [2022-04-08 10:32:50,174 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-08 10:32:50,174 INFO L290 TraceCheckUtils]: 141: Hoare triple {10051#false} assume !!(~c~0 < 6); {10051#false} is VALID [2022-04-08 10:32:50,174 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-08 10:32:50,174 INFO L290 TraceCheckUtils]: 139: Hoare triple {10051#false} assume !!(~c~0 < 6); {10051#false} is VALID [2022-04-08 10:32:50,174 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-08 10:32:50,174 INFO L290 TraceCheckUtils]: 137: Hoare triple {10051#false} assume !!(~c~0 < 6); {10051#false} is VALID [2022-04-08 10:32:50,174 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-08 10:32:50,174 INFO L290 TraceCheckUtils]: 135: Hoare triple {10051#false} assume !!(~c~0 < 6); {10051#false} is VALID [2022-04-08 10:32:50,174 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-08 10:32:50,174 INFO L290 TraceCheckUtils]: 133: Hoare triple {10051#false} assume !!(~c~0 < 6); {10051#false} is VALID [2022-04-08 10:32:50,174 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-08 10:32:50,174 INFO L290 TraceCheckUtils]: 131: Hoare triple {10051#false} assume !!(~c~0 < 6); {10051#false} is VALID [2022-04-08 10:32:50,174 INFO L290 TraceCheckUtils]: 130: Hoare triple {10051#false} assume !!(~b~0 < 6);~c~0 := 0; {10051#false} is VALID [2022-04-08 10:32:50,174 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-08 10:32:50,174 INFO L290 TraceCheckUtils]: 128: Hoare triple {10051#false} assume !(~c~0 < 6); {10051#false} is VALID [2022-04-08 10:32:50,174 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-08 10:32:50,174 INFO L290 TraceCheckUtils]: 126: Hoare triple {10051#false} assume !!(~c~0 < 6); {10051#false} is VALID [2022-04-08 10:32:50,174 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-08 10:32:50,174 INFO L290 TraceCheckUtils]: 124: Hoare triple {10051#false} assume !!(~c~0 < 6); {10051#false} is VALID [2022-04-08 10:32:50,175 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-08 10:32:50,175 INFO L290 TraceCheckUtils]: 122: Hoare triple {10051#false} assume !!(~c~0 < 6); {10051#false} is VALID [2022-04-08 10:32:50,175 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-08 10:32:50,175 INFO L290 TraceCheckUtils]: 120: Hoare triple {10051#false} assume !!(~c~0 < 6); {10051#false} is VALID [2022-04-08 10:32:50,175 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-08 10:32:50,175 INFO L290 TraceCheckUtils]: 118: Hoare triple {10051#false} assume !!(~c~0 < 6); {10051#false} is VALID [2022-04-08 10:32:50,175 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-08 10:32:50,175 INFO L290 TraceCheckUtils]: 116: Hoare triple {10051#false} assume !!(~c~0 < 6); {10051#false} is VALID [2022-04-08 10:32:50,175 INFO L290 TraceCheckUtils]: 115: Hoare triple {10051#false} assume !!(~b~0 < 6);~c~0 := 0; {10051#false} is VALID [2022-04-08 10:32:50,175 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-08 10:32:50,175 INFO L290 TraceCheckUtils]: 113: Hoare triple {10051#false} assume !(~c~0 < 6); {10051#false} is VALID [2022-04-08 10:32:50,175 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-08 10:32:50,175 INFO L290 TraceCheckUtils]: 111: Hoare triple {10051#false} assume !!(~c~0 < 6); {10051#false} is VALID [2022-04-08 10:32:50,175 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-08 10:32:50,175 INFO L290 TraceCheckUtils]: 109: Hoare triple {10051#false} assume !!(~c~0 < 6); {10051#false} is VALID [2022-04-08 10:32:50,175 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-08 10:32:50,175 INFO L290 TraceCheckUtils]: 107: Hoare triple {10051#false} assume !!(~c~0 < 6); {10051#false} is VALID [2022-04-08 10:32:50,175 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-08 10:32:50,175 INFO L290 TraceCheckUtils]: 105: Hoare triple {10051#false} assume !!(~c~0 < 6); {10051#false} is VALID [2022-04-08 10:32:50,176 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-08 10:32:50,176 INFO L290 TraceCheckUtils]: 103: Hoare triple {10051#false} assume !!(~c~0 < 6); {10051#false} is VALID [2022-04-08 10:32:50,176 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-08 10:32:50,176 INFO L290 TraceCheckUtils]: 101: Hoare triple {10051#false} assume !!(~c~0 < 6); {10051#false} is VALID [2022-04-08 10:32:50,176 INFO L290 TraceCheckUtils]: 100: Hoare triple {10051#false} assume !!(~b~0 < 6);~c~0 := 0; {10051#false} is VALID [2022-04-08 10:32:50,176 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-08 10:32:50,176 INFO L290 TraceCheckUtils]: 98: Hoare triple {10051#false} assume !(~c~0 < 6); {10051#false} is VALID [2022-04-08 10:32:50,176 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-08 10:32:50,176 INFO L290 TraceCheckUtils]: 96: Hoare triple {10051#false} assume !!(~c~0 < 6); {10051#false} is VALID [2022-04-08 10:32:50,176 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-08 10:32:50,176 INFO L290 TraceCheckUtils]: 94: Hoare triple {10051#false} assume !!(~c~0 < 6); {10051#false} is VALID [2022-04-08 10:32:50,176 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-08 10:32:50,176 INFO L290 TraceCheckUtils]: 92: Hoare triple {10051#false} assume !!(~c~0 < 6); {10051#false} is VALID [2022-04-08 10:32:50,176 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-08 10:32:50,176 INFO L290 TraceCheckUtils]: 90: Hoare triple {10051#false} assume !!(~c~0 < 6); {10051#false} is VALID [2022-04-08 10:32:50,176 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-08 10:32:50,176 INFO L290 TraceCheckUtils]: 88: Hoare triple {10051#false} assume !!(~c~0 < 6); {10051#false} is VALID [2022-04-08 10:32:50,176 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-08 10:32:50,176 INFO L290 TraceCheckUtils]: 86: Hoare triple {10051#false} assume !!(~c~0 < 6); {10051#false} is VALID [2022-04-08 10:32:50,176 INFO L290 TraceCheckUtils]: 85: Hoare triple {10051#false} assume !!(~b~0 < 6);~c~0 := 0; {10051#false} is VALID [2022-04-08 10:32:50,177 INFO L290 TraceCheckUtils]: 84: Hoare triple {10051#false} assume !!(~a~0 < 6);~b~0 := 0; {10051#false} is VALID [2022-04-08 10:32:50,177 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-08 10:32:50,177 INFO L290 TraceCheckUtils]: 82: Hoare triple {10060#(<= main_~b~0 5)} assume !(~b~0 < 6); {10051#false} is VALID [2022-04-08 10:32:50,177 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-08 10:32:50,178 INFO L290 TraceCheckUtils]: 80: Hoare triple {10059#(<= main_~b~0 4)} assume !(~c~0 < 6); {10059#(<= main_~b~0 4)} is VALID [2022-04-08 10:32:50,178 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-08 10:32:50,178 INFO L290 TraceCheckUtils]: 78: Hoare triple {10059#(<= main_~b~0 4)} assume !!(~c~0 < 6); {10059#(<= main_~b~0 4)} is VALID [2022-04-08 10:32:50,178 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-08 10:32:50,178 INFO L290 TraceCheckUtils]: 76: Hoare triple {10059#(<= main_~b~0 4)} assume !!(~c~0 < 6); {10059#(<= main_~b~0 4)} is VALID [2022-04-08 10:32:50,179 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-08 10:32:50,179 INFO L290 TraceCheckUtils]: 74: Hoare triple {10059#(<= main_~b~0 4)} assume !!(~c~0 < 6); {10059#(<= main_~b~0 4)} is VALID [2022-04-08 10:32:50,180 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-08 10:32:50,180 INFO L290 TraceCheckUtils]: 72: Hoare triple {10059#(<= main_~b~0 4)} assume !!(~c~0 < 6); {10059#(<= main_~b~0 4)} is VALID [2022-04-08 10:32:50,180 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-08 10:32:50,180 INFO L290 TraceCheckUtils]: 70: Hoare triple {10059#(<= main_~b~0 4)} assume !!(~c~0 < 6); {10059#(<= main_~b~0 4)} is VALID [2022-04-08 10:32:50,180 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-08 10:32:50,181 INFO L290 TraceCheckUtils]: 68: Hoare triple {10059#(<= main_~b~0 4)} assume !!(~c~0 < 6); {10059#(<= main_~b~0 4)} is VALID [2022-04-08 10:32:50,181 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-08 10:32:50,181 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-08 10:32:50,182 INFO L290 TraceCheckUtils]: 65: Hoare triple {10058#(<= main_~b~0 3)} assume !(~c~0 < 6); {10058#(<= main_~b~0 3)} is VALID [2022-04-08 10:32:50,182 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-08 10:32:50,182 INFO L290 TraceCheckUtils]: 63: Hoare triple {10058#(<= main_~b~0 3)} assume !!(~c~0 < 6); {10058#(<= main_~b~0 3)} is VALID [2022-04-08 10:32:50,182 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-08 10:32:50,182 INFO L290 TraceCheckUtils]: 61: Hoare triple {10058#(<= main_~b~0 3)} assume !!(~c~0 < 6); {10058#(<= main_~b~0 3)} is VALID [2022-04-08 10:32:50,183 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-08 10:32:50,183 INFO L290 TraceCheckUtils]: 59: Hoare triple {10058#(<= main_~b~0 3)} assume !!(~c~0 < 6); {10058#(<= main_~b~0 3)} is VALID [2022-04-08 10:32:50,183 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-08 10:32:50,183 INFO L290 TraceCheckUtils]: 57: Hoare triple {10058#(<= main_~b~0 3)} assume !!(~c~0 < 6); {10058#(<= main_~b~0 3)} is VALID [2022-04-08 10:32:50,184 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-08 10:32:50,184 INFO L290 TraceCheckUtils]: 55: Hoare triple {10058#(<= main_~b~0 3)} assume !!(~c~0 < 6); {10058#(<= main_~b~0 3)} is VALID [2022-04-08 10:32:50,184 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-08 10:32:50,184 INFO L290 TraceCheckUtils]: 53: Hoare triple {10058#(<= main_~b~0 3)} assume !!(~c~0 < 6); {10058#(<= main_~b~0 3)} is VALID [2022-04-08 10:32:50,185 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-08 10:32:50,185 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-08 10:32:50,185 INFO L290 TraceCheckUtils]: 50: Hoare triple {10057#(<= main_~b~0 2)} assume !(~c~0 < 6); {10057#(<= main_~b~0 2)} is VALID [2022-04-08 10:32:50,185 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-08 10:32:50,186 INFO L290 TraceCheckUtils]: 48: Hoare triple {10057#(<= main_~b~0 2)} assume !!(~c~0 < 6); {10057#(<= main_~b~0 2)} is VALID [2022-04-08 10:32:50,186 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-08 10:32:50,186 INFO L290 TraceCheckUtils]: 46: Hoare triple {10057#(<= main_~b~0 2)} assume !!(~c~0 < 6); {10057#(<= main_~b~0 2)} is VALID [2022-04-08 10:32:50,186 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-08 10:32:50,187 INFO L290 TraceCheckUtils]: 44: Hoare triple {10057#(<= main_~b~0 2)} assume !!(~c~0 < 6); {10057#(<= main_~b~0 2)} is VALID [2022-04-08 10:32:50,187 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-08 10:32:50,187 INFO L290 TraceCheckUtils]: 42: Hoare triple {10057#(<= main_~b~0 2)} assume !!(~c~0 < 6); {10057#(<= main_~b~0 2)} is VALID [2022-04-08 10:32:50,187 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-08 10:32:50,187 INFO L290 TraceCheckUtils]: 40: Hoare triple {10057#(<= main_~b~0 2)} assume !!(~c~0 < 6); {10057#(<= main_~b~0 2)} is VALID [2022-04-08 10:32:50,188 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-08 10:32:50,188 INFO L290 TraceCheckUtils]: 38: Hoare triple {10057#(<= main_~b~0 2)} assume !!(~c~0 < 6); {10057#(<= main_~b~0 2)} is VALID [2022-04-08 10:32:50,188 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-08 10:32:50,189 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-08 10:32:50,189 INFO L290 TraceCheckUtils]: 35: Hoare triple {10056#(<= main_~b~0 1)} assume !(~c~0 < 6); {10056#(<= main_~b~0 1)} is VALID [2022-04-08 10:32:50,189 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-08 10:32:50,189 INFO L290 TraceCheckUtils]: 33: Hoare triple {10056#(<= main_~b~0 1)} assume !!(~c~0 < 6); {10056#(<= main_~b~0 1)} is VALID [2022-04-08 10:32:50,189 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-08 10:32:50,190 INFO L290 TraceCheckUtils]: 31: Hoare triple {10056#(<= main_~b~0 1)} assume !!(~c~0 < 6); {10056#(<= main_~b~0 1)} is VALID [2022-04-08 10:32:50,190 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-08 10:32:50,190 INFO L290 TraceCheckUtils]: 29: Hoare triple {10056#(<= main_~b~0 1)} assume !!(~c~0 < 6); {10056#(<= main_~b~0 1)} is VALID [2022-04-08 10:32:50,190 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-08 10:32:50,191 INFO L290 TraceCheckUtils]: 27: Hoare triple {10056#(<= main_~b~0 1)} assume !!(~c~0 < 6); {10056#(<= main_~b~0 1)} is VALID [2022-04-08 10:32:50,191 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-08 10:32:50,191 INFO L290 TraceCheckUtils]: 25: Hoare triple {10056#(<= main_~b~0 1)} assume !!(~c~0 < 6); {10056#(<= main_~b~0 1)} is VALID [2022-04-08 10:32:50,191 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-08 10:32:50,198 INFO L290 TraceCheckUtils]: 23: Hoare triple {10056#(<= main_~b~0 1)} assume !!(~c~0 < 6); {10056#(<= main_~b~0 1)} is VALID [2022-04-08 10:32:50,199 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-08 10:32:50,199 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-08 10:32:50,199 INFO L290 TraceCheckUtils]: 20: Hoare triple {10083#(<= main_~b~0 0)} assume !(~c~0 < 6); {10083#(<= main_~b~0 0)} is VALID [2022-04-08 10:32:50,199 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-08 10:32:50,200 INFO L290 TraceCheckUtils]: 18: Hoare triple {10083#(<= main_~b~0 0)} assume !!(~c~0 < 6); {10083#(<= main_~b~0 0)} is VALID [2022-04-08 10:32:50,200 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-08 10:32:50,200 INFO L290 TraceCheckUtils]: 16: Hoare triple {10083#(<= main_~b~0 0)} assume !!(~c~0 < 6); {10083#(<= main_~b~0 0)} is VALID [2022-04-08 10:32:50,200 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-08 10:32:50,201 INFO L290 TraceCheckUtils]: 14: Hoare triple {10083#(<= main_~b~0 0)} assume !!(~c~0 < 6); {10083#(<= main_~b~0 0)} is VALID [2022-04-08 10:32:50,201 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-08 10:32:50,201 INFO L290 TraceCheckUtils]: 12: Hoare triple {10083#(<= main_~b~0 0)} assume !!(~c~0 < 6); {10083#(<= main_~b~0 0)} is VALID [2022-04-08 10:32:50,201 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-08 10:32:50,202 INFO L290 TraceCheckUtils]: 10: Hoare triple {10083#(<= main_~b~0 0)} assume !!(~c~0 < 6); {10083#(<= main_~b~0 0)} is VALID [2022-04-08 10:32:50,202 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-08 10:32:50,202 INFO L290 TraceCheckUtils]: 8: Hoare triple {10083#(<= main_~b~0 0)} assume !!(~c~0 < 6); {10083#(<= main_~b~0 0)} is VALID [2022-04-08 10:32:50,202 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-08 10:32:50,202 INFO L290 TraceCheckUtils]: 6: Hoare triple {10050#true} assume !!(~a~0 < 6);~b~0 := 0; {10083#(<= main_~b~0 0)} is VALID [2022-04-08 10:32:50,203 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-08 10:32:50,203 INFO L272 TraceCheckUtils]: 4: Hoare triple {10050#true} call #t~ret7 := main(); {10050#true} is VALID [2022-04-08 10:32:50,203 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10050#true} {10050#true} #56#return; {10050#true} is VALID [2022-04-08 10:32:50,203 INFO L290 TraceCheckUtils]: 2: Hoare triple {10050#true} assume true; {10050#true} is VALID [2022-04-08 10:32:50,203 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-08 10:32:50,203 INFO L272 TraceCheckUtils]: 0: Hoare triple {10050#true} call ULTIMATE.init(); {10050#true} is VALID [2022-04-08 10:32:50,204 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-08 10:32:50,204 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1566761583] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:32:50,204 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:32:50,205 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 10 [2022-04-08 10:32:50,205 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:32:50,205 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1447258782] [2022-04-08 10:32:50,205 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1447258782] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:32:50,205 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:32:50,205 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-08 10:32:50,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1468786544] [2022-04-08 10:32:50,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:32:50,205 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-08 10:32:50,206 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:32:50,206 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-08 10:32:50,236 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-08 10:32:50,236 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-08 10:32:50,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:32:50,236 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-08 10:32:50,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2022-04-08 10:32:50,236 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-08 10:32:50,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:32:50,672 INFO L93 Difference]: Finished difference Result 279 states and 301 transitions. [2022-04-08 10:32:50,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-08 10:32:50,672 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-08 10:32:50,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:32:50,673 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-08 10:32:50,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 55 transitions. [2022-04-08 10:32:50,673 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-08 10:32:50,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 55 transitions. [2022-04-08 10:32:50,674 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 55 transitions. [2022-04-08 10:32:50,712 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-08 10:32:50,714 INFO L225 Difference]: With dead ends: 279 [2022-04-08 10:32:50,715 INFO L226 Difference]: Without dead ends: 196 [2022-04-08 10:32:50,717 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-08 10:32:50,718 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-08 10:32:50,718 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-08 10:32:50,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2022-04-08 10:32:51,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 196. [2022-04-08 10:32:51,049 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:32:51,049 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-08 10:32:51,050 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-08 10:32:51,050 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-08 10:32:51,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:32:51,052 INFO L93 Difference]: Finished difference Result 196 states and 210 transitions. [2022-04-08 10:32:51,052 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 210 transitions. [2022-04-08 10:32:51,053 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:32:51,053 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:32:51,053 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-08 10:32:51,053 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-08 10:32:51,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:32:51,056 INFO L93 Difference]: Finished difference Result 196 states and 210 transitions. [2022-04-08 10:32:51,056 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 210 transitions. [2022-04-08 10:32:51,056 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:32:51,056 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:32:51,056 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:32:51,056 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:32:51,056 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-08 10:32:51,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 210 transitions. [2022-04-08 10:32:51,059 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 210 transitions. Word has length 165 [2022-04-08 10:32:51,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:32:51,059 INFO L478 AbstractCegarLoop]: Abstraction has 196 states and 210 transitions. [2022-04-08 10:32:51,059 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-08 10:32:51,059 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 196 states and 210 transitions. [2022-04-08 10:32:51,265 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-08 10:32:51,265 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 210 transitions. [2022-04-08 10:32:51,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2022-04-08 10:32:51,266 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:32:51,266 INFO L499 BasicCegarLoop]: trace histogram [72, 72, 12, 12, 12, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:32:51,282 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-08 10:32:51,475 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,SelfDestructingSolverStorable14 [2022-04-08 10:32:51,475 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:32:51,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:32:51,476 INFO L85 PathProgramCache]: Analyzing trace with hash 1201246079, now seen corresponding path program 23 times [2022-04-08 10:32:51,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:32:51,476 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [181330687] [2022-04-08 10:32:51,670 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:32:51,788 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:32:51,788 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:32:51,788 INFO L85 PathProgramCache]: Analyzing trace with hash 1201246079, now seen corresponding path program 24 times [2022-04-08 10:32:51,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:32:51,788 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1410121688] [2022-04-08 10:32:51,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:32:51,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:32:51,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:32:51,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:32:51,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:32:51,882 INFO L290 TraceCheckUtils]: 0: Hoare triple {12414#(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-08 10:32:51,883 INFO L290 TraceCheckUtils]: 1: Hoare triple {12406#true} assume true; {12406#true} is VALID [2022-04-08 10:32:51,883 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {12406#true} {12406#true} #56#return; {12406#true} is VALID [2022-04-08 10:32:51,883 INFO L272 TraceCheckUtils]: 0: Hoare triple {12406#true} call ULTIMATE.init(); {12414#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:32:51,883 INFO L290 TraceCheckUtils]: 1: Hoare triple {12414#(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-08 10:32:51,883 INFO L290 TraceCheckUtils]: 2: Hoare triple {12406#true} assume true; {12406#true} is VALID [2022-04-08 10:32:51,883 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12406#true} {12406#true} #56#return; {12406#true} is VALID [2022-04-08 10:32:51,883 INFO L272 TraceCheckUtils]: 4: Hoare triple {12406#true} call #t~ret7 := main(); {12406#true} is VALID [2022-04-08 10:32:51,883 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-08 10:32:51,884 INFO L290 TraceCheckUtils]: 6: Hoare triple {12411#(= main_~a~0 0)} assume !!(~a~0 < 6);~b~0 := 0; {12411#(= main_~a~0 0)} is VALID [2022-04-08 10:32:51,884 INFO L290 TraceCheckUtils]: 7: Hoare triple {12411#(= main_~a~0 0)} assume !!(~b~0 < 6);~c~0 := 0; {12411#(= main_~a~0 0)} is VALID [2022-04-08 10:32:51,884 INFO L290 TraceCheckUtils]: 8: Hoare triple {12411#(= main_~a~0 0)} assume !!(~c~0 < 6); {12411#(= main_~a~0 0)} is VALID [2022-04-08 10:32:51,884 INFO L290 TraceCheckUtils]: 9: Hoare triple {12411#(= main_~a~0 0)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {12411#(= main_~a~0 0)} is VALID [2022-04-08 10:32:51,885 INFO L290 TraceCheckUtils]: 10: Hoare triple {12411#(= main_~a~0 0)} assume !!(~c~0 < 6); {12411#(= main_~a~0 0)} is VALID [2022-04-08 10:32:51,885 INFO L290 TraceCheckUtils]: 11: Hoare triple {12411#(= main_~a~0 0)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {12411#(= main_~a~0 0)} is VALID [2022-04-08 10:32:51,885 INFO L290 TraceCheckUtils]: 12: Hoare triple {12411#(= main_~a~0 0)} assume !!(~c~0 < 6); {12411#(= main_~a~0 0)} is VALID [2022-04-08 10:32:51,885 INFO L290 TraceCheckUtils]: 13: Hoare triple {12411#(= main_~a~0 0)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {12411#(= main_~a~0 0)} is VALID [2022-04-08 10:32:51,885 INFO L290 TraceCheckUtils]: 14: Hoare triple {12411#(= main_~a~0 0)} assume !!(~c~0 < 6); {12411#(= main_~a~0 0)} is VALID [2022-04-08 10:32:51,886 INFO L290 TraceCheckUtils]: 15: Hoare triple {12411#(= main_~a~0 0)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {12411#(= main_~a~0 0)} is VALID [2022-04-08 10:32:51,886 INFO L290 TraceCheckUtils]: 16: Hoare triple {12411#(= main_~a~0 0)} assume !!(~c~0 < 6); {12411#(= main_~a~0 0)} is VALID [2022-04-08 10:32:51,886 INFO L290 TraceCheckUtils]: 17: Hoare triple {12411#(= main_~a~0 0)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {12411#(= main_~a~0 0)} is VALID [2022-04-08 10:32:51,886 INFO L290 TraceCheckUtils]: 18: Hoare triple {12411#(= main_~a~0 0)} assume !!(~c~0 < 6); {12411#(= main_~a~0 0)} is VALID [2022-04-08 10:32:51,887 INFO L290 TraceCheckUtils]: 19: Hoare triple {12411#(= main_~a~0 0)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {12411#(= main_~a~0 0)} is VALID [2022-04-08 10:32:51,887 INFO L290 TraceCheckUtils]: 20: Hoare triple {12411#(= main_~a~0 0)} assume !(~c~0 < 6); {12411#(= main_~a~0 0)} is VALID [2022-04-08 10:32:51,887 INFO L290 TraceCheckUtils]: 21: Hoare triple {12411#(= main_~a~0 0)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {12411#(= main_~a~0 0)} is VALID [2022-04-08 10:32:51,887 INFO L290 TraceCheckUtils]: 22: Hoare triple {12411#(= main_~a~0 0)} assume !!(~b~0 < 6);~c~0 := 0; {12411#(= main_~a~0 0)} is VALID [2022-04-08 10:32:51,887 INFO L290 TraceCheckUtils]: 23: Hoare triple {12411#(= main_~a~0 0)} assume !!(~c~0 < 6); {12411#(= main_~a~0 0)} is VALID [2022-04-08 10:32:51,888 INFO L290 TraceCheckUtils]: 24: Hoare triple {12411#(= main_~a~0 0)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {12411#(= main_~a~0 0)} is VALID [2022-04-08 10:32:51,888 INFO L290 TraceCheckUtils]: 25: Hoare triple {12411#(= main_~a~0 0)} assume !!(~c~0 < 6); {12411#(= main_~a~0 0)} is VALID [2022-04-08 10:32:51,888 INFO L290 TraceCheckUtils]: 26: Hoare triple {12411#(= main_~a~0 0)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {12411#(= main_~a~0 0)} is VALID [2022-04-08 10:32:51,888 INFO L290 TraceCheckUtils]: 27: Hoare triple {12411#(= main_~a~0 0)} assume !!(~c~0 < 6); {12411#(= main_~a~0 0)} is VALID [2022-04-08 10:32:51,889 INFO L290 TraceCheckUtils]: 28: Hoare triple {12411#(= main_~a~0 0)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {12411#(= main_~a~0 0)} is VALID [2022-04-08 10:32:51,889 INFO L290 TraceCheckUtils]: 29: Hoare triple {12411#(= main_~a~0 0)} assume !!(~c~0 < 6); {12411#(= main_~a~0 0)} is VALID [2022-04-08 10:32:51,889 INFO L290 TraceCheckUtils]: 30: Hoare triple {12411#(= main_~a~0 0)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {12411#(= main_~a~0 0)} is VALID [2022-04-08 10:32:51,889 INFO L290 TraceCheckUtils]: 31: Hoare triple {12411#(= main_~a~0 0)} assume !!(~c~0 < 6); {12411#(= main_~a~0 0)} is VALID [2022-04-08 10:32:51,889 INFO L290 TraceCheckUtils]: 32: Hoare triple {12411#(= main_~a~0 0)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {12411#(= main_~a~0 0)} is VALID [2022-04-08 10:32:51,890 INFO L290 TraceCheckUtils]: 33: Hoare triple {12411#(= main_~a~0 0)} assume !!(~c~0 < 6); {12411#(= main_~a~0 0)} is VALID [2022-04-08 10:32:51,890 INFO L290 TraceCheckUtils]: 34: Hoare triple {12411#(= main_~a~0 0)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {12411#(= main_~a~0 0)} is VALID [2022-04-08 10:32:51,890 INFO L290 TraceCheckUtils]: 35: Hoare triple {12411#(= main_~a~0 0)} assume !(~c~0 < 6); {12411#(= main_~a~0 0)} is VALID [2022-04-08 10:32:51,890 INFO L290 TraceCheckUtils]: 36: Hoare triple {12411#(= main_~a~0 0)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {12411#(= main_~a~0 0)} is VALID [2022-04-08 10:32:51,891 INFO L290 TraceCheckUtils]: 37: Hoare triple {12411#(= main_~a~0 0)} assume !!(~b~0 < 6);~c~0 := 0; {12411#(= main_~a~0 0)} is VALID [2022-04-08 10:32:51,891 INFO L290 TraceCheckUtils]: 38: Hoare triple {12411#(= main_~a~0 0)} assume !!(~c~0 < 6); {12411#(= main_~a~0 0)} is VALID [2022-04-08 10:32:51,891 INFO L290 TraceCheckUtils]: 39: Hoare triple {12411#(= main_~a~0 0)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {12411#(= main_~a~0 0)} is VALID [2022-04-08 10:32:51,891 INFO L290 TraceCheckUtils]: 40: Hoare triple {12411#(= main_~a~0 0)} assume !!(~c~0 < 6); {12411#(= main_~a~0 0)} is VALID [2022-04-08 10:32:51,891 INFO L290 TraceCheckUtils]: 41: Hoare triple {12411#(= main_~a~0 0)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {12411#(= main_~a~0 0)} is VALID [2022-04-08 10:32:51,892 INFO L290 TraceCheckUtils]: 42: Hoare triple {12411#(= main_~a~0 0)} assume !!(~c~0 < 6); {12411#(= main_~a~0 0)} is VALID [2022-04-08 10:32:51,892 INFO L290 TraceCheckUtils]: 43: Hoare triple {12411#(= main_~a~0 0)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {12411#(= main_~a~0 0)} is VALID [2022-04-08 10:32:51,892 INFO L290 TraceCheckUtils]: 44: Hoare triple {12411#(= main_~a~0 0)} assume !!(~c~0 < 6); {12411#(= main_~a~0 0)} is VALID [2022-04-08 10:32:51,892 INFO L290 TraceCheckUtils]: 45: Hoare triple {12411#(= main_~a~0 0)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {12411#(= main_~a~0 0)} is VALID [2022-04-08 10:32:51,892 INFO L290 TraceCheckUtils]: 46: Hoare triple {12411#(= main_~a~0 0)} assume !!(~c~0 < 6); {12411#(= main_~a~0 0)} is VALID [2022-04-08 10:32:51,893 INFO L290 TraceCheckUtils]: 47: Hoare triple {12411#(= main_~a~0 0)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {12411#(= main_~a~0 0)} is VALID [2022-04-08 10:32:51,893 INFO L290 TraceCheckUtils]: 48: Hoare triple {12411#(= main_~a~0 0)} assume !!(~c~0 < 6); {12411#(= main_~a~0 0)} is VALID [2022-04-08 10:32:51,893 INFO L290 TraceCheckUtils]: 49: Hoare triple {12411#(= main_~a~0 0)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {12411#(= main_~a~0 0)} is VALID [2022-04-08 10:32:51,893 INFO L290 TraceCheckUtils]: 50: Hoare triple {12411#(= main_~a~0 0)} assume !(~c~0 < 6); {12411#(= main_~a~0 0)} is VALID [2022-04-08 10:32:51,894 INFO L290 TraceCheckUtils]: 51: Hoare triple {12411#(= main_~a~0 0)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {12411#(= main_~a~0 0)} is VALID [2022-04-08 10:32:51,894 INFO L290 TraceCheckUtils]: 52: Hoare triple {12411#(= main_~a~0 0)} assume !!(~b~0 < 6);~c~0 := 0; {12411#(= main_~a~0 0)} is VALID [2022-04-08 10:32:51,894 INFO L290 TraceCheckUtils]: 53: Hoare triple {12411#(= main_~a~0 0)} assume !!(~c~0 < 6); {12411#(= main_~a~0 0)} is VALID [2022-04-08 10:32:51,894 INFO L290 TraceCheckUtils]: 54: Hoare triple {12411#(= main_~a~0 0)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {12411#(= main_~a~0 0)} is VALID [2022-04-08 10:32:51,894 INFO L290 TraceCheckUtils]: 55: Hoare triple {12411#(= main_~a~0 0)} assume !!(~c~0 < 6); {12411#(= main_~a~0 0)} is VALID [2022-04-08 10:32:51,895 INFO L290 TraceCheckUtils]: 56: Hoare triple {12411#(= main_~a~0 0)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {12411#(= main_~a~0 0)} is VALID [2022-04-08 10:32:51,895 INFO L290 TraceCheckUtils]: 57: Hoare triple {12411#(= main_~a~0 0)} assume !!(~c~0 < 6); {12411#(= main_~a~0 0)} is VALID [2022-04-08 10:32:51,895 INFO L290 TraceCheckUtils]: 58: Hoare triple {12411#(= main_~a~0 0)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {12411#(= main_~a~0 0)} is VALID [2022-04-08 10:32:51,895 INFO L290 TraceCheckUtils]: 59: Hoare triple {12411#(= main_~a~0 0)} assume !!(~c~0 < 6); {12411#(= main_~a~0 0)} is VALID [2022-04-08 10:32:51,896 INFO L290 TraceCheckUtils]: 60: Hoare triple {12411#(= main_~a~0 0)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {12411#(= main_~a~0 0)} is VALID [2022-04-08 10:32:51,896 INFO L290 TraceCheckUtils]: 61: Hoare triple {12411#(= main_~a~0 0)} assume !!(~c~0 < 6); {12411#(= main_~a~0 0)} is VALID [2022-04-08 10:32:51,896 INFO L290 TraceCheckUtils]: 62: Hoare triple {12411#(= main_~a~0 0)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {12411#(= main_~a~0 0)} is VALID [2022-04-08 10:32:51,896 INFO L290 TraceCheckUtils]: 63: Hoare triple {12411#(= main_~a~0 0)} assume !!(~c~0 < 6); {12411#(= main_~a~0 0)} is VALID [2022-04-08 10:32:51,896 INFO L290 TraceCheckUtils]: 64: Hoare triple {12411#(= main_~a~0 0)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {12411#(= main_~a~0 0)} is VALID [2022-04-08 10:32:51,897 INFO L290 TraceCheckUtils]: 65: Hoare triple {12411#(= main_~a~0 0)} assume !(~c~0 < 6); {12411#(= main_~a~0 0)} is VALID [2022-04-08 10:32:51,897 INFO L290 TraceCheckUtils]: 66: Hoare triple {12411#(= main_~a~0 0)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {12411#(= main_~a~0 0)} is VALID [2022-04-08 10:32:51,897 INFO L290 TraceCheckUtils]: 67: Hoare triple {12411#(= main_~a~0 0)} assume !!(~b~0 < 6);~c~0 := 0; {12411#(= main_~a~0 0)} is VALID [2022-04-08 10:32:51,897 INFO L290 TraceCheckUtils]: 68: Hoare triple {12411#(= main_~a~0 0)} assume !!(~c~0 < 6); {12411#(= main_~a~0 0)} is VALID [2022-04-08 10:32:51,897 INFO L290 TraceCheckUtils]: 69: Hoare triple {12411#(= main_~a~0 0)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {12411#(= main_~a~0 0)} is VALID [2022-04-08 10:32:51,898 INFO L290 TraceCheckUtils]: 70: Hoare triple {12411#(= main_~a~0 0)} assume !!(~c~0 < 6); {12411#(= main_~a~0 0)} is VALID [2022-04-08 10:32:51,898 INFO L290 TraceCheckUtils]: 71: Hoare triple {12411#(= main_~a~0 0)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {12411#(= main_~a~0 0)} is VALID [2022-04-08 10:32:51,898 INFO L290 TraceCheckUtils]: 72: Hoare triple {12411#(= main_~a~0 0)} assume !!(~c~0 < 6); {12411#(= main_~a~0 0)} is VALID [2022-04-08 10:32:51,898 INFO L290 TraceCheckUtils]: 73: Hoare triple {12411#(= main_~a~0 0)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {12411#(= main_~a~0 0)} is VALID [2022-04-08 10:32:51,899 INFO L290 TraceCheckUtils]: 74: Hoare triple {12411#(= main_~a~0 0)} assume !!(~c~0 < 6); {12411#(= main_~a~0 0)} is VALID [2022-04-08 10:32:51,899 INFO L290 TraceCheckUtils]: 75: Hoare triple {12411#(= main_~a~0 0)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {12411#(= main_~a~0 0)} is VALID [2022-04-08 10:32:51,899 INFO L290 TraceCheckUtils]: 76: Hoare triple {12411#(= main_~a~0 0)} assume !!(~c~0 < 6); {12411#(= main_~a~0 0)} is VALID [2022-04-08 10:32:51,899 INFO L290 TraceCheckUtils]: 77: Hoare triple {12411#(= main_~a~0 0)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {12411#(= main_~a~0 0)} is VALID [2022-04-08 10:32:51,900 INFO L290 TraceCheckUtils]: 78: Hoare triple {12411#(= main_~a~0 0)} assume !!(~c~0 < 6); {12411#(= main_~a~0 0)} is VALID [2022-04-08 10:32:51,900 INFO L290 TraceCheckUtils]: 79: Hoare triple {12411#(= main_~a~0 0)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {12411#(= main_~a~0 0)} is VALID [2022-04-08 10:32:51,900 INFO L290 TraceCheckUtils]: 80: Hoare triple {12411#(= main_~a~0 0)} assume !(~c~0 < 6); {12411#(= main_~a~0 0)} is VALID [2022-04-08 10:32:51,900 INFO L290 TraceCheckUtils]: 81: Hoare triple {12411#(= main_~a~0 0)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {12411#(= main_~a~0 0)} is VALID [2022-04-08 10:32:51,900 INFO L290 TraceCheckUtils]: 82: Hoare triple {12411#(= main_~a~0 0)} assume !!(~b~0 < 6);~c~0 := 0; {12411#(= main_~a~0 0)} is VALID [2022-04-08 10:32:51,901 INFO L290 TraceCheckUtils]: 83: Hoare triple {12411#(= main_~a~0 0)} assume !!(~c~0 < 6); {12411#(= main_~a~0 0)} is VALID [2022-04-08 10:32:51,901 INFO L290 TraceCheckUtils]: 84: Hoare triple {12411#(= main_~a~0 0)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {12411#(= main_~a~0 0)} is VALID [2022-04-08 10:32:51,901 INFO L290 TraceCheckUtils]: 85: Hoare triple {12411#(= main_~a~0 0)} assume !!(~c~0 < 6); {12411#(= main_~a~0 0)} is VALID [2022-04-08 10:32:51,901 INFO L290 TraceCheckUtils]: 86: Hoare triple {12411#(= main_~a~0 0)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {12411#(= main_~a~0 0)} is VALID [2022-04-08 10:32:51,901 INFO L290 TraceCheckUtils]: 87: Hoare triple {12411#(= main_~a~0 0)} assume !!(~c~0 < 6); {12411#(= main_~a~0 0)} is VALID [2022-04-08 10:32:51,902 INFO L290 TraceCheckUtils]: 88: Hoare triple {12411#(= main_~a~0 0)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {12411#(= main_~a~0 0)} is VALID [2022-04-08 10:32:51,902 INFO L290 TraceCheckUtils]: 89: Hoare triple {12411#(= main_~a~0 0)} assume !!(~c~0 < 6); {12411#(= main_~a~0 0)} is VALID [2022-04-08 10:32:51,902 INFO L290 TraceCheckUtils]: 90: Hoare triple {12411#(= main_~a~0 0)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {12411#(= main_~a~0 0)} is VALID [2022-04-08 10:32:51,902 INFO L290 TraceCheckUtils]: 91: Hoare triple {12411#(= main_~a~0 0)} assume !!(~c~0 < 6); {12411#(= main_~a~0 0)} is VALID [2022-04-08 10:32:51,903 INFO L290 TraceCheckUtils]: 92: Hoare triple {12411#(= main_~a~0 0)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {12411#(= main_~a~0 0)} is VALID [2022-04-08 10:32:51,903 INFO L290 TraceCheckUtils]: 93: Hoare triple {12411#(= main_~a~0 0)} assume !!(~c~0 < 6); {12411#(= main_~a~0 0)} is VALID [2022-04-08 10:32:51,903 INFO L290 TraceCheckUtils]: 94: Hoare triple {12411#(= main_~a~0 0)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {12411#(= main_~a~0 0)} is VALID [2022-04-08 10:32:51,903 INFO L290 TraceCheckUtils]: 95: Hoare triple {12411#(= main_~a~0 0)} assume !(~c~0 < 6); {12411#(= main_~a~0 0)} is VALID [2022-04-08 10:32:51,903 INFO L290 TraceCheckUtils]: 96: Hoare triple {12411#(= main_~a~0 0)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {12411#(= main_~a~0 0)} is VALID [2022-04-08 10:32:51,904 INFO L290 TraceCheckUtils]: 97: Hoare triple {12411#(= main_~a~0 0)} assume !(~b~0 < 6); {12411#(= main_~a~0 0)} is VALID [2022-04-08 10:32:51,904 INFO L290 TraceCheckUtils]: 98: Hoare triple {12411#(= main_~a~0 0)} #t~pre4 := 1 + ~a~0;~a~0 := 1 + ~a~0;havoc #t~pre4; {12412#(<= main_~a~0 1)} is VALID [2022-04-08 10:32:51,904 INFO L290 TraceCheckUtils]: 99: Hoare triple {12412#(<= main_~a~0 1)} assume !!(~a~0 < 6);~b~0 := 0; {12412#(<= main_~a~0 1)} is VALID [2022-04-08 10:32:51,904 INFO L290 TraceCheckUtils]: 100: Hoare triple {12412#(<= main_~a~0 1)} assume !!(~b~0 < 6);~c~0 := 0; {12412#(<= main_~a~0 1)} is VALID [2022-04-08 10:32:51,905 INFO L290 TraceCheckUtils]: 101: Hoare triple {12412#(<= main_~a~0 1)} assume !!(~c~0 < 6); {12412#(<= main_~a~0 1)} is VALID [2022-04-08 10:32:51,905 INFO L290 TraceCheckUtils]: 102: Hoare triple {12412#(<= main_~a~0 1)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {12412#(<= main_~a~0 1)} is VALID [2022-04-08 10:32:51,905 INFO L290 TraceCheckUtils]: 103: Hoare triple {12412#(<= main_~a~0 1)} assume !!(~c~0 < 6); {12412#(<= main_~a~0 1)} is VALID [2022-04-08 10:32:51,905 INFO L290 TraceCheckUtils]: 104: Hoare triple {12412#(<= main_~a~0 1)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {12412#(<= main_~a~0 1)} is VALID [2022-04-08 10:32:51,906 INFO L290 TraceCheckUtils]: 105: Hoare triple {12412#(<= main_~a~0 1)} assume !!(~c~0 < 6); {12412#(<= main_~a~0 1)} is VALID [2022-04-08 10:32:51,906 INFO L290 TraceCheckUtils]: 106: Hoare triple {12412#(<= main_~a~0 1)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {12412#(<= main_~a~0 1)} is VALID [2022-04-08 10:32:51,906 INFO L290 TraceCheckUtils]: 107: Hoare triple {12412#(<= main_~a~0 1)} assume !!(~c~0 < 6); {12412#(<= main_~a~0 1)} is VALID [2022-04-08 10:32:51,906 INFO L290 TraceCheckUtils]: 108: Hoare triple {12412#(<= main_~a~0 1)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {12412#(<= main_~a~0 1)} is VALID [2022-04-08 10:32:51,906 INFO L290 TraceCheckUtils]: 109: Hoare triple {12412#(<= main_~a~0 1)} assume !!(~c~0 < 6); {12412#(<= main_~a~0 1)} is VALID [2022-04-08 10:32:51,907 INFO L290 TraceCheckUtils]: 110: Hoare triple {12412#(<= main_~a~0 1)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {12412#(<= main_~a~0 1)} is VALID [2022-04-08 10:32:51,907 INFO L290 TraceCheckUtils]: 111: Hoare triple {12412#(<= main_~a~0 1)} assume !!(~c~0 < 6); {12412#(<= main_~a~0 1)} is VALID [2022-04-08 10:32:51,907 INFO L290 TraceCheckUtils]: 112: Hoare triple {12412#(<= main_~a~0 1)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {12412#(<= main_~a~0 1)} is VALID [2022-04-08 10:32:51,907 INFO L290 TraceCheckUtils]: 113: Hoare triple {12412#(<= main_~a~0 1)} assume !(~c~0 < 6); {12412#(<= main_~a~0 1)} is VALID [2022-04-08 10:32:51,908 INFO L290 TraceCheckUtils]: 114: Hoare triple {12412#(<= main_~a~0 1)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {12412#(<= main_~a~0 1)} is VALID [2022-04-08 10:32:51,908 INFO L290 TraceCheckUtils]: 115: Hoare triple {12412#(<= main_~a~0 1)} assume !!(~b~0 < 6);~c~0 := 0; {12412#(<= main_~a~0 1)} is VALID [2022-04-08 10:32:51,908 INFO L290 TraceCheckUtils]: 116: Hoare triple {12412#(<= main_~a~0 1)} assume !!(~c~0 < 6); {12412#(<= main_~a~0 1)} is VALID [2022-04-08 10:32:51,908 INFO L290 TraceCheckUtils]: 117: Hoare triple {12412#(<= main_~a~0 1)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {12412#(<= main_~a~0 1)} is VALID [2022-04-08 10:32:51,908 INFO L290 TraceCheckUtils]: 118: Hoare triple {12412#(<= main_~a~0 1)} assume !!(~c~0 < 6); {12412#(<= main_~a~0 1)} is VALID [2022-04-08 10:32:51,909 INFO L290 TraceCheckUtils]: 119: Hoare triple {12412#(<= main_~a~0 1)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {12412#(<= main_~a~0 1)} is VALID [2022-04-08 10:32:51,909 INFO L290 TraceCheckUtils]: 120: Hoare triple {12412#(<= main_~a~0 1)} assume !!(~c~0 < 6); {12412#(<= main_~a~0 1)} is VALID [2022-04-08 10:32:51,909 INFO L290 TraceCheckUtils]: 121: Hoare triple {12412#(<= main_~a~0 1)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {12412#(<= main_~a~0 1)} is VALID [2022-04-08 10:32:51,909 INFO L290 TraceCheckUtils]: 122: Hoare triple {12412#(<= main_~a~0 1)} assume !!(~c~0 < 6); {12412#(<= main_~a~0 1)} is VALID [2022-04-08 10:32:51,909 INFO L290 TraceCheckUtils]: 123: Hoare triple {12412#(<= main_~a~0 1)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {12412#(<= main_~a~0 1)} is VALID [2022-04-08 10:32:51,910 INFO L290 TraceCheckUtils]: 124: Hoare triple {12412#(<= main_~a~0 1)} assume !!(~c~0 < 6); {12412#(<= main_~a~0 1)} is VALID [2022-04-08 10:32:51,910 INFO L290 TraceCheckUtils]: 125: Hoare triple {12412#(<= main_~a~0 1)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {12412#(<= main_~a~0 1)} is VALID [2022-04-08 10:32:51,910 INFO L290 TraceCheckUtils]: 126: Hoare triple {12412#(<= main_~a~0 1)} assume !!(~c~0 < 6); {12412#(<= main_~a~0 1)} is VALID [2022-04-08 10:32:51,910 INFO L290 TraceCheckUtils]: 127: Hoare triple {12412#(<= main_~a~0 1)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {12412#(<= main_~a~0 1)} is VALID [2022-04-08 10:32:51,911 INFO L290 TraceCheckUtils]: 128: Hoare triple {12412#(<= main_~a~0 1)} assume !(~c~0 < 6); {12412#(<= main_~a~0 1)} is VALID [2022-04-08 10:32:51,911 INFO L290 TraceCheckUtils]: 129: Hoare triple {12412#(<= main_~a~0 1)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {12412#(<= main_~a~0 1)} is VALID [2022-04-08 10:32:51,911 INFO L290 TraceCheckUtils]: 130: Hoare triple {12412#(<= main_~a~0 1)} assume !!(~b~0 < 6);~c~0 := 0; {12412#(<= main_~a~0 1)} is VALID [2022-04-08 10:32:51,911 INFO L290 TraceCheckUtils]: 131: Hoare triple {12412#(<= main_~a~0 1)} assume !!(~c~0 < 6); {12412#(<= main_~a~0 1)} is VALID [2022-04-08 10:32:51,911 INFO L290 TraceCheckUtils]: 132: Hoare triple {12412#(<= main_~a~0 1)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {12412#(<= main_~a~0 1)} is VALID [2022-04-08 10:32:51,912 INFO L290 TraceCheckUtils]: 133: Hoare triple {12412#(<= main_~a~0 1)} assume !!(~c~0 < 6); {12412#(<= main_~a~0 1)} is VALID [2022-04-08 10:32:51,912 INFO L290 TraceCheckUtils]: 134: Hoare triple {12412#(<= main_~a~0 1)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {12412#(<= main_~a~0 1)} is VALID [2022-04-08 10:32:51,912 INFO L290 TraceCheckUtils]: 135: Hoare triple {12412#(<= main_~a~0 1)} assume !!(~c~0 < 6); {12412#(<= main_~a~0 1)} is VALID [2022-04-08 10:32:51,912 INFO L290 TraceCheckUtils]: 136: Hoare triple {12412#(<= main_~a~0 1)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {12412#(<= main_~a~0 1)} is VALID [2022-04-08 10:32:51,913 INFO L290 TraceCheckUtils]: 137: Hoare triple {12412#(<= main_~a~0 1)} assume !!(~c~0 < 6); {12412#(<= main_~a~0 1)} is VALID [2022-04-08 10:32:51,913 INFO L290 TraceCheckUtils]: 138: Hoare triple {12412#(<= main_~a~0 1)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {12412#(<= main_~a~0 1)} is VALID [2022-04-08 10:32:51,913 INFO L290 TraceCheckUtils]: 139: Hoare triple {12412#(<= main_~a~0 1)} assume !!(~c~0 < 6); {12412#(<= main_~a~0 1)} is VALID [2022-04-08 10:32:51,913 INFO L290 TraceCheckUtils]: 140: Hoare triple {12412#(<= main_~a~0 1)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {12412#(<= main_~a~0 1)} is VALID [2022-04-08 10:32:51,913 INFO L290 TraceCheckUtils]: 141: Hoare triple {12412#(<= main_~a~0 1)} assume !!(~c~0 < 6); {12412#(<= main_~a~0 1)} is VALID [2022-04-08 10:32:51,914 INFO L290 TraceCheckUtils]: 142: Hoare triple {12412#(<= main_~a~0 1)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {12412#(<= main_~a~0 1)} is VALID [2022-04-08 10:32:51,914 INFO L290 TraceCheckUtils]: 143: Hoare triple {12412#(<= main_~a~0 1)} assume !(~c~0 < 6); {12412#(<= main_~a~0 1)} is VALID [2022-04-08 10:32:51,914 INFO L290 TraceCheckUtils]: 144: Hoare triple {12412#(<= main_~a~0 1)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {12412#(<= main_~a~0 1)} is VALID [2022-04-08 10:32:51,914 INFO L290 TraceCheckUtils]: 145: Hoare triple {12412#(<= main_~a~0 1)} assume !!(~b~0 < 6);~c~0 := 0; {12412#(<= main_~a~0 1)} is VALID [2022-04-08 10:32:51,915 INFO L290 TraceCheckUtils]: 146: Hoare triple {12412#(<= main_~a~0 1)} assume !!(~c~0 < 6); {12412#(<= main_~a~0 1)} is VALID [2022-04-08 10:32:51,915 INFO L290 TraceCheckUtils]: 147: Hoare triple {12412#(<= main_~a~0 1)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {12412#(<= main_~a~0 1)} is VALID [2022-04-08 10:32:51,915 INFO L290 TraceCheckUtils]: 148: Hoare triple {12412#(<= main_~a~0 1)} assume !!(~c~0 < 6); {12412#(<= main_~a~0 1)} is VALID [2022-04-08 10:32:51,915 INFO L290 TraceCheckUtils]: 149: Hoare triple {12412#(<= main_~a~0 1)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {12412#(<= main_~a~0 1)} is VALID [2022-04-08 10:32:51,915 INFO L290 TraceCheckUtils]: 150: Hoare triple {12412#(<= main_~a~0 1)} assume !!(~c~0 < 6); {12412#(<= main_~a~0 1)} is VALID [2022-04-08 10:32:51,916 INFO L290 TraceCheckUtils]: 151: Hoare triple {12412#(<= main_~a~0 1)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {12412#(<= main_~a~0 1)} is VALID [2022-04-08 10:32:51,916 INFO L290 TraceCheckUtils]: 152: Hoare triple {12412#(<= main_~a~0 1)} assume !!(~c~0 < 6); {12412#(<= main_~a~0 1)} is VALID [2022-04-08 10:32:51,916 INFO L290 TraceCheckUtils]: 153: Hoare triple {12412#(<= main_~a~0 1)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {12412#(<= main_~a~0 1)} is VALID [2022-04-08 10:32:51,916 INFO L290 TraceCheckUtils]: 154: Hoare triple {12412#(<= main_~a~0 1)} assume !!(~c~0 < 6); {12412#(<= main_~a~0 1)} is VALID [2022-04-08 10:32:51,917 INFO L290 TraceCheckUtils]: 155: Hoare triple {12412#(<= main_~a~0 1)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {12412#(<= main_~a~0 1)} is VALID [2022-04-08 10:32:51,917 INFO L290 TraceCheckUtils]: 156: Hoare triple {12412#(<= main_~a~0 1)} assume !!(~c~0 < 6); {12412#(<= main_~a~0 1)} is VALID [2022-04-08 10:32:51,917 INFO L290 TraceCheckUtils]: 157: Hoare triple {12412#(<= main_~a~0 1)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {12412#(<= main_~a~0 1)} is VALID [2022-04-08 10:32:51,917 INFO L290 TraceCheckUtils]: 158: Hoare triple {12412#(<= main_~a~0 1)} assume !(~c~0 < 6); {12412#(<= main_~a~0 1)} is VALID [2022-04-08 10:32:51,917 INFO L290 TraceCheckUtils]: 159: Hoare triple {12412#(<= main_~a~0 1)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {12412#(<= main_~a~0 1)} is VALID [2022-04-08 10:32:51,918 INFO L290 TraceCheckUtils]: 160: Hoare triple {12412#(<= main_~a~0 1)} assume !!(~b~0 < 6);~c~0 := 0; {12412#(<= main_~a~0 1)} is VALID [2022-04-08 10:32:51,918 INFO L290 TraceCheckUtils]: 161: Hoare triple {12412#(<= main_~a~0 1)} assume !!(~c~0 < 6); {12412#(<= main_~a~0 1)} is VALID [2022-04-08 10:32:51,918 INFO L290 TraceCheckUtils]: 162: Hoare triple {12412#(<= main_~a~0 1)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {12412#(<= main_~a~0 1)} is VALID [2022-04-08 10:32:51,918 INFO L290 TraceCheckUtils]: 163: Hoare triple {12412#(<= main_~a~0 1)} assume !!(~c~0 < 6); {12412#(<= main_~a~0 1)} is VALID [2022-04-08 10:32:51,918 INFO L290 TraceCheckUtils]: 164: Hoare triple {12412#(<= main_~a~0 1)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {12412#(<= main_~a~0 1)} is VALID [2022-04-08 10:32:51,919 INFO L290 TraceCheckUtils]: 165: Hoare triple {12412#(<= main_~a~0 1)} assume !!(~c~0 < 6); {12412#(<= main_~a~0 1)} is VALID [2022-04-08 10:32:51,919 INFO L290 TraceCheckUtils]: 166: Hoare triple {12412#(<= main_~a~0 1)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {12412#(<= main_~a~0 1)} is VALID [2022-04-08 10:32:51,919 INFO L290 TraceCheckUtils]: 167: Hoare triple {12412#(<= main_~a~0 1)} assume !!(~c~0 < 6); {12412#(<= main_~a~0 1)} is VALID [2022-04-08 10:32:51,919 INFO L290 TraceCheckUtils]: 168: Hoare triple {12412#(<= main_~a~0 1)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {12412#(<= main_~a~0 1)} is VALID [2022-04-08 10:32:51,920 INFO L290 TraceCheckUtils]: 169: Hoare triple {12412#(<= main_~a~0 1)} assume !!(~c~0 < 6); {12412#(<= main_~a~0 1)} is VALID [2022-04-08 10:32:51,920 INFO L290 TraceCheckUtils]: 170: Hoare triple {12412#(<= main_~a~0 1)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {12412#(<= main_~a~0 1)} is VALID [2022-04-08 10:32:51,920 INFO L290 TraceCheckUtils]: 171: Hoare triple {12412#(<= main_~a~0 1)} assume !!(~c~0 < 6); {12412#(<= main_~a~0 1)} is VALID [2022-04-08 10:32:51,920 INFO L290 TraceCheckUtils]: 172: Hoare triple {12412#(<= main_~a~0 1)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {12412#(<= main_~a~0 1)} is VALID [2022-04-08 10:32:51,920 INFO L290 TraceCheckUtils]: 173: Hoare triple {12412#(<= main_~a~0 1)} assume !(~c~0 < 6); {12412#(<= main_~a~0 1)} is VALID [2022-04-08 10:32:51,921 INFO L290 TraceCheckUtils]: 174: Hoare triple {12412#(<= main_~a~0 1)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {12412#(<= main_~a~0 1)} is VALID [2022-04-08 10:32:51,921 INFO L290 TraceCheckUtils]: 175: Hoare triple {12412#(<= main_~a~0 1)} assume !!(~b~0 < 6);~c~0 := 0; {12412#(<= main_~a~0 1)} is VALID [2022-04-08 10:32:51,921 INFO L290 TraceCheckUtils]: 176: Hoare triple {12412#(<= main_~a~0 1)} assume !!(~c~0 < 6); {12412#(<= main_~a~0 1)} is VALID [2022-04-08 10:32:51,921 INFO L290 TraceCheckUtils]: 177: Hoare triple {12412#(<= main_~a~0 1)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {12412#(<= main_~a~0 1)} is VALID [2022-04-08 10:32:51,922 INFO L290 TraceCheckUtils]: 178: Hoare triple {12412#(<= main_~a~0 1)} assume !!(~c~0 < 6); {12412#(<= main_~a~0 1)} is VALID [2022-04-08 10:32:51,922 INFO L290 TraceCheckUtils]: 179: Hoare triple {12412#(<= main_~a~0 1)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {12412#(<= main_~a~0 1)} is VALID [2022-04-08 10:32:51,922 INFO L290 TraceCheckUtils]: 180: Hoare triple {12412#(<= main_~a~0 1)} assume !!(~c~0 < 6); {12412#(<= main_~a~0 1)} is VALID [2022-04-08 10:32:51,922 INFO L290 TraceCheckUtils]: 181: Hoare triple {12412#(<= main_~a~0 1)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {12412#(<= main_~a~0 1)} is VALID [2022-04-08 10:32:51,922 INFO L290 TraceCheckUtils]: 182: Hoare triple {12412#(<= main_~a~0 1)} assume !!(~c~0 < 6); {12412#(<= main_~a~0 1)} is VALID [2022-04-08 10:32:51,923 INFO L290 TraceCheckUtils]: 183: Hoare triple {12412#(<= main_~a~0 1)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {12412#(<= main_~a~0 1)} is VALID [2022-04-08 10:32:51,923 INFO L290 TraceCheckUtils]: 184: Hoare triple {12412#(<= main_~a~0 1)} assume !!(~c~0 < 6); {12412#(<= main_~a~0 1)} is VALID [2022-04-08 10:32:51,923 INFO L290 TraceCheckUtils]: 185: Hoare triple {12412#(<= main_~a~0 1)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {12412#(<= main_~a~0 1)} is VALID [2022-04-08 10:32:51,923 INFO L290 TraceCheckUtils]: 186: Hoare triple {12412#(<= main_~a~0 1)} assume !!(~c~0 < 6); {12412#(<= main_~a~0 1)} is VALID [2022-04-08 10:32:51,924 INFO L290 TraceCheckUtils]: 187: Hoare triple {12412#(<= main_~a~0 1)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {12412#(<= main_~a~0 1)} is VALID [2022-04-08 10:32:51,924 INFO L290 TraceCheckUtils]: 188: Hoare triple {12412#(<= main_~a~0 1)} assume !(~c~0 < 6); {12412#(<= main_~a~0 1)} is VALID [2022-04-08 10:32:51,924 INFO L290 TraceCheckUtils]: 189: Hoare triple {12412#(<= main_~a~0 1)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {12412#(<= main_~a~0 1)} is VALID [2022-04-08 10:32:51,924 INFO L290 TraceCheckUtils]: 190: Hoare triple {12412#(<= main_~a~0 1)} assume !(~b~0 < 6); {12412#(<= main_~a~0 1)} is VALID [2022-04-08 10:32:51,925 INFO L290 TraceCheckUtils]: 191: Hoare triple {12412#(<= main_~a~0 1)} #t~pre4 := 1 + ~a~0;~a~0 := 1 + ~a~0;havoc #t~pre4; {12413#(<= main_~a~0 2)} is VALID [2022-04-08 10:32:51,925 INFO L290 TraceCheckUtils]: 192: Hoare triple {12413#(<= main_~a~0 2)} assume !(~a~0 < 6); {12407#false} is VALID [2022-04-08 10:32:51,925 INFO L290 TraceCheckUtils]: 193: Hoare triple {12407#false} assume !((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0); {12407#false} is VALID [2022-04-08 10:32:51,925 INFO L290 TraceCheckUtils]: 194: Hoare triple {12407#false} assume !false; {12407#false} is VALID [2022-04-08 10:32:51,927 INFO L134 CoverageAnalysis]: Checked inductivity of 6203 backedges. 0 proven. 3149 refuted. 0 times theorem prover too weak. 3054 trivial. 0 not checked. [2022-04-08 10:32:51,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:32:51,927 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1410121688] [2022-04-08 10:32:51,927 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1410121688] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:32:51,927 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1687492243] [2022-04-08 10:32:51,927 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 10:32:51,927 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:32:51,927 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:32:51,928 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:32:51,930 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-04-08 10:32:52,010 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 42 check-sat command(s) [2022-04-08 10:32:52,010 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:32:52,011 INFO L263 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-08 10:32:52,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:32:52,050 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:32:52,717 INFO L272 TraceCheckUtils]: 0: Hoare triple {12406#true} call ULTIMATE.init(); {12406#true} is VALID [2022-04-08 10:32:52,717 INFO L290 TraceCheckUtils]: 1: Hoare triple {12406#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); {12406#true} is VALID [2022-04-08 10:32:52,717 INFO L290 TraceCheckUtils]: 2: Hoare triple {12406#true} assume true; {12406#true} is VALID [2022-04-08 10:32:52,717 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12406#true} {12406#true} #56#return; {12406#true} is VALID [2022-04-08 10:32:52,717 INFO L272 TraceCheckUtils]: 4: Hoare triple {12406#true} call #t~ret7 := main(); {12406#true} is VALID [2022-04-08 10:32:52,717 INFO L290 TraceCheckUtils]: 5: Hoare triple {12406#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~a~0 := 0; {12406#true} is VALID [2022-04-08 10:32:52,717 INFO L290 TraceCheckUtils]: 6: Hoare triple {12406#true} assume !!(~a~0 < 6);~b~0 := 0; {12406#true} is VALID [2022-04-08 10:32:52,717 INFO L290 TraceCheckUtils]: 7: Hoare triple {12406#true} assume !!(~b~0 < 6);~c~0 := 0; {12406#true} is VALID [2022-04-08 10:32:52,717 INFO L290 TraceCheckUtils]: 8: Hoare triple {12406#true} assume !!(~c~0 < 6); {12406#true} is VALID [2022-04-08 10:32:52,717 INFO L290 TraceCheckUtils]: 9: Hoare triple {12406#true} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {12406#true} is VALID [2022-04-08 10:32:52,717 INFO L290 TraceCheckUtils]: 10: Hoare triple {12406#true} assume !!(~c~0 < 6); {12406#true} is VALID [2022-04-08 10:32:52,717 INFO L290 TraceCheckUtils]: 11: Hoare triple {12406#true} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {12406#true} is VALID [2022-04-08 10:32:52,718 INFO L290 TraceCheckUtils]: 12: Hoare triple {12406#true} assume !!(~c~0 < 6); {12406#true} is VALID [2022-04-08 10:32:52,718 INFO L290 TraceCheckUtils]: 13: Hoare triple {12406#true} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {12406#true} is VALID [2022-04-08 10:32:52,718 INFO L290 TraceCheckUtils]: 14: Hoare triple {12406#true} assume !!(~c~0 < 6); {12406#true} is VALID [2022-04-08 10:32:52,718 INFO L290 TraceCheckUtils]: 15: Hoare triple {12406#true} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {12406#true} is VALID [2022-04-08 10:32:52,718 INFO L290 TraceCheckUtils]: 16: Hoare triple {12406#true} assume !!(~c~0 < 6); {12406#true} is VALID [2022-04-08 10:32:52,718 INFO L290 TraceCheckUtils]: 17: Hoare triple {12406#true} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {12406#true} is VALID [2022-04-08 10:32:52,718 INFO L290 TraceCheckUtils]: 18: Hoare triple {12406#true} assume !!(~c~0 < 6); {12406#true} is VALID [2022-04-08 10:32:52,718 INFO L290 TraceCheckUtils]: 19: Hoare triple {12406#true} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {12406#true} is VALID [2022-04-08 10:32:52,718 INFO L290 TraceCheckUtils]: 20: Hoare triple {12406#true} assume !(~c~0 < 6); {12406#true} is VALID [2022-04-08 10:32:52,718 INFO L290 TraceCheckUtils]: 21: Hoare triple {12406#true} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {12406#true} is VALID [2022-04-08 10:32:52,718 INFO L290 TraceCheckUtils]: 22: Hoare triple {12406#true} assume !!(~b~0 < 6);~c~0 := 0; {12406#true} is VALID [2022-04-08 10:32:52,718 INFO L290 TraceCheckUtils]: 23: Hoare triple {12406#true} assume !!(~c~0 < 6); {12406#true} is VALID [2022-04-08 10:32:52,718 INFO L290 TraceCheckUtils]: 24: Hoare triple {12406#true} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {12406#true} is VALID [2022-04-08 10:32:52,718 INFO L290 TraceCheckUtils]: 25: Hoare triple {12406#true} assume !!(~c~0 < 6); {12406#true} is VALID [2022-04-08 10:32:52,718 INFO L290 TraceCheckUtils]: 26: Hoare triple {12406#true} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {12406#true} is VALID [2022-04-08 10:32:52,718 INFO L290 TraceCheckUtils]: 27: Hoare triple {12406#true} assume !!(~c~0 < 6); {12406#true} is VALID [2022-04-08 10:32:52,718 INFO L290 TraceCheckUtils]: 28: Hoare triple {12406#true} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {12406#true} is VALID [2022-04-08 10:32:52,718 INFO L290 TraceCheckUtils]: 29: Hoare triple {12406#true} assume !!(~c~0 < 6); {12406#true} is VALID [2022-04-08 10:32:52,718 INFO L290 TraceCheckUtils]: 30: Hoare triple {12406#true} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {12406#true} is VALID [2022-04-08 10:32:52,718 INFO L290 TraceCheckUtils]: 31: Hoare triple {12406#true} assume !!(~c~0 < 6); {12406#true} is VALID [2022-04-08 10:32:52,719 INFO L290 TraceCheckUtils]: 32: Hoare triple {12406#true} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {12406#true} is VALID [2022-04-08 10:32:52,719 INFO L290 TraceCheckUtils]: 33: Hoare triple {12406#true} assume !!(~c~0 < 6); {12406#true} is VALID [2022-04-08 10:32:52,719 INFO L290 TraceCheckUtils]: 34: Hoare triple {12406#true} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {12406#true} is VALID [2022-04-08 10:32:52,719 INFO L290 TraceCheckUtils]: 35: Hoare triple {12406#true} assume !(~c~0 < 6); {12406#true} is VALID [2022-04-08 10:32:52,719 INFO L290 TraceCheckUtils]: 36: Hoare triple {12406#true} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {12406#true} is VALID [2022-04-08 10:32:52,719 INFO L290 TraceCheckUtils]: 37: Hoare triple {12406#true} assume !!(~b~0 < 6);~c~0 := 0; {12406#true} is VALID [2022-04-08 10:32:52,719 INFO L290 TraceCheckUtils]: 38: Hoare triple {12406#true} assume !!(~c~0 < 6); {12406#true} is VALID [2022-04-08 10:32:52,719 INFO L290 TraceCheckUtils]: 39: Hoare triple {12406#true} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {12406#true} is VALID [2022-04-08 10:32:52,719 INFO L290 TraceCheckUtils]: 40: Hoare triple {12406#true} assume !!(~c~0 < 6); {12406#true} is VALID [2022-04-08 10:32:52,719 INFO L290 TraceCheckUtils]: 41: Hoare triple {12406#true} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {12406#true} is VALID [2022-04-08 10:32:52,719 INFO L290 TraceCheckUtils]: 42: Hoare triple {12406#true} assume !!(~c~0 < 6); {12406#true} is VALID [2022-04-08 10:32:52,719 INFO L290 TraceCheckUtils]: 43: Hoare triple {12406#true} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {12406#true} is VALID [2022-04-08 10:32:52,719 INFO L290 TraceCheckUtils]: 44: Hoare triple {12406#true} assume !!(~c~0 < 6); {12406#true} is VALID [2022-04-08 10:32:52,719 INFO L290 TraceCheckUtils]: 45: Hoare triple {12406#true} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {12406#true} is VALID [2022-04-08 10:32:52,719 INFO L290 TraceCheckUtils]: 46: Hoare triple {12406#true} assume !!(~c~0 < 6); {12406#true} is VALID [2022-04-08 10:32:52,719 INFO L290 TraceCheckUtils]: 47: Hoare triple {12406#true} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {12406#true} is VALID [2022-04-08 10:32:52,719 INFO L290 TraceCheckUtils]: 48: Hoare triple {12406#true} assume !!(~c~0 < 6); {12406#true} is VALID [2022-04-08 10:32:52,719 INFO L290 TraceCheckUtils]: 49: Hoare triple {12406#true} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {12406#true} is VALID [2022-04-08 10:32:52,719 INFO L290 TraceCheckUtils]: 50: Hoare triple {12406#true} assume !(~c~0 < 6); {12406#true} is VALID [2022-04-08 10:32:52,720 INFO L290 TraceCheckUtils]: 51: Hoare triple {12406#true} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {12406#true} is VALID [2022-04-08 10:32:52,720 INFO L290 TraceCheckUtils]: 52: Hoare triple {12406#true} assume !!(~b~0 < 6);~c~0 := 0; {12406#true} is VALID [2022-04-08 10:32:52,720 INFO L290 TraceCheckUtils]: 53: Hoare triple {12406#true} assume !!(~c~0 < 6); {12406#true} is VALID [2022-04-08 10:32:52,720 INFO L290 TraceCheckUtils]: 54: Hoare triple {12406#true} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {12406#true} is VALID [2022-04-08 10:32:52,720 INFO L290 TraceCheckUtils]: 55: Hoare triple {12406#true} assume !!(~c~0 < 6); {12406#true} is VALID [2022-04-08 10:32:52,720 INFO L290 TraceCheckUtils]: 56: Hoare triple {12406#true} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {12406#true} is VALID [2022-04-08 10:32:52,720 INFO L290 TraceCheckUtils]: 57: Hoare triple {12406#true} assume !!(~c~0 < 6); {12406#true} is VALID [2022-04-08 10:32:52,720 INFO L290 TraceCheckUtils]: 58: Hoare triple {12406#true} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {12406#true} is VALID [2022-04-08 10:32:52,720 INFO L290 TraceCheckUtils]: 59: Hoare triple {12406#true} assume !!(~c~0 < 6); {12406#true} is VALID [2022-04-08 10:32:52,720 INFO L290 TraceCheckUtils]: 60: Hoare triple {12406#true} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {12406#true} is VALID [2022-04-08 10:32:52,720 INFO L290 TraceCheckUtils]: 61: Hoare triple {12406#true} assume !!(~c~0 < 6); {12406#true} is VALID [2022-04-08 10:32:52,720 INFO L290 TraceCheckUtils]: 62: Hoare triple {12406#true} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {12406#true} is VALID [2022-04-08 10:32:52,720 INFO L290 TraceCheckUtils]: 63: Hoare triple {12406#true} assume !!(~c~0 < 6); {12406#true} is VALID [2022-04-08 10:32:52,720 INFO L290 TraceCheckUtils]: 64: Hoare triple {12406#true} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {12406#true} is VALID [2022-04-08 10:32:52,720 INFO L290 TraceCheckUtils]: 65: Hoare triple {12406#true} assume !(~c~0 < 6); {12406#true} is VALID [2022-04-08 10:32:52,720 INFO L290 TraceCheckUtils]: 66: Hoare triple {12406#true} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {12406#true} is VALID [2022-04-08 10:32:52,720 INFO L290 TraceCheckUtils]: 67: Hoare triple {12406#true} assume !!(~b~0 < 6);~c~0 := 0; {12406#true} is VALID [2022-04-08 10:32:52,720 INFO L290 TraceCheckUtils]: 68: Hoare triple {12406#true} assume !!(~c~0 < 6); {12406#true} is VALID [2022-04-08 10:32:52,720 INFO L290 TraceCheckUtils]: 69: Hoare triple {12406#true} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {12406#true} is VALID [2022-04-08 10:32:52,721 INFO L290 TraceCheckUtils]: 70: Hoare triple {12406#true} assume !!(~c~0 < 6); {12406#true} is VALID [2022-04-08 10:32:52,721 INFO L290 TraceCheckUtils]: 71: Hoare triple {12406#true} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {12406#true} is VALID [2022-04-08 10:32:52,721 INFO L290 TraceCheckUtils]: 72: Hoare triple {12406#true} assume !!(~c~0 < 6); {12406#true} is VALID [2022-04-08 10:32:52,721 INFO L290 TraceCheckUtils]: 73: Hoare triple {12406#true} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {12406#true} is VALID [2022-04-08 10:32:52,721 INFO L290 TraceCheckUtils]: 74: Hoare triple {12406#true} assume !!(~c~0 < 6); {12406#true} is VALID [2022-04-08 10:32:52,721 INFO L290 TraceCheckUtils]: 75: Hoare triple {12406#true} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {12406#true} is VALID [2022-04-08 10:32:52,721 INFO L290 TraceCheckUtils]: 76: Hoare triple {12406#true} assume !!(~c~0 < 6); {12406#true} is VALID [2022-04-08 10:32:52,721 INFO L290 TraceCheckUtils]: 77: Hoare triple {12406#true} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {12406#true} is VALID [2022-04-08 10:32:52,721 INFO L290 TraceCheckUtils]: 78: Hoare triple {12406#true} assume !!(~c~0 < 6); {12406#true} is VALID [2022-04-08 10:32:52,721 INFO L290 TraceCheckUtils]: 79: Hoare triple {12406#true} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {12406#true} is VALID [2022-04-08 10:32:52,721 INFO L290 TraceCheckUtils]: 80: Hoare triple {12406#true} assume !(~c~0 < 6); {12406#true} is VALID [2022-04-08 10:32:52,721 INFO L290 TraceCheckUtils]: 81: Hoare triple {12406#true} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {12406#true} is VALID [2022-04-08 10:32:52,721 INFO L290 TraceCheckUtils]: 82: Hoare triple {12406#true} assume !!(~b~0 < 6);~c~0 := 0; {12406#true} is VALID [2022-04-08 10:32:52,721 INFO L290 TraceCheckUtils]: 83: Hoare triple {12406#true} assume !!(~c~0 < 6); {12406#true} is VALID [2022-04-08 10:32:52,721 INFO L290 TraceCheckUtils]: 84: Hoare triple {12406#true} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {12406#true} is VALID [2022-04-08 10:32:52,721 INFO L290 TraceCheckUtils]: 85: Hoare triple {12406#true} assume !!(~c~0 < 6); {12406#true} is VALID [2022-04-08 10:32:52,721 INFO L290 TraceCheckUtils]: 86: Hoare triple {12406#true} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {12406#true} is VALID [2022-04-08 10:32:52,721 INFO L290 TraceCheckUtils]: 87: Hoare triple {12406#true} assume !!(~c~0 < 6); {12406#true} is VALID [2022-04-08 10:32:52,721 INFO L290 TraceCheckUtils]: 88: Hoare triple {12406#true} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {12406#true} is VALID [2022-04-08 10:32:52,721 INFO L290 TraceCheckUtils]: 89: Hoare triple {12406#true} assume !!(~c~0 < 6); {12406#true} is VALID [2022-04-08 10:32:52,722 INFO L290 TraceCheckUtils]: 90: Hoare triple {12406#true} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {12406#true} is VALID [2022-04-08 10:32:52,722 INFO L290 TraceCheckUtils]: 91: Hoare triple {12406#true} assume !!(~c~0 < 6); {12406#true} is VALID [2022-04-08 10:32:52,722 INFO L290 TraceCheckUtils]: 92: Hoare triple {12406#true} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {12406#true} is VALID [2022-04-08 10:32:52,722 INFO L290 TraceCheckUtils]: 93: Hoare triple {12406#true} assume !!(~c~0 < 6); {12406#true} is VALID [2022-04-08 10:32:52,722 INFO L290 TraceCheckUtils]: 94: Hoare triple {12406#true} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {12406#true} is VALID [2022-04-08 10:32:52,722 INFO L290 TraceCheckUtils]: 95: Hoare triple {12406#true} assume !(~c~0 < 6); {12406#true} is VALID [2022-04-08 10:32:52,722 INFO L290 TraceCheckUtils]: 96: Hoare triple {12406#true} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {12406#true} is VALID [2022-04-08 10:32:52,722 INFO L290 TraceCheckUtils]: 97: Hoare triple {12406#true} assume !(~b~0 < 6); {12406#true} is VALID [2022-04-08 10:32:52,722 INFO L290 TraceCheckUtils]: 98: Hoare triple {12406#true} #t~pre4 := 1 + ~a~0;~a~0 := 1 + ~a~0;havoc #t~pre4; {12406#true} is VALID [2022-04-08 10:32:52,722 INFO L290 TraceCheckUtils]: 99: Hoare triple {12406#true} assume !!(~a~0 < 6);~b~0 := 0; {12715#(< main_~a~0 6)} is VALID [2022-04-08 10:32:52,722 INFO L290 TraceCheckUtils]: 100: Hoare triple {12715#(< main_~a~0 6)} assume !!(~b~0 < 6);~c~0 := 0; {12715#(< main_~a~0 6)} is VALID [2022-04-08 10:32:52,723 INFO L290 TraceCheckUtils]: 101: Hoare triple {12715#(< main_~a~0 6)} assume !!(~c~0 < 6); {12715#(< main_~a~0 6)} is VALID [2022-04-08 10:32:52,723 INFO L290 TraceCheckUtils]: 102: Hoare triple {12715#(< main_~a~0 6)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {12715#(< main_~a~0 6)} is VALID [2022-04-08 10:32:52,723 INFO L290 TraceCheckUtils]: 103: Hoare triple {12715#(< main_~a~0 6)} assume !!(~c~0 < 6); {12715#(< main_~a~0 6)} is VALID [2022-04-08 10:32:52,723 INFO L290 TraceCheckUtils]: 104: Hoare triple {12715#(< main_~a~0 6)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {12715#(< main_~a~0 6)} is VALID [2022-04-08 10:32:52,724 INFO L290 TraceCheckUtils]: 105: Hoare triple {12715#(< main_~a~0 6)} assume !!(~c~0 < 6); {12715#(< main_~a~0 6)} is VALID [2022-04-08 10:32:52,724 INFO L290 TraceCheckUtils]: 106: Hoare triple {12715#(< main_~a~0 6)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {12715#(< main_~a~0 6)} is VALID [2022-04-08 10:32:52,724 INFO L290 TraceCheckUtils]: 107: Hoare triple {12715#(< main_~a~0 6)} assume !!(~c~0 < 6); {12715#(< main_~a~0 6)} is VALID [2022-04-08 10:32:52,724 INFO L290 TraceCheckUtils]: 108: Hoare triple {12715#(< main_~a~0 6)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {12715#(< main_~a~0 6)} is VALID [2022-04-08 10:32:52,725 INFO L290 TraceCheckUtils]: 109: Hoare triple {12715#(< main_~a~0 6)} assume !!(~c~0 < 6); {12715#(< main_~a~0 6)} is VALID [2022-04-08 10:32:52,725 INFO L290 TraceCheckUtils]: 110: Hoare triple {12715#(< main_~a~0 6)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {12715#(< main_~a~0 6)} is VALID [2022-04-08 10:32:52,725 INFO L290 TraceCheckUtils]: 111: Hoare triple {12715#(< main_~a~0 6)} assume !!(~c~0 < 6); {12715#(< main_~a~0 6)} is VALID [2022-04-08 10:32:52,726 INFO L290 TraceCheckUtils]: 112: Hoare triple {12715#(< main_~a~0 6)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {12715#(< main_~a~0 6)} is VALID [2022-04-08 10:32:52,726 INFO L290 TraceCheckUtils]: 113: Hoare triple {12715#(< main_~a~0 6)} assume !(~c~0 < 6); {12715#(< main_~a~0 6)} is VALID [2022-04-08 10:32:52,726 INFO L290 TraceCheckUtils]: 114: Hoare triple {12715#(< main_~a~0 6)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {12715#(< main_~a~0 6)} is VALID [2022-04-08 10:32:52,726 INFO L290 TraceCheckUtils]: 115: Hoare triple {12715#(< main_~a~0 6)} assume !!(~b~0 < 6);~c~0 := 0; {12715#(< main_~a~0 6)} is VALID [2022-04-08 10:32:52,727 INFO L290 TraceCheckUtils]: 116: Hoare triple {12715#(< main_~a~0 6)} assume !!(~c~0 < 6); {12715#(< main_~a~0 6)} is VALID [2022-04-08 10:32:52,727 INFO L290 TraceCheckUtils]: 117: Hoare triple {12715#(< main_~a~0 6)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {12715#(< main_~a~0 6)} is VALID [2022-04-08 10:32:52,727 INFO L290 TraceCheckUtils]: 118: Hoare triple {12715#(< main_~a~0 6)} assume !!(~c~0 < 6); {12715#(< main_~a~0 6)} is VALID [2022-04-08 10:32:52,727 INFO L290 TraceCheckUtils]: 119: Hoare triple {12715#(< main_~a~0 6)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {12715#(< main_~a~0 6)} is VALID [2022-04-08 10:32:52,728 INFO L290 TraceCheckUtils]: 120: Hoare triple {12715#(< main_~a~0 6)} assume !!(~c~0 < 6); {12715#(< main_~a~0 6)} is VALID [2022-04-08 10:32:52,728 INFO L290 TraceCheckUtils]: 121: Hoare triple {12715#(< main_~a~0 6)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {12715#(< main_~a~0 6)} is VALID [2022-04-08 10:32:52,728 INFO L290 TraceCheckUtils]: 122: Hoare triple {12715#(< main_~a~0 6)} assume !!(~c~0 < 6); {12715#(< main_~a~0 6)} is VALID [2022-04-08 10:32:52,728 INFO L290 TraceCheckUtils]: 123: Hoare triple {12715#(< main_~a~0 6)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {12715#(< main_~a~0 6)} is VALID [2022-04-08 10:32:52,729 INFO L290 TraceCheckUtils]: 124: Hoare triple {12715#(< main_~a~0 6)} assume !!(~c~0 < 6); {12715#(< main_~a~0 6)} is VALID [2022-04-08 10:32:52,729 INFO L290 TraceCheckUtils]: 125: Hoare triple {12715#(< main_~a~0 6)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {12715#(< main_~a~0 6)} is VALID [2022-04-08 10:32:52,729 INFO L290 TraceCheckUtils]: 126: Hoare triple {12715#(< main_~a~0 6)} assume !!(~c~0 < 6); {12715#(< main_~a~0 6)} is VALID [2022-04-08 10:32:52,729 INFO L290 TraceCheckUtils]: 127: Hoare triple {12715#(< main_~a~0 6)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {12715#(< main_~a~0 6)} is VALID [2022-04-08 10:32:52,729 INFO L290 TraceCheckUtils]: 128: Hoare triple {12715#(< main_~a~0 6)} assume !(~c~0 < 6); {12715#(< main_~a~0 6)} is VALID [2022-04-08 10:32:52,730 INFO L290 TraceCheckUtils]: 129: Hoare triple {12715#(< main_~a~0 6)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {12715#(< main_~a~0 6)} is VALID [2022-04-08 10:32:52,730 INFO L290 TraceCheckUtils]: 130: Hoare triple {12715#(< main_~a~0 6)} assume !!(~b~0 < 6);~c~0 := 0; {12715#(< main_~a~0 6)} is VALID [2022-04-08 10:32:52,730 INFO L290 TraceCheckUtils]: 131: Hoare triple {12715#(< main_~a~0 6)} assume !!(~c~0 < 6); {12715#(< main_~a~0 6)} is VALID [2022-04-08 10:32:52,730 INFO L290 TraceCheckUtils]: 132: Hoare triple {12715#(< main_~a~0 6)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {12715#(< main_~a~0 6)} is VALID [2022-04-08 10:32:52,731 INFO L290 TraceCheckUtils]: 133: Hoare triple {12715#(< main_~a~0 6)} assume !!(~c~0 < 6); {12715#(< main_~a~0 6)} is VALID [2022-04-08 10:32:52,731 INFO L290 TraceCheckUtils]: 134: Hoare triple {12715#(< main_~a~0 6)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {12715#(< main_~a~0 6)} is VALID [2022-04-08 10:32:52,731 INFO L290 TraceCheckUtils]: 135: Hoare triple {12715#(< main_~a~0 6)} assume !!(~c~0 < 6); {12715#(< main_~a~0 6)} is VALID [2022-04-08 10:32:52,731 INFO L290 TraceCheckUtils]: 136: Hoare triple {12715#(< main_~a~0 6)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {12715#(< main_~a~0 6)} is VALID [2022-04-08 10:32:52,732 INFO L290 TraceCheckUtils]: 137: Hoare triple {12715#(< main_~a~0 6)} assume !!(~c~0 < 6); {12715#(< main_~a~0 6)} is VALID [2022-04-08 10:32:52,732 INFO L290 TraceCheckUtils]: 138: Hoare triple {12715#(< main_~a~0 6)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {12715#(< main_~a~0 6)} is VALID [2022-04-08 10:32:52,732 INFO L290 TraceCheckUtils]: 139: Hoare triple {12715#(< main_~a~0 6)} assume !!(~c~0 < 6); {12715#(< main_~a~0 6)} is VALID [2022-04-08 10:32:52,732 INFO L290 TraceCheckUtils]: 140: Hoare triple {12715#(< main_~a~0 6)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {12715#(< main_~a~0 6)} is VALID [2022-04-08 10:32:52,733 INFO L290 TraceCheckUtils]: 141: Hoare triple {12715#(< main_~a~0 6)} assume !!(~c~0 < 6); {12715#(< main_~a~0 6)} is VALID [2022-04-08 10:32:52,733 INFO L290 TraceCheckUtils]: 142: Hoare triple {12715#(< main_~a~0 6)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {12715#(< main_~a~0 6)} is VALID [2022-04-08 10:32:52,733 INFO L290 TraceCheckUtils]: 143: Hoare triple {12715#(< main_~a~0 6)} assume !(~c~0 < 6); {12715#(< main_~a~0 6)} is VALID [2022-04-08 10:32:52,733 INFO L290 TraceCheckUtils]: 144: Hoare triple {12715#(< main_~a~0 6)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {12715#(< main_~a~0 6)} is VALID [2022-04-08 10:32:52,733 INFO L290 TraceCheckUtils]: 145: Hoare triple {12715#(< main_~a~0 6)} assume !!(~b~0 < 6);~c~0 := 0; {12715#(< main_~a~0 6)} is VALID [2022-04-08 10:32:52,734 INFO L290 TraceCheckUtils]: 146: Hoare triple {12715#(< main_~a~0 6)} assume !!(~c~0 < 6); {12715#(< main_~a~0 6)} is VALID [2022-04-08 10:32:52,734 INFO L290 TraceCheckUtils]: 147: Hoare triple {12715#(< main_~a~0 6)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {12715#(< main_~a~0 6)} is VALID [2022-04-08 10:32:52,734 INFO L290 TraceCheckUtils]: 148: Hoare triple {12715#(< main_~a~0 6)} assume !!(~c~0 < 6); {12715#(< main_~a~0 6)} is VALID [2022-04-08 10:32:52,734 INFO L290 TraceCheckUtils]: 149: Hoare triple {12715#(< main_~a~0 6)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {12715#(< main_~a~0 6)} is VALID [2022-04-08 10:32:52,735 INFO L290 TraceCheckUtils]: 150: Hoare triple {12715#(< main_~a~0 6)} assume !!(~c~0 < 6); {12715#(< main_~a~0 6)} is VALID [2022-04-08 10:32:52,735 INFO L290 TraceCheckUtils]: 151: Hoare triple {12715#(< main_~a~0 6)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {12715#(< main_~a~0 6)} is VALID [2022-04-08 10:32:52,735 INFO L290 TraceCheckUtils]: 152: Hoare triple {12715#(< main_~a~0 6)} assume !!(~c~0 < 6); {12715#(< main_~a~0 6)} is VALID [2022-04-08 10:32:52,735 INFO L290 TraceCheckUtils]: 153: Hoare triple {12715#(< main_~a~0 6)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {12715#(< main_~a~0 6)} is VALID [2022-04-08 10:32:52,736 INFO L290 TraceCheckUtils]: 154: Hoare triple {12715#(< main_~a~0 6)} assume !!(~c~0 < 6); {12715#(< main_~a~0 6)} is VALID [2022-04-08 10:32:52,736 INFO L290 TraceCheckUtils]: 155: Hoare triple {12715#(< main_~a~0 6)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {12715#(< main_~a~0 6)} is VALID [2022-04-08 10:32:52,736 INFO L290 TraceCheckUtils]: 156: Hoare triple {12715#(< main_~a~0 6)} assume !!(~c~0 < 6); {12715#(< main_~a~0 6)} is VALID [2022-04-08 10:32:52,736 INFO L290 TraceCheckUtils]: 157: Hoare triple {12715#(< main_~a~0 6)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {12715#(< main_~a~0 6)} is VALID [2022-04-08 10:32:52,737 INFO L290 TraceCheckUtils]: 158: Hoare triple {12715#(< main_~a~0 6)} assume !(~c~0 < 6); {12715#(< main_~a~0 6)} is VALID [2022-04-08 10:32:52,737 INFO L290 TraceCheckUtils]: 159: Hoare triple {12715#(< main_~a~0 6)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {12715#(< main_~a~0 6)} is VALID [2022-04-08 10:32:52,737 INFO L290 TraceCheckUtils]: 160: Hoare triple {12715#(< main_~a~0 6)} assume !!(~b~0 < 6);~c~0 := 0; {12715#(< main_~a~0 6)} is VALID [2022-04-08 10:32:52,737 INFO L290 TraceCheckUtils]: 161: Hoare triple {12715#(< main_~a~0 6)} assume !!(~c~0 < 6); {12715#(< main_~a~0 6)} is VALID [2022-04-08 10:32:52,737 INFO L290 TraceCheckUtils]: 162: Hoare triple {12715#(< main_~a~0 6)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {12715#(< main_~a~0 6)} is VALID [2022-04-08 10:32:52,738 INFO L290 TraceCheckUtils]: 163: Hoare triple {12715#(< main_~a~0 6)} assume !!(~c~0 < 6); {12715#(< main_~a~0 6)} is VALID [2022-04-08 10:32:52,738 INFO L290 TraceCheckUtils]: 164: Hoare triple {12715#(< main_~a~0 6)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {12715#(< main_~a~0 6)} is VALID [2022-04-08 10:32:52,738 INFO L290 TraceCheckUtils]: 165: Hoare triple {12715#(< main_~a~0 6)} assume !!(~c~0 < 6); {12715#(< main_~a~0 6)} is VALID [2022-04-08 10:32:52,738 INFO L290 TraceCheckUtils]: 166: Hoare triple {12715#(< main_~a~0 6)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {12715#(< main_~a~0 6)} is VALID [2022-04-08 10:32:52,739 INFO L290 TraceCheckUtils]: 167: Hoare triple {12715#(< main_~a~0 6)} assume !!(~c~0 < 6); {12715#(< main_~a~0 6)} is VALID [2022-04-08 10:32:52,739 INFO L290 TraceCheckUtils]: 168: Hoare triple {12715#(< main_~a~0 6)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {12715#(< main_~a~0 6)} is VALID [2022-04-08 10:32:52,739 INFO L290 TraceCheckUtils]: 169: Hoare triple {12715#(< main_~a~0 6)} assume !!(~c~0 < 6); {12715#(< main_~a~0 6)} is VALID [2022-04-08 10:32:52,739 INFO L290 TraceCheckUtils]: 170: Hoare triple {12715#(< main_~a~0 6)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {12715#(< main_~a~0 6)} is VALID [2022-04-08 10:32:52,740 INFO L290 TraceCheckUtils]: 171: Hoare triple {12715#(< main_~a~0 6)} assume !!(~c~0 < 6); {12715#(< main_~a~0 6)} is VALID [2022-04-08 10:32:52,740 INFO L290 TraceCheckUtils]: 172: Hoare triple {12715#(< main_~a~0 6)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {12715#(< main_~a~0 6)} is VALID [2022-04-08 10:32:52,740 INFO L290 TraceCheckUtils]: 173: Hoare triple {12715#(< main_~a~0 6)} assume !(~c~0 < 6); {12715#(< main_~a~0 6)} is VALID [2022-04-08 10:32:52,740 INFO L290 TraceCheckUtils]: 174: Hoare triple {12715#(< main_~a~0 6)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {12715#(< main_~a~0 6)} is VALID [2022-04-08 10:32:52,741 INFO L290 TraceCheckUtils]: 175: Hoare triple {12715#(< main_~a~0 6)} assume !!(~b~0 < 6);~c~0 := 0; {12944#(and (< main_~b~0 6) (< main_~a~0 6))} is VALID [2022-04-08 10:32:52,741 INFO L290 TraceCheckUtils]: 176: Hoare triple {12944#(and (< main_~b~0 6) (< main_~a~0 6))} assume !!(~c~0 < 6); {12944#(and (< main_~b~0 6) (< main_~a~0 6))} is VALID [2022-04-08 10:32:52,741 INFO L290 TraceCheckUtils]: 177: Hoare triple {12944#(and (< main_~b~0 6) (< main_~a~0 6))} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {12944#(and (< main_~b~0 6) (< main_~a~0 6))} is VALID [2022-04-08 10:32:52,742 INFO L290 TraceCheckUtils]: 178: Hoare triple {12944#(and (< main_~b~0 6) (< main_~a~0 6))} assume !!(~c~0 < 6); {12944#(and (< main_~b~0 6) (< main_~a~0 6))} is VALID [2022-04-08 10:32:52,742 INFO L290 TraceCheckUtils]: 179: Hoare triple {12944#(and (< main_~b~0 6) (< main_~a~0 6))} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {12944#(and (< main_~b~0 6) (< main_~a~0 6))} is VALID [2022-04-08 10:32:52,742 INFO L290 TraceCheckUtils]: 180: Hoare triple {12944#(and (< main_~b~0 6) (< main_~a~0 6))} assume !!(~c~0 < 6); {12944#(and (< main_~b~0 6) (< main_~a~0 6))} is VALID [2022-04-08 10:32:52,742 INFO L290 TraceCheckUtils]: 181: Hoare triple {12944#(and (< main_~b~0 6) (< main_~a~0 6))} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {12944#(and (< main_~b~0 6) (< main_~a~0 6))} is VALID [2022-04-08 10:32:52,743 INFO L290 TraceCheckUtils]: 182: Hoare triple {12944#(and (< main_~b~0 6) (< main_~a~0 6))} assume !!(~c~0 < 6); {12944#(and (< main_~b~0 6) (< main_~a~0 6))} is VALID [2022-04-08 10:32:52,743 INFO L290 TraceCheckUtils]: 183: Hoare triple {12944#(and (< main_~b~0 6) (< main_~a~0 6))} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {12944#(and (< main_~b~0 6) (< main_~a~0 6))} is VALID [2022-04-08 10:32:52,755 INFO L290 TraceCheckUtils]: 184: Hoare triple {12944#(and (< main_~b~0 6) (< main_~a~0 6))} assume !!(~c~0 < 6); {12944#(and (< main_~b~0 6) (< main_~a~0 6))} is VALID [2022-04-08 10:32:52,756 INFO L290 TraceCheckUtils]: 185: Hoare triple {12944#(and (< main_~b~0 6) (< main_~a~0 6))} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {12944#(and (< main_~b~0 6) (< main_~a~0 6))} is VALID [2022-04-08 10:32:52,756 INFO L290 TraceCheckUtils]: 186: Hoare triple {12944#(and (< main_~b~0 6) (< main_~a~0 6))} assume !!(~c~0 < 6); {12978#(and (< main_~c~0 6) (< main_~b~0 6) (< main_~a~0 6))} is VALID [2022-04-08 10:32:52,756 INFO L290 TraceCheckUtils]: 187: Hoare triple {12978#(and (< main_~c~0 6) (< main_~b~0 6) (< main_~a~0 6))} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {12982#(and (< main_~b~0 6) (< main_~c~0 7) (< main_~a~0 6))} is VALID [2022-04-08 10:32:52,757 INFO L290 TraceCheckUtils]: 188: Hoare triple {12982#(and (< main_~b~0 6) (< main_~c~0 7) (< main_~a~0 6))} assume !(~c~0 < 6); {12986#(and (< main_~b~0 6) (not (< main_~c~0 6)) (< main_~c~0 7) (< main_~a~0 6))} is VALID [2022-04-08 10:32:52,757 INFO L290 TraceCheckUtils]: 189: Hoare triple {12986#(and (< main_~b~0 6) (not (< main_~c~0 6)) (< main_~c~0 7) (< main_~a~0 6))} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {12990#(and (< main_~b~0 7) (not (< main_~c~0 6)) (< main_~c~0 7) (< main_~a~0 6))} is VALID [2022-04-08 10:32:52,758 INFO L290 TraceCheckUtils]: 190: Hoare triple {12990#(and (< main_~b~0 7) (not (< main_~c~0 6)) (< main_~c~0 7) (< main_~a~0 6))} assume !(~b~0 < 6); {12994#(and (< main_~b~0 7) (not (< main_~c~0 6)) (< main_~c~0 7) (< main_~a~0 6) (not (< main_~b~0 6)))} is VALID [2022-04-08 10:32:52,758 INFO L290 TraceCheckUtils]: 191: Hoare triple {12994#(and (< main_~b~0 7) (not (< main_~c~0 6)) (< main_~c~0 7) (< main_~a~0 6) (not (< main_~b~0 6)))} #t~pre4 := 1 + ~a~0;~a~0 := 1 + ~a~0;havoc #t~pre4; {12998#(and (< main_~a~0 7) (< main_~b~0 7) (not (< main_~c~0 6)) (< main_~c~0 7) (not (< main_~b~0 6)))} is VALID [2022-04-08 10:32:52,758 INFO L290 TraceCheckUtils]: 192: Hoare triple {12998#(and (< main_~a~0 7) (< main_~b~0 7) (not (< main_~c~0 6)) (< main_~c~0 7) (not (< main_~b~0 6)))} assume !(~a~0 < 6); {13002#(and (< main_~a~0 7) (< main_~b~0 7) (not (< main_~c~0 6)) (< main_~c~0 7) (not (< main_~b~0 6)) (not (< main_~a~0 6)))} is VALID [2022-04-08 10:32:52,759 INFO L290 TraceCheckUtils]: 193: Hoare triple {13002#(and (< main_~a~0 7) (< main_~b~0 7) (not (< main_~c~0 6)) (< main_~c~0 7) (not (< main_~b~0 6)) (not (< main_~a~0 6)))} assume !((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0); {12407#false} is VALID [2022-04-08 10:32:52,759 INFO L290 TraceCheckUtils]: 194: Hoare triple {12407#false} assume !false; {12407#false} is VALID [2022-04-08 10:32:52,761 INFO L134 CoverageAnalysis]: Checked inductivity of 6203 backedges. 3595 proven. 0 refuted. 0 times theorem prover too weak. 2608 trivial. 0 not checked. [2022-04-08 10:32:52,761 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-08 10:32:52,761 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1687492243] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:32:52,761 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-08 10:32:52,761 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [6] total 15 [2022-04-08 10:32:52,761 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:32:52,761 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [181330687] [2022-04-08 10:32:52,761 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [181330687] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:32:52,761 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:32:52,761 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-08 10:32:52,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [444508030] [2022-04-08 10:32:52,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:32:52,762 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 11 states have internal predecessors, (29), 1 states have call successors, (2), 1 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-08 10:32:52,762 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:32:52,762 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 11 states have internal predecessors, (29), 1 states have call successors, (2), 1 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-08 10:32:52,794 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:32:52,794 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-08 10:32:52,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:32:52,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-08 10:32:52,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2022-04-08 10:32:52,795 INFO L87 Difference]: Start difference. First operand 196 states and 210 transitions. Second operand has 11 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 11 states have internal predecessors, (29), 1 states have call successors, (2), 1 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-08 10:32:53,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:32:53,405 INFO L93 Difference]: Finished difference Result 196 states and 210 transitions. [2022-04-08 10:32:53,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-08 10:32:53,406 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 11 states have internal predecessors, (29), 1 states have call successors, (2), 1 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-08 10:32:53,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:32:53,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 11 states have internal predecessors, (29), 1 states have call successors, (2), 1 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-08 10:32:53,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 20 transitions. [2022-04-08 10:32:53,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 11 states have internal predecessors, (29), 1 states have call successors, (2), 1 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-08 10:32:53,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 20 transitions. [2022-04-08 10:32:53,418 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 20 transitions. [2022-04-08 10:32:53,429 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-08 10:32:53,429 INFO L225 Difference]: With dead ends: 196 [2022-04-08 10:32:53,429 INFO L226 Difference]: Without dead ends: 0 [2022-04-08 10:32:53,430 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 188 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2022-04-08 10:32:53,430 INFO L913 BasicCegarLoop]: 6 mSDtfsCounter, 5 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 10:32:53,430 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [5 Valid, 31 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 10:32:53,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-08 10:32:53,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-08 10:32:53,431 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:32:53,431 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-08 10:32:53,431 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-08 10:32:53,431 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-08 10:32:53,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:32:53,431 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-08 10:32:53,431 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-08 10:32:53,431 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:32:53,431 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:32:53,431 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-08 10:32:53,431 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-08 10:32:53,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:32:53,431 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-08 10:32:53,432 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-08 10:32:53,432 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:32:53,432 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:32:53,432 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:32:53,432 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:32:53,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-08 10:32:53,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-08 10:32:53,432 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 195 [2022-04-08 10:32:53,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:32:53,432 INFO L478 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-08 10:32:53,432 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 11 states have internal predecessors, (29), 1 states have call successors, (2), 1 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-08 10:32:53,432 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2022-04-08 10:32:53,432 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:32:53,432 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-08 10:32:53,432 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:32:53,434 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-08 10:32:53,451 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-04-08 10:32:53,641 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-04-08 10:32:53,643 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-08 10:33:00,957 WARN L232 SmtUtils]: Spent 7.15s on a formula simplification. DAG size of input: 280 DAG size of output: 279 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-04-08 10:33:03,630 INFO L882 garLoopResultBuilder]: For program point reach_errorEXIT(line 13) no Hoare annotation was computed. [2022-04-08 10:33:03,630 INFO L882 garLoopResultBuilder]: For program point reach_errorENTRY(line 13) no Hoare annotation was computed. [2022-04-08 10:33:03,630 INFO L882 garLoopResultBuilder]: For program point reach_errorFINAL(line 13) no Hoare annotation was computed. [2022-04-08 10:33:03,630 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2022-04-08 10:33:03,630 INFO L878 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-04-08 10:33:03,630 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2022-04-08 10:33:03,630 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2022-04-08 10:33:03,630 INFO L885 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-08 10:33:03,630 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-08 10:33:03,630 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2022-04-08 10:33:03,630 INFO L878 garLoopResultBuilder]: At program point L29(line 29) the Hoare annotation is: false [2022-04-08 10:33:03,630 INFO L885 garLoopResultBuilder]: At program point mainEXIT(lines 15 32) the Hoare annotation is: true [2022-04-08 10:33:03,630 INFO L878 garLoopResultBuilder]: At program point L23-2(lines 23 25) the Hoare annotation is: (and (<= main_~c~0 5) (<= main_~b~0 5) (< main_~a~0 6)) [2022-04-08 10:33:03,630 INFO L878 garLoopResultBuilder]: At program point L23-3(lines 23 25) the Hoare annotation is: (and (< main_~c~0 7) (<= main_~b~0 5) (< main_~a~0 6)) [2022-04-08 10:33:03,631 INFO L878 garLoopResultBuilder]: At program point L21-2(lines 21 27) the Hoare annotation is: (and (< main_~b~0 7) (not (< main_~c~0 6)) (< main_~c~0 7) (< main_~a~0 6) (not (< main_~b~0 6))) [2022-04-08 10:33:03,631 INFO L878 garLoopResultBuilder]: At program point L21-3(lines 21 27) the Hoare annotation is: (and (< main_~a~0 7) (< main_~b~0 7) (not (< main_~c~0 6)) (< main_~c~0 7) (not (< main_~b~0 6))) [2022-04-08 10:33:03,631 INFO L878 garLoopResultBuilder]: At program point L21-4(lines 15 32) the Hoare annotation is: (and (< main_~a~0 7) (< main_~b~0 7) (not (< main_~c~0 6)) (< main_~c~0 7) (not (< main_~b~0 6)) (not (< main_~a~0 6))) [2022-04-08 10:33:03,631 INFO L885 garLoopResultBuilder]: At program point mainFINAL(lines 15 32) the Hoare annotation is: true [2022-04-08 10:33:03,631 INFO L878 garLoopResultBuilder]: At program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 29) the Hoare annotation is: false [2022-04-08 10:33:03,631 INFO L885 garLoopResultBuilder]: At program point mainENTRY(lines 15 32) the Hoare annotation is: true [2022-04-08 10:33:03,631 INFO L885 garLoopResultBuilder]: At program point L28-1(lines 28 30) the Hoare annotation is: true [2022-04-08 10:33:03,631 INFO L878 garLoopResultBuilder]: At program point L22-2(lines 22 26) the Hoare annotation is: (and (< main_~c~0 7) (<= 6 main_~c~0) (<= main_~b~0 5) (< main_~a~0 6)) [2022-04-08 10:33:03,631 INFO L878 garLoopResultBuilder]: At program point L22-3(lines 22 26) the Hoare annotation is: (and (< main_~b~0 7) (not (< main_~c~0 6)) (< main_~c~0 7) (< main_~a~0 6)) [2022-04-08 10:33:03,633 INFO L719 BasicCegarLoop]: Path program histogram: [24, 2, 2, 2, 2] [2022-04-08 10:33:03,634 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-04-08 10:33:03,636 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-08 10:33:03,637 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-08 10:33:03,652 INFO L163 areAnnotationChecker]: CFG has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-08 10:33:03,659 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.04 10:33:03 BoogieIcfgContainer [2022-04-08 10:33:03,659 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-08 10:33:03,660 INFO L158 Benchmark]: Toolchain (without parser) took 28563.18ms. Allocated memory was 188.7MB in the beginning and 306.2MB in the end (delta: 117.4MB). Free memory was 138.6MB in the beginning and 221.5MB in the end (delta: -82.8MB). Peak memory consumption was 164.1MB. Max. memory is 8.0GB. [2022-04-08 10:33:03,660 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 188.7MB. Free memory was 155.0MB in the beginning and 154.8MB in the end (delta: 151.8kB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-08 10:33:03,660 INFO L158 Benchmark]: CACSL2BoogieTranslator took 146.83ms. Allocated memory is still 188.7MB. Free memory was 138.3MB in the beginning and 165.3MB in the end (delta: -26.9MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-08 10:33:03,660 INFO L158 Benchmark]: Boogie Preprocessor took 17.44ms. Allocated memory is still 188.7MB. Free memory was 165.3MB in the beginning and 164.0MB in the end (delta: 1.3MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-08 10:33:03,660 INFO L158 Benchmark]: RCFGBuilder took 246.65ms. Allocated memory is still 188.7MB. Free memory was 164.0MB in the beginning and 153.1MB in the end (delta: 10.9MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-08 10:33:03,660 INFO L158 Benchmark]: TraceAbstraction took 28148.51ms. Allocated memory was 188.7MB in the beginning and 306.2MB in the end (delta: 117.4MB). Free memory was 152.7MB in the beginning and 221.5MB in the end (delta: -68.8MB). Peak memory consumption was 177.9MB. Max. memory is 8.0GB. [2022-04-08 10:33:03,661 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12ms. Allocated memory is still 188.7MB. Free memory was 155.0MB in the beginning and 154.8MB in the end (delta: 151.8kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 146.83ms. Allocated memory is still 188.7MB. Free memory was 138.3MB in the beginning and 165.3MB in the end (delta: -26.9MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Preprocessor took 17.44ms. Allocated memory is still 188.7MB. Free memory was 165.3MB in the beginning and 164.0MB in the end (delta: 1.3MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 246.65ms. Allocated memory is still 188.7MB. Free memory was 164.0MB in the beginning and 153.1MB in the end (delta: 10.9MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * TraceAbstraction took 28148.51ms. Allocated memory was 188.7MB in the beginning and 306.2MB in the end (delta: 117.4MB). Free memory was 152.7MB in the beginning and 221.5MB in the end (delta: -68.8MB). Peak memory consumption was 177.9MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 29]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 23 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 28.1s, OverallIterations: 16, TraceHistogramMax: 72, PathProgramHistogramMax: 24, EmptinessCheckTime: 0.0s, AutomataDifference: 3.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 10.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 435 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 435 mSDsluCounter, 414 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 176 mSDsCounter, 94 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 422 IncrementalHoareTripleChecker+Invalid, 516 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 94 mSolverCounterUnsat, 238 mSDtfsCounter, 422 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1867 GetRequests, 1709 SyntacticMatches, 5 SemanticMatches, 153 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 287 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=196occurred in iteration=15, InterpolantAutomatonStates: 99, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.2s AutomataMinimizationTime, 16 MinimizatonAttempts, 128 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 20 LocationsWithAnnotation, 20 PreInvPairs, 213 NumberOfFragments, 124 HoareAnnotationTreeSize, 20 FomulaSimplifications, 805 FormulaSimplificationTreeSizeReduction, 8.7s HoareSimplificationTime, 20 FomulaSimplificationsInter, 13146 FormulaSimplificationTreeSizeReductionInter, 1.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: No data available, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 22]: Loop Invariant Derived loop invariant: ((b < 7 && !(c < 6)) && c < 7) && a < 6 - InvariantResult [Line: 21]: Loop Invariant Derived loop invariant: (((a < 7 && b < 7) && !(c < 6)) && c < 7) && !(b < 6) - InvariantResult [Line: 23]: Loop Invariant Derived loop invariant: (c < 7 && b <= 5) && a < 6 - ProcedureContractResult [Line: 15]: Procedure Contract for main Derived contract for procedure main: 1 RESULT: Ultimate proved your program to be correct! [2022-04-08 10:33:03,682 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...