/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/acceleratedInterpolationJordan_32.epf -i ../../../trunk/examples/svcomp/loop-invgen/heapsort.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-08 03:53:16,210 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-08 03:53:16,211 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-08 03:53:16,257 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-08 03:53:16,260 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-08 03:53:16,263 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-08 03:53:16,269 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-08 03:53:16,271 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-08 03:53:16,271 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-08 03:53:16,272 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-08 03:53:16,273 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-08 03:53:16,273 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-08 03:53:16,273 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-08 03:53:16,274 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-08 03:53:16,275 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-08 03:53:16,277 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-08 03:53:16,277 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-08 03:53:16,281 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-08 03:53:16,285 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-08 03:53:16,288 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-08 03:53:16,289 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-08 03:53:16,291 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-08 03:53:16,291 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-08 03:53:16,292 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-08 03:53:16,292 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-08 03:53:16,294 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-08 03:53:16,294 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-08 03:53:16,294 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-08 03:53:16,295 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-08 03:53:16,295 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-08 03:53:16,295 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-08 03:53:16,296 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-08 03:53:16,296 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-08 03:53:16,296 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-08 03:53:16,297 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-08 03:53:16,297 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-08 03:53:16,297 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-08 03:53:16,298 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-08 03:53:16,298 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-08 03:53:16,298 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-08 03:53:16,299 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-08 03:53:16,304 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-08 03:53:16,304 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-04-08 03:53:16,312 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-08 03:53:16,312 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-08 03:53:16,314 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-08 03:53:16,314 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-08 03:53:16,314 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-08 03:53:16,314 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-08 03:53:16,314 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-08 03:53:16,314 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-08 03:53:16,314 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-08 03:53:16,315 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-08 03:53:16,315 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-08 03:53:16,315 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-08 03:53:16,315 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-08 03:53:16,315 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-08 03:53:16,315 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-08 03:53:16,315 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-08 03:53:16,315 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-08 03:53:16,316 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-08 03:53:16,316 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 03:53:16,316 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-08 03:53:16,316 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-08 03:53:16,316 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-08 03:53:16,316 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-08 03:53:16,316 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-08 03:53:16,316 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-08 03:53:16,316 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 03:53:16,509 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-08 03:53:16,533 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-08 03:53:16,535 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-08 03:53:16,536 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-08 03:53:16,536 INFO L275 PluginConnector]: CDTParser initialized [2022-04-08 03:53:16,537 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-invgen/heapsort.i [2022-04-08 03:53:16,583 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/39b64aeae/fac50d6e92f64a5f816459cafff816cb/FLAGcc7b3712c [2022-04-08 03:53:16,870 INFO L306 CDTParser]: Found 1 translation units. [2022-04-08 03:53:16,870 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/heapsort.i [2022-04-08 03:53:16,875 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/39b64aeae/fac50d6e92f64a5f816459cafff816cb/FLAGcc7b3712c [2022-04-08 03:53:17,316 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/39b64aeae/fac50d6e92f64a5f816459cafff816cb [2022-04-08 03:53:17,318 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-08 03:53:17,318 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-08 03:53:17,325 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-08 03:53:17,325 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-08 03:53:17,328 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-08 03:53:17,329 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 03:53:17" (1/1) ... [2022-04-08 03:53:17,330 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@79699a6f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:53:17, skipping insertion in model container [2022-04-08 03:53:17,330 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 03:53:17" (1/1) ... [2022-04-08 03:53:17,334 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-08 03:53:17,346 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-08 03:53:17,495 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-invgen/heapsort.i[893,906] [2022-04-08 03:53:17,522 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 03:53:17,527 INFO L203 MainTranslator]: Completed pre-run [2022-04-08 03:53:17,543 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-invgen/heapsort.i[893,906] [2022-04-08 03:53:17,561 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 03:53:17,570 INFO L208 MainTranslator]: Completed translation [2022-04-08 03:53:17,570 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:53:17 WrapperNode [2022-04-08 03:53:17,570 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-08 03:53:17,572 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-08 03:53:17,572 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-08 03:53:17,572 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-08 03:53:17,579 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:53:17" (1/1) ... [2022-04-08 03:53:17,579 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:53:17" (1/1) ... [2022-04-08 03:53:17,590 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:53:17" (1/1) ... [2022-04-08 03:53:17,591 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:53:17" (1/1) ... [2022-04-08 03:53:17,608 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:53:17" (1/1) ... [2022-04-08 03:53:17,611 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:53:17" (1/1) ... [2022-04-08 03:53:17,612 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:53:17" (1/1) ... [2022-04-08 03:53:17,613 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-08 03:53:17,614 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-08 03:53:17,614 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-08 03:53:17,614 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-08 03:53:17,628 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:53:17" (1/1) ... [2022-04-08 03:53:17,632 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 03:53:17,639 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 03:53:17,648 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 03:53:17,663 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 03:53:17,694 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-08 03:53:17,694 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-08 03:53:17,694 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-08 03:53:17,694 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-08 03:53:17,694 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-08 03:53:17,694 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-08 03:53:17,695 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-08 03:53:17,695 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-08 03:53:17,695 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2022-04-08 03:53:17,695 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2022-04-08 03:53:17,695 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-08 03:53:17,695 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-08 03:53:17,695 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-08 03:53:17,695 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-08 03:53:17,695 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-08 03:53:17,695 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-08 03:53:17,695 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-08 03:53:17,695 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-08 03:53:17,695 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-08 03:53:17,696 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-08 03:53:17,696 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-08 03:53:17,696 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-08 03:53:17,748 INFO L234 CfgBuilder]: Building ICFG [2022-04-08 03:53:17,749 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-08 03:53:17,906 INFO L275 CfgBuilder]: Performing block encoding [2022-04-08 03:53:17,911 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-08 03:53:17,912 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-04-08 03:53:17,913 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 03:53:17 BoogieIcfgContainer [2022-04-08 03:53:17,913 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-08 03:53:17,914 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-08 03:53:17,914 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-08 03:53:17,916 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-08 03:53:17,916 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.04 03:53:17" (1/3) ... [2022-04-08 03:53:17,917 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23c5ca29 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 03:53:17, skipping insertion in model container [2022-04-08 03:53:17,917 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:53:17" (2/3) ... [2022-04-08 03:53:17,917 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23c5ca29 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 03:53:17, skipping insertion in model container [2022-04-08 03:53:17,917 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 03:53:17" (3/3) ... [2022-04-08 03:53:17,918 INFO L111 eAbstractionObserver]: Analyzing ICFG heapsort.i [2022-04-08 03:53:17,921 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-08 03:53:17,921 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-08 03:53:17,947 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-08 03:53:17,951 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 03:53:17,951 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-08 03:53:17,963 INFO L276 IsEmpty]: Start isEmpty. Operand has 44 states, 23 states have (on average 1.5217391304347827) internal successors, (35), 24 states have internal predecessors, (35), 16 states have call successors, (16), 3 states have call predecessors, (16), 3 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-08 03:53:17,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-08 03:53:17,968 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 03:53:17,968 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 03:53:17,968 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 03:53:17,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 03:53:17,972 INFO L85 PathProgramCache]: Analyzing trace with hash -250128701, now seen corresponding path program 1 times [2022-04-08 03:53:17,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 03:53:17,977 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1506199540] [2022-04-08 03:53:17,985 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 03:53:17,986 INFO L85 PathProgramCache]: Analyzing trace with hash -250128701, now seen corresponding path program 2 times [2022-04-08 03:53:17,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 03:53:17,988 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [87065868] [2022-04-08 03:53:17,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 03:53:17,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 03:53:18,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:53:18,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 03:53:18,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:53:18,215 INFO L290 TraceCheckUtils]: 0: Hoare triple {55#(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(9, 2); {47#true} is VALID [2022-04-08 03:53:18,215 INFO L290 TraceCheckUtils]: 1: Hoare triple {47#true} assume true; {47#true} is VALID [2022-04-08 03:53:18,215 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {47#true} {47#true} #138#return; {47#true} is VALID [2022-04-08 03:53:18,218 INFO L272 TraceCheckUtils]: 0: Hoare triple {47#true} call ULTIMATE.init(); {55#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 03:53:18,218 INFO L290 TraceCheckUtils]: 1: Hoare triple {55#(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(9, 2); {47#true} is VALID [2022-04-08 03:53:18,219 INFO L290 TraceCheckUtils]: 2: Hoare triple {47#true} assume true; {47#true} is VALID [2022-04-08 03:53:18,219 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {47#true} {47#true} #138#return; {47#true} is VALID [2022-04-08 03:53:18,219 INFO L272 TraceCheckUtils]: 4: Hoare triple {47#true} call #t~ret8 := main(#in~argc, #in~argv.base, #in~argv.offset); {47#true} is VALID [2022-04-08 03:53:18,219 INFO L290 TraceCheckUtils]: 5: Hoare triple {47#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;havoc ~n~0;havoc ~l~0;havoc ~r~0;havoc ~i~0;havoc ~j~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {47#true} is VALID [2022-04-08 03:53:18,220 INFO L290 TraceCheckUtils]: 6: Hoare triple {47#true} assume !!(1 <= ~n~0 && ~n~0 <= 1000000);~l~0 := 1 + (if ~n~0 < 0 && 0 != ~n~0 % 2 then 1 + ~n~0 / 2 else ~n~0 / 2);~r~0 := ~n~0; {47#true} is VALID [2022-04-08 03:53:18,220 INFO L290 TraceCheckUtils]: 7: Hoare triple {47#true} assume ~l~0 > 1;#t~post2 := ~l~0;~l~0 := #t~post2 - 1;havoc #t~post2; {47#true} is VALID [2022-04-08 03:53:18,221 INFO L290 TraceCheckUtils]: 8: Hoare triple {47#true} assume !!(~r~0 > 1);~i~0 := ~l~0;~j~0 := 2 * ~l~0; {52#(<= 1 main_~r~0)} is VALID [2022-04-08 03:53:18,221 INFO L290 TraceCheckUtils]: 9: Hoare triple {52#(<= 1 main_~r~0)} assume !(~j~0 <= ~r~0); {52#(<= 1 main_~r~0)} is VALID [2022-04-08 03:53:18,222 INFO L290 TraceCheckUtils]: 10: Hoare triple {52#(<= 1 main_~r~0)} assume !(~l~0 > 1); {52#(<= 1 main_~r~0)} is VALID [2022-04-08 03:53:18,223 INFO L272 TraceCheckUtils]: 11: Hoare triple {52#(<= 1 main_~r~0)} call __VERIFIER_assert((if 1 <= ~r~0 then 1 else 0)); {53#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 03:53:18,224 INFO L290 TraceCheckUtils]: 12: Hoare triple {53#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {54#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 03:53:18,225 INFO L290 TraceCheckUtils]: 13: Hoare triple {54#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {48#false} is VALID [2022-04-08 03:53:18,225 INFO L290 TraceCheckUtils]: 14: Hoare triple {48#false} assume !false; {48#false} is VALID [2022-04-08 03:53:18,225 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 03:53:18,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 03:53:18,226 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [87065868] [2022-04-08 03:53:18,227 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [87065868] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 03:53:18,227 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 03:53:18,227 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 03:53:18,230 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 03:53:18,231 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1506199540] [2022-04-08 03:53:18,231 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1506199540] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 03:53:18,231 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 03:53:18,231 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 03:53:18,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [648213647] [2022-04-08 03:53:18,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 03:53:18,236 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-04-08 03:53:18,238 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 03:53:18,240 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:53:18,257 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 03:53:18,257 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-08 03:53:18,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 03:53:18,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-08 03:53:18,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-08 03:53:18,278 INFO L87 Difference]: Start difference. First operand has 44 states, 23 states have (on average 1.5217391304347827) internal successors, (35), 24 states have internal predecessors, (35), 16 states have call successors, (16), 3 states have call predecessors, (16), 3 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:53:18,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:53:18,858 INFO L93 Difference]: Finished difference Result 88 states and 148 transitions. [2022-04-08 03:53:18,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-08 03:53:18,858 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-04-08 03:53:18,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 03:53:18,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:53:18,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 148 transitions. [2022-04-08 03:53:18,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:53:18,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 148 transitions. [2022-04-08 03:53:18,873 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 148 transitions. [2022-04-08 03:53:18,997 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 148 edges. 148 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:53:19,004 INFO L225 Difference]: With dead ends: 88 [2022-04-08 03:53:19,005 INFO L226 Difference]: Without dead ends: 44 [2022-04-08 03:53:19,007 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-04-08 03:53:19,009 INFO L913 BasicCegarLoop]: 42 mSDtfsCounter, 55 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 172 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-08 03:53:19,010 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [55 Valid, 63 Invalid, 219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 172 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-08 03:53:19,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-04-08 03:53:19,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 43. [2022-04-08 03:53:19,045 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 03:53:19,046 INFO L82 GeneralOperation]: Start isEquivalent. First operand 44 states. Second operand has 43 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 23 states have internal predecessors, (30), 16 states have call successors, (16), 4 states have call predecessors, (16), 3 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-08 03:53:19,046 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand has 43 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 23 states have internal predecessors, (30), 16 states have call successors, (16), 4 states have call predecessors, (16), 3 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-08 03:53:19,047 INFO L87 Difference]: Start difference. First operand 44 states. Second operand has 43 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 23 states have internal predecessors, (30), 16 states have call successors, (16), 4 states have call predecessors, (16), 3 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-08 03:53:19,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:53:19,051 INFO L93 Difference]: Finished difference Result 44 states and 62 transitions. [2022-04-08 03:53:19,051 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 62 transitions. [2022-04-08 03:53:19,052 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:53:19,052 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:53:19,053 INFO L74 IsIncluded]: Start isIncluded. First operand has 43 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 23 states have internal predecessors, (30), 16 states have call successors, (16), 4 states have call predecessors, (16), 3 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand 44 states. [2022-04-08 03:53:19,053 INFO L87 Difference]: Start difference. First operand has 43 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 23 states have internal predecessors, (30), 16 states have call successors, (16), 4 states have call predecessors, (16), 3 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand 44 states. [2022-04-08 03:53:19,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:53:19,057 INFO L93 Difference]: Finished difference Result 44 states and 62 transitions. [2022-04-08 03:53:19,057 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 62 transitions. [2022-04-08 03:53:19,057 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:53:19,058 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:53:19,058 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 03:53:19,058 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 03:53:19,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 23 states have internal predecessors, (30), 16 states have call successors, (16), 4 states have call predecessors, (16), 3 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-08 03:53:19,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 61 transitions. [2022-04-08 03:53:19,062 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 61 transitions. Word has length 15 [2022-04-08 03:53:19,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 03:53:19,062 INFO L478 AbstractCegarLoop]: Abstraction has 43 states and 61 transitions. [2022-04-08 03:53:19,063 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:53:19,063 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 43 states and 61 transitions. [2022-04-08 03:53:19,117 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:53:19,118 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 61 transitions. [2022-04-08 03:53:19,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-08 03:53:19,118 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 03:53:19,118 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 03:53:19,118 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-08 03:53:19,119 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 03:53:19,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 03:53:19,119 INFO L85 PathProgramCache]: Analyzing trace with hash -254865470, now seen corresponding path program 1 times [2022-04-08 03:53:19,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 03:53:19,120 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1810779883] [2022-04-08 03:53:19,120 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 03:53:19,120 INFO L85 PathProgramCache]: Analyzing trace with hash -254865470, now seen corresponding path program 2 times [2022-04-08 03:53:19,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 03:53:19,120 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1542701278] [2022-04-08 03:53:19,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 03:53:19,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 03:53:19,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:53:19,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 03:53:19,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:53:19,187 INFO L290 TraceCheckUtils]: 0: Hoare triple {425#(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(9, 2); {417#true} is VALID [2022-04-08 03:53:19,187 INFO L290 TraceCheckUtils]: 1: Hoare triple {417#true} assume true; {417#true} is VALID [2022-04-08 03:53:19,187 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {417#true} {417#true} #138#return; {417#true} is VALID [2022-04-08 03:53:19,188 INFO L272 TraceCheckUtils]: 0: Hoare triple {417#true} call ULTIMATE.init(); {425#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 03:53:19,188 INFO L290 TraceCheckUtils]: 1: Hoare triple {425#(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(9, 2); {417#true} is VALID [2022-04-08 03:53:19,188 INFO L290 TraceCheckUtils]: 2: Hoare triple {417#true} assume true; {417#true} is VALID [2022-04-08 03:53:19,188 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {417#true} {417#true} #138#return; {417#true} is VALID [2022-04-08 03:53:19,188 INFO L272 TraceCheckUtils]: 4: Hoare triple {417#true} call #t~ret8 := main(#in~argc, #in~argv.base, #in~argv.offset); {417#true} is VALID [2022-04-08 03:53:19,189 INFO L290 TraceCheckUtils]: 5: Hoare triple {417#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;havoc ~n~0;havoc ~l~0;havoc ~r~0;havoc ~i~0;havoc ~j~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {417#true} is VALID [2022-04-08 03:53:19,189 INFO L290 TraceCheckUtils]: 6: Hoare triple {417#true} assume !!(1 <= ~n~0 && ~n~0 <= 1000000);~l~0 := 1 + (if ~n~0 < 0 && 0 != ~n~0 % 2 then 1 + ~n~0 / 2 else ~n~0 / 2);~r~0 := ~n~0; {417#true} is VALID [2022-04-08 03:53:19,189 INFO L290 TraceCheckUtils]: 7: Hoare triple {417#true} assume ~l~0 > 1;#t~post2 := ~l~0;~l~0 := #t~post2 - 1;havoc #t~post2; {417#true} is VALID [2022-04-08 03:53:19,189 INFO L290 TraceCheckUtils]: 8: Hoare triple {417#true} assume !!(~r~0 > 1);~i~0 := ~l~0;~j~0 := 2 * ~l~0; {417#true} is VALID [2022-04-08 03:53:19,189 INFO L290 TraceCheckUtils]: 9: Hoare triple {417#true} assume !(~j~0 <= ~r~0); {417#true} is VALID [2022-04-08 03:53:19,190 INFO L290 TraceCheckUtils]: 10: Hoare triple {417#true} assume ~l~0 > 1; {422#(<= 1 main_~l~0)} is VALID [2022-04-08 03:53:19,190 INFO L272 TraceCheckUtils]: 11: Hoare triple {422#(<= 1 main_~l~0)} call __VERIFIER_assert((if 1 <= ~l~0 then 1 else 0)); {423#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 03:53:19,191 INFO L290 TraceCheckUtils]: 12: Hoare triple {423#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {424#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 03:53:19,191 INFO L290 TraceCheckUtils]: 13: Hoare triple {424#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {418#false} is VALID [2022-04-08 03:53:19,191 INFO L290 TraceCheckUtils]: 14: Hoare triple {418#false} assume !false; {418#false} is VALID [2022-04-08 03:53:19,191 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 03:53:19,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 03:53:19,192 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1542701278] [2022-04-08 03:53:19,192 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1542701278] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 03:53:19,192 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 03:53:19,192 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 03:53:19,192 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 03:53:19,192 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1810779883] [2022-04-08 03:53:19,192 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1810779883] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 03:53:19,192 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 03:53:19,193 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 03:53:19,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [807798344] [2022-04-08 03:53:19,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 03:53:19,193 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-04-08 03:53:19,194 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 03:53:19,194 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:53:19,203 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 03:53:19,203 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-08 03:53:19,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 03:53:19,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-08 03:53:19,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-08 03:53:19,204 INFO L87 Difference]: Start difference. First operand 43 states and 61 transitions. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:53:19,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:53:19,806 INFO L93 Difference]: Finished difference Result 71 states and 105 transitions. [2022-04-08 03:53:19,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-08 03:53:19,806 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-04-08 03:53:19,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 03:53:19,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:53:19,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 102 transitions. [2022-04-08 03:53:19,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:53:19,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 102 transitions. [2022-04-08 03:53:19,813 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 102 transitions. [2022-04-08 03:53:19,905 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 102 edges. 102 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:53:19,908 INFO L225 Difference]: With dead ends: 71 [2022-04-08 03:53:19,908 INFO L226 Difference]: Without dead ends: 69 [2022-04-08 03:53:19,909 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-04-08 03:53:19,910 INFO L913 BasicCegarLoop]: 39 mSDtfsCounter, 57 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 272 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-08 03:53:19,910 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [69 Valid, 56 Invalid, 272 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 212 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-08 03:53:19,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2022-04-08 03:53:19,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 47. [2022-04-08 03:53:19,940 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 03:53:19,941 INFO L82 GeneralOperation]: Start isEquivalent. First operand 69 states. Second operand has 47 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 26 states have internal predecessors, (33), 16 states have call successors, (16), 5 states have call predecessors, (16), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-08 03:53:19,941 INFO L74 IsIncluded]: Start isIncluded. First operand 69 states. Second operand has 47 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 26 states have internal predecessors, (33), 16 states have call successors, (16), 5 states have call predecessors, (16), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-08 03:53:19,941 INFO L87 Difference]: Start difference. First operand 69 states. Second operand has 47 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 26 states have internal predecessors, (33), 16 states have call successors, (16), 5 states have call predecessors, (16), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-08 03:53:19,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:53:19,947 INFO L93 Difference]: Finished difference Result 69 states and 103 transitions. [2022-04-08 03:53:19,948 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 103 transitions. [2022-04-08 03:53:19,949 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:53:19,949 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:53:19,950 INFO L74 IsIncluded]: Start isIncluded. First operand has 47 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 26 states have internal predecessors, (33), 16 states have call successors, (16), 5 states have call predecessors, (16), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand 69 states. [2022-04-08 03:53:19,950 INFO L87 Difference]: Start difference. First operand has 47 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 26 states have internal predecessors, (33), 16 states have call successors, (16), 5 states have call predecessors, (16), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand 69 states. [2022-04-08 03:53:19,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:53:19,954 INFO L93 Difference]: Finished difference Result 69 states and 103 transitions. [2022-04-08 03:53:19,954 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 103 transitions. [2022-04-08 03:53:19,955 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:53:19,955 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:53:19,955 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 03:53:19,955 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 03:53:19,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 26 states have internal predecessors, (33), 16 states have call successors, (16), 5 states have call predecessors, (16), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-08 03:53:19,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 64 transitions. [2022-04-08 03:53:19,957 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 64 transitions. Word has length 15 [2022-04-08 03:53:19,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 03:53:19,958 INFO L478 AbstractCegarLoop]: Abstraction has 47 states and 64 transitions. [2022-04-08 03:53:19,958 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:53:19,958 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 47 states and 64 transitions. [2022-04-08 03:53:20,032 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:53:20,032 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 64 transitions. [2022-04-08 03:53:20,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-08 03:53:20,032 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 03:53:20,033 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 03:53:20,033 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-08 03:53:20,033 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 03:53:20,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 03:53:20,033 INFO L85 PathProgramCache]: Analyzing trace with hash -216435080, now seen corresponding path program 1 times [2022-04-08 03:53:20,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 03:53:20,034 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1030435775] [2022-04-08 03:53:20,035 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 03:53:20,035 INFO L85 PathProgramCache]: Analyzing trace with hash -216435080, now seen corresponding path program 2 times [2022-04-08 03:53:20,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 03:53:20,035 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1700325991] [2022-04-08 03:53:20,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 03:53:20,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 03:53:20,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:53:20,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 03:53:20,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:53:20,086 INFO L290 TraceCheckUtils]: 0: Hoare triple {820#(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(9, 2); {811#true} is VALID [2022-04-08 03:53:20,086 INFO L290 TraceCheckUtils]: 1: Hoare triple {811#true} assume true; {811#true} is VALID [2022-04-08 03:53:20,087 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {811#true} {811#true} #138#return; {811#true} is VALID [2022-04-08 03:53:20,087 INFO L272 TraceCheckUtils]: 0: Hoare triple {811#true} call ULTIMATE.init(); {820#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 03:53:20,087 INFO L290 TraceCheckUtils]: 1: Hoare triple {820#(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(9, 2); {811#true} is VALID [2022-04-08 03:53:20,087 INFO L290 TraceCheckUtils]: 2: Hoare triple {811#true} assume true; {811#true} is VALID [2022-04-08 03:53:20,088 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {811#true} {811#true} #138#return; {811#true} is VALID [2022-04-08 03:53:20,088 INFO L272 TraceCheckUtils]: 4: Hoare triple {811#true} call #t~ret8 := main(#in~argc, #in~argv.base, #in~argv.offset); {811#true} is VALID [2022-04-08 03:53:20,088 INFO L290 TraceCheckUtils]: 5: Hoare triple {811#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;havoc ~n~0;havoc ~l~0;havoc ~r~0;havoc ~i~0;havoc ~j~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {811#true} is VALID [2022-04-08 03:53:20,088 INFO L290 TraceCheckUtils]: 6: Hoare triple {811#true} assume !!(1 <= ~n~0 && ~n~0 <= 1000000);~l~0 := 1 + (if ~n~0 < 0 && 0 != ~n~0 % 2 then 1 + ~n~0 / 2 else ~n~0 / 2);~r~0 := ~n~0; {811#true} is VALID [2022-04-08 03:53:20,088 INFO L290 TraceCheckUtils]: 7: Hoare triple {811#true} assume ~l~0 > 1;#t~post2 := ~l~0;~l~0 := #t~post2 - 1;havoc #t~post2; {811#true} is VALID [2022-04-08 03:53:20,089 INFO L290 TraceCheckUtils]: 8: Hoare triple {811#true} assume !!(~r~0 > 1);~i~0 := ~l~0;~j~0 := 2 * ~l~0; {816#(<= 2 main_~r~0)} is VALID [2022-04-08 03:53:20,089 INFO L290 TraceCheckUtils]: 9: Hoare triple {816#(<= 2 main_~r~0)} assume !!(~j~0 <= ~r~0); {816#(<= 2 main_~r~0)} is VALID [2022-04-08 03:53:20,090 INFO L290 TraceCheckUtils]: 10: Hoare triple {816#(<= 2 main_~r~0)} assume !(~j~0 < ~r~0); {817#(<= 2 main_~j~0)} is VALID [2022-04-08 03:53:20,090 INFO L272 TraceCheckUtils]: 11: Hoare triple {817#(<= 2 main_~j~0)} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {818#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 03:53:20,091 INFO L290 TraceCheckUtils]: 12: Hoare triple {818#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {819#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 03:53:20,091 INFO L290 TraceCheckUtils]: 13: Hoare triple {819#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {812#false} is VALID [2022-04-08 03:53:20,091 INFO L290 TraceCheckUtils]: 14: Hoare triple {812#false} assume !false; {812#false} is VALID [2022-04-08 03:53:20,092 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 03:53:20,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 03:53:20,092 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1700325991] [2022-04-08 03:53:20,092 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1700325991] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 03:53:20,092 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 03:53:20,092 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-08 03:53:20,093 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 03:53:20,093 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1030435775] [2022-04-08 03:53:20,093 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1030435775] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 03:53:20,093 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 03:53:20,093 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-08 03:53:20,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [731410281] [2022-04-08 03:53:20,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 03:53:20,093 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-04-08 03:53:20,094 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 03:53:20,094 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:53:20,103 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 03:53:20,103 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-08 03:53:20,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 03:53:20,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-08 03:53:20,104 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-04-08 03:53:20,104 INFO L87 Difference]: Start difference. First operand 47 states and 64 transitions. Second operand has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:53:20,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:53:20,988 INFO L93 Difference]: Finished difference Result 80 states and 115 transitions. [2022-04-08 03:53:20,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-08 03:53:20,989 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-04-08 03:53:20,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 03:53:20,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:53:20,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 109 transitions. [2022-04-08 03:53:20,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:53:20,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 109 transitions. [2022-04-08 03:53:20,994 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 109 transitions. [2022-04-08 03:53:21,121 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 109 edges. 109 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:53:21,125 INFO L225 Difference]: With dead ends: 80 [2022-04-08 03:53:21,125 INFO L226 Difference]: Without dead ends: 78 [2022-04-08 03:53:21,126 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2022-04-08 03:53:21,129 INFO L913 BasicCegarLoop]: 43 mSDtfsCounter, 68 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 283 mSolverCounterSat, 109 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 392 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 109 IncrementalHoareTripleChecker+Valid, 283 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-08 03:53:21,130 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [68 Valid, 65 Invalid, 392 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [109 Valid, 283 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-08 03:53:21,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2022-04-08 03:53:21,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 68. [2022-04-08 03:53:21,207 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 03:53:21,208 INFO L82 GeneralOperation]: Start isEquivalent. First operand 78 states. Second operand has 68 states, 36 states have (on average 1.3055555555555556) internal successors, (47), 36 states have internal predecessors, (47), 26 states have call successors, (26), 6 states have call predecessors, (26), 5 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2022-04-08 03:53:21,208 INFO L74 IsIncluded]: Start isIncluded. First operand 78 states. Second operand has 68 states, 36 states have (on average 1.3055555555555556) internal successors, (47), 36 states have internal predecessors, (47), 26 states have call successors, (26), 6 states have call predecessors, (26), 5 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2022-04-08 03:53:21,208 INFO L87 Difference]: Start difference. First operand 78 states. Second operand has 68 states, 36 states have (on average 1.3055555555555556) internal successors, (47), 36 states have internal predecessors, (47), 26 states have call successors, (26), 6 states have call predecessors, (26), 5 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2022-04-08 03:53:21,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:53:21,212 INFO L93 Difference]: Finished difference Result 78 states and 113 transitions. [2022-04-08 03:53:21,212 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 113 transitions. [2022-04-08 03:53:21,213 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:53:21,213 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:53:21,213 INFO L74 IsIncluded]: Start isIncluded. First operand has 68 states, 36 states have (on average 1.3055555555555556) internal successors, (47), 36 states have internal predecessors, (47), 26 states have call successors, (26), 6 states have call predecessors, (26), 5 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) Second operand 78 states. [2022-04-08 03:53:21,214 INFO L87 Difference]: Start difference. First operand has 68 states, 36 states have (on average 1.3055555555555556) internal successors, (47), 36 states have internal predecessors, (47), 26 states have call successors, (26), 6 states have call predecessors, (26), 5 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) Second operand 78 states. [2022-04-08 03:53:21,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:53:21,217 INFO L93 Difference]: Finished difference Result 78 states and 113 transitions. [2022-04-08 03:53:21,217 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 113 transitions. [2022-04-08 03:53:21,218 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:53:21,218 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:53:21,218 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 03:53:21,218 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 03:53:21,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 36 states have (on average 1.3055555555555556) internal successors, (47), 36 states have internal predecessors, (47), 26 states have call successors, (26), 6 states have call predecessors, (26), 5 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2022-04-08 03:53:21,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 98 transitions. [2022-04-08 03:53:21,221 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 98 transitions. Word has length 15 [2022-04-08 03:53:21,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 03:53:21,221 INFO L478 AbstractCegarLoop]: Abstraction has 68 states and 98 transitions. [2022-04-08 03:53:21,221 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:53:21,221 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 68 states and 98 transitions. [2022-04-08 03:53:21,310 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 98 edges. 98 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:53:21,310 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 98 transitions. [2022-04-08 03:53:21,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-08 03:53:21,311 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 03:53:21,311 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 03:53:21,311 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-08 03:53:21,311 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 03:53:21,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 03:53:21,312 INFO L85 PathProgramCache]: Analyzing trace with hash -228679181, now seen corresponding path program 1 times [2022-04-08 03:53:21,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 03:53:21,312 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [952129561] [2022-04-08 03:53:21,312 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 03:53:21,313 INFO L85 PathProgramCache]: Analyzing trace with hash -228679181, now seen corresponding path program 2 times [2022-04-08 03:53:21,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 03:53:21,313 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1267579200] [2022-04-08 03:53:21,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 03:53:21,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 03:53:21,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:53:21,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 03:53:21,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:53:21,360 INFO L290 TraceCheckUtils]: 0: Hoare triple {1296#(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(9, 2); {1287#true} is VALID [2022-04-08 03:53:21,360 INFO L290 TraceCheckUtils]: 1: Hoare triple {1287#true} assume true; {1287#true} is VALID [2022-04-08 03:53:21,368 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1287#true} {1287#true} #138#return; {1287#true} is VALID [2022-04-08 03:53:21,369 INFO L272 TraceCheckUtils]: 0: Hoare triple {1287#true} call ULTIMATE.init(); {1296#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 03:53:21,370 INFO L290 TraceCheckUtils]: 1: Hoare triple {1296#(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(9, 2); {1287#true} is VALID [2022-04-08 03:53:21,370 INFO L290 TraceCheckUtils]: 2: Hoare triple {1287#true} assume true; {1287#true} is VALID [2022-04-08 03:53:21,370 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1287#true} {1287#true} #138#return; {1287#true} is VALID [2022-04-08 03:53:21,370 INFO L272 TraceCheckUtils]: 4: Hoare triple {1287#true} call #t~ret8 := main(#in~argc, #in~argv.base, #in~argv.offset); {1287#true} is VALID [2022-04-08 03:53:21,370 INFO L290 TraceCheckUtils]: 5: Hoare triple {1287#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;havoc ~n~0;havoc ~l~0;havoc ~r~0;havoc ~i~0;havoc ~j~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {1287#true} is VALID [2022-04-08 03:53:21,371 INFO L290 TraceCheckUtils]: 6: Hoare triple {1287#true} assume !!(1 <= ~n~0 && ~n~0 <= 1000000);~l~0 := 1 + (if ~n~0 < 0 && 0 != ~n~0 % 2 then 1 + ~n~0 / 2 else ~n~0 / 2);~r~0 := ~n~0; {1287#true} is VALID [2022-04-08 03:53:21,371 INFO L290 TraceCheckUtils]: 7: Hoare triple {1287#true} assume ~l~0 > 1;#t~post2 := ~l~0;~l~0 := #t~post2 - 1;havoc #t~post2; {1292#(<= 1 main_~l~0)} is VALID [2022-04-08 03:53:21,372 INFO L290 TraceCheckUtils]: 8: Hoare triple {1292#(<= 1 main_~l~0)} assume !!(~r~0 > 1);~i~0 := ~l~0;~j~0 := 2 * ~l~0; {1293#(<= 2 main_~j~0)} is VALID [2022-04-08 03:53:21,372 INFO L290 TraceCheckUtils]: 9: Hoare triple {1293#(<= 2 main_~j~0)} assume !!(~j~0 <= ~r~0); {1293#(<= 2 main_~j~0)} is VALID [2022-04-08 03:53:21,374 INFO L290 TraceCheckUtils]: 10: Hoare triple {1293#(<= 2 main_~j~0)} assume ~j~0 < ~r~0; {1293#(<= 2 main_~j~0)} is VALID [2022-04-08 03:53:21,375 INFO L272 TraceCheckUtils]: 11: Hoare triple {1293#(<= 2 main_~j~0)} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {1294#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 03:53:21,376 INFO L290 TraceCheckUtils]: 12: Hoare triple {1294#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {1295#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 03:53:21,376 INFO L290 TraceCheckUtils]: 13: Hoare triple {1295#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {1288#false} is VALID [2022-04-08 03:53:21,376 INFO L290 TraceCheckUtils]: 14: Hoare triple {1288#false} assume !false; {1288#false} is VALID [2022-04-08 03:53:21,376 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 03:53:21,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 03:53:21,377 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1267579200] [2022-04-08 03:53:21,377 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1267579200] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 03:53:21,377 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 03:53:21,377 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-08 03:53:21,377 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 03:53:21,377 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [952129561] [2022-04-08 03:53:21,377 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [952129561] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 03:53:21,378 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 03:53:21,378 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-08 03:53:21,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702730841] [2022-04-08 03:53:21,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 03:53:21,378 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-04-08 03:53:21,378 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 03:53:21,378 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:53:21,387 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 03:53:21,387 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-08 03:53:21,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 03:53:21,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-08 03:53:21,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-04-08 03:53:21,388 INFO L87 Difference]: Start difference. First operand 68 states and 98 transitions. Second operand has 7 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:53:22,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:53:22,153 INFO L93 Difference]: Finished difference Result 122 states and 183 transitions. [2022-04-08 03:53:22,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-08 03:53:22,154 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-04-08 03:53:22,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 03:53:22,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:53:22,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 109 transitions. [2022-04-08 03:53:22,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:53:22,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 109 transitions. [2022-04-08 03:53:22,158 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 109 transitions. [2022-04-08 03:53:22,247 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 109 edges. 109 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:53:22,250 INFO L225 Difference]: With dead ends: 122 [2022-04-08 03:53:22,250 INFO L226 Difference]: Without dead ends: 120 [2022-04-08 03:53:22,250 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2022-04-08 03:53:22,251 INFO L913 BasicCegarLoop]: 34 mSDtfsCounter, 65 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 285 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 378 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 285 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-08 03:53:22,251 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [77 Valid, 56 Invalid, 378 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 285 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-08 03:53:22,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2022-04-08 03:53:22,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 94. [2022-04-08 03:53:22,363 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 03:53:22,363 INFO L82 GeneralOperation]: Start isEquivalent. First operand 120 states. Second operand has 94 states, 49 states have (on average 1.3265306122448979) internal successors, (65), 49 states have internal predecessors, (65), 38 states have call successors, (38), 7 states have call predecessors, (38), 6 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) [2022-04-08 03:53:22,364 INFO L74 IsIncluded]: Start isIncluded. First operand 120 states. Second operand has 94 states, 49 states have (on average 1.3265306122448979) internal successors, (65), 49 states have internal predecessors, (65), 38 states have call successors, (38), 7 states have call predecessors, (38), 6 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) [2022-04-08 03:53:22,364 INFO L87 Difference]: Start difference. First operand 120 states. Second operand has 94 states, 49 states have (on average 1.3265306122448979) internal successors, (65), 49 states have internal predecessors, (65), 38 states have call successors, (38), 7 states have call predecessors, (38), 6 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) [2022-04-08 03:53:22,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:53:22,371 INFO L93 Difference]: Finished difference Result 120 states and 181 transitions. [2022-04-08 03:53:22,371 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 181 transitions. [2022-04-08 03:53:22,372 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:53:22,372 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:53:22,372 INFO L74 IsIncluded]: Start isIncluded. First operand has 94 states, 49 states have (on average 1.3265306122448979) internal successors, (65), 49 states have internal predecessors, (65), 38 states have call successors, (38), 7 states have call predecessors, (38), 6 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) Second operand 120 states. [2022-04-08 03:53:22,373 INFO L87 Difference]: Start difference. First operand has 94 states, 49 states have (on average 1.3265306122448979) internal successors, (65), 49 states have internal predecessors, (65), 38 states have call successors, (38), 7 states have call predecessors, (38), 6 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) Second operand 120 states. [2022-04-08 03:53:22,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:53:22,378 INFO L93 Difference]: Finished difference Result 120 states and 181 transitions. [2022-04-08 03:53:22,378 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 181 transitions. [2022-04-08 03:53:22,379 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:53:22,379 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:53:22,379 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 03:53:22,379 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 03:53:22,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 49 states have (on average 1.3265306122448979) internal successors, (65), 49 states have internal predecessors, (65), 38 states have call successors, (38), 7 states have call predecessors, (38), 6 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) [2022-04-08 03:53:22,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 140 transitions. [2022-04-08 03:53:22,383 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 140 transitions. Word has length 15 [2022-04-08 03:53:22,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 03:53:22,384 INFO L478 AbstractCegarLoop]: Abstraction has 94 states and 140 transitions. [2022-04-08 03:53:22,384 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:53:22,384 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 94 states and 140 transitions. [2022-04-08 03:53:22,532 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 140 edges. 140 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:53:22,533 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 140 transitions. [2022-04-08 03:53:22,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-08 03:53:22,533 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 03:53:22,533 INFO L499 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 03:53:22,533 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-08 03:53:22,534 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 03:53:22,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 03:53:22,534 INFO L85 PathProgramCache]: Analyzing trace with hash 1266022048, now seen corresponding path program 1 times [2022-04-08 03:53:22,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 03:53:22,534 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1321626496] [2022-04-08 03:53:22,535 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 03:53:22,535 INFO L85 PathProgramCache]: Analyzing trace with hash 1266022048, now seen corresponding path program 2 times [2022-04-08 03:53:22,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 03:53:22,535 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [228548961] [2022-04-08 03:53:22,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 03:53:22,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 03:53:22,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:53:22,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 03:53:22,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:53:22,584 INFO L290 TraceCheckUtils]: 0: Hoare triple {1996#(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(9, 2); {1984#true} is VALID [2022-04-08 03:53:22,584 INFO L290 TraceCheckUtils]: 1: Hoare triple {1984#true} assume true; {1984#true} is VALID [2022-04-08 03:53:22,584 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1984#true} {1984#true} #138#return; {1984#true} is VALID [2022-04-08 03:53:22,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-08 03:53:22,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:53:22,588 INFO L290 TraceCheckUtils]: 0: Hoare triple {1984#true} ~cond := #in~cond; {1984#true} is VALID [2022-04-08 03:53:22,589 INFO L290 TraceCheckUtils]: 1: Hoare triple {1984#true} assume !(0 == ~cond); {1984#true} is VALID [2022-04-08 03:53:22,589 INFO L290 TraceCheckUtils]: 2: Hoare triple {1984#true} assume true; {1984#true} is VALID [2022-04-08 03:53:22,590 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1984#true} {1989#(<= main_~r~0 main_~n~0)} #134#return; {1989#(<= main_~r~0 main_~n~0)} is VALID [2022-04-08 03:53:22,590 INFO L272 TraceCheckUtils]: 0: Hoare triple {1984#true} call ULTIMATE.init(); {1996#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 03:53:22,591 INFO L290 TraceCheckUtils]: 1: Hoare triple {1996#(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(9, 2); {1984#true} is VALID [2022-04-08 03:53:22,591 INFO L290 TraceCheckUtils]: 2: Hoare triple {1984#true} assume true; {1984#true} is VALID [2022-04-08 03:53:22,591 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1984#true} {1984#true} #138#return; {1984#true} is VALID [2022-04-08 03:53:22,591 INFO L272 TraceCheckUtils]: 4: Hoare triple {1984#true} call #t~ret8 := main(#in~argc, #in~argv.base, #in~argv.offset); {1984#true} is VALID [2022-04-08 03:53:22,591 INFO L290 TraceCheckUtils]: 5: Hoare triple {1984#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;havoc ~n~0;havoc ~l~0;havoc ~r~0;havoc ~i~0;havoc ~j~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {1984#true} is VALID [2022-04-08 03:53:22,592 INFO L290 TraceCheckUtils]: 6: Hoare triple {1984#true} assume !!(1 <= ~n~0 && ~n~0 <= 1000000);~l~0 := 1 + (if ~n~0 < 0 && 0 != ~n~0 % 2 then 1 + ~n~0 / 2 else ~n~0 / 2);~r~0 := ~n~0; {1989#(<= main_~r~0 main_~n~0)} is VALID [2022-04-08 03:53:22,592 INFO L290 TraceCheckUtils]: 7: Hoare triple {1989#(<= main_~r~0 main_~n~0)} assume ~l~0 > 1;#t~post2 := ~l~0;~l~0 := #t~post2 - 1;havoc #t~post2; {1989#(<= main_~r~0 main_~n~0)} is VALID [2022-04-08 03:53:22,592 INFO L290 TraceCheckUtils]: 8: Hoare triple {1989#(<= main_~r~0 main_~n~0)} assume !!(~r~0 > 1);~i~0 := ~l~0;~j~0 := 2 * ~l~0; {1989#(<= main_~r~0 main_~n~0)} is VALID [2022-04-08 03:53:22,593 INFO L290 TraceCheckUtils]: 9: Hoare triple {1989#(<= main_~r~0 main_~n~0)} assume !(~j~0 <= ~r~0); {1989#(<= main_~r~0 main_~n~0)} is VALID [2022-04-08 03:53:22,593 INFO L290 TraceCheckUtils]: 10: Hoare triple {1989#(<= main_~r~0 main_~n~0)} assume !(~l~0 > 1); {1989#(<= main_~r~0 main_~n~0)} is VALID [2022-04-08 03:53:22,593 INFO L272 TraceCheckUtils]: 11: Hoare triple {1989#(<= main_~r~0 main_~n~0)} call __VERIFIER_assert((if 1 <= ~r~0 then 1 else 0)); {1984#true} is VALID [2022-04-08 03:53:22,593 INFO L290 TraceCheckUtils]: 12: Hoare triple {1984#true} ~cond := #in~cond; {1984#true} is VALID [2022-04-08 03:53:22,594 INFO L290 TraceCheckUtils]: 13: Hoare triple {1984#true} assume !(0 == ~cond); {1984#true} is VALID [2022-04-08 03:53:22,594 INFO L290 TraceCheckUtils]: 14: Hoare triple {1984#true} assume true; {1984#true} is VALID [2022-04-08 03:53:22,594 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1984#true} {1989#(<= main_~r~0 main_~n~0)} #134#return; {1989#(<= main_~r~0 main_~n~0)} is VALID [2022-04-08 03:53:22,595 INFO L272 TraceCheckUtils]: 16: Hoare triple {1989#(<= main_~r~0 main_~n~0)} call __VERIFIER_assert((if ~r~0 <= ~n~0 then 1 else 0)); {1994#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 03:53:22,596 INFO L290 TraceCheckUtils]: 17: Hoare triple {1994#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {1995#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 03:53:22,596 INFO L290 TraceCheckUtils]: 18: Hoare triple {1995#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {1985#false} is VALID [2022-04-08 03:53:22,596 INFO L290 TraceCheckUtils]: 19: Hoare triple {1985#false} assume !false; {1985#false} is VALID [2022-04-08 03:53:22,597 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 03:53:22,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 03:53:22,597 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [228548961] [2022-04-08 03:53:22,597 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [228548961] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 03:53:22,597 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 03:53:22,597 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 03:53:22,597 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 03:53:22,597 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1321626496] [2022-04-08 03:53:22,597 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1321626496] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 03:53:22,598 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 03:53:22,598 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 03:53:22,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1171478125] [2022-04-08 03:53:22,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 03:53:22,599 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 20 [2022-04-08 03:53:22,599 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 03:53:22,600 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 03:53:22,611 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 03:53:22,611 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-08 03:53:22,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 03:53:22,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-08 03:53:22,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-08 03:53:22,613 INFO L87 Difference]: Start difference. First operand 94 states and 140 transitions. Second operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 03:53:23,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:53:23,149 INFO L93 Difference]: Finished difference Result 100 states and 145 transitions. [2022-04-08 03:53:23,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-08 03:53:23,150 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 20 [2022-04-08 03:53:23,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 03:53:23,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 03:53:23,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 63 transitions. [2022-04-08 03:53:23,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 03:53:23,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 63 transitions. [2022-04-08 03:53:23,152 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 63 transitions. [2022-04-08 03:53:23,207 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:53:23,209 INFO L225 Difference]: With dead ends: 100 [2022-04-08 03:53:23,209 INFO L226 Difference]: Without dead ends: 98 [2022-04-08 03:53:23,209 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-04-08 03:53:23,210 INFO L913 BasicCegarLoop]: 38 mSDtfsCounter, 39 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-08 03:53:23,210 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [39 Valid, 55 Invalid, 197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-08 03:53:23,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2022-04-08 03:53:23,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2022-04-08 03:53:23,355 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 03:53:23,356 INFO L82 GeneralOperation]: Start isEquivalent. First operand 98 states. Second operand has 98 states, 52 states have (on average 1.3076923076923077) internal successors, (68), 52 states have internal predecessors, (68), 38 states have call successors, (38), 8 states have call predecessors, (38), 7 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) [2022-04-08 03:53:23,357 INFO L74 IsIncluded]: Start isIncluded. First operand 98 states. Second operand has 98 states, 52 states have (on average 1.3076923076923077) internal successors, (68), 52 states have internal predecessors, (68), 38 states have call successors, (38), 8 states have call predecessors, (38), 7 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) [2022-04-08 03:53:23,357 INFO L87 Difference]: Start difference. First operand 98 states. Second operand has 98 states, 52 states have (on average 1.3076923076923077) internal successors, (68), 52 states have internal predecessors, (68), 38 states have call successors, (38), 8 states have call predecessors, (38), 7 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) [2022-04-08 03:53:23,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:53:23,361 INFO L93 Difference]: Finished difference Result 98 states and 143 transitions. [2022-04-08 03:53:23,361 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 143 transitions. [2022-04-08 03:53:23,361 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:53:23,361 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:53:23,362 INFO L74 IsIncluded]: Start isIncluded. First operand has 98 states, 52 states have (on average 1.3076923076923077) internal successors, (68), 52 states have internal predecessors, (68), 38 states have call successors, (38), 8 states have call predecessors, (38), 7 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) Second operand 98 states. [2022-04-08 03:53:23,362 INFO L87 Difference]: Start difference. First operand has 98 states, 52 states have (on average 1.3076923076923077) internal successors, (68), 52 states have internal predecessors, (68), 38 states have call successors, (38), 8 states have call predecessors, (38), 7 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) Second operand 98 states. [2022-04-08 03:53:23,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:53:23,365 INFO L93 Difference]: Finished difference Result 98 states and 143 transitions. [2022-04-08 03:53:23,365 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 143 transitions. [2022-04-08 03:53:23,366 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:53:23,366 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:53:23,366 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 03:53:23,366 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 03:53:23,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 52 states have (on average 1.3076923076923077) internal successors, (68), 52 states have internal predecessors, (68), 38 states have call successors, (38), 8 states have call predecessors, (38), 7 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) [2022-04-08 03:53:23,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 143 transitions. [2022-04-08 03:53:23,370 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 143 transitions. Word has length 20 [2022-04-08 03:53:23,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 03:53:23,370 INFO L478 AbstractCegarLoop]: Abstraction has 98 states and 143 transitions. [2022-04-08 03:53:23,370 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 03:53:23,370 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 98 states and 143 transitions. [2022-04-08 03:53:23,516 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 143 edges. 143 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:53:23,516 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 143 transitions. [2022-04-08 03:53:23,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-08 03:53:23,516 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 03:53:23,517 INFO L499 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 03:53:23,517 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-04-08 03:53:23,517 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 03:53:23,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 03:53:23,518 INFO L85 PathProgramCache]: Analyzing trace with hash 884659585, now seen corresponding path program 1 times [2022-04-08 03:53:23,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 03:53:23,518 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1093846376] [2022-04-08 03:53:23,518 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 03:53:23,518 INFO L85 PathProgramCache]: Analyzing trace with hash 884659585, now seen corresponding path program 2 times [2022-04-08 03:53:23,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 03:53:23,519 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1372697212] [2022-04-08 03:53:23,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 03:53:23,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 03:53:23,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:53:23,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 03:53:23,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:53:23,591 INFO L290 TraceCheckUtils]: 0: Hoare triple {2613#(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(9, 2); {2599#true} is VALID [2022-04-08 03:53:23,591 INFO L290 TraceCheckUtils]: 1: Hoare triple {2599#true} assume true; {2599#true} is VALID [2022-04-08 03:53:23,591 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2599#true} {2599#true} #138#return; {2599#true} is VALID [2022-04-08 03:53:23,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-08 03:53:23,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:53:23,600 INFO L290 TraceCheckUtils]: 0: Hoare triple {2599#true} ~cond := #in~cond; {2599#true} is VALID [2022-04-08 03:53:23,601 INFO L290 TraceCheckUtils]: 1: Hoare triple {2599#true} assume !(0 == ~cond); {2599#true} is VALID [2022-04-08 03:53:23,601 INFO L290 TraceCheckUtils]: 2: Hoare triple {2599#true} assume true; {2599#true} is VALID [2022-04-08 03:53:23,601 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2599#true} {2606#(<= (+ main_~l~0 1) main_~n~0)} #130#return; {2606#(<= (+ main_~l~0 1) main_~n~0)} is VALID [2022-04-08 03:53:23,602 INFO L272 TraceCheckUtils]: 0: Hoare triple {2599#true} call ULTIMATE.init(); {2613#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 03:53:23,602 INFO L290 TraceCheckUtils]: 1: Hoare triple {2613#(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(9, 2); {2599#true} is VALID [2022-04-08 03:53:23,602 INFO L290 TraceCheckUtils]: 2: Hoare triple {2599#true} assume true; {2599#true} is VALID [2022-04-08 03:53:23,602 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2599#true} {2599#true} #138#return; {2599#true} is VALID [2022-04-08 03:53:23,603 INFO L272 TraceCheckUtils]: 4: Hoare triple {2599#true} call #t~ret8 := main(#in~argc, #in~argv.base, #in~argv.offset); {2599#true} is VALID [2022-04-08 03:53:23,603 INFO L290 TraceCheckUtils]: 5: Hoare triple {2599#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;havoc ~n~0;havoc ~l~0;havoc ~r~0;havoc ~i~0;havoc ~j~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {2599#true} is VALID [2022-04-08 03:53:23,603 INFO L290 TraceCheckUtils]: 6: Hoare triple {2599#true} assume !!(1 <= ~n~0 && ~n~0 <= 1000000);~l~0 := 1 + (if ~n~0 < 0 && 0 != ~n~0 % 2 then 1 + ~n~0 / 2 else ~n~0 / 2);~r~0 := ~n~0; {2604#(<= (+ (* main_~l~0 2) main_~r~0) (+ 2 (* main_~n~0 2)))} is VALID [2022-04-08 03:53:23,604 INFO L290 TraceCheckUtils]: 7: Hoare triple {2604#(<= (+ (* main_~l~0 2) main_~r~0) (+ 2 (* main_~n~0 2)))} assume ~l~0 > 1;#t~post2 := ~l~0;~l~0 := #t~post2 - 1;havoc #t~post2; {2605#(<= (+ (* main_~l~0 2) main_~r~0) (* main_~n~0 2))} is VALID [2022-04-08 03:53:23,605 INFO L290 TraceCheckUtils]: 8: Hoare triple {2605#(<= (+ (* main_~l~0 2) main_~r~0) (* main_~n~0 2))} assume !!(~r~0 > 1);~i~0 := ~l~0;~j~0 := 2 * ~l~0; {2606#(<= (+ main_~l~0 1) main_~n~0)} is VALID [2022-04-08 03:53:23,605 INFO L290 TraceCheckUtils]: 9: Hoare triple {2606#(<= (+ main_~l~0 1) main_~n~0)} assume !(~j~0 <= ~r~0); {2606#(<= (+ main_~l~0 1) main_~n~0)} is VALID [2022-04-08 03:53:23,605 INFO L290 TraceCheckUtils]: 10: Hoare triple {2606#(<= (+ main_~l~0 1) main_~n~0)} assume ~l~0 > 1; {2606#(<= (+ main_~l~0 1) main_~n~0)} is VALID [2022-04-08 03:53:23,606 INFO L272 TraceCheckUtils]: 11: Hoare triple {2606#(<= (+ main_~l~0 1) main_~n~0)} call __VERIFIER_assert((if 1 <= ~l~0 then 1 else 0)); {2599#true} is VALID [2022-04-08 03:53:23,606 INFO L290 TraceCheckUtils]: 12: Hoare triple {2599#true} ~cond := #in~cond; {2599#true} is VALID [2022-04-08 03:53:23,606 INFO L290 TraceCheckUtils]: 13: Hoare triple {2599#true} assume !(0 == ~cond); {2599#true} is VALID [2022-04-08 03:53:23,608 INFO L290 TraceCheckUtils]: 14: Hoare triple {2599#true} assume true; {2599#true} is VALID [2022-04-08 03:53:23,609 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2599#true} {2606#(<= (+ main_~l~0 1) main_~n~0)} #130#return; {2606#(<= (+ main_~l~0 1) main_~n~0)} is VALID [2022-04-08 03:53:23,620 INFO L272 TraceCheckUtils]: 16: Hoare triple {2606#(<= (+ main_~l~0 1) main_~n~0)} call __VERIFIER_assert((if ~l~0 <= ~n~0 then 1 else 0)); {2611#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 03:53:23,621 INFO L290 TraceCheckUtils]: 17: Hoare triple {2611#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {2612#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 03:53:23,621 INFO L290 TraceCheckUtils]: 18: Hoare triple {2612#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {2600#false} is VALID [2022-04-08 03:53:23,622 INFO L290 TraceCheckUtils]: 19: Hoare triple {2600#false} assume !false; {2600#false} is VALID [2022-04-08 03:53:23,622 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 03:53:23,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 03:53:23,622 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1372697212] [2022-04-08 03:53:23,622 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1372697212] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 03:53:23,622 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 03:53:23,622 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-08 03:53:23,623 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 03:53:23,623 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1093846376] [2022-04-08 03:53:23,623 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1093846376] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 03:53:23,623 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 03:53:23,623 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-08 03:53:23,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1835529731] [2022-04-08 03:53:23,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 03:53:23,623 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 6 states have internal predecessors, (14), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 20 [2022-04-08 03:53:23,624 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 03:53:23,624 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 1.75) internal successors, (14), 6 states have internal predecessors, (14), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 03:53:23,635 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 03:53:23,636 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-08 03:53:23,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 03:53:23,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-08 03:53:23,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-04-08 03:53:23,637 INFO L87 Difference]: Start difference. First operand 98 states and 143 transitions. Second operand has 8 states, 8 states have (on average 1.75) internal successors, (14), 6 states have internal predecessors, (14), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 03:53:24,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:53:24,768 INFO L93 Difference]: Finished difference Result 131 states and 194 transitions. [2022-04-08 03:53:24,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-08 03:53:24,769 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 6 states have internal predecessors, (14), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 20 [2022-04-08 03:53:24,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 03:53:24,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.75) internal successors, (14), 6 states have internal predecessors, (14), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 03:53:24,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 108 transitions. [2022-04-08 03:53:24,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.75) internal successors, (14), 6 states have internal predecessors, (14), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 03:53:24,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 108 transitions. [2022-04-08 03:53:24,775 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 108 transitions. [2022-04-08 03:53:24,861 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 108 edges. 108 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:53:24,865 INFO L225 Difference]: With dead ends: 131 [2022-04-08 03:53:24,865 INFO L226 Difference]: Without dead ends: 129 [2022-04-08 03:53:24,866 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2022-04-08 03:53:24,868 INFO L913 BasicCegarLoop]: 37 mSDtfsCounter, 92 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 302 mSolverCounterSat, 125 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 427 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 125 IncrementalHoareTripleChecker+Valid, 302 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-08 03:53:24,868 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [92 Valid, 59 Invalid, 427 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [125 Valid, 302 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-08 03:53:24,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2022-04-08 03:53:25,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 126. [2022-04-08 03:53:25,114 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 03:53:25,114 INFO L82 GeneralOperation]: Start isEquivalent. First operand 129 states. Second operand has 126 states, 65 states have (on average 1.323076923076923) internal successors, (86), 66 states have internal predecessors, (86), 52 states have call successors, (52), 9 states have call predecessors, (52), 8 states have return successors, (51), 50 states have call predecessors, (51), 51 states have call successors, (51) [2022-04-08 03:53:25,114 INFO L74 IsIncluded]: Start isIncluded. First operand 129 states. Second operand has 126 states, 65 states have (on average 1.323076923076923) internal successors, (86), 66 states have internal predecessors, (86), 52 states have call successors, (52), 9 states have call predecessors, (52), 8 states have return successors, (51), 50 states have call predecessors, (51), 51 states have call successors, (51) [2022-04-08 03:53:25,115 INFO L87 Difference]: Start difference. First operand 129 states. Second operand has 126 states, 65 states have (on average 1.323076923076923) internal successors, (86), 66 states have internal predecessors, (86), 52 states have call successors, (52), 9 states have call predecessors, (52), 8 states have return successors, (51), 50 states have call predecessors, (51), 51 states have call successors, (51) [2022-04-08 03:53:25,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:53:25,120 INFO L93 Difference]: Finished difference Result 129 states and 192 transitions. [2022-04-08 03:53:25,120 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 192 transitions. [2022-04-08 03:53:25,120 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:53:25,120 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:53:25,121 INFO L74 IsIncluded]: Start isIncluded. First operand has 126 states, 65 states have (on average 1.323076923076923) internal successors, (86), 66 states have internal predecessors, (86), 52 states have call successors, (52), 9 states have call predecessors, (52), 8 states have return successors, (51), 50 states have call predecessors, (51), 51 states have call successors, (51) Second operand 129 states. [2022-04-08 03:53:25,121 INFO L87 Difference]: Start difference. First operand has 126 states, 65 states have (on average 1.323076923076923) internal successors, (86), 66 states have internal predecessors, (86), 52 states have call successors, (52), 9 states have call predecessors, (52), 8 states have return successors, (51), 50 states have call predecessors, (51), 51 states have call successors, (51) Second operand 129 states. [2022-04-08 03:53:25,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:53:25,125 INFO L93 Difference]: Finished difference Result 129 states and 192 transitions. [2022-04-08 03:53:25,126 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 192 transitions. [2022-04-08 03:53:25,126 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:53:25,126 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:53:25,126 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 03:53:25,126 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 03:53:25,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 65 states have (on average 1.323076923076923) internal successors, (86), 66 states have internal predecessors, (86), 52 states have call successors, (52), 9 states have call predecessors, (52), 8 states have return successors, (51), 50 states have call predecessors, (51), 51 states have call successors, (51) [2022-04-08 03:53:25,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 189 transitions. [2022-04-08 03:53:25,133 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 189 transitions. Word has length 20 [2022-04-08 03:53:25,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 03:53:25,133 INFO L478 AbstractCegarLoop]: Abstraction has 126 states and 189 transitions. [2022-04-08 03:53:25,133 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 6 states have internal predecessors, (14), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 03:53:25,133 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 126 states and 189 transitions. [2022-04-08 03:53:25,291 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 189 edges. 189 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:53:25,291 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 189 transitions. [2022-04-08 03:53:25,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-08 03:53:25,292 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 03:53:25,292 INFO L499 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 03:53:25,292 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-04-08 03:53:25,292 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 03:53:25,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 03:53:25,292 INFO L85 PathProgramCache]: Analyzing trace with hash 1424204299, now seen corresponding path program 1 times [2022-04-08 03:53:25,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 03:53:25,293 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [440597536] [2022-04-08 03:53:25,293 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 03:53:25,293 INFO L85 PathProgramCache]: Analyzing trace with hash 1424204299, now seen corresponding path program 2 times [2022-04-08 03:53:25,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 03:53:25,293 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1118005708] [2022-04-08 03:53:25,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 03:53:25,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 03:53:25,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:53:25,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 03:53:25,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:53:25,363 INFO L290 TraceCheckUtils]: 0: Hoare triple {3413#(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(9, 2); {3400#true} is VALID [2022-04-08 03:53:25,364 INFO L290 TraceCheckUtils]: 1: Hoare triple {3400#true} assume true; {3400#true} is VALID [2022-04-08 03:53:25,364 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3400#true} {3400#true} #138#return; {3400#true} is VALID [2022-04-08 03:53:25,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-08 03:53:25,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:53:25,368 INFO L290 TraceCheckUtils]: 0: Hoare triple {3400#true} ~cond := #in~cond; {3400#true} is VALID [2022-04-08 03:53:25,368 INFO L290 TraceCheckUtils]: 1: Hoare triple {3400#true} assume !(0 == ~cond); {3400#true} is VALID [2022-04-08 03:53:25,369 INFO L290 TraceCheckUtils]: 2: Hoare triple {3400#true} assume true; {3400#true} is VALID [2022-04-08 03:53:25,369 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3400#true} {3406#(<= main_~j~0 main_~n~0)} #118#return; {3406#(<= main_~j~0 main_~n~0)} is VALID [2022-04-08 03:53:25,370 INFO L272 TraceCheckUtils]: 0: Hoare triple {3400#true} call ULTIMATE.init(); {3413#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 03:53:25,370 INFO L290 TraceCheckUtils]: 1: Hoare triple {3413#(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(9, 2); {3400#true} is VALID [2022-04-08 03:53:25,370 INFO L290 TraceCheckUtils]: 2: Hoare triple {3400#true} assume true; {3400#true} is VALID [2022-04-08 03:53:25,370 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3400#true} {3400#true} #138#return; {3400#true} is VALID [2022-04-08 03:53:25,370 INFO L272 TraceCheckUtils]: 4: Hoare triple {3400#true} call #t~ret8 := main(#in~argc, #in~argv.base, #in~argv.offset); {3400#true} is VALID [2022-04-08 03:53:25,370 INFO L290 TraceCheckUtils]: 5: Hoare triple {3400#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;havoc ~n~0;havoc ~l~0;havoc ~r~0;havoc ~i~0;havoc ~j~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {3400#true} is VALID [2022-04-08 03:53:25,371 INFO L290 TraceCheckUtils]: 6: Hoare triple {3400#true} assume !!(1 <= ~n~0 && ~n~0 <= 1000000);~l~0 := 1 + (if ~n~0 < 0 && 0 != ~n~0 % 2 then 1 + ~n~0 / 2 else ~n~0 / 2);~r~0 := ~n~0; {3405#(<= main_~r~0 main_~n~0)} is VALID [2022-04-08 03:53:25,371 INFO L290 TraceCheckUtils]: 7: Hoare triple {3405#(<= main_~r~0 main_~n~0)} assume ~l~0 > 1;#t~post2 := ~l~0;~l~0 := #t~post2 - 1;havoc #t~post2; {3405#(<= main_~r~0 main_~n~0)} is VALID [2022-04-08 03:53:25,371 INFO L290 TraceCheckUtils]: 8: Hoare triple {3405#(<= main_~r~0 main_~n~0)} assume !!(~r~0 > 1);~i~0 := ~l~0;~j~0 := 2 * ~l~0; {3405#(<= main_~r~0 main_~n~0)} is VALID [2022-04-08 03:53:25,372 INFO L290 TraceCheckUtils]: 9: Hoare triple {3405#(<= main_~r~0 main_~n~0)} assume !!(~j~0 <= ~r~0); {3406#(<= main_~j~0 main_~n~0)} is VALID [2022-04-08 03:53:25,372 INFO L290 TraceCheckUtils]: 10: Hoare triple {3406#(<= main_~j~0 main_~n~0)} assume !(~j~0 < ~r~0); {3406#(<= main_~j~0 main_~n~0)} is VALID [2022-04-08 03:53:25,372 INFO L272 TraceCheckUtils]: 11: Hoare triple {3406#(<= main_~j~0 main_~n~0)} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {3400#true} is VALID [2022-04-08 03:53:25,372 INFO L290 TraceCheckUtils]: 12: Hoare triple {3400#true} ~cond := #in~cond; {3400#true} is VALID [2022-04-08 03:53:25,372 INFO L290 TraceCheckUtils]: 13: Hoare triple {3400#true} assume !(0 == ~cond); {3400#true} is VALID [2022-04-08 03:53:25,372 INFO L290 TraceCheckUtils]: 14: Hoare triple {3400#true} assume true; {3400#true} is VALID [2022-04-08 03:53:25,373 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {3400#true} {3406#(<= main_~j~0 main_~n~0)} #118#return; {3406#(<= main_~j~0 main_~n~0)} is VALID [2022-04-08 03:53:25,374 INFO L272 TraceCheckUtils]: 16: Hoare triple {3406#(<= main_~j~0 main_~n~0)} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {3411#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 03:53:25,374 INFO L290 TraceCheckUtils]: 17: Hoare triple {3411#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {3412#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 03:53:25,374 INFO L290 TraceCheckUtils]: 18: Hoare triple {3412#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {3401#false} is VALID [2022-04-08 03:53:25,374 INFO L290 TraceCheckUtils]: 19: Hoare triple {3401#false} assume !false; {3401#false} is VALID [2022-04-08 03:53:25,375 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 03:53:25,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 03:53:25,379 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1118005708] [2022-04-08 03:53:25,380 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1118005708] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 03:53:25,380 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 03:53:25,380 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-08 03:53:25,380 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 03:53:25,380 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [440597536] [2022-04-08 03:53:25,380 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [440597536] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 03:53:25,380 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 03:53:25,380 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-08 03:53:25,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [882393957] [2022-04-08 03:53:25,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 03:53:25,381 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 20 [2022-04-08 03:53:25,381 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 03:53:25,381 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 2.0) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 03:53:25,390 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 03:53:25,390 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-08 03:53:25,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 03:53:25,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-08 03:53:25,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-04-08 03:53:25,391 INFO L87 Difference]: Start difference. First operand 126 states and 189 transitions. Second operand has 7 states, 7 states have (on average 2.0) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 03:53:26,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:53:26,340 INFO L93 Difference]: Finished difference Result 188 states and 291 transitions. [2022-04-08 03:53:26,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-08 03:53:26,340 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 20 [2022-04-08 03:53:26,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 03:53:26,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.0) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 03:53:26,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 92 transitions. [2022-04-08 03:53:26,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.0) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 03:53:26,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 92 transitions. [2022-04-08 03:53:26,343 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 92 transitions. [2022-04-08 03:53:26,413 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 92 edges. 92 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:53:26,417 INFO L225 Difference]: With dead ends: 188 [2022-04-08 03:53:26,417 INFO L226 Difference]: Without dead ends: 186 [2022-04-08 03:53:26,417 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2022-04-08 03:53:26,418 INFO L913 BasicCegarLoop]: 43 mSDtfsCounter, 54 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 256 mSolverCounterSat, 95 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 351 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 95 IncrementalHoareTripleChecker+Valid, 256 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-08 03:53:26,418 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [54 Valid, 65 Invalid, 351 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [95 Valid, 256 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-08 03:53:26,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2022-04-08 03:53:26,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 162. [2022-04-08 03:53:26,759 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 03:53:26,760 INFO L82 GeneralOperation]: Start isEquivalent. First operand 186 states. Second operand has 162 states, 76 states have (on average 1.3289473684210527) internal successors, (101), 81 states have internal predecessors, (101), 76 states have call successors, (76), 10 states have call predecessors, (76), 9 states have return successors, (75), 70 states have call predecessors, (75), 75 states have call successors, (75) [2022-04-08 03:53:26,760 INFO L74 IsIncluded]: Start isIncluded. First operand 186 states. Second operand has 162 states, 76 states have (on average 1.3289473684210527) internal successors, (101), 81 states have internal predecessors, (101), 76 states have call successors, (76), 10 states have call predecessors, (76), 9 states have return successors, (75), 70 states have call predecessors, (75), 75 states have call successors, (75) [2022-04-08 03:53:26,761 INFO L87 Difference]: Start difference. First operand 186 states. Second operand has 162 states, 76 states have (on average 1.3289473684210527) internal successors, (101), 81 states have internal predecessors, (101), 76 states have call successors, (76), 10 states have call predecessors, (76), 9 states have return successors, (75), 70 states have call predecessors, (75), 75 states have call successors, (75) [2022-04-08 03:53:26,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:53:26,786 INFO L93 Difference]: Finished difference Result 186 states and 289 transitions. [2022-04-08 03:53:26,786 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 289 transitions. [2022-04-08 03:53:26,787 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:53:26,787 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:53:26,787 INFO L74 IsIncluded]: Start isIncluded. First operand has 162 states, 76 states have (on average 1.3289473684210527) internal successors, (101), 81 states have internal predecessors, (101), 76 states have call successors, (76), 10 states have call predecessors, (76), 9 states have return successors, (75), 70 states have call predecessors, (75), 75 states have call successors, (75) Second operand 186 states. [2022-04-08 03:53:26,788 INFO L87 Difference]: Start difference. First operand has 162 states, 76 states have (on average 1.3289473684210527) internal successors, (101), 81 states have internal predecessors, (101), 76 states have call successors, (76), 10 states have call predecessors, (76), 9 states have return successors, (75), 70 states have call predecessors, (75), 75 states have call successors, (75) Second operand 186 states. [2022-04-08 03:53:26,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:53:26,796 INFO L93 Difference]: Finished difference Result 186 states and 289 transitions. [2022-04-08 03:53:26,796 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 289 transitions. [2022-04-08 03:53:26,797 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:53:26,797 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:53:26,797 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 03:53:26,797 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 03:53:26,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 76 states have (on average 1.3289473684210527) internal successors, (101), 81 states have internal predecessors, (101), 76 states have call successors, (76), 10 states have call predecessors, (76), 9 states have return successors, (75), 70 states have call predecessors, (75), 75 states have call successors, (75) [2022-04-08 03:53:26,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 252 transitions. [2022-04-08 03:53:26,807 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 252 transitions. Word has length 20 [2022-04-08 03:53:26,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 03:53:26,808 INFO L478 AbstractCegarLoop]: Abstraction has 162 states and 252 transitions. [2022-04-08 03:53:26,808 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 03:53:26,808 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 162 states and 252 transitions. [2022-04-08 03:53:27,064 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 252 edges. 252 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:53:27,064 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 252 transitions. [2022-04-08 03:53:27,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-08 03:53:27,065 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 03:53:27,065 INFO L499 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 03:53:27,065 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-04-08 03:53:27,065 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 03:53:27,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 03:53:27,066 INFO L85 PathProgramCache]: Analyzing trace with hash 297853571, now seen corresponding path program 1 times [2022-04-08 03:53:27,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 03:53:27,066 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [204633395] [2022-04-08 03:53:27,066 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 03:53:27,066 INFO L85 PathProgramCache]: Analyzing trace with hash 297853571, now seen corresponding path program 2 times [2022-04-08 03:53:27,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 03:53:27,066 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1254117697] [2022-04-08 03:53:27,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 03:53:27,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 03:53:27,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:53:27,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 03:53:27,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:53:27,110 INFO L290 TraceCheckUtils]: 0: Hoare triple {4508#(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(9, 2); {4498#true} is VALID [2022-04-08 03:53:27,111 INFO L290 TraceCheckUtils]: 1: Hoare triple {4498#true} assume true; {4498#true} is VALID [2022-04-08 03:53:27,111 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4498#true} {4498#true} #138#return; {4498#true} is VALID [2022-04-08 03:53:27,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-08 03:53:27,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:53:27,114 INFO L290 TraceCheckUtils]: 0: Hoare triple {4498#true} ~cond := #in~cond; {4498#true} is VALID [2022-04-08 03:53:27,114 INFO L290 TraceCheckUtils]: 1: Hoare triple {4498#true} assume !(0 == ~cond); {4498#true} is VALID [2022-04-08 03:53:27,114 INFO L290 TraceCheckUtils]: 2: Hoare triple {4498#true} assume true; {4498#true} is VALID [2022-04-08 03:53:27,114 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4498#true} {4499#false} #130#return; {4499#false} is VALID [2022-04-08 03:53:27,115 INFO L272 TraceCheckUtils]: 0: Hoare triple {4498#true} call ULTIMATE.init(); {4508#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 03:53:27,115 INFO L290 TraceCheckUtils]: 1: Hoare triple {4508#(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(9, 2); {4498#true} is VALID [2022-04-08 03:53:27,115 INFO L290 TraceCheckUtils]: 2: Hoare triple {4498#true} assume true; {4498#true} is VALID [2022-04-08 03:53:27,115 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4498#true} {4498#true} #138#return; {4498#true} is VALID [2022-04-08 03:53:27,115 INFO L272 TraceCheckUtils]: 4: Hoare triple {4498#true} call #t~ret8 := main(#in~argc, #in~argv.base, #in~argv.offset); {4498#true} is VALID [2022-04-08 03:53:27,116 INFO L290 TraceCheckUtils]: 5: Hoare triple {4498#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;havoc ~n~0;havoc ~l~0;havoc ~r~0;havoc ~i~0;havoc ~j~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {4498#true} is VALID [2022-04-08 03:53:27,116 INFO L290 TraceCheckUtils]: 6: Hoare triple {4498#true} assume !!(1 <= ~n~0 && ~n~0 <= 1000000);~l~0 := 1 + (if ~n~0 < 0 && 0 != ~n~0 % 2 then 1 + ~n~0 / 2 else ~n~0 / 2);~r~0 := ~n~0; {4498#true} is VALID [2022-04-08 03:53:27,116 INFO L290 TraceCheckUtils]: 7: Hoare triple {4498#true} assume !(~l~0 > 1);#t~post3 := ~r~0;~r~0 := #t~post3 - 1;havoc #t~post3; {4503#(<= main_~l~0 1)} is VALID [2022-04-08 03:53:27,116 INFO L290 TraceCheckUtils]: 8: Hoare triple {4503#(<= main_~l~0 1)} assume !!(~r~0 > 1);~i~0 := ~l~0;~j~0 := 2 * ~l~0; {4503#(<= main_~l~0 1)} is VALID [2022-04-08 03:53:27,124 INFO L290 TraceCheckUtils]: 9: Hoare triple {4503#(<= main_~l~0 1)} assume !(~j~0 <= ~r~0); {4503#(<= main_~l~0 1)} is VALID [2022-04-08 03:53:27,124 INFO L290 TraceCheckUtils]: 10: Hoare triple {4503#(<= main_~l~0 1)} assume ~l~0 > 1; {4499#false} is VALID [2022-04-08 03:53:27,124 INFO L272 TraceCheckUtils]: 11: Hoare triple {4499#false} call __VERIFIER_assert((if 1 <= ~l~0 then 1 else 0)); {4498#true} is VALID [2022-04-08 03:53:27,124 INFO L290 TraceCheckUtils]: 12: Hoare triple {4498#true} ~cond := #in~cond; {4498#true} is VALID [2022-04-08 03:53:27,125 INFO L290 TraceCheckUtils]: 13: Hoare triple {4498#true} assume !(0 == ~cond); {4498#true} is VALID [2022-04-08 03:53:27,125 INFO L290 TraceCheckUtils]: 14: Hoare triple {4498#true} assume true; {4498#true} is VALID [2022-04-08 03:53:27,125 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {4498#true} {4499#false} #130#return; {4499#false} is VALID [2022-04-08 03:53:27,125 INFO L272 TraceCheckUtils]: 16: Hoare triple {4499#false} call __VERIFIER_assert((if ~l~0 <= ~n~0 then 1 else 0)); {4499#false} is VALID [2022-04-08 03:53:27,125 INFO L290 TraceCheckUtils]: 17: Hoare triple {4499#false} ~cond := #in~cond; {4499#false} is VALID [2022-04-08 03:53:27,125 INFO L290 TraceCheckUtils]: 18: Hoare triple {4499#false} assume 0 == ~cond; {4499#false} is VALID [2022-04-08 03:53:27,125 INFO L290 TraceCheckUtils]: 19: Hoare triple {4499#false} assume !false; {4499#false} is VALID [2022-04-08 03:53:27,126 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 03:53:27,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 03:53:27,126 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1254117697] [2022-04-08 03:53:27,126 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1254117697] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 03:53:27,126 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 03:53:27,126 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 03:53:27,126 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 03:53:27,126 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [204633395] [2022-04-08 03:53:27,126 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [204633395] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 03:53:27,126 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 03:53:27,127 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 03:53:27,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114949361] [2022-04-08 03:53:27,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 03:53:27,127 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 20 [2022-04-08 03:53:27,127 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 03:53:27,127 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 03:53:27,136 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 03:53:27,136 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 03:53:27,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 03:53:27,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 03:53:27,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 03:53:27,137 INFO L87 Difference]: Start difference. First operand 162 states and 252 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 03:53:27,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:53:27,913 INFO L93 Difference]: Finished difference Result 329 states and 524 transitions. [2022-04-08 03:53:27,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 03:53:27,913 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 20 [2022-04-08 03:53:27,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 03:53:27,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 03:53:27,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 141 transitions. [2022-04-08 03:53:27,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 03:53:27,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 141 transitions. [2022-04-08 03:53:27,918 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 141 transitions. [2022-04-08 03:53:28,032 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 141 edges. 141 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:53:28,037 INFO L225 Difference]: With dead ends: 329 [2022-04-08 03:53:28,037 INFO L226 Difference]: Without dead ends: 239 [2022-04-08 03:53:28,041 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 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 03:53:28,041 INFO L913 BasicCegarLoop]: 59 mSDtfsCounter, 40 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 03:53:28,042 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [52 Valid, 66 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 03:53:28,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2022-04-08 03:53:28,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 209. [2022-04-08 03:53:28,546 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 03:53:28,553 INFO L82 GeneralOperation]: Start isEquivalent. First operand 239 states. Second operand has 209 states, 95 states have (on average 1.3578947368421053) internal successors, (129), 101 states have internal predecessors, (129), 104 states have call successors, (104), 10 states have call predecessors, (104), 9 states have return successors, (103), 97 states have call predecessors, (103), 103 states have call successors, (103) [2022-04-08 03:53:28,556 INFO L74 IsIncluded]: Start isIncluded. First operand 239 states. Second operand has 209 states, 95 states have (on average 1.3578947368421053) internal successors, (129), 101 states have internal predecessors, (129), 104 states have call successors, (104), 10 states have call predecessors, (104), 9 states have return successors, (103), 97 states have call predecessors, (103), 103 states have call successors, (103) [2022-04-08 03:53:28,558 INFO L87 Difference]: Start difference. First operand 239 states. Second operand has 209 states, 95 states have (on average 1.3578947368421053) internal successors, (129), 101 states have internal predecessors, (129), 104 states have call successors, (104), 10 states have call predecessors, (104), 9 states have return successors, (103), 97 states have call predecessors, (103), 103 states have call successors, (103) [2022-04-08 03:53:28,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:53:28,579 INFO L93 Difference]: Finished difference Result 239 states and 389 transitions. [2022-04-08 03:53:28,579 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 389 transitions. [2022-04-08 03:53:28,580 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:53:28,581 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:53:28,581 INFO L74 IsIncluded]: Start isIncluded. First operand has 209 states, 95 states have (on average 1.3578947368421053) internal successors, (129), 101 states have internal predecessors, (129), 104 states have call successors, (104), 10 states have call predecessors, (104), 9 states have return successors, (103), 97 states have call predecessors, (103), 103 states have call successors, (103) Second operand 239 states. [2022-04-08 03:53:28,582 INFO L87 Difference]: Start difference. First operand has 209 states, 95 states have (on average 1.3578947368421053) internal successors, (129), 101 states have internal predecessors, (129), 104 states have call successors, (104), 10 states have call predecessors, (104), 9 states have return successors, (103), 97 states have call predecessors, (103), 103 states have call successors, (103) Second operand 239 states. [2022-04-08 03:53:28,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:53:28,592 INFO L93 Difference]: Finished difference Result 239 states and 389 transitions. [2022-04-08 03:53:28,592 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 389 transitions. [2022-04-08 03:53:28,593 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:53:28,593 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:53:28,593 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 03:53:28,593 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 03:53:28,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 209 states, 95 states have (on average 1.3578947368421053) internal successors, (129), 101 states have internal predecessors, (129), 104 states have call successors, (104), 10 states have call predecessors, (104), 9 states have return successors, (103), 97 states have call predecessors, (103), 103 states have call successors, (103) [2022-04-08 03:53:28,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 336 transitions. [2022-04-08 03:53:28,603 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 336 transitions. Word has length 20 [2022-04-08 03:53:28,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 03:53:28,603 INFO L478 AbstractCegarLoop]: Abstraction has 209 states and 336 transitions. [2022-04-08 03:53:28,603 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 03:53:28,603 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 209 states and 336 transitions. [2022-04-08 03:53:28,882 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 336 edges. 336 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:53:28,883 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 336 transitions. [2022-04-08 03:53:28,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-08 03:53:28,883 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 03:53:28,883 INFO L499 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 03:53:28,883 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-04-08 03:53:28,884 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 03:53:28,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 03:53:28,884 INFO L85 PathProgramCache]: Analyzing trace with hash 288094237, now seen corresponding path program 1 times [2022-04-08 03:53:28,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 03:53:28,884 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [943374164] [2022-04-08 03:53:28,884 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 03:53:28,885 INFO L85 PathProgramCache]: Analyzing trace with hash 288094237, now seen corresponding path program 2 times [2022-04-08 03:53:28,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 03:53:28,885 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2085672408] [2022-04-08 03:53:28,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 03:53:28,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 03:53:28,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:53:28,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 03:53:28,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:53:28,968 INFO L290 TraceCheckUtils]: 0: Hoare triple {6084#(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(9, 2); {6067#true} is VALID [2022-04-08 03:53:28,968 INFO L290 TraceCheckUtils]: 1: Hoare triple {6067#true} assume true; {6067#true} is VALID [2022-04-08 03:53:28,969 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {6067#true} {6067#true} #138#return; {6067#true} is VALID [2022-04-08 03:53:28,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-08 03:53:28,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:53:28,973 INFO L290 TraceCheckUtils]: 0: Hoare triple {6067#true} ~cond := #in~cond; {6067#true} is VALID [2022-04-08 03:53:28,973 INFO L290 TraceCheckUtils]: 1: Hoare triple {6067#true} assume !(0 == ~cond); {6067#true} is VALID [2022-04-08 03:53:28,973 INFO L290 TraceCheckUtils]: 2: Hoare triple {6067#true} assume true; {6067#true} is VALID [2022-04-08 03:53:28,974 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6067#true} {6073#(<= 1 main_~i~0)} #118#return; {6073#(<= 1 main_~i~0)} is VALID [2022-04-08 03:53:28,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-04-08 03:53:28,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:53:28,977 INFO L290 TraceCheckUtils]: 0: Hoare triple {6067#true} ~cond := #in~cond; {6067#true} is VALID [2022-04-08 03:53:28,977 INFO L290 TraceCheckUtils]: 1: Hoare triple {6067#true} assume !(0 == ~cond); {6067#true} is VALID [2022-04-08 03:53:28,978 INFO L290 TraceCheckUtils]: 2: Hoare triple {6067#true} assume true; {6067#true} is VALID [2022-04-08 03:53:28,978 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6067#true} {6073#(<= 1 main_~i~0)} #120#return; {6073#(<= 1 main_~i~0)} is VALID [2022-04-08 03:53:28,978 INFO L272 TraceCheckUtils]: 0: Hoare triple {6067#true} call ULTIMATE.init(); {6084#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 03:53:28,979 INFO L290 TraceCheckUtils]: 1: Hoare triple {6084#(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(9, 2); {6067#true} is VALID [2022-04-08 03:53:28,979 INFO L290 TraceCheckUtils]: 2: Hoare triple {6067#true} assume true; {6067#true} is VALID [2022-04-08 03:53:28,979 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6067#true} {6067#true} #138#return; {6067#true} is VALID [2022-04-08 03:53:28,979 INFO L272 TraceCheckUtils]: 4: Hoare triple {6067#true} call #t~ret8 := main(#in~argc, #in~argv.base, #in~argv.offset); {6067#true} is VALID [2022-04-08 03:53:28,979 INFO L290 TraceCheckUtils]: 5: Hoare triple {6067#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;havoc ~n~0;havoc ~l~0;havoc ~r~0;havoc ~i~0;havoc ~j~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {6067#true} is VALID [2022-04-08 03:53:28,979 INFO L290 TraceCheckUtils]: 6: Hoare triple {6067#true} assume !!(1 <= ~n~0 && ~n~0 <= 1000000);~l~0 := 1 + (if ~n~0 < 0 && 0 != ~n~0 % 2 then 1 + ~n~0 / 2 else ~n~0 / 2);~r~0 := ~n~0; {6067#true} is VALID [2022-04-08 03:53:28,980 INFO L290 TraceCheckUtils]: 7: Hoare triple {6067#true} assume ~l~0 > 1;#t~post2 := ~l~0;~l~0 := #t~post2 - 1;havoc #t~post2; {6072#(<= 1 main_~l~0)} is VALID [2022-04-08 03:53:28,980 INFO L290 TraceCheckUtils]: 8: Hoare triple {6072#(<= 1 main_~l~0)} assume !!(~r~0 > 1);~i~0 := ~l~0;~j~0 := 2 * ~l~0; {6073#(<= 1 main_~i~0)} is VALID [2022-04-08 03:53:28,980 INFO L290 TraceCheckUtils]: 9: Hoare triple {6073#(<= 1 main_~i~0)} assume !!(~j~0 <= ~r~0); {6073#(<= 1 main_~i~0)} is VALID [2022-04-08 03:53:28,981 INFO L290 TraceCheckUtils]: 10: Hoare triple {6073#(<= 1 main_~i~0)} assume !(~j~0 < ~r~0); {6073#(<= 1 main_~i~0)} is VALID [2022-04-08 03:53:28,981 INFO L272 TraceCheckUtils]: 11: Hoare triple {6073#(<= 1 main_~i~0)} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {6067#true} is VALID [2022-04-08 03:53:28,981 INFO L290 TraceCheckUtils]: 12: Hoare triple {6067#true} ~cond := #in~cond; {6067#true} is VALID [2022-04-08 03:53:28,981 INFO L290 TraceCheckUtils]: 13: Hoare triple {6067#true} assume !(0 == ~cond); {6067#true} is VALID [2022-04-08 03:53:28,981 INFO L290 TraceCheckUtils]: 14: Hoare triple {6067#true} assume true; {6067#true} is VALID [2022-04-08 03:53:28,981 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {6067#true} {6073#(<= 1 main_~i~0)} #118#return; {6073#(<= 1 main_~i~0)} is VALID [2022-04-08 03:53:28,982 INFO L272 TraceCheckUtils]: 16: Hoare triple {6073#(<= 1 main_~i~0)} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {6067#true} is VALID [2022-04-08 03:53:28,982 INFO L290 TraceCheckUtils]: 17: Hoare triple {6067#true} ~cond := #in~cond; {6067#true} is VALID [2022-04-08 03:53:28,982 INFO L290 TraceCheckUtils]: 18: Hoare triple {6067#true} assume !(0 == ~cond); {6067#true} is VALID [2022-04-08 03:53:28,982 INFO L290 TraceCheckUtils]: 19: Hoare triple {6067#true} assume true; {6067#true} is VALID [2022-04-08 03:53:28,982 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {6067#true} {6073#(<= 1 main_~i~0)} #120#return; {6073#(<= 1 main_~i~0)} is VALID [2022-04-08 03:53:28,983 INFO L290 TraceCheckUtils]: 21: Hoare triple {6073#(<= 1 main_~i~0)} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {6073#(<= 1 main_~i~0)} is VALID [2022-04-08 03:53:28,983 INFO L290 TraceCheckUtils]: 22: Hoare triple {6073#(<= 1 main_~i~0)} assume !(0 != #t~nondet5);havoc #t~nondet5; {6073#(<= 1 main_~i~0)} is VALID [2022-04-08 03:53:28,983 INFO L272 TraceCheckUtils]: 23: Hoare triple {6073#(<= 1 main_~i~0)} call __VERIFIER_assert((if 1 <= ~i~0 then 1 else 0)); {6082#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 03:53:28,984 INFO L290 TraceCheckUtils]: 24: Hoare triple {6082#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {6083#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 03:53:28,984 INFO L290 TraceCheckUtils]: 25: Hoare triple {6083#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {6068#false} is VALID [2022-04-08 03:53:28,984 INFO L290 TraceCheckUtils]: 26: Hoare triple {6068#false} assume !false; {6068#false} is VALID [2022-04-08 03:53:28,984 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-08 03:53:28,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 03:53:28,985 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2085672408] [2022-04-08 03:53:28,985 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2085672408] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 03:53:28,985 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 03:53:28,985 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-08 03:53:28,985 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 03:53:28,985 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [943374164] [2022-04-08 03:53:28,985 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [943374164] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 03:53:28,985 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 03:53:28,985 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-08 03:53:28,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1944176408] [2022-04-08 03:53:28,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 03:53:28,986 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 27 [2022-04-08 03:53:28,986 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 03:53:28,986 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-08 03:53:29,000 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 03:53:29,000 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-08 03:53:29,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 03:53:29,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-08 03:53:29,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-04-08 03:53:29,001 INFO L87 Difference]: Start difference. First operand 209 states and 336 transitions. Second operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-08 03:53:30,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:53:30,263 INFO L93 Difference]: Finished difference Result 275 states and 448 transitions. [2022-04-08 03:53:30,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-08 03:53:30,264 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 27 [2022-04-08 03:53:30,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 03:53:30,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-08 03:53:30,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 147 transitions. [2022-04-08 03:53:30,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-08 03:53:30,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 147 transitions. [2022-04-08 03:53:30,269 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 147 transitions. [2022-04-08 03:53:30,411 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 147 edges. 147 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:53:30,419 INFO L225 Difference]: With dead ends: 275 [2022-04-08 03:53:30,419 INFO L226 Difference]: Without dead ends: 273 [2022-04-08 03:53:30,419 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2022-04-08 03:53:30,421 INFO L913 BasicCegarLoop]: 39 mSDtfsCounter, 81 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 339 mSolverCounterSat, 106 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 445 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 106 IncrementalHoareTripleChecker+Valid, 339 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-08 03:53:30,421 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [93 Valid, 61 Invalid, 445 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [106 Valid, 339 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-08 03:53:30,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2022-04-08 03:53:30,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 249. [2022-04-08 03:53:30,951 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 03:53:30,952 INFO L82 GeneralOperation]: Start isEquivalent. First operand 273 states. Second operand has 249 states, 114 states have (on average 1.3859649122807018) internal successors, (158), 124 states have internal predecessors, (158), 124 states have call successors, (124), 11 states have call predecessors, (124), 10 states have return successors, (123), 113 states have call predecessors, (123), 123 states have call successors, (123) [2022-04-08 03:53:30,952 INFO L74 IsIncluded]: Start isIncluded. First operand 273 states. Second operand has 249 states, 114 states have (on average 1.3859649122807018) internal successors, (158), 124 states have internal predecessors, (158), 124 states have call successors, (124), 11 states have call predecessors, (124), 10 states have return successors, (123), 113 states have call predecessors, (123), 123 states have call successors, (123) [2022-04-08 03:53:30,953 INFO L87 Difference]: Start difference. First operand 273 states. Second operand has 249 states, 114 states have (on average 1.3859649122807018) internal successors, (158), 124 states have internal predecessors, (158), 124 states have call successors, (124), 11 states have call predecessors, (124), 10 states have return successors, (123), 113 states have call predecessors, (123), 123 states have call successors, (123) [2022-04-08 03:53:30,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:53:30,962 INFO L93 Difference]: Finished difference Result 273 states and 446 transitions. [2022-04-08 03:53:30,962 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 446 transitions. [2022-04-08 03:53:30,963 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:53:30,963 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:53:30,964 INFO L74 IsIncluded]: Start isIncluded. First operand has 249 states, 114 states have (on average 1.3859649122807018) internal successors, (158), 124 states have internal predecessors, (158), 124 states have call successors, (124), 11 states have call predecessors, (124), 10 states have return successors, (123), 113 states have call predecessors, (123), 123 states have call successors, (123) Second operand 273 states. [2022-04-08 03:53:30,964 INFO L87 Difference]: Start difference. First operand has 249 states, 114 states have (on average 1.3859649122807018) internal successors, (158), 124 states have internal predecessors, (158), 124 states have call successors, (124), 11 states have call predecessors, (124), 10 states have return successors, (123), 113 states have call predecessors, (123), 123 states have call successors, (123) Second operand 273 states. [2022-04-08 03:53:30,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:53:30,973 INFO L93 Difference]: Finished difference Result 273 states and 446 transitions. [2022-04-08 03:53:30,973 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 446 transitions. [2022-04-08 03:53:30,974 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:53:30,975 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:53:30,975 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 03:53:30,975 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 03:53:30,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 249 states, 114 states have (on average 1.3859649122807018) internal successors, (158), 124 states have internal predecessors, (158), 124 states have call successors, (124), 11 states have call predecessors, (124), 10 states have return successors, (123), 113 states have call predecessors, (123), 123 states have call successors, (123) [2022-04-08 03:53:30,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 405 transitions. [2022-04-08 03:53:30,984 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 405 transitions. Word has length 27 [2022-04-08 03:53:30,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 03:53:30,984 INFO L478 AbstractCegarLoop]: Abstraction has 249 states and 405 transitions. [2022-04-08 03:53:30,984 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-08 03:53:30,985 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 249 states and 405 transitions. [2022-04-08 03:53:31,442 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 405 edges. 405 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:53:31,442 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 405 transitions. [2022-04-08 03:53:31,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-08 03:53:31,443 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 03:53:31,443 INFO L499 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 03:53:31,443 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-04-08 03:53:31,443 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 03:53:31,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 03:53:31,444 INFO L85 PathProgramCache]: Analyzing trace with hash -870562259, now seen corresponding path program 1 times [2022-04-08 03:53:31,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 03:53:31,444 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1673925241] [2022-04-08 03:53:31,444 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 03:53:31,444 INFO L85 PathProgramCache]: Analyzing trace with hash -870562259, now seen corresponding path program 2 times [2022-04-08 03:53:31,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 03:53:31,445 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1697108844] [2022-04-08 03:53:31,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 03:53:31,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 03:53:31,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:53:31,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 03:53:31,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:53:31,512 INFO L290 TraceCheckUtils]: 0: Hoare triple {7710#(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(9, 2); {7694#true} is VALID [2022-04-08 03:53:31,512 INFO L290 TraceCheckUtils]: 1: Hoare triple {7694#true} assume true; {7694#true} is VALID [2022-04-08 03:53:31,512 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7694#true} {7694#true} #138#return; {7694#true} is VALID [2022-04-08 03:53:31,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-08 03:53:31,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:53:31,518 INFO L290 TraceCheckUtils]: 0: Hoare triple {7694#true} ~cond := #in~cond; {7694#true} is VALID [2022-04-08 03:53:31,518 INFO L290 TraceCheckUtils]: 1: Hoare triple {7694#true} assume !(0 == ~cond); {7694#true} is VALID [2022-04-08 03:53:31,518 INFO L290 TraceCheckUtils]: 2: Hoare triple {7694#true} assume true; {7694#true} is VALID [2022-04-08 03:53:31,518 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7694#true} {7695#false} #130#return; {7695#false} is VALID [2022-04-08 03:53:31,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-04-08 03:53:31,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:53:31,528 INFO L290 TraceCheckUtils]: 0: Hoare triple {7694#true} ~cond := #in~cond; {7694#true} is VALID [2022-04-08 03:53:31,528 INFO L290 TraceCheckUtils]: 1: Hoare triple {7694#true} assume !(0 == ~cond); {7694#true} is VALID [2022-04-08 03:53:31,528 INFO L290 TraceCheckUtils]: 2: Hoare triple {7694#true} assume true; {7694#true} is VALID [2022-04-08 03:53:31,528 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7694#true} {7695#false} #132#return; {7695#false} is VALID [2022-04-08 03:53:31,529 INFO L272 TraceCheckUtils]: 0: Hoare triple {7694#true} call ULTIMATE.init(); {7710#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 03:53:31,529 INFO L290 TraceCheckUtils]: 1: Hoare triple {7710#(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(9, 2); {7694#true} is VALID [2022-04-08 03:53:31,529 INFO L290 TraceCheckUtils]: 2: Hoare triple {7694#true} assume true; {7694#true} is VALID [2022-04-08 03:53:31,529 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7694#true} {7694#true} #138#return; {7694#true} is VALID [2022-04-08 03:53:31,529 INFO L272 TraceCheckUtils]: 4: Hoare triple {7694#true} call #t~ret8 := main(#in~argc, #in~argv.base, #in~argv.offset); {7694#true} is VALID [2022-04-08 03:53:31,530 INFO L290 TraceCheckUtils]: 5: Hoare triple {7694#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;havoc ~n~0;havoc ~l~0;havoc ~r~0;havoc ~i~0;havoc ~j~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {7694#true} is VALID [2022-04-08 03:53:31,530 INFO L290 TraceCheckUtils]: 6: Hoare triple {7694#true} assume !!(1 <= ~n~0 && ~n~0 <= 1000000);~l~0 := 1 + (if ~n~0 < 0 && 0 != ~n~0 % 2 then 1 + ~n~0 / 2 else ~n~0 / 2);~r~0 := ~n~0; {7699#(<= (* main_~l~0 2) (+ main_~r~0 2))} is VALID [2022-04-08 03:53:31,531 INFO L290 TraceCheckUtils]: 7: Hoare triple {7699#(<= (* main_~l~0 2) (+ main_~r~0 2))} assume ~l~0 > 1;#t~post2 := ~l~0;~l~0 := #t~post2 - 1;havoc #t~post2; {7700#(<= (* main_~l~0 2) main_~r~0)} is VALID [2022-04-08 03:53:31,531 INFO L290 TraceCheckUtils]: 8: Hoare triple {7700#(<= (* main_~l~0 2) main_~r~0)} assume !!(~r~0 > 1);~i~0 := ~l~0;~j~0 := 2 * ~l~0; {7701#(<= main_~j~0 main_~r~0)} is VALID [2022-04-08 03:53:31,532 INFO L290 TraceCheckUtils]: 9: Hoare triple {7701#(<= main_~j~0 main_~r~0)} assume !(~j~0 <= ~r~0); {7695#false} is VALID [2022-04-08 03:53:31,532 INFO L290 TraceCheckUtils]: 10: Hoare triple {7695#false} assume ~l~0 > 1; {7695#false} is VALID [2022-04-08 03:53:31,532 INFO L272 TraceCheckUtils]: 11: Hoare triple {7695#false} call __VERIFIER_assert((if 1 <= ~l~0 then 1 else 0)); {7694#true} is VALID [2022-04-08 03:53:31,532 INFO L290 TraceCheckUtils]: 12: Hoare triple {7694#true} ~cond := #in~cond; {7694#true} is VALID [2022-04-08 03:53:31,532 INFO L290 TraceCheckUtils]: 13: Hoare triple {7694#true} assume !(0 == ~cond); {7694#true} is VALID [2022-04-08 03:53:31,532 INFO L290 TraceCheckUtils]: 14: Hoare triple {7694#true} assume true; {7694#true} is VALID [2022-04-08 03:53:31,532 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {7694#true} {7695#false} #130#return; {7695#false} is VALID [2022-04-08 03:53:31,533 INFO L272 TraceCheckUtils]: 16: Hoare triple {7695#false} call __VERIFIER_assert((if ~l~0 <= ~n~0 then 1 else 0)); {7694#true} is VALID [2022-04-08 03:53:31,533 INFO L290 TraceCheckUtils]: 17: Hoare triple {7694#true} ~cond := #in~cond; {7694#true} is VALID [2022-04-08 03:53:31,533 INFO L290 TraceCheckUtils]: 18: Hoare triple {7694#true} assume !(0 == ~cond); {7694#true} is VALID [2022-04-08 03:53:31,533 INFO L290 TraceCheckUtils]: 19: Hoare triple {7694#true} assume true; {7694#true} is VALID [2022-04-08 03:53:31,536 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {7694#true} {7695#false} #132#return; {7695#false} is VALID [2022-04-08 03:53:31,537 INFO L290 TraceCheckUtils]: 21: Hoare triple {7695#false} #t~post6 := ~l~0;~l~0 := #t~post6 - 1;havoc #t~post6; {7695#false} is VALID [2022-04-08 03:53:31,541 INFO L290 TraceCheckUtils]: 22: Hoare triple {7695#false} assume !!(~r~0 > 1);~i~0 := ~l~0;~j~0 := 2 * ~l~0; {7695#false} is VALID [2022-04-08 03:53:31,542 INFO L290 TraceCheckUtils]: 23: Hoare triple {7695#false} assume !!(~j~0 <= ~r~0); {7695#false} is VALID [2022-04-08 03:53:31,542 INFO L290 TraceCheckUtils]: 24: Hoare triple {7695#false} assume ~j~0 < ~r~0; {7695#false} is VALID [2022-04-08 03:53:31,542 INFO L272 TraceCheckUtils]: 25: Hoare triple {7695#false} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {7695#false} is VALID [2022-04-08 03:53:31,542 INFO L290 TraceCheckUtils]: 26: Hoare triple {7695#false} ~cond := #in~cond; {7695#false} is VALID [2022-04-08 03:53:31,543 INFO L290 TraceCheckUtils]: 27: Hoare triple {7695#false} assume 0 == ~cond; {7695#false} is VALID [2022-04-08 03:53:31,543 INFO L290 TraceCheckUtils]: 28: Hoare triple {7695#false} assume !false; {7695#false} is VALID [2022-04-08 03:53:31,543 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-08 03:53:31,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 03:53:31,543 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1697108844] [2022-04-08 03:53:31,543 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1697108844] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 03:53:31,543 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 03:53:31,544 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 03:53:31,544 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 03:53:31,544 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1673925241] [2022-04-08 03:53:31,544 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1673925241] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 03:53:31,544 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 03:53:31,544 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 03:53:31,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1352252831] [2022-04-08 03:53:31,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 03:53:31,544 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 29 [2022-04-08 03:53:31,545 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 03:53:31,545 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-08 03:53:31,561 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 03:53:31,561 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-08 03:53:31,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 03:53:31,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-08 03:53:31,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-04-08 03:53:31,561 INFO L87 Difference]: Start difference. First operand 249 states and 405 transitions. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-08 03:53:33,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:53:33,724 INFO L93 Difference]: Finished difference Result 593 states and 971 transitions. [2022-04-08 03:53:33,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-08 03:53:33,724 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 29 [2022-04-08 03:53:33,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 03:53:33,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-08 03:53:33,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 258 transitions. [2022-04-08 03:53:33,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-08 03:53:33,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 258 transitions. [2022-04-08 03:53:33,734 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 258 transitions. [2022-04-08 03:53:33,932 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 258 edges. 258 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:53:33,944 INFO L225 Difference]: With dead ends: 593 [2022-04-08 03:53:33,944 INFO L226 Difference]: Without dead ends: 396 [2022-04-08 03:53:33,945 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2022-04-08 03:53:33,946 INFO L913 BasicCegarLoop]: 48 mSDtfsCounter, 95 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 263 mSolverCounterSat, 213 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 476 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 213 IncrementalHoareTripleChecker+Valid, 263 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-08 03:53:33,947 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [103 Valid, 60 Invalid, 476 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [213 Valid, 263 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-08 03:53:33,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 396 states. [2022-04-08 03:53:34,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 396 to 250. [2022-04-08 03:53:34,518 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 03:53:34,519 INFO L82 GeneralOperation]: Start isEquivalent. First operand 396 states. Second operand has 250 states, 115 states have (on average 1.373913043478261) internal successors, (158), 125 states have internal predecessors, (158), 124 states have call successors, (124), 11 states have call predecessors, (124), 10 states have return successors, (123), 113 states have call predecessors, (123), 123 states have call successors, (123) [2022-04-08 03:53:34,520 INFO L74 IsIncluded]: Start isIncluded. First operand 396 states. Second operand has 250 states, 115 states have (on average 1.373913043478261) internal successors, (158), 125 states have internal predecessors, (158), 124 states have call successors, (124), 11 states have call predecessors, (124), 10 states have return successors, (123), 113 states have call predecessors, (123), 123 states have call successors, (123) [2022-04-08 03:53:34,521 INFO L87 Difference]: Start difference. First operand 396 states. Second operand has 250 states, 115 states have (on average 1.373913043478261) internal successors, (158), 125 states have internal predecessors, (158), 124 states have call successors, (124), 11 states have call predecessors, (124), 10 states have return successors, (123), 113 states have call predecessors, (123), 123 states have call successors, (123) [2022-04-08 03:53:34,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:53:34,560 INFO L93 Difference]: Finished difference Result 396 states and 653 transitions. [2022-04-08 03:53:34,560 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 653 transitions. [2022-04-08 03:53:34,561 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:53:34,561 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:53:34,562 INFO L74 IsIncluded]: Start isIncluded. First operand has 250 states, 115 states have (on average 1.373913043478261) internal successors, (158), 125 states have internal predecessors, (158), 124 states have call successors, (124), 11 states have call predecessors, (124), 10 states have return successors, (123), 113 states have call predecessors, (123), 123 states have call successors, (123) Second operand 396 states. [2022-04-08 03:53:34,562 INFO L87 Difference]: Start difference. First operand has 250 states, 115 states have (on average 1.373913043478261) internal successors, (158), 125 states have internal predecessors, (158), 124 states have call successors, (124), 11 states have call predecessors, (124), 10 states have return successors, (123), 113 states have call predecessors, (123), 123 states have call successors, (123) Second operand 396 states. [2022-04-08 03:53:34,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:53:34,577 INFO L93 Difference]: Finished difference Result 396 states and 653 transitions. [2022-04-08 03:53:34,578 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 653 transitions. [2022-04-08 03:53:34,579 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:53:34,579 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:53:34,579 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 03:53:34,579 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 03:53:34,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 250 states, 115 states have (on average 1.373913043478261) internal successors, (158), 125 states have internal predecessors, (158), 124 states have call successors, (124), 11 states have call predecessors, (124), 10 states have return successors, (123), 113 states have call predecessors, (123), 123 states have call successors, (123) [2022-04-08 03:53:34,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 405 transitions. [2022-04-08 03:53:34,588 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 405 transitions. Word has length 29 [2022-04-08 03:53:34,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 03:53:34,589 INFO L478 AbstractCegarLoop]: Abstraction has 250 states and 405 transitions. [2022-04-08 03:53:34,589 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-08 03:53:34,589 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 250 states and 405 transitions. [2022-04-08 03:53:35,041 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 405 edges. 405 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:53:35,041 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 405 transitions. [2022-04-08 03:53:35,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-08 03:53:35,043 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 03:53:35,043 INFO L499 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 03:53:35,043 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-04-08 03:53:35,043 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 03:53:35,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 03:53:35,043 INFO L85 PathProgramCache]: Analyzing trace with hash -1319777776, now seen corresponding path program 1 times [2022-04-08 03:53:35,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 03:53:35,044 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [348868170] [2022-04-08 03:53:35,044 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 03:53:35,044 INFO L85 PathProgramCache]: Analyzing trace with hash -1319777776, now seen corresponding path program 2 times [2022-04-08 03:53:35,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 03:53:35,044 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [999959445] [2022-04-08 03:53:35,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 03:53:35,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 03:53:35,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:53:35,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 03:53:35,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:53:35,110 INFO L290 TraceCheckUtils]: 0: Hoare triple {10222#(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(9, 2); {10201#true} is VALID [2022-04-08 03:53:35,110 INFO L290 TraceCheckUtils]: 1: Hoare triple {10201#true} assume true; {10201#true} is VALID [2022-04-08 03:53:35,110 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {10201#true} {10201#true} #138#return; {10201#true} is VALID [2022-04-08 03:53:35,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-08 03:53:35,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:53:35,114 INFO L290 TraceCheckUtils]: 0: Hoare triple {10201#true} ~cond := #in~cond; {10201#true} is VALID [2022-04-08 03:53:35,114 INFO L290 TraceCheckUtils]: 1: Hoare triple {10201#true} assume !(0 == ~cond); {10201#true} is VALID [2022-04-08 03:53:35,114 INFO L290 TraceCheckUtils]: 2: Hoare triple {10201#true} assume true; {10201#true} is VALID [2022-04-08 03:53:35,115 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10201#true} {10207#(<= (+ main_~j~0 1) main_~n~0)} #110#return; {10207#(<= (+ main_~j~0 1) main_~n~0)} is VALID [2022-04-08 03:53:35,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-04-08 03:53:35,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:53:35,117 INFO L290 TraceCheckUtils]: 0: Hoare triple {10201#true} ~cond := #in~cond; {10201#true} is VALID [2022-04-08 03:53:35,118 INFO L290 TraceCheckUtils]: 1: Hoare triple {10201#true} assume !(0 == ~cond); {10201#true} is VALID [2022-04-08 03:53:35,118 INFO L290 TraceCheckUtils]: 2: Hoare triple {10201#true} assume true; {10201#true} is VALID [2022-04-08 03:53:35,118 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10201#true} {10207#(<= (+ main_~j~0 1) main_~n~0)} #112#return; {10207#(<= (+ main_~j~0 1) main_~n~0)} is VALID [2022-04-08 03:53:35,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-04-08 03:53:35,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:53:35,136 INFO L290 TraceCheckUtils]: 0: Hoare triple {10201#true} ~cond := #in~cond; {10201#true} is VALID [2022-04-08 03:53:35,136 INFO L290 TraceCheckUtils]: 1: Hoare triple {10201#true} assume !(0 == ~cond); {10201#true} is VALID [2022-04-08 03:53:35,136 INFO L290 TraceCheckUtils]: 2: Hoare triple {10201#true} assume true; {10201#true} is VALID [2022-04-08 03:53:35,137 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10201#true} {10207#(<= (+ main_~j~0 1) main_~n~0)} #114#return; {10207#(<= (+ main_~j~0 1) main_~n~0)} is VALID [2022-04-08 03:53:35,137 INFO L272 TraceCheckUtils]: 0: Hoare triple {10201#true} call ULTIMATE.init(); {10222#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 03:53:35,137 INFO L290 TraceCheckUtils]: 1: Hoare triple {10222#(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(9, 2); {10201#true} is VALID [2022-04-08 03:53:35,137 INFO L290 TraceCheckUtils]: 2: Hoare triple {10201#true} assume true; {10201#true} is VALID [2022-04-08 03:53:35,137 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10201#true} {10201#true} #138#return; {10201#true} is VALID [2022-04-08 03:53:35,137 INFO L272 TraceCheckUtils]: 4: Hoare triple {10201#true} call #t~ret8 := main(#in~argc, #in~argv.base, #in~argv.offset); {10201#true} is VALID [2022-04-08 03:53:35,138 INFO L290 TraceCheckUtils]: 5: Hoare triple {10201#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;havoc ~n~0;havoc ~l~0;havoc ~r~0;havoc ~i~0;havoc ~j~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {10201#true} is VALID [2022-04-08 03:53:35,138 INFO L290 TraceCheckUtils]: 6: Hoare triple {10201#true} assume !!(1 <= ~n~0 && ~n~0 <= 1000000);~l~0 := 1 + (if ~n~0 < 0 && 0 != ~n~0 % 2 then 1 + ~n~0 / 2 else ~n~0 / 2);~r~0 := ~n~0; {10206#(<= main_~r~0 main_~n~0)} is VALID [2022-04-08 03:53:35,138 INFO L290 TraceCheckUtils]: 7: Hoare triple {10206#(<= main_~r~0 main_~n~0)} assume ~l~0 > 1;#t~post2 := ~l~0;~l~0 := #t~post2 - 1;havoc #t~post2; {10206#(<= main_~r~0 main_~n~0)} is VALID [2022-04-08 03:53:35,138 INFO L290 TraceCheckUtils]: 8: Hoare triple {10206#(<= main_~r~0 main_~n~0)} assume !!(~r~0 > 1);~i~0 := ~l~0;~j~0 := 2 * ~l~0; {10206#(<= main_~r~0 main_~n~0)} is VALID [2022-04-08 03:53:35,139 INFO L290 TraceCheckUtils]: 9: Hoare triple {10206#(<= main_~r~0 main_~n~0)} assume !!(~j~0 <= ~r~0); {10206#(<= main_~r~0 main_~n~0)} is VALID [2022-04-08 03:53:35,139 INFO L290 TraceCheckUtils]: 10: Hoare triple {10206#(<= main_~r~0 main_~n~0)} assume ~j~0 < ~r~0; {10207#(<= (+ main_~j~0 1) main_~n~0)} is VALID [2022-04-08 03:53:35,139 INFO L272 TraceCheckUtils]: 11: Hoare triple {10207#(<= (+ main_~j~0 1) main_~n~0)} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {10201#true} is VALID [2022-04-08 03:53:35,139 INFO L290 TraceCheckUtils]: 12: Hoare triple {10201#true} ~cond := #in~cond; {10201#true} is VALID [2022-04-08 03:53:35,139 INFO L290 TraceCheckUtils]: 13: Hoare triple {10201#true} assume !(0 == ~cond); {10201#true} is VALID [2022-04-08 03:53:35,139 INFO L290 TraceCheckUtils]: 14: Hoare triple {10201#true} assume true; {10201#true} is VALID [2022-04-08 03:53:35,140 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {10201#true} {10207#(<= (+ main_~j~0 1) main_~n~0)} #110#return; {10207#(<= (+ main_~j~0 1) main_~n~0)} is VALID [2022-04-08 03:53:35,140 INFO L272 TraceCheckUtils]: 16: Hoare triple {10207#(<= (+ main_~j~0 1) main_~n~0)} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {10201#true} is VALID [2022-04-08 03:53:35,140 INFO L290 TraceCheckUtils]: 17: Hoare triple {10201#true} ~cond := #in~cond; {10201#true} is VALID [2022-04-08 03:53:35,140 INFO L290 TraceCheckUtils]: 18: Hoare triple {10201#true} assume !(0 == ~cond); {10201#true} is VALID [2022-04-08 03:53:35,140 INFO L290 TraceCheckUtils]: 19: Hoare triple {10201#true} assume true; {10201#true} is VALID [2022-04-08 03:53:35,141 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {10201#true} {10207#(<= (+ main_~j~0 1) main_~n~0)} #112#return; {10207#(<= (+ main_~j~0 1) main_~n~0)} is VALID [2022-04-08 03:53:35,141 INFO L272 TraceCheckUtils]: 21: Hoare triple {10207#(<= (+ main_~j~0 1) main_~n~0)} call __VERIFIER_assert((if 1 <= 1 + ~j~0 then 1 else 0)); {10201#true} is VALID [2022-04-08 03:53:35,141 INFO L290 TraceCheckUtils]: 22: Hoare triple {10201#true} ~cond := #in~cond; {10201#true} is VALID [2022-04-08 03:53:35,141 INFO L290 TraceCheckUtils]: 23: Hoare triple {10201#true} assume !(0 == ~cond); {10201#true} is VALID [2022-04-08 03:53:35,141 INFO L290 TraceCheckUtils]: 24: Hoare triple {10201#true} assume true; {10201#true} is VALID [2022-04-08 03:53:35,141 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {10201#true} {10207#(<= (+ main_~j~0 1) main_~n~0)} #114#return; {10207#(<= (+ main_~j~0 1) main_~n~0)} is VALID [2022-04-08 03:53:35,142 INFO L272 TraceCheckUtils]: 26: Hoare triple {10207#(<= (+ main_~j~0 1) main_~n~0)} call __VERIFIER_assert((if 1 + ~j~0 <= ~n~0 then 1 else 0)); {10220#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 03:53:35,142 INFO L290 TraceCheckUtils]: 27: Hoare triple {10220#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {10221#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 03:53:35,142 INFO L290 TraceCheckUtils]: 28: Hoare triple {10221#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {10202#false} is VALID [2022-04-08 03:53:35,142 INFO L290 TraceCheckUtils]: 29: Hoare triple {10202#false} assume !false; {10202#false} is VALID [2022-04-08 03:53:35,143 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-08 03:53:35,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 03:53:35,143 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [999959445] [2022-04-08 03:53:35,143 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [999959445] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 03:53:35,143 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 03:53:35,143 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-08 03:53:35,143 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 03:53:35,143 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [348868170] [2022-04-08 03:53:35,143 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [348868170] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 03:53:35,143 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 03:53:35,144 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-08 03:53:35,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [75641279] [2022-04-08 03:53:35,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 03:53:35,144 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 30 [2022-04-08 03:53:35,144 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 03:53:35,144 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-08 03:53:35,153 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 03:53:35,153 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-08 03:53:35,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 03:53:35,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-08 03:53:35,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-04-08 03:53:35,154 INFO L87 Difference]: Start difference. First operand 250 states and 405 transitions. Second operand has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-08 03:53:36,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:53:36,522 INFO L93 Difference]: Finished difference Result 324 states and 521 transitions. [2022-04-08 03:53:36,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-08 03:53:36,526 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 30 [2022-04-08 03:53:36,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 03:53:36,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-08 03:53:36,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 92 transitions. [2022-04-08 03:53:36,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-08 03:53:36,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 92 transitions. [2022-04-08 03:53:36,530 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 92 transitions. [2022-04-08 03:53:36,612 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 92 edges. 92 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:53:36,619 INFO L225 Difference]: With dead ends: 324 [2022-04-08 03:53:36,619 INFO L226 Difference]: Without dead ends: 322 [2022-04-08 03:53:36,619 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2022-04-08 03:53:36,620 INFO L913 BasicCegarLoop]: 53 mSDtfsCounter, 46 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 288 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 374 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 288 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-08 03:53:36,620 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [46 Valid, 75 Invalid, 374 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 288 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-08 03:53:36,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2022-04-08 03:53:37,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 300. [2022-04-08 03:53:37,646 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 03:53:37,647 INFO L82 GeneralOperation]: Start isEquivalent. First operand 322 states. Second operand has 300 states, 133 states have (on average 1.368421052631579) internal successors, (182), 149 states have internal predecessors, (182), 154 states have call successors, (154), 13 states have call predecessors, (154), 12 states have return successors, (153), 137 states have call predecessors, (153), 153 states have call successors, (153) [2022-04-08 03:53:37,647 INFO L74 IsIncluded]: Start isIncluded. First operand 322 states. Second operand has 300 states, 133 states have (on average 1.368421052631579) internal successors, (182), 149 states have internal predecessors, (182), 154 states have call successors, (154), 13 states have call predecessors, (154), 12 states have return successors, (153), 137 states have call predecessors, (153), 153 states have call successors, (153) [2022-04-08 03:53:37,647 INFO L87 Difference]: Start difference. First operand 322 states. Second operand has 300 states, 133 states have (on average 1.368421052631579) internal successors, (182), 149 states have internal predecessors, (182), 154 states have call successors, (154), 13 states have call predecessors, (154), 12 states have return successors, (153), 137 states have call predecessors, (153), 153 states have call successors, (153) [2022-04-08 03:53:37,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:53:37,657 INFO L93 Difference]: Finished difference Result 322 states and 519 transitions. [2022-04-08 03:53:37,657 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 519 transitions. [2022-04-08 03:53:37,658 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:53:37,658 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:53:37,659 INFO L74 IsIncluded]: Start isIncluded. First operand has 300 states, 133 states have (on average 1.368421052631579) internal successors, (182), 149 states have internal predecessors, (182), 154 states have call successors, (154), 13 states have call predecessors, (154), 12 states have return successors, (153), 137 states have call predecessors, (153), 153 states have call successors, (153) Second operand 322 states. [2022-04-08 03:53:37,659 INFO L87 Difference]: Start difference. First operand has 300 states, 133 states have (on average 1.368421052631579) internal successors, (182), 149 states have internal predecessors, (182), 154 states have call successors, (154), 13 states have call predecessors, (154), 12 states have return successors, (153), 137 states have call predecessors, (153), 153 states have call successors, (153) Second operand 322 states. [2022-04-08 03:53:37,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:53:37,669 INFO L93 Difference]: Finished difference Result 322 states and 519 transitions. [2022-04-08 03:53:37,669 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 519 transitions. [2022-04-08 03:53:37,670 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:53:37,670 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:53:37,670 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 03:53:37,670 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 03:53:37,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 300 states, 133 states have (on average 1.368421052631579) internal successors, (182), 149 states have internal predecessors, (182), 154 states have call successors, (154), 13 states have call predecessors, (154), 12 states have return successors, (153), 137 states have call predecessors, (153), 153 states have call successors, (153) [2022-04-08 03:53:37,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 489 transitions. [2022-04-08 03:53:37,681 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 489 transitions. Word has length 30 [2022-04-08 03:53:37,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 03:53:37,681 INFO L478 AbstractCegarLoop]: Abstraction has 300 states and 489 transitions. [2022-04-08 03:53:37,681 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-08 03:53:37,681 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 300 states and 489 transitions. [2022-04-08 03:53:38,191 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 489 edges. 489 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:53:38,192 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 489 transitions. [2022-04-08 03:53:38,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-08 03:53:38,193 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 03:53:38,193 INFO L499 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 03:53:38,193 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-04-08 03:53:38,193 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 03:53:38,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 03:53:38,194 INFO L85 PathProgramCache]: Analyzing trace with hash 1828949766, now seen corresponding path program 1 times [2022-04-08 03:53:38,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 03:53:38,194 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1619641174] [2022-04-08 03:53:38,194 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 03:53:38,195 INFO L85 PathProgramCache]: Analyzing trace with hash 1828949766, now seen corresponding path program 2 times [2022-04-08 03:53:38,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 03:53:38,195 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [325139028] [2022-04-08 03:53:38,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 03:53:38,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 03:53:38,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:53:38,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 03:53:38,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:53:38,272 INFO L290 TraceCheckUtils]: 0: Hoare triple {12150#(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(9, 2); {12128#true} is VALID [2022-04-08 03:53:38,272 INFO L290 TraceCheckUtils]: 1: Hoare triple {12128#true} assume true; {12128#true} is VALID [2022-04-08 03:53:38,272 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {12128#true} {12128#true} #138#return; {12128#true} is VALID [2022-04-08 03:53:38,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-08 03:53:38,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:53:38,278 INFO L290 TraceCheckUtils]: 0: Hoare triple {12128#true} ~cond := #in~cond; {12128#true} is VALID [2022-04-08 03:53:38,278 INFO L290 TraceCheckUtils]: 1: Hoare triple {12128#true} assume !(0 == ~cond); {12128#true} is VALID [2022-04-08 03:53:38,278 INFO L290 TraceCheckUtils]: 2: Hoare triple {12128#true} assume true; {12128#true} is VALID [2022-04-08 03:53:38,279 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12128#true} {12135#(<= (+ main_~i~0 1) main_~n~0)} #118#return; {12135#(<= (+ main_~i~0 1) main_~n~0)} is VALID [2022-04-08 03:53:38,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-04-08 03:53:38,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:53:38,285 INFO L290 TraceCheckUtils]: 0: Hoare triple {12128#true} ~cond := #in~cond; {12128#true} is VALID [2022-04-08 03:53:38,286 INFO L290 TraceCheckUtils]: 1: Hoare triple {12128#true} assume !(0 == ~cond); {12128#true} is VALID [2022-04-08 03:53:38,286 INFO L290 TraceCheckUtils]: 2: Hoare triple {12128#true} assume true; {12128#true} is VALID [2022-04-08 03:53:38,286 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12128#true} {12135#(<= (+ main_~i~0 1) main_~n~0)} #120#return; {12135#(<= (+ main_~i~0 1) main_~n~0)} is VALID [2022-04-08 03:53:38,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-04-08 03:53:38,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:53:38,294 INFO L290 TraceCheckUtils]: 0: Hoare triple {12128#true} ~cond := #in~cond; {12128#true} is VALID [2022-04-08 03:53:38,294 INFO L290 TraceCheckUtils]: 1: Hoare triple {12128#true} assume !(0 == ~cond); {12128#true} is VALID [2022-04-08 03:53:38,294 INFO L290 TraceCheckUtils]: 2: Hoare triple {12128#true} assume true; {12128#true} is VALID [2022-04-08 03:53:38,295 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12128#true} {12135#(<= (+ main_~i~0 1) main_~n~0)} #122#return; {12135#(<= (+ main_~i~0 1) main_~n~0)} is VALID [2022-04-08 03:53:38,295 INFO L272 TraceCheckUtils]: 0: Hoare triple {12128#true} call ULTIMATE.init(); {12150#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 03:53:38,295 INFO L290 TraceCheckUtils]: 1: Hoare triple {12150#(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(9, 2); {12128#true} is VALID [2022-04-08 03:53:38,295 INFO L290 TraceCheckUtils]: 2: Hoare triple {12128#true} assume true; {12128#true} is VALID [2022-04-08 03:53:38,295 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12128#true} {12128#true} #138#return; {12128#true} is VALID [2022-04-08 03:53:38,295 INFO L272 TraceCheckUtils]: 4: Hoare triple {12128#true} call #t~ret8 := main(#in~argc, #in~argv.base, #in~argv.offset); {12128#true} is VALID [2022-04-08 03:53:38,296 INFO L290 TraceCheckUtils]: 5: Hoare triple {12128#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;havoc ~n~0;havoc ~l~0;havoc ~r~0;havoc ~i~0;havoc ~j~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {12128#true} is VALID [2022-04-08 03:53:38,296 INFO L290 TraceCheckUtils]: 6: Hoare triple {12128#true} assume !!(1 <= ~n~0 && ~n~0 <= 1000000);~l~0 := 1 + (if ~n~0 < 0 && 0 != ~n~0 % 2 then 1 + ~n~0 / 2 else ~n~0 / 2);~r~0 := ~n~0; {12133#(<= (* main_~l~0 2) (+ main_~n~0 2))} is VALID [2022-04-08 03:53:38,297 INFO L290 TraceCheckUtils]: 7: Hoare triple {12133#(<= (* main_~l~0 2) (+ main_~n~0 2))} assume ~l~0 > 1;#t~post2 := ~l~0;~l~0 := #t~post2 - 1;havoc #t~post2; {12134#(<= (+ main_~l~0 1) main_~n~0)} is VALID [2022-04-08 03:53:38,297 INFO L290 TraceCheckUtils]: 8: Hoare triple {12134#(<= (+ main_~l~0 1) main_~n~0)} assume !!(~r~0 > 1);~i~0 := ~l~0;~j~0 := 2 * ~l~0; {12135#(<= (+ main_~i~0 1) main_~n~0)} is VALID [2022-04-08 03:53:38,297 INFO L290 TraceCheckUtils]: 9: Hoare triple {12135#(<= (+ main_~i~0 1) main_~n~0)} assume !!(~j~0 <= ~r~0); {12135#(<= (+ main_~i~0 1) main_~n~0)} is VALID [2022-04-08 03:53:38,297 INFO L290 TraceCheckUtils]: 10: Hoare triple {12135#(<= (+ main_~i~0 1) main_~n~0)} assume !(~j~0 < ~r~0); {12135#(<= (+ main_~i~0 1) main_~n~0)} is VALID [2022-04-08 03:53:38,298 INFO L272 TraceCheckUtils]: 11: Hoare triple {12135#(<= (+ main_~i~0 1) main_~n~0)} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {12128#true} is VALID [2022-04-08 03:53:38,298 INFO L290 TraceCheckUtils]: 12: Hoare triple {12128#true} ~cond := #in~cond; {12128#true} is VALID [2022-04-08 03:53:38,298 INFO L290 TraceCheckUtils]: 13: Hoare triple {12128#true} assume !(0 == ~cond); {12128#true} is VALID [2022-04-08 03:53:38,298 INFO L290 TraceCheckUtils]: 14: Hoare triple {12128#true} assume true; {12128#true} is VALID [2022-04-08 03:53:38,298 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {12128#true} {12135#(<= (+ main_~i~0 1) main_~n~0)} #118#return; {12135#(<= (+ main_~i~0 1) main_~n~0)} is VALID [2022-04-08 03:53:38,298 INFO L272 TraceCheckUtils]: 16: Hoare triple {12135#(<= (+ main_~i~0 1) main_~n~0)} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {12128#true} is VALID [2022-04-08 03:53:38,299 INFO L290 TraceCheckUtils]: 17: Hoare triple {12128#true} ~cond := #in~cond; {12128#true} is VALID [2022-04-08 03:53:38,299 INFO L290 TraceCheckUtils]: 18: Hoare triple {12128#true} assume !(0 == ~cond); {12128#true} is VALID [2022-04-08 03:53:38,299 INFO L290 TraceCheckUtils]: 19: Hoare triple {12128#true} assume true; {12128#true} is VALID [2022-04-08 03:53:38,299 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {12128#true} {12135#(<= (+ main_~i~0 1) main_~n~0)} #120#return; {12135#(<= (+ main_~i~0 1) main_~n~0)} is VALID [2022-04-08 03:53:38,299 INFO L290 TraceCheckUtils]: 21: Hoare triple {12135#(<= (+ main_~i~0 1) main_~n~0)} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {12135#(<= (+ main_~i~0 1) main_~n~0)} is VALID [2022-04-08 03:53:38,300 INFO L290 TraceCheckUtils]: 22: Hoare triple {12135#(<= (+ main_~i~0 1) main_~n~0)} assume !(0 != #t~nondet5);havoc #t~nondet5; {12135#(<= (+ main_~i~0 1) main_~n~0)} is VALID [2022-04-08 03:53:38,300 INFO L272 TraceCheckUtils]: 23: Hoare triple {12135#(<= (+ main_~i~0 1) main_~n~0)} call __VERIFIER_assert((if 1 <= ~i~0 then 1 else 0)); {12128#true} is VALID [2022-04-08 03:53:38,300 INFO L290 TraceCheckUtils]: 24: Hoare triple {12128#true} ~cond := #in~cond; {12128#true} is VALID [2022-04-08 03:53:38,300 INFO L290 TraceCheckUtils]: 25: Hoare triple {12128#true} assume !(0 == ~cond); {12128#true} is VALID [2022-04-08 03:53:38,300 INFO L290 TraceCheckUtils]: 26: Hoare triple {12128#true} assume true; {12128#true} is VALID [2022-04-08 03:53:38,301 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {12128#true} {12135#(<= (+ main_~i~0 1) main_~n~0)} #122#return; {12135#(<= (+ main_~i~0 1) main_~n~0)} is VALID [2022-04-08 03:53:38,301 INFO L272 TraceCheckUtils]: 28: Hoare triple {12135#(<= (+ main_~i~0 1) main_~n~0)} call __VERIFIER_assert((if ~i~0 <= ~n~0 then 1 else 0)); {12148#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 03:53:38,301 INFO L290 TraceCheckUtils]: 29: Hoare triple {12148#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {12149#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 03:53:38,302 INFO L290 TraceCheckUtils]: 30: Hoare triple {12149#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {12129#false} is VALID [2022-04-08 03:53:38,302 INFO L290 TraceCheckUtils]: 31: Hoare triple {12129#false} assume !false; {12129#false} is VALID [2022-04-08 03:53:38,303 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-08 03:53:38,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 03:53:38,303 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [325139028] [2022-04-08 03:53:38,303 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [325139028] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 03:53:38,304 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 03:53:38,304 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-08 03:53:38,304 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 03:53:38,304 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1619641174] [2022-04-08 03:53:38,304 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1619641174] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 03:53:38,304 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 03:53:38,304 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-08 03:53:38,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [965800598] [2022-04-08 03:53:38,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 03:53:38,305 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.0) internal successors, (16), 6 states have internal predecessors, (16), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 32 [2022-04-08 03:53:38,305 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 03:53:38,306 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 2.0) internal successors, (16), 6 states have internal predecessors, (16), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-08 03:53:38,317 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 03:53:38,317 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-08 03:53:38,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 03:53:38,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-08 03:53:38,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-04-08 03:53:38,319 INFO L87 Difference]: Start difference. First operand 300 states and 489 transitions. Second operand has 8 states, 8 states have (on average 2.0) internal successors, (16), 6 states have internal predecessors, (16), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-08 03:53:40,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:53:40,707 INFO L93 Difference]: Finished difference Result 470 states and 788 transitions. [2022-04-08 03:53:40,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-08 03:53:40,707 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.0) internal successors, (16), 6 states have internal predecessors, (16), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 32 [2022-04-08 03:53:40,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 03:53:40,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.0) internal successors, (16), 6 states have internal predecessors, (16), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-08 03:53:40,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 145 transitions. [2022-04-08 03:53:40,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.0) internal successors, (16), 6 states have internal predecessors, (16), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-08 03:53:40,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 145 transitions. [2022-04-08 03:53:40,711 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 145 transitions. [2022-04-08 03:53:40,845 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 145 edges. 145 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:53:40,856 INFO L225 Difference]: With dead ends: 470 [2022-04-08 03:53:40,856 INFO L226 Difference]: Without dead ends: 468 [2022-04-08 03:53:40,857 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2022-04-08 03:53:40,858 INFO L913 BasicCegarLoop]: 50 mSDtfsCounter, 98 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 402 mSolverCounterSat, 155 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 557 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 155 IncrementalHoareTripleChecker+Valid, 402 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-08 03:53:40,858 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [98 Valid, 77 Invalid, 557 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [155 Valid, 402 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-08 03:53:40,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 468 states. [2022-04-08 03:53:42,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 468 to 422. [2022-04-08 03:53:42,205 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 03:53:42,205 INFO L82 GeneralOperation]: Start isEquivalent. First operand 468 states. Second operand has 422 states, 179 states have (on average 1.4022346368715084) internal successors, (251), 206 states have internal predecessors, (251), 229 states have call successors, (229), 14 states have call predecessors, (229), 13 states have return successors, (228), 201 states have call predecessors, (228), 228 states have call successors, (228) [2022-04-08 03:53:42,206 INFO L74 IsIncluded]: Start isIncluded. First operand 468 states. Second operand has 422 states, 179 states have (on average 1.4022346368715084) internal successors, (251), 206 states have internal predecessors, (251), 229 states have call successors, (229), 14 states have call predecessors, (229), 13 states have return successors, (228), 201 states have call predecessors, (228), 228 states have call successors, (228) [2022-04-08 03:53:42,207 INFO L87 Difference]: Start difference. First operand 468 states. Second operand has 422 states, 179 states have (on average 1.4022346368715084) internal successors, (251), 206 states have internal predecessors, (251), 229 states have call successors, (229), 14 states have call predecessors, (229), 13 states have return successors, (228), 201 states have call predecessors, (228), 228 states have call successors, (228) [2022-04-08 03:53:42,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:53:42,226 INFO L93 Difference]: Finished difference Result 468 states and 786 transitions. [2022-04-08 03:53:42,226 INFO L276 IsEmpty]: Start isEmpty. Operand 468 states and 786 transitions. [2022-04-08 03:53:42,228 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:53:42,228 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:53:42,229 INFO L74 IsIncluded]: Start isIncluded. First operand has 422 states, 179 states have (on average 1.4022346368715084) internal successors, (251), 206 states have internal predecessors, (251), 229 states have call successors, (229), 14 states have call predecessors, (229), 13 states have return successors, (228), 201 states have call predecessors, (228), 228 states have call successors, (228) Second operand 468 states. [2022-04-08 03:53:42,229 INFO L87 Difference]: Start difference. First operand has 422 states, 179 states have (on average 1.4022346368715084) internal successors, (251), 206 states have internal predecessors, (251), 229 states have call successors, (229), 14 states have call predecessors, (229), 13 states have return successors, (228), 201 states have call predecessors, (228), 228 states have call successors, (228) Second operand 468 states. [2022-04-08 03:53:42,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:53:42,247 INFO L93 Difference]: Finished difference Result 468 states and 786 transitions. [2022-04-08 03:53:42,248 INFO L276 IsEmpty]: Start isEmpty. Operand 468 states and 786 transitions. [2022-04-08 03:53:42,249 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:53:42,249 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:53:42,250 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 03:53:42,250 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 03:53:42,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 422 states, 179 states have (on average 1.4022346368715084) internal successors, (251), 206 states have internal predecessors, (251), 229 states have call successors, (229), 14 states have call predecessors, (229), 13 states have return successors, (228), 201 states have call predecessors, (228), 228 states have call successors, (228) [2022-04-08 03:53:42,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 422 states and 708 transitions. [2022-04-08 03:53:42,268 INFO L78 Accepts]: Start accepts. Automaton has 422 states and 708 transitions. Word has length 32 [2022-04-08 03:53:42,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 03:53:42,268 INFO L478 AbstractCegarLoop]: Abstraction has 422 states and 708 transitions. [2022-04-08 03:53:42,268 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.0) internal successors, (16), 6 states have internal predecessors, (16), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-08 03:53:42,268 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 422 states and 708 transitions. [2022-04-08 03:53:43,289 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 708 edges. 708 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:53:43,290 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 708 transitions. [2022-04-08 03:53:43,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-08 03:53:43,290 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 03:53:43,290 INFO L499 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 03:53:43,290 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-04-08 03:53:43,290 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 03:53:43,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 03:53:43,291 INFO L85 PathProgramCache]: Analyzing trace with hash 1969498376, now seen corresponding path program 1 times [2022-04-08 03:53:43,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 03:53:43,291 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [871589180] [2022-04-08 03:53:43,291 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 03:53:43,291 INFO L85 PathProgramCache]: Analyzing trace with hash 1969498376, now seen corresponding path program 2 times [2022-04-08 03:53:43,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 03:53:43,292 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1283641390] [2022-04-08 03:53:43,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 03:53:43,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 03:53:43,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:53:43,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 03:53:43,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:53:43,365 INFO L290 TraceCheckUtils]: 0: Hoare triple {14907#(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(9, 2); {14885#true} is VALID [2022-04-08 03:53:43,365 INFO L290 TraceCheckUtils]: 1: Hoare triple {14885#true} assume true; {14885#true} is VALID [2022-04-08 03:53:43,365 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {14885#true} {14885#true} #138#return; {14885#true} is VALID [2022-04-08 03:53:43,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-08 03:53:43,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:53:43,373 INFO L290 TraceCheckUtils]: 0: Hoare triple {14885#true} ~cond := #in~cond; {14885#true} is VALID [2022-04-08 03:53:43,373 INFO L290 TraceCheckUtils]: 1: Hoare triple {14885#true} assume !(0 == ~cond); {14885#true} is VALID [2022-04-08 03:53:43,373 INFO L290 TraceCheckUtils]: 2: Hoare triple {14885#true} assume true; {14885#true} is VALID [2022-04-08 03:53:43,374 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14885#true} {14892#(<= main_~i~0 main_~n~0)} #118#return; {14892#(<= main_~i~0 main_~n~0)} is VALID [2022-04-08 03:53:43,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-04-08 03:53:43,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:53:43,389 INFO L290 TraceCheckUtils]: 0: Hoare triple {14885#true} ~cond := #in~cond; {14885#true} is VALID [2022-04-08 03:53:43,389 INFO L290 TraceCheckUtils]: 1: Hoare triple {14885#true} assume !(0 == ~cond); {14885#true} is VALID [2022-04-08 03:53:43,389 INFO L290 TraceCheckUtils]: 2: Hoare triple {14885#true} assume true; {14885#true} is VALID [2022-04-08 03:53:43,390 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14885#true} {14892#(<= main_~i~0 main_~n~0)} #120#return; {14892#(<= main_~i~0 main_~n~0)} is VALID [2022-04-08 03:53:43,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-04-08 03:53:43,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:53:43,393 INFO L290 TraceCheckUtils]: 0: Hoare triple {14885#true} ~cond := #in~cond; {14885#true} is VALID [2022-04-08 03:53:43,393 INFO L290 TraceCheckUtils]: 1: Hoare triple {14885#true} assume !(0 == ~cond); {14885#true} is VALID [2022-04-08 03:53:43,393 INFO L290 TraceCheckUtils]: 2: Hoare triple {14885#true} assume true; {14885#true} is VALID [2022-04-08 03:53:43,394 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14885#true} {14892#(<= main_~i~0 main_~n~0)} #122#return; {14892#(<= main_~i~0 main_~n~0)} is VALID [2022-04-08 03:53:43,395 INFO L272 TraceCheckUtils]: 0: Hoare triple {14885#true} call ULTIMATE.init(); {14907#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 03:53:43,395 INFO L290 TraceCheckUtils]: 1: Hoare triple {14907#(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(9, 2); {14885#true} is VALID [2022-04-08 03:53:43,395 INFO L290 TraceCheckUtils]: 2: Hoare triple {14885#true} assume true; {14885#true} is VALID [2022-04-08 03:53:43,395 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14885#true} {14885#true} #138#return; {14885#true} is VALID [2022-04-08 03:53:43,395 INFO L272 TraceCheckUtils]: 4: Hoare triple {14885#true} call #t~ret8 := main(#in~argc, #in~argv.base, #in~argv.offset); {14885#true} is VALID [2022-04-08 03:53:43,395 INFO L290 TraceCheckUtils]: 5: Hoare triple {14885#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;havoc ~n~0;havoc ~l~0;havoc ~r~0;havoc ~i~0;havoc ~j~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {14885#true} is VALID [2022-04-08 03:53:43,396 INFO L290 TraceCheckUtils]: 6: Hoare triple {14885#true} assume !!(1 <= ~n~0 && ~n~0 <= 1000000);~l~0 := 1 + (if ~n~0 < 0 && 0 != ~n~0 % 2 then 1 + ~n~0 / 2 else ~n~0 / 2);~r~0 := ~n~0; {14890#(<= 1 main_~n~0)} is VALID [2022-04-08 03:53:43,396 INFO L290 TraceCheckUtils]: 7: Hoare triple {14890#(<= 1 main_~n~0)} assume !(~l~0 > 1);#t~post3 := ~r~0;~r~0 := #t~post3 - 1;havoc #t~post3; {14891#(<= main_~l~0 main_~n~0)} is VALID [2022-04-08 03:53:43,397 INFO L290 TraceCheckUtils]: 8: Hoare triple {14891#(<= main_~l~0 main_~n~0)} assume !!(~r~0 > 1);~i~0 := ~l~0;~j~0 := 2 * ~l~0; {14892#(<= main_~i~0 main_~n~0)} is VALID [2022-04-08 03:53:43,397 INFO L290 TraceCheckUtils]: 9: Hoare triple {14892#(<= main_~i~0 main_~n~0)} assume !!(~j~0 <= ~r~0); {14892#(<= main_~i~0 main_~n~0)} is VALID [2022-04-08 03:53:43,397 INFO L290 TraceCheckUtils]: 10: Hoare triple {14892#(<= main_~i~0 main_~n~0)} assume !(~j~0 < ~r~0); {14892#(<= main_~i~0 main_~n~0)} is VALID [2022-04-08 03:53:43,397 INFO L272 TraceCheckUtils]: 11: Hoare triple {14892#(<= main_~i~0 main_~n~0)} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {14885#true} is VALID [2022-04-08 03:53:43,397 INFO L290 TraceCheckUtils]: 12: Hoare triple {14885#true} ~cond := #in~cond; {14885#true} is VALID [2022-04-08 03:53:43,397 INFO L290 TraceCheckUtils]: 13: Hoare triple {14885#true} assume !(0 == ~cond); {14885#true} is VALID [2022-04-08 03:53:43,398 INFO L290 TraceCheckUtils]: 14: Hoare triple {14885#true} assume true; {14885#true} is VALID [2022-04-08 03:53:43,400 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {14885#true} {14892#(<= main_~i~0 main_~n~0)} #118#return; {14892#(<= main_~i~0 main_~n~0)} is VALID [2022-04-08 03:53:43,400 INFO L272 TraceCheckUtils]: 16: Hoare triple {14892#(<= main_~i~0 main_~n~0)} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {14885#true} is VALID [2022-04-08 03:53:43,400 INFO L290 TraceCheckUtils]: 17: Hoare triple {14885#true} ~cond := #in~cond; {14885#true} is VALID [2022-04-08 03:53:43,400 INFO L290 TraceCheckUtils]: 18: Hoare triple {14885#true} assume !(0 == ~cond); {14885#true} is VALID [2022-04-08 03:53:43,400 INFO L290 TraceCheckUtils]: 19: Hoare triple {14885#true} assume true; {14885#true} is VALID [2022-04-08 03:53:43,404 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {14885#true} {14892#(<= main_~i~0 main_~n~0)} #120#return; {14892#(<= main_~i~0 main_~n~0)} is VALID [2022-04-08 03:53:43,404 INFO L290 TraceCheckUtils]: 21: Hoare triple {14892#(<= main_~i~0 main_~n~0)} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {14892#(<= main_~i~0 main_~n~0)} is VALID [2022-04-08 03:53:43,404 INFO L290 TraceCheckUtils]: 22: Hoare triple {14892#(<= main_~i~0 main_~n~0)} assume !(0 != #t~nondet5);havoc #t~nondet5; {14892#(<= main_~i~0 main_~n~0)} is VALID [2022-04-08 03:53:43,405 INFO L272 TraceCheckUtils]: 23: Hoare triple {14892#(<= main_~i~0 main_~n~0)} call __VERIFIER_assert((if 1 <= ~i~0 then 1 else 0)); {14885#true} is VALID [2022-04-08 03:53:43,405 INFO L290 TraceCheckUtils]: 24: Hoare triple {14885#true} ~cond := #in~cond; {14885#true} is VALID [2022-04-08 03:53:43,405 INFO L290 TraceCheckUtils]: 25: Hoare triple {14885#true} assume !(0 == ~cond); {14885#true} is VALID [2022-04-08 03:53:43,405 INFO L290 TraceCheckUtils]: 26: Hoare triple {14885#true} assume true; {14885#true} is VALID [2022-04-08 03:53:43,405 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {14885#true} {14892#(<= main_~i~0 main_~n~0)} #122#return; {14892#(<= main_~i~0 main_~n~0)} is VALID [2022-04-08 03:53:43,406 INFO L272 TraceCheckUtils]: 28: Hoare triple {14892#(<= main_~i~0 main_~n~0)} call __VERIFIER_assert((if ~i~0 <= ~n~0 then 1 else 0)); {14905#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 03:53:43,406 INFO L290 TraceCheckUtils]: 29: Hoare triple {14905#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {14906#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 03:53:43,406 INFO L290 TraceCheckUtils]: 30: Hoare triple {14906#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {14886#false} is VALID [2022-04-08 03:53:43,406 INFO L290 TraceCheckUtils]: 31: Hoare triple {14886#false} assume !false; {14886#false} is VALID [2022-04-08 03:53:43,407 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-08 03:53:43,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 03:53:43,407 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1283641390] [2022-04-08 03:53:43,407 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1283641390] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 03:53:43,407 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 03:53:43,407 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-08 03:53:43,407 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 03:53:43,407 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [871589180] [2022-04-08 03:53:43,408 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [871589180] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 03:53:43,408 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 03:53:43,408 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-08 03:53:43,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1111735878] [2022-04-08 03:53:43,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 03:53:43,408 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.0) internal successors, (16), 6 states have internal predecessors, (16), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 32 [2022-04-08 03:53:43,408 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 03:53:43,408 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 2.0) internal successors, (16), 6 states have internal predecessors, (16), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-08 03:53:43,422 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 03:53:43,422 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-08 03:53:43,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 03:53:43,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-08 03:53:43,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-04-08 03:53:43,423 INFO L87 Difference]: Start difference. First operand 422 states and 708 transitions. Second operand has 8 states, 8 states have (on average 2.0) internal successors, (16), 6 states have internal predecessors, (16), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-08 03:53:46,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:53:46,782 INFO L93 Difference]: Finished difference Result 489 states and 817 transitions. [2022-04-08 03:53:46,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-08 03:53:46,782 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.0) internal successors, (16), 6 states have internal predecessors, (16), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 32 [2022-04-08 03:53:46,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 03:53:46,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.0) internal successors, (16), 6 states have internal predecessors, (16), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-08 03:53:46,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 107 transitions. [2022-04-08 03:53:46,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.0) internal successors, (16), 6 states have internal predecessors, (16), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-08 03:53:46,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 107 transitions. [2022-04-08 03:53:46,785 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 107 transitions. [2022-04-08 03:53:46,876 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 107 edges. 107 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:53:46,889 INFO L225 Difference]: With dead ends: 489 [2022-04-08 03:53:46,889 INFO L226 Difference]: Without dead ends: 487 [2022-04-08 03:53:46,889 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2022-04-08 03:53:46,890 INFO L913 BasicCegarLoop]: 39 mSDtfsCounter, 109 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 272 mSolverCounterSat, 138 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 410 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 138 IncrementalHoareTripleChecker+Valid, 272 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-08 03:53:46,890 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [109 Valid, 66 Invalid, 410 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [138 Valid, 272 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-08 03:53:46,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 487 states. [2022-04-08 03:53:48,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 487 to 429. [2022-04-08 03:53:48,681 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 03:53:48,682 INFO L82 GeneralOperation]: Start isEquivalent. First operand 487 states. Second operand has 429 states, 182 states have (on average 1.3956043956043955) internal successors, (254), 209 states have internal predecessors, (254), 232 states have call successors, (232), 15 states have call predecessors, (232), 14 states have return successors, (231), 204 states have call predecessors, (231), 231 states have call successors, (231) [2022-04-08 03:53:48,683 INFO L74 IsIncluded]: Start isIncluded. First operand 487 states. Second operand has 429 states, 182 states have (on average 1.3956043956043955) internal successors, (254), 209 states have internal predecessors, (254), 232 states have call successors, (232), 15 states have call predecessors, (232), 14 states have return successors, (231), 204 states have call predecessors, (231), 231 states have call successors, (231) [2022-04-08 03:53:48,683 INFO L87 Difference]: Start difference. First operand 487 states. Second operand has 429 states, 182 states have (on average 1.3956043956043955) internal successors, (254), 209 states have internal predecessors, (254), 232 states have call successors, (232), 15 states have call predecessors, (232), 14 states have return successors, (231), 204 states have call predecessors, (231), 231 states have call successors, (231) [2022-04-08 03:53:48,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:53:48,702 INFO L93 Difference]: Finished difference Result 487 states and 815 transitions. [2022-04-08 03:53:48,702 INFO L276 IsEmpty]: Start isEmpty. Operand 487 states and 815 transitions. [2022-04-08 03:53:48,704 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:53:48,704 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:53:48,705 INFO L74 IsIncluded]: Start isIncluded. First operand has 429 states, 182 states have (on average 1.3956043956043955) internal successors, (254), 209 states have internal predecessors, (254), 232 states have call successors, (232), 15 states have call predecessors, (232), 14 states have return successors, (231), 204 states have call predecessors, (231), 231 states have call successors, (231) Second operand 487 states. [2022-04-08 03:53:48,706 INFO L87 Difference]: Start difference. First operand has 429 states, 182 states have (on average 1.3956043956043955) internal successors, (254), 209 states have internal predecessors, (254), 232 states have call successors, (232), 15 states have call predecessors, (232), 14 states have return successors, (231), 204 states have call predecessors, (231), 231 states have call successors, (231) Second operand 487 states. [2022-04-08 03:53:48,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:53:48,724 INFO L93 Difference]: Finished difference Result 487 states and 815 transitions. [2022-04-08 03:53:48,725 INFO L276 IsEmpty]: Start isEmpty. Operand 487 states and 815 transitions. [2022-04-08 03:53:48,726 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:53:48,726 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:53:48,727 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 03:53:48,727 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 03:53:48,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 429 states, 182 states have (on average 1.3956043956043955) internal successors, (254), 209 states have internal predecessors, (254), 232 states have call successors, (232), 15 states have call predecessors, (232), 14 states have return successors, (231), 204 states have call predecessors, (231), 231 states have call successors, (231) [2022-04-08 03:53:48,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 429 states to 429 states and 717 transitions. [2022-04-08 03:53:48,745 INFO L78 Accepts]: Start accepts. Automaton has 429 states and 717 transitions. Word has length 32 [2022-04-08 03:53:48,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 03:53:48,745 INFO L478 AbstractCegarLoop]: Abstraction has 429 states and 717 transitions. [2022-04-08 03:53:48,745 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.0) internal successors, (16), 6 states have internal predecessors, (16), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-08 03:53:48,745 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 429 states and 717 transitions. [2022-04-08 03:53:49,792 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 717 edges. 717 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:53:49,793 INFO L276 IsEmpty]: Start isEmpty. Operand 429 states and 717 transitions. [2022-04-08 03:53:49,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-04-08 03:53:49,793 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 03:53:49,793 INFO L499 BasicCegarLoop]: trace histogram [6, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 03:53:49,794 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-04-08 03:53:49,794 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 03:53:49,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 03:53:49,794 INFO L85 PathProgramCache]: Analyzing trace with hash 154781133, now seen corresponding path program 1 times [2022-04-08 03:53:49,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 03:53:49,794 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1038558466] [2022-04-08 03:53:49,794 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 03:53:49,795 INFO L85 PathProgramCache]: Analyzing trace with hash 154781133, now seen corresponding path program 2 times [2022-04-08 03:53:49,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 03:53:49,795 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [34563867] [2022-04-08 03:53:49,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 03:53:49,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 03:53:49,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:53:49,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 03:53:49,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:53:49,879 INFO L290 TraceCheckUtils]: 0: Hoare triple {17760#(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(9, 2); {17730#true} is VALID [2022-04-08 03:53:49,879 INFO L290 TraceCheckUtils]: 1: Hoare triple {17730#true} assume true; {17730#true} is VALID [2022-04-08 03:53:49,879 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {17730#true} {17730#true} #138#return; {17730#true} is VALID [2022-04-08 03:53:49,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-08 03:53:49,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:53:49,883 INFO L290 TraceCheckUtils]: 0: Hoare triple {17730#true} ~cond := #in~cond; {17730#true} is VALID [2022-04-08 03:53:49,883 INFO L290 TraceCheckUtils]: 1: Hoare triple {17730#true} assume !(0 == ~cond); {17730#true} is VALID [2022-04-08 03:53:49,883 INFO L290 TraceCheckUtils]: 2: Hoare triple {17730#true} assume true; {17730#true} is VALID [2022-04-08 03:53:49,883 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17730#true} {17736#(<= (+ main_~j~0 1) main_~n~0)} #110#return; {17736#(<= (+ main_~j~0 1) main_~n~0)} is VALID [2022-04-08 03:53:49,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-04-08 03:53:49,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:53:49,887 INFO L290 TraceCheckUtils]: 0: Hoare triple {17730#true} ~cond := #in~cond; {17730#true} is VALID [2022-04-08 03:53:49,887 INFO L290 TraceCheckUtils]: 1: Hoare triple {17730#true} assume !(0 == ~cond); {17730#true} is VALID [2022-04-08 03:53:49,887 INFO L290 TraceCheckUtils]: 2: Hoare triple {17730#true} assume true; {17730#true} is VALID [2022-04-08 03:53:49,887 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17730#true} {17736#(<= (+ main_~j~0 1) main_~n~0)} #112#return; {17736#(<= (+ main_~j~0 1) main_~n~0)} is VALID [2022-04-08 03:53:49,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-04-08 03:53:49,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:53:49,890 INFO L290 TraceCheckUtils]: 0: Hoare triple {17730#true} ~cond := #in~cond; {17730#true} is VALID [2022-04-08 03:53:49,890 INFO L290 TraceCheckUtils]: 1: Hoare triple {17730#true} assume !(0 == ~cond); {17730#true} is VALID [2022-04-08 03:53:49,890 INFO L290 TraceCheckUtils]: 2: Hoare triple {17730#true} assume true; {17730#true} is VALID [2022-04-08 03:53:49,890 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17730#true} {17736#(<= (+ main_~j~0 1) main_~n~0)} #114#return; {17736#(<= (+ main_~j~0 1) main_~n~0)} is VALID [2022-04-08 03:53:49,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-04-08 03:53:49,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:53:49,893 INFO L290 TraceCheckUtils]: 0: Hoare triple {17730#true} ~cond := #in~cond; {17730#true} is VALID [2022-04-08 03:53:49,893 INFO L290 TraceCheckUtils]: 1: Hoare triple {17730#true} assume !(0 == ~cond); {17730#true} is VALID [2022-04-08 03:53:49,893 INFO L290 TraceCheckUtils]: 2: Hoare triple {17730#true} assume true; {17730#true} is VALID [2022-04-08 03:53:49,894 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17730#true} {17736#(<= (+ main_~j~0 1) main_~n~0)} #116#return; {17736#(<= (+ main_~j~0 1) main_~n~0)} is VALID [2022-04-08 03:53:49,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-04-08 03:53:49,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:53:49,899 INFO L290 TraceCheckUtils]: 0: Hoare triple {17730#true} ~cond := #in~cond; {17730#true} is VALID [2022-04-08 03:53:49,899 INFO L290 TraceCheckUtils]: 1: Hoare triple {17730#true} assume !(0 == ~cond); {17730#true} is VALID [2022-04-08 03:53:49,899 INFO L290 TraceCheckUtils]: 2: Hoare triple {17730#true} assume true; {17730#true} is VALID [2022-04-08 03:53:49,900 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17730#true} {17753#(<= main_~j~0 main_~n~0)} #118#return; {17753#(<= main_~j~0 main_~n~0)} is VALID [2022-04-08 03:53:49,900 INFO L272 TraceCheckUtils]: 0: Hoare triple {17730#true} call ULTIMATE.init(); {17760#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 03:53:49,900 INFO L290 TraceCheckUtils]: 1: Hoare triple {17760#(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(9, 2); {17730#true} is VALID [2022-04-08 03:53:49,901 INFO L290 TraceCheckUtils]: 2: Hoare triple {17730#true} assume true; {17730#true} is VALID [2022-04-08 03:53:49,901 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17730#true} {17730#true} #138#return; {17730#true} is VALID [2022-04-08 03:53:49,901 INFO L272 TraceCheckUtils]: 4: Hoare triple {17730#true} call #t~ret8 := main(#in~argc, #in~argv.base, #in~argv.offset); {17730#true} is VALID [2022-04-08 03:53:49,901 INFO L290 TraceCheckUtils]: 5: Hoare triple {17730#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;havoc ~n~0;havoc ~l~0;havoc ~r~0;havoc ~i~0;havoc ~j~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {17730#true} is VALID [2022-04-08 03:53:49,901 INFO L290 TraceCheckUtils]: 6: Hoare triple {17730#true} assume !!(1 <= ~n~0 && ~n~0 <= 1000000);~l~0 := 1 + (if ~n~0 < 0 && 0 != ~n~0 % 2 then 1 + ~n~0 / 2 else ~n~0 / 2);~r~0 := ~n~0; {17735#(<= main_~r~0 main_~n~0)} is VALID [2022-04-08 03:53:49,902 INFO L290 TraceCheckUtils]: 7: Hoare triple {17735#(<= main_~r~0 main_~n~0)} assume ~l~0 > 1;#t~post2 := ~l~0;~l~0 := #t~post2 - 1;havoc #t~post2; {17735#(<= main_~r~0 main_~n~0)} is VALID [2022-04-08 03:53:49,902 INFO L290 TraceCheckUtils]: 8: Hoare triple {17735#(<= main_~r~0 main_~n~0)} assume !!(~r~0 > 1);~i~0 := ~l~0;~j~0 := 2 * ~l~0; {17735#(<= main_~r~0 main_~n~0)} is VALID [2022-04-08 03:53:49,902 INFO L290 TraceCheckUtils]: 9: Hoare triple {17735#(<= main_~r~0 main_~n~0)} assume !!(~j~0 <= ~r~0); {17735#(<= main_~r~0 main_~n~0)} is VALID [2022-04-08 03:53:49,903 INFO L290 TraceCheckUtils]: 10: Hoare triple {17735#(<= main_~r~0 main_~n~0)} assume ~j~0 < ~r~0; {17736#(<= (+ main_~j~0 1) main_~n~0)} is VALID [2022-04-08 03:53:49,903 INFO L272 TraceCheckUtils]: 11: Hoare triple {17736#(<= (+ main_~j~0 1) main_~n~0)} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {17730#true} is VALID [2022-04-08 03:53:49,903 INFO L290 TraceCheckUtils]: 12: Hoare triple {17730#true} ~cond := #in~cond; {17730#true} is VALID [2022-04-08 03:53:49,903 INFO L290 TraceCheckUtils]: 13: Hoare triple {17730#true} assume !(0 == ~cond); {17730#true} is VALID [2022-04-08 03:53:49,903 INFO L290 TraceCheckUtils]: 14: Hoare triple {17730#true} assume true; {17730#true} is VALID [2022-04-08 03:53:49,904 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {17730#true} {17736#(<= (+ main_~j~0 1) main_~n~0)} #110#return; {17736#(<= (+ main_~j~0 1) main_~n~0)} is VALID [2022-04-08 03:53:49,904 INFO L272 TraceCheckUtils]: 16: Hoare triple {17736#(<= (+ main_~j~0 1) main_~n~0)} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {17730#true} is VALID [2022-04-08 03:53:49,904 INFO L290 TraceCheckUtils]: 17: Hoare triple {17730#true} ~cond := #in~cond; {17730#true} is VALID [2022-04-08 03:53:49,904 INFO L290 TraceCheckUtils]: 18: Hoare triple {17730#true} assume !(0 == ~cond); {17730#true} is VALID [2022-04-08 03:53:49,904 INFO L290 TraceCheckUtils]: 19: Hoare triple {17730#true} assume true; {17730#true} is VALID [2022-04-08 03:53:49,904 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {17730#true} {17736#(<= (+ main_~j~0 1) main_~n~0)} #112#return; {17736#(<= (+ main_~j~0 1) main_~n~0)} is VALID [2022-04-08 03:53:49,905 INFO L272 TraceCheckUtils]: 21: Hoare triple {17736#(<= (+ main_~j~0 1) main_~n~0)} call __VERIFIER_assert((if 1 <= 1 + ~j~0 then 1 else 0)); {17730#true} is VALID [2022-04-08 03:53:49,905 INFO L290 TraceCheckUtils]: 22: Hoare triple {17730#true} ~cond := #in~cond; {17730#true} is VALID [2022-04-08 03:53:49,905 INFO L290 TraceCheckUtils]: 23: Hoare triple {17730#true} assume !(0 == ~cond); {17730#true} is VALID [2022-04-08 03:53:49,905 INFO L290 TraceCheckUtils]: 24: Hoare triple {17730#true} assume true; {17730#true} is VALID [2022-04-08 03:53:49,905 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {17730#true} {17736#(<= (+ main_~j~0 1) main_~n~0)} #114#return; {17736#(<= (+ main_~j~0 1) main_~n~0)} is VALID [2022-04-08 03:53:49,905 INFO L272 TraceCheckUtils]: 26: Hoare triple {17736#(<= (+ main_~j~0 1) main_~n~0)} call __VERIFIER_assert((if 1 + ~j~0 <= ~n~0 then 1 else 0)); {17730#true} is VALID [2022-04-08 03:53:49,905 INFO L290 TraceCheckUtils]: 27: Hoare triple {17730#true} ~cond := #in~cond; {17730#true} is VALID [2022-04-08 03:53:49,906 INFO L290 TraceCheckUtils]: 28: Hoare triple {17730#true} assume !(0 == ~cond); {17730#true} is VALID [2022-04-08 03:53:49,906 INFO L290 TraceCheckUtils]: 29: Hoare triple {17730#true} assume true; {17730#true} is VALID [2022-04-08 03:53:49,906 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {17730#true} {17736#(<= (+ main_~j~0 1) main_~n~0)} #116#return; {17736#(<= (+ main_~j~0 1) main_~n~0)} is VALID [2022-04-08 03:53:49,906 INFO L290 TraceCheckUtils]: 31: Hoare triple {17736#(<= (+ main_~j~0 1) main_~n~0)} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {17736#(<= (+ main_~j~0 1) main_~n~0)} is VALID [2022-04-08 03:53:49,907 INFO L290 TraceCheckUtils]: 32: Hoare triple {17736#(<= (+ main_~j~0 1) main_~n~0)} assume 0 != #t~nondet4;havoc #t~nondet4;~j~0 := 1 + ~j~0; {17753#(<= main_~j~0 main_~n~0)} is VALID [2022-04-08 03:53:49,907 INFO L272 TraceCheckUtils]: 33: Hoare triple {17753#(<= main_~j~0 main_~n~0)} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {17730#true} is VALID [2022-04-08 03:53:49,907 INFO L290 TraceCheckUtils]: 34: Hoare triple {17730#true} ~cond := #in~cond; {17730#true} is VALID [2022-04-08 03:53:49,907 INFO L290 TraceCheckUtils]: 35: Hoare triple {17730#true} assume !(0 == ~cond); {17730#true} is VALID [2022-04-08 03:53:49,907 INFO L290 TraceCheckUtils]: 36: Hoare triple {17730#true} assume true; {17730#true} is VALID [2022-04-08 03:53:49,908 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {17730#true} {17753#(<= main_~j~0 main_~n~0)} #118#return; {17753#(<= main_~j~0 main_~n~0)} is VALID [2022-04-08 03:53:49,908 INFO L272 TraceCheckUtils]: 38: Hoare triple {17753#(<= main_~j~0 main_~n~0)} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {17758#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 03:53:49,908 INFO L290 TraceCheckUtils]: 39: Hoare triple {17758#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {17759#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 03:53:49,909 INFO L290 TraceCheckUtils]: 40: Hoare triple {17759#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {17731#false} is VALID [2022-04-08 03:53:49,909 INFO L290 TraceCheckUtils]: 41: Hoare triple {17731#false} assume !false; {17731#false} is VALID [2022-04-08 03:53:49,909 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-04-08 03:53:49,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 03:53:49,909 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [34563867] [2022-04-08 03:53:49,909 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [34563867] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 03:53:49,910 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 03:53:49,910 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-08 03:53:49,910 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 03:53:49,910 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1038558466] [2022-04-08 03:53:49,910 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1038558466] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 03:53:49,910 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 03:53:49,910 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-08 03:53:49,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1797919394] [2022-04-08 03:53:49,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 03:53:49,911 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 42 [2022-04-08 03:53:49,911 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 03:53:49,911 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-08 03:53:49,929 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 03:53:49,929 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-08 03:53:49,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 03:53:49,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-08 03:53:49,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-04-08 03:53:49,930 INFO L87 Difference]: Start difference. First operand 429 states and 717 transitions. Second operand has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-08 03:53:52,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:53:52,239 INFO L93 Difference]: Finished difference Result 484 states and 791 transitions. [2022-04-08 03:53:52,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-08 03:53:52,239 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 42 [2022-04-08 03:53:52,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 03:53:52,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-08 03:53:52,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 105 transitions. [2022-04-08 03:53:52,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-08 03:53:52,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 105 transitions. [2022-04-08 03:53:52,242 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 105 transitions. [2022-04-08 03:53:52,344 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 105 edges. 105 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:53:52,356 INFO L225 Difference]: With dead ends: 484 [2022-04-08 03:53:52,356 INFO L226 Difference]: Without dead ends: 482 [2022-04-08 03:53:52,357 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2022-04-08 03:53:52,357 INFO L913 BasicCegarLoop]: 55 mSDtfsCounter, 56 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 373 mSolverCounterSat, 112 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 485 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 112 IncrementalHoareTripleChecker+Valid, 373 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-08 03:53:52,358 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [56 Valid, 82 Invalid, 485 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [112 Valid, 373 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-08 03:53:52,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 482 states. [2022-04-08 03:53:54,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 482 to 433. [2022-04-08 03:53:54,210 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 03:53:54,211 INFO L82 GeneralOperation]: Start isEquivalent. First operand 482 states. Second operand has 433 states, 185 states have (on average 1.3891891891891892) internal successors, (257), 212 states have internal predecessors, (257), 232 states have call successors, (232), 16 states have call predecessors, (232), 15 states have return successors, (231), 204 states have call predecessors, (231), 231 states have call successors, (231) [2022-04-08 03:53:54,212 INFO L74 IsIncluded]: Start isIncluded. First operand 482 states. Second operand has 433 states, 185 states have (on average 1.3891891891891892) internal successors, (257), 212 states have internal predecessors, (257), 232 states have call successors, (232), 16 states have call predecessors, (232), 15 states have return successors, (231), 204 states have call predecessors, (231), 231 states have call successors, (231) [2022-04-08 03:53:54,212 INFO L87 Difference]: Start difference. First operand 482 states. Second operand has 433 states, 185 states have (on average 1.3891891891891892) internal successors, (257), 212 states have internal predecessors, (257), 232 states have call successors, (232), 16 states have call predecessors, (232), 15 states have return successors, (231), 204 states have call predecessors, (231), 231 states have call successors, (231) [2022-04-08 03:53:54,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:53:54,228 INFO L93 Difference]: Finished difference Result 482 states and 789 transitions. [2022-04-08 03:53:54,228 INFO L276 IsEmpty]: Start isEmpty. Operand 482 states and 789 transitions. [2022-04-08 03:53:54,230 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:53:54,230 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:53:54,231 INFO L74 IsIncluded]: Start isIncluded. First operand has 433 states, 185 states have (on average 1.3891891891891892) internal successors, (257), 212 states have internal predecessors, (257), 232 states have call successors, (232), 16 states have call predecessors, (232), 15 states have return successors, (231), 204 states have call predecessors, (231), 231 states have call successors, (231) Second operand 482 states. [2022-04-08 03:53:54,231 INFO L87 Difference]: Start difference. First operand has 433 states, 185 states have (on average 1.3891891891891892) internal successors, (257), 212 states have internal predecessors, (257), 232 states have call successors, (232), 16 states have call predecessors, (232), 15 states have return successors, (231), 204 states have call predecessors, (231), 231 states have call successors, (231) Second operand 482 states. [2022-04-08 03:53:54,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:53:54,247 INFO L93 Difference]: Finished difference Result 482 states and 789 transitions. [2022-04-08 03:53:54,247 INFO L276 IsEmpty]: Start isEmpty. Operand 482 states and 789 transitions. [2022-04-08 03:53:54,249 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:53:54,249 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:53:54,249 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 03:53:54,249 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 03:53:54,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 433 states, 185 states have (on average 1.3891891891891892) internal successors, (257), 212 states have internal predecessors, (257), 232 states have call successors, (232), 16 states have call predecessors, (232), 15 states have return successors, (231), 204 states have call predecessors, (231), 231 states have call successors, (231) [2022-04-08 03:53:54,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 433 states to 433 states and 720 transitions. [2022-04-08 03:53:54,267 INFO L78 Accepts]: Start accepts. Automaton has 433 states and 720 transitions. Word has length 42 [2022-04-08 03:53:54,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 03:53:54,267 INFO L478 AbstractCegarLoop]: Abstraction has 433 states and 720 transitions. [2022-04-08 03:53:54,267 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-08 03:53:54,267 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 433 states and 720 transitions. [2022-04-08 03:53:55,300 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 720 edges. 720 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:53:55,300 INFO L276 IsEmpty]: Start isEmpty. Operand 433 states and 720 transitions. [2022-04-08 03:53:55,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-04-08 03:53:55,301 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 03:53:55,301 INFO L499 BasicCegarLoop]: trace histogram [5, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 03:53:55,301 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-04-08 03:53:55,301 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 03:53:55,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 03:53:55,302 INFO L85 PathProgramCache]: Analyzing trace with hash -756625364, now seen corresponding path program 1 times [2022-04-08 03:53:55,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 03:53:55,302 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1729691952] [2022-04-08 03:53:55,302 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 03:53:55,302 INFO L85 PathProgramCache]: Analyzing trace with hash -756625364, now seen corresponding path program 2 times [2022-04-08 03:53:55,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 03:53:55,302 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [154520548] [2022-04-08 03:53:55,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 03:53:55,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 03:53:55,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:53:55,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 03:53:55,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:53:55,388 INFO L290 TraceCheckUtils]: 0: Hoare triple {20600#(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(9, 2); {20574#true} is VALID [2022-04-08 03:53:55,388 INFO L290 TraceCheckUtils]: 1: Hoare triple {20574#true} assume true; {20574#true} is VALID [2022-04-08 03:53:55,388 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {20574#true} {20574#true} #138#return; {20574#true} is VALID [2022-04-08 03:53:55,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-08 03:53:55,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:53:55,390 INFO L290 TraceCheckUtils]: 0: Hoare triple {20574#true} ~cond := #in~cond; {20574#true} is VALID [2022-04-08 03:53:55,390 INFO L290 TraceCheckUtils]: 1: Hoare triple {20574#true} assume !(0 == ~cond); {20574#true} is VALID [2022-04-08 03:53:55,390 INFO L290 TraceCheckUtils]: 2: Hoare triple {20574#true} assume true; {20574#true} is VALID [2022-04-08 03:53:55,391 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20574#true} {20574#true} #118#return; {20574#true} is VALID [2022-04-08 03:53:55,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-04-08 03:53:55,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:53:55,393 INFO L290 TraceCheckUtils]: 0: Hoare triple {20574#true} ~cond := #in~cond; {20574#true} is VALID [2022-04-08 03:53:55,393 INFO L290 TraceCheckUtils]: 1: Hoare triple {20574#true} assume !(0 == ~cond); {20574#true} is VALID [2022-04-08 03:53:55,393 INFO L290 TraceCheckUtils]: 2: Hoare triple {20574#true} assume true; {20574#true} is VALID [2022-04-08 03:53:55,393 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20574#true} {20574#true} #120#return; {20574#true} is VALID [2022-04-08 03:53:55,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-04-08 03:53:55,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:53:55,395 INFO L290 TraceCheckUtils]: 0: Hoare triple {20574#true} ~cond := #in~cond; {20574#true} is VALID [2022-04-08 03:53:55,395 INFO L290 TraceCheckUtils]: 1: Hoare triple {20574#true} assume !(0 == ~cond); {20574#true} is VALID [2022-04-08 03:53:55,395 INFO L290 TraceCheckUtils]: 2: Hoare triple {20574#true} assume true; {20574#true} is VALID [2022-04-08 03:53:55,396 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20574#true} {20587#(<= 2 main_~l~0)} #130#return; {20587#(<= 2 main_~l~0)} is VALID [2022-04-08 03:53:55,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-04-08 03:53:55,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:53:55,398 INFO L290 TraceCheckUtils]: 0: Hoare triple {20574#true} ~cond := #in~cond; {20574#true} is VALID [2022-04-08 03:53:55,398 INFO L290 TraceCheckUtils]: 1: Hoare triple {20574#true} assume !(0 == ~cond); {20574#true} is VALID [2022-04-08 03:53:55,398 INFO L290 TraceCheckUtils]: 2: Hoare triple {20574#true} assume true; {20574#true} is VALID [2022-04-08 03:53:55,399 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20574#true} {20587#(<= 2 main_~l~0)} #132#return; {20587#(<= 2 main_~l~0)} is VALID [2022-04-08 03:53:55,399 INFO L272 TraceCheckUtils]: 0: Hoare triple {20574#true} call ULTIMATE.init(); {20600#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 03:53:55,399 INFO L290 TraceCheckUtils]: 1: Hoare triple {20600#(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(9, 2); {20574#true} is VALID [2022-04-08 03:53:55,399 INFO L290 TraceCheckUtils]: 2: Hoare triple {20574#true} assume true; {20574#true} is VALID [2022-04-08 03:53:55,399 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20574#true} {20574#true} #138#return; {20574#true} is VALID [2022-04-08 03:53:55,400 INFO L272 TraceCheckUtils]: 4: Hoare triple {20574#true} call #t~ret8 := main(#in~argc, #in~argv.base, #in~argv.offset); {20574#true} is VALID [2022-04-08 03:53:55,400 INFO L290 TraceCheckUtils]: 5: Hoare triple {20574#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;havoc ~n~0;havoc ~l~0;havoc ~r~0;havoc ~i~0;havoc ~j~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {20574#true} is VALID [2022-04-08 03:53:55,400 INFO L290 TraceCheckUtils]: 6: Hoare triple {20574#true} assume !!(1 <= ~n~0 && ~n~0 <= 1000000);~l~0 := 1 + (if ~n~0 < 0 && 0 != ~n~0 % 2 then 1 + ~n~0 / 2 else ~n~0 / 2);~r~0 := ~n~0; {20574#true} is VALID [2022-04-08 03:53:55,400 INFO L290 TraceCheckUtils]: 7: Hoare triple {20574#true} assume ~l~0 > 1;#t~post2 := ~l~0;~l~0 := #t~post2 - 1;havoc #t~post2; {20574#true} is VALID [2022-04-08 03:53:55,400 INFO L290 TraceCheckUtils]: 8: Hoare triple {20574#true} assume !!(~r~0 > 1);~i~0 := ~l~0;~j~0 := 2 * ~l~0; {20574#true} is VALID [2022-04-08 03:53:55,400 INFO L290 TraceCheckUtils]: 9: Hoare triple {20574#true} assume !!(~j~0 <= ~r~0); {20574#true} is VALID [2022-04-08 03:53:55,400 INFO L290 TraceCheckUtils]: 10: Hoare triple {20574#true} assume !(~j~0 < ~r~0); {20574#true} is VALID [2022-04-08 03:53:55,400 INFO L272 TraceCheckUtils]: 11: Hoare triple {20574#true} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {20574#true} is VALID [2022-04-08 03:53:55,400 INFO L290 TraceCheckUtils]: 12: Hoare triple {20574#true} ~cond := #in~cond; {20574#true} is VALID [2022-04-08 03:53:55,400 INFO L290 TraceCheckUtils]: 13: Hoare triple {20574#true} assume !(0 == ~cond); {20574#true} is VALID [2022-04-08 03:53:55,400 INFO L290 TraceCheckUtils]: 14: Hoare triple {20574#true} assume true; {20574#true} is VALID [2022-04-08 03:53:55,401 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {20574#true} {20574#true} #118#return; {20574#true} is VALID [2022-04-08 03:53:55,401 INFO L272 TraceCheckUtils]: 16: Hoare triple {20574#true} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {20574#true} is VALID [2022-04-08 03:53:55,401 INFO L290 TraceCheckUtils]: 17: Hoare triple {20574#true} ~cond := #in~cond; {20574#true} is VALID [2022-04-08 03:53:55,401 INFO L290 TraceCheckUtils]: 18: Hoare triple {20574#true} assume !(0 == ~cond); {20574#true} is VALID [2022-04-08 03:53:55,401 INFO L290 TraceCheckUtils]: 19: Hoare triple {20574#true} assume true; {20574#true} is VALID [2022-04-08 03:53:55,401 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {20574#true} {20574#true} #120#return; {20574#true} is VALID [2022-04-08 03:53:55,401 INFO L290 TraceCheckUtils]: 21: Hoare triple {20574#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {20574#true} is VALID [2022-04-08 03:53:55,401 INFO L290 TraceCheckUtils]: 22: Hoare triple {20574#true} assume 0 != #t~nondet5;havoc #t~nondet5; {20574#true} is VALID [2022-04-08 03:53:55,402 INFO L290 TraceCheckUtils]: 23: Hoare triple {20574#true} assume ~l~0 > 1; {20587#(<= 2 main_~l~0)} is VALID [2022-04-08 03:53:55,402 INFO L272 TraceCheckUtils]: 24: Hoare triple {20587#(<= 2 main_~l~0)} call __VERIFIER_assert((if 1 <= ~l~0 then 1 else 0)); {20574#true} is VALID [2022-04-08 03:53:55,402 INFO L290 TraceCheckUtils]: 25: Hoare triple {20574#true} ~cond := #in~cond; {20574#true} is VALID [2022-04-08 03:53:55,402 INFO L290 TraceCheckUtils]: 26: Hoare triple {20574#true} assume !(0 == ~cond); {20574#true} is VALID [2022-04-08 03:53:55,402 INFO L290 TraceCheckUtils]: 27: Hoare triple {20574#true} assume true; {20574#true} is VALID [2022-04-08 03:53:55,402 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {20574#true} {20587#(<= 2 main_~l~0)} #130#return; {20587#(<= 2 main_~l~0)} is VALID [2022-04-08 03:53:55,403 INFO L272 TraceCheckUtils]: 29: Hoare triple {20587#(<= 2 main_~l~0)} call __VERIFIER_assert((if ~l~0 <= ~n~0 then 1 else 0)); {20574#true} is VALID [2022-04-08 03:53:55,403 INFO L290 TraceCheckUtils]: 30: Hoare triple {20574#true} ~cond := #in~cond; {20574#true} is VALID [2022-04-08 03:53:55,403 INFO L290 TraceCheckUtils]: 31: Hoare triple {20574#true} assume !(0 == ~cond); {20574#true} is VALID [2022-04-08 03:53:55,403 INFO L290 TraceCheckUtils]: 32: Hoare triple {20574#true} assume true; {20574#true} is VALID [2022-04-08 03:53:55,403 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {20574#true} {20587#(<= 2 main_~l~0)} #132#return; {20587#(<= 2 main_~l~0)} is VALID [2022-04-08 03:53:55,404 INFO L290 TraceCheckUtils]: 34: Hoare triple {20587#(<= 2 main_~l~0)} #t~post6 := ~l~0;~l~0 := #t~post6 - 1;havoc #t~post6; {20596#(<= 1 main_~l~0)} is VALID [2022-04-08 03:53:55,404 INFO L290 TraceCheckUtils]: 35: Hoare triple {20596#(<= 1 main_~l~0)} assume !!(~r~0 > 1);~i~0 := ~l~0;~j~0 := 2 * ~l~0; {20597#(<= 2 main_~j~0)} is VALID [2022-04-08 03:53:55,404 INFO L290 TraceCheckUtils]: 36: Hoare triple {20597#(<= 2 main_~j~0)} assume !!(~j~0 <= ~r~0); {20597#(<= 2 main_~j~0)} is VALID [2022-04-08 03:53:55,405 INFO L290 TraceCheckUtils]: 37: Hoare triple {20597#(<= 2 main_~j~0)} assume ~j~0 < ~r~0; {20597#(<= 2 main_~j~0)} is VALID [2022-04-08 03:53:55,405 INFO L272 TraceCheckUtils]: 38: Hoare triple {20597#(<= 2 main_~j~0)} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {20598#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 03:53:55,406 INFO L290 TraceCheckUtils]: 39: Hoare triple {20598#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {20599#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 03:53:55,406 INFO L290 TraceCheckUtils]: 40: Hoare triple {20599#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {20575#false} is VALID [2022-04-08 03:53:55,406 INFO L290 TraceCheckUtils]: 41: Hoare triple {20575#false} assume !false; {20575#false} is VALID [2022-04-08 03:53:55,406 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-08 03:53:55,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 03:53:55,406 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [154520548] [2022-04-08 03:53:55,407 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [154520548] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 03:53:55,407 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 03:53:55,407 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-08 03:53:55,407 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 03:53:55,407 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1729691952] [2022-04-08 03:53:55,407 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1729691952] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 03:53:55,407 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 03:53:55,407 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-08 03:53:55,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [381362903] [2022-04-08 03:53:55,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 03:53:55,408 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 6 states have internal predecessors, (21), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 42 [2022-04-08 03:53:55,408 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 03:53:55,408 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 2.625) internal successors, (21), 6 states have internal predecessors, (21), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-08 03:53:55,425 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 03:53:55,425 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-08 03:53:55,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 03:53:55,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-08 03:53:55,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-04-08 03:53:55,426 INFO L87 Difference]: Start difference. First operand 433 states and 720 transitions. Second operand has 8 states, 8 states have (on average 2.625) internal successors, (21), 6 states have internal predecessors, (21), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-08 03:53:57,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:53:57,360 INFO L93 Difference]: Finished difference Result 440 states and 726 transitions. [2022-04-08 03:53:57,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-08 03:53:57,360 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 6 states have internal predecessors, (21), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 42 [2022-04-08 03:53:57,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 03:53:57,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.625) internal successors, (21), 6 states have internal predecessors, (21), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-08 03:53:57,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 64 transitions. [2022-04-08 03:53:57,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.625) internal successors, (21), 6 states have internal predecessors, (21), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-08 03:53:57,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 64 transitions. [2022-04-08 03:53:57,364 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 64 transitions. [2022-04-08 03:53:57,455 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:53:57,478 INFO L225 Difference]: With dead ends: 440 [2022-04-08 03:53:57,478 INFO L226 Difference]: Without dead ends: 438 [2022-04-08 03:53:57,479 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2022-04-08 03:53:57,479 INFO L913 BasicCegarLoop]: 30 mSDtfsCounter, 54 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 225 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 298 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 225 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-08 03:53:57,479 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [54 Valid, 57 Invalid, 298 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 225 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-08 03:53:57,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 438 states. [2022-04-08 03:53:59,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 438 to 437. [2022-04-08 03:53:59,162 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 03:53:59,163 INFO L82 GeneralOperation]: Start isEquivalent. First operand 438 states. Second operand has 437 states, 188 states have (on average 1.3829787234042554) internal successors, (260), 215 states have internal predecessors, (260), 232 states have call successors, (232), 17 states have call predecessors, (232), 16 states have return successors, (231), 204 states have call predecessors, (231), 231 states have call successors, (231) [2022-04-08 03:53:59,187 INFO L74 IsIncluded]: Start isIncluded. First operand 438 states. Second operand has 437 states, 188 states have (on average 1.3829787234042554) internal successors, (260), 215 states have internal predecessors, (260), 232 states have call successors, (232), 17 states have call predecessors, (232), 16 states have return successors, (231), 204 states have call predecessors, (231), 231 states have call successors, (231) [2022-04-08 03:53:59,188 INFO L87 Difference]: Start difference. First operand 438 states. Second operand has 437 states, 188 states have (on average 1.3829787234042554) internal successors, (260), 215 states have internal predecessors, (260), 232 states have call successors, (232), 17 states have call predecessors, (232), 16 states have return successors, (231), 204 states have call predecessors, (231), 231 states have call successors, (231) [2022-04-08 03:53:59,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:53:59,222 INFO L93 Difference]: Finished difference Result 438 states and 724 transitions. [2022-04-08 03:53:59,222 INFO L276 IsEmpty]: Start isEmpty. Operand 438 states and 724 transitions. [2022-04-08 03:53:59,224 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:53:59,224 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:53:59,225 INFO L74 IsIncluded]: Start isIncluded. First operand has 437 states, 188 states have (on average 1.3829787234042554) internal successors, (260), 215 states have internal predecessors, (260), 232 states have call successors, (232), 17 states have call predecessors, (232), 16 states have return successors, (231), 204 states have call predecessors, (231), 231 states have call successors, (231) Second operand 438 states. [2022-04-08 03:53:59,225 INFO L87 Difference]: Start difference. First operand has 437 states, 188 states have (on average 1.3829787234042554) internal successors, (260), 215 states have internal predecessors, (260), 232 states have call successors, (232), 17 states have call predecessors, (232), 16 states have return successors, (231), 204 states have call predecessors, (231), 231 states have call successors, (231) Second operand 438 states. [2022-04-08 03:53:59,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:53:59,248 INFO L93 Difference]: Finished difference Result 438 states and 724 transitions. [2022-04-08 03:53:59,248 INFO L276 IsEmpty]: Start isEmpty. Operand 438 states and 724 transitions. [2022-04-08 03:53:59,280 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:53:59,280 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:53:59,280 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 03:53:59,280 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 03:53:59,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 437 states, 188 states have (on average 1.3829787234042554) internal successors, (260), 215 states have internal predecessors, (260), 232 states have call successors, (232), 17 states have call predecessors, (232), 16 states have return successors, (231), 204 states have call predecessors, (231), 231 states have call successors, (231) [2022-04-08 03:53:59,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 437 states to 437 states and 723 transitions. [2022-04-08 03:53:59,311 INFO L78 Accepts]: Start accepts. Automaton has 437 states and 723 transitions. Word has length 42 [2022-04-08 03:53:59,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 03:53:59,311 INFO L478 AbstractCegarLoop]: Abstraction has 437 states and 723 transitions. [2022-04-08 03:53:59,311 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 6 states have internal predecessors, (21), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-08 03:53:59,311 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 437 states and 723 transitions. [2022-04-08 03:54:00,107 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 723 edges. 723 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:54:00,107 INFO L276 IsEmpty]: Start isEmpty. Operand 437 states and 723 transitions. [2022-04-08 03:54:00,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-04-08 03:54:00,108 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 03:54:00,108 INFO L499 BasicCegarLoop]: trace histogram [7, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 03:54:00,108 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-04-08 03:54:00,108 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 03:54:00,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 03:54:00,109 INFO L85 PathProgramCache]: Analyzing trace with hash 202086614, now seen corresponding path program 1 times [2022-04-08 03:54:00,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 03:54:00,109 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1748968875] [2022-04-08 03:54:00,109 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 03:54:00,109 INFO L85 PathProgramCache]: Analyzing trace with hash 202086614, now seen corresponding path program 2 times [2022-04-08 03:54:00,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 03:54:00,110 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [832914908] [2022-04-08 03:54:00,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 03:54:00,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 03:54:00,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:54:00,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 03:54:00,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:54:00,182 INFO L290 TraceCheckUtils]: 0: Hoare triple {23282#(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(9, 2); {23248#true} is VALID [2022-04-08 03:54:00,182 INFO L290 TraceCheckUtils]: 1: Hoare triple {23248#true} assume true; {23248#true} is VALID [2022-04-08 03:54:00,182 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {23248#true} {23248#true} #138#return; {23248#true} is VALID [2022-04-08 03:54:00,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-08 03:54:00,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:54:00,184 INFO L290 TraceCheckUtils]: 0: Hoare triple {23248#true} ~cond := #in~cond; {23248#true} is VALID [2022-04-08 03:54:00,184 INFO L290 TraceCheckUtils]: 1: Hoare triple {23248#true} assume !(0 == ~cond); {23248#true} is VALID [2022-04-08 03:54:00,184 INFO L290 TraceCheckUtils]: 2: Hoare triple {23248#true} assume true; {23248#true} is VALID [2022-04-08 03:54:00,185 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23248#true} {23248#true} #118#return; {23248#true} is VALID [2022-04-08 03:54:00,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-04-08 03:54:00,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:54:00,188 INFO L290 TraceCheckUtils]: 0: Hoare triple {23248#true} ~cond := #in~cond; {23248#true} is VALID [2022-04-08 03:54:00,188 INFO L290 TraceCheckUtils]: 1: Hoare triple {23248#true} assume !(0 == ~cond); {23248#true} is VALID [2022-04-08 03:54:00,188 INFO L290 TraceCheckUtils]: 2: Hoare triple {23248#true} assume true; {23248#true} is VALID [2022-04-08 03:54:00,188 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23248#true} {23248#true} #120#return; {23248#true} is VALID [2022-04-08 03:54:00,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-04-08 03:54:00,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:54:00,192 INFO L290 TraceCheckUtils]: 0: Hoare triple {23248#true} ~cond := #in~cond; {23248#true} is VALID [2022-04-08 03:54:00,192 INFO L290 TraceCheckUtils]: 1: Hoare triple {23248#true} assume !(0 == ~cond); {23248#true} is VALID [2022-04-08 03:54:00,192 INFO L290 TraceCheckUtils]: 2: Hoare triple {23248#true} assume true; {23248#true} is VALID [2022-04-08 03:54:00,192 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23248#true} {23261#(<= 2 main_~l~0)} #130#return; {23261#(<= 2 main_~l~0)} is VALID [2022-04-08 03:54:00,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-04-08 03:54:00,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:54:00,196 INFO L290 TraceCheckUtils]: 0: Hoare triple {23248#true} ~cond := #in~cond; {23248#true} is VALID [2022-04-08 03:54:00,196 INFO L290 TraceCheckUtils]: 1: Hoare triple {23248#true} assume !(0 == ~cond); {23248#true} is VALID [2022-04-08 03:54:00,196 INFO L290 TraceCheckUtils]: 2: Hoare triple {23248#true} assume true; {23248#true} is VALID [2022-04-08 03:54:00,197 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23248#true} {23261#(<= 2 main_~l~0)} #132#return; {23261#(<= 2 main_~l~0)} is VALID [2022-04-08 03:54:00,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-04-08 03:54:00,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:54:00,201 INFO L290 TraceCheckUtils]: 0: Hoare triple {23248#true} ~cond := #in~cond; {23248#true} is VALID [2022-04-08 03:54:00,201 INFO L290 TraceCheckUtils]: 1: Hoare triple {23248#true} assume !(0 == ~cond); {23248#true} is VALID [2022-04-08 03:54:00,201 INFO L290 TraceCheckUtils]: 2: Hoare triple {23248#true} assume true; {23248#true} is VALID [2022-04-08 03:54:00,202 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23248#true} {23271#(<= 1 main_~i~0)} #118#return; {23271#(<= 1 main_~i~0)} is VALID [2022-04-08 03:54:00,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-04-08 03:54:00,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:54:00,207 INFO L290 TraceCheckUtils]: 0: Hoare triple {23248#true} ~cond := #in~cond; {23248#true} is VALID [2022-04-08 03:54:00,208 INFO L290 TraceCheckUtils]: 1: Hoare triple {23248#true} assume !(0 == ~cond); {23248#true} is VALID [2022-04-08 03:54:00,208 INFO L290 TraceCheckUtils]: 2: Hoare triple {23248#true} assume true; {23248#true} is VALID [2022-04-08 03:54:00,208 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23248#true} {23271#(<= 1 main_~i~0)} #120#return; {23271#(<= 1 main_~i~0)} is VALID [2022-04-08 03:54:00,208 INFO L272 TraceCheckUtils]: 0: Hoare triple {23248#true} call ULTIMATE.init(); {23282#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 03:54:00,209 INFO L290 TraceCheckUtils]: 1: Hoare triple {23282#(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(9, 2); {23248#true} is VALID [2022-04-08 03:54:00,209 INFO L290 TraceCheckUtils]: 2: Hoare triple {23248#true} assume true; {23248#true} is VALID [2022-04-08 03:54:00,209 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23248#true} {23248#true} #138#return; {23248#true} is VALID [2022-04-08 03:54:00,209 INFO L272 TraceCheckUtils]: 4: Hoare triple {23248#true} call #t~ret8 := main(#in~argc, #in~argv.base, #in~argv.offset); {23248#true} is VALID [2022-04-08 03:54:00,209 INFO L290 TraceCheckUtils]: 5: Hoare triple {23248#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;havoc ~n~0;havoc ~l~0;havoc ~r~0;havoc ~i~0;havoc ~j~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {23248#true} is VALID [2022-04-08 03:54:00,209 INFO L290 TraceCheckUtils]: 6: Hoare triple {23248#true} assume !!(1 <= ~n~0 && ~n~0 <= 1000000);~l~0 := 1 + (if ~n~0 < 0 && 0 != ~n~0 % 2 then 1 + ~n~0 / 2 else ~n~0 / 2);~r~0 := ~n~0; {23248#true} is VALID [2022-04-08 03:54:00,209 INFO L290 TraceCheckUtils]: 7: Hoare triple {23248#true} assume ~l~0 > 1;#t~post2 := ~l~0;~l~0 := #t~post2 - 1;havoc #t~post2; {23248#true} is VALID [2022-04-08 03:54:00,209 INFO L290 TraceCheckUtils]: 8: Hoare triple {23248#true} assume !!(~r~0 > 1);~i~0 := ~l~0;~j~0 := 2 * ~l~0; {23248#true} is VALID [2022-04-08 03:54:00,209 INFO L290 TraceCheckUtils]: 9: Hoare triple {23248#true} assume !!(~j~0 <= ~r~0); {23248#true} is VALID [2022-04-08 03:54:00,210 INFO L290 TraceCheckUtils]: 10: Hoare triple {23248#true} assume !(~j~0 < ~r~0); {23248#true} is VALID [2022-04-08 03:54:00,210 INFO L272 TraceCheckUtils]: 11: Hoare triple {23248#true} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {23248#true} is VALID [2022-04-08 03:54:00,210 INFO L290 TraceCheckUtils]: 12: Hoare triple {23248#true} ~cond := #in~cond; {23248#true} is VALID [2022-04-08 03:54:00,210 INFO L290 TraceCheckUtils]: 13: Hoare triple {23248#true} assume !(0 == ~cond); {23248#true} is VALID [2022-04-08 03:54:00,210 INFO L290 TraceCheckUtils]: 14: Hoare triple {23248#true} assume true; {23248#true} is VALID [2022-04-08 03:54:00,210 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {23248#true} {23248#true} #118#return; {23248#true} is VALID [2022-04-08 03:54:00,210 INFO L272 TraceCheckUtils]: 16: Hoare triple {23248#true} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {23248#true} is VALID [2022-04-08 03:54:00,210 INFO L290 TraceCheckUtils]: 17: Hoare triple {23248#true} ~cond := #in~cond; {23248#true} is VALID [2022-04-08 03:54:00,210 INFO L290 TraceCheckUtils]: 18: Hoare triple {23248#true} assume !(0 == ~cond); {23248#true} is VALID [2022-04-08 03:54:00,210 INFO L290 TraceCheckUtils]: 19: Hoare triple {23248#true} assume true; {23248#true} is VALID [2022-04-08 03:54:00,211 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {23248#true} {23248#true} #120#return; {23248#true} is VALID [2022-04-08 03:54:00,211 INFO L290 TraceCheckUtils]: 21: Hoare triple {23248#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {23248#true} is VALID [2022-04-08 03:54:00,211 INFO L290 TraceCheckUtils]: 22: Hoare triple {23248#true} assume 0 != #t~nondet5;havoc #t~nondet5; {23248#true} is VALID [2022-04-08 03:54:00,211 INFO L290 TraceCheckUtils]: 23: Hoare triple {23248#true} assume ~l~0 > 1; {23261#(<= 2 main_~l~0)} is VALID [2022-04-08 03:54:00,211 INFO L272 TraceCheckUtils]: 24: Hoare triple {23261#(<= 2 main_~l~0)} call __VERIFIER_assert((if 1 <= ~l~0 then 1 else 0)); {23248#true} is VALID [2022-04-08 03:54:00,211 INFO L290 TraceCheckUtils]: 25: Hoare triple {23248#true} ~cond := #in~cond; {23248#true} is VALID [2022-04-08 03:54:00,211 INFO L290 TraceCheckUtils]: 26: Hoare triple {23248#true} assume !(0 == ~cond); {23248#true} is VALID [2022-04-08 03:54:00,212 INFO L290 TraceCheckUtils]: 27: Hoare triple {23248#true} assume true; {23248#true} is VALID [2022-04-08 03:54:00,212 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {23248#true} {23261#(<= 2 main_~l~0)} #130#return; {23261#(<= 2 main_~l~0)} is VALID [2022-04-08 03:54:00,212 INFO L272 TraceCheckUtils]: 29: Hoare triple {23261#(<= 2 main_~l~0)} call __VERIFIER_assert((if ~l~0 <= ~n~0 then 1 else 0)); {23248#true} is VALID [2022-04-08 03:54:00,212 INFO L290 TraceCheckUtils]: 30: Hoare triple {23248#true} ~cond := #in~cond; {23248#true} is VALID [2022-04-08 03:54:00,212 INFO L290 TraceCheckUtils]: 31: Hoare triple {23248#true} assume !(0 == ~cond); {23248#true} is VALID [2022-04-08 03:54:00,212 INFO L290 TraceCheckUtils]: 32: Hoare triple {23248#true} assume true; {23248#true} is VALID [2022-04-08 03:54:00,213 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {23248#true} {23261#(<= 2 main_~l~0)} #132#return; {23261#(<= 2 main_~l~0)} is VALID [2022-04-08 03:54:00,213 INFO L290 TraceCheckUtils]: 34: Hoare triple {23261#(<= 2 main_~l~0)} #t~post6 := ~l~0;~l~0 := #t~post6 - 1;havoc #t~post6; {23270#(<= 1 main_~l~0)} is VALID [2022-04-08 03:54:00,213 INFO L290 TraceCheckUtils]: 35: Hoare triple {23270#(<= 1 main_~l~0)} assume !!(~r~0 > 1);~i~0 := ~l~0;~j~0 := 2 * ~l~0; {23271#(<= 1 main_~i~0)} is VALID [2022-04-08 03:54:00,214 INFO L290 TraceCheckUtils]: 36: Hoare triple {23271#(<= 1 main_~i~0)} assume !!(~j~0 <= ~r~0); {23271#(<= 1 main_~i~0)} is VALID [2022-04-08 03:54:00,214 INFO L290 TraceCheckUtils]: 37: Hoare triple {23271#(<= 1 main_~i~0)} assume !(~j~0 < ~r~0); {23271#(<= 1 main_~i~0)} is VALID [2022-04-08 03:54:00,214 INFO L272 TraceCheckUtils]: 38: Hoare triple {23271#(<= 1 main_~i~0)} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {23248#true} is VALID [2022-04-08 03:54:00,214 INFO L290 TraceCheckUtils]: 39: Hoare triple {23248#true} ~cond := #in~cond; {23248#true} is VALID [2022-04-08 03:54:00,214 INFO L290 TraceCheckUtils]: 40: Hoare triple {23248#true} assume !(0 == ~cond); {23248#true} is VALID [2022-04-08 03:54:00,214 INFO L290 TraceCheckUtils]: 41: Hoare triple {23248#true} assume true; {23248#true} is VALID [2022-04-08 03:54:00,215 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {23248#true} {23271#(<= 1 main_~i~0)} #118#return; {23271#(<= 1 main_~i~0)} is VALID [2022-04-08 03:54:00,215 INFO L272 TraceCheckUtils]: 43: Hoare triple {23271#(<= 1 main_~i~0)} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {23248#true} is VALID [2022-04-08 03:54:00,215 INFO L290 TraceCheckUtils]: 44: Hoare triple {23248#true} ~cond := #in~cond; {23248#true} is VALID [2022-04-08 03:54:00,215 INFO L290 TraceCheckUtils]: 45: Hoare triple {23248#true} assume !(0 == ~cond); {23248#true} is VALID [2022-04-08 03:54:00,215 INFO L290 TraceCheckUtils]: 46: Hoare triple {23248#true} assume true; {23248#true} is VALID [2022-04-08 03:54:00,215 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {23248#true} {23271#(<= 1 main_~i~0)} #120#return; {23271#(<= 1 main_~i~0)} is VALID [2022-04-08 03:54:00,216 INFO L290 TraceCheckUtils]: 48: Hoare triple {23271#(<= 1 main_~i~0)} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {23271#(<= 1 main_~i~0)} is VALID [2022-04-08 03:54:00,216 INFO L290 TraceCheckUtils]: 49: Hoare triple {23271#(<= 1 main_~i~0)} assume !(0 != #t~nondet5);havoc #t~nondet5; {23271#(<= 1 main_~i~0)} is VALID [2022-04-08 03:54:00,216 INFO L272 TraceCheckUtils]: 50: Hoare triple {23271#(<= 1 main_~i~0)} call __VERIFIER_assert((if 1 <= ~i~0 then 1 else 0)); {23280#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 03:54:00,217 INFO L290 TraceCheckUtils]: 51: Hoare triple {23280#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {23281#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 03:54:00,217 INFO L290 TraceCheckUtils]: 52: Hoare triple {23281#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {23249#false} is VALID [2022-04-08 03:54:00,217 INFO L290 TraceCheckUtils]: 53: Hoare triple {23249#false} assume !false; {23249#false} is VALID [2022-04-08 03:54:00,217 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-04-08 03:54:00,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 03:54:00,218 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [832914908] [2022-04-08 03:54:00,220 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [832914908] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 03:54:00,220 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 03:54:00,220 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-08 03:54:00,221 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 03:54:00,221 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1748968875] [2022-04-08 03:54:00,221 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1748968875] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 03:54:00,221 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 03:54:00,221 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-08 03:54:00,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1226126315] [2022-04-08 03:54:00,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 03:54:00,222 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.875) internal successors, (23), 6 states have internal predecessors, (23), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 54 [2022-04-08 03:54:00,222 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 03:54:00,222 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 2.875) internal successors, (23), 6 states have internal predecessors, (23), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-08 03:54:00,238 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 03:54:00,238 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-08 03:54:00,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 03:54:00,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-08 03:54:00,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-04-08 03:54:00,240 INFO L87 Difference]: Start difference. First operand 437 states and 723 transitions. Second operand has 8 states, 8 states have (on average 2.875) internal successors, (23), 6 states have internal predecessors, (23), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-08 03:54:02,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:54:02,674 INFO L93 Difference]: Finished difference Result 501 states and 826 transitions. [2022-04-08 03:54:02,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-08 03:54:02,675 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.875) internal successors, (23), 6 states have internal predecessors, (23), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 54 [2022-04-08 03:54:02,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 03:54:02,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.875) internal successors, (23), 6 states have internal predecessors, (23), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-08 03:54:02,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 107 transitions. [2022-04-08 03:54:02,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.875) internal successors, (23), 6 states have internal predecessors, (23), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-08 03:54:02,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 107 transitions. [2022-04-08 03:54:02,678 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 107 transitions. [2022-04-08 03:54:02,772 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 107 edges. 107 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:54:02,785 INFO L225 Difference]: With dead ends: 501 [2022-04-08 03:54:02,785 INFO L226 Difference]: Without dead ends: 499 [2022-04-08 03:54:02,785 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2022-04-08 03:54:02,786 INFO L913 BasicCegarLoop]: 39 mSDtfsCounter, 80 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 315 mSolverCounterSat, 106 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 421 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 106 IncrementalHoareTripleChecker+Valid, 315 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-08 03:54:02,786 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [80 Valid, 66 Invalid, 421 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [106 Valid, 315 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-08 03:54:02,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 499 states. [2022-04-08 03:54:04,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 499 to 441. [2022-04-08 03:54:04,450 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 03:54:04,451 INFO L82 GeneralOperation]: Start isEquivalent. First operand 499 states. Second operand has 441 states, 191 states have (on average 1.3769633507853403) internal successors, (263), 218 states have internal predecessors, (263), 232 states have call successors, (232), 18 states have call predecessors, (232), 17 states have return successors, (231), 204 states have call predecessors, (231), 231 states have call successors, (231) [2022-04-08 03:54:04,456 INFO L74 IsIncluded]: Start isIncluded. First operand 499 states. Second operand has 441 states, 191 states have (on average 1.3769633507853403) internal successors, (263), 218 states have internal predecessors, (263), 232 states have call successors, (232), 18 states have call predecessors, (232), 17 states have return successors, (231), 204 states have call predecessors, (231), 231 states have call successors, (231) [2022-04-08 03:54:04,457 INFO L87 Difference]: Start difference. First operand 499 states. Second operand has 441 states, 191 states have (on average 1.3769633507853403) internal successors, (263), 218 states have internal predecessors, (263), 232 states have call successors, (232), 18 states have call predecessors, (232), 17 states have return successors, (231), 204 states have call predecessors, (231), 231 states have call successors, (231) [2022-04-08 03:54:04,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:54:04,474 INFO L93 Difference]: Finished difference Result 499 states and 824 transitions. [2022-04-08 03:54:04,474 INFO L276 IsEmpty]: Start isEmpty. Operand 499 states and 824 transitions. [2022-04-08 03:54:04,475 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:54:04,475 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:54:04,477 INFO L74 IsIncluded]: Start isIncluded. First operand has 441 states, 191 states have (on average 1.3769633507853403) internal successors, (263), 218 states have internal predecessors, (263), 232 states have call successors, (232), 18 states have call predecessors, (232), 17 states have return successors, (231), 204 states have call predecessors, (231), 231 states have call successors, (231) Second operand 499 states. [2022-04-08 03:54:04,477 INFO L87 Difference]: Start difference. First operand has 441 states, 191 states have (on average 1.3769633507853403) internal successors, (263), 218 states have internal predecessors, (263), 232 states have call successors, (232), 18 states have call predecessors, (232), 17 states have return successors, (231), 204 states have call predecessors, (231), 231 states have call successors, (231) Second operand 499 states. [2022-04-08 03:54:04,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:54:04,500 INFO L93 Difference]: Finished difference Result 499 states and 824 transitions. [2022-04-08 03:54:04,500 INFO L276 IsEmpty]: Start isEmpty. Operand 499 states and 824 transitions. [2022-04-08 03:54:04,502 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:54:04,502 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:54:04,502 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 03:54:04,502 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 03:54:04,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 441 states, 191 states have (on average 1.3769633507853403) internal successors, (263), 218 states have internal predecessors, (263), 232 states have call successors, (232), 18 states have call predecessors, (232), 17 states have return successors, (231), 204 states have call predecessors, (231), 231 states have call successors, (231) [2022-04-08 03:54:04,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 441 states to 441 states and 726 transitions. [2022-04-08 03:54:04,520 INFO L78 Accepts]: Start accepts. Automaton has 441 states and 726 transitions. Word has length 54 [2022-04-08 03:54:04,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 03:54:04,520 INFO L478 AbstractCegarLoop]: Abstraction has 441 states and 726 transitions. [2022-04-08 03:54:04,520 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.875) internal successors, (23), 6 states have internal predecessors, (23), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-08 03:54:04,521 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 441 states and 726 transitions. [2022-04-08 03:54:05,481 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 726 edges. 726 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:54:05,481 INFO L276 IsEmpty]: Start isEmpty. Operand 441 states and 726 transitions. [2022-04-08 03:54:05,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-04-08 03:54:05,482 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 03:54:05,482 INFO L499 BasicCegarLoop]: trace histogram [9, 8, 8, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 03:54:05,483 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-04-08 03:54:05,483 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 03:54:05,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 03:54:05,483 INFO L85 PathProgramCache]: Analyzing trace with hash -667500302, now seen corresponding path program 1 times [2022-04-08 03:54:05,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 03:54:05,483 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [873829905] [2022-04-08 03:54:05,757 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 03:54:05,757 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because UNSUPPORTED_EIGENVALUES [2022-04-08 03:54:05,757 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 03:54:05,757 INFO L85 PathProgramCache]: Analyzing trace with hash -667500302, now seen corresponding path program 2 times [2022-04-08 03:54:05,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 03:54:05,758 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [893772785] [2022-04-08 03:54:05,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 03:54:05,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 03:54:05,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:54:05,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 03:54:05,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:54:05,816 INFO L290 TraceCheckUtils]: 0: Hoare triple {26226#(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(9, 2); {26184#true} is VALID [2022-04-08 03:54:05,816 INFO L290 TraceCheckUtils]: 1: Hoare triple {26184#true} assume true; {26184#true} is VALID [2022-04-08 03:54:05,816 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {26184#true} {26184#true} #138#return; {26184#true} is VALID [2022-04-08 03:54:05,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-08 03:54:05,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:54:05,819 INFO L290 TraceCheckUtils]: 0: Hoare triple {26184#true} ~cond := #in~cond; {26184#true} is VALID [2022-04-08 03:54:05,819 INFO L290 TraceCheckUtils]: 1: Hoare triple {26184#true} assume !(0 == ~cond); {26184#true} is VALID [2022-04-08 03:54:05,819 INFO L290 TraceCheckUtils]: 2: Hoare triple {26184#true} assume true; {26184#true} is VALID [2022-04-08 03:54:05,820 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26184#true} {26190#(<= 2 main_~j~0)} #118#return; {26190#(<= 2 main_~j~0)} is VALID [2022-04-08 03:54:05,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-04-08 03:54:05,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:54:05,824 INFO L290 TraceCheckUtils]: 0: Hoare triple {26184#true} ~cond := #in~cond; {26184#true} is VALID [2022-04-08 03:54:05,824 INFO L290 TraceCheckUtils]: 1: Hoare triple {26184#true} assume !(0 == ~cond); {26184#true} is VALID [2022-04-08 03:54:05,824 INFO L290 TraceCheckUtils]: 2: Hoare triple {26184#true} assume true; {26184#true} is VALID [2022-04-08 03:54:05,824 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26184#true} {26190#(<= 2 main_~j~0)} #120#return; {26190#(<= 2 main_~j~0)} is VALID [2022-04-08 03:54:05,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-04-08 03:54:05,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:54:05,827 INFO L290 TraceCheckUtils]: 0: Hoare triple {26184#true} ~cond := #in~cond; {26184#true} is VALID [2022-04-08 03:54:05,827 INFO L290 TraceCheckUtils]: 1: Hoare triple {26184#true} assume !(0 == ~cond); {26184#true} is VALID [2022-04-08 03:54:05,827 INFO L290 TraceCheckUtils]: 2: Hoare triple {26184#true} assume true; {26184#true} is VALID [2022-04-08 03:54:05,827 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26184#true} {26190#(<= 2 main_~j~0)} #122#return; {26190#(<= 2 main_~j~0)} is VALID [2022-04-08 03:54:05,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-04-08 03:54:05,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:54:05,829 INFO L290 TraceCheckUtils]: 0: Hoare triple {26184#true} ~cond := #in~cond; {26184#true} is VALID [2022-04-08 03:54:05,830 INFO L290 TraceCheckUtils]: 1: Hoare triple {26184#true} assume !(0 == ~cond); {26184#true} is VALID [2022-04-08 03:54:05,830 INFO L290 TraceCheckUtils]: 2: Hoare triple {26184#true} assume true; {26184#true} is VALID [2022-04-08 03:54:05,830 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26184#true} {26190#(<= 2 main_~j~0)} #124#return; {26190#(<= 2 main_~j~0)} is VALID [2022-04-08 03:54:05,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-04-08 03:54:05,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:54:05,833 INFO L290 TraceCheckUtils]: 0: Hoare triple {26184#true} ~cond := #in~cond; {26184#true} is VALID [2022-04-08 03:54:05,833 INFO L290 TraceCheckUtils]: 1: Hoare triple {26184#true} assume !(0 == ~cond); {26184#true} is VALID [2022-04-08 03:54:05,833 INFO L290 TraceCheckUtils]: 2: Hoare triple {26184#true} assume true; {26184#true} is VALID [2022-04-08 03:54:05,833 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26184#true} {26190#(<= 2 main_~j~0)} #126#return; {26190#(<= 2 main_~j~0)} is VALID [2022-04-08 03:54:05,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-04-08 03:54:05,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:54:05,837 INFO L290 TraceCheckUtils]: 0: Hoare triple {26184#true} ~cond := #in~cond; {26184#true} is VALID [2022-04-08 03:54:05,837 INFO L290 TraceCheckUtils]: 1: Hoare triple {26184#true} assume !(0 == ~cond); {26184#true} is VALID [2022-04-08 03:54:05,838 INFO L290 TraceCheckUtils]: 2: Hoare triple {26184#true} assume true; {26184#true} is VALID [2022-04-08 03:54:05,838 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26184#true} {26190#(<= 2 main_~j~0)} #128#return; {26190#(<= 2 main_~j~0)} is VALID [2022-04-08 03:54:05,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-04-08 03:54:05,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:54:05,843 INFO L290 TraceCheckUtils]: 0: Hoare triple {26184#true} ~cond := #in~cond; {26184#true} is VALID [2022-04-08 03:54:05,843 INFO L290 TraceCheckUtils]: 1: Hoare triple {26184#true} assume !(0 == ~cond); {26184#true} is VALID [2022-04-08 03:54:05,843 INFO L290 TraceCheckUtils]: 2: Hoare triple {26184#true} assume true; {26184#true} is VALID [2022-04-08 03:54:05,843 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26184#true} {26215#(<= 2 main_~i~0)} #118#return; {26215#(<= 2 main_~i~0)} is VALID [2022-04-08 03:54:05,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-04-08 03:54:05,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:54:05,849 INFO L290 TraceCheckUtils]: 0: Hoare triple {26184#true} ~cond := #in~cond; {26184#true} is VALID [2022-04-08 03:54:05,849 INFO L290 TraceCheckUtils]: 1: Hoare triple {26184#true} assume !(0 == ~cond); {26184#true} is VALID [2022-04-08 03:54:05,849 INFO L290 TraceCheckUtils]: 2: Hoare triple {26184#true} assume true; {26184#true} is VALID [2022-04-08 03:54:05,850 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26184#true} {26215#(<= 2 main_~i~0)} #120#return; {26215#(<= 2 main_~i~0)} is VALID [2022-04-08 03:54:05,850 INFO L272 TraceCheckUtils]: 0: Hoare triple {26184#true} call ULTIMATE.init(); {26226#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 03:54:05,850 INFO L290 TraceCheckUtils]: 1: Hoare triple {26226#(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(9, 2); {26184#true} is VALID [2022-04-08 03:54:05,850 INFO L290 TraceCheckUtils]: 2: Hoare triple {26184#true} assume true; {26184#true} is VALID [2022-04-08 03:54:05,851 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26184#true} {26184#true} #138#return; {26184#true} is VALID [2022-04-08 03:54:05,851 INFO L272 TraceCheckUtils]: 4: Hoare triple {26184#true} call #t~ret8 := main(#in~argc, #in~argv.base, #in~argv.offset); {26184#true} is VALID [2022-04-08 03:54:05,851 INFO L290 TraceCheckUtils]: 5: Hoare triple {26184#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;havoc ~n~0;havoc ~l~0;havoc ~r~0;havoc ~i~0;havoc ~j~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {26184#true} is VALID [2022-04-08 03:54:05,851 INFO L290 TraceCheckUtils]: 6: Hoare triple {26184#true} assume !!(1 <= ~n~0 && ~n~0 <= 1000000);~l~0 := 1 + (if ~n~0 < 0 && 0 != ~n~0 % 2 then 1 + ~n~0 / 2 else ~n~0 / 2);~r~0 := ~n~0; {26184#true} is VALID [2022-04-08 03:54:05,851 INFO L290 TraceCheckUtils]: 7: Hoare triple {26184#true} assume ~l~0 > 1;#t~post2 := ~l~0;~l~0 := #t~post2 - 1;havoc #t~post2; {26189#(<= 1 main_~l~0)} is VALID [2022-04-08 03:54:05,852 INFO L290 TraceCheckUtils]: 8: Hoare triple {26189#(<= 1 main_~l~0)} assume !!(~r~0 > 1);~i~0 := ~l~0;~j~0 := 2 * ~l~0; {26190#(<= 2 main_~j~0)} is VALID [2022-04-08 03:54:05,852 INFO L290 TraceCheckUtils]: 9: Hoare triple {26190#(<= 2 main_~j~0)} assume !!(~j~0 <= ~r~0); {26190#(<= 2 main_~j~0)} is VALID [2022-04-08 03:54:05,852 INFO L290 TraceCheckUtils]: 10: Hoare triple {26190#(<= 2 main_~j~0)} assume !(~j~0 < ~r~0); {26190#(<= 2 main_~j~0)} is VALID [2022-04-08 03:54:05,852 INFO L272 TraceCheckUtils]: 11: Hoare triple {26190#(<= 2 main_~j~0)} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {26184#true} is VALID [2022-04-08 03:54:05,852 INFO L290 TraceCheckUtils]: 12: Hoare triple {26184#true} ~cond := #in~cond; {26184#true} is VALID [2022-04-08 03:54:05,853 INFO L290 TraceCheckUtils]: 13: Hoare triple {26184#true} assume !(0 == ~cond); {26184#true} is VALID [2022-04-08 03:54:05,853 INFO L290 TraceCheckUtils]: 14: Hoare triple {26184#true} assume true; {26184#true} is VALID [2022-04-08 03:54:05,853 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {26184#true} {26190#(<= 2 main_~j~0)} #118#return; {26190#(<= 2 main_~j~0)} is VALID [2022-04-08 03:54:05,853 INFO L272 TraceCheckUtils]: 16: Hoare triple {26190#(<= 2 main_~j~0)} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {26184#true} is VALID [2022-04-08 03:54:05,853 INFO L290 TraceCheckUtils]: 17: Hoare triple {26184#true} ~cond := #in~cond; {26184#true} is VALID [2022-04-08 03:54:05,853 INFO L290 TraceCheckUtils]: 18: Hoare triple {26184#true} assume !(0 == ~cond); {26184#true} is VALID [2022-04-08 03:54:05,853 INFO L290 TraceCheckUtils]: 19: Hoare triple {26184#true} assume true; {26184#true} is VALID [2022-04-08 03:54:05,854 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {26184#true} {26190#(<= 2 main_~j~0)} #120#return; {26190#(<= 2 main_~j~0)} is VALID [2022-04-08 03:54:05,854 INFO L290 TraceCheckUtils]: 21: Hoare triple {26190#(<= 2 main_~j~0)} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {26190#(<= 2 main_~j~0)} is VALID [2022-04-08 03:54:05,854 INFO L290 TraceCheckUtils]: 22: Hoare triple {26190#(<= 2 main_~j~0)} assume !(0 != #t~nondet5);havoc #t~nondet5; {26190#(<= 2 main_~j~0)} is VALID [2022-04-08 03:54:05,854 INFO L272 TraceCheckUtils]: 23: Hoare triple {26190#(<= 2 main_~j~0)} call __VERIFIER_assert((if 1 <= ~i~0 then 1 else 0)); {26184#true} is VALID [2022-04-08 03:54:05,854 INFO L290 TraceCheckUtils]: 24: Hoare triple {26184#true} ~cond := #in~cond; {26184#true} is VALID [2022-04-08 03:54:05,855 INFO L290 TraceCheckUtils]: 25: Hoare triple {26184#true} assume !(0 == ~cond); {26184#true} is VALID [2022-04-08 03:54:05,855 INFO L290 TraceCheckUtils]: 26: Hoare triple {26184#true} assume true; {26184#true} is VALID [2022-04-08 03:54:05,855 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {26184#true} {26190#(<= 2 main_~j~0)} #122#return; {26190#(<= 2 main_~j~0)} is VALID [2022-04-08 03:54:05,855 INFO L272 TraceCheckUtils]: 28: Hoare triple {26190#(<= 2 main_~j~0)} call __VERIFIER_assert((if ~i~0 <= ~n~0 then 1 else 0)); {26184#true} is VALID [2022-04-08 03:54:05,855 INFO L290 TraceCheckUtils]: 29: Hoare triple {26184#true} ~cond := #in~cond; {26184#true} is VALID [2022-04-08 03:54:05,855 INFO L290 TraceCheckUtils]: 30: Hoare triple {26184#true} assume !(0 == ~cond); {26184#true} is VALID [2022-04-08 03:54:05,855 INFO L290 TraceCheckUtils]: 31: Hoare triple {26184#true} assume true; {26184#true} is VALID [2022-04-08 03:54:05,856 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {26184#true} {26190#(<= 2 main_~j~0)} #124#return; {26190#(<= 2 main_~j~0)} is VALID [2022-04-08 03:54:05,856 INFO L272 TraceCheckUtils]: 33: Hoare triple {26190#(<= 2 main_~j~0)} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {26184#true} is VALID [2022-04-08 03:54:05,856 INFO L290 TraceCheckUtils]: 34: Hoare triple {26184#true} ~cond := #in~cond; {26184#true} is VALID [2022-04-08 03:54:05,856 INFO L290 TraceCheckUtils]: 35: Hoare triple {26184#true} assume !(0 == ~cond); {26184#true} is VALID [2022-04-08 03:54:05,856 INFO L290 TraceCheckUtils]: 36: Hoare triple {26184#true} assume true; {26184#true} is VALID [2022-04-08 03:54:05,857 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {26184#true} {26190#(<= 2 main_~j~0)} #126#return; {26190#(<= 2 main_~j~0)} is VALID [2022-04-08 03:54:05,857 INFO L272 TraceCheckUtils]: 38: Hoare triple {26190#(<= 2 main_~j~0)} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {26184#true} is VALID [2022-04-08 03:54:05,857 INFO L290 TraceCheckUtils]: 39: Hoare triple {26184#true} ~cond := #in~cond; {26184#true} is VALID [2022-04-08 03:54:05,857 INFO L290 TraceCheckUtils]: 40: Hoare triple {26184#true} assume !(0 == ~cond); {26184#true} is VALID [2022-04-08 03:54:05,857 INFO L290 TraceCheckUtils]: 41: Hoare triple {26184#true} assume true; {26184#true} is VALID [2022-04-08 03:54:05,858 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {26184#true} {26190#(<= 2 main_~j~0)} #128#return; {26190#(<= 2 main_~j~0)} is VALID [2022-04-08 03:54:05,858 INFO L290 TraceCheckUtils]: 43: Hoare triple {26190#(<= 2 main_~j~0)} ~i~0 := ~j~0;~j~0 := 2 * ~j~0; {26215#(<= 2 main_~i~0)} is VALID [2022-04-08 03:54:05,858 INFO L290 TraceCheckUtils]: 44: Hoare triple {26215#(<= 2 main_~i~0)} assume !!(~j~0 <= ~r~0); {26215#(<= 2 main_~i~0)} is VALID [2022-04-08 03:54:05,859 INFO L290 TraceCheckUtils]: 45: Hoare triple {26215#(<= 2 main_~i~0)} assume !(~j~0 < ~r~0); {26215#(<= 2 main_~i~0)} is VALID [2022-04-08 03:54:05,859 INFO L272 TraceCheckUtils]: 46: Hoare triple {26215#(<= 2 main_~i~0)} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {26184#true} is VALID [2022-04-08 03:54:05,859 INFO L290 TraceCheckUtils]: 47: Hoare triple {26184#true} ~cond := #in~cond; {26184#true} is VALID [2022-04-08 03:54:05,859 INFO L290 TraceCheckUtils]: 48: Hoare triple {26184#true} assume !(0 == ~cond); {26184#true} is VALID [2022-04-08 03:54:05,859 INFO L290 TraceCheckUtils]: 49: Hoare triple {26184#true} assume true; {26184#true} is VALID [2022-04-08 03:54:05,859 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {26184#true} {26215#(<= 2 main_~i~0)} #118#return; {26215#(<= 2 main_~i~0)} is VALID [2022-04-08 03:54:05,859 INFO L272 TraceCheckUtils]: 51: Hoare triple {26215#(<= 2 main_~i~0)} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {26184#true} is VALID [2022-04-08 03:54:05,860 INFO L290 TraceCheckUtils]: 52: Hoare triple {26184#true} ~cond := #in~cond; {26184#true} is VALID [2022-04-08 03:54:05,860 INFO L290 TraceCheckUtils]: 53: Hoare triple {26184#true} assume !(0 == ~cond); {26184#true} is VALID [2022-04-08 03:54:05,860 INFO L290 TraceCheckUtils]: 54: Hoare triple {26184#true} assume true; {26184#true} is VALID [2022-04-08 03:54:05,860 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {26184#true} {26215#(<= 2 main_~i~0)} #120#return; {26215#(<= 2 main_~i~0)} is VALID [2022-04-08 03:54:05,860 INFO L290 TraceCheckUtils]: 56: Hoare triple {26215#(<= 2 main_~i~0)} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {26215#(<= 2 main_~i~0)} is VALID [2022-04-08 03:54:05,861 INFO L290 TraceCheckUtils]: 57: Hoare triple {26215#(<= 2 main_~i~0)} assume !(0 != #t~nondet5);havoc #t~nondet5; {26215#(<= 2 main_~i~0)} is VALID [2022-04-08 03:54:05,861 INFO L272 TraceCheckUtils]: 58: Hoare triple {26215#(<= 2 main_~i~0)} call __VERIFIER_assert((if 1 <= ~i~0 then 1 else 0)); {26224#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 03:54:05,861 INFO L290 TraceCheckUtils]: 59: Hoare triple {26224#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {26225#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 03:54:05,862 INFO L290 TraceCheckUtils]: 60: Hoare triple {26225#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {26185#false} is VALID [2022-04-08 03:54:05,862 INFO L290 TraceCheckUtils]: 61: Hoare triple {26185#false} assume !false; {26185#false} is VALID [2022-04-08 03:54:05,862 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 16 proven. 7 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2022-04-08 03:54:05,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 03:54:05,862 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [893772785] [2022-04-08 03:54:05,862 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [893772785] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 03:54:05,862 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [43812924] [2022-04-08 03:54:05,863 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 03:54:05,863 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 03:54:05,863 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 03:54:05,880 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 03:54:05,883 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 03:54:05,934 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 03:54:05,937 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 03:54:05,939 INFO L263 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-08 03:54:05,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:54:05,966 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 03:54:07,368 INFO L272 TraceCheckUtils]: 0: Hoare triple {26184#true} call ULTIMATE.init(); {26184#true} is VALID [2022-04-08 03:54:07,369 INFO L290 TraceCheckUtils]: 1: Hoare triple {26184#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(9, 2); {26184#true} is VALID [2022-04-08 03:54:07,369 INFO L290 TraceCheckUtils]: 2: Hoare triple {26184#true} assume true; {26184#true} is VALID [2022-04-08 03:54:07,369 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26184#true} {26184#true} #138#return; {26184#true} is VALID [2022-04-08 03:54:07,370 INFO L272 TraceCheckUtils]: 4: Hoare triple {26184#true} call #t~ret8 := main(#in~argc, #in~argv.base, #in~argv.offset); {26184#true} is VALID [2022-04-08 03:54:07,370 INFO L290 TraceCheckUtils]: 5: Hoare triple {26184#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;havoc ~n~0;havoc ~l~0;havoc ~r~0;havoc ~i~0;havoc ~j~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {26184#true} is VALID [2022-04-08 03:54:07,370 INFO L290 TraceCheckUtils]: 6: Hoare triple {26184#true} assume !!(1 <= ~n~0 && ~n~0 <= 1000000);~l~0 := 1 + (if ~n~0 < 0 && 0 != ~n~0 % 2 then 1 + ~n~0 / 2 else ~n~0 / 2);~r~0 := ~n~0; {26248#(<= 1 main_~r~0)} is VALID [2022-04-08 03:54:07,370 INFO L290 TraceCheckUtils]: 7: Hoare triple {26248#(<= 1 main_~r~0)} assume ~l~0 > 1;#t~post2 := ~l~0;~l~0 := #t~post2 - 1;havoc #t~post2; {26248#(<= 1 main_~r~0)} is VALID [2022-04-08 03:54:07,371 INFO L290 TraceCheckUtils]: 8: Hoare triple {26248#(<= 1 main_~r~0)} assume !!(~r~0 > 1);~i~0 := ~l~0;~j~0 := 2 * ~l~0; {26248#(<= 1 main_~r~0)} is VALID [2022-04-08 03:54:07,371 INFO L290 TraceCheckUtils]: 9: Hoare triple {26248#(<= 1 main_~r~0)} assume !!(~j~0 <= ~r~0); {26248#(<= 1 main_~r~0)} is VALID [2022-04-08 03:54:07,371 INFO L290 TraceCheckUtils]: 10: Hoare triple {26248#(<= 1 main_~r~0)} assume !(~j~0 < ~r~0); {26261#(and (<= 1 main_~r~0) (not (< main_~j~0 main_~r~0)))} is VALID [2022-04-08 03:54:07,371 INFO L272 TraceCheckUtils]: 11: Hoare triple {26261#(and (<= 1 main_~r~0) (not (< main_~j~0 main_~r~0)))} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {26184#true} is VALID [2022-04-08 03:54:07,372 INFO L290 TraceCheckUtils]: 12: Hoare triple {26184#true} ~cond := #in~cond; {26184#true} is VALID [2022-04-08 03:54:07,372 INFO L290 TraceCheckUtils]: 13: Hoare triple {26184#true} assume !(0 == ~cond); {26184#true} is VALID [2022-04-08 03:54:07,372 INFO L290 TraceCheckUtils]: 14: Hoare triple {26184#true} assume true; {26184#true} is VALID [2022-04-08 03:54:07,372 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {26184#true} {26261#(and (<= 1 main_~r~0) (not (< main_~j~0 main_~r~0)))} #118#return; {26261#(and (<= 1 main_~r~0) (not (< main_~j~0 main_~r~0)))} is VALID [2022-04-08 03:54:07,372 INFO L272 TraceCheckUtils]: 16: Hoare triple {26261#(and (<= 1 main_~r~0) (not (< main_~j~0 main_~r~0)))} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {26184#true} is VALID [2022-04-08 03:54:07,373 INFO L290 TraceCheckUtils]: 17: Hoare triple {26184#true} ~cond := #in~cond; {26184#true} is VALID [2022-04-08 03:54:07,373 INFO L290 TraceCheckUtils]: 18: Hoare triple {26184#true} assume !(0 == ~cond); {26184#true} is VALID [2022-04-08 03:54:07,373 INFO L290 TraceCheckUtils]: 19: Hoare triple {26184#true} assume true; {26184#true} is VALID [2022-04-08 03:54:07,373 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {26184#true} {26261#(and (<= 1 main_~r~0) (not (< main_~j~0 main_~r~0)))} #120#return; {26261#(and (<= 1 main_~r~0) (not (< main_~j~0 main_~r~0)))} is VALID [2022-04-08 03:54:07,374 INFO L290 TraceCheckUtils]: 21: Hoare triple {26261#(and (<= 1 main_~r~0) (not (< main_~j~0 main_~r~0)))} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {26261#(and (<= 1 main_~r~0) (not (< main_~j~0 main_~r~0)))} is VALID [2022-04-08 03:54:07,374 INFO L290 TraceCheckUtils]: 22: Hoare triple {26261#(and (<= 1 main_~r~0) (not (< main_~j~0 main_~r~0)))} assume !(0 != #t~nondet5);havoc #t~nondet5; {26261#(and (<= 1 main_~r~0) (not (< main_~j~0 main_~r~0)))} is VALID [2022-04-08 03:54:07,374 INFO L272 TraceCheckUtils]: 23: Hoare triple {26261#(and (<= 1 main_~r~0) (not (< main_~j~0 main_~r~0)))} call __VERIFIER_assert((if 1 <= ~i~0 then 1 else 0)); {26184#true} is VALID [2022-04-08 03:54:07,374 INFO L290 TraceCheckUtils]: 24: Hoare triple {26184#true} ~cond := #in~cond; {26184#true} is VALID [2022-04-08 03:54:07,374 INFO L290 TraceCheckUtils]: 25: Hoare triple {26184#true} assume !(0 == ~cond); {26184#true} is VALID [2022-04-08 03:54:07,375 INFO L290 TraceCheckUtils]: 26: Hoare triple {26184#true} assume true; {26184#true} is VALID [2022-04-08 03:54:07,375 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {26184#true} {26261#(and (<= 1 main_~r~0) (not (< main_~j~0 main_~r~0)))} #122#return; {26261#(and (<= 1 main_~r~0) (not (< main_~j~0 main_~r~0)))} is VALID [2022-04-08 03:54:07,375 INFO L272 TraceCheckUtils]: 28: Hoare triple {26261#(and (<= 1 main_~r~0) (not (< main_~j~0 main_~r~0)))} call __VERIFIER_assert((if ~i~0 <= ~n~0 then 1 else 0)); {26184#true} is VALID [2022-04-08 03:54:07,375 INFO L290 TraceCheckUtils]: 29: Hoare triple {26184#true} ~cond := #in~cond; {26184#true} is VALID [2022-04-08 03:54:07,375 INFO L290 TraceCheckUtils]: 30: Hoare triple {26184#true} assume !(0 == ~cond); {26184#true} is VALID [2022-04-08 03:54:07,375 INFO L290 TraceCheckUtils]: 31: Hoare triple {26184#true} assume true; {26184#true} is VALID [2022-04-08 03:54:07,376 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {26184#true} {26261#(and (<= 1 main_~r~0) (not (< main_~j~0 main_~r~0)))} #124#return; {26261#(and (<= 1 main_~r~0) (not (< main_~j~0 main_~r~0)))} is VALID [2022-04-08 03:54:07,376 INFO L272 TraceCheckUtils]: 33: Hoare triple {26261#(and (<= 1 main_~r~0) (not (< main_~j~0 main_~r~0)))} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {26184#true} is VALID [2022-04-08 03:54:07,376 INFO L290 TraceCheckUtils]: 34: Hoare triple {26184#true} ~cond := #in~cond; {26184#true} is VALID [2022-04-08 03:54:07,376 INFO L290 TraceCheckUtils]: 35: Hoare triple {26184#true} assume !(0 == ~cond); {26184#true} is VALID [2022-04-08 03:54:07,376 INFO L290 TraceCheckUtils]: 36: Hoare triple {26184#true} assume true; {26184#true} is VALID [2022-04-08 03:54:07,377 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {26184#true} {26261#(and (<= 1 main_~r~0) (not (< main_~j~0 main_~r~0)))} #126#return; {26261#(and (<= 1 main_~r~0) (not (< main_~j~0 main_~r~0)))} is VALID [2022-04-08 03:54:07,377 INFO L272 TraceCheckUtils]: 38: Hoare triple {26261#(and (<= 1 main_~r~0) (not (< main_~j~0 main_~r~0)))} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {26184#true} is VALID [2022-04-08 03:54:07,377 INFO L290 TraceCheckUtils]: 39: Hoare triple {26184#true} ~cond := #in~cond; {26184#true} is VALID [2022-04-08 03:54:07,377 INFO L290 TraceCheckUtils]: 40: Hoare triple {26184#true} assume !(0 == ~cond); {26184#true} is VALID [2022-04-08 03:54:07,377 INFO L290 TraceCheckUtils]: 41: Hoare triple {26184#true} assume true; {26184#true} is VALID [2022-04-08 03:54:07,377 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {26184#true} {26261#(and (<= 1 main_~r~0) (not (< main_~j~0 main_~r~0)))} #128#return; {26261#(and (<= 1 main_~r~0) (not (< main_~j~0 main_~r~0)))} is VALID [2022-04-08 03:54:07,378 INFO L290 TraceCheckUtils]: 43: Hoare triple {26261#(and (<= 1 main_~r~0) (not (< main_~j~0 main_~r~0)))} ~i~0 := ~j~0;~j~0 := 2 * ~j~0; {26361#(and (<= main_~r~0 (div main_~j~0 2)) (<= 1 main_~r~0))} is VALID [2022-04-08 03:54:07,378 INFO L290 TraceCheckUtils]: 44: Hoare triple {26361#(and (<= main_~r~0 (div main_~j~0 2)) (<= 1 main_~r~0))} assume !!(~j~0 <= ~r~0); {26185#false} is VALID [2022-04-08 03:54:07,379 INFO L290 TraceCheckUtils]: 45: Hoare triple {26185#false} assume !(~j~0 < ~r~0); {26185#false} is VALID [2022-04-08 03:54:07,379 INFO L272 TraceCheckUtils]: 46: Hoare triple {26185#false} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {26185#false} is VALID [2022-04-08 03:54:07,379 INFO L290 TraceCheckUtils]: 47: Hoare triple {26185#false} ~cond := #in~cond; {26185#false} is VALID [2022-04-08 03:54:07,379 INFO L290 TraceCheckUtils]: 48: Hoare triple {26185#false} assume !(0 == ~cond); {26185#false} is VALID [2022-04-08 03:54:07,379 INFO L290 TraceCheckUtils]: 49: Hoare triple {26185#false} assume true; {26185#false} is VALID [2022-04-08 03:54:07,379 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {26185#false} {26185#false} #118#return; {26185#false} is VALID [2022-04-08 03:54:07,379 INFO L272 TraceCheckUtils]: 51: Hoare triple {26185#false} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {26185#false} is VALID [2022-04-08 03:54:07,379 INFO L290 TraceCheckUtils]: 52: Hoare triple {26185#false} ~cond := #in~cond; {26185#false} is VALID [2022-04-08 03:54:07,379 INFO L290 TraceCheckUtils]: 53: Hoare triple {26185#false} assume !(0 == ~cond); {26185#false} is VALID [2022-04-08 03:54:07,379 INFO L290 TraceCheckUtils]: 54: Hoare triple {26185#false} assume true; {26185#false} is VALID [2022-04-08 03:54:07,380 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {26185#false} {26185#false} #120#return; {26185#false} is VALID [2022-04-08 03:54:07,380 INFO L290 TraceCheckUtils]: 56: Hoare triple {26185#false} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {26185#false} is VALID [2022-04-08 03:54:07,380 INFO L290 TraceCheckUtils]: 57: Hoare triple {26185#false} assume !(0 != #t~nondet5);havoc #t~nondet5; {26185#false} is VALID [2022-04-08 03:54:07,380 INFO L272 TraceCheckUtils]: 58: Hoare triple {26185#false} call __VERIFIER_assert((if 1 <= ~i~0 then 1 else 0)); {26185#false} is VALID [2022-04-08 03:54:07,380 INFO L290 TraceCheckUtils]: 59: Hoare triple {26185#false} ~cond := #in~cond; {26185#false} is VALID [2022-04-08 03:54:07,380 INFO L290 TraceCheckUtils]: 60: Hoare triple {26185#false} assume 0 == ~cond; {26185#false} is VALID [2022-04-08 03:54:07,380 INFO L290 TraceCheckUtils]: 61: Hoare triple {26185#false} assume !false; {26185#false} is VALID [2022-04-08 03:54:07,381 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2022-04-08 03:54:07,381 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-08 03:54:07,381 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [43812924] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 03:54:07,381 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-08 03:54:07,381 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 11 [2022-04-08 03:54:07,382 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 03:54:07,382 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [873829905] [2022-04-08 03:54:07,382 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [873829905] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 03:54:07,382 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 03:54:07,382 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 03:54:07,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1123949635] [2022-04-08 03:54:07,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 03:54:07,383 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 62 [2022-04-08 03:54:07,383 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 03:54:07,383 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-04-08 03:54:07,409 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:54:07,410 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 03:54:07,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 03:54:07,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 03:54:07,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2022-04-08 03:54:07,410 INFO L87 Difference]: Start difference. First operand 441 states and 726 transitions. Second operand has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-04-08 03:54:10,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:54:10,344 INFO L93 Difference]: Finished difference Result 843 states and 1374 transitions. [2022-04-08 03:54:10,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 03:54:10,344 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 62 [2022-04-08 03:54:10,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 03:54:10,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-04-08 03:54:10,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 152 transitions. [2022-04-08 03:54:10,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-04-08 03:54:10,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 152 transitions. [2022-04-08 03:54:10,348 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 152 transitions. [2022-04-08 03:54:10,454 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 152 edges. 152 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:54:10,465 INFO L225 Difference]: With dead ends: 843 [2022-04-08 03:54:10,465 INFO L226 Difference]: Without dead ends: 437 [2022-04-08 03:54:10,467 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2022-04-08 03:54:10,467 INFO L913 BasicCegarLoop]: 71 mSDtfsCounter, 27 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 03:54:10,467 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [49 Valid, 109 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 03:54:10,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 437 states. [2022-04-08 03:54:12,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 437 to 401. [2022-04-08 03:54:12,438 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 03:54:12,439 INFO L82 GeneralOperation]: Start isEquivalent. First operand 437 states. Second operand has 401 states, 183 states have (on average 1.3387978142076502) internal successors, (245), 203 states have internal predecessors, (245), 200 states have call successors, (200), 18 states have call predecessors, (200), 17 states have return successors, (199), 179 states have call predecessors, (199), 199 states have call successors, (199) [2022-04-08 03:54:12,440 INFO L74 IsIncluded]: Start isIncluded. First operand 437 states. Second operand has 401 states, 183 states have (on average 1.3387978142076502) internal successors, (245), 203 states have internal predecessors, (245), 200 states have call successors, (200), 18 states have call predecessors, (200), 17 states have return successors, (199), 179 states have call predecessors, (199), 199 states have call successors, (199) [2022-04-08 03:54:12,440 INFO L87 Difference]: Start difference. First operand 437 states. Second operand has 401 states, 183 states have (on average 1.3387978142076502) internal successors, (245), 203 states have internal predecessors, (245), 200 states have call successors, (200), 18 states have call predecessors, (200), 17 states have return successors, (199), 179 states have call predecessors, (199), 199 states have call successors, (199) [2022-04-08 03:54:12,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:54:12,452 INFO L93 Difference]: Finished difference Result 437 states and 700 transitions. [2022-04-08 03:54:12,452 INFO L276 IsEmpty]: Start isEmpty. Operand 437 states and 700 transitions. [2022-04-08 03:54:12,453 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:54:12,453 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:54:12,454 INFO L74 IsIncluded]: Start isIncluded. First operand has 401 states, 183 states have (on average 1.3387978142076502) internal successors, (245), 203 states have internal predecessors, (245), 200 states have call successors, (200), 18 states have call predecessors, (200), 17 states have return successors, (199), 179 states have call predecessors, (199), 199 states have call successors, (199) Second operand 437 states. [2022-04-08 03:54:12,455 INFO L87 Difference]: Start difference. First operand has 401 states, 183 states have (on average 1.3387978142076502) internal successors, (245), 203 states have internal predecessors, (245), 200 states have call successors, (200), 18 states have call predecessors, (200), 17 states have return successors, (199), 179 states have call predecessors, (199), 199 states have call successors, (199) Second operand 437 states. [2022-04-08 03:54:12,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:54:12,466 INFO L93 Difference]: Finished difference Result 437 states and 700 transitions. [2022-04-08 03:54:12,466 INFO L276 IsEmpty]: Start isEmpty. Operand 437 states and 700 transitions. [2022-04-08 03:54:12,481 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:54:12,481 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:54:12,481 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 03:54:12,482 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 03:54:12,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 401 states, 183 states have (on average 1.3387978142076502) internal successors, (245), 203 states have internal predecessors, (245), 200 states have call successors, (200), 18 states have call predecessors, (200), 17 states have return successors, (199), 179 states have call predecessors, (199), 199 states have call successors, (199) [2022-04-08 03:54:12,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 401 states and 644 transitions. [2022-04-08 03:54:12,494 INFO L78 Accepts]: Start accepts. Automaton has 401 states and 644 transitions. Word has length 62 [2022-04-08 03:54:12,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 03:54:12,495 INFO L478 AbstractCegarLoop]: Abstraction has 401 states and 644 transitions. [2022-04-08 03:54:12,495 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-04-08 03:54:12,495 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 401 states and 644 transitions. [2022-04-08 03:54:13,237 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 644 edges. 644 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:54:13,238 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 644 transitions. [2022-04-08 03:54:13,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-04-08 03:54:13,239 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 03:54:13,239 INFO L499 BasicCegarLoop]: trace histogram [13, 12, 12, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 03:54:13,260 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 03:54:13,440 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-04-08 03:54:13,440 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 03:54:13,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 03:54:13,440 INFO L85 PathProgramCache]: Analyzing trace with hash 1858540084, now seen corresponding path program 1 times [2022-04-08 03:54:13,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 03:54:13,441 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [89757551] [2022-04-08 03:54:13,744 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 03:54:13,744 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because UNSUPPORTED_EIGENVALUES [2022-04-08 03:54:13,744 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 03:54:13,744 INFO L85 PathProgramCache]: Analyzing trace with hash 1858540084, now seen corresponding path program 2 times [2022-04-08 03:54:13,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 03:54:13,745 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [61166824] [2022-04-08 03:54:13,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 03:54:13,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 03:54:13,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:54:13,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 03:54:13,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:54:13,817 INFO L290 TraceCheckUtils]: 0: Hoare triple {29836#(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(9, 2); {29777#true} is VALID [2022-04-08 03:54:13,818 INFO L290 TraceCheckUtils]: 1: Hoare triple {29777#true} assume true; {29777#true} is VALID [2022-04-08 03:54:13,818 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {29777#true} {29777#true} #138#return; {29777#true} is VALID [2022-04-08 03:54:13,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-08 03:54:13,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:54:13,830 INFO L290 TraceCheckUtils]: 0: Hoare triple {29777#true} ~cond := #in~cond; {29777#true} is VALID [2022-04-08 03:54:13,830 INFO L290 TraceCheckUtils]: 1: Hoare triple {29777#true} assume !(0 == ~cond); {29777#true} is VALID [2022-04-08 03:54:13,830 INFO L290 TraceCheckUtils]: 2: Hoare triple {29777#true} assume true; {29777#true} is VALID [2022-04-08 03:54:13,831 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29777#true} {29783#(<= 2 main_~j~0)} #110#return; {29783#(<= 2 main_~j~0)} is VALID [2022-04-08 03:54:13,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-04-08 03:54:13,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:54:13,835 INFO L290 TraceCheckUtils]: 0: Hoare triple {29777#true} ~cond := #in~cond; {29777#true} is VALID [2022-04-08 03:54:13,836 INFO L290 TraceCheckUtils]: 1: Hoare triple {29777#true} assume !(0 == ~cond); {29777#true} is VALID [2022-04-08 03:54:13,836 INFO L290 TraceCheckUtils]: 2: Hoare triple {29777#true} assume true; {29777#true} is VALID [2022-04-08 03:54:13,836 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29777#true} {29783#(<= 2 main_~j~0)} #112#return; {29783#(<= 2 main_~j~0)} is VALID [2022-04-08 03:54:13,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-04-08 03:54:13,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:54:13,841 INFO L290 TraceCheckUtils]: 0: Hoare triple {29777#true} ~cond := #in~cond; {29777#true} is VALID [2022-04-08 03:54:13,841 INFO L290 TraceCheckUtils]: 1: Hoare triple {29777#true} assume !(0 == ~cond); {29777#true} is VALID [2022-04-08 03:54:13,841 INFO L290 TraceCheckUtils]: 2: Hoare triple {29777#true} assume true; {29777#true} is VALID [2022-04-08 03:54:13,841 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29777#true} {29783#(<= 2 main_~j~0)} #114#return; {29783#(<= 2 main_~j~0)} is VALID [2022-04-08 03:54:13,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-04-08 03:54:13,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:54:13,845 INFO L290 TraceCheckUtils]: 0: Hoare triple {29777#true} ~cond := #in~cond; {29777#true} is VALID [2022-04-08 03:54:13,845 INFO L290 TraceCheckUtils]: 1: Hoare triple {29777#true} assume !(0 == ~cond); {29777#true} is VALID [2022-04-08 03:54:13,845 INFO L290 TraceCheckUtils]: 2: Hoare triple {29777#true} assume true; {29777#true} is VALID [2022-04-08 03:54:13,846 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29777#true} {29783#(<= 2 main_~j~0)} #116#return; {29783#(<= 2 main_~j~0)} is VALID [2022-04-08 03:54:13,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-04-08 03:54:13,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:54:13,849 INFO L290 TraceCheckUtils]: 0: Hoare triple {29777#true} ~cond := #in~cond; {29777#true} is VALID [2022-04-08 03:54:13,849 INFO L290 TraceCheckUtils]: 1: Hoare triple {29777#true} assume !(0 == ~cond); {29777#true} is VALID [2022-04-08 03:54:13,849 INFO L290 TraceCheckUtils]: 2: Hoare triple {29777#true} assume true; {29777#true} is VALID [2022-04-08 03:54:13,850 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29777#true} {29800#(<= 3 main_~j~0)} #118#return; {29800#(<= 3 main_~j~0)} is VALID [2022-04-08 03:54:13,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-04-08 03:54:13,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:54:13,854 INFO L290 TraceCheckUtils]: 0: Hoare triple {29777#true} ~cond := #in~cond; {29777#true} is VALID [2022-04-08 03:54:13,854 INFO L290 TraceCheckUtils]: 1: Hoare triple {29777#true} assume !(0 == ~cond); {29777#true} is VALID [2022-04-08 03:54:13,854 INFO L290 TraceCheckUtils]: 2: Hoare triple {29777#true} assume true; {29777#true} is VALID [2022-04-08 03:54:13,854 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29777#true} {29800#(<= 3 main_~j~0)} #120#return; {29800#(<= 3 main_~j~0)} is VALID [2022-04-08 03:54:13,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-04-08 03:54:13,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:54:13,857 INFO L290 TraceCheckUtils]: 0: Hoare triple {29777#true} ~cond := #in~cond; {29777#true} is VALID [2022-04-08 03:54:13,857 INFO L290 TraceCheckUtils]: 1: Hoare triple {29777#true} assume !(0 == ~cond); {29777#true} is VALID [2022-04-08 03:54:13,857 INFO L290 TraceCheckUtils]: 2: Hoare triple {29777#true} assume true; {29777#true} is VALID [2022-04-08 03:54:13,858 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29777#true} {29800#(<= 3 main_~j~0)} #122#return; {29800#(<= 3 main_~j~0)} is VALID [2022-04-08 03:54:13,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-04-08 03:54:13,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:54:13,864 INFO L290 TraceCheckUtils]: 0: Hoare triple {29777#true} ~cond := #in~cond; {29777#true} is VALID [2022-04-08 03:54:13,864 INFO L290 TraceCheckUtils]: 1: Hoare triple {29777#true} assume !(0 == ~cond); {29777#true} is VALID [2022-04-08 03:54:13,864 INFO L290 TraceCheckUtils]: 2: Hoare triple {29777#true} assume true; {29777#true} is VALID [2022-04-08 03:54:13,865 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29777#true} {29800#(<= 3 main_~j~0)} #124#return; {29800#(<= 3 main_~j~0)} is VALID [2022-04-08 03:54:13,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-04-08 03:54:13,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:54:13,868 INFO L290 TraceCheckUtils]: 0: Hoare triple {29777#true} ~cond := #in~cond; {29777#true} is VALID [2022-04-08 03:54:13,868 INFO L290 TraceCheckUtils]: 1: Hoare triple {29777#true} assume !(0 == ~cond); {29777#true} is VALID [2022-04-08 03:54:13,868 INFO L290 TraceCheckUtils]: 2: Hoare triple {29777#true} assume true; {29777#true} is VALID [2022-04-08 03:54:13,869 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29777#true} {29800#(<= 3 main_~j~0)} #126#return; {29800#(<= 3 main_~j~0)} is VALID [2022-04-08 03:54:13,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-04-08 03:54:13,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:54:13,872 INFO L290 TraceCheckUtils]: 0: Hoare triple {29777#true} ~cond := #in~cond; {29777#true} is VALID [2022-04-08 03:54:13,873 INFO L290 TraceCheckUtils]: 1: Hoare triple {29777#true} assume !(0 == ~cond); {29777#true} is VALID [2022-04-08 03:54:13,873 INFO L290 TraceCheckUtils]: 2: Hoare triple {29777#true} assume true; {29777#true} is VALID [2022-04-08 03:54:13,873 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29777#true} {29800#(<= 3 main_~j~0)} #128#return; {29800#(<= 3 main_~j~0)} is VALID [2022-04-08 03:54:13,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-04-08 03:54:13,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:54:13,875 INFO L290 TraceCheckUtils]: 0: Hoare triple {29777#true} ~cond := #in~cond; {29777#true} is VALID [2022-04-08 03:54:13,875 INFO L290 TraceCheckUtils]: 1: Hoare triple {29777#true} assume !(0 == ~cond); {29777#true} is VALID [2022-04-08 03:54:13,875 INFO L290 TraceCheckUtils]: 2: Hoare triple {29777#true} assume true; {29777#true} is VALID [2022-04-08 03:54:13,876 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29777#true} {29825#(<= 3 main_~i~0)} #118#return; {29825#(<= 3 main_~i~0)} is VALID [2022-04-08 03:54:13,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-04-08 03:54:13,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:54:13,878 INFO L290 TraceCheckUtils]: 0: Hoare triple {29777#true} ~cond := #in~cond; {29777#true} is VALID [2022-04-08 03:54:13,878 INFO L290 TraceCheckUtils]: 1: Hoare triple {29777#true} assume !(0 == ~cond); {29777#true} is VALID [2022-04-08 03:54:13,879 INFO L290 TraceCheckUtils]: 2: Hoare triple {29777#true} assume true; {29777#true} is VALID [2022-04-08 03:54:13,879 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29777#true} {29825#(<= 3 main_~i~0)} #120#return; {29825#(<= 3 main_~i~0)} is VALID [2022-04-08 03:54:13,879 INFO L272 TraceCheckUtils]: 0: Hoare triple {29777#true} call ULTIMATE.init(); {29836#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 03:54:13,880 INFO L290 TraceCheckUtils]: 1: Hoare triple {29836#(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(9, 2); {29777#true} is VALID [2022-04-08 03:54:13,880 INFO L290 TraceCheckUtils]: 2: Hoare triple {29777#true} assume true; {29777#true} is VALID [2022-04-08 03:54:13,880 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29777#true} {29777#true} #138#return; {29777#true} is VALID [2022-04-08 03:54:13,880 INFO L272 TraceCheckUtils]: 4: Hoare triple {29777#true} call #t~ret8 := main(#in~argc, #in~argv.base, #in~argv.offset); {29777#true} is VALID [2022-04-08 03:54:13,880 INFO L290 TraceCheckUtils]: 5: Hoare triple {29777#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;havoc ~n~0;havoc ~l~0;havoc ~r~0;havoc ~i~0;havoc ~j~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {29777#true} is VALID [2022-04-08 03:54:13,880 INFO L290 TraceCheckUtils]: 6: Hoare triple {29777#true} assume !!(1 <= ~n~0 && ~n~0 <= 1000000);~l~0 := 1 + (if ~n~0 < 0 && 0 != ~n~0 % 2 then 1 + ~n~0 / 2 else ~n~0 / 2);~r~0 := ~n~0; {29777#true} is VALID [2022-04-08 03:54:13,880 INFO L290 TraceCheckUtils]: 7: Hoare triple {29777#true} assume ~l~0 > 1;#t~post2 := ~l~0;~l~0 := #t~post2 - 1;havoc #t~post2; {29782#(<= 1 main_~l~0)} is VALID [2022-04-08 03:54:13,881 INFO L290 TraceCheckUtils]: 8: Hoare triple {29782#(<= 1 main_~l~0)} assume !!(~r~0 > 1);~i~0 := ~l~0;~j~0 := 2 * ~l~0; {29783#(<= 2 main_~j~0)} is VALID [2022-04-08 03:54:13,881 INFO L290 TraceCheckUtils]: 9: Hoare triple {29783#(<= 2 main_~j~0)} assume !!(~j~0 <= ~r~0); {29783#(<= 2 main_~j~0)} is VALID [2022-04-08 03:54:13,881 INFO L290 TraceCheckUtils]: 10: Hoare triple {29783#(<= 2 main_~j~0)} assume ~j~0 < ~r~0; {29783#(<= 2 main_~j~0)} is VALID [2022-04-08 03:54:13,882 INFO L272 TraceCheckUtils]: 11: Hoare triple {29783#(<= 2 main_~j~0)} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {29777#true} is VALID [2022-04-08 03:54:13,882 INFO L290 TraceCheckUtils]: 12: Hoare triple {29777#true} ~cond := #in~cond; {29777#true} is VALID [2022-04-08 03:54:13,882 INFO L290 TraceCheckUtils]: 13: Hoare triple {29777#true} assume !(0 == ~cond); {29777#true} is VALID [2022-04-08 03:54:13,882 INFO L290 TraceCheckUtils]: 14: Hoare triple {29777#true} assume true; {29777#true} is VALID [2022-04-08 03:54:13,882 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {29777#true} {29783#(<= 2 main_~j~0)} #110#return; {29783#(<= 2 main_~j~0)} is VALID [2022-04-08 03:54:13,882 INFO L272 TraceCheckUtils]: 16: Hoare triple {29783#(<= 2 main_~j~0)} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {29777#true} is VALID [2022-04-08 03:54:13,882 INFO L290 TraceCheckUtils]: 17: Hoare triple {29777#true} ~cond := #in~cond; {29777#true} is VALID [2022-04-08 03:54:13,882 INFO L290 TraceCheckUtils]: 18: Hoare triple {29777#true} assume !(0 == ~cond); {29777#true} is VALID [2022-04-08 03:54:13,883 INFO L290 TraceCheckUtils]: 19: Hoare triple {29777#true} assume true; {29777#true} is VALID [2022-04-08 03:54:13,883 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {29777#true} {29783#(<= 2 main_~j~0)} #112#return; {29783#(<= 2 main_~j~0)} is VALID [2022-04-08 03:54:13,883 INFO L272 TraceCheckUtils]: 21: Hoare triple {29783#(<= 2 main_~j~0)} call __VERIFIER_assert((if 1 <= 1 + ~j~0 then 1 else 0)); {29777#true} is VALID [2022-04-08 03:54:13,883 INFO L290 TraceCheckUtils]: 22: Hoare triple {29777#true} ~cond := #in~cond; {29777#true} is VALID [2022-04-08 03:54:13,883 INFO L290 TraceCheckUtils]: 23: Hoare triple {29777#true} assume !(0 == ~cond); {29777#true} is VALID [2022-04-08 03:54:13,883 INFO L290 TraceCheckUtils]: 24: Hoare triple {29777#true} assume true; {29777#true} is VALID [2022-04-08 03:54:13,884 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {29777#true} {29783#(<= 2 main_~j~0)} #114#return; {29783#(<= 2 main_~j~0)} is VALID [2022-04-08 03:54:13,884 INFO L272 TraceCheckUtils]: 26: Hoare triple {29783#(<= 2 main_~j~0)} call __VERIFIER_assert((if 1 + ~j~0 <= ~n~0 then 1 else 0)); {29777#true} is VALID [2022-04-08 03:54:13,884 INFO L290 TraceCheckUtils]: 27: Hoare triple {29777#true} ~cond := #in~cond; {29777#true} is VALID [2022-04-08 03:54:13,884 INFO L290 TraceCheckUtils]: 28: Hoare triple {29777#true} assume !(0 == ~cond); {29777#true} is VALID [2022-04-08 03:54:13,884 INFO L290 TraceCheckUtils]: 29: Hoare triple {29777#true} assume true; {29777#true} is VALID [2022-04-08 03:54:13,884 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {29777#true} {29783#(<= 2 main_~j~0)} #116#return; {29783#(<= 2 main_~j~0)} is VALID [2022-04-08 03:54:13,885 INFO L290 TraceCheckUtils]: 31: Hoare triple {29783#(<= 2 main_~j~0)} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {29783#(<= 2 main_~j~0)} is VALID [2022-04-08 03:54:13,885 INFO L290 TraceCheckUtils]: 32: Hoare triple {29783#(<= 2 main_~j~0)} assume 0 != #t~nondet4;havoc #t~nondet4;~j~0 := 1 + ~j~0; {29800#(<= 3 main_~j~0)} is VALID [2022-04-08 03:54:13,885 INFO L272 TraceCheckUtils]: 33: Hoare triple {29800#(<= 3 main_~j~0)} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {29777#true} is VALID [2022-04-08 03:54:13,885 INFO L290 TraceCheckUtils]: 34: Hoare triple {29777#true} ~cond := #in~cond; {29777#true} is VALID [2022-04-08 03:54:13,885 INFO L290 TraceCheckUtils]: 35: Hoare triple {29777#true} assume !(0 == ~cond); {29777#true} is VALID [2022-04-08 03:54:13,885 INFO L290 TraceCheckUtils]: 36: Hoare triple {29777#true} assume true; {29777#true} is VALID [2022-04-08 03:54:13,886 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {29777#true} {29800#(<= 3 main_~j~0)} #118#return; {29800#(<= 3 main_~j~0)} is VALID [2022-04-08 03:54:13,886 INFO L272 TraceCheckUtils]: 38: Hoare triple {29800#(<= 3 main_~j~0)} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {29777#true} is VALID [2022-04-08 03:54:13,886 INFO L290 TraceCheckUtils]: 39: Hoare triple {29777#true} ~cond := #in~cond; {29777#true} is VALID [2022-04-08 03:54:13,886 INFO L290 TraceCheckUtils]: 40: Hoare triple {29777#true} assume !(0 == ~cond); {29777#true} is VALID [2022-04-08 03:54:13,886 INFO L290 TraceCheckUtils]: 41: Hoare triple {29777#true} assume true; {29777#true} is VALID [2022-04-08 03:54:13,886 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {29777#true} {29800#(<= 3 main_~j~0)} #120#return; {29800#(<= 3 main_~j~0)} is VALID [2022-04-08 03:54:13,887 INFO L290 TraceCheckUtils]: 43: Hoare triple {29800#(<= 3 main_~j~0)} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {29800#(<= 3 main_~j~0)} is VALID [2022-04-08 03:54:13,887 INFO L290 TraceCheckUtils]: 44: Hoare triple {29800#(<= 3 main_~j~0)} assume !(0 != #t~nondet5);havoc #t~nondet5; {29800#(<= 3 main_~j~0)} is VALID [2022-04-08 03:54:13,887 INFO L272 TraceCheckUtils]: 45: Hoare triple {29800#(<= 3 main_~j~0)} call __VERIFIER_assert((if 1 <= ~i~0 then 1 else 0)); {29777#true} is VALID [2022-04-08 03:54:13,887 INFO L290 TraceCheckUtils]: 46: Hoare triple {29777#true} ~cond := #in~cond; {29777#true} is VALID [2022-04-08 03:54:13,887 INFO L290 TraceCheckUtils]: 47: Hoare triple {29777#true} assume !(0 == ~cond); {29777#true} is VALID [2022-04-08 03:54:13,887 INFO L290 TraceCheckUtils]: 48: Hoare triple {29777#true} assume true; {29777#true} is VALID [2022-04-08 03:54:13,888 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {29777#true} {29800#(<= 3 main_~j~0)} #122#return; {29800#(<= 3 main_~j~0)} is VALID [2022-04-08 03:54:13,888 INFO L272 TraceCheckUtils]: 50: Hoare triple {29800#(<= 3 main_~j~0)} call __VERIFIER_assert((if ~i~0 <= ~n~0 then 1 else 0)); {29777#true} is VALID [2022-04-08 03:54:13,888 INFO L290 TraceCheckUtils]: 51: Hoare triple {29777#true} ~cond := #in~cond; {29777#true} is VALID [2022-04-08 03:54:13,888 INFO L290 TraceCheckUtils]: 52: Hoare triple {29777#true} assume !(0 == ~cond); {29777#true} is VALID [2022-04-08 03:54:13,888 INFO L290 TraceCheckUtils]: 53: Hoare triple {29777#true} assume true; {29777#true} is VALID [2022-04-08 03:54:13,889 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {29777#true} {29800#(<= 3 main_~j~0)} #124#return; {29800#(<= 3 main_~j~0)} is VALID [2022-04-08 03:54:13,889 INFO L272 TraceCheckUtils]: 55: Hoare triple {29800#(<= 3 main_~j~0)} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {29777#true} is VALID [2022-04-08 03:54:13,889 INFO L290 TraceCheckUtils]: 56: Hoare triple {29777#true} ~cond := #in~cond; {29777#true} is VALID [2022-04-08 03:54:13,889 INFO L290 TraceCheckUtils]: 57: Hoare triple {29777#true} assume !(0 == ~cond); {29777#true} is VALID [2022-04-08 03:54:13,889 INFO L290 TraceCheckUtils]: 58: Hoare triple {29777#true} assume true; {29777#true} is VALID [2022-04-08 03:54:13,889 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {29777#true} {29800#(<= 3 main_~j~0)} #126#return; {29800#(<= 3 main_~j~0)} is VALID [2022-04-08 03:54:13,889 INFO L272 TraceCheckUtils]: 60: Hoare triple {29800#(<= 3 main_~j~0)} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {29777#true} is VALID [2022-04-08 03:54:13,889 INFO L290 TraceCheckUtils]: 61: Hoare triple {29777#true} ~cond := #in~cond; {29777#true} is VALID [2022-04-08 03:54:13,890 INFO L290 TraceCheckUtils]: 62: Hoare triple {29777#true} assume !(0 == ~cond); {29777#true} is VALID [2022-04-08 03:54:13,890 INFO L290 TraceCheckUtils]: 63: Hoare triple {29777#true} assume true; {29777#true} is VALID [2022-04-08 03:54:13,890 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {29777#true} {29800#(<= 3 main_~j~0)} #128#return; {29800#(<= 3 main_~j~0)} is VALID [2022-04-08 03:54:13,890 INFO L290 TraceCheckUtils]: 65: Hoare triple {29800#(<= 3 main_~j~0)} ~i~0 := ~j~0;~j~0 := 2 * ~j~0; {29825#(<= 3 main_~i~0)} is VALID [2022-04-08 03:54:13,891 INFO L290 TraceCheckUtils]: 66: Hoare triple {29825#(<= 3 main_~i~0)} assume !!(~j~0 <= ~r~0); {29825#(<= 3 main_~i~0)} is VALID [2022-04-08 03:54:13,891 INFO L290 TraceCheckUtils]: 67: Hoare triple {29825#(<= 3 main_~i~0)} assume !(~j~0 < ~r~0); {29825#(<= 3 main_~i~0)} is VALID [2022-04-08 03:54:13,891 INFO L272 TraceCheckUtils]: 68: Hoare triple {29825#(<= 3 main_~i~0)} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {29777#true} is VALID [2022-04-08 03:54:13,891 INFO L290 TraceCheckUtils]: 69: Hoare triple {29777#true} ~cond := #in~cond; {29777#true} is VALID [2022-04-08 03:54:13,891 INFO L290 TraceCheckUtils]: 70: Hoare triple {29777#true} assume !(0 == ~cond); {29777#true} is VALID [2022-04-08 03:54:13,891 INFO L290 TraceCheckUtils]: 71: Hoare triple {29777#true} assume true; {29777#true} is VALID [2022-04-08 03:54:13,892 INFO L284 TraceCheckUtils]: 72: Hoare quadruple {29777#true} {29825#(<= 3 main_~i~0)} #118#return; {29825#(<= 3 main_~i~0)} is VALID [2022-04-08 03:54:13,892 INFO L272 TraceCheckUtils]: 73: Hoare triple {29825#(<= 3 main_~i~0)} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {29777#true} is VALID [2022-04-08 03:54:13,892 INFO L290 TraceCheckUtils]: 74: Hoare triple {29777#true} ~cond := #in~cond; {29777#true} is VALID [2022-04-08 03:54:13,892 INFO L290 TraceCheckUtils]: 75: Hoare triple {29777#true} assume !(0 == ~cond); {29777#true} is VALID [2022-04-08 03:54:13,892 INFO L290 TraceCheckUtils]: 76: Hoare triple {29777#true} assume true; {29777#true} is VALID [2022-04-08 03:54:13,892 INFO L284 TraceCheckUtils]: 77: Hoare quadruple {29777#true} {29825#(<= 3 main_~i~0)} #120#return; {29825#(<= 3 main_~i~0)} is VALID [2022-04-08 03:54:13,893 INFO L290 TraceCheckUtils]: 78: Hoare triple {29825#(<= 3 main_~i~0)} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {29825#(<= 3 main_~i~0)} is VALID [2022-04-08 03:54:13,893 INFO L290 TraceCheckUtils]: 79: Hoare triple {29825#(<= 3 main_~i~0)} assume !(0 != #t~nondet5);havoc #t~nondet5; {29825#(<= 3 main_~i~0)} is VALID [2022-04-08 03:54:13,893 INFO L272 TraceCheckUtils]: 80: Hoare triple {29825#(<= 3 main_~i~0)} call __VERIFIER_assert((if 1 <= ~i~0 then 1 else 0)); {29834#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 03:54:13,894 INFO L290 TraceCheckUtils]: 81: Hoare triple {29834#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {29835#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 03:54:13,894 INFO L290 TraceCheckUtils]: 82: Hoare triple {29835#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {29778#false} is VALID [2022-04-08 03:54:13,894 INFO L290 TraceCheckUtils]: 83: Hoare triple {29778#false} assume !false; {29778#false} is VALID [2022-04-08 03:54:13,894 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 24 proven. 7 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2022-04-08 03:54:13,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 03:54:13,895 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [61166824] [2022-04-08 03:54:13,895 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [61166824] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 03:54:13,895 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [33318172] [2022-04-08 03:54:13,895 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 03:54:13,895 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 03:54:13,895 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 03:54:13,896 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 03:54:13,897 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 03:54:13,945 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 03:54:13,945 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 03:54:13,946 INFO L263 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-08 03:54:13,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:54:13,962 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 03:54:16,865 INFO L272 TraceCheckUtils]: 0: Hoare triple {29777#true} call ULTIMATE.init(); {29777#true} is VALID [2022-04-08 03:54:16,865 INFO L290 TraceCheckUtils]: 1: Hoare triple {29777#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(9, 2); {29777#true} is VALID [2022-04-08 03:54:16,865 INFO L290 TraceCheckUtils]: 2: Hoare triple {29777#true} assume true; {29777#true} is VALID [2022-04-08 03:54:16,865 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29777#true} {29777#true} #138#return; {29777#true} is VALID [2022-04-08 03:54:16,865 INFO L272 TraceCheckUtils]: 4: Hoare triple {29777#true} call #t~ret8 := main(#in~argc, #in~argv.base, #in~argv.offset); {29777#true} is VALID [2022-04-08 03:54:16,866 INFO L290 TraceCheckUtils]: 5: Hoare triple {29777#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;havoc ~n~0;havoc ~l~0;havoc ~r~0;havoc ~i~0;havoc ~j~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {29777#true} is VALID [2022-04-08 03:54:16,866 INFO L290 TraceCheckUtils]: 6: Hoare triple {29777#true} assume !!(1 <= ~n~0 && ~n~0 <= 1000000);~l~0 := 1 + (if ~n~0 < 0 && 0 != ~n~0 % 2 then 1 + ~n~0 / 2 else ~n~0 / 2);~r~0 := ~n~0; {29858#(and (< 0 main_~l~0) (< (div (+ (* (- 1) main_~r~0) 1) (- 2)) main_~l~0))} is VALID [2022-04-08 03:54:16,867 INFO L290 TraceCheckUtils]: 7: Hoare triple {29858#(and (< 0 main_~l~0) (< (div (+ (* (- 1) main_~r~0) 1) (- 2)) main_~l~0))} assume ~l~0 > 1;#t~post2 := ~l~0;~l~0 := #t~post2 - 1;havoc #t~post2; {29862#(and (< 0 (+ main_~l~0 1)) (< (div (+ (* (- 1) main_~r~0) 1) (- 2)) (+ main_~l~0 1)))} is VALID [2022-04-08 03:54:16,867 INFO L290 TraceCheckUtils]: 8: Hoare triple {29862#(and (< 0 (+ main_~l~0 1)) (< (div (+ (* (- 1) main_~r~0) 1) (- 2)) (+ main_~l~0 1)))} assume !!(~r~0 > 1);~i~0 := ~l~0;~j~0 := 2 * ~l~0; {29866#(and (< 1 main_~r~0) (< (div (+ (* (- 1) main_~r~0) 1) (- 2)) (+ (div main_~j~0 2) 1)))} is VALID [2022-04-08 03:54:16,868 INFO L290 TraceCheckUtils]: 9: Hoare triple {29866#(and (< 1 main_~r~0) (< (div (+ (* (- 1) main_~r~0) 1) (- 2)) (+ (div main_~j~0 2) 1)))} assume !!(~j~0 <= ~r~0); {29866#(and (< 1 main_~r~0) (< (div (+ (* (- 1) main_~r~0) 1) (- 2)) (+ (div main_~j~0 2) 1)))} is VALID [2022-04-08 03:54:16,868 INFO L290 TraceCheckUtils]: 10: Hoare triple {29866#(and (< 1 main_~r~0) (< (div (+ (* (- 1) main_~r~0) 1) (- 2)) (+ (div main_~j~0 2) 1)))} assume ~j~0 < ~r~0; {29866#(and (< 1 main_~r~0) (< (div (+ (* (- 1) main_~r~0) 1) (- 2)) (+ (div main_~j~0 2) 1)))} is VALID [2022-04-08 03:54:16,868 INFO L272 TraceCheckUtils]: 11: Hoare triple {29866#(and (< 1 main_~r~0) (< (div (+ (* (- 1) main_~r~0) 1) (- 2)) (+ (div main_~j~0 2) 1)))} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {29777#true} is VALID [2022-04-08 03:54:16,868 INFO L290 TraceCheckUtils]: 12: Hoare triple {29777#true} ~cond := #in~cond; {29777#true} is VALID [2022-04-08 03:54:16,868 INFO L290 TraceCheckUtils]: 13: Hoare triple {29777#true} assume !(0 == ~cond); {29777#true} is VALID [2022-04-08 03:54:16,868 INFO L290 TraceCheckUtils]: 14: Hoare triple {29777#true} assume true; {29777#true} is VALID [2022-04-08 03:54:16,869 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {29777#true} {29866#(and (< 1 main_~r~0) (< (div (+ (* (- 1) main_~r~0) 1) (- 2)) (+ (div main_~j~0 2) 1)))} #110#return; {29866#(and (< 1 main_~r~0) (< (div (+ (* (- 1) main_~r~0) 1) (- 2)) (+ (div main_~j~0 2) 1)))} is VALID [2022-04-08 03:54:16,869 INFO L272 TraceCheckUtils]: 16: Hoare triple {29866#(and (< 1 main_~r~0) (< (div (+ (* (- 1) main_~r~0) 1) (- 2)) (+ (div main_~j~0 2) 1)))} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {29777#true} is VALID [2022-04-08 03:54:16,869 INFO L290 TraceCheckUtils]: 17: Hoare triple {29777#true} ~cond := #in~cond; {29777#true} is VALID [2022-04-08 03:54:16,869 INFO L290 TraceCheckUtils]: 18: Hoare triple {29777#true} assume !(0 == ~cond); {29777#true} is VALID [2022-04-08 03:54:16,869 INFO L290 TraceCheckUtils]: 19: Hoare triple {29777#true} assume true; {29777#true} is VALID [2022-04-08 03:54:16,883 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {29777#true} {29866#(and (< 1 main_~r~0) (< (div (+ (* (- 1) main_~r~0) 1) (- 2)) (+ (div main_~j~0 2) 1)))} #112#return; {29866#(and (< 1 main_~r~0) (< (div (+ (* (- 1) main_~r~0) 1) (- 2)) (+ (div main_~j~0 2) 1)))} is VALID [2022-04-08 03:54:16,883 INFO L272 TraceCheckUtils]: 21: Hoare triple {29866#(and (< 1 main_~r~0) (< (div (+ (* (- 1) main_~r~0) 1) (- 2)) (+ (div main_~j~0 2) 1)))} call __VERIFIER_assert((if 1 <= 1 + ~j~0 then 1 else 0)); {29777#true} is VALID [2022-04-08 03:54:16,883 INFO L290 TraceCheckUtils]: 22: Hoare triple {29777#true} ~cond := #in~cond; {29777#true} is VALID [2022-04-08 03:54:16,883 INFO L290 TraceCheckUtils]: 23: Hoare triple {29777#true} assume !(0 == ~cond); {29777#true} is VALID [2022-04-08 03:54:16,883 INFO L290 TraceCheckUtils]: 24: Hoare triple {29777#true} assume true; {29777#true} is VALID [2022-04-08 03:54:16,884 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {29777#true} {29866#(and (< 1 main_~r~0) (< (div (+ (* (- 1) main_~r~0) 1) (- 2)) (+ (div main_~j~0 2) 1)))} #114#return; {29866#(and (< 1 main_~r~0) (< (div (+ (* (- 1) main_~r~0) 1) (- 2)) (+ (div main_~j~0 2) 1)))} is VALID [2022-04-08 03:54:16,884 INFO L272 TraceCheckUtils]: 26: Hoare triple {29866#(and (< 1 main_~r~0) (< (div (+ (* (- 1) main_~r~0) 1) (- 2)) (+ (div main_~j~0 2) 1)))} call __VERIFIER_assert((if 1 + ~j~0 <= ~n~0 then 1 else 0)); {29777#true} is VALID [2022-04-08 03:54:16,884 INFO L290 TraceCheckUtils]: 27: Hoare triple {29777#true} ~cond := #in~cond; {29777#true} is VALID [2022-04-08 03:54:16,884 INFO L290 TraceCheckUtils]: 28: Hoare triple {29777#true} assume !(0 == ~cond); {29777#true} is VALID [2022-04-08 03:54:16,884 INFO L290 TraceCheckUtils]: 29: Hoare triple {29777#true} assume true; {29777#true} is VALID [2022-04-08 03:54:16,884 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {29777#true} {29866#(and (< 1 main_~r~0) (< (div (+ (* (- 1) main_~r~0) 1) (- 2)) (+ (div main_~j~0 2) 1)))} #116#return; {29866#(and (< 1 main_~r~0) (< (div (+ (* (- 1) main_~r~0) 1) (- 2)) (+ (div main_~j~0 2) 1)))} is VALID [2022-04-08 03:54:16,885 INFO L290 TraceCheckUtils]: 31: Hoare triple {29866#(and (< 1 main_~r~0) (< (div (+ (* (- 1) main_~r~0) 1) (- 2)) (+ (div main_~j~0 2) 1)))} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {29866#(and (< 1 main_~r~0) (< (div (+ (* (- 1) main_~r~0) 1) (- 2)) (+ (div main_~j~0 2) 1)))} is VALID [2022-04-08 03:54:16,885 INFO L290 TraceCheckUtils]: 32: Hoare triple {29866#(and (< 1 main_~r~0) (< (div (+ (* (- 1) main_~r~0) 1) (- 2)) (+ (div main_~j~0 2) 1)))} assume 0 != #t~nondet4;havoc #t~nondet4;~j~0 := 1 + ~j~0; {29939#(and (< 1 main_~r~0) (< (div (+ (* (- 1) main_~r~0) 1) (- 2)) (+ (div (+ (- 1) main_~j~0) 2) 1)))} is VALID [2022-04-08 03:54:16,886 INFO L272 TraceCheckUtils]: 33: Hoare triple {29939#(and (< 1 main_~r~0) (< (div (+ (* (- 1) main_~r~0) 1) (- 2)) (+ (div (+ (- 1) main_~j~0) 2) 1)))} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {29777#true} is VALID [2022-04-08 03:54:16,886 INFO L290 TraceCheckUtils]: 34: Hoare triple {29777#true} ~cond := #in~cond; {29777#true} is VALID [2022-04-08 03:54:16,886 INFO L290 TraceCheckUtils]: 35: Hoare triple {29777#true} assume !(0 == ~cond); {29777#true} is VALID [2022-04-08 03:54:16,886 INFO L290 TraceCheckUtils]: 36: Hoare triple {29777#true} assume true; {29777#true} is VALID [2022-04-08 03:54:16,899 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {29777#true} {29939#(and (< 1 main_~r~0) (< (div (+ (* (- 1) main_~r~0) 1) (- 2)) (+ (div (+ (- 1) main_~j~0) 2) 1)))} #118#return; {29939#(and (< 1 main_~r~0) (< (div (+ (* (- 1) main_~r~0) 1) (- 2)) (+ (div (+ (- 1) main_~j~0) 2) 1)))} is VALID [2022-04-08 03:54:16,899 INFO L272 TraceCheckUtils]: 38: Hoare triple {29939#(and (< 1 main_~r~0) (< (div (+ (* (- 1) main_~r~0) 1) (- 2)) (+ (div (+ (- 1) main_~j~0) 2) 1)))} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {29777#true} is VALID [2022-04-08 03:54:16,899 INFO L290 TraceCheckUtils]: 39: Hoare triple {29777#true} ~cond := #in~cond; {29777#true} is VALID [2022-04-08 03:54:16,900 INFO L290 TraceCheckUtils]: 40: Hoare triple {29777#true} assume !(0 == ~cond); {29777#true} is VALID [2022-04-08 03:54:16,900 INFO L290 TraceCheckUtils]: 41: Hoare triple {29777#true} assume true; {29777#true} is VALID [2022-04-08 03:54:16,900 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {29777#true} {29939#(and (< 1 main_~r~0) (< (div (+ (* (- 1) main_~r~0) 1) (- 2)) (+ (div (+ (- 1) main_~j~0) 2) 1)))} #120#return; {29939#(and (< 1 main_~r~0) (< (div (+ (* (- 1) main_~r~0) 1) (- 2)) (+ (div (+ (- 1) main_~j~0) 2) 1)))} is VALID [2022-04-08 03:54:16,900 INFO L290 TraceCheckUtils]: 43: Hoare triple {29939#(and (< 1 main_~r~0) (< (div (+ (* (- 1) main_~r~0) 1) (- 2)) (+ (div (+ (- 1) main_~j~0) 2) 1)))} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {29939#(and (< 1 main_~r~0) (< (div (+ (* (- 1) main_~r~0) 1) (- 2)) (+ (div (+ (- 1) main_~j~0) 2) 1)))} is VALID [2022-04-08 03:54:16,901 INFO L290 TraceCheckUtils]: 44: Hoare triple {29939#(and (< 1 main_~r~0) (< (div (+ (* (- 1) main_~r~0) 1) (- 2)) (+ (div (+ (- 1) main_~j~0) 2) 1)))} assume !(0 != #t~nondet5);havoc #t~nondet5; {29939#(and (< 1 main_~r~0) (< (div (+ (* (- 1) main_~r~0) 1) (- 2)) (+ (div (+ (- 1) main_~j~0) 2) 1)))} is VALID [2022-04-08 03:54:16,901 INFO L272 TraceCheckUtils]: 45: Hoare triple {29939#(and (< 1 main_~r~0) (< (div (+ (* (- 1) main_~r~0) 1) (- 2)) (+ (div (+ (- 1) main_~j~0) 2) 1)))} call __VERIFIER_assert((if 1 <= ~i~0 then 1 else 0)); {29777#true} is VALID [2022-04-08 03:54:16,901 INFO L290 TraceCheckUtils]: 46: Hoare triple {29777#true} ~cond := #in~cond; {29777#true} is VALID [2022-04-08 03:54:16,901 INFO L290 TraceCheckUtils]: 47: Hoare triple {29777#true} assume !(0 == ~cond); {29777#true} is VALID [2022-04-08 03:54:16,901 INFO L290 TraceCheckUtils]: 48: Hoare triple {29777#true} assume true; {29777#true} is VALID [2022-04-08 03:54:16,902 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {29777#true} {29939#(and (< 1 main_~r~0) (< (div (+ (* (- 1) main_~r~0) 1) (- 2)) (+ (div (+ (- 1) main_~j~0) 2) 1)))} #122#return; {29939#(and (< 1 main_~r~0) (< (div (+ (* (- 1) main_~r~0) 1) (- 2)) (+ (div (+ (- 1) main_~j~0) 2) 1)))} is VALID [2022-04-08 03:54:16,902 INFO L272 TraceCheckUtils]: 50: Hoare triple {29939#(and (< 1 main_~r~0) (< (div (+ (* (- 1) main_~r~0) 1) (- 2)) (+ (div (+ (- 1) main_~j~0) 2) 1)))} call __VERIFIER_assert((if ~i~0 <= ~n~0 then 1 else 0)); {29777#true} is VALID [2022-04-08 03:54:16,902 INFO L290 TraceCheckUtils]: 51: Hoare triple {29777#true} ~cond := #in~cond; {29777#true} is VALID [2022-04-08 03:54:16,902 INFO L290 TraceCheckUtils]: 52: Hoare triple {29777#true} assume !(0 == ~cond); {29777#true} is VALID [2022-04-08 03:54:16,902 INFO L290 TraceCheckUtils]: 53: Hoare triple {29777#true} assume true; {29777#true} is VALID [2022-04-08 03:54:16,902 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {29777#true} {29939#(and (< 1 main_~r~0) (< (div (+ (* (- 1) main_~r~0) 1) (- 2)) (+ (div (+ (- 1) main_~j~0) 2) 1)))} #124#return; {29939#(and (< 1 main_~r~0) (< (div (+ (* (- 1) main_~r~0) 1) (- 2)) (+ (div (+ (- 1) main_~j~0) 2) 1)))} is VALID [2022-04-08 03:54:16,902 INFO L272 TraceCheckUtils]: 55: Hoare triple {29939#(and (< 1 main_~r~0) (< (div (+ (* (- 1) main_~r~0) 1) (- 2)) (+ (div (+ (- 1) main_~j~0) 2) 1)))} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {29777#true} is VALID [2022-04-08 03:54:16,903 INFO L290 TraceCheckUtils]: 56: Hoare triple {29777#true} ~cond := #in~cond; {29777#true} is VALID [2022-04-08 03:54:16,903 INFO L290 TraceCheckUtils]: 57: Hoare triple {29777#true} assume !(0 == ~cond); {29777#true} is VALID [2022-04-08 03:54:16,903 INFO L290 TraceCheckUtils]: 58: Hoare triple {29777#true} assume true; {29777#true} is VALID [2022-04-08 03:54:16,903 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {29777#true} {29939#(and (< 1 main_~r~0) (< (div (+ (* (- 1) main_~r~0) 1) (- 2)) (+ (div (+ (- 1) main_~j~0) 2) 1)))} #126#return; {29939#(and (< 1 main_~r~0) (< (div (+ (* (- 1) main_~r~0) 1) (- 2)) (+ (div (+ (- 1) main_~j~0) 2) 1)))} is VALID [2022-04-08 03:54:16,903 INFO L272 TraceCheckUtils]: 60: Hoare triple {29939#(and (< 1 main_~r~0) (< (div (+ (* (- 1) main_~r~0) 1) (- 2)) (+ (div (+ (- 1) main_~j~0) 2) 1)))} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {29777#true} is VALID [2022-04-08 03:54:16,903 INFO L290 TraceCheckUtils]: 61: Hoare triple {29777#true} ~cond := #in~cond; {29777#true} is VALID [2022-04-08 03:54:16,903 INFO L290 TraceCheckUtils]: 62: Hoare triple {29777#true} assume !(0 == ~cond); {29777#true} is VALID [2022-04-08 03:54:16,903 INFO L290 TraceCheckUtils]: 63: Hoare triple {29777#true} assume true; {29777#true} is VALID [2022-04-08 03:54:16,904 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {29777#true} {29939#(and (< 1 main_~r~0) (< (div (+ (* (- 1) main_~r~0) 1) (- 2)) (+ (div (+ (- 1) main_~j~0) 2) 1)))} #128#return; {29939#(and (< 1 main_~r~0) (< (div (+ (* (- 1) main_~r~0) 1) (- 2)) (+ (div (+ (- 1) main_~j~0) 2) 1)))} is VALID [2022-04-08 03:54:16,905 INFO L290 TraceCheckUtils]: 65: Hoare triple {29939#(and (< 1 main_~r~0) (< (div (+ (* (- 1) main_~r~0) 1) (- 2)) (+ (div (+ (- 1) main_~j~0) 2) 1)))} ~i~0 := ~j~0;~j~0 := 2 * ~j~0; {30039#(and (< 1 main_~r~0) (< (div (+ (* (- 1) main_~r~0) 1) (- 2)) (+ (div (div (+ (- 2) main_~j~0) 2) 2) 1)))} is VALID [2022-04-08 03:54:16,905 INFO L290 TraceCheckUtils]: 66: Hoare triple {30039#(and (< 1 main_~r~0) (< (div (+ (* (- 1) main_~r~0) 1) (- 2)) (+ (div (div (+ (- 2) main_~j~0) 2) 2) 1)))} assume !!(~j~0 <= ~r~0); {29778#false} is VALID [2022-04-08 03:54:16,905 INFO L290 TraceCheckUtils]: 67: Hoare triple {29778#false} assume !(~j~0 < ~r~0); {29778#false} is VALID [2022-04-08 03:54:16,905 INFO L272 TraceCheckUtils]: 68: Hoare triple {29778#false} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {29778#false} is VALID [2022-04-08 03:54:16,905 INFO L290 TraceCheckUtils]: 69: Hoare triple {29778#false} ~cond := #in~cond; {29778#false} is VALID [2022-04-08 03:54:16,905 INFO L290 TraceCheckUtils]: 70: Hoare triple {29778#false} assume !(0 == ~cond); {29778#false} is VALID [2022-04-08 03:54:16,906 INFO L290 TraceCheckUtils]: 71: Hoare triple {29778#false} assume true; {29778#false} is VALID [2022-04-08 03:54:16,906 INFO L284 TraceCheckUtils]: 72: Hoare quadruple {29778#false} {29778#false} #118#return; {29778#false} is VALID [2022-04-08 03:54:16,906 INFO L272 TraceCheckUtils]: 73: Hoare triple {29778#false} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {29778#false} is VALID [2022-04-08 03:54:16,906 INFO L290 TraceCheckUtils]: 74: Hoare triple {29778#false} ~cond := #in~cond; {29778#false} is VALID [2022-04-08 03:54:16,906 INFO L290 TraceCheckUtils]: 75: Hoare triple {29778#false} assume !(0 == ~cond); {29778#false} is VALID [2022-04-08 03:54:16,906 INFO L290 TraceCheckUtils]: 76: Hoare triple {29778#false} assume true; {29778#false} is VALID [2022-04-08 03:54:16,906 INFO L284 TraceCheckUtils]: 77: Hoare quadruple {29778#false} {29778#false} #120#return; {29778#false} is VALID [2022-04-08 03:54:16,906 INFO L290 TraceCheckUtils]: 78: Hoare triple {29778#false} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {29778#false} is VALID [2022-04-08 03:54:16,906 INFO L290 TraceCheckUtils]: 79: Hoare triple {29778#false} assume !(0 != #t~nondet5);havoc #t~nondet5; {29778#false} is VALID [2022-04-08 03:54:16,906 INFO L272 TraceCheckUtils]: 80: Hoare triple {29778#false} call __VERIFIER_assert((if 1 <= ~i~0 then 1 else 0)); {29778#false} is VALID [2022-04-08 03:54:16,907 INFO L290 TraceCheckUtils]: 81: Hoare triple {29778#false} ~cond := #in~cond; {29778#false} is VALID [2022-04-08 03:54:16,907 INFO L290 TraceCheckUtils]: 82: Hoare triple {29778#false} assume 0 == ~cond; {29778#false} is VALID [2022-04-08 03:54:16,907 INFO L290 TraceCheckUtils]: 83: Hoare triple {29778#false} assume !false; {29778#false} is VALID [2022-04-08 03:54:16,907 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 107 proven. 0 refuted. 0 times theorem prover too weak. 188 trivial. 0 not checked. [2022-04-08 03:54:16,907 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-08 03:54:16,907 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [33318172] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 03:54:16,907 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-08 03:54:16,908 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [9] total 14 [2022-04-08 03:54:16,908 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 03:54:16,908 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [89757551] [2022-04-08 03:54:16,908 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [89757551] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 03:54:16,908 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 03:54:16,908 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-08 03:54:16,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1846304579] [2022-04-08 03:54:16,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 03:54:16,909 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 4 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) Word has length 84 [2022-04-08 03:54:16,909 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 03:54:16,909 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 4 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) [2022-04-08 03:54:16,944 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:54:16,944 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-08 03:54:16,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 03:54:16,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-08 03:54:16,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2022-04-08 03:54:16,945 INFO L87 Difference]: Start difference. First operand 401 states and 644 transitions. Second operand has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 4 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) [2022-04-08 03:54:19,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:54:19,509 INFO L93 Difference]: Finished difference Result 714 states and 1123 transitions. [2022-04-08 03:54:19,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-08 03:54:19,509 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 4 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) Word has length 84 [2022-04-08 03:54:19,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 03:54:19,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 4 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) [2022-04-08 03:54:19,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 224 transitions. [2022-04-08 03:54:19,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 4 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) [2022-04-08 03:54:19,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 224 transitions. [2022-04-08 03:54:19,532 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 224 transitions. [2022-04-08 03:54:19,644 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 224 edges. 224 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:54:19,670 INFO L225 Difference]: With dead ends: 714 [2022-04-08 03:54:19,670 INFO L226 Difference]: Without dead ends: 329 [2022-04-08 03:54:19,672 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=87, Invalid=255, Unknown=0, NotChecked=0, Total=342 [2022-04-08 03:54:19,672 INFO L913 BasicCegarLoop]: 94 mSDtfsCounter, 39 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 263 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 237 SdHoareTripleChecker+Invalid, 347 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 263 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-08 03:54:19,673 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [39 Valid, 237 Invalid, 347 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 263 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-08 03:54:19,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2022-04-08 03:54:21,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 295. [2022-04-08 03:54:21,184 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 03:54:21,185 INFO L82 GeneralOperation]: Start isEquivalent. First operand 329 states. Second operand has 295 states, 142 states have (on average 1.2887323943661972) internal successors, (183), 154 states have internal predecessors, (183), 136 states have call successors, (136), 17 states have call predecessors, (136), 16 states have return successors, (135), 123 states have call predecessors, (135), 135 states have call successors, (135) [2022-04-08 03:54:21,185 INFO L74 IsIncluded]: Start isIncluded. First operand 329 states. Second operand has 295 states, 142 states have (on average 1.2887323943661972) internal successors, (183), 154 states have internal predecessors, (183), 136 states have call successors, (136), 17 states have call predecessors, (136), 16 states have return successors, (135), 123 states have call predecessors, (135), 135 states have call successors, (135) [2022-04-08 03:54:21,186 INFO L87 Difference]: Start difference. First operand 329 states. Second operand has 295 states, 142 states have (on average 1.2887323943661972) internal successors, (183), 154 states have internal predecessors, (183), 136 states have call successors, (136), 17 states have call predecessors, (136), 16 states have return successors, (135), 123 states have call predecessors, (135), 135 states have call successors, (135) [2022-04-08 03:54:21,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:54:21,193 INFO L93 Difference]: Finished difference Result 329 states and 504 transitions. [2022-04-08 03:54:21,193 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 504 transitions. [2022-04-08 03:54:21,193 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:54:21,194 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:54:21,194 INFO L74 IsIncluded]: Start isIncluded. First operand has 295 states, 142 states have (on average 1.2887323943661972) internal successors, (183), 154 states have internal predecessors, (183), 136 states have call successors, (136), 17 states have call predecessors, (136), 16 states have return successors, (135), 123 states have call predecessors, (135), 135 states have call successors, (135) Second operand 329 states. [2022-04-08 03:54:21,194 INFO L87 Difference]: Start difference. First operand has 295 states, 142 states have (on average 1.2887323943661972) internal successors, (183), 154 states have internal predecessors, (183), 136 states have call successors, (136), 17 states have call predecessors, (136), 16 states have return successors, (135), 123 states have call predecessors, (135), 135 states have call successors, (135) Second operand 329 states. [2022-04-08 03:54:21,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:54:21,201 INFO L93 Difference]: Finished difference Result 329 states and 504 transitions. [2022-04-08 03:54:21,201 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 504 transitions. [2022-04-08 03:54:21,202 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:54:21,202 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:54:21,202 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 03:54:21,202 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 03:54:21,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 295 states, 142 states have (on average 1.2887323943661972) internal successors, (183), 154 states have internal predecessors, (183), 136 states have call successors, (136), 17 states have call predecessors, (136), 16 states have return successors, (135), 123 states have call predecessors, (135), 135 states have call successors, (135) [2022-04-08 03:54:21,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 454 transitions. [2022-04-08 03:54:21,210 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 454 transitions. Word has length 84 [2022-04-08 03:54:21,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 03:54:21,211 INFO L478 AbstractCegarLoop]: Abstraction has 295 states and 454 transitions. [2022-04-08 03:54:21,211 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 4 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) [2022-04-08 03:54:21,211 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 295 states and 454 transitions. [2022-04-08 03:54:22,031 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 454 edges. 454 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:54:22,031 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 454 transitions. [2022-04-08 03:54:22,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-04-08 03:54:22,032 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 03:54:22,032 INFO L499 BasicCegarLoop]: trace histogram [13, 12, 12, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 03:54:22,065 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-08 03:54:22,248 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,SelfDestructingSolverStorable17 [2022-04-08 03:54:22,248 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 03:54:22,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 03:54:22,248 INFO L85 PathProgramCache]: Analyzing trace with hash -898087182, now seen corresponding path program 1 times [2022-04-08 03:54:22,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 03:54:22,249 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1797077529] [2022-04-08 03:54:22,506 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 03:54:22,507 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because UNSUPPORTED_EIGENVALUES [2022-04-08 03:54:22,507 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 03:54:22,507 INFO L85 PathProgramCache]: Analyzing trace with hash -898087182, now seen corresponding path program 2 times [2022-04-08 03:54:22,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 03:54:22,507 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122534717] [2022-04-08 03:54:22,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 03:54:22,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 03:54:22,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:54:22,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 03:54:22,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:54:22,579 INFO L290 TraceCheckUtils]: 0: Hoare triple {32837#(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(9, 2); {32779#true} is VALID [2022-04-08 03:54:22,579 INFO L290 TraceCheckUtils]: 1: Hoare triple {32779#true} assume true; {32779#true} is VALID [2022-04-08 03:54:22,579 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {32779#true} {32779#true} #138#return; {32779#true} is VALID [2022-04-08 03:54:22,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-08 03:54:22,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:54:22,585 INFO L290 TraceCheckUtils]: 0: Hoare triple {32779#true} ~cond := #in~cond; {32779#true} is VALID [2022-04-08 03:54:22,585 INFO L290 TraceCheckUtils]: 1: Hoare triple {32779#true} assume !(0 == ~cond); {32779#true} is VALID [2022-04-08 03:54:22,586 INFO L290 TraceCheckUtils]: 2: Hoare triple {32779#true} assume true; {32779#true} is VALID [2022-04-08 03:54:22,586 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32779#true} {32785#(<= 2 main_~j~0)} #110#return; {32785#(<= 2 main_~j~0)} is VALID [2022-04-08 03:54:22,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-04-08 03:54:22,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:54:22,589 INFO L290 TraceCheckUtils]: 0: Hoare triple {32779#true} ~cond := #in~cond; {32779#true} is VALID [2022-04-08 03:54:22,589 INFO L290 TraceCheckUtils]: 1: Hoare triple {32779#true} assume !(0 == ~cond); {32779#true} is VALID [2022-04-08 03:54:22,589 INFO L290 TraceCheckUtils]: 2: Hoare triple {32779#true} assume true; {32779#true} is VALID [2022-04-08 03:54:22,589 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32779#true} {32785#(<= 2 main_~j~0)} #112#return; {32785#(<= 2 main_~j~0)} is VALID [2022-04-08 03:54:22,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-04-08 03:54:22,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:54:22,592 INFO L290 TraceCheckUtils]: 0: Hoare triple {32779#true} ~cond := #in~cond; {32779#true} is VALID [2022-04-08 03:54:22,592 INFO L290 TraceCheckUtils]: 1: Hoare triple {32779#true} assume !(0 == ~cond); {32779#true} is VALID [2022-04-08 03:54:22,593 INFO L290 TraceCheckUtils]: 2: Hoare triple {32779#true} assume true; {32779#true} is VALID [2022-04-08 03:54:22,593 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32779#true} {32785#(<= 2 main_~j~0)} #114#return; {32785#(<= 2 main_~j~0)} is VALID [2022-04-08 03:54:22,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-04-08 03:54:22,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:54:22,595 INFO L290 TraceCheckUtils]: 0: Hoare triple {32779#true} ~cond := #in~cond; {32779#true} is VALID [2022-04-08 03:54:22,595 INFO L290 TraceCheckUtils]: 1: Hoare triple {32779#true} assume !(0 == ~cond); {32779#true} is VALID [2022-04-08 03:54:22,595 INFO L290 TraceCheckUtils]: 2: Hoare triple {32779#true} assume true; {32779#true} is VALID [2022-04-08 03:54:22,596 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32779#true} {32785#(<= 2 main_~j~0)} #116#return; {32785#(<= 2 main_~j~0)} is VALID [2022-04-08 03:54:22,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-04-08 03:54:22,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:54:22,597 INFO L290 TraceCheckUtils]: 0: Hoare triple {32779#true} ~cond := #in~cond; {32779#true} is VALID [2022-04-08 03:54:22,598 INFO L290 TraceCheckUtils]: 1: Hoare triple {32779#true} assume !(0 == ~cond); {32779#true} is VALID [2022-04-08 03:54:22,598 INFO L290 TraceCheckUtils]: 2: Hoare triple {32779#true} assume true; {32779#true} is VALID [2022-04-08 03:54:22,598 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32779#true} {32785#(<= 2 main_~j~0)} #118#return; {32785#(<= 2 main_~j~0)} is VALID [2022-04-08 03:54:22,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-04-08 03:54:22,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:54:22,600 INFO L290 TraceCheckUtils]: 0: Hoare triple {32779#true} ~cond := #in~cond; {32779#true} is VALID [2022-04-08 03:54:22,600 INFO L290 TraceCheckUtils]: 1: Hoare triple {32779#true} assume !(0 == ~cond); {32779#true} is VALID [2022-04-08 03:54:22,600 INFO L290 TraceCheckUtils]: 2: Hoare triple {32779#true} assume true; {32779#true} is VALID [2022-04-08 03:54:22,601 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32779#true} {32785#(<= 2 main_~j~0)} #120#return; {32785#(<= 2 main_~j~0)} is VALID [2022-04-08 03:54:22,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-04-08 03:54:22,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:54:22,603 INFO L290 TraceCheckUtils]: 0: Hoare triple {32779#true} ~cond := #in~cond; {32779#true} is VALID [2022-04-08 03:54:22,603 INFO L290 TraceCheckUtils]: 1: Hoare triple {32779#true} assume !(0 == ~cond); {32779#true} is VALID [2022-04-08 03:54:22,604 INFO L290 TraceCheckUtils]: 2: Hoare triple {32779#true} assume true; {32779#true} is VALID [2022-04-08 03:54:22,604 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32779#true} {32785#(<= 2 main_~j~0)} #122#return; {32785#(<= 2 main_~j~0)} is VALID [2022-04-08 03:54:22,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-04-08 03:54:22,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:54:22,606 INFO L290 TraceCheckUtils]: 0: Hoare triple {32779#true} ~cond := #in~cond; {32779#true} is VALID [2022-04-08 03:54:22,606 INFO L290 TraceCheckUtils]: 1: Hoare triple {32779#true} assume !(0 == ~cond); {32779#true} is VALID [2022-04-08 03:54:22,606 INFO L290 TraceCheckUtils]: 2: Hoare triple {32779#true} assume true; {32779#true} is VALID [2022-04-08 03:54:22,607 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32779#true} {32785#(<= 2 main_~j~0)} #124#return; {32785#(<= 2 main_~j~0)} is VALID [2022-04-08 03:54:22,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-04-08 03:54:22,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:54:22,609 INFO L290 TraceCheckUtils]: 0: Hoare triple {32779#true} ~cond := #in~cond; {32779#true} is VALID [2022-04-08 03:54:22,609 INFO L290 TraceCheckUtils]: 1: Hoare triple {32779#true} assume !(0 == ~cond); {32779#true} is VALID [2022-04-08 03:54:22,609 INFO L290 TraceCheckUtils]: 2: Hoare triple {32779#true} assume true; {32779#true} is VALID [2022-04-08 03:54:22,610 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32779#true} {32785#(<= 2 main_~j~0)} #126#return; {32785#(<= 2 main_~j~0)} is VALID [2022-04-08 03:54:22,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-04-08 03:54:22,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:54:22,612 INFO L290 TraceCheckUtils]: 0: Hoare triple {32779#true} ~cond := #in~cond; {32779#true} is VALID [2022-04-08 03:54:22,612 INFO L290 TraceCheckUtils]: 1: Hoare triple {32779#true} assume !(0 == ~cond); {32779#true} is VALID [2022-04-08 03:54:22,612 INFO L290 TraceCheckUtils]: 2: Hoare triple {32779#true} assume true; {32779#true} is VALID [2022-04-08 03:54:22,613 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32779#true} {32785#(<= 2 main_~j~0)} #128#return; {32785#(<= 2 main_~j~0)} is VALID [2022-04-08 03:54:22,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-04-08 03:54:22,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:54:22,616 INFO L290 TraceCheckUtils]: 0: Hoare triple {32779#true} ~cond := #in~cond; {32779#true} is VALID [2022-04-08 03:54:22,616 INFO L290 TraceCheckUtils]: 1: Hoare triple {32779#true} assume !(0 == ~cond); {32779#true} is VALID [2022-04-08 03:54:22,616 INFO L290 TraceCheckUtils]: 2: Hoare triple {32779#true} assume true; {32779#true} is VALID [2022-04-08 03:54:22,616 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32779#true} {32826#(<= 2 main_~i~0)} #118#return; {32826#(<= 2 main_~i~0)} is VALID [2022-04-08 03:54:22,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-04-08 03:54:22,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:54:22,619 INFO L290 TraceCheckUtils]: 0: Hoare triple {32779#true} ~cond := #in~cond; {32779#true} is VALID [2022-04-08 03:54:22,619 INFO L290 TraceCheckUtils]: 1: Hoare triple {32779#true} assume !(0 == ~cond); {32779#true} is VALID [2022-04-08 03:54:22,619 INFO L290 TraceCheckUtils]: 2: Hoare triple {32779#true} assume true; {32779#true} is VALID [2022-04-08 03:54:22,620 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32779#true} {32826#(<= 2 main_~i~0)} #120#return; {32826#(<= 2 main_~i~0)} is VALID [2022-04-08 03:54:22,620 INFO L272 TraceCheckUtils]: 0: Hoare triple {32779#true} call ULTIMATE.init(); {32837#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 03:54:22,620 INFO L290 TraceCheckUtils]: 1: Hoare triple {32837#(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(9, 2); {32779#true} is VALID [2022-04-08 03:54:22,620 INFO L290 TraceCheckUtils]: 2: Hoare triple {32779#true} assume true; {32779#true} is VALID [2022-04-08 03:54:22,620 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32779#true} {32779#true} #138#return; {32779#true} is VALID [2022-04-08 03:54:22,621 INFO L272 TraceCheckUtils]: 4: Hoare triple {32779#true} call #t~ret8 := main(#in~argc, #in~argv.base, #in~argv.offset); {32779#true} is VALID [2022-04-08 03:54:22,621 INFO L290 TraceCheckUtils]: 5: Hoare triple {32779#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;havoc ~n~0;havoc ~l~0;havoc ~r~0;havoc ~i~0;havoc ~j~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {32779#true} is VALID [2022-04-08 03:54:22,621 INFO L290 TraceCheckUtils]: 6: Hoare triple {32779#true} assume !!(1 <= ~n~0 && ~n~0 <= 1000000);~l~0 := 1 + (if ~n~0 < 0 && 0 != ~n~0 % 2 then 1 + ~n~0 / 2 else ~n~0 / 2);~r~0 := ~n~0; {32779#true} is VALID [2022-04-08 03:54:22,621 INFO L290 TraceCheckUtils]: 7: Hoare triple {32779#true} assume ~l~0 > 1;#t~post2 := ~l~0;~l~0 := #t~post2 - 1;havoc #t~post2; {32784#(<= 1 main_~l~0)} is VALID [2022-04-08 03:54:22,622 INFO L290 TraceCheckUtils]: 8: Hoare triple {32784#(<= 1 main_~l~0)} assume !!(~r~0 > 1);~i~0 := ~l~0;~j~0 := 2 * ~l~0; {32785#(<= 2 main_~j~0)} is VALID [2022-04-08 03:54:22,622 INFO L290 TraceCheckUtils]: 9: Hoare triple {32785#(<= 2 main_~j~0)} assume !!(~j~0 <= ~r~0); {32785#(<= 2 main_~j~0)} is VALID [2022-04-08 03:54:22,622 INFO L290 TraceCheckUtils]: 10: Hoare triple {32785#(<= 2 main_~j~0)} assume ~j~0 < ~r~0; {32785#(<= 2 main_~j~0)} is VALID [2022-04-08 03:54:22,622 INFO L272 TraceCheckUtils]: 11: Hoare triple {32785#(<= 2 main_~j~0)} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {32779#true} is VALID [2022-04-08 03:54:22,622 INFO L290 TraceCheckUtils]: 12: Hoare triple {32779#true} ~cond := #in~cond; {32779#true} is VALID [2022-04-08 03:54:22,622 INFO L290 TraceCheckUtils]: 13: Hoare triple {32779#true} assume !(0 == ~cond); {32779#true} is VALID [2022-04-08 03:54:22,623 INFO L290 TraceCheckUtils]: 14: Hoare triple {32779#true} assume true; {32779#true} is VALID [2022-04-08 03:54:22,623 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {32779#true} {32785#(<= 2 main_~j~0)} #110#return; {32785#(<= 2 main_~j~0)} is VALID [2022-04-08 03:54:22,623 INFO L272 TraceCheckUtils]: 16: Hoare triple {32785#(<= 2 main_~j~0)} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {32779#true} is VALID [2022-04-08 03:54:22,623 INFO L290 TraceCheckUtils]: 17: Hoare triple {32779#true} ~cond := #in~cond; {32779#true} is VALID [2022-04-08 03:54:22,623 INFO L290 TraceCheckUtils]: 18: Hoare triple {32779#true} assume !(0 == ~cond); {32779#true} is VALID [2022-04-08 03:54:22,623 INFO L290 TraceCheckUtils]: 19: Hoare triple {32779#true} assume true; {32779#true} is VALID [2022-04-08 03:54:22,624 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {32779#true} {32785#(<= 2 main_~j~0)} #112#return; {32785#(<= 2 main_~j~0)} is VALID [2022-04-08 03:54:22,624 INFO L272 TraceCheckUtils]: 21: Hoare triple {32785#(<= 2 main_~j~0)} call __VERIFIER_assert((if 1 <= 1 + ~j~0 then 1 else 0)); {32779#true} is VALID [2022-04-08 03:54:22,624 INFO L290 TraceCheckUtils]: 22: Hoare triple {32779#true} ~cond := #in~cond; {32779#true} is VALID [2022-04-08 03:54:22,624 INFO L290 TraceCheckUtils]: 23: Hoare triple {32779#true} assume !(0 == ~cond); {32779#true} is VALID [2022-04-08 03:54:22,624 INFO L290 TraceCheckUtils]: 24: Hoare triple {32779#true} assume true; {32779#true} is VALID [2022-04-08 03:54:22,624 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {32779#true} {32785#(<= 2 main_~j~0)} #114#return; {32785#(<= 2 main_~j~0)} is VALID [2022-04-08 03:54:22,624 INFO L272 TraceCheckUtils]: 26: Hoare triple {32785#(<= 2 main_~j~0)} call __VERIFIER_assert((if 1 + ~j~0 <= ~n~0 then 1 else 0)); {32779#true} is VALID [2022-04-08 03:54:22,625 INFO L290 TraceCheckUtils]: 27: Hoare triple {32779#true} ~cond := #in~cond; {32779#true} is VALID [2022-04-08 03:54:22,625 INFO L290 TraceCheckUtils]: 28: Hoare triple {32779#true} assume !(0 == ~cond); {32779#true} is VALID [2022-04-08 03:54:22,625 INFO L290 TraceCheckUtils]: 29: Hoare triple {32779#true} assume true; {32779#true} is VALID [2022-04-08 03:54:22,625 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {32779#true} {32785#(<= 2 main_~j~0)} #116#return; {32785#(<= 2 main_~j~0)} is VALID [2022-04-08 03:54:22,625 INFO L290 TraceCheckUtils]: 31: Hoare triple {32785#(<= 2 main_~j~0)} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {32785#(<= 2 main_~j~0)} is VALID [2022-04-08 03:54:22,626 INFO L290 TraceCheckUtils]: 32: Hoare triple {32785#(<= 2 main_~j~0)} assume !(0 != #t~nondet4);havoc #t~nondet4; {32785#(<= 2 main_~j~0)} is VALID [2022-04-08 03:54:22,626 INFO L272 TraceCheckUtils]: 33: Hoare triple {32785#(<= 2 main_~j~0)} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {32779#true} is VALID [2022-04-08 03:54:22,626 INFO L290 TraceCheckUtils]: 34: Hoare triple {32779#true} ~cond := #in~cond; {32779#true} is VALID [2022-04-08 03:54:22,626 INFO L290 TraceCheckUtils]: 35: Hoare triple {32779#true} assume !(0 == ~cond); {32779#true} is VALID [2022-04-08 03:54:22,626 INFO L290 TraceCheckUtils]: 36: Hoare triple {32779#true} assume true; {32779#true} is VALID [2022-04-08 03:54:22,626 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {32779#true} {32785#(<= 2 main_~j~0)} #118#return; {32785#(<= 2 main_~j~0)} is VALID [2022-04-08 03:54:22,626 INFO L272 TraceCheckUtils]: 38: Hoare triple {32785#(<= 2 main_~j~0)} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {32779#true} is VALID [2022-04-08 03:54:22,627 INFO L290 TraceCheckUtils]: 39: Hoare triple {32779#true} ~cond := #in~cond; {32779#true} is VALID [2022-04-08 03:54:22,627 INFO L290 TraceCheckUtils]: 40: Hoare triple {32779#true} assume !(0 == ~cond); {32779#true} is VALID [2022-04-08 03:54:22,627 INFO L290 TraceCheckUtils]: 41: Hoare triple {32779#true} assume true; {32779#true} is VALID [2022-04-08 03:54:22,627 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {32779#true} {32785#(<= 2 main_~j~0)} #120#return; {32785#(<= 2 main_~j~0)} is VALID [2022-04-08 03:54:22,627 INFO L290 TraceCheckUtils]: 43: Hoare triple {32785#(<= 2 main_~j~0)} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {32785#(<= 2 main_~j~0)} is VALID [2022-04-08 03:54:22,628 INFO L290 TraceCheckUtils]: 44: Hoare triple {32785#(<= 2 main_~j~0)} assume !(0 != #t~nondet5);havoc #t~nondet5; {32785#(<= 2 main_~j~0)} is VALID [2022-04-08 03:54:22,628 INFO L272 TraceCheckUtils]: 45: Hoare triple {32785#(<= 2 main_~j~0)} call __VERIFIER_assert((if 1 <= ~i~0 then 1 else 0)); {32779#true} is VALID [2022-04-08 03:54:22,628 INFO L290 TraceCheckUtils]: 46: Hoare triple {32779#true} ~cond := #in~cond; {32779#true} is VALID [2022-04-08 03:54:22,628 INFO L290 TraceCheckUtils]: 47: Hoare triple {32779#true} assume !(0 == ~cond); {32779#true} is VALID [2022-04-08 03:54:22,628 INFO L290 TraceCheckUtils]: 48: Hoare triple {32779#true} assume true; {32779#true} is VALID [2022-04-08 03:54:22,628 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {32779#true} {32785#(<= 2 main_~j~0)} #122#return; {32785#(<= 2 main_~j~0)} is VALID [2022-04-08 03:54:22,629 INFO L272 TraceCheckUtils]: 50: Hoare triple {32785#(<= 2 main_~j~0)} call __VERIFIER_assert((if ~i~0 <= ~n~0 then 1 else 0)); {32779#true} is VALID [2022-04-08 03:54:22,629 INFO L290 TraceCheckUtils]: 51: Hoare triple {32779#true} ~cond := #in~cond; {32779#true} is VALID [2022-04-08 03:54:22,629 INFO L290 TraceCheckUtils]: 52: Hoare triple {32779#true} assume !(0 == ~cond); {32779#true} is VALID [2022-04-08 03:54:22,629 INFO L290 TraceCheckUtils]: 53: Hoare triple {32779#true} assume true; {32779#true} is VALID [2022-04-08 03:54:22,629 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {32779#true} {32785#(<= 2 main_~j~0)} #124#return; {32785#(<= 2 main_~j~0)} is VALID [2022-04-08 03:54:22,629 INFO L272 TraceCheckUtils]: 55: Hoare triple {32785#(<= 2 main_~j~0)} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {32779#true} is VALID [2022-04-08 03:54:22,629 INFO L290 TraceCheckUtils]: 56: Hoare triple {32779#true} ~cond := #in~cond; {32779#true} is VALID [2022-04-08 03:54:22,630 INFO L290 TraceCheckUtils]: 57: Hoare triple {32779#true} assume !(0 == ~cond); {32779#true} is VALID [2022-04-08 03:54:22,630 INFO L290 TraceCheckUtils]: 58: Hoare triple {32779#true} assume true; {32779#true} is VALID [2022-04-08 03:54:22,630 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {32779#true} {32785#(<= 2 main_~j~0)} #126#return; {32785#(<= 2 main_~j~0)} is VALID [2022-04-08 03:54:22,630 INFO L272 TraceCheckUtils]: 60: Hoare triple {32785#(<= 2 main_~j~0)} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {32779#true} is VALID [2022-04-08 03:54:22,630 INFO L290 TraceCheckUtils]: 61: Hoare triple {32779#true} ~cond := #in~cond; {32779#true} is VALID [2022-04-08 03:54:22,630 INFO L290 TraceCheckUtils]: 62: Hoare triple {32779#true} assume !(0 == ~cond); {32779#true} is VALID [2022-04-08 03:54:22,630 INFO L290 TraceCheckUtils]: 63: Hoare triple {32779#true} assume true; {32779#true} is VALID [2022-04-08 03:54:22,631 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {32779#true} {32785#(<= 2 main_~j~0)} #128#return; {32785#(<= 2 main_~j~0)} is VALID [2022-04-08 03:54:22,631 INFO L290 TraceCheckUtils]: 65: Hoare triple {32785#(<= 2 main_~j~0)} ~i~0 := ~j~0;~j~0 := 2 * ~j~0; {32826#(<= 2 main_~i~0)} is VALID [2022-04-08 03:54:22,631 INFO L290 TraceCheckUtils]: 66: Hoare triple {32826#(<= 2 main_~i~0)} assume !!(~j~0 <= ~r~0); {32826#(<= 2 main_~i~0)} is VALID [2022-04-08 03:54:22,632 INFO L290 TraceCheckUtils]: 67: Hoare triple {32826#(<= 2 main_~i~0)} assume !(~j~0 < ~r~0); {32826#(<= 2 main_~i~0)} is VALID [2022-04-08 03:54:22,632 INFO L272 TraceCheckUtils]: 68: Hoare triple {32826#(<= 2 main_~i~0)} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {32779#true} is VALID [2022-04-08 03:54:22,632 INFO L290 TraceCheckUtils]: 69: Hoare triple {32779#true} ~cond := #in~cond; {32779#true} is VALID [2022-04-08 03:54:22,632 INFO L290 TraceCheckUtils]: 70: Hoare triple {32779#true} assume !(0 == ~cond); {32779#true} is VALID [2022-04-08 03:54:22,632 INFO L290 TraceCheckUtils]: 71: Hoare triple {32779#true} assume true; {32779#true} is VALID [2022-04-08 03:54:22,632 INFO L284 TraceCheckUtils]: 72: Hoare quadruple {32779#true} {32826#(<= 2 main_~i~0)} #118#return; {32826#(<= 2 main_~i~0)} is VALID [2022-04-08 03:54:22,632 INFO L272 TraceCheckUtils]: 73: Hoare triple {32826#(<= 2 main_~i~0)} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {32779#true} is VALID [2022-04-08 03:54:22,632 INFO L290 TraceCheckUtils]: 74: Hoare triple {32779#true} ~cond := #in~cond; {32779#true} is VALID [2022-04-08 03:54:22,633 INFO L290 TraceCheckUtils]: 75: Hoare triple {32779#true} assume !(0 == ~cond); {32779#true} is VALID [2022-04-08 03:54:22,633 INFO L290 TraceCheckUtils]: 76: Hoare triple {32779#true} assume true; {32779#true} is VALID [2022-04-08 03:54:22,633 INFO L284 TraceCheckUtils]: 77: Hoare quadruple {32779#true} {32826#(<= 2 main_~i~0)} #120#return; {32826#(<= 2 main_~i~0)} is VALID [2022-04-08 03:54:22,633 INFO L290 TraceCheckUtils]: 78: Hoare triple {32826#(<= 2 main_~i~0)} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {32826#(<= 2 main_~i~0)} is VALID [2022-04-08 03:54:22,634 INFO L290 TraceCheckUtils]: 79: Hoare triple {32826#(<= 2 main_~i~0)} assume !(0 != #t~nondet5);havoc #t~nondet5; {32826#(<= 2 main_~i~0)} is VALID [2022-04-08 03:54:22,634 INFO L272 TraceCheckUtils]: 80: Hoare triple {32826#(<= 2 main_~i~0)} call __VERIFIER_assert((if 1 <= ~i~0 then 1 else 0)); {32835#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 03:54:22,634 INFO L290 TraceCheckUtils]: 81: Hoare triple {32835#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {32836#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 03:54:22,635 INFO L290 TraceCheckUtils]: 82: Hoare triple {32836#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {32780#false} is VALID [2022-04-08 03:54:22,635 INFO L290 TraceCheckUtils]: 83: Hoare triple {32780#false} assume !false; {32780#false} is VALID [2022-04-08 03:54:22,635 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 24 proven. 7 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2022-04-08 03:54:22,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 03:54:22,635 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [122534717] [2022-04-08 03:54:22,635 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [122534717] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 03:54:22,635 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [889051648] [2022-04-08 03:54:22,636 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 03:54:22,636 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 03:54:22,636 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 03:54:22,637 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 03:54:22,638 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 03:54:22,688 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 03:54:22,688 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 03:54:22,689 INFO L263 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-08 03:54:22,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:54:22,706 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 03:54:26,920 INFO L272 TraceCheckUtils]: 0: Hoare triple {32779#true} call ULTIMATE.init(); {32779#true} is VALID [2022-04-08 03:54:26,920 INFO L290 TraceCheckUtils]: 1: Hoare triple {32779#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(9, 2); {32779#true} is VALID [2022-04-08 03:54:26,920 INFO L290 TraceCheckUtils]: 2: Hoare triple {32779#true} assume true; {32779#true} is VALID [2022-04-08 03:54:26,920 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32779#true} {32779#true} #138#return; {32779#true} is VALID [2022-04-08 03:54:26,921 INFO L272 TraceCheckUtils]: 4: Hoare triple {32779#true} call #t~ret8 := main(#in~argc, #in~argv.base, #in~argv.offset); {32779#true} is VALID [2022-04-08 03:54:26,921 INFO L290 TraceCheckUtils]: 5: Hoare triple {32779#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;havoc ~n~0;havoc ~l~0;havoc ~r~0;havoc ~i~0;havoc ~j~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {32779#true} is VALID [2022-04-08 03:54:26,921 INFO L290 TraceCheckUtils]: 6: Hoare triple {32779#true} assume !!(1 <= ~n~0 && ~n~0 <= 1000000);~l~0 := 1 + (if ~n~0 < 0 && 0 != ~n~0 % 2 then 1 + ~n~0 / 2 else ~n~0 / 2);~r~0 := ~n~0; {32859#(and (< 0 main_~l~0) (< (div (+ (* (- 1) main_~r~0) 1) (- 2)) main_~l~0))} is VALID [2022-04-08 03:54:26,922 INFO L290 TraceCheckUtils]: 7: Hoare triple {32859#(and (< 0 main_~l~0) (< (div (+ (* (- 1) main_~r~0) 1) (- 2)) main_~l~0))} assume ~l~0 > 1;#t~post2 := ~l~0;~l~0 := #t~post2 - 1;havoc #t~post2; {32863#(and (< 0 main_~l~0) (< (div (+ (* (- 1) main_~r~0) 1) (- 2)) (+ main_~l~0 1)))} is VALID [2022-04-08 03:54:26,923 INFO L290 TraceCheckUtils]: 8: Hoare triple {32863#(and (< 0 main_~l~0) (< (div (+ (* (- 1) main_~r~0) 1) (- 2)) (+ main_~l~0 1)))} assume !!(~r~0 > 1);~i~0 := ~l~0;~j~0 := 2 * ~l~0; {32867#(and (< (div (+ (* (- 1) main_~r~0) 1) (- 2)) (+ (div main_~j~0 2) 1)) (< 0 (div main_~j~0 2)))} is VALID [2022-04-08 03:54:26,923 INFO L290 TraceCheckUtils]: 9: Hoare triple {32867#(and (< (div (+ (* (- 1) main_~r~0) 1) (- 2)) (+ (div main_~j~0 2) 1)) (< 0 (div main_~j~0 2)))} assume !!(~j~0 <= ~r~0); {32867#(and (< (div (+ (* (- 1) main_~r~0) 1) (- 2)) (+ (div main_~j~0 2) 1)) (< 0 (div main_~j~0 2)))} is VALID [2022-04-08 03:54:26,923 INFO L290 TraceCheckUtils]: 10: Hoare triple {32867#(and (< (div (+ (* (- 1) main_~r~0) 1) (- 2)) (+ (div main_~j~0 2) 1)) (< 0 (div main_~j~0 2)))} assume ~j~0 < ~r~0; {32867#(and (< (div (+ (* (- 1) main_~r~0) 1) (- 2)) (+ (div main_~j~0 2) 1)) (< 0 (div main_~j~0 2)))} is VALID [2022-04-08 03:54:26,923 INFO L272 TraceCheckUtils]: 11: Hoare triple {32867#(and (< (div (+ (* (- 1) main_~r~0) 1) (- 2)) (+ (div main_~j~0 2) 1)) (< 0 (div main_~j~0 2)))} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {32779#true} is VALID [2022-04-08 03:54:26,924 INFO L290 TraceCheckUtils]: 12: Hoare triple {32779#true} ~cond := #in~cond; {32779#true} is VALID [2022-04-08 03:54:26,924 INFO L290 TraceCheckUtils]: 13: Hoare triple {32779#true} assume !(0 == ~cond); {32779#true} is VALID [2022-04-08 03:54:26,924 INFO L290 TraceCheckUtils]: 14: Hoare triple {32779#true} assume true; {32779#true} is VALID [2022-04-08 03:54:26,924 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {32779#true} {32867#(and (< (div (+ (* (- 1) main_~r~0) 1) (- 2)) (+ (div main_~j~0 2) 1)) (< 0 (div main_~j~0 2)))} #110#return; {32867#(and (< (div (+ (* (- 1) main_~r~0) 1) (- 2)) (+ (div main_~j~0 2) 1)) (< 0 (div main_~j~0 2)))} is VALID [2022-04-08 03:54:26,924 INFO L272 TraceCheckUtils]: 16: Hoare triple {32867#(and (< (div (+ (* (- 1) main_~r~0) 1) (- 2)) (+ (div main_~j~0 2) 1)) (< 0 (div main_~j~0 2)))} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {32779#true} is VALID [2022-04-08 03:54:26,924 INFO L290 TraceCheckUtils]: 17: Hoare triple {32779#true} ~cond := #in~cond; {32779#true} is VALID [2022-04-08 03:54:26,924 INFO L290 TraceCheckUtils]: 18: Hoare triple {32779#true} assume !(0 == ~cond); {32779#true} is VALID [2022-04-08 03:54:26,925 INFO L290 TraceCheckUtils]: 19: Hoare triple {32779#true} assume true; {32779#true} is VALID [2022-04-08 03:54:26,925 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {32779#true} {32867#(and (< (div (+ (* (- 1) main_~r~0) 1) (- 2)) (+ (div main_~j~0 2) 1)) (< 0 (div main_~j~0 2)))} #112#return; {32867#(and (< (div (+ (* (- 1) main_~r~0) 1) (- 2)) (+ (div main_~j~0 2) 1)) (< 0 (div main_~j~0 2)))} is VALID [2022-04-08 03:54:26,925 INFO L272 TraceCheckUtils]: 21: Hoare triple {32867#(and (< (div (+ (* (- 1) main_~r~0) 1) (- 2)) (+ (div main_~j~0 2) 1)) (< 0 (div main_~j~0 2)))} call __VERIFIER_assert((if 1 <= 1 + ~j~0 then 1 else 0)); {32779#true} is VALID [2022-04-08 03:54:26,925 INFO L290 TraceCheckUtils]: 22: Hoare triple {32779#true} ~cond := #in~cond; {32779#true} is VALID [2022-04-08 03:54:26,925 INFO L290 TraceCheckUtils]: 23: Hoare triple {32779#true} assume !(0 == ~cond); {32779#true} is VALID [2022-04-08 03:54:26,925 INFO L290 TraceCheckUtils]: 24: Hoare triple {32779#true} assume true; {32779#true} is VALID [2022-04-08 03:54:26,926 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {32779#true} {32867#(and (< (div (+ (* (- 1) main_~r~0) 1) (- 2)) (+ (div main_~j~0 2) 1)) (< 0 (div main_~j~0 2)))} #114#return; {32867#(and (< (div (+ (* (- 1) main_~r~0) 1) (- 2)) (+ (div main_~j~0 2) 1)) (< 0 (div main_~j~0 2)))} is VALID [2022-04-08 03:54:26,926 INFO L272 TraceCheckUtils]: 26: Hoare triple {32867#(and (< (div (+ (* (- 1) main_~r~0) 1) (- 2)) (+ (div main_~j~0 2) 1)) (< 0 (div main_~j~0 2)))} call __VERIFIER_assert((if 1 + ~j~0 <= ~n~0 then 1 else 0)); {32779#true} is VALID [2022-04-08 03:54:26,926 INFO L290 TraceCheckUtils]: 27: Hoare triple {32779#true} ~cond := #in~cond; {32779#true} is VALID [2022-04-08 03:54:26,926 INFO L290 TraceCheckUtils]: 28: Hoare triple {32779#true} assume !(0 == ~cond); {32779#true} is VALID [2022-04-08 03:54:26,926 INFO L290 TraceCheckUtils]: 29: Hoare triple {32779#true} assume true; {32779#true} is VALID [2022-04-08 03:54:26,926 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {32779#true} {32867#(and (< (div (+ (* (- 1) main_~r~0) 1) (- 2)) (+ (div main_~j~0 2) 1)) (< 0 (div main_~j~0 2)))} #116#return; {32867#(and (< (div (+ (* (- 1) main_~r~0) 1) (- 2)) (+ (div main_~j~0 2) 1)) (< 0 (div main_~j~0 2)))} is VALID [2022-04-08 03:54:26,927 INFO L290 TraceCheckUtils]: 31: Hoare triple {32867#(and (< (div (+ (* (- 1) main_~r~0) 1) (- 2)) (+ (div main_~j~0 2) 1)) (< 0 (div main_~j~0 2)))} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {32867#(and (< (div (+ (* (- 1) main_~r~0) 1) (- 2)) (+ (div main_~j~0 2) 1)) (< 0 (div main_~j~0 2)))} is VALID [2022-04-08 03:54:26,927 INFO L290 TraceCheckUtils]: 32: Hoare triple {32867#(and (< (div (+ (* (- 1) main_~r~0) 1) (- 2)) (+ (div main_~j~0 2) 1)) (< 0 (div main_~j~0 2)))} assume !(0 != #t~nondet4);havoc #t~nondet4; {32867#(and (< (div (+ (* (- 1) main_~r~0) 1) (- 2)) (+ (div main_~j~0 2) 1)) (< 0 (div main_~j~0 2)))} is VALID [2022-04-08 03:54:26,927 INFO L272 TraceCheckUtils]: 33: Hoare triple {32867#(and (< (div (+ (* (- 1) main_~r~0) 1) (- 2)) (+ (div main_~j~0 2) 1)) (< 0 (div main_~j~0 2)))} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {32779#true} is VALID [2022-04-08 03:54:26,927 INFO L290 TraceCheckUtils]: 34: Hoare triple {32779#true} ~cond := #in~cond; {32779#true} is VALID [2022-04-08 03:54:26,928 INFO L290 TraceCheckUtils]: 35: Hoare triple {32779#true} assume !(0 == ~cond); {32779#true} is VALID [2022-04-08 03:54:26,928 INFO L290 TraceCheckUtils]: 36: Hoare triple {32779#true} assume true; {32779#true} is VALID [2022-04-08 03:54:26,928 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {32779#true} {32867#(and (< (div (+ (* (- 1) main_~r~0) 1) (- 2)) (+ (div main_~j~0 2) 1)) (< 0 (div main_~j~0 2)))} #118#return; {32867#(and (< (div (+ (* (- 1) main_~r~0) 1) (- 2)) (+ (div main_~j~0 2) 1)) (< 0 (div main_~j~0 2)))} is VALID [2022-04-08 03:54:26,928 INFO L272 TraceCheckUtils]: 38: Hoare triple {32867#(and (< (div (+ (* (- 1) main_~r~0) 1) (- 2)) (+ (div main_~j~0 2) 1)) (< 0 (div main_~j~0 2)))} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {32779#true} is VALID [2022-04-08 03:54:26,928 INFO L290 TraceCheckUtils]: 39: Hoare triple {32779#true} ~cond := #in~cond; {32779#true} is VALID [2022-04-08 03:54:26,928 INFO L290 TraceCheckUtils]: 40: Hoare triple {32779#true} assume !(0 == ~cond); {32779#true} is VALID [2022-04-08 03:54:26,928 INFO L290 TraceCheckUtils]: 41: Hoare triple {32779#true} assume true; {32779#true} is VALID [2022-04-08 03:54:26,929 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {32779#true} {32867#(and (< (div (+ (* (- 1) main_~r~0) 1) (- 2)) (+ (div main_~j~0 2) 1)) (< 0 (div main_~j~0 2)))} #120#return; {32867#(and (< (div (+ (* (- 1) main_~r~0) 1) (- 2)) (+ (div main_~j~0 2) 1)) (< 0 (div main_~j~0 2)))} is VALID [2022-04-08 03:54:26,929 INFO L290 TraceCheckUtils]: 43: Hoare triple {32867#(and (< (div (+ (* (- 1) main_~r~0) 1) (- 2)) (+ (div main_~j~0 2) 1)) (< 0 (div main_~j~0 2)))} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {32867#(and (< (div (+ (* (- 1) main_~r~0) 1) (- 2)) (+ (div main_~j~0 2) 1)) (< 0 (div main_~j~0 2)))} is VALID [2022-04-08 03:54:26,929 INFO L290 TraceCheckUtils]: 44: Hoare triple {32867#(and (< (div (+ (* (- 1) main_~r~0) 1) (- 2)) (+ (div main_~j~0 2) 1)) (< 0 (div main_~j~0 2)))} assume !(0 != #t~nondet5);havoc #t~nondet5; {32867#(and (< (div (+ (* (- 1) main_~r~0) 1) (- 2)) (+ (div main_~j~0 2) 1)) (< 0 (div main_~j~0 2)))} is VALID [2022-04-08 03:54:26,930 INFO L272 TraceCheckUtils]: 45: Hoare triple {32867#(and (< (div (+ (* (- 1) main_~r~0) 1) (- 2)) (+ (div main_~j~0 2) 1)) (< 0 (div main_~j~0 2)))} call __VERIFIER_assert((if 1 <= ~i~0 then 1 else 0)); {32779#true} is VALID [2022-04-08 03:54:26,930 INFO L290 TraceCheckUtils]: 46: Hoare triple {32779#true} ~cond := #in~cond; {32779#true} is VALID [2022-04-08 03:54:26,930 INFO L290 TraceCheckUtils]: 47: Hoare triple {32779#true} assume !(0 == ~cond); {32779#true} is VALID [2022-04-08 03:54:26,930 INFO L290 TraceCheckUtils]: 48: Hoare triple {32779#true} assume true; {32779#true} is VALID [2022-04-08 03:54:26,930 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {32779#true} {32867#(and (< (div (+ (* (- 1) main_~r~0) 1) (- 2)) (+ (div main_~j~0 2) 1)) (< 0 (div main_~j~0 2)))} #122#return; {32867#(and (< (div (+ (* (- 1) main_~r~0) 1) (- 2)) (+ (div main_~j~0 2) 1)) (< 0 (div main_~j~0 2)))} is VALID [2022-04-08 03:54:26,930 INFO L272 TraceCheckUtils]: 50: Hoare triple {32867#(and (< (div (+ (* (- 1) main_~r~0) 1) (- 2)) (+ (div main_~j~0 2) 1)) (< 0 (div main_~j~0 2)))} call __VERIFIER_assert((if ~i~0 <= ~n~0 then 1 else 0)); {32779#true} is VALID [2022-04-08 03:54:26,930 INFO L290 TraceCheckUtils]: 51: Hoare triple {32779#true} ~cond := #in~cond; {32779#true} is VALID [2022-04-08 03:54:26,931 INFO L290 TraceCheckUtils]: 52: Hoare triple {32779#true} assume !(0 == ~cond); {32779#true} is VALID [2022-04-08 03:54:26,931 INFO L290 TraceCheckUtils]: 53: Hoare triple {32779#true} assume true; {32779#true} is VALID [2022-04-08 03:54:26,931 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {32779#true} {32867#(and (< (div (+ (* (- 1) main_~r~0) 1) (- 2)) (+ (div main_~j~0 2) 1)) (< 0 (div main_~j~0 2)))} #124#return; {32867#(and (< (div (+ (* (- 1) main_~r~0) 1) (- 2)) (+ (div main_~j~0 2) 1)) (< 0 (div main_~j~0 2)))} is VALID [2022-04-08 03:54:26,931 INFO L272 TraceCheckUtils]: 55: Hoare triple {32867#(and (< (div (+ (* (- 1) main_~r~0) 1) (- 2)) (+ (div main_~j~0 2) 1)) (< 0 (div main_~j~0 2)))} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {32779#true} is VALID [2022-04-08 03:54:26,931 INFO L290 TraceCheckUtils]: 56: Hoare triple {32779#true} ~cond := #in~cond; {32779#true} is VALID [2022-04-08 03:54:26,931 INFO L290 TraceCheckUtils]: 57: Hoare triple {32779#true} assume !(0 == ~cond); {32779#true} is VALID [2022-04-08 03:54:26,931 INFO L290 TraceCheckUtils]: 58: Hoare triple {32779#true} assume true; {32779#true} is VALID [2022-04-08 03:54:26,932 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {32779#true} {32867#(and (< (div (+ (* (- 1) main_~r~0) 1) (- 2)) (+ (div main_~j~0 2) 1)) (< 0 (div main_~j~0 2)))} #126#return; {32867#(and (< (div (+ (* (- 1) main_~r~0) 1) (- 2)) (+ (div main_~j~0 2) 1)) (< 0 (div main_~j~0 2)))} is VALID [2022-04-08 03:54:26,932 INFO L272 TraceCheckUtils]: 60: Hoare triple {32867#(and (< (div (+ (* (- 1) main_~r~0) 1) (- 2)) (+ (div main_~j~0 2) 1)) (< 0 (div main_~j~0 2)))} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {32779#true} is VALID [2022-04-08 03:54:26,932 INFO L290 TraceCheckUtils]: 61: Hoare triple {32779#true} ~cond := #in~cond; {32779#true} is VALID [2022-04-08 03:54:26,932 INFO L290 TraceCheckUtils]: 62: Hoare triple {32779#true} assume !(0 == ~cond); {32779#true} is VALID [2022-04-08 03:54:26,932 INFO L290 TraceCheckUtils]: 63: Hoare triple {32779#true} assume true; {32779#true} is VALID [2022-04-08 03:54:26,933 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {32779#true} {32867#(and (< (div (+ (* (- 1) main_~r~0) 1) (- 2)) (+ (div main_~j~0 2) 1)) (< 0 (div main_~j~0 2)))} #128#return; {32867#(and (< (div (+ (* (- 1) main_~r~0) 1) (- 2)) (+ (div main_~j~0 2) 1)) (< 0 (div main_~j~0 2)))} is VALID [2022-04-08 03:54:26,933 INFO L290 TraceCheckUtils]: 65: Hoare triple {32867#(and (< (div (+ (* (- 1) main_~r~0) 1) (- 2)) (+ (div main_~j~0 2) 1)) (< 0 (div main_~j~0 2)))} ~i~0 := ~j~0;~j~0 := 2 * ~j~0; {33039#(and (< 0 (div (div main_~j~0 2) 2)) (< (div (+ (* (- 1) main_~r~0) 1) (- 2)) (+ (div (div main_~j~0 2) 2) 1)))} is VALID [2022-04-08 03:54:26,934 INFO L290 TraceCheckUtils]: 66: Hoare triple {33039#(and (< 0 (div (div main_~j~0 2) 2)) (< (div (+ (* (- 1) main_~r~0) 1) (- 2)) (+ (div (div main_~j~0 2) 2) 1)))} assume !!(~j~0 <= ~r~0); {32780#false} is VALID [2022-04-08 03:54:26,934 INFO L290 TraceCheckUtils]: 67: Hoare triple {32780#false} assume !(~j~0 < ~r~0); {32780#false} is VALID [2022-04-08 03:54:26,934 INFO L272 TraceCheckUtils]: 68: Hoare triple {32780#false} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {32780#false} is VALID [2022-04-08 03:54:26,934 INFO L290 TraceCheckUtils]: 69: Hoare triple {32780#false} ~cond := #in~cond; {32780#false} is VALID [2022-04-08 03:54:26,934 INFO L290 TraceCheckUtils]: 70: Hoare triple {32780#false} assume !(0 == ~cond); {32780#false} is VALID [2022-04-08 03:54:26,934 INFO L290 TraceCheckUtils]: 71: Hoare triple {32780#false} assume true; {32780#false} is VALID [2022-04-08 03:54:26,934 INFO L284 TraceCheckUtils]: 72: Hoare quadruple {32780#false} {32780#false} #118#return; {32780#false} is VALID [2022-04-08 03:54:26,935 INFO L272 TraceCheckUtils]: 73: Hoare triple {32780#false} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {32780#false} is VALID [2022-04-08 03:54:26,935 INFO L290 TraceCheckUtils]: 74: Hoare triple {32780#false} ~cond := #in~cond; {32780#false} is VALID [2022-04-08 03:54:26,935 INFO L290 TraceCheckUtils]: 75: Hoare triple {32780#false} assume !(0 == ~cond); {32780#false} is VALID [2022-04-08 03:54:26,935 INFO L290 TraceCheckUtils]: 76: Hoare triple {32780#false} assume true; {32780#false} is VALID [2022-04-08 03:54:26,935 INFO L284 TraceCheckUtils]: 77: Hoare quadruple {32780#false} {32780#false} #120#return; {32780#false} is VALID [2022-04-08 03:54:26,935 INFO L290 TraceCheckUtils]: 78: Hoare triple {32780#false} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {32780#false} is VALID [2022-04-08 03:54:26,935 INFO L290 TraceCheckUtils]: 79: Hoare triple {32780#false} assume !(0 != #t~nondet5);havoc #t~nondet5; {32780#false} is VALID [2022-04-08 03:54:26,935 INFO L272 TraceCheckUtils]: 80: Hoare triple {32780#false} call __VERIFIER_assert((if 1 <= ~i~0 then 1 else 0)); {32780#false} is VALID [2022-04-08 03:54:26,935 INFO L290 TraceCheckUtils]: 81: Hoare triple {32780#false} ~cond := #in~cond; {32780#false} is VALID [2022-04-08 03:54:26,935 INFO L290 TraceCheckUtils]: 82: Hoare triple {32780#false} assume 0 == ~cond; {32780#false} is VALID [2022-04-08 03:54:26,936 INFO L290 TraceCheckUtils]: 83: Hoare triple {32780#false} assume !false; {32780#false} is VALID [2022-04-08 03:54:26,936 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 107 proven. 0 refuted. 0 times theorem prover too weak. 188 trivial. 0 not checked. [2022-04-08 03:54:26,936 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-08 03:54:26,936 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [889051648] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 03:54:26,936 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-08 03:54:26,936 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 12 [2022-04-08 03:54:26,937 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 03:54:26,937 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1797077529] [2022-04-08 03:54:26,937 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1797077529] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 03:54:26,937 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 03:54:26,937 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 03:54:26,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [328133019] [2022-04-08 03:54:26,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 03:54:26,938 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 3 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) Word has length 84 [2022-04-08 03:54:26,939 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 03:54:26,940 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 3 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2022-04-08 03:54:26,983 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:54:26,983 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-08 03:54:26,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 03:54:26,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-08 03:54:26,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2022-04-08 03:54:26,984 INFO L87 Difference]: Start difference. First operand 295 states and 454 transitions. Second operand has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 3 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2022-04-08 03:54:28,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:54:28,965 INFO L93 Difference]: Finished difference Result 549 states and 838 transitions. [2022-04-08 03:54:28,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-08 03:54:28,966 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 3 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) Word has length 84 [2022-04-08 03:54:28,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 03:54:28,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 3 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2022-04-08 03:54:28,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 168 transitions. [2022-04-08 03:54:28,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 3 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2022-04-08 03:54:28,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 168 transitions. [2022-04-08 03:54:28,969 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 168 transitions. [2022-04-08 03:54:29,047 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 168 edges. 168 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:54:29,052 INFO L225 Difference]: With dead ends: 549 [2022-04-08 03:54:29,052 INFO L226 Difference]: Without dead ends: 249 [2022-04-08 03:54:29,053 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2022-04-08 03:54:29,053 INFO L913 BasicCegarLoop]: 67 mSDtfsCounter, 20 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-08 03:54:29,053 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [20 Valid, 170 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-08 03:54:29,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2022-04-08 03:54:30,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 238. [2022-04-08 03:54:30,272 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 03:54:30,273 INFO L82 GeneralOperation]: Start isEquivalent. First operand 249 states. Second operand has 238 states, 117 states have (on average 1.2564102564102564) internal successors, (147), 127 states have internal predecessors, (147), 104 states have call successors, (104), 17 states have call predecessors, (104), 16 states have return successors, (103), 93 states have call predecessors, (103), 103 states have call successors, (103) [2022-04-08 03:54:30,273 INFO L74 IsIncluded]: Start isIncluded. First operand 249 states. Second operand has 238 states, 117 states have (on average 1.2564102564102564) internal successors, (147), 127 states have internal predecessors, (147), 104 states have call successors, (104), 17 states have call predecessors, (104), 16 states have return successors, (103), 93 states have call predecessors, (103), 103 states have call successors, (103) [2022-04-08 03:54:30,273 INFO L87 Difference]: Start difference. First operand 249 states. Second operand has 238 states, 117 states have (on average 1.2564102564102564) internal successors, (147), 127 states have internal predecessors, (147), 104 states have call successors, (104), 17 states have call predecessors, (104), 16 states have return successors, (103), 93 states have call predecessors, (103), 103 states have call successors, (103) [2022-04-08 03:54:30,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:54:30,278 INFO L93 Difference]: Finished difference Result 249 states and 369 transitions. [2022-04-08 03:54:30,278 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 369 transitions. [2022-04-08 03:54:30,278 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:54:30,279 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:54:30,279 INFO L74 IsIncluded]: Start isIncluded. First operand has 238 states, 117 states have (on average 1.2564102564102564) internal successors, (147), 127 states have internal predecessors, (147), 104 states have call successors, (104), 17 states have call predecessors, (104), 16 states have return successors, (103), 93 states have call predecessors, (103), 103 states have call successors, (103) Second operand 249 states. [2022-04-08 03:54:30,279 INFO L87 Difference]: Start difference. First operand has 238 states, 117 states have (on average 1.2564102564102564) internal successors, (147), 127 states have internal predecessors, (147), 104 states have call successors, (104), 17 states have call predecessors, (104), 16 states have return successors, (103), 93 states have call predecessors, (103), 103 states have call successors, (103) Second operand 249 states. [2022-04-08 03:54:30,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:54:30,283 INFO L93 Difference]: Finished difference Result 249 states and 369 transitions. [2022-04-08 03:54:30,283 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 369 transitions. [2022-04-08 03:54:30,284 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:54:30,284 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:54:30,284 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 03:54:30,284 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 03:54:30,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 238 states, 117 states have (on average 1.2564102564102564) internal successors, (147), 127 states have internal predecessors, (147), 104 states have call successors, (104), 17 states have call predecessors, (104), 16 states have return successors, (103), 93 states have call predecessors, (103), 103 states have call successors, (103) [2022-04-08 03:54:30,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 354 transitions. [2022-04-08 03:54:30,289 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 354 transitions. Word has length 84 [2022-04-08 03:54:30,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 03:54:30,289 INFO L478 AbstractCegarLoop]: Abstraction has 238 states and 354 transitions. [2022-04-08 03:54:30,289 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 3 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2022-04-08 03:54:30,289 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 238 states and 354 transitions. [2022-04-08 03:54:30,779 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 354 edges. 354 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:54:30,779 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 354 transitions. [2022-04-08 03:54:30,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2022-04-08 03:54:30,780 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 03:54:30,780 INFO L499 BasicCegarLoop]: trace histogram [17, 16, 16, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 03:54:30,797 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 03:54:30,980 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 03:54:30,981 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 03:54:30,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 03:54:30,981 INFO L85 PathProgramCache]: Analyzing trace with hash -560912485, now seen corresponding path program 1 times [2022-04-08 03:54:30,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 03:54:30,981 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1523650620] [2022-04-08 03:54:30,981 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 03:54:30,982 INFO L85 PathProgramCache]: Analyzing trace with hash -560912485, now seen corresponding path program 2 times [2022-04-08 03:54:30,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 03:54:30,982 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1152704447] [2022-04-08 03:54:30,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 03:54:30,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 03:54:31,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:54:31,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 03:54:31,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:54:31,067 INFO L290 TraceCheckUtils]: 0: Hoare triple {35245#(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(9, 2); {35169#true} is VALID [2022-04-08 03:54:31,067 INFO L290 TraceCheckUtils]: 1: Hoare triple {35169#true} assume true; {35169#true} is VALID [2022-04-08 03:54:31,067 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {35169#true} {35169#true} #138#return; {35169#true} is VALID [2022-04-08 03:54:31,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-08 03:54:31,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:54:31,069 INFO L290 TraceCheckUtils]: 0: Hoare triple {35169#true} ~cond := #in~cond; {35169#true} is VALID [2022-04-08 03:54:31,069 INFO L290 TraceCheckUtils]: 1: Hoare triple {35169#true} assume !(0 == ~cond); {35169#true} is VALID [2022-04-08 03:54:31,069 INFO L290 TraceCheckUtils]: 2: Hoare triple {35169#true} assume true; {35169#true} is VALID [2022-04-08 03:54:31,069 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35169#true} {35169#true} #118#return; {35169#true} is VALID [2022-04-08 03:54:31,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-04-08 03:54:31,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:54:31,071 INFO L290 TraceCheckUtils]: 0: Hoare triple {35169#true} ~cond := #in~cond; {35169#true} is VALID [2022-04-08 03:54:31,071 INFO L290 TraceCheckUtils]: 1: Hoare triple {35169#true} assume !(0 == ~cond); {35169#true} is VALID [2022-04-08 03:54:31,071 INFO L290 TraceCheckUtils]: 2: Hoare triple {35169#true} assume true; {35169#true} is VALID [2022-04-08 03:54:31,071 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35169#true} {35169#true} #120#return; {35169#true} is VALID [2022-04-08 03:54:31,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-04-08 03:54:31,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:54:31,073 INFO L290 TraceCheckUtils]: 0: Hoare triple {35169#true} ~cond := #in~cond; {35169#true} is VALID [2022-04-08 03:54:31,073 INFO L290 TraceCheckUtils]: 1: Hoare triple {35169#true} assume !(0 == ~cond); {35169#true} is VALID [2022-04-08 03:54:31,074 INFO L290 TraceCheckUtils]: 2: Hoare triple {35169#true} assume true; {35169#true} is VALID [2022-04-08 03:54:31,074 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35169#true} {35182#(<= 2 main_~l~0)} #130#return; {35182#(<= 2 main_~l~0)} is VALID [2022-04-08 03:54:31,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-04-08 03:54:31,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:54:31,077 INFO L290 TraceCheckUtils]: 0: Hoare triple {35169#true} ~cond := #in~cond; {35169#true} is VALID [2022-04-08 03:54:31,077 INFO L290 TraceCheckUtils]: 1: Hoare triple {35169#true} assume !(0 == ~cond); {35169#true} is VALID [2022-04-08 03:54:31,077 INFO L290 TraceCheckUtils]: 2: Hoare triple {35169#true} assume true; {35169#true} is VALID [2022-04-08 03:54:31,078 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35169#true} {35182#(<= 2 main_~l~0)} #132#return; {35182#(<= 2 main_~l~0)} is VALID [2022-04-08 03:54:31,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-04-08 03:54:31,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:54:31,080 INFO L290 TraceCheckUtils]: 0: Hoare triple {35169#true} ~cond := #in~cond; {35169#true} is VALID [2022-04-08 03:54:31,080 INFO L290 TraceCheckUtils]: 1: Hoare triple {35169#true} assume !(0 == ~cond); {35169#true} is VALID [2022-04-08 03:54:31,080 INFO L290 TraceCheckUtils]: 2: Hoare triple {35169#true} assume true; {35169#true} is VALID [2022-04-08 03:54:31,080 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35169#true} {35192#(<= 2 main_~j~0)} #110#return; {35192#(<= 2 main_~j~0)} is VALID [2022-04-08 03:54:31,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-04-08 03:54:31,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:54:31,083 INFO L290 TraceCheckUtils]: 0: Hoare triple {35169#true} ~cond := #in~cond; {35169#true} is VALID [2022-04-08 03:54:31,083 INFO L290 TraceCheckUtils]: 1: Hoare triple {35169#true} assume !(0 == ~cond); {35169#true} is VALID [2022-04-08 03:54:31,083 INFO L290 TraceCheckUtils]: 2: Hoare triple {35169#true} assume true; {35169#true} is VALID [2022-04-08 03:54:31,084 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35169#true} {35192#(<= 2 main_~j~0)} #112#return; {35192#(<= 2 main_~j~0)} is VALID [2022-04-08 03:54:31,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-04-08 03:54:31,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:54:31,086 INFO L290 TraceCheckUtils]: 0: Hoare triple {35169#true} ~cond := #in~cond; {35169#true} is VALID [2022-04-08 03:54:31,086 INFO L290 TraceCheckUtils]: 1: Hoare triple {35169#true} assume !(0 == ~cond); {35169#true} is VALID [2022-04-08 03:54:31,087 INFO L290 TraceCheckUtils]: 2: Hoare triple {35169#true} assume true; {35169#true} is VALID [2022-04-08 03:54:31,087 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35169#true} {35192#(<= 2 main_~j~0)} #114#return; {35192#(<= 2 main_~j~0)} is VALID [2022-04-08 03:54:31,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-04-08 03:54:31,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:54:31,089 INFO L290 TraceCheckUtils]: 0: Hoare triple {35169#true} ~cond := #in~cond; {35169#true} is VALID [2022-04-08 03:54:31,089 INFO L290 TraceCheckUtils]: 1: Hoare triple {35169#true} assume !(0 == ~cond); {35169#true} is VALID [2022-04-08 03:54:31,089 INFO L290 TraceCheckUtils]: 2: Hoare triple {35169#true} assume true; {35169#true} is VALID [2022-04-08 03:54:31,089 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35169#true} {35192#(<= 2 main_~j~0)} #116#return; {35192#(<= 2 main_~j~0)} is VALID [2022-04-08 03:54:31,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-04-08 03:54:31,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:54:31,092 INFO L290 TraceCheckUtils]: 0: Hoare triple {35169#true} ~cond := #in~cond; {35169#true} is VALID [2022-04-08 03:54:31,092 INFO L290 TraceCheckUtils]: 1: Hoare triple {35169#true} assume !(0 == ~cond); {35169#true} is VALID [2022-04-08 03:54:31,092 INFO L290 TraceCheckUtils]: 2: Hoare triple {35169#true} assume true; {35169#true} is VALID [2022-04-08 03:54:31,092 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35169#true} {35209#(<= 3 main_~j~0)} #118#return; {35209#(<= 3 main_~j~0)} is VALID [2022-04-08 03:54:31,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-04-08 03:54:31,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:54:31,094 INFO L290 TraceCheckUtils]: 0: Hoare triple {35169#true} ~cond := #in~cond; {35169#true} is VALID [2022-04-08 03:54:31,095 INFO L290 TraceCheckUtils]: 1: Hoare triple {35169#true} assume !(0 == ~cond); {35169#true} is VALID [2022-04-08 03:54:31,095 INFO L290 TraceCheckUtils]: 2: Hoare triple {35169#true} assume true; {35169#true} is VALID [2022-04-08 03:54:31,095 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35169#true} {35209#(<= 3 main_~j~0)} #120#return; {35209#(<= 3 main_~j~0)} is VALID [2022-04-08 03:54:31,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-04-08 03:54:31,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:54:31,097 INFO L290 TraceCheckUtils]: 0: Hoare triple {35169#true} ~cond := #in~cond; {35169#true} is VALID [2022-04-08 03:54:31,097 INFO L290 TraceCheckUtils]: 1: Hoare triple {35169#true} assume !(0 == ~cond); {35169#true} is VALID [2022-04-08 03:54:31,097 INFO L290 TraceCheckUtils]: 2: Hoare triple {35169#true} assume true; {35169#true} is VALID [2022-04-08 03:54:31,098 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35169#true} {35209#(<= 3 main_~j~0)} #122#return; {35209#(<= 3 main_~j~0)} is VALID [2022-04-08 03:54:31,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-04-08 03:54:31,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:54:31,099 INFO L290 TraceCheckUtils]: 0: Hoare triple {35169#true} ~cond := #in~cond; {35169#true} is VALID [2022-04-08 03:54:31,100 INFO L290 TraceCheckUtils]: 1: Hoare triple {35169#true} assume !(0 == ~cond); {35169#true} is VALID [2022-04-08 03:54:31,100 INFO L290 TraceCheckUtils]: 2: Hoare triple {35169#true} assume true; {35169#true} is VALID [2022-04-08 03:54:31,100 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35169#true} {35209#(<= 3 main_~j~0)} #124#return; {35209#(<= 3 main_~j~0)} is VALID [2022-04-08 03:54:31,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-04-08 03:54:31,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:54:31,105 INFO L290 TraceCheckUtils]: 0: Hoare triple {35169#true} ~cond := #in~cond; {35169#true} is VALID [2022-04-08 03:54:31,105 INFO L290 TraceCheckUtils]: 1: Hoare triple {35169#true} assume !(0 == ~cond); {35169#true} is VALID [2022-04-08 03:54:31,105 INFO L290 TraceCheckUtils]: 2: Hoare triple {35169#true} assume true; {35169#true} is VALID [2022-04-08 03:54:31,105 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35169#true} {35209#(<= 3 main_~j~0)} #126#return; {35209#(<= 3 main_~j~0)} is VALID [2022-04-08 03:54:31,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-04-08 03:54:31,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:54:31,108 INFO L290 TraceCheckUtils]: 0: Hoare triple {35169#true} ~cond := #in~cond; {35169#true} is VALID [2022-04-08 03:54:31,108 INFO L290 TraceCheckUtils]: 1: Hoare triple {35169#true} assume !(0 == ~cond); {35169#true} is VALID [2022-04-08 03:54:31,108 INFO L290 TraceCheckUtils]: 2: Hoare triple {35169#true} assume true; {35169#true} is VALID [2022-04-08 03:54:31,108 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35169#true} {35209#(<= 3 main_~j~0)} #128#return; {35209#(<= 3 main_~j~0)} is VALID [2022-04-08 03:54:31,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-04-08 03:54:31,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:54:31,110 INFO L290 TraceCheckUtils]: 0: Hoare triple {35169#true} ~cond := #in~cond; {35169#true} is VALID [2022-04-08 03:54:31,110 INFO L290 TraceCheckUtils]: 1: Hoare triple {35169#true} assume !(0 == ~cond); {35169#true} is VALID [2022-04-08 03:54:31,111 INFO L290 TraceCheckUtils]: 2: Hoare triple {35169#true} assume true; {35169#true} is VALID [2022-04-08 03:54:31,111 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35169#true} {35234#(<= 3 main_~i~0)} #118#return; {35234#(<= 3 main_~i~0)} is VALID [2022-04-08 03:54:31,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-04-08 03:54:31,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:54:31,113 INFO L290 TraceCheckUtils]: 0: Hoare triple {35169#true} ~cond := #in~cond; {35169#true} is VALID [2022-04-08 03:54:31,113 INFO L290 TraceCheckUtils]: 1: Hoare triple {35169#true} assume !(0 == ~cond); {35169#true} is VALID [2022-04-08 03:54:31,113 INFO L290 TraceCheckUtils]: 2: Hoare triple {35169#true} assume true; {35169#true} is VALID [2022-04-08 03:54:31,113 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35169#true} {35234#(<= 3 main_~i~0)} #120#return; {35234#(<= 3 main_~i~0)} is VALID [2022-04-08 03:54:31,116 INFO L272 TraceCheckUtils]: 0: Hoare triple {35169#true} call ULTIMATE.init(); {35245#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 03:54:31,116 INFO L290 TraceCheckUtils]: 1: Hoare triple {35245#(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(9, 2); {35169#true} is VALID [2022-04-08 03:54:31,116 INFO L290 TraceCheckUtils]: 2: Hoare triple {35169#true} assume true; {35169#true} is VALID [2022-04-08 03:54:31,116 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35169#true} {35169#true} #138#return; {35169#true} is VALID [2022-04-08 03:54:31,116 INFO L272 TraceCheckUtils]: 4: Hoare triple {35169#true} call #t~ret8 := main(#in~argc, #in~argv.base, #in~argv.offset); {35169#true} is VALID [2022-04-08 03:54:31,116 INFO L290 TraceCheckUtils]: 5: Hoare triple {35169#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;havoc ~n~0;havoc ~l~0;havoc ~r~0;havoc ~i~0;havoc ~j~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {35169#true} is VALID [2022-04-08 03:54:31,117 INFO L290 TraceCheckUtils]: 6: Hoare triple {35169#true} assume !!(1 <= ~n~0 && ~n~0 <= 1000000);~l~0 := 1 + (if ~n~0 < 0 && 0 != ~n~0 % 2 then 1 + ~n~0 / 2 else ~n~0 / 2);~r~0 := ~n~0; {35169#true} is VALID [2022-04-08 03:54:31,117 INFO L290 TraceCheckUtils]: 7: Hoare triple {35169#true} assume ~l~0 > 1;#t~post2 := ~l~0;~l~0 := #t~post2 - 1;havoc #t~post2; {35169#true} is VALID [2022-04-08 03:54:31,117 INFO L290 TraceCheckUtils]: 8: Hoare triple {35169#true} assume !!(~r~0 > 1);~i~0 := ~l~0;~j~0 := 2 * ~l~0; {35169#true} is VALID [2022-04-08 03:54:31,117 INFO L290 TraceCheckUtils]: 9: Hoare triple {35169#true} assume !!(~j~0 <= ~r~0); {35169#true} is VALID [2022-04-08 03:54:31,117 INFO L290 TraceCheckUtils]: 10: Hoare triple {35169#true} assume !(~j~0 < ~r~0); {35169#true} is VALID [2022-04-08 03:54:31,117 INFO L272 TraceCheckUtils]: 11: Hoare triple {35169#true} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {35169#true} is VALID [2022-04-08 03:54:31,117 INFO L290 TraceCheckUtils]: 12: Hoare triple {35169#true} ~cond := #in~cond; {35169#true} is VALID [2022-04-08 03:54:31,117 INFO L290 TraceCheckUtils]: 13: Hoare triple {35169#true} assume !(0 == ~cond); {35169#true} is VALID [2022-04-08 03:54:31,117 INFO L290 TraceCheckUtils]: 14: Hoare triple {35169#true} assume true; {35169#true} is VALID [2022-04-08 03:54:31,117 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {35169#true} {35169#true} #118#return; {35169#true} is VALID [2022-04-08 03:54:31,118 INFO L272 TraceCheckUtils]: 16: Hoare triple {35169#true} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {35169#true} is VALID [2022-04-08 03:54:31,118 INFO L290 TraceCheckUtils]: 17: Hoare triple {35169#true} ~cond := #in~cond; {35169#true} is VALID [2022-04-08 03:54:31,118 INFO L290 TraceCheckUtils]: 18: Hoare triple {35169#true} assume !(0 == ~cond); {35169#true} is VALID [2022-04-08 03:54:31,118 INFO L290 TraceCheckUtils]: 19: Hoare triple {35169#true} assume true; {35169#true} is VALID [2022-04-08 03:54:31,118 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {35169#true} {35169#true} #120#return; {35169#true} is VALID [2022-04-08 03:54:31,118 INFO L290 TraceCheckUtils]: 21: Hoare triple {35169#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {35169#true} is VALID [2022-04-08 03:54:31,118 INFO L290 TraceCheckUtils]: 22: Hoare triple {35169#true} assume 0 != #t~nondet5;havoc #t~nondet5; {35169#true} is VALID [2022-04-08 03:54:31,118 INFO L290 TraceCheckUtils]: 23: Hoare triple {35169#true} assume ~l~0 > 1; {35182#(<= 2 main_~l~0)} is VALID [2022-04-08 03:54:31,119 INFO L272 TraceCheckUtils]: 24: Hoare triple {35182#(<= 2 main_~l~0)} call __VERIFIER_assert((if 1 <= ~l~0 then 1 else 0)); {35169#true} is VALID [2022-04-08 03:54:31,119 INFO L290 TraceCheckUtils]: 25: Hoare triple {35169#true} ~cond := #in~cond; {35169#true} is VALID [2022-04-08 03:54:31,119 INFO L290 TraceCheckUtils]: 26: Hoare triple {35169#true} assume !(0 == ~cond); {35169#true} is VALID [2022-04-08 03:54:31,119 INFO L290 TraceCheckUtils]: 27: Hoare triple {35169#true} assume true; {35169#true} is VALID [2022-04-08 03:54:31,119 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {35169#true} {35182#(<= 2 main_~l~0)} #130#return; {35182#(<= 2 main_~l~0)} is VALID [2022-04-08 03:54:31,119 INFO L272 TraceCheckUtils]: 29: Hoare triple {35182#(<= 2 main_~l~0)} call __VERIFIER_assert((if ~l~0 <= ~n~0 then 1 else 0)); {35169#true} is VALID [2022-04-08 03:54:31,119 INFO L290 TraceCheckUtils]: 30: Hoare triple {35169#true} ~cond := #in~cond; {35169#true} is VALID [2022-04-08 03:54:31,120 INFO L290 TraceCheckUtils]: 31: Hoare triple {35169#true} assume !(0 == ~cond); {35169#true} is VALID [2022-04-08 03:54:31,120 INFO L290 TraceCheckUtils]: 32: Hoare triple {35169#true} assume true; {35169#true} is VALID [2022-04-08 03:54:31,120 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {35169#true} {35182#(<= 2 main_~l~0)} #132#return; {35182#(<= 2 main_~l~0)} is VALID [2022-04-08 03:54:31,120 INFO L290 TraceCheckUtils]: 34: Hoare triple {35182#(<= 2 main_~l~0)} #t~post6 := ~l~0;~l~0 := #t~post6 - 1;havoc #t~post6; {35191#(<= 1 main_~l~0)} is VALID [2022-04-08 03:54:31,121 INFO L290 TraceCheckUtils]: 35: Hoare triple {35191#(<= 1 main_~l~0)} assume !!(~r~0 > 1);~i~0 := ~l~0;~j~0 := 2 * ~l~0; {35192#(<= 2 main_~j~0)} is VALID [2022-04-08 03:54:31,121 INFO L290 TraceCheckUtils]: 36: Hoare triple {35192#(<= 2 main_~j~0)} assume !!(~j~0 <= ~r~0); {35192#(<= 2 main_~j~0)} is VALID [2022-04-08 03:54:31,121 INFO L290 TraceCheckUtils]: 37: Hoare triple {35192#(<= 2 main_~j~0)} assume ~j~0 < ~r~0; {35192#(<= 2 main_~j~0)} is VALID [2022-04-08 03:54:31,122 INFO L272 TraceCheckUtils]: 38: Hoare triple {35192#(<= 2 main_~j~0)} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {35169#true} is VALID [2022-04-08 03:54:31,122 INFO L290 TraceCheckUtils]: 39: Hoare triple {35169#true} ~cond := #in~cond; {35169#true} is VALID [2022-04-08 03:54:31,122 INFO L290 TraceCheckUtils]: 40: Hoare triple {35169#true} assume !(0 == ~cond); {35169#true} is VALID [2022-04-08 03:54:31,122 INFO L290 TraceCheckUtils]: 41: Hoare triple {35169#true} assume true; {35169#true} is VALID [2022-04-08 03:54:31,122 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {35169#true} {35192#(<= 2 main_~j~0)} #110#return; {35192#(<= 2 main_~j~0)} is VALID [2022-04-08 03:54:31,122 INFO L272 TraceCheckUtils]: 43: Hoare triple {35192#(<= 2 main_~j~0)} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {35169#true} is VALID [2022-04-08 03:54:31,122 INFO L290 TraceCheckUtils]: 44: Hoare triple {35169#true} ~cond := #in~cond; {35169#true} is VALID [2022-04-08 03:54:31,123 INFO L290 TraceCheckUtils]: 45: Hoare triple {35169#true} assume !(0 == ~cond); {35169#true} is VALID [2022-04-08 03:54:31,123 INFO L290 TraceCheckUtils]: 46: Hoare triple {35169#true} assume true; {35169#true} is VALID [2022-04-08 03:54:31,123 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {35169#true} {35192#(<= 2 main_~j~0)} #112#return; {35192#(<= 2 main_~j~0)} is VALID [2022-04-08 03:54:31,123 INFO L272 TraceCheckUtils]: 48: Hoare triple {35192#(<= 2 main_~j~0)} call __VERIFIER_assert((if 1 <= 1 + ~j~0 then 1 else 0)); {35169#true} is VALID [2022-04-08 03:54:31,123 INFO L290 TraceCheckUtils]: 49: Hoare triple {35169#true} ~cond := #in~cond; {35169#true} is VALID [2022-04-08 03:54:31,123 INFO L290 TraceCheckUtils]: 50: Hoare triple {35169#true} assume !(0 == ~cond); {35169#true} is VALID [2022-04-08 03:54:31,123 INFO L290 TraceCheckUtils]: 51: Hoare triple {35169#true} assume true; {35169#true} is VALID [2022-04-08 03:54:31,124 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {35169#true} {35192#(<= 2 main_~j~0)} #114#return; {35192#(<= 2 main_~j~0)} is VALID [2022-04-08 03:54:31,124 INFO L272 TraceCheckUtils]: 53: Hoare triple {35192#(<= 2 main_~j~0)} call __VERIFIER_assert((if 1 + ~j~0 <= ~n~0 then 1 else 0)); {35169#true} is VALID [2022-04-08 03:54:31,124 INFO L290 TraceCheckUtils]: 54: Hoare triple {35169#true} ~cond := #in~cond; {35169#true} is VALID [2022-04-08 03:54:31,124 INFO L290 TraceCheckUtils]: 55: Hoare triple {35169#true} assume !(0 == ~cond); {35169#true} is VALID [2022-04-08 03:54:31,124 INFO L290 TraceCheckUtils]: 56: Hoare triple {35169#true} assume true; {35169#true} is VALID [2022-04-08 03:54:31,125 INFO L284 TraceCheckUtils]: 57: Hoare quadruple {35169#true} {35192#(<= 2 main_~j~0)} #116#return; {35192#(<= 2 main_~j~0)} is VALID [2022-04-08 03:54:31,125 INFO L290 TraceCheckUtils]: 58: Hoare triple {35192#(<= 2 main_~j~0)} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {35192#(<= 2 main_~j~0)} is VALID [2022-04-08 03:54:31,125 INFO L290 TraceCheckUtils]: 59: Hoare triple {35192#(<= 2 main_~j~0)} assume 0 != #t~nondet4;havoc #t~nondet4;~j~0 := 1 + ~j~0; {35209#(<= 3 main_~j~0)} is VALID [2022-04-08 03:54:31,125 INFO L272 TraceCheckUtils]: 60: Hoare triple {35209#(<= 3 main_~j~0)} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {35169#true} is VALID [2022-04-08 03:54:31,125 INFO L290 TraceCheckUtils]: 61: Hoare triple {35169#true} ~cond := #in~cond; {35169#true} is VALID [2022-04-08 03:54:31,126 INFO L290 TraceCheckUtils]: 62: Hoare triple {35169#true} assume !(0 == ~cond); {35169#true} is VALID [2022-04-08 03:54:31,126 INFO L290 TraceCheckUtils]: 63: Hoare triple {35169#true} assume true; {35169#true} is VALID [2022-04-08 03:54:31,126 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {35169#true} {35209#(<= 3 main_~j~0)} #118#return; {35209#(<= 3 main_~j~0)} is VALID [2022-04-08 03:54:31,126 INFO L272 TraceCheckUtils]: 65: Hoare triple {35209#(<= 3 main_~j~0)} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {35169#true} is VALID [2022-04-08 03:54:31,126 INFO L290 TraceCheckUtils]: 66: Hoare triple {35169#true} ~cond := #in~cond; {35169#true} is VALID [2022-04-08 03:54:31,126 INFO L290 TraceCheckUtils]: 67: Hoare triple {35169#true} assume !(0 == ~cond); {35169#true} is VALID [2022-04-08 03:54:31,126 INFO L290 TraceCheckUtils]: 68: Hoare triple {35169#true} assume true; {35169#true} is VALID [2022-04-08 03:54:31,127 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {35169#true} {35209#(<= 3 main_~j~0)} #120#return; {35209#(<= 3 main_~j~0)} is VALID [2022-04-08 03:54:31,127 INFO L290 TraceCheckUtils]: 70: Hoare triple {35209#(<= 3 main_~j~0)} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {35209#(<= 3 main_~j~0)} is VALID [2022-04-08 03:54:31,127 INFO L290 TraceCheckUtils]: 71: Hoare triple {35209#(<= 3 main_~j~0)} assume !(0 != #t~nondet5);havoc #t~nondet5; {35209#(<= 3 main_~j~0)} is VALID [2022-04-08 03:54:31,127 INFO L272 TraceCheckUtils]: 72: Hoare triple {35209#(<= 3 main_~j~0)} call __VERIFIER_assert((if 1 <= ~i~0 then 1 else 0)); {35169#true} is VALID [2022-04-08 03:54:31,128 INFO L290 TraceCheckUtils]: 73: Hoare triple {35169#true} ~cond := #in~cond; {35169#true} is VALID [2022-04-08 03:54:31,128 INFO L290 TraceCheckUtils]: 74: Hoare triple {35169#true} assume !(0 == ~cond); {35169#true} is VALID [2022-04-08 03:54:31,128 INFO L290 TraceCheckUtils]: 75: Hoare triple {35169#true} assume true; {35169#true} is VALID [2022-04-08 03:54:31,128 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {35169#true} {35209#(<= 3 main_~j~0)} #122#return; {35209#(<= 3 main_~j~0)} is VALID [2022-04-08 03:54:31,128 INFO L272 TraceCheckUtils]: 77: Hoare triple {35209#(<= 3 main_~j~0)} call __VERIFIER_assert((if ~i~0 <= ~n~0 then 1 else 0)); {35169#true} is VALID [2022-04-08 03:54:31,128 INFO L290 TraceCheckUtils]: 78: Hoare triple {35169#true} ~cond := #in~cond; {35169#true} is VALID [2022-04-08 03:54:31,128 INFO L290 TraceCheckUtils]: 79: Hoare triple {35169#true} assume !(0 == ~cond); {35169#true} is VALID [2022-04-08 03:54:31,129 INFO L290 TraceCheckUtils]: 80: Hoare triple {35169#true} assume true; {35169#true} is VALID [2022-04-08 03:54:31,129 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {35169#true} {35209#(<= 3 main_~j~0)} #124#return; {35209#(<= 3 main_~j~0)} is VALID [2022-04-08 03:54:31,129 INFO L272 TraceCheckUtils]: 82: Hoare triple {35209#(<= 3 main_~j~0)} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {35169#true} is VALID [2022-04-08 03:54:31,129 INFO L290 TraceCheckUtils]: 83: Hoare triple {35169#true} ~cond := #in~cond; {35169#true} is VALID [2022-04-08 03:54:31,129 INFO L290 TraceCheckUtils]: 84: Hoare triple {35169#true} assume !(0 == ~cond); {35169#true} is VALID [2022-04-08 03:54:31,129 INFO L290 TraceCheckUtils]: 85: Hoare triple {35169#true} assume true; {35169#true} is VALID [2022-04-08 03:54:31,130 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {35169#true} {35209#(<= 3 main_~j~0)} #126#return; {35209#(<= 3 main_~j~0)} is VALID [2022-04-08 03:54:31,130 INFO L272 TraceCheckUtils]: 87: Hoare triple {35209#(<= 3 main_~j~0)} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {35169#true} is VALID [2022-04-08 03:54:31,130 INFO L290 TraceCheckUtils]: 88: Hoare triple {35169#true} ~cond := #in~cond; {35169#true} is VALID [2022-04-08 03:54:31,130 INFO L290 TraceCheckUtils]: 89: Hoare triple {35169#true} assume !(0 == ~cond); {35169#true} is VALID [2022-04-08 03:54:31,130 INFO L290 TraceCheckUtils]: 90: Hoare triple {35169#true} assume true; {35169#true} is VALID [2022-04-08 03:54:31,131 INFO L284 TraceCheckUtils]: 91: Hoare quadruple {35169#true} {35209#(<= 3 main_~j~0)} #128#return; {35209#(<= 3 main_~j~0)} is VALID [2022-04-08 03:54:31,131 INFO L290 TraceCheckUtils]: 92: Hoare triple {35209#(<= 3 main_~j~0)} ~i~0 := ~j~0;~j~0 := 2 * ~j~0; {35234#(<= 3 main_~i~0)} is VALID [2022-04-08 03:54:31,131 INFO L290 TraceCheckUtils]: 93: Hoare triple {35234#(<= 3 main_~i~0)} assume !!(~j~0 <= ~r~0); {35234#(<= 3 main_~i~0)} is VALID [2022-04-08 03:54:31,131 INFO L290 TraceCheckUtils]: 94: Hoare triple {35234#(<= 3 main_~i~0)} assume !(~j~0 < ~r~0); {35234#(<= 3 main_~i~0)} is VALID [2022-04-08 03:54:31,132 INFO L272 TraceCheckUtils]: 95: Hoare triple {35234#(<= 3 main_~i~0)} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {35169#true} is VALID [2022-04-08 03:54:31,132 INFO L290 TraceCheckUtils]: 96: Hoare triple {35169#true} ~cond := #in~cond; {35169#true} is VALID [2022-04-08 03:54:31,132 INFO L290 TraceCheckUtils]: 97: Hoare triple {35169#true} assume !(0 == ~cond); {35169#true} is VALID [2022-04-08 03:54:31,132 INFO L290 TraceCheckUtils]: 98: Hoare triple {35169#true} assume true; {35169#true} is VALID [2022-04-08 03:54:31,132 INFO L284 TraceCheckUtils]: 99: Hoare quadruple {35169#true} {35234#(<= 3 main_~i~0)} #118#return; {35234#(<= 3 main_~i~0)} is VALID [2022-04-08 03:54:31,132 INFO L272 TraceCheckUtils]: 100: Hoare triple {35234#(<= 3 main_~i~0)} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {35169#true} is VALID [2022-04-08 03:54:31,132 INFO L290 TraceCheckUtils]: 101: Hoare triple {35169#true} ~cond := #in~cond; {35169#true} is VALID [2022-04-08 03:54:31,133 INFO L290 TraceCheckUtils]: 102: Hoare triple {35169#true} assume !(0 == ~cond); {35169#true} is VALID [2022-04-08 03:54:31,133 INFO L290 TraceCheckUtils]: 103: Hoare triple {35169#true} assume true; {35169#true} is VALID [2022-04-08 03:54:31,133 INFO L284 TraceCheckUtils]: 104: Hoare quadruple {35169#true} {35234#(<= 3 main_~i~0)} #120#return; {35234#(<= 3 main_~i~0)} is VALID [2022-04-08 03:54:31,133 INFO L290 TraceCheckUtils]: 105: Hoare triple {35234#(<= 3 main_~i~0)} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {35234#(<= 3 main_~i~0)} is VALID [2022-04-08 03:54:31,134 INFO L290 TraceCheckUtils]: 106: Hoare triple {35234#(<= 3 main_~i~0)} assume !(0 != #t~nondet5);havoc #t~nondet5; {35234#(<= 3 main_~i~0)} is VALID [2022-04-08 03:54:31,134 INFO L272 TraceCheckUtils]: 107: Hoare triple {35234#(<= 3 main_~i~0)} call __VERIFIER_assert((if 1 <= ~i~0 then 1 else 0)); {35243#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 03:54:31,134 INFO L290 TraceCheckUtils]: 108: Hoare triple {35243#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {35244#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 03:54:31,135 INFO L290 TraceCheckUtils]: 109: Hoare triple {35244#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {35170#false} is VALID [2022-04-08 03:54:31,135 INFO L290 TraceCheckUtils]: 110: Hoare triple {35170#false} assume !false; {35170#false} is VALID [2022-04-08 03:54:31,135 INFO L134 CoverageAnalysis]: Checked inductivity of 532 backedges. 45 proven. 7 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2022-04-08 03:54:31,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 03:54:31,135 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1152704447] [2022-04-08 03:54:31,135 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1152704447] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 03:54:31,136 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1949085448] [2022-04-08 03:54:31,136 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 03:54:31,136 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 03:54:31,136 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 03:54:31,137 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 03:54:31,197 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 03:54:31,216 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 03:54:31,216 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 03:54:31,217 INFO L263 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-08 03:54:31,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:54:31,239 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 03:54:35,737 INFO L272 TraceCheckUtils]: 0: Hoare triple {35169#true} call ULTIMATE.init(); {35169#true} is VALID [2022-04-08 03:54:35,737 INFO L290 TraceCheckUtils]: 1: Hoare triple {35169#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(9, 2); {35169#true} is VALID [2022-04-08 03:54:35,738 INFO L290 TraceCheckUtils]: 2: Hoare triple {35169#true} assume true; {35169#true} is VALID [2022-04-08 03:54:35,738 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35169#true} {35169#true} #138#return; {35169#true} is VALID [2022-04-08 03:54:35,738 INFO L272 TraceCheckUtils]: 4: Hoare triple {35169#true} call #t~ret8 := main(#in~argc, #in~argv.base, #in~argv.offset); {35169#true} is VALID [2022-04-08 03:54:35,738 INFO L290 TraceCheckUtils]: 5: Hoare triple {35169#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;havoc ~n~0;havoc ~l~0;havoc ~r~0;havoc ~i~0;havoc ~j~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {35169#true} is VALID [2022-04-08 03:54:35,738 INFO L290 TraceCheckUtils]: 6: Hoare triple {35169#true} assume !!(1 <= ~n~0 && ~n~0 <= 1000000);~l~0 := 1 + (if ~n~0 < 0 && 0 != ~n~0 % 2 then 1 + ~n~0 / 2 else ~n~0 / 2);~r~0 := ~n~0; {35169#true} is VALID [2022-04-08 03:54:35,738 INFO L290 TraceCheckUtils]: 7: Hoare triple {35169#true} assume ~l~0 > 1;#t~post2 := ~l~0;~l~0 := #t~post2 - 1;havoc #t~post2; {35169#true} is VALID [2022-04-08 03:54:35,738 INFO L290 TraceCheckUtils]: 8: Hoare triple {35169#true} assume !!(~r~0 > 1);~i~0 := ~l~0;~j~0 := 2 * ~l~0; {35273#(<= main_~j~0 (* main_~l~0 2))} is VALID [2022-04-08 03:54:35,739 INFO L290 TraceCheckUtils]: 9: Hoare triple {35273#(<= main_~j~0 (* main_~l~0 2))} assume !!(~j~0 <= ~r~0); {35273#(<= main_~j~0 (* main_~l~0 2))} is VALID [2022-04-08 03:54:35,739 INFO L290 TraceCheckUtils]: 10: Hoare triple {35273#(<= main_~j~0 (* main_~l~0 2))} assume !(~j~0 < ~r~0); {35280#(<= main_~r~0 (* main_~l~0 2))} is VALID [2022-04-08 03:54:35,740 INFO L272 TraceCheckUtils]: 11: Hoare triple {35280#(<= main_~r~0 (* main_~l~0 2))} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {35169#true} is VALID [2022-04-08 03:54:35,740 INFO L290 TraceCheckUtils]: 12: Hoare triple {35169#true} ~cond := #in~cond; {35169#true} is VALID [2022-04-08 03:54:35,740 INFO L290 TraceCheckUtils]: 13: Hoare triple {35169#true} assume !(0 == ~cond); {35169#true} is VALID [2022-04-08 03:54:35,740 INFO L290 TraceCheckUtils]: 14: Hoare triple {35169#true} assume true; {35169#true} is VALID [2022-04-08 03:54:35,740 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {35169#true} {35280#(<= main_~r~0 (* main_~l~0 2))} #118#return; {35280#(<= main_~r~0 (* main_~l~0 2))} is VALID [2022-04-08 03:54:35,741 INFO L272 TraceCheckUtils]: 16: Hoare triple {35280#(<= main_~r~0 (* main_~l~0 2))} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {35169#true} is VALID [2022-04-08 03:54:35,741 INFO L290 TraceCheckUtils]: 17: Hoare triple {35169#true} ~cond := #in~cond; {35169#true} is VALID [2022-04-08 03:54:35,741 INFO L290 TraceCheckUtils]: 18: Hoare triple {35169#true} assume !(0 == ~cond); {35169#true} is VALID [2022-04-08 03:54:35,741 INFO L290 TraceCheckUtils]: 19: Hoare triple {35169#true} assume true; {35169#true} is VALID [2022-04-08 03:54:35,741 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {35169#true} {35280#(<= main_~r~0 (* main_~l~0 2))} #120#return; {35280#(<= main_~r~0 (* main_~l~0 2))} is VALID [2022-04-08 03:54:35,742 INFO L290 TraceCheckUtils]: 21: Hoare triple {35280#(<= main_~r~0 (* main_~l~0 2))} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {35280#(<= main_~r~0 (* main_~l~0 2))} is VALID [2022-04-08 03:54:35,742 INFO L290 TraceCheckUtils]: 22: Hoare triple {35280#(<= main_~r~0 (* main_~l~0 2))} assume 0 != #t~nondet5;havoc #t~nondet5; {35280#(<= main_~r~0 (* main_~l~0 2))} is VALID [2022-04-08 03:54:35,743 INFO L290 TraceCheckUtils]: 23: Hoare triple {35280#(<= main_~r~0 (* main_~l~0 2))} assume ~l~0 > 1; {35320#(and (< 1 main_~l~0) (<= main_~r~0 (* main_~l~0 2)))} is VALID [2022-04-08 03:54:35,743 INFO L272 TraceCheckUtils]: 24: Hoare triple {35320#(and (< 1 main_~l~0) (<= main_~r~0 (* main_~l~0 2)))} call __VERIFIER_assert((if 1 <= ~l~0 then 1 else 0)); {35169#true} is VALID [2022-04-08 03:54:35,743 INFO L290 TraceCheckUtils]: 25: Hoare triple {35169#true} ~cond := #in~cond; {35169#true} is VALID [2022-04-08 03:54:35,743 INFO L290 TraceCheckUtils]: 26: Hoare triple {35169#true} assume !(0 == ~cond); {35169#true} is VALID [2022-04-08 03:54:35,743 INFO L290 TraceCheckUtils]: 27: Hoare triple {35169#true} assume true; {35169#true} is VALID [2022-04-08 03:54:35,744 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {35169#true} {35320#(and (< 1 main_~l~0) (<= main_~r~0 (* main_~l~0 2)))} #130#return; {35320#(and (< 1 main_~l~0) (<= main_~r~0 (* main_~l~0 2)))} is VALID [2022-04-08 03:54:35,744 INFO L272 TraceCheckUtils]: 29: Hoare triple {35320#(and (< 1 main_~l~0) (<= main_~r~0 (* main_~l~0 2)))} call __VERIFIER_assert((if ~l~0 <= ~n~0 then 1 else 0)); {35169#true} is VALID [2022-04-08 03:54:35,744 INFO L290 TraceCheckUtils]: 30: Hoare triple {35169#true} ~cond := #in~cond; {35169#true} is VALID [2022-04-08 03:54:35,744 INFO L290 TraceCheckUtils]: 31: Hoare triple {35169#true} assume !(0 == ~cond); {35169#true} is VALID [2022-04-08 03:54:35,744 INFO L290 TraceCheckUtils]: 32: Hoare triple {35169#true} assume true; {35169#true} is VALID [2022-04-08 03:54:35,744 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {35169#true} {35320#(and (< 1 main_~l~0) (<= main_~r~0 (* main_~l~0 2)))} #132#return; {35320#(and (< 1 main_~l~0) (<= main_~r~0 (* main_~l~0 2)))} is VALID [2022-04-08 03:54:35,745 INFO L290 TraceCheckUtils]: 34: Hoare triple {35320#(and (< 1 main_~l~0) (<= main_~r~0 (* main_~l~0 2)))} #t~post6 := ~l~0;~l~0 := #t~post6 - 1;havoc #t~post6; {35354#(and (<= (div (- main_~r~0) (- 2)) (+ main_~l~0 1)) (< 0 main_~l~0))} is VALID [2022-04-08 03:54:35,746 INFO L290 TraceCheckUtils]: 35: Hoare triple {35354#(and (<= (div (- main_~r~0) (- 2)) (+ main_~l~0 1)) (< 0 main_~l~0))} assume !!(~r~0 > 1);~i~0 := ~l~0;~j~0 := 2 * ~l~0; {35358#(and (<= (div (* (- 1) main_~r~0) (- 2)) (+ (div main_~j~0 2) 1)) (< 0 (div main_~j~0 2)))} is VALID [2022-04-08 03:54:35,746 INFO L290 TraceCheckUtils]: 36: Hoare triple {35358#(and (<= (div (* (- 1) main_~r~0) (- 2)) (+ (div main_~j~0 2) 1)) (< 0 (div main_~j~0 2)))} assume !!(~j~0 <= ~r~0); {35358#(and (<= (div (* (- 1) main_~r~0) (- 2)) (+ (div main_~j~0 2) 1)) (< 0 (div main_~j~0 2)))} is VALID [2022-04-08 03:54:35,746 INFO L290 TraceCheckUtils]: 37: Hoare triple {35358#(and (<= (div (* (- 1) main_~r~0) (- 2)) (+ (div main_~j~0 2) 1)) (< 0 (div main_~j~0 2)))} assume ~j~0 < ~r~0; {35358#(and (<= (div (* (- 1) main_~r~0) (- 2)) (+ (div main_~j~0 2) 1)) (< 0 (div main_~j~0 2)))} is VALID [2022-04-08 03:54:35,747 INFO L272 TraceCheckUtils]: 38: Hoare triple {35358#(and (<= (div (* (- 1) main_~r~0) (- 2)) (+ (div main_~j~0 2) 1)) (< 0 (div main_~j~0 2)))} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {35169#true} is VALID [2022-04-08 03:54:35,747 INFO L290 TraceCheckUtils]: 39: Hoare triple {35169#true} ~cond := #in~cond; {35169#true} is VALID [2022-04-08 03:54:35,747 INFO L290 TraceCheckUtils]: 40: Hoare triple {35169#true} assume !(0 == ~cond); {35169#true} is VALID [2022-04-08 03:54:35,747 INFO L290 TraceCheckUtils]: 41: Hoare triple {35169#true} assume true; {35169#true} is VALID [2022-04-08 03:54:35,747 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {35169#true} {35358#(and (<= (div (* (- 1) main_~r~0) (- 2)) (+ (div main_~j~0 2) 1)) (< 0 (div main_~j~0 2)))} #110#return; {35358#(and (<= (div (* (- 1) main_~r~0) (- 2)) (+ (div main_~j~0 2) 1)) (< 0 (div main_~j~0 2)))} is VALID [2022-04-08 03:54:35,747 INFO L272 TraceCheckUtils]: 43: Hoare triple {35358#(and (<= (div (* (- 1) main_~r~0) (- 2)) (+ (div main_~j~0 2) 1)) (< 0 (div main_~j~0 2)))} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {35169#true} is VALID [2022-04-08 03:54:35,748 INFO L290 TraceCheckUtils]: 44: Hoare triple {35169#true} ~cond := #in~cond; {35169#true} is VALID [2022-04-08 03:54:35,748 INFO L290 TraceCheckUtils]: 45: Hoare triple {35169#true} assume !(0 == ~cond); {35169#true} is VALID [2022-04-08 03:54:35,748 INFO L290 TraceCheckUtils]: 46: Hoare triple {35169#true} assume true; {35169#true} is VALID [2022-04-08 03:54:35,748 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {35169#true} {35358#(and (<= (div (* (- 1) main_~r~0) (- 2)) (+ (div main_~j~0 2) 1)) (< 0 (div main_~j~0 2)))} #112#return; {35358#(and (<= (div (* (- 1) main_~r~0) (- 2)) (+ (div main_~j~0 2) 1)) (< 0 (div main_~j~0 2)))} is VALID [2022-04-08 03:54:35,748 INFO L272 TraceCheckUtils]: 48: Hoare triple {35358#(and (<= (div (* (- 1) main_~r~0) (- 2)) (+ (div main_~j~0 2) 1)) (< 0 (div main_~j~0 2)))} call __VERIFIER_assert((if 1 <= 1 + ~j~0 then 1 else 0)); {35169#true} is VALID [2022-04-08 03:54:35,748 INFO L290 TraceCheckUtils]: 49: Hoare triple {35169#true} ~cond := #in~cond; {35169#true} is VALID [2022-04-08 03:54:35,749 INFO L290 TraceCheckUtils]: 50: Hoare triple {35169#true} assume !(0 == ~cond); {35169#true} is VALID [2022-04-08 03:54:35,749 INFO L290 TraceCheckUtils]: 51: Hoare triple {35169#true} assume true; {35169#true} is VALID [2022-04-08 03:54:35,749 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {35169#true} {35358#(and (<= (div (* (- 1) main_~r~0) (- 2)) (+ (div main_~j~0 2) 1)) (< 0 (div main_~j~0 2)))} #114#return; {35358#(and (<= (div (* (- 1) main_~r~0) (- 2)) (+ (div main_~j~0 2) 1)) (< 0 (div main_~j~0 2)))} is VALID [2022-04-08 03:54:35,749 INFO L272 TraceCheckUtils]: 53: Hoare triple {35358#(and (<= (div (* (- 1) main_~r~0) (- 2)) (+ (div main_~j~0 2) 1)) (< 0 (div main_~j~0 2)))} call __VERIFIER_assert((if 1 + ~j~0 <= ~n~0 then 1 else 0)); {35169#true} is VALID [2022-04-08 03:54:35,749 INFO L290 TraceCheckUtils]: 54: Hoare triple {35169#true} ~cond := #in~cond; {35169#true} is VALID [2022-04-08 03:54:35,749 INFO L290 TraceCheckUtils]: 55: Hoare triple {35169#true} assume !(0 == ~cond); {35169#true} is VALID [2022-04-08 03:54:35,749 INFO L290 TraceCheckUtils]: 56: Hoare triple {35169#true} assume true; {35169#true} is VALID [2022-04-08 03:54:35,750 INFO L284 TraceCheckUtils]: 57: Hoare quadruple {35169#true} {35358#(and (<= (div (* (- 1) main_~r~0) (- 2)) (+ (div main_~j~0 2) 1)) (< 0 (div main_~j~0 2)))} #116#return; {35358#(and (<= (div (* (- 1) main_~r~0) (- 2)) (+ (div main_~j~0 2) 1)) (< 0 (div main_~j~0 2)))} is VALID [2022-04-08 03:54:35,750 INFO L290 TraceCheckUtils]: 58: Hoare triple {35358#(and (<= (div (* (- 1) main_~r~0) (- 2)) (+ (div main_~j~0 2) 1)) (< 0 (div main_~j~0 2)))} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {35358#(and (<= (div (* (- 1) main_~r~0) (- 2)) (+ (div main_~j~0 2) 1)) (< 0 (div main_~j~0 2)))} is VALID [2022-04-08 03:54:35,751 INFO L290 TraceCheckUtils]: 59: Hoare triple {35358#(and (<= (div (* (- 1) main_~r~0) (- 2)) (+ (div main_~j~0 2) 1)) (< 0 (div main_~j~0 2)))} assume 0 != #t~nondet4;havoc #t~nondet4;~j~0 := 1 + ~j~0; {35431#(and (<= (div (* (- 1) main_~r~0) (- 2)) (+ (div (+ (- 1) main_~j~0) 2) 1)) (< 0 (div (+ (- 1) main_~j~0) 2)))} is VALID [2022-04-08 03:54:35,751 INFO L272 TraceCheckUtils]: 60: Hoare triple {35431#(and (<= (div (* (- 1) main_~r~0) (- 2)) (+ (div (+ (- 1) main_~j~0) 2) 1)) (< 0 (div (+ (- 1) main_~j~0) 2)))} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {35169#true} is VALID [2022-04-08 03:54:35,751 INFO L290 TraceCheckUtils]: 61: Hoare triple {35169#true} ~cond := #in~cond; {35169#true} is VALID [2022-04-08 03:54:35,751 INFO L290 TraceCheckUtils]: 62: Hoare triple {35169#true} assume !(0 == ~cond); {35169#true} is VALID [2022-04-08 03:54:35,752 INFO L290 TraceCheckUtils]: 63: Hoare triple {35169#true} assume true; {35169#true} is VALID [2022-04-08 03:54:35,752 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {35169#true} {35431#(and (<= (div (* (- 1) main_~r~0) (- 2)) (+ (div (+ (- 1) main_~j~0) 2) 1)) (< 0 (div (+ (- 1) main_~j~0) 2)))} #118#return; {35431#(and (<= (div (* (- 1) main_~r~0) (- 2)) (+ (div (+ (- 1) main_~j~0) 2) 1)) (< 0 (div (+ (- 1) main_~j~0) 2)))} is VALID [2022-04-08 03:54:35,752 INFO L272 TraceCheckUtils]: 65: Hoare triple {35431#(and (<= (div (* (- 1) main_~r~0) (- 2)) (+ (div (+ (- 1) main_~j~0) 2) 1)) (< 0 (div (+ (- 1) main_~j~0) 2)))} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {35169#true} is VALID [2022-04-08 03:54:35,752 INFO L290 TraceCheckUtils]: 66: Hoare triple {35169#true} ~cond := #in~cond; {35169#true} is VALID [2022-04-08 03:54:35,752 INFO L290 TraceCheckUtils]: 67: Hoare triple {35169#true} assume !(0 == ~cond); {35169#true} is VALID [2022-04-08 03:54:35,752 INFO L290 TraceCheckUtils]: 68: Hoare triple {35169#true} assume true; {35169#true} is VALID [2022-04-08 03:54:35,753 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {35169#true} {35431#(and (<= (div (* (- 1) main_~r~0) (- 2)) (+ (div (+ (- 1) main_~j~0) 2) 1)) (< 0 (div (+ (- 1) main_~j~0) 2)))} #120#return; {35431#(and (<= (div (* (- 1) main_~r~0) (- 2)) (+ (div (+ (- 1) main_~j~0) 2) 1)) (< 0 (div (+ (- 1) main_~j~0) 2)))} is VALID [2022-04-08 03:54:35,753 INFO L290 TraceCheckUtils]: 70: Hoare triple {35431#(and (<= (div (* (- 1) main_~r~0) (- 2)) (+ (div (+ (- 1) main_~j~0) 2) 1)) (< 0 (div (+ (- 1) main_~j~0) 2)))} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {35431#(and (<= (div (* (- 1) main_~r~0) (- 2)) (+ (div (+ (- 1) main_~j~0) 2) 1)) (< 0 (div (+ (- 1) main_~j~0) 2)))} is VALID [2022-04-08 03:54:35,754 INFO L290 TraceCheckUtils]: 71: Hoare triple {35431#(and (<= (div (* (- 1) main_~r~0) (- 2)) (+ (div (+ (- 1) main_~j~0) 2) 1)) (< 0 (div (+ (- 1) main_~j~0) 2)))} assume !(0 != #t~nondet5);havoc #t~nondet5; {35431#(and (<= (div (* (- 1) main_~r~0) (- 2)) (+ (div (+ (- 1) main_~j~0) 2) 1)) (< 0 (div (+ (- 1) main_~j~0) 2)))} is VALID [2022-04-08 03:54:35,754 INFO L272 TraceCheckUtils]: 72: Hoare triple {35431#(and (<= (div (* (- 1) main_~r~0) (- 2)) (+ (div (+ (- 1) main_~j~0) 2) 1)) (< 0 (div (+ (- 1) main_~j~0) 2)))} call __VERIFIER_assert((if 1 <= ~i~0 then 1 else 0)); {35169#true} is VALID [2022-04-08 03:54:35,754 INFO L290 TraceCheckUtils]: 73: Hoare triple {35169#true} ~cond := #in~cond; {35169#true} is VALID [2022-04-08 03:54:35,754 INFO L290 TraceCheckUtils]: 74: Hoare triple {35169#true} assume !(0 == ~cond); {35169#true} is VALID [2022-04-08 03:54:35,754 INFO L290 TraceCheckUtils]: 75: Hoare triple {35169#true} assume true; {35169#true} is VALID [2022-04-08 03:54:35,755 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {35169#true} {35431#(and (<= (div (* (- 1) main_~r~0) (- 2)) (+ (div (+ (- 1) main_~j~0) 2) 1)) (< 0 (div (+ (- 1) main_~j~0) 2)))} #122#return; {35431#(and (<= (div (* (- 1) main_~r~0) (- 2)) (+ (div (+ (- 1) main_~j~0) 2) 1)) (< 0 (div (+ (- 1) main_~j~0) 2)))} is VALID [2022-04-08 03:54:35,755 INFO L272 TraceCheckUtils]: 77: Hoare triple {35431#(and (<= (div (* (- 1) main_~r~0) (- 2)) (+ (div (+ (- 1) main_~j~0) 2) 1)) (< 0 (div (+ (- 1) main_~j~0) 2)))} call __VERIFIER_assert((if ~i~0 <= ~n~0 then 1 else 0)); {35169#true} is VALID [2022-04-08 03:54:35,755 INFO L290 TraceCheckUtils]: 78: Hoare triple {35169#true} ~cond := #in~cond; {35169#true} is VALID [2022-04-08 03:54:35,755 INFO L290 TraceCheckUtils]: 79: Hoare triple {35169#true} assume !(0 == ~cond); {35169#true} is VALID [2022-04-08 03:54:35,755 INFO L290 TraceCheckUtils]: 80: Hoare triple {35169#true} assume true; {35169#true} is VALID [2022-04-08 03:54:35,756 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {35169#true} {35431#(and (<= (div (* (- 1) main_~r~0) (- 2)) (+ (div (+ (- 1) main_~j~0) 2) 1)) (< 0 (div (+ (- 1) main_~j~0) 2)))} #124#return; {35431#(and (<= (div (* (- 1) main_~r~0) (- 2)) (+ (div (+ (- 1) main_~j~0) 2) 1)) (< 0 (div (+ (- 1) main_~j~0) 2)))} is VALID [2022-04-08 03:54:35,756 INFO L272 TraceCheckUtils]: 82: Hoare triple {35431#(and (<= (div (* (- 1) main_~r~0) (- 2)) (+ (div (+ (- 1) main_~j~0) 2) 1)) (< 0 (div (+ (- 1) main_~j~0) 2)))} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {35169#true} is VALID [2022-04-08 03:54:35,756 INFO L290 TraceCheckUtils]: 83: Hoare triple {35169#true} ~cond := #in~cond; {35169#true} is VALID [2022-04-08 03:54:35,756 INFO L290 TraceCheckUtils]: 84: Hoare triple {35169#true} assume !(0 == ~cond); {35169#true} is VALID [2022-04-08 03:54:35,756 INFO L290 TraceCheckUtils]: 85: Hoare triple {35169#true} assume true; {35169#true} is VALID [2022-04-08 03:54:35,756 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {35169#true} {35431#(and (<= (div (* (- 1) main_~r~0) (- 2)) (+ (div (+ (- 1) main_~j~0) 2) 1)) (< 0 (div (+ (- 1) main_~j~0) 2)))} #126#return; {35431#(and (<= (div (* (- 1) main_~r~0) (- 2)) (+ (div (+ (- 1) main_~j~0) 2) 1)) (< 0 (div (+ (- 1) main_~j~0) 2)))} is VALID [2022-04-08 03:54:35,756 INFO L272 TraceCheckUtils]: 87: Hoare triple {35431#(and (<= (div (* (- 1) main_~r~0) (- 2)) (+ (div (+ (- 1) main_~j~0) 2) 1)) (< 0 (div (+ (- 1) main_~j~0) 2)))} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {35169#true} is VALID [2022-04-08 03:54:35,757 INFO L290 TraceCheckUtils]: 88: Hoare triple {35169#true} ~cond := #in~cond; {35169#true} is VALID [2022-04-08 03:54:35,757 INFO L290 TraceCheckUtils]: 89: Hoare triple {35169#true} assume !(0 == ~cond); {35169#true} is VALID [2022-04-08 03:54:35,757 INFO L290 TraceCheckUtils]: 90: Hoare triple {35169#true} assume true; {35169#true} is VALID [2022-04-08 03:54:35,757 INFO L284 TraceCheckUtils]: 91: Hoare quadruple {35169#true} {35431#(and (<= (div (* (- 1) main_~r~0) (- 2)) (+ (div (+ (- 1) main_~j~0) 2) 1)) (< 0 (div (+ (- 1) main_~j~0) 2)))} #128#return; {35431#(and (<= (div (* (- 1) main_~r~0) (- 2)) (+ (div (+ (- 1) main_~j~0) 2) 1)) (< 0 (div (+ (- 1) main_~j~0) 2)))} is VALID [2022-04-08 03:54:35,758 INFO L290 TraceCheckUtils]: 92: Hoare triple {35431#(and (<= (div (* (- 1) main_~r~0) (- 2)) (+ (div (+ (- 1) main_~j~0) 2) 1)) (< 0 (div (+ (- 1) main_~j~0) 2)))} ~i~0 := ~j~0;~j~0 := 2 * ~j~0; {35531#(and (<= (div (* (- 1) main_~r~0) (- 2)) (+ (div (div (+ (- 2) main_~j~0) 2) 2) 1)) (< 0 (div (div (+ (- 2) main_~j~0) 2) 2)))} is VALID [2022-04-08 03:54:35,758 INFO L290 TraceCheckUtils]: 93: Hoare triple {35531#(and (<= (div (* (- 1) main_~r~0) (- 2)) (+ (div (div (+ (- 2) main_~j~0) 2) 2) 1)) (< 0 (div (div (+ (- 2) main_~j~0) 2) 2)))} assume !!(~j~0 <= ~r~0); {35170#false} is VALID [2022-04-08 03:54:35,759 INFO L290 TraceCheckUtils]: 94: Hoare triple {35170#false} assume !(~j~0 < ~r~0); {35170#false} is VALID [2022-04-08 03:54:35,759 INFO L272 TraceCheckUtils]: 95: Hoare triple {35170#false} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {35170#false} is VALID [2022-04-08 03:54:35,759 INFO L290 TraceCheckUtils]: 96: Hoare triple {35170#false} ~cond := #in~cond; {35170#false} is VALID [2022-04-08 03:54:35,759 INFO L290 TraceCheckUtils]: 97: Hoare triple {35170#false} assume !(0 == ~cond); {35170#false} is VALID [2022-04-08 03:54:35,759 INFO L290 TraceCheckUtils]: 98: Hoare triple {35170#false} assume true; {35170#false} is VALID [2022-04-08 03:54:35,759 INFO L284 TraceCheckUtils]: 99: Hoare quadruple {35170#false} {35170#false} #118#return; {35170#false} is VALID [2022-04-08 03:54:35,759 INFO L272 TraceCheckUtils]: 100: Hoare triple {35170#false} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {35170#false} is VALID [2022-04-08 03:54:35,759 INFO L290 TraceCheckUtils]: 101: Hoare triple {35170#false} ~cond := #in~cond; {35170#false} is VALID [2022-04-08 03:54:35,759 INFO L290 TraceCheckUtils]: 102: Hoare triple {35170#false} assume !(0 == ~cond); {35170#false} is VALID [2022-04-08 03:54:35,759 INFO L290 TraceCheckUtils]: 103: Hoare triple {35170#false} assume true; {35170#false} is VALID [2022-04-08 03:54:35,760 INFO L284 TraceCheckUtils]: 104: Hoare quadruple {35170#false} {35170#false} #120#return; {35170#false} is VALID [2022-04-08 03:54:35,760 INFO L290 TraceCheckUtils]: 105: Hoare triple {35170#false} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {35170#false} is VALID [2022-04-08 03:54:35,760 INFO L290 TraceCheckUtils]: 106: Hoare triple {35170#false} assume !(0 != #t~nondet5);havoc #t~nondet5; {35170#false} is VALID [2022-04-08 03:54:35,760 INFO L272 TraceCheckUtils]: 107: Hoare triple {35170#false} call __VERIFIER_assert((if 1 <= ~i~0 then 1 else 0)); {35170#false} is VALID [2022-04-08 03:54:35,760 INFO L290 TraceCheckUtils]: 108: Hoare triple {35170#false} ~cond := #in~cond; {35170#false} is VALID [2022-04-08 03:54:35,760 INFO L290 TraceCheckUtils]: 109: Hoare triple {35170#false} assume 0 == ~cond; {35170#false} is VALID [2022-04-08 03:54:35,760 INFO L290 TraceCheckUtils]: 110: Hoare triple {35170#false} assume !false; {35170#false} is VALID [2022-04-08 03:54:35,761 INFO L134 CoverageAnalysis]: Checked inductivity of 532 backedges. 153 proven. 7 refuted. 0 times theorem prover too weak. 372 trivial. 0 not checked. [2022-04-08 03:54:35,761 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 03:54:36,510 INFO L290 TraceCheckUtils]: 110: Hoare triple {35170#false} assume !false; {35170#false} is VALID [2022-04-08 03:54:36,510 INFO L290 TraceCheckUtils]: 109: Hoare triple {35170#false} assume 0 == ~cond; {35170#false} is VALID [2022-04-08 03:54:36,510 INFO L290 TraceCheckUtils]: 108: Hoare triple {35170#false} ~cond := #in~cond; {35170#false} is VALID [2022-04-08 03:54:36,510 INFO L272 TraceCheckUtils]: 107: Hoare triple {35170#false} call __VERIFIER_assert((if 1 <= ~i~0 then 1 else 0)); {35170#false} is VALID [2022-04-08 03:54:36,510 INFO L290 TraceCheckUtils]: 106: Hoare triple {35170#false} assume !(0 != #t~nondet5);havoc #t~nondet5; {35170#false} is VALID [2022-04-08 03:54:36,511 INFO L290 TraceCheckUtils]: 105: Hoare triple {35170#false} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {35170#false} is VALID [2022-04-08 03:54:36,511 INFO L284 TraceCheckUtils]: 104: Hoare quadruple {35169#true} {35170#false} #120#return; {35170#false} is VALID [2022-04-08 03:54:36,511 INFO L290 TraceCheckUtils]: 103: Hoare triple {35169#true} assume true; {35169#true} is VALID [2022-04-08 03:54:36,511 INFO L290 TraceCheckUtils]: 102: Hoare triple {35169#true} assume !(0 == ~cond); {35169#true} is VALID [2022-04-08 03:54:36,511 INFO L290 TraceCheckUtils]: 101: Hoare triple {35169#true} ~cond := #in~cond; {35169#true} is VALID [2022-04-08 03:54:36,511 INFO L272 TraceCheckUtils]: 100: Hoare triple {35170#false} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {35169#true} is VALID [2022-04-08 03:54:36,511 INFO L284 TraceCheckUtils]: 99: Hoare quadruple {35169#true} {35170#false} #118#return; {35170#false} is VALID [2022-04-08 03:54:36,511 INFO L290 TraceCheckUtils]: 98: Hoare triple {35169#true} assume true; {35169#true} is VALID [2022-04-08 03:54:36,511 INFO L290 TraceCheckUtils]: 97: Hoare triple {35169#true} assume !(0 == ~cond); {35169#true} is VALID [2022-04-08 03:54:36,511 INFO L290 TraceCheckUtils]: 96: Hoare triple {35169#true} ~cond := #in~cond; {35169#true} is VALID [2022-04-08 03:54:36,512 INFO L272 TraceCheckUtils]: 95: Hoare triple {35170#false} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {35169#true} is VALID [2022-04-08 03:54:36,512 INFO L290 TraceCheckUtils]: 94: Hoare triple {35170#false} assume !(~j~0 < ~r~0); {35170#false} is VALID [2022-04-08 03:54:36,512 INFO L290 TraceCheckUtils]: 93: Hoare triple {35637#(not (<= main_~j~0 main_~r~0))} assume !!(~j~0 <= ~r~0); {35170#false} is VALID [2022-04-08 03:54:36,513 INFO L290 TraceCheckUtils]: 92: Hoare triple {35641#(< main_~r~0 (* main_~j~0 2))} ~i~0 := ~j~0;~j~0 := 2 * ~j~0; {35637#(not (<= main_~j~0 main_~r~0))} is VALID [2022-04-08 03:54:36,513 INFO L284 TraceCheckUtils]: 91: Hoare quadruple {35169#true} {35641#(< main_~r~0 (* main_~j~0 2))} #128#return; {35641#(< main_~r~0 (* main_~j~0 2))} is VALID [2022-04-08 03:54:36,513 INFO L290 TraceCheckUtils]: 90: Hoare triple {35169#true} assume true; {35169#true} is VALID [2022-04-08 03:54:36,513 INFO L290 TraceCheckUtils]: 89: Hoare triple {35169#true} assume !(0 == ~cond); {35169#true} is VALID [2022-04-08 03:54:36,513 INFO L290 TraceCheckUtils]: 88: Hoare triple {35169#true} ~cond := #in~cond; {35169#true} is VALID [2022-04-08 03:54:36,513 INFO L272 TraceCheckUtils]: 87: Hoare triple {35641#(< main_~r~0 (* main_~j~0 2))} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {35169#true} is VALID [2022-04-08 03:54:36,514 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {35169#true} {35641#(< main_~r~0 (* main_~j~0 2))} #126#return; {35641#(< main_~r~0 (* main_~j~0 2))} is VALID [2022-04-08 03:54:36,514 INFO L290 TraceCheckUtils]: 85: Hoare triple {35169#true} assume true; {35169#true} is VALID [2022-04-08 03:54:36,514 INFO L290 TraceCheckUtils]: 84: Hoare triple {35169#true} assume !(0 == ~cond); {35169#true} is VALID [2022-04-08 03:54:36,514 INFO L290 TraceCheckUtils]: 83: Hoare triple {35169#true} ~cond := #in~cond; {35169#true} is VALID [2022-04-08 03:54:36,514 INFO L272 TraceCheckUtils]: 82: Hoare triple {35641#(< main_~r~0 (* main_~j~0 2))} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {35169#true} is VALID [2022-04-08 03:54:36,515 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {35169#true} {35641#(< main_~r~0 (* main_~j~0 2))} #124#return; {35641#(< main_~r~0 (* main_~j~0 2))} is VALID [2022-04-08 03:54:36,515 INFO L290 TraceCheckUtils]: 80: Hoare triple {35169#true} assume true; {35169#true} is VALID [2022-04-08 03:54:36,515 INFO L290 TraceCheckUtils]: 79: Hoare triple {35169#true} assume !(0 == ~cond); {35169#true} is VALID [2022-04-08 03:54:36,515 INFO L290 TraceCheckUtils]: 78: Hoare triple {35169#true} ~cond := #in~cond; {35169#true} is VALID [2022-04-08 03:54:36,515 INFO L272 TraceCheckUtils]: 77: Hoare triple {35641#(< main_~r~0 (* main_~j~0 2))} call __VERIFIER_assert((if ~i~0 <= ~n~0 then 1 else 0)); {35169#true} is VALID [2022-04-08 03:54:36,516 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {35169#true} {35641#(< main_~r~0 (* main_~j~0 2))} #122#return; {35641#(< main_~r~0 (* main_~j~0 2))} is VALID [2022-04-08 03:54:36,516 INFO L290 TraceCheckUtils]: 75: Hoare triple {35169#true} assume true; {35169#true} is VALID [2022-04-08 03:54:36,516 INFO L290 TraceCheckUtils]: 74: Hoare triple {35169#true} assume !(0 == ~cond); {35169#true} is VALID [2022-04-08 03:54:36,516 INFO L290 TraceCheckUtils]: 73: Hoare triple {35169#true} ~cond := #in~cond; {35169#true} is VALID [2022-04-08 03:54:36,516 INFO L272 TraceCheckUtils]: 72: Hoare triple {35641#(< main_~r~0 (* main_~j~0 2))} call __VERIFIER_assert((if 1 <= ~i~0 then 1 else 0)); {35169#true} is VALID [2022-04-08 03:54:36,516 INFO L290 TraceCheckUtils]: 71: Hoare triple {35641#(< main_~r~0 (* main_~j~0 2))} assume !(0 != #t~nondet5);havoc #t~nondet5; {35641#(< main_~r~0 (* main_~j~0 2))} is VALID [2022-04-08 03:54:36,517 INFO L290 TraceCheckUtils]: 70: Hoare triple {35641#(< main_~r~0 (* main_~j~0 2))} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {35641#(< main_~r~0 (* main_~j~0 2))} is VALID [2022-04-08 03:54:36,517 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {35169#true} {35641#(< main_~r~0 (* main_~j~0 2))} #120#return; {35641#(< main_~r~0 (* main_~j~0 2))} is VALID [2022-04-08 03:54:36,517 INFO L290 TraceCheckUtils]: 68: Hoare triple {35169#true} assume true; {35169#true} is VALID [2022-04-08 03:54:36,518 INFO L290 TraceCheckUtils]: 67: Hoare triple {35169#true} assume !(0 == ~cond); {35169#true} is VALID [2022-04-08 03:54:36,518 INFO L290 TraceCheckUtils]: 66: Hoare triple {35169#true} ~cond := #in~cond; {35169#true} is VALID [2022-04-08 03:54:36,518 INFO L272 TraceCheckUtils]: 65: Hoare triple {35641#(< main_~r~0 (* main_~j~0 2))} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {35169#true} is VALID [2022-04-08 03:54:36,518 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {35169#true} {35641#(< main_~r~0 (* main_~j~0 2))} #118#return; {35641#(< main_~r~0 (* main_~j~0 2))} is VALID [2022-04-08 03:54:36,518 INFO L290 TraceCheckUtils]: 63: Hoare triple {35169#true} assume true; {35169#true} is VALID [2022-04-08 03:54:36,518 INFO L290 TraceCheckUtils]: 62: Hoare triple {35169#true} assume !(0 == ~cond); {35169#true} is VALID [2022-04-08 03:54:36,518 INFO L290 TraceCheckUtils]: 61: Hoare triple {35169#true} ~cond := #in~cond; {35169#true} is VALID [2022-04-08 03:54:36,519 INFO L272 TraceCheckUtils]: 60: Hoare triple {35641#(< main_~r~0 (* main_~j~0 2))} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {35169#true} is VALID [2022-04-08 03:54:36,519 INFO L290 TraceCheckUtils]: 59: Hoare triple {35741#(< (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~j~0 2))} assume 0 != #t~nondet4;havoc #t~nondet4;~j~0 := 1 + ~j~0; {35641#(< main_~r~0 (* main_~j~0 2))} is VALID [2022-04-08 03:54:36,520 INFO L290 TraceCheckUtils]: 58: Hoare triple {35741#(< (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~j~0 2))} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {35741#(< (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~j~0 2))} is VALID [2022-04-08 03:54:36,520 INFO L284 TraceCheckUtils]: 57: Hoare quadruple {35169#true} {35741#(< (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~j~0 2))} #116#return; {35741#(< (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~j~0 2))} is VALID [2022-04-08 03:54:36,520 INFO L290 TraceCheckUtils]: 56: Hoare triple {35169#true} assume true; {35169#true} is VALID [2022-04-08 03:54:36,520 INFO L290 TraceCheckUtils]: 55: Hoare triple {35169#true} assume !(0 == ~cond); {35169#true} is VALID [2022-04-08 03:54:36,520 INFO L290 TraceCheckUtils]: 54: Hoare triple {35169#true} ~cond := #in~cond; {35169#true} is VALID [2022-04-08 03:54:36,520 INFO L272 TraceCheckUtils]: 53: Hoare triple {35741#(< (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~j~0 2))} call __VERIFIER_assert((if 1 + ~j~0 <= ~n~0 then 1 else 0)); {35169#true} is VALID [2022-04-08 03:54:36,521 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {35169#true} {35741#(< (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~j~0 2))} #114#return; {35741#(< (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~j~0 2))} is VALID [2022-04-08 03:54:36,521 INFO L290 TraceCheckUtils]: 51: Hoare triple {35169#true} assume true; {35169#true} is VALID [2022-04-08 03:54:36,521 INFO L290 TraceCheckUtils]: 50: Hoare triple {35169#true} assume !(0 == ~cond); {35169#true} is VALID [2022-04-08 03:54:36,521 INFO L290 TraceCheckUtils]: 49: Hoare triple {35169#true} ~cond := #in~cond; {35169#true} is VALID [2022-04-08 03:54:36,521 INFO L272 TraceCheckUtils]: 48: Hoare triple {35741#(< (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~j~0 2))} call __VERIFIER_assert((if 1 <= 1 + ~j~0 then 1 else 0)); {35169#true} is VALID [2022-04-08 03:54:36,522 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {35169#true} {35741#(< (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~j~0 2))} #112#return; {35741#(< (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~j~0 2))} is VALID [2022-04-08 03:54:36,522 INFO L290 TraceCheckUtils]: 46: Hoare triple {35169#true} assume true; {35169#true} is VALID [2022-04-08 03:54:36,522 INFO L290 TraceCheckUtils]: 45: Hoare triple {35169#true} assume !(0 == ~cond); {35169#true} is VALID [2022-04-08 03:54:36,522 INFO L290 TraceCheckUtils]: 44: Hoare triple {35169#true} ~cond := #in~cond; {35169#true} is VALID [2022-04-08 03:54:36,522 INFO L272 TraceCheckUtils]: 43: Hoare triple {35741#(< (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~j~0 2))} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {35169#true} is VALID [2022-04-08 03:54:36,523 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {35169#true} {35741#(< (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~j~0 2))} #110#return; {35741#(< (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~j~0 2))} is VALID [2022-04-08 03:54:36,523 INFO L290 TraceCheckUtils]: 41: Hoare triple {35169#true} assume true; {35169#true} is VALID [2022-04-08 03:54:36,523 INFO L290 TraceCheckUtils]: 40: Hoare triple {35169#true} assume !(0 == ~cond); {35169#true} is VALID [2022-04-08 03:54:36,523 INFO L290 TraceCheckUtils]: 39: Hoare triple {35169#true} ~cond := #in~cond; {35169#true} is VALID [2022-04-08 03:54:36,523 INFO L272 TraceCheckUtils]: 38: Hoare triple {35741#(< (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~j~0 2))} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {35169#true} is VALID [2022-04-08 03:54:36,523 INFO L290 TraceCheckUtils]: 37: Hoare triple {35741#(< (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~j~0 2))} assume ~j~0 < ~r~0; {35741#(< (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~j~0 2))} is VALID [2022-04-08 03:54:36,524 INFO L290 TraceCheckUtils]: 36: Hoare triple {35741#(< (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~j~0 2))} assume !!(~j~0 <= ~r~0); {35741#(< (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~j~0 2))} is VALID [2022-04-08 03:54:36,524 INFO L290 TraceCheckUtils]: 35: Hoare triple {35814#(< (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ (* main_~l~0 2) 2))} assume !!(~r~0 > 1);~i~0 := ~l~0;~j~0 := 2 * ~l~0; {35741#(< (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~j~0 2))} is VALID [2022-04-08 03:54:36,525 INFO L290 TraceCheckUtils]: 34: Hoare triple {35818#(< (div (+ 1 (* (- 1) (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)))) (- 2)) main_~l~0)} #t~post6 := ~l~0;~l~0 := #t~post6 - 1;havoc #t~post6; {35814#(< (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ (* main_~l~0 2) 2))} is VALID [2022-04-08 03:54:36,525 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {35169#true} {35818#(< (div (+ 1 (* (- 1) (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)))) (- 2)) main_~l~0)} #132#return; {35818#(< (div (+ 1 (* (- 1) (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)))) (- 2)) main_~l~0)} is VALID [2022-04-08 03:54:36,525 INFO L290 TraceCheckUtils]: 32: Hoare triple {35169#true} assume true; {35169#true} is VALID [2022-04-08 03:54:36,526 INFO L290 TraceCheckUtils]: 31: Hoare triple {35169#true} assume !(0 == ~cond); {35169#true} is VALID [2022-04-08 03:54:36,526 INFO L290 TraceCheckUtils]: 30: Hoare triple {35169#true} ~cond := #in~cond; {35169#true} is VALID [2022-04-08 03:54:36,526 INFO L272 TraceCheckUtils]: 29: Hoare triple {35818#(< (div (+ 1 (* (- 1) (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)))) (- 2)) main_~l~0)} call __VERIFIER_assert((if ~l~0 <= ~n~0 then 1 else 0)); {35169#true} is VALID [2022-04-08 03:54:36,526 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {35169#true} {35818#(< (div (+ 1 (* (- 1) (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)))) (- 2)) main_~l~0)} #130#return; {35818#(< (div (+ 1 (* (- 1) (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)))) (- 2)) main_~l~0)} is VALID [2022-04-08 03:54:36,526 INFO L290 TraceCheckUtils]: 27: Hoare triple {35169#true} assume true; {35169#true} is VALID [2022-04-08 03:54:36,526 INFO L290 TraceCheckUtils]: 26: Hoare triple {35169#true} assume !(0 == ~cond); {35169#true} is VALID [2022-04-08 03:54:36,526 INFO L290 TraceCheckUtils]: 25: Hoare triple {35169#true} ~cond := #in~cond; {35169#true} is VALID [2022-04-08 03:54:36,527 INFO L272 TraceCheckUtils]: 24: Hoare triple {35818#(< (div (+ 1 (* (- 1) (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)))) (- 2)) main_~l~0)} call __VERIFIER_assert((if 1 <= ~l~0 then 1 else 0)); {35169#true} is VALID [2022-04-08 03:54:36,527 INFO L290 TraceCheckUtils]: 23: Hoare triple {35852#(or (< (div (+ 1 (* (- 1) (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)))) (- 2)) main_~l~0) (not (< 1 main_~l~0)))} assume ~l~0 > 1; {35818#(< (div (+ 1 (* (- 1) (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)))) (- 2)) main_~l~0)} is VALID [2022-04-08 03:54:36,527 INFO L290 TraceCheckUtils]: 22: Hoare triple {35852#(or (< (div (+ 1 (* (- 1) (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)))) (- 2)) main_~l~0) (not (< 1 main_~l~0)))} assume 0 != #t~nondet5;havoc #t~nondet5; {35852#(or (< (div (+ 1 (* (- 1) (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)))) (- 2)) main_~l~0) (not (< 1 main_~l~0)))} is VALID [2022-04-08 03:54:36,528 INFO L290 TraceCheckUtils]: 21: Hoare triple {35852#(or (< (div (+ 1 (* (- 1) (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)))) (- 2)) main_~l~0) (not (< 1 main_~l~0)))} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {35852#(or (< (div (+ 1 (* (- 1) (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)))) (- 2)) main_~l~0) (not (< 1 main_~l~0)))} is VALID [2022-04-08 03:54:36,528 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {35169#true} {35852#(or (< (div (+ 1 (* (- 1) (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)))) (- 2)) main_~l~0) (not (< 1 main_~l~0)))} #120#return; {35852#(or (< (div (+ 1 (* (- 1) (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)))) (- 2)) main_~l~0) (not (< 1 main_~l~0)))} is VALID [2022-04-08 03:54:36,529 INFO L290 TraceCheckUtils]: 19: Hoare triple {35169#true} assume true; {35169#true} is VALID [2022-04-08 03:54:36,529 INFO L290 TraceCheckUtils]: 18: Hoare triple {35169#true} assume !(0 == ~cond); {35169#true} is VALID [2022-04-08 03:54:36,529 INFO L290 TraceCheckUtils]: 17: Hoare triple {35169#true} ~cond := #in~cond; {35169#true} is VALID [2022-04-08 03:54:36,529 INFO L272 TraceCheckUtils]: 16: Hoare triple {35852#(or (< (div (+ 1 (* (- 1) (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)))) (- 2)) main_~l~0) (not (< 1 main_~l~0)))} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {35169#true} is VALID [2022-04-08 03:54:36,529 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {35169#true} {35852#(or (< (div (+ 1 (* (- 1) (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)))) (- 2)) main_~l~0) (not (< 1 main_~l~0)))} #118#return; {35852#(or (< (div (+ 1 (* (- 1) (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)))) (- 2)) main_~l~0) (not (< 1 main_~l~0)))} is VALID [2022-04-08 03:54:36,529 INFO L290 TraceCheckUtils]: 14: Hoare triple {35169#true} assume true; {35169#true} is VALID [2022-04-08 03:54:36,529 INFO L290 TraceCheckUtils]: 13: Hoare triple {35169#true} assume !(0 == ~cond); {35169#true} is VALID [2022-04-08 03:54:36,530 INFO L290 TraceCheckUtils]: 12: Hoare triple {35169#true} ~cond := #in~cond; {35169#true} is VALID [2022-04-08 03:54:36,530 INFO L272 TraceCheckUtils]: 11: Hoare triple {35852#(or (< (div (+ 1 (* (- 1) (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)))) (- 2)) main_~l~0) (not (< 1 main_~l~0)))} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {35169#true} is VALID [2022-04-08 03:54:36,530 INFO L290 TraceCheckUtils]: 10: Hoare triple {35892#(or (not (< 1 main_~l~0)) (<= (div (+ (- 1) (div (+ (- 1) (* (- 1) main_~j~0)) 2)) (- 2)) main_~l~0))} assume !(~j~0 < ~r~0); {35852#(or (< (div (+ 1 (* (- 1) (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)))) (- 2)) main_~l~0) (not (< 1 main_~l~0)))} is VALID [2022-04-08 03:54:36,531 INFO L290 TraceCheckUtils]: 9: Hoare triple {35892#(or (not (< 1 main_~l~0)) (<= (div (+ (- 1) (div (+ (- 1) (* (- 1) main_~j~0)) 2)) (- 2)) main_~l~0))} assume !!(~j~0 <= ~r~0); {35892#(or (not (< 1 main_~l~0)) (<= (div (+ (- 1) (div (+ (- 1) (* (- 1) main_~j~0)) 2)) (- 2)) main_~l~0))} is VALID [2022-04-08 03:54:36,531 INFO L290 TraceCheckUtils]: 8: Hoare triple {35169#true} assume !!(~r~0 > 1);~i~0 := ~l~0;~j~0 := 2 * ~l~0; {35892#(or (not (< 1 main_~l~0)) (<= (div (+ (- 1) (div (+ (- 1) (* (- 1) main_~j~0)) 2)) (- 2)) main_~l~0))} is VALID [2022-04-08 03:54:36,531 INFO L290 TraceCheckUtils]: 7: Hoare triple {35169#true} assume ~l~0 > 1;#t~post2 := ~l~0;~l~0 := #t~post2 - 1;havoc #t~post2; {35169#true} is VALID [2022-04-08 03:54:36,532 INFO L290 TraceCheckUtils]: 6: Hoare triple {35169#true} assume !!(1 <= ~n~0 && ~n~0 <= 1000000);~l~0 := 1 + (if ~n~0 < 0 && 0 != ~n~0 % 2 then 1 + ~n~0 / 2 else ~n~0 / 2);~r~0 := ~n~0; {35169#true} is VALID [2022-04-08 03:54:36,532 INFO L290 TraceCheckUtils]: 5: Hoare triple {35169#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;havoc ~n~0;havoc ~l~0;havoc ~r~0;havoc ~i~0;havoc ~j~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {35169#true} is VALID [2022-04-08 03:54:36,532 INFO L272 TraceCheckUtils]: 4: Hoare triple {35169#true} call #t~ret8 := main(#in~argc, #in~argv.base, #in~argv.offset); {35169#true} is VALID [2022-04-08 03:54:36,532 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35169#true} {35169#true} #138#return; {35169#true} is VALID [2022-04-08 03:54:36,532 INFO L290 TraceCheckUtils]: 2: Hoare triple {35169#true} assume true; {35169#true} is VALID [2022-04-08 03:54:36,532 INFO L290 TraceCheckUtils]: 1: Hoare triple {35169#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(9, 2); {35169#true} is VALID [2022-04-08 03:54:36,532 INFO L272 TraceCheckUtils]: 0: Hoare triple {35169#true} call ULTIMATE.init(); {35169#true} is VALID [2022-04-08 03:54:36,533 INFO L134 CoverageAnalysis]: Checked inductivity of 532 backedges. 44 proven. 8 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2022-04-08 03:54:36,533 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1949085448] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 03:54:36,533 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 03:54:36,533 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 24 [2022-04-08 03:54:36,533 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 03:54:36,533 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1523650620] [2022-04-08 03:54:36,533 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1523650620] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 03:54:36,533 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 03:54:36,534 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-08 03:54:36,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1726654851] [2022-04-08 03:54:36,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 03:54:36,534 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.0) internal successors, (30), 8 states have internal predecessors, (30), 5 states have call successors, (19), 3 states have call predecessors, (19), 1 states have return successors, (17), 5 states have call predecessors, (17), 5 states have call successors, (17) Word has length 111 [2022-04-08 03:54:36,534 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 03:54:36,534 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 3.0) internal successors, (30), 8 states have internal predecessors, (30), 5 states have call successors, (19), 3 states have call predecessors, (19), 1 states have return successors, (17), 5 states have call predecessors, (17), 5 states have call successors, (17) [2022-04-08 03:54:36,580 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 03:54:36,580 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-08 03:54:36,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 03:54:36,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-08 03:54:36,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=477, Unknown=0, NotChecked=0, Total=552 [2022-04-08 03:54:36,581 INFO L87 Difference]: Start difference. First operand 238 states and 354 transitions. Second operand has 10 states, 10 states have (on average 3.0) internal successors, (30), 8 states have internal predecessors, (30), 5 states have call successors, (19), 3 states have call predecessors, (19), 1 states have return successors, (17), 5 states have call predecessors, (17), 5 states have call successors, (17) [2022-04-08 03:54:40,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:54:40,331 INFO L93 Difference]: Finished difference Result 350 states and 539 transitions. [2022-04-08 03:54:40,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-08 03:54:40,331 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.0) internal successors, (30), 8 states have internal predecessors, (30), 5 states have call successors, (19), 3 states have call predecessors, (19), 1 states have return successors, (17), 5 states have call predecessors, (17), 5 states have call successors, (17) Word has length 111 [2022-04-08 03:54:40,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 03:54:40,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 3.0) internal successors, (30), 8 states have internal predecessors, (30), 5 states have call successors, (19), 3 states have call predecessors, (19), 1 states have return successors, (17), 5 states have call predecessors, (17), 5 states have call successors, (17) [2022-04-08 03:54:40,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 151 transitions. [2022-04-08 03:54:40,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 3.0) internal successors, (30), 8 states have internal predecessors, (30), 5 states have call successors, (19), 3 states have call predecessors, (19), 1 states have return successors, (17), 5 states have call predecessors, (17), 5 states have call successors, (17) [2022-04-08 03:54:40,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 151 transitions. [2022-04-08 03:54:40,335 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 151 transitions. [2022-04-08 03:54:40,469 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 151 edges. 151 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:54:40,477 INFO L225 Difference]: With dead ends: 350 [2022-04-08 03:54:40,477 INFO L226 Difference]: Without dead ends: 348 [2022-04-08 03:54:40,477 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 278 GetRequests, 246 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 185 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=151, Invalid=971, Unknown=0, NotChecked=0, Total=1122 [2022-04-08 03:54:40,477 INFO L913 BasicCegarLoop]: 69 mSDtfsCounter, 69 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 709 mSolverCounterSat, 169 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 878 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 169 IncrementalHoareTripleChecker+Valid, 709 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-04-08 03:54:40,478 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [69 Valid, 101 Invalid, 878 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [169 Valid, 709 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-04-08 03:54:40,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348 states. [2022-04-08 03:54:42,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348 to 294. [2022-04-08 03:54:42,182 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 03:54:42,182 INFO L82 GeneralOperation]: Start isEquivalent. First operand 348 states. Second operand has 294 states, 142 states have (on average 1.295774647887324) internal successors, (184), 156 states have internal predecessors, (184), 134 states have call successors, (134), 18 states have call predecessors, (134), 17 states have return successors, (133), 119 states have call predecessors, (133), 133 states have call successors, (133) [2022-04-08 03:54:42,182 INFO L74 IsIncluded]: Start isIncluded. First operand 348 states. Second operand has 294 states, 142 states have (on average 1.295774647887324) internal successors, (184), 156 states have internal predecessors, (184), 134 states have call successors, (134), 18 states have call predecessors, (134), 17 states have return successors, (133), 119 states have call predecessors, (133), 133 states have call successors, (133) [2022-04-08 03:54:42,183 INFO L87 Difference]: Start difference. First operand 348 states. Second operand has 294 states, 142 states have (on average 1.295774647887324) internal successors, (184), 156 states have internal predecessors, (184), 134 states have call successors, (134), 18 states have call predecessors, (134), 17 states have return successors, (133), 119 states have call predecessors, (133), 133 states have call successors, (133) [2022-04-08 03:54:42,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:54:42,190 INFO L93 Difference]: Finished difference Result 348 states and 537 transitions. [2022-04-08 03:54:42,190 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 537 transitions. [2022-04-08 03:54:42,191 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:54:42,191 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:54:42,191 INFO L74 IsIncluded]: Start isIncluded. First operand has 294 states, 142 states have (on average 1.295774647887324) internal successors, (184), 156 states have internal predecessors, (184), 134 states have call successors, (134), 18 states have call predecessors, (134), 17 states have return successors, (133), 119 states have call predecessors, (133), 133 states have call successors, (133) Second operand 348 states. [2022-04-08 03:54:42,191 INFO L87 Difference]: Start difference. First operand has 294 states, 142 states have (on average 1.295774647887324) internal successors, (184), 156 states have internal predecessors, (184), 134 states have call successors, (134), 18 states have call predecessors, (134), 17 states have return successors, (133), 119 states have call predecessors, (133), 133 states have call successors, (133) Second operand 348 states. [2022-04-08 03:54:42,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:54:42,199 INFO L93 Difference]: Finished difference Result 348 states and 537 transitions. [2022-04-08 03:54:42,199 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 537 transitions. [2022-04-08 03:54:42,199 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:54:42,200 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:54:42,200 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 03:54:42,200 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 03:54:42,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 294 states, 142 states have (on average 1.295774647887324) internal successors, (184), 156 states have internal predecessors, (184), 134 states have call successors, (134), 18 states have call predecessors, (134), 17 states have return successors, (133), 119 states have call predecessors, (133), 133 states have call successors, (133) [2022-04-08 03:54:42,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 451 transitions. [2022-04-08 03:54:42,207 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 451 transitions. Word has length 111 [2022-04-08 03:54:42,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 03:54:42,207 INFO L478 AbstractCegarLoop]: Abstraction has 294 states and 451 transitions. [2022-04-08 03:54:42,207 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.0) internal successors, (30), 8 states have internal predecessors, (30), 5 states have call successors, (19), 3 states have call predecessors, (19), 1 states have return successors, (17), 5 states have call predecessors, (17), 5 states have call successors, (17) [2022-04-08 03:54:42,207 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 294 states and 451 transitions. [2022-04-08 03:54:42,739 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 451 edges. 451 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:54:42,739 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 451 transitions. [2022-04-08 03:54:42,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2022-04-08 03:54:42,740 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 03:54:42,740 INFO L499 BasicCegarLoop]: trace histogram [17, 16, 16, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 03:54:42,756 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 03:54:42,955 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 03:54:42,956 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 03:54:42,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 03:54:42,956 INFO L85 PathProgramCache]: Analyzing trace with hash 977427545, now seen corresponding path program 1 times [2022-04-08 03:54:42,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 03:54:42,956 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1929612400] [2022-04-08 03:54:42,957 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 03:54:42,957 INFO L85 PathProgramCache]: Analyzing trace with hash 977427545, now seen corresponding path program 2 times [2022-04-08 03:54:42,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 03:54:42,957 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [366050257] [2022-04-08 03:54:42,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 03:54:42,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 03:54:42,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:54:43,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 03:54:43,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:54:43,041 INFO L290 TraceCheckUtils]: 0: Hoare triple {38008#(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(9, 2); {37933#true} is VALID [2022-04-08 03:54:43,041 INFO L290 TraceCheckUtils]: 1: Hoare triple {37933#true} assume true; {37933#true} is VALID [2022-04-08 03:54:43,041 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {37933#true} {37933#true} #138#return; {37933#true} is VALID [2022-04-08 03:54:43,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-08 03:54:43,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:54:43,049 INFO L290 TraceCheckUtils]: 0: Hoare triple {37933#true} ~cond := #in~cond; {37933#true} is VALID [2022-04-08 03:54:43,049 INFO L290 TraceCheckUtils]: 1: Hoare triple {37933#true} assume !(0 == ~cond); {37933#true} is VALID [2022-04-08 03:54:43,050 INFO L290 TraceCheckUtils]: 2: Hoare triple {37933#true} assume true; {37933#true} is VALID [2022-04-08 03:54:43,050 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {37933#true} {37933#true} #118#return; {37933#true} is VALID [2022-04-08 03:54:43,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-04-08 03:54:43,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:54:43,052 INFO L290 TraceCheckUtils]: 0: Hoare triple {37933#true} ~cond := #in~cond; {37933#true} is VALID [2022-04-08 03:54:43,052 INFO L290 TraceCheckUtils]: 1: Hoare triple {37933#true} assume !(0 == ~cond); {37933#true} is VALID [2022-04-08 03:54:43,052 INFO L290 TraceCheckUtils]: 2: Hoare triple {37933#true} assume true; {37933#true} is VALID [2022-04-08 03:54:43,052 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {37933#true} {37933#true} #120#return; {37933#true} is VALID [2022-04-08 03:54:43,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-04-08 03:54:43,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:54:43,055 INFO L290 TraceCheckUtils]: 0: Hoare triple {37933#true} ~cond := #in~cond; {37933#true} is VALID [2022-04-08 03:54:43,055 INFO L290 TraceCheckUtils]: 1: Hoare triple {37933#true} assume !(0 == ~cond); {37933#true} is VALID [2022-04-08 03:54:43,055 INFO L290 TraceCheckUtils]: 2: Hoare triple {37933#true} assume true; {37933#true} is VALID [2022-04-08 03:54:43,055 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {37933#true} {37946#(<= 2 main_~l~0)} #130#return; {37946#(<= 2 main_~l~0)} is VALID [2022-04-08 03:54:43,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-04-08 03:54:43,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:54:43,057 INFO L290 TraceCheckUtils]: 0: Hoare triple {37933#true} ~cond := #in~cond; {37933#true} is VALID [2022-04-08 03:54:43,057 INFO L290 TraceCheckUtils]: 1: Hoare triple {37933#true} assume !(0 == ~cond); {37933#true} is VALID [2022-04-08 03:54:43,058 INFO L290 TraceCheckUtils]: 2: Hoare triple {37933#true} assume true; {37933#true} is VALID [2022-04-08 03:54:43,058 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {37933#true} {37946#(<= 2 main_~l~0)} #132#return; {37946#(<= 2 main_~l~0)} is VALID [2022-04-08 03:54:43,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-04-08 03:54:43,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:54:43,060 INFO L290 TraceCheckUtils]: 0: Hoare triple {37933#true} ~cond := #in~cond; {37933#true} is VALID [2022-04-08 03:54:43,060 INFO L290 TraceCheckUtils]: 1: Hoare triple {37933#true} assume !(0 == ~cond); {37933#true} is VALID [2022-04-08 03:54:43,060 INFO L290 TraceCheckUtils]: 2: Hoare triple {37933#true} assume true; {37933#true} is VALID [2022-04-08 03:54:43,061 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {37933#true} {37956#(<= 2 main_~j~0)} #110#return; {37956#(<= 2 main_~j~0)} is VALID [2022-04-08 03:54:43,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-04-08 03:54:43,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:54:43,065 INFO L290 TraceCheckUtils]: 0: Hoare triple {37933#true} ~cond := #in~cond; {37933#true} is VALID [2022-04-08 03:54:43,066 INFO L290 TraceCheckUtils]: 1: Hoare triple {37933#true} assume !(0 == ~cond); {37933#true} is VALID [2022-04-08 03:54:43,066 INFO L290 TraceCheckUtils]: 2: Hoare triple {37933#true} assume true; {37933#true} is VALID [2022-04-08 03:54:43,066 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {37933#true} {37956#(<= 2 main_~j~0)} #112#return; {37956#(<= 2 main_~j~0)} is VALID [2022-04-08 03:54:43,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-04-08 03:54:43,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:54:43,068 INFO L290 TraceCheckUtils]: 0: Hoare triple {37933#true} ~cond := #in~cond; {37933#true} is VALID [2022-04-08 03:54:43,069 INFO L290 TraceCheckUtils]: 1: Hoare triple {37933#true} assume !(0 == ~cond); {37933#true} is VALID [2022-04-08 03:54:43,069 INFO L290 TraceCheckUtils]: 2: Hoare triple {37933#true} assume true; {37933#true} is VALID [2022-04-08 03:54:43,069 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {37933#true} {37956#(<= 2 main_~j~0)} #114#return; {37956#(<= 2 main_~j~0)} is VALID [2022-04-08 03:54:43,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-04-08 03:54:43,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:54:43,072 INFO L290 TraceCheckUtils]: 0: Hoare triple {37933#true} ~cond := #in~cond; {37933#true} is VALID [2022-04-08 03:54:43,072 INFO L290 TraceCheckUtils]: 1: Hoare triple {37933#true} assume !(0 == ~cond); {37933#true} is VALID [2022-04-08 03:54:43,072 INFO L290 TraceCheckUtils]: 2: Hoare triple {37933#true} assume true; {37933#true} is VALID [2022-04-08 03:54:43,073 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {37933#true} {37956#(<= 2 main_~j~0)} #116#return; {37956#(<= 2 main_~j~0)} is VALID [2022-04-08 03:54:43,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-04-08 03:54:43,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:54:43,075 INFO L290 TraceCheckUtils]: 0: Hoare triple {37933#true} ~cond := #in~cond; {37933#true} is VALID [2022-04-08 03:54:43,075 INFO L290 TraceCheckUtils]: 1: Hoare triple {37933#true} assume !(0 == ~cond); {37933#true} is VALID [2022-04-08 03:54:43,075 INFO L290 TraceCheckUtils]: 2: Hoare triple {37933#true} assume true; {37933#true} is VALID [2022-04-08 03:54:43,075 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {37933#true} {37956#(<= 2 main_~j~0)} #118#return; {37956#(<= 2 main_~j~0)} is VALID [2022-04-08 03:54:43,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-04-08 03:54:43,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:54:43,077 INFO L290 TraceCheckUtils]: 0: Hoare triple {37933#true} ~cond := #in~cond; {37933#true} is VALID [2022-04-08 03:54:43,077 INFO L290 TraceCheckUtils]: 1: Hoare triple {37933#true} assume !(0 == ~cond); {37933#true} is VALID [2022-04-08 03:54:43,077 INFO L290 TraceCheckUtils]: 2: Hoare triple {37933#true} assume true; {37933#true} is VALID [2022-04-08 03:54:43,078 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {37933#true} {37956#(<= 2 main_~j~0)} #120#return; {37956#(<= 2 main_~j~0)} is VALID [2022-04-08 03:54:43,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-04-08 03:54:43,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:54:43,080 INFO L290 TraceCheckUtils]: 0: Hoare triple {37933#true} ~cond := #in~cond; {37933#true} is VALID [2022-04-08 03:54:43,080 INFO L290 TraceCheckUtils]: 1: Hoare triple {37933#true} assume !(0 == ~cond); {37933#true} is VALID [2022-04-08 03:54:43,080 INFO L290 TraceCheckUtils]: 2: Hoare triple {37933#true} assume true; {37933#true} is VALID [2022-04-08 03:54:43,080 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {37933#true} {37956#(<= 2 main_~j~0)} #122#return; {37956#(<= 2 main_~j~0)} is VALID [2022-04-08 03:54:43,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-04-08 03:54:43,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:54:43,082 INFO L290 TraceCheckUtils]: 0: Hoare triple {37933#true} ~cond := #in~cond; {37933#true} is VALID [2022-04-08 03:54:43,082 INFO L290 TraceCheckUtils]: 1: Hoare triple {37933#true} assume !(0 == ~cond); {37933#true} is VALID [2022-04-08 03:54:43,082 INFO L290 TraceCheckUtils]: 2: Hoare triple {37933#true} assume true; {37933#true} is VALID [2022-04-08 03:54:43,083 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {37933#true} {37956#(<= 2 main_~j~0)} #124#return; {37956#(<= 2 main_~j~0)} is VALID [2022-04-08 03:54:43,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-04-08 03:54:43,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:54:43,085 INFO L290 TraceCheckUtils]: 0: Hoare triple {37933#true} ~cond := #in~cond; {37933#true} is VALID [2022-04-08 03:54:43,085 INFO L290 TraceCheckUtils]: 1: Hoare triple {37933#true} assume !(0 == ~cond); {37933#true} is VALID [2022-04-08 03:54:43,085 INFO L290 TraceCheckUtils]: 2: Hoare triple {37933#true} assume true; {37933#true} is VALID [2022-04-08 03:54:43,085 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {37933#true} {37956#(<= 2 main_~j~0)} #126#return; {37956#(<= 2 main_~j~0)} is VALID [2022-04-08 03:54:43,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-04-08 03:54:43,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:54:43,087 INFO L290 TraceCheckUtils]: 0: Hoare triple {37933#true} ~cond := #in~cond; {37933#true} is VALID [2022-04-08 03:54:43,088 INFO L290 TraceCheckUtils]: 1: Hoare triple {37933#true} assume !(0 == ~cond); {37933#true} is VALID [2022-04-08 03:54:43,088 INFO L290 TraceCheckUtils]: 2: Hoare triple {37933#true} assume true; {37933#true} is VALID [2022-04-08 03:54:43,088 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {37933#true} {37956#(<= 2 main_~j~0)} #128#return; {37956#(<= 2 main_~j~0)} is VALID [2022-04-08 03:54:43,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-04-08 03:54:43,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:54:43,090 INFO L290 TraceCheckUtils]: 0: Hoare triple {37933#true} ~cond := #in~cond; {37933#true} is VALID [2022-04-08 03:54:43,090 INFO L290 TraceCheckUtils]: 1: Hoare triple {37933#true} assume !(0 == ~cond); {37933#true} is VALID [2022-04-08 03:54:43,090 INFO L290 TraceCheckUtils]: 2: Hoare triple {37933#true} assume true; {37933#true} is VALID [2022-04-08 03:54:43,091 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {37933#true} {37997#(<= 2 main_~i~0)} #118#return; {37997#(<= 2 main_~i~0)} is VALID [2022-04-08 03:54:43,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-04-08 03:54:43,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:54:43,093 INFO L290 TraceCheckUtils]: 0: Hoare triple {37933#true} ~cond := #in~cond; {37933#true} is VALID [2022-04-08 03:54:43,093 INFO L290 TraceCheckUtils]: 1: Hoare triple {37933#true} assume !(0 == ~cond); {37933#true} is VALID [2022-04-08 03:54:43,093 INFO L290 TraceCheckUtils]: 2: Hoare triple {37933#true} assume true; {37933#true} is VALID [2022-04-08 03:54:43,093 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {37933#true} {37997#(<= 2 main_~i~0)} #120#return; {37997#(<= 2 main_~i~0)} is VALID [2022-04-08 03:54:43,094 INFO L272 TraceCheckUtils]: 0: Hoare triple {37933#true} call ULTIMATE.init(); {38008#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 03:54:43,094 INFO L290 TraceCheckUtils]: 1: Hoare triple {38008#(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(9, 2); {37933#true} is VALID [2022-04-08 03:54:43,094 INFO L290 TraceCheckUtils]: 2: Hoare triple {37933#true} assume true; {37933#true} is VALID [2022-04-08 03:54:43,094 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {37933#true} {37933#true} #138#return; {37933#true} is VALID [2022-04-08 03:54:43,094 INFO L272 TraceCheckUtils]: 4: Hoare triple {37933#true} call #t~ret8 := main(#in~argc, #in~argv.base, #in~argv.offset); {37933#true} is VALID [2022-04-08 03:54:43,094 INFO L290 TraceCheckUtils]: 5: Hoare triple {37933#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;havoc ~n~0;havoc ~l~0;havoc ~r~0;havoc ~i~0;havoc ~j~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {37933#true} is VALID [2022-04-08 03:54:43,094 INFO L290 TraceCheckUtils]: 6: Hoare triple {37933#true} assume !!(1 <= ~n~0 && ~n~0 <= 1000000);~l~0 := 1 + (if ~n~0 < 0 && 0 != ~n~0 % 2 then 1 + ~n~0 / 2 else ~n~0 / 2);~r~0 := ~n~0; {37933#true} is VALID [2022-04-08 03:54:43,095 INFO L290 TraceCheckUtils]: 7: Hoare triple {37933#true} assume ~l~0 > 1;#t~post2 := ~l~0;~l~0 := #t~post2 - 1;havoc #t~post2; {37933#true} is VALID [2022-04-08 03:54:43,095 INFO L290 TraceCheckUtils]: 8: Hoare triple {37933#true} assume !!(~r~0 > 1);~i~0 := ~l~0;~j~0 := 2 * ~l~0; {37933#true} is VALID [2022-04-08 03:54:43,095 INFO L290 TraceCheckUtils]: 9: Hoare triple {37933#true} assume !!(~j~0 <= ~r~0); {37933#true} is VALID [2022-04-08 03:54:43,095 INFO L290 TraceCheckUtils]: 10: Hoare triple {37933#true} assume !(~j~0 < ~r~0); {37933#true} is VALID [2022-04-08 03:54:43,095 INFO L272 TraceCheckUtils]: 11: Hoare triple {37933#true} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {37933#true} is VALID [2022-04-08 03:54:43,095 INFO L290 TraceCheckUtils]: 12: Hoare triple {37933#true} ~cond := #in~cond; {37933#true} is VALID [2022-04-08 03:54:43,095 INFO L290 TraceCheckUtils]: 13: Hoare triple {37933#true} assume !(0 == ~cond); {37933#true} is VALID [2022-04-08 03:54:43,095 INFO L290 TraceCheckUtils]: 14: Hoare triple {37933#true} assume true; {37933#true} is VALID [2022-04-08 03:54:43,095 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {37933#true} {37933#true} #118#return; {37933#true} is VALID [2022-04-08 03:54:43,095 INFO L272 TraceCheckUtils]: 16: Hoare triple {37933#true} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {37933#true} is VALID [2022-04-08 03:54:43,096 INFO L290 TraceCheckUtils]: 17: Hoare triple {37933#true} ~cond := #in~cond; {37933#true} is VALID [2022-04-08 03:54:43,096 INFO L290 TraceCheckUtils]: 18: Hoare triple {37933#true} assume !(0 == ~cond); {37933#true} is VALID [2022-04-08 03:54:43,096 INFO L290 TraceCheckUtils]: 19: Hoare triple {37933#true} assume true; {37933#true} is VALID [2022-04-08 03:54:43,096 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {37933#true} {37933#true} #120#return; {37933#true} is VALID [2022-04-08 03:54:43,096 INFO L290 TraceCheckUtils]: 21: Hoare triple {37933#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {37933#true} is VALID [2022-04-08 03:54:43,096 INFO L290 TraceCheckUtils]: 22: Hoare triple {37933#true} assume 0 != #t~nondet5;havoc #t~nondet5; {37933#true} is VALID [2022-04-08 03:54:43,097 INFO L290 TraceCheckUtils]: 23: Hoare triple {37933#true} assume ~l~0 > 1; {37946#(<= 2 main_~l~0)} is VALID [2022-04-08 03:54:43,097 INFO L272 TraceCheckUtils]: 24: Hoare triple {37946#(<= 2 main_~l~0)} call __VERIFIER_assert((if 1 <= ~l~0 then 1 else 0)); {37933#true} is VALID [2022-04-08 03:54:43,097 INFO L290 TraceCheckUtils]: 25: Hoare triple {37933#true} ~cond := #in~cond; {37933#true} is VALID [2022-04-08 03:54:43,097 INFO L290 TraceCheckUtils]: 26: Hoare triple {37933#true} assume !(0 == ~cond); {37933#true} is VALID [2022-04-08 03:54:43,097 INFO L290 TraceCheckUtils]: 27: Hoare triple {37933#true} assume true; {37933#true} is VALID [2022-04-08 03:54:43,097 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {37933#true} {37946#(<= 2 main_~l~0)} #130#return; {37946#(<= 2 main_~l~0)} is VALID [2022-04-08 03:54:43,097 INFO L272 TraceCheckUtils]: 29: Hoare triple {37946#(<= 2 main_~l~0)} call __VERIFIER_assert((if ~l~0 <= ~n~0 then 1 else 0)); {37933#true} is VALID [2022-04-08 03:54:43,098 INFO L290 TraceCheckUtils]: 30: Hoare triple {37933#true} ~cond := #in~cond; {37933#true} is VALID [2022-04-08 03:54:43,098 INFO L290 TraceCheckUtils]: 31: Hoare triple {37933#true} assume !(0 == ~cond); {37933#true} is VALID [2022-04-08 03:54:43,098 INFO L290 TraceCheckUtils]: 32: Hoare triple {37933#true} assume true; {37933#true} is VALID [2022-04-08 03:54:43,098 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {37933#true} {37946#(<= 2 main_~l~0)} #132#return; {37946#(<= 2 main_~l~0)} is VALID [2022-04-08 03:54:43,099 INFO L290 TraceCheckUtils]: 34: Hoare triple {37946#(<= 2 main_~l~0)} #t~post6 := ~l~0;~l~0 := #t~post6 - 1;havoc #t~post6; {37955#(<= 1 main_~l~0)} is VALID [2022-04-08 03:54:43,099 INFO L290 TraceCheckUtils]: 35: Hoare triple {37955#(<= 1 main_~l~0)} assume !!(~r~0 > 1);~i~0 := ~l~0;~j~0 := 2 * ~l~0; {37956#(<= 2 main_~j~0)} is VALID [2022-04-08 03:54:43,099 INFO L290 TraceCheckUtils]: 36: Hoare triple {37956#(<= 2 main_~j~0)} assume !!(~j~0 <= ~r~0); {37956#(<= 2 main_~j~0)} is VALID [2022-04-08 03:54:43,100 INFO L290 TraceCheckUtils]: 37: Hoare triple {37956#(<= 2 main_~j~0)} assume ~j~0 < ~r~0; {37956#(<= 2 main_~j~0)} is VALID [2022-04-08 03:54:43,100 INFO L272 TraceCheckUtils]: 38: Hoare triple {37956#(<= 2 main_~j~0)} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {37933#true} is VALID [2022-04-08 03:54:43,100 INFO L290 TraceCheckUtils]: 39: Hoare triple {37933#true} ~cond := #in~cond; {37933#true} is VALID [2022-04-08 03:54:43,100 INFO L290 TraceCheckUtils]: 40: Hoare triple {37933#true} assume !(0 == ~cond); {37933#true} is VALID [2022-04-08 03:54:43,100 INFO L290 TraceCheckUtils]: 41: Hoare triple {37933#true} assume true; {37933#true} is VALID [2022-04-08 03:54:43,100 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {37933#true} {37956#(<= 2 main_~j~0)} #110#return; {37956#(<= 2 main_~j~0)} is VALID [2022-04-08 03:54:43,100 INFO L272 TraceCheckUtils]: 43: Hoare triple {37956#(<= 2 main_~j~0)} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {37933#true} is VALID [2022-04-08 03:54:43,101 INFO L290 TraceCheckUtils]: 44: Hoare triple {37933#true} ~cond := #in~cond; {37933#true} is VALID [2022-04-08 03:54:43,101 INFO L290 TraceCheckUtils]: 45: Hoare triple {37933#true} assume !(0 == ~cond); {37933#true} is VALID [2022-04-08 03:54:43,101 INFO L290 TraceCheckUtils]: 46: Hoare triple {37933#true} assume true; {37933#true} is VALID [2022-04-08 03:54:43,101 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {37933#true} {37956#(<= 2 main_~j~0)} #112#return; {37956#(<= 2 main_~j~0)} is VALID [2022-04-08 03:54:43,101 INFO L272 TraceCheckUtils]: 48: Hoare triple {37956#(<= 2 main_~j~0)} call __VERIFIER_assert((if 1 <= 1 + ~j~0 then 1 else 0)); {37933#true} is VALID [2022-04-08 03:54:43,101 INFO L290 TraceCheckUtils]: 49: Hoare triple {37933#true} ~cond := #in~cond; {37933#true} is VALID [2022-04-08 03:54:43,101 INFO L290 TraceCheckUtils]: 50: Hoare triple {37933#true} assume !(0 == ~cond); {37933#true} is VALID [2022-04-08 03:54:43,101 INFO L290 TraceCheckUtils]: 51: Hoare triple {37933#true} assume true; {37933#true} is VALID [2022-04-08 03:54:43,102 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {37933#true} {37956#(<= 2 main_~j~0)} #114#return; {37956#(<= 2 main_~j~0)} is VALID [2022-04-08 03:54:43,102 INFO L272 TraceCheckUtils]: 53: Hoare triple {37956#(<= 2 main_~j~0)} call __VERIFIER_assert((if 1 + ~j~0 <= ~n~0 then 1 else 0)); {37933#true} is VALID [2022-04-08 03:54:43,102 INFO L290 TraceCheckUtils]: 54: Hoare triple {37933#true} ~cond := #in~cond; {37933#true} is VALID [2022-04-08 03:54:43,102 INFO L290 TraceCheckUtils]: 55: Hoare triple {37933#true} assume !(0 == ~cond); {37933#true} is VALID [2022-04-08 03:54:43,102 INFO L290 TraceCheckUtils]: 56: Hoare triple {37933#true} assume true; {37933#true} is VALID [2022-04-08 03:54:43,103 INFO L284 TraceCheckUtils]: 57: Hoare quadruple {37933#true} {37956#(<= 2 main_~j~0)} #116#return; {37956#(<= 2 main_~j~0)} is VALID [2022-04-08 03:54:43,103 INFO L290 TraceCheckUtils]: 58: Hoare triple {37956#(<= 2 main_~j~0)} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {37956#(<= 2 main_~j~0)} is VALID [2022-04-08 03:54:43,103 INFO L290 TraceCheckUtils]: 59: Hoare triple {37956#(<= 2 main_~j~0)} assume !(0 != #t~nondet4);havoc #t~nondet4; {37956#(<= 2 main_~j~0)} is VALID [2022-04-08 03:54:43,103 INFO L272 TraceCheckUtils]: 60: Hoare triple {37956#(<= 2 main_~j~0)} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {37933#true} is VALID [2022-04-08 03:54:43,103 INFO L290 TraceCheckUtils]: 61: Hoare triple {37933#true} ~cond := #in~cond; {37933#true} is VALID [2022-04-08 03:54:43,103 INFO L290 TraceCheckUtils]: 62: Hoare triple {37933#true} assume !(0 == ~cond); {37933#true} is VALID [2022-04-08 03:54:43,104 INFO L290 TraceCheckUtils]: 63: Hoare triple {37933#true} assume true; {37933#true} is VALID [2022-04-08 03:54:43,104 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {37933#true} {37956#(<= 2 main_~j~0)} #118#return; {37956#(<= 2 main_~j~0)} is VALID [2022-04-08 03:54:43,104 INFO L272 TraceCheckUtils]: 65: Hoare triple {37956#(<= 2 main_~j~0)} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {37933#true} is VALID [2022-04-08 03:54:43,104 INFO L290 TraceCheckUtils]: 66: Hoare triple {37933#true} ~cond := #in~cond; {37933#true} is VALID [2022-04-08 03:54:43,104 INFO L290 TraceCheckUtils]: 67: Hoare triple {37933#true} assume !(0 == ~cond); {37933#true} is VALID [2022-04-08 03:54:43,104 INFO L290 TraceCheckUtils]: 68: Hoare triple {37933#true} assume true; {37933#true} is VALID [2022-04-08 03:54:43,105 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {37933#true} {37956#(<= 2 main_~j~0)} #120#return; {37956#(<= 2 main_~j~0)} is VALID [2022-04-08 03:54:43,105 INFO L290 TraceCheckUtils]: 70: Hoare triple {37956#(<= 2 main_~j~0)} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {37956#(<= 2 main_~j~0)} is VALID [2022-04-08 03:54:43,105 INFO L290 TraceCheckUtils]: 71: Hoare triple {37956#(<= 2 main_~j~0)} assume !(0 != #t~nondet5);havoc #t~nondet5; {37956#(<= 2 main_~j~0)} is VALID [2022-04-08 03:54:43,105 INFO L272 TraceCheckUtils]: 72: Hoare triple {37956#(<= 2 main_~j~0)} call __VERIFIER_assert((if 1 <= ~i~0 then 1 else 0)); {37933#true} is VALID [2022-04-08 03:54:43,105 INFO L290 TraceCheckUtils]: 73: Hoare triple {37933#true} ~cond := #in~cond; {37933#true} is VALID [2022-04-08 03:54:43,106 INFO L290 TraceCheckUtils]: 74: Hoare triple {37933#true} assume !(0 == ~cond); {37933#true} is VALID [2022-04-08 03:54:43,106 INFO L290 TraceCheckUtils]: 75: Hoare triple {37933#true} assume true; {37933#true} is VALID [2022-04-08 03:54:43,106 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {37933#true} {37956#(<= 2 main_~j~0)} #122#return; {37956#(<= 2 main_~j~0)} is VALID [2022-04-08 03:54:43,106 INFO L272 TraceCheckUtils]: 77: Hoare triple {37956#(<= 2 main_~j~0)} call __VERIFIER_assert((if ~i~0 <= ~n~0 then 1 else 0)); {37933#true} is VALID [2022-04-08 03:54:43,106 INFO L290 TraceCheckUtils]: 78: Hoare triple {37933#true} ~cond := #in~cond; {37933#true} is VALID [2022-04-08 03:54:43,106 INFO L290 TraceCheckUtils]: 79: Hoare triple {37933#true} assume !(0 == ~cond); {37933#true} is VALID [2022-04-08 03:54:43,106 INFO L290 TraceCheckUtils]: 80: Hoare triple {37933#true} assume true; {37933#true} is VALID [2022-04-08 03:54:43,107 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {37933#true} {37956#(<= 2 main_~j~0)} #124#return; {37956#(<= 2 main_~j~0)} is VALID [2022-04-08 03:54:43,107 INFO L272 TraceCheckUtils]: 82: Hoare triple {37956#(<= 2 main_~j~0)} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {37933#true} is VALID [2022-04-08 03:54:43,107 INFO L290 TraceCheckUtils]: 83: Hoare triple {37933#true} ~cond := #in~cond; {37933#true} is VALID [2022-04-08 03:54:43,107 INFO L290 TraceCheckUtils]: 84: Hoare triple {37933#true} assume !(0 == ~cond); {37933#true} is VALID [2022-04-08 03:54:43,107 INFO L290 TraceCheckUtils]: 85: Hoare triple {37933#true} assume true; {37933#true} is VALID [2022-04-08 03:54:43,108 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {37933#true} {37956#(<= 2 main_~j~0)} #126#return; {37956#(<= 2 main_~j~0)} is VALID [2022-04-08 03:54:43,108 INFO L272 TraceCheckUtils]: 87: Hoare triple {37956#(<= 2 main_~j~0)} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {37933#true} is VALID [2022-04-08 03:54:43,108 INFO L290 TraceCheckUtils]: 88: Hoare triple {37933#true} ~cond := #in~cond; {37933#true} is VALID [2022-04-08 03:54:43,108 INFO L290 TraceCheckUtils]: 89: Hoare triple {37933#true} assume !(0 == ~cond); {37933#true} is VALID [2022-04-08 03:54:43,108 INFO L290 TraceCheckUtils]: 90: Hoare triple {37933#true} assume true; {37933#true} is VALID [2022-04-08 03:54:43,108 INFO L284 TraceCheckUtils]: 91: Hoare quadruple {37933#true} {37956#(<= 2 main_~j~0)} #128#return; {37956#(<= 2 main_~j~0)} is VALID [2022-04-08 03:54:43,109 INFO L290 TraceCheckUtils]: 92: Hoare triple {37956#(<= 2 main_~j~0)} ~i~0 := ~j~0;~j~0 := 2 * ~j~0; {37997#(<= 2 main_~i~0)} is VALID [2022-04-08 03:54:43,109 INFO L290 TraceCheckUtils]: 93: Hoare triple {37997#(<= 2 main_~i~0)} assume !!(~j~0 <= ~r~0); {37997#(<= 2 main_~i~0)} is VALID [2022-04-08 03:54:43,109 INFO L290 TraceCheckUtils]: 94: Hoare triple {37997#(<= 2 main_~i~0)} assume !(~j~0 < ~r~0); {37997#(<= 2 main_~i~0)} is VALID [2022-04-08 03:54:43,109 INFO L272 TraceCheckUtils]: 95: Hoare triple {37997#(<= 2 main_~i~0)} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {37933#true} is VALID [2022-04-08 03:54:43,109 INFO L290 TraceCheckUtils]: 96: Hoare triple {37933#true} ~cond := #in~cond; {37933#true} is VALID [2022-04-08 03:54:43,110 INFO L290 TraceCheckUtils]: 97: Hoare triple {37933#true} assume !(0 == ~cond); {37933#true} is VALID [2022-04-08 03:54:43,110 INFO L290 TraceCheckUtils]: 98: Hoare triple {37933#true} assume true; {37933#true} is VALID [2022-04-08 03:54:43,110 INFO L284 TraceCheckUtils]: 99: Hoare quadruple {37933#true} {37997#(<= 2 main_~i~0)} #118#return; {37997#(<= 2 main_~i~0)} is VALID [2022-04-08 03:54:43,110 INFO L272 TraceCheckUtils]: 100: Hoare triple {37997#(<= 2 main_~i~0)} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {37933#true} is VALID [2022-04-08 03:54:43,110 INFO L290 TraceCheckUtils]: 101: Hoare triple {37933#true} ~cond := #in~cond; {37933#true} is VALID [2022-04-08 03:54:43,110 INFO L290 TraceCheckUtils]: 102: Hoare triple {37933#true} assume !(0 == ~cond); {37933#true} is VALID [2022-04-08 03:54:43,110 INFO L290 TraceCheckUtils]: 103: Hoare triple {37933#true} assume true; {37933#true} is VALID [2022-04-08 03:54:43,111 INFO L284 TraceCheckUtils]: 104: Hoare quadruple {37933#true} {37997#(<= 2 main_~i~0)} #120#return; {37997#(<= 2 main_~i~0)} is VALID [2022-04-08 03:54:43,111 INFO L290 TraceCheckUtils]: 105: Hoare triple {37997#(<= 2 main_~i~0)} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {37997#(<= 2 main_~i~0)} is VALID [2022-04-08 03:54:43,111 INFO L290 TraceCheckUtils]: 106: Hoare triple {37997#(<= 2 main_~i~0)} assume !(0 != #t~nondet5);havoc #t~nondet5; {37997#(<= 2 main_~i~0)} is VALID [2022-04-08 03:54:43,112 INFO L272 TraceCheckUtils]: 107: Hoare triple {37997#(<= 2 main_~i~0)} call __VERIFIER_assert((if 1 <= ~i~0 then 1 else 0)); {38006#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 03:54:43,112 INFO L290 TraceCheckUtils]: 108: Hoare triple {38006#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {38007#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 03:54:43,112 INFO L290 TraceCheckUtils]: 109: Hoare triple {38007#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {37934#false} is VALID [2022-04-08 03:54:43,113 INFO L290 TraceCheckUtils]: 110: Hoare triple {37934#false} assume !false; {37934#false} is VALID [2022-04-08 03:54:43,113 INFO L134 CoverageAnalysis]: Checked inductivity of 532 backedges. 45 proven. 7 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2022-04-08 03:54:43,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 03:54:43,113 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [366050257] [2022-04-08 03:54:43,113 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [366050257] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 03:54:43,113 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1442328792] [2022-04-08 03:54:43,113 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 03:54:43,114 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 03:54:43,114 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 03:54:43,115 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 03:54:43,116 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 03:54:43,170 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 03:54:43,170 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 03:54:43,170 INFO L263 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-08 03:54:43,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:54:43,188 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 03:54:45,711 INFO L272 TraceCheckUtils]: 0: Hoare triple {37933#true} call ULTIMATE.init(); {37933#true} is VALID [2022-04-08 03:54:45,712 INFO L290 TraceCheckUtils]: 1: Hoare triple {37933#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(9, 2); {37933#true} is VALID [2022-04-08 03:54:45,712 INFO L290 TraceCheckUtils]: 2: Hoare triple {37933#true} assume true; {37933#true} is VALID [2022-04-08 03:54:45,712 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {37933#true} {37933#true} #138#return; {37933#true} is VALID [2022-04-08 03:54:45,712 INFO L272 TraceCheckUtils]: 4: Hoare triple {37933#true} call #t~ret8 := main(#in~argc, #in~argv.base, #in~argv.offset); {37933#true} is VALID [2022-04-08 03:54:45,712 INFO L290 TraceCheckUtils]: 5: Hoare triple {37933#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;havoc ~n~0;havoc ~l~0;havoc ~r~0;havoc ~i~0;havoc ~j~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {37933#true} is VALID [2022-04-08 03:54:45,712 INFO L290 TraceCheckUtils]: 6: Hoare triple {37933#true} assume !!(1 <= ~n~0 && ~n~0 <= 1000000);~l~0 := 1 + (if ~n~0 < 0 && 0 != ~n~0 % 2 then 1 + ~n~0 / 2 else ~n~0 / 2);~r~0 := ~n~0; {37933#true} is VALID [2022-04-08 03:54:45,712 INFO L290 TraceCheckUtils]: 7: Hoare triple {37933#true} assume ~l~0 > 1;#t~post2 := ~l~0;~l~0 := #t~post2 - 1;havoc #t~post2; {37933#true} is VALID [2022-04-08 03:54:45,713 INFO L290 TraceCheckUtils]: 8: Hoare triple {37933#true} assume !!(~r~0 > 1);~i~0 := ~l~0;~j~0 := 2 * ~l~0; {38036#(<= (* main_~l~0 2) main_~j~0)} is VALID [2022-04-08 03:54:45,713 INFO L290 TraceCheckUtils]: 9: Hoare triple {38036#(<= (* main_~l~0 2) main_~j~0)} assume !!(~j~0 <= ~r~0); {38040#(<= (* main_~l~0 2) main_~r~0)} is VALID [2022-04-08 03:54:45,713 INFO L290 TraceCheckUtils]: 10: Hoare triple {38040#(<= (* main_~l~0 2) main_~r~0)} assume !(~j~0 < ~r~0); {38040#(<= (* main_~l~0 2) main_~r~0)} is VALID [2022-04-08 03:54:45,714 INFO L272 TraceCheckUtils]: 11: Hoare triple {38040#(<= (* main_~l~0 2) main_~r~0)} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {37933#true} is VALID [2022-04-08 03:54:45,714 INFO L290 TraceCheckUtils]: 12: Hoare triple {37933#true} ~cond := #in~cond; {37933#true} is VALID [2022-04-08 03:54:45,714 INFO L290 TraceCheckUtils]: 13: Hoare triple {37933#true} assume !(0 == ~cond); {37933#true} is VALID [2022-04-08 03:54:45,714 INFO L290 TraceCheckUtils]: 14: Hoare triple {37933#true} assume true; {37933#true} is VALID [2022-04-08 03:54:45,714 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {37933#true} {38040#(<= (* main_~l~0 2) main_~r~0)} #118#return; {38040#(<= (* main_~l~0 2) main_~r~0)} is VALID [2022-04-08 03:54:45,714 INFO L272 TraceCheckUtils]: 16: Hoare triple {38040#(<= (* main_~l~0 2) main_~r~0)} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {37933#true} is VALID [2022-04-08 03:54:45,715 INFO L290 TraceCheckUtils]: 17: Hoare triple {37933#true} ~cond := #in~cond; {37933#true} is VALID [2022-04-08 03:54:45,715 INFO L290 TraceCheckUtils]: 18: Hoare triple {37933#true} assume !(0 == ~cond); {37933#true} is VALID [2022-04-08 03:54:45,715 INFO L290 TraceCheckUtils]: 19: Hoare triple {37933#true} assume true; {37933#true} is VALID [2022-04-08 03:54:45,715 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {37933#true} {38040#(<= (* main_~l~0 2) main_~r~0)} #120#return; {38040#(<= (* main_~l~0 2) main_~r~0)} is VALID [2022-04-08 03:54:45,716 INFO L290 TraceCheckUtils]: 21: Hoare triple {38040#(<= (* main_~l~0 2) main_~r~0)} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {38040#(<= (* main_~l~0 2) main_~r~0)} is VALID [2022-04-08 03:54:45,716 INFO L290 TraceCheckUtils]: 22: Hoare triple {38040#(<= (* main_~l~0 2) main_~r~0)} assume 0 != #t~nondet5;havoc #t~nondet5; {38040#(<= (* main_~l~0 2) main_~r~0)} is VALID [2022-04-08 03:54:45,716 INFO L290 TraceCheckUtils]: 23: Hoare triple {38040#(<= (* main_~l~0 2) main_~r~0)} assume ~l~0 > 1; {38040#(<= (* main_~l~0 2) main_~r~0)} is VALID [2022-04-08 03:54:45,716 INFO L272 TraceCheckUtils]: 24: Hoare triple {38040#(<= (* main_~l~0 2) main_~r~0)} call __VERIFIER_assert((if 1 <= ~l~0 then 1 else 0)); {37933#true} is VALID [2022-04-08 03:54:45,716 INFO L290 TraceCheckUtils]: 25: Hoare triple {37933#true} ~cond := #in~cond; {37933#true} is VALID [2022-04-08 03:54:45,717 INFO L290 TraceCheckUtils]: 26: Hoare triple {37933#true} assume !(0 == ~cond); {37933#true} is VALID [2022-04-08 03:54:45,717 INFO L290 TraceCheckUtils]: 27: Hoare triple {37933#true} assume true; {37933#true} is VALID [2022-04-08 03:54:45,717 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {37933#true} {38040#(<= (* main_~l~0 2) main_~r~0)} #130#return; {38040#(<= (* main_~l~0 2) main_~r~0)} is VALID [2022-04-08 03:54:45,717 INFO L272 TraceCheckUtils]: 29: Hoare triple {38040#(<= (* main_~l~0 2) main_~r~0)} call __VERIFIER_assert((if ~l~0 <= ~n~0 then 1 else 0)); {37933#true} is VALID [2022-04-08 03:54:45,717 INFO L290 TraceCheckUtils]: 30: Hoare triple {37933#true} ~cond := #in~cond; {37933#true} is VALID [2022-04-08 03:54:45,717 INFO L290 TraceCheckUtils]: 31: Hoare triple {37933#true} assume !(0 == ~cond); {37933#true} is VALID [2022-04-08 03:54:45,717 INFO L290 TraceCheckUtils]: 32: Hoare triple {37933#true} assume true; {37933#true} is VALID [2022-04-08 03:54:45,718 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {37933#true} {38040#(<= (* main_~l~0 2) main_~r~0)} #132#return; {38040#(<= (* main_~l~0 2) main_~r~0)} is VALID [2022-04-08 03:54:45,718 INFO L290 TraceCheckUtils]: 34: Hoare triple {38040#(<= (* main_~l~0 2) main_~r~0)} #t~post6 := ~l~0;~l~0 := #t~post6 - 1;havoc #t~post6; {38116#(<= (+ main_~l~0 1) (div main_~r~0 2))} is VALID [2022-04-08 03:54:45,719 INFO L290 TraceCheckUtils]: 35: Hoare triple {38116#(<= (+ main_~l~0 1) (div main_~r~0 2))} assume !!(~r~0 > 1);~i~0 := ~l~0;~j~0 := 2 * ~l~0; {38120#(<= (+ (div (- main_~j~0) (- 2)) 1) (div main_~r~0 2))} is VALID [2022-04-08 03:54:45,719 INFO L290 TraceCheckUtils]: 36: Hoare triple {38120#(<= (+ (div (- main_~j~0) (- 2)) 1) (div main_~r~0 2))} assume !!(~j~0 <= ~r~0); {38120#(<= (+ (div (- main_~j~0) (- 2)) 1) (div main_~r~0 2))} is VALID [2022-04-08 03:54:45,720 INFO L290 TraceCheckUtils]: 37: Hoare triple {38120#(<= (+ (div (- main_~j~0) (- 2)) 1) (div main_~r~0 2))} assume ~j~0 < ~r~0; {38120#(<= (+ (div (- main_~j~0) (- 2)) 1) (div main_~r~0 2))} is VALID [2022-04-08 03:54:45,720 INFO L272 TraceCheckUtils]: 38: Hoare triple {38120#(<= (+ (div (- main_~j~0) (- 2)) 1) (div main_~r~0 2))} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {37933#true} is VALID [2022-04-08 03:54:45,720 INFO L290 TraceCheckUtils]: 39: Hoare triple {37933#true} ~cond := #in~cond; {37933#true} is VALID [2022-04-08 03:54:45,720 INFO L290 TraceCheckUtils]: 40: Hoare triple {37933#true} assume !(0 == ~cond); {37933#true} is VALID [2022-04-08 03:54:45,720 INFO L290 TraceCheckUtils]: 41: Hoare triple {37933#true} assume true; {37933#true} is VALID [2022-04-08 03:54:45,721 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {37933#true} {38120#(<= (+ (div (- main_~j~0) (- 2)) 1) (div main_~r~0 2))} #110#return; {38120#(<= (+ (div (- main_~j~0) (- 2)) 1) (div main_~r~0 2))} is VALID [2022-04-08 03:54:45,721 INFO L272 TraceCheckUtils]: 43: Hoare triple {38120#(<= (+ (div (- main_~j~0) (- 2)) 1) (div main_~r~0 2))} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {37933#true} is VALID [2022-04-08 03:54:45,721 INFO L290 TraceCheckUtils]: 44: Hoare triple {37933#true} ~cond := #in~cond; {37933#true} is VALID [2022-04-08 03:54:45,721 INFO L290 TraceCheckUtils]: 45: Hoare triple {37933#true} assume !(0 == ~cond); {37933#true} is VALID [2022-04-08 03:54:45,721 INFO L290 TraceCheckUtils]: 46: Hoare triple {37933#true} assume true; {37933#true} is VALID [2022-04-08 03:54:45,721 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {37933#true} {38120#(<= (+ (div (- main_~j~0) (- 2)) 1) (div main_~r~0 2))} #112#return; {38120#(<= (+ (div (- main_~j~0) (- 2)) 1) (div main_~r~0 2))} is VALID [2022-04-08 03:54:45,722 INFO L272 TraceCheckUtils]: 48: Hoare triple {38120#(<= (+ (div (- main_~j~0) (- 2)) 1) (div main_~r~0 2))} call __VERIFIER_assert((if 1 <= 1 + ~j~0 then 1 else 0)); {37933#true} is VALID [2022-04-08 03:54:45,722 INFO L290 TraceCheckUtils]: 49: Hoare triple {37933#true} ~cond := #in~cond; {37933#true} is VALID [2022-04-08 03:54:45,722 INFO L290 TraceCheckUtils]: 50: Hoare triple {37933#true} assume !(0 == ~cond); {37933#true} is VALID [2022-04-08 03:54:45,722 INFO L290 TraceCheckUtils]: 51: Hoare triple {37933#true} assume true; {37933#true} is VALID [2022-04-08 03:54:45,722 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {37933#true} {38120#(<= (+ (div (- main_~j~0) (- 2)) 1) (div main_~r~0 2))} #114#return; {38120#(<= (+ (div (- main_~j~0) (- 2)) 1) (div main_~r~0 2))} is VALID [2022-04-08 03:54:45,722 INFO L272 TraceCheckUtils]: 53: Hoare triple {38120#(<= (+ (div (- main_~j~0) (- 2)) 1) (div main_~r~0 2))} call __VERIFIER_assert((if 1 + ~j~0 <= ~n~0 then 1 else 0)); {37933#true} is VALID [2022-04-08 03:54:45,722 INFO L290 TraceCheckUtils]: 54: Hoare triple {37933#true} ~cond := #in~cond; {37933#true} is VALID [2022-04-08 03:54:45,723 INFO L290 TraceCheckUtils]: 55: Hoare triple {37933#true} assume !(0 == ~cond); {37933#true} is VALID [2022-04-08 03:54:45,723 INFO L290 TraceCheckUtils]: 56: Hoare triple {37933#true} assume true; {37933#true} is VALID [2022-04-08 03:54:45,723 INFO L284 TraceCheckUtils]: 57: Hoare quadruple {37933#true} {38120#(<= (+ (div (- main_~j~0) (- 2)) 1) (div main_~r~0 2))} #116#return; {38120#(<= (+ (div (- main_~j~0) (- 2)) 1) (div main_~r~0 2))} is VALID [2022-04-08 03:54:45,724 INFO L290 TraceCheckUtils]: 58: Hoare triple {38120#(<= (+ (div (- main_~j~0) (- 2)) 1) (div main_~r~0 2))} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {38120#(<= (+ (div (- main_~j~0) (- 2)) 1) (div main_~r~0 2))} is VALID [2022-04-08 03:54:45,724 INFO L290 TraceCheckUtils]: 59: Hoare triple {38120#(<= (+ (div (- main_~j~0) (- 2)) 1) (div main_~r~0 2))} assume !(0 != #t~nondet4);havoc #t~nondet4; {38120#(<= (+ (div (- main_~j~0) (- 2)) 1) (div main_~r~0 2))} is VALID [2022-04-08 03:54:45,724 INFO L272 TraceCheckUtils]: 60: Hoare triple {38120#(<= (+ (div (- main_~j~0) (- 2)) 1) (div main_~r~0 2))} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {37933#true} is VALID [2022-04-08 03:54:45,724 INFO L290 TraceCheckUtils]: 61: Hoare triple {37933#true} ~cond := #in~cond; {37933#true} is VALID [2022-04-08 03:54:45,724 INFO L290 TraceCheckUtils]: 62: Hoare triple {37933#true} assume !(0 == ~cond); {37933#true} is VALID [2022-04-08 03:54:45,724 INFO L290 TraceCheckUtils]: 63: Hoare triple {37933#true} assume true; {37933#true} is VALID [2022-04-08 03:54:45,725 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {37933#true} {38120#(<= (+ (div (- main_~j~0) (- 2)) 1) (div main_~r~0 2))} #118#return; {38120#(<= (+ (div (- main_~j~0) (- 2)) 1) (div main_~r~0 2))} is VALID [2022-04-08 03:54:45,725 INFO L272 TraceCheckUtils]: 65: Hoare triple {38120#(<= (+ (div (- main_~j~0) (- 2)) 1) (div main_~r~0 2))} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {37933#true} is VALID [2022-04-08 03:54:45,725 INFO L290 TraceCheckUtils]: 66: Hoare triple {37933#true} ~cond := #in~cond; {37933#true} is VALID [2022-04-08 03:54:45,725 INFO L290 TraceCheckUtils]: 67: Hoare triple {37933#true} assume !(0 == ~cond); {37933#true} is VALID [2022-04-08 03:54:45,725 INFO L290 TraceCheckUtils]: 68: Hoare triple {37933#true} assume true; {37933#true} is VALID [2022-04-08 03:54:45,726 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {37933#true} {38120#(<= (+ (div (- main_~j~0) (- 2)) 1) (div main_~r~0 2))} #120#return; {38120#(<= (+ (div (- main_~j~0) (- 2)) 1) (div main_~r~0 2))} is VALID [2022-04-08 03:54:45,726 INFO L290 TraceCheckUtils]: 70: Hoare triple {38120#(<= (+ (div (- main_~j~0) (- 2)) 1) (div main_~r~0 2))} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {38120#(<= (+ (div (- main_~j~0) (- 2)) 1) (div main_~r~0 2))} is VALID [2022-04-08 03:54:45,726 INFO L290 TraceCheckUtils]: 71: Hoare triple {38120#(<= (+ (div (- main_~j~0) (- 2)) 1) (div main_~r~0 2))} assume !(0 != #t~nondet5);havoc #t~nondet5; {38120#(<= (+ (div (- main_~j~0) (- 2)) 1) (div main_~r~0 2))} is VALID [2022-04-08 03:54:45,726 INFO L272 TraceCheckUtils]: 72: Hoare triple {38120#(<= (+ (div (- main_~j~0) (- 2)) 1) (div main_~r~0 2))} call __VERIFIER_assert((if 1 <= ~i~0 then 1 else 0)); {37933#true} is VALID [2022-04-08 03:54:45,727 INFO L290 TraceCheckUtils]: 73: Hoare triple {37933#true} ~cond := #in~cond; {37933#true} is VALID [2022-04-08 03:54:45,727 INFO L290 TraceCheckUtils]: 74: Hoare triple {37933#true} assume !(0 == ~cond); {37933#true} is VALID [2022-04-08 03:54:45,727 INFO L290 TraceCheckUtils]: 75: Hoare triple {37933#true} assume true; {37933#true} is VALID [2022-04-08 03:54:45,727 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {37933#true} {38120#(<= (+ (div (- main_~j~0) (- 2)) 1) (div main_~r~0 2))} #122#return; {38120#(<= (+ (div (- main_~j~0) (- 2)) 1) (div main_~r~0 2))} is VALID [2022-04-08 03:54:45,727 INFO L272 TraceCheckUtils]: 77: Hoare triple {38120#(<= (+ (div (- main_~j~0) (- 2)) 1) (div main_~r~0 2))} call __VERIFIER_assert((if ~i~0 <= ~n~0 then 1 else 0)); {37933#true} is VALID [2022-04-08 03:54:45,727 INFO L290 TraceCheckUtils]: 78: Hoare triple {37933#true} ~cond := #in~cond; {37933#true} is VALID [2022-04-08 03:54:45,728 INFO L290 TraceCheckUtils]: 79: Hoare triple {37933#true} assume !(0 == ~cond); {37933#true} is VALID [2022-04-08 03:54:45,728 INFO L290 TraceCheckUtils]: 80: Hoare triple {37933#true} assume true; {37933#true} is VALID [2022-04-08 03:54:45,728 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {37933#true} {38120#(<= (+ (div (- main_~j~0) (- 2)) 1) (div main_~r~0 2))} #124#return; {38120#(<= (+ (div (- main_~j~0) (- 2)) 1) (div main_~r~0 2))} is VALID [2022-04-08 03:54:45,728 INFO L272 TraceCheckUtils]: 82: Hoare triple {38120#(<= (+ (div (- main_~j~0) (- 2)) 1) (div main_~r~0 2))} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {37933#true} is VALID [2022-04-08 03:54:45,728 INFO L290 TraceCheckUtils]: 83: Hoare triple {37933#true} ~cond := #in~cond; {37933#true} is VALID [2022-04-08 03:54:45,728 INFO L290 TraceCheckUtils]: 84: Hoare triple {37933#true} assume !(0 == ~cond); {37933#true} is VALID [2022-04-08 03:54:45,729 INFO L290 TraceCheckUtils]: 85: Hoare triple {37933#true} assume true; {37933#true} is VALID [2022-04-08 03:54:45,729 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {37933#true} {38120#(<= (+ (div (- main_~j~0) (- 2)) 1) (div main_~r~0 2))} #126#return; {38120#(<= (+ (div (- main_~j~0) (- 2)) 1) (div main_~r~0 2))} is VALID [2022-04-08 03:54:45,729 INFO L272 TraceCheckUtils]: 87: Hoare triple {38120#(<= (+ (div (- main_~j~0) (- 2)) 1) (div main_~r~0 2))} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {37933#true} is VALID [2022-04-08 03:54:45,729 INFO L290 TraceCheckUtils]: 88: Hoare triple {37933#true} ~cond := #in~cond; {37933#true} is VALID [2022-04-08 03:54:45,729 INFO L290 TraceCheckUtils]: 89: Hoare triple {37933#true} assume !(0 == ~cond); {37933#true} is VALID [2022-04-08 03:54:45,729 INFO L290 TraceCheckUtils]: 90: Hoare triple {37933#true} assume true; {37933#true} is VALID [2022-04-08 03:54:45,730 INFO L284 TraceCheckUtils]: 91: Hoare quadruple {37933#true} {38120#(<= (+ (div (- main_~j~0) (- 2)) 1) (div main_~r~0 2))} #128#return; {38120#(<= (+ (div (- main_~j~0) (- 2)) 1) (div main_~r~0 2))} is VALID [2022-04-08 03:54:45,731 INFO L290 TraceCheckUtils]: 92: Hoare triple {38120#(<= (+ (div (- main_~j~0) (- 2)) 1) (div main_~r~0 2))} ~i~0 := ~j~0;~j~0 := 2 * ~j~0; {38292#(and (<= 0 (+ main_~i~0 (div (* (- 1) main_~j~0) 2))) (<= (+ (div (div (* (- 1) main_~j~0) 2) (- 2)) 1) (div main_~r~0 2)))} is VALID [2022-04-08 03:54:45,731 INFO L290 TraceCheckUtils]: 93: Hoare triple {38292#(and (<= 0 (+ main_~i~0 (div (* (- 1) main_~j~0) 2))) (<= (+ (div (div (* (- 1) main_~j~0) 2) (- 2)) 1) (div main_~r~0 2)))} assume !!(~j~0 <= ~r~0); {38292#(and (<= 0 (+ main_~i~0 (div (* (- 1) main_~j~0) 2))) (<= (+ (div (div (* (- 1) main_~j~0) 2) (- 2)) 1) (div main_~r~0 2)))} is VALID [2022-04-08 03:54:45,731 INFO L290 TraceCheckUtils]: 94: Hoare triple {38292#(and (<= 0 (+ main_~i~0 (div (* (- 1) main_~j~0) 2))) (<= (+ (div (div (* (- 1) main_~j~0) 2) (- 2)) 1) (div main_~r~0 2)))} assume !(~j~0 < ~r~0); {37997#(<= 2 main_~i~0)} is VALID [2022-04-08 03:54:45,732 INFO L272 TraceCheckUtils]: 95: Hoare triple {37997#(<= 2 main_~i~0)} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {37933#true} is VALID [2022-04-08 03:54:45,732 INFO L290 TraceCheckUtils]: 96: Hoare triple {37933#true} ~cond := #in~cond; {37933#true} is VALID [2022-04-08 03:54:45,732 INFO L290 TraceCheckUtils]: 97: Hoare triple {37933#true} assume !(0 == ~cond); {37933#true} is VALID [2022-04-08 03:54:45,732 INFO L290 TraceCheckUtils]: 98: Hoare triple {37933#true} assume true; {37933#true} is VALID [2022-04-08 03:54:45,732 INFO L284 TraceCheckUtils]: 99: Hoare quadruple {37933#true} {37997#(<= 2 main_~i~0)} #118#return; {37997#(<= 2 main_~i~0)} is VALID [2022-04-08 03:54:45,732 INFO L272 TraceCheckUtils]: 100: Hoare triple {37997#(<= 2 main_~i~0)} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {37933#true} is VALID [2022-04-08 03:54:45,733 INFO L290 TraceCheckUtils]: 101: Hoare triple {37933#true} ~cond := #in~cond; {37933#true} is VALID [2022-04-08 03:54:45,733 INFO L290 TraceCheckUtils]: 102: Hoare triple {37933#true} assume !(0 == ~cond); {37933#true} is VALID [2022-04-08 03:54:45,733 INFO L290 TraceCheckUtils]: 103: Hoare triple {37933#true} assume true; {37933#true} is VALID [2022-04-08 03:54:45,733 INFO L284 TraceCheckUtils]: 104: Hoare quadruple {37933#true} {37997#(<= 2 main_~i~0)} #120#return; {37997#(<= 2 main_~i~0)} is VALID [2022-04-08 03:54:45,733 INFO L290 TraceCheckUtils]: 105: Hoare triple {37997#(<= 2 main_~i~0)} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {37997#(<= 2 main_~i~0)} is VALID [2022-04-08 03:54:45,734 INFO L290 TraceCheckUtils]: 106: Hoare triple {37997#(<= 2 main_~i~0)} assume !(0 != #t~nondet5);havoc #t~nondet5; {37997#(<= 2 main_~i~0)} is VALID [2022-04-08 03:54:45,734 INFO L272 TraceCheckUtils]: 107: Hoare triple {37997#(<= 2 main_~i~0)} call __VERIFIER_assert((if 1 <= ~i~0 then 1 else 0)); {38338#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 03:54:45,735 INFO L290 TraceCheckUtils]: 108: Hoare triple {38338#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {38342#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 03:54:45,735 INFO L290 TraceCheckUtils]: 109: Hoare triple {38342#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {37934#false} is VALID [2022-04-08 03:54:45,735 INFO L290 TraceCheckUtils]: 110: Hoare triple {37934#false} assume !false; {37934#false} is VALID [2022-04-08 03:54:45,735 INFO L134 CoverageAnalysis]: Checked inductivity of 532 backedges. 33 proven. 19 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2022-04-08 03:54:45,736 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 03:54:46,940 INFO L290 TraceCheckUtils]: 110: Hoare triple {37934#false} assume !false; {37934#false} is VALID [2022-04-08 03:54:46,940 INFO L290 TraceCheckUtils]: 109: Hoare triple {38342#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {37934#false} is VALID [2022-04-08 03:54:46,940 INFO L290 TraceCheckUtils]: 108: Hoare triple {38338#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {38342#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 03:54:46,941 INFO L272 TraceCheckUtils]: 107: Hoare triple {38358#(<= 1 main_~i~0)} call __VERIFIER_assert((if 1 <= ~i~0 then 1 else 0)); {38338#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 03:54:46,941 INFO L290 TraceCheckUtils]: 106: Hoare triple {38358#(<= 1 main_~i~0)} assume !(0 != #t~nondet5);havoc #t~nondet5; {38358#(<= 1 main_~i~0)} is VALID [2022-04-08 03:54:46,941 INFO L290 TraceCheckUtils]: 105: Hoare triple {38358#(<= 1 main_~i~0)} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {38358#(<= 1 main_~i~0)} is VALID [2022-04-08 03:54:46,942 INFO L284 TraceCheckUtils]: 104: Hoare quadruple {37933#true} {38358#(<= 1 main_~i~0)} #120#return; {38358#(<= 1 main_~i~0)} is VALID [2022-04-08 03:54:46,942 INFO L290 TraceCheckUtils]: 103: Hoare triple {37933#true} assume true; {37933#true} is VALID [2022-04-08 03:54:46,942 INFO L290 TraceCheckUtils]: 102: Hoare triple {37933#true} assume !(0 == ~cond); {37933#true} is VALID [2022-04-08 03:54:46,942 INFO L290 TraceCheckUtils]: 101: Hoare triple {37933#true} ~cond := #in~cond; {37933#true} is VALID [2022-04-08 03:54:46,942 INFO L272 TraceCheckUtils]: 100: Hoare triple {38358#(<= 1 main_~i~0)} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {37933#true} is VALID [2022-04-08 03:54:46,943 INFO L284 TraceCheckUtils]: 99: Hoare quadruple {37933#true} {38358#(<= 1 main_~i~0)} #118#return; {38358#(<= 1 main_~i~0)} is VALID [2022-04-08 03:54:46,943 INFO L290 TraceCheckUtils]: 98: Hoare triple {37933#true} assume true; {37933#true} is VALID [2022-04-08 03:54:46,943 INFO L290 TraceCheckUtils]: 97: Hoare triple {37933#true} assume !(0 == ~cond); {37933#true} is VALID [2022-04-08 03:54:46,943 INFO L290 TraceCheckUtils]: 96: Hoare triple {37933#true} ~cond := #in~cond; {37933#true} is VALID [2022-04-08 03:54:46,943 INFO L272 TraceCheckUtils]: 95: Hoare triple {38358#(<= 1 main_~i~0)} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {37933#true} is VALID [2022-04-08 03:54:46,943 INFO L290 TraceCheckUtils]: 94: Hoare triple {38398#(or (< main_~j~0 main_~r~0) (<= 1 main_~i~0))} assume !(~j~0 < ~r~0); {38358#(<= 1 main_~i~0)} is VALID [2022-04-08 03:54:46,944 INFO L290 TraceCheckUtils]: 93: Hoare triple {38398#(or (< main_~j~0 main_~r~0) (<= 1 main_~i~0))} assume !!(~j~0 <= ~r~0); {38398#(or (< main_~j~0 main_~r~0) (<= 1 main_~i~0))} is VALID [2022-04-08 03:54:46,944 INFO L290 TraceCheckUtils]: 92: Hoare triple {38405#(or (<= 1 main_~j~0) (< (* main_~j~0 2) main_~r~0))} ~i~0 := ~j~0;~j~0 := 2 * ~j~0; {38398#(or (< main_~j~0 main_~r~0) (<= 1 main_~i~0))} is VALID [2022-04-08 03:54:46,945 INFO L284 TraceCheckUtils]: 91: Hoare quadruple {37933#true} {38405#(or (<= 1 main_~j~0) (< (* main_~j~0 2) main_~r~0))} #128#return; {38405#(or (<= 1 main_~j~0) (< (* main_~j~0 2) main_~r~0))} is VALID [2022-04-08 03:54:46,945 INFO L290 TraceCheckUtils]: 90: Hoare triple {37933#true} assume true; {37933#true} is VALID [2022-04-08 03:54:46,945 INFO L290 TraceCheckUtils]: 89: Hoare triple {37933#true} assume !(0 == ~cond); {37933#true} is VALID [2022-04-08 03:54:46,945 INFO L290 TraceCheckUtils]: 88: Hoare triple {37933#true} ~cond := #in~cond; {37933#true} is VALID [2022-04-08 03:54:46,945 INFO L272 TraceCheckUtils]: 87: Hoare triple {38405#(or (<= 1 main_~j~0) (< (* main_~j~0 2) main_~r~0))} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {37933#true} is VALID [2022-04-08 03:54:46,946 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {37933#true} {38405#(or (<= 1 main_~j~0) (< (* main_~j~0 2) main_~r~0))} #126#return; {38405#(or (<= 1 main_~j~0) (< (* main_~j~0 2) main_~r~0))} is VALID [2022-04-08 03:54:46,946 INFO L290 TraceCheckUtils]: 85: Hoare triple {37933#true} assume true; {37933#true} is VALID [2022-04-08 03:54:46,946 INFO L290 TraceCheckUtils]: 84: Hoare triple {37933#true} assume !(0 == ~cond); {37933#true} is VALID [2022-04-08 03:54:46,946 INFO L290 TraceCheckUtils]: 83: Hoare triple {37933#true} ~cond := #in~cond; {37933#true} is VALID [2022-04-08 03:54:46,946 INFO L272 TraceCheckUtils]: 82: Hoare triple {38405#(or (<= 1 main_~j~0) (< (* main_~j~0 2) main_~r~0))} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {37933#true} is VALID [2022-04-08 03:54:46,946 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {37933#true} {38405#(or (<= 1 main_~j~0) (< (* main_~j~0 2) main_~r~0))} #124#return; {38405#(or (<= 1 main_~j~0) (< (* main_~j~0 2) main_~r~0))} is VALID [2022-04-08 03:54:46,947 INFO L290 TraceCheckUtils]: 80: Hoare triple {37933#true} assume true; {37933#true} is VALID [2022-04-08 03:54:46,947 INFO L290 TraceCheckUtils]: 79: Hoare triple {37933#true} assume !(0 == ~cond); {37933#true} is VALID [2022-04-08 03:54:46,947 INFO L290 TraceCheckUtils]: 78: Hoare triple {37933#true} ~cond := #in~cond; {37933#true} is VALID [2022-04-08 03:54:46,947 INFO L272 TraceCheckUtils]: 77: Hoare triple {38405#(or (<= 1 main_~j~0) (< (* main_~j~0 2) main_~r~0))} call __VERIFIER_assert((if ~i~0 <= ~n~0 then 1 else 0)); {37933#true} is VALID [2022-04-08 03:54:46,947 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {37933#true} {38405#(or (<= 1 main_~j~0) (< (* main_~j~0 2) main_~r~0))} #122#return; {38405#(or (<= 1 main_~j~0) (< (* main_~j~0 2) main_~r~0))} is VALID [2022-04-08 03:54:46,947 INFO L290 TraceCheckUtils]: 75: Hoare triple {37933#true} assume true; {37933#true} is VALID [2022-04-08 03:54:46,947 INFO L290 TraceCheckUtils]: 74: Hoare triple {37933#true} assume !(0 == ~cond); {37933#true} is VALID [2022-04-08 03:54:46,948 INFO L290 TraceCheckUtils]: 73: Hoare triple {37933#true} ~cond := #in~cond; {37933#true} is VALID [2022-04-08 03:54:46,948 INFO L272 TraceCheckUtils]: 72: Hoare triple {38405#(or (<= 1 main_~j~0) (< (* main_~j~0 2) main_~r~0))} call __VERIFIER_assert((if 1 <= ~i~0 then 1 else 0)); {37933#true} is VALID [2022-04-08 03:54:46,948 INFO L290 TraceCheckUtils]: 71: Hoare triple {38405#(or (<= 1 main_~j~0) (< (* main_~j~0 2) main_~r~0))} assume !(0 != #t~nondet5);havoc #t~nondet5; {38405#(or (<= 1 main_~j~0) (< (* main_~j~0 2) main_~r~0))} is VALID [2022-04-08 03:54:46,948 INFO L290 TraceCheckUtils]: 70: Hoare triple {38405#(or (<= 1 main_~j~0) (< (* main_~j~0 2) main_~r~0))} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {38405#(or (<= 1 main_~j~0) (< (* main_~j~0 2) main_~r~0))} is VALID [2022-04-08 03:54:46,949 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {37933#true} {38405#(or (<= 1 main_~j~0) (< (* main_~j~0 2) main_~r~0))} #120#return; {38405#(or (<= 1 main_~j~0) (< (* main_~j~0 2) main_~r~0))} is VALID [2022-04-08 03:54:46,949 INFO L290 TraceCheckUtils]: 68: Hoare triple {37933#true} assume true; {37933#true} is VALID [2022-04-08 03:54:46,949 INFO L290 TraceCheckUtils]: 67: Hoare triple {37933#true} assume !(0 == ~cond); {37933#true} is VALID [2022-04-08 03:54:46,949 INFO L290 TraceCheckUtils]: 66: Hoare triple {37933#true} ~cond := #in~cond; {37933#true} is VALID [2022-04-08 03:54:46,949 INFO L272 TraceCheckUtils]: 65: Hoare triple {38405#(or (<= 1 main_~j~0) (< (* main_~j~0 2) main_~r~0))} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {37933#true} is VALID [2022-04-08 03:54:46,950 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {37933#true} {38405#(or (<= 1 main_~j~0) (< (* main_~j~0 2) main_~r~0))} #118#return; {38405#(or (<= 1 main_~j~0) (< (* main_~j~0 2) main_~r~0))} is VALID [2022-04-08 03:54:46,950 INFO L290 TraceCheckUtils]: 63: Hoare triple {37933#true} assume true; {37933#true} is VALID [2022-04-08 03:54:46,950 INFO L290 TraceCheckUtils]: 62: Hoare triple {37933#true} assume !(0 == ~cond); {37933#true} is VALID [2022-04-08 03:54:46,950 INFO L290 TraceCheckUtils]: 61: Hoare triple {37933#true} ~cond := #in~cond; {37933#true} is VALID [2022-04-08 03:54:46,950 INFO L272 TraceCheckUtils]: 60: Hoare triple {38405#(or (<= 1 main_~j~0) (< (* main_~j~0 2) main_~r~0))} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {37933#true} is VALID [2022-04-08 03:54:46,952 INFO L290 TraceCheckUtils]: 59: Hoare triple {38405#(or (<= 1 main_~j~0) (< (* main_~j~0 2) main_~r~0))} assume !(0 != #t~nondet4);havoc #t~nondet4; {38405#(or (<= 1 main_~j~0) (< (* main_~j~0 2) main_~r~0))} is VALID [2022-04-08 03:54:46,953 INFO L290 TraceCheckUtils]: 58: Hoare triple {38405#(or (<= 1 main_~j~0) (< (* main_~j~0 2) main_~r~0))} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {38405#(or (<= 1 main_~j~0) (< (* main_~j~0 2) main_~r~0))} is VALID [2022-04-08 03:54:46,957 INFO L284 TraceCheckUtils]: 57: Hoare quadruple {37933#true} {38405#(or (<= 1 main_~j~0) (< (* main_~j~0 2) main_~r~0))} #116#return; {38405#(or (<= 1 main_~j~0) (< (* main_~j~0 2) main_~r~0))} is VALID [2022-04-08 03:54:46,957 INFO L290 TraceCheckUtils]: 56: Hoare triple {37933#true} assume true; {37933#true} is VALID [2022-04-08 03:54:46,957 INFO L290 TraceCheckUtils]: 55: Hoare triple {37933#true} assume !(0 == ~cond); {37933#true} is VALID [2022-04-08 03:54:46,957 INFO L290 TraceCheckUtils]: 54: Hoare triple {37933#true} ~cond := #in~cond; {37933#true} is VALID [2022-04-08 03:54:46,958 INFO L272 TraceCheckUtils]: 53: Hoare triple {38405#(or (<= 1 main_~j~0) (< (* main_~j~0 2) main_~r~0))} call __VERIFIER_assert((if 1 + ~j~0 <= ~n~0 then 1 else 0)); {37933#true} is VALID [2022-04-08 03:54:46,959 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {37933#true} {38405#(or (<= 1 main_~j~0) (< (* main_~j~0 2) main_~r~0))} #114#return; {38405#(or (<= 1 main_~j~0) (< (* main_~j~0 2) main_~r~0))} is VALID [2022-04-08 03:54:46,959 INFO L290 TraceCheckUtils]: 51: Hoare triple {37933#true} assume true; {37933#true} is VALID [2022-04-08 03:54:46,960 INFO L290 TraceCheckUtils]: 50: Hoare triple {37933#true} assume !(0 == ~cond); {37933#true} is VALID [2022-04-08 03:54:46,960 INFO L290 TraceCheckUtils]: 49: Hoare triple {37933#true} ~cond := #in~cond; {37933#true} is VALID [2022-04-08 03:54:46,960 INFO L272 TraceCheckUtils]: 48: Hoare triple {38405#(or (<= 1 main_~j~0) (< (* main_~j~0 2) main_~r~0))} call __VERIFIER_assert((if 1 <= 1 + ~j~0 then 1 else 0)); {37933#true} is VALID [2022-04-08 03:54:46,960 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {37933#true} {38405#(or (<= 1 main_~j~0) (< (* main_~j~0 2) main_~r~0))} #112#return; {38405#(or (<= 1 main_~j~0) (< (* main_~j~0 2) main_~r~0))} is VALID [2022-04-08 03:54:46,960 INFO L290 TraceCheckUtils]: 46: Hoare triple {37933#true} assume true; {37933#true} is VALID [2022-04-08 03:54:46,960 INFO L290 TraceCheckUtils]: 45: Hoare triple {37933#true} assume !(0 == ~cond); {37933#true} is VALID [2022-04-08 03:54:46,960 INFO L290 TraceCheckUtils]: 44: Hoare triple {37933#true} ~cond := #in~cond; {37933#true} is VALID [2022-04-08 03:54:46,961 INFO L272 TraceCheckUtils]: 43: Hoare triple {38405#(or (<= 1 main_~j~0) (< (* main_~j~0 2) main_~r~0))} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {37933#true} is VALID [2022-04-08 03:54:46,961 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {37933#true} {38405#(or (<= 1 main_~j~0) (< (* main_~j~0 2) main_~r~0))} #110#return; {38405#(or (<= 1 main_~j~0) (< (* main_~j~0 2) main_~r~0))} is VALID [2022-04-08 03:54:46,961 INFO L290 TraceCheckUtils]: 41: Hoare triple {37933#true} assume true; {37933#true} is VALID [2022-04-08 03:54:46,961 INFO L290 TraceCheckUtils]: 40: Hoare triple {37933#true} assume !(0 == ~cond); {37933#true} is VALID [2022-04-08 03:54:46,961 INFO L290 TraceCheckUtils]: 39: Hoare triple {37933#true} ~cond := #in~cond; {37933#true} is VALID [2022-04-08 03:54:46,961 INFO L272 TraceCheckUtils]: 38: Hoare triple {38405#(or (<= 1 main_~j~0) (< (* main_~j~0 2) main_~r~0))} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {37933#true} is VALID [2022-04-08 03:54:46,962 INFO L290 TraceCheckUtils]: 37: Hoare triple {38405#(or (<= 1 main_~j~0) (< (* main_~j~0 2) main_~r~0))} assume ~j~0 < ~r~0; {38405#(or (<= 1 main_~j~0) (< (* main_~j~0 2) main_~r~0))} is VALID [2022-04-08 03:54:46,962 INFO L290 TraceCheckUtils]: 36: Hoare triple {38405#(or (<= 1 main_~j~0) (< (* main_~j~0 2) main_~r~0))} assume !!(~j~0 <= ~r~0); {38405#(or (<= 1 main_~j~0) (< (* main_~j~0 2) main_~r~0))} is VALID [2022-04-08 03:54:46,963 INFO L290 TraceCheckUtils]: 35: Hoare triple {38577#(or (<= 0 (div (+ (- 1) main_~r~0) 2)) (< (* main_~l~0 2) (+ (div (+ (- 1) main_~r~0) 2) 1)))} assume !!(~r~0 > 1);~i~0 := ~l~0;~j~0 := 2 * ~l~0; {38405#(or (<= 1 main_~j~0) (< (* main_~j~0 2) main_~r~0))} is VALID [2022-04-08 03:54:46,963 INFO L290 TraceCheckUtils]: 34: Hoare triple {38581#(or (<= 0 (div (+ (- 1) main_~r~0) 2)) (< main_~l~0 (+ 2 (div (div (+ (- 1) main_~r~0) 2) 2))))} #t~post6 := ~l~0;~l~0 := #t~post6 - 1;havoc #t~post6; {38577#(or (<= 0 (div (+ (- 1) main_~r~0) 2)) (< (* main_~l~0 2) (+ (div (+ (- 1) main_~r~0) 2) 1)))} is VALID [2022-04-08 03:54:46,964 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {37933#true} {38581#(or (<= 0 (div (+ (- 1) main_~r~0) 2)) (< main_~l~0 (+ 2 (div (div (+ (- 1) main_~r~0) 2) 2))))} #132#return; {38581#(or (<= 0 (div (+ (- 1) main_~r~0) 2)) (< main_~l~0 (+ 2 (div (div (+ (- 1) main_~r~0) 2) 2))))} is VALID [2022-04-08 03:54:46,964 INFO L290 TraceCheckUtils]: 32: Hoare triple {37933#true} assume true; {37933#true} is VALID [2022-04-08 03:54:46,964 INFO L290 TraceCheckUtils]: 31: Hoare triple {37933#true} assume !(0 == ~cond); {37933#true} is VALID [2022-04-08 03:54:46,964 INFO L290 TraceCheckUtils]: 30: Hoare triple {37933#true} ~cond := #in~cond; {37933#true} is VALID [2022-04-08 03:54:46,964 INFO L272 TraceCheckUtils]: 29: Hoare triple {38581#(or (<= 0 (div (+ (- 1) main_~r~0) 2)) (< main_~l~0 (+ 2 (div (div (+ (- 1) main_~r~0) 2) 2))))} call __VERIFIER_assert((if ~l~0 <= ~n~0 then 1 else 0)); {37933#true} is VALID [2022-04-08 03:54:46,965 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {37933#true} {38581#(or (<= 0 (div (+ (- 1) main_~r~0) 2)) (< main_~l~0 (+ 2 (div (div (+ (- 1) main_~r~0) 2) 2))))} #130#return; {38581#(or (<= 0 (div (+ (- 1) main_~r~0) 2)) (< main_~l~0 (+ 2 (div (div (+ (- 1) main_~r~0) 2) 2))))} is VALID [2022-04-08 03:54:46,965 INFO L290 TraceCheckUtils]: 27: Hoare triple {37933#true} assume true; {37933#true} is VALID [2022-04-08 03:54:46,965 INFO L290 TraceCheckUtils]: 26: Hoare triple {37933#true} assume !(0 == ~cond); {37933#true} is VALID [2022-04-08 03:54:46,965 INFO L290 TraceCheckUtils]: 25: Hoare triple {37933#true} ~cond := #in~cond; {37933#true} is VALID [2022-04-08 03:54:46,965 INFO L272 TraceCheckUtils]: 24: Hoare triple {38581#(or (<= 0 (div (+ (- 1) main_~r~0) 2)) (< main_~l~0 (+ 2 (div (div (+ (- 1) main_~r~0) 2) 2))))} call __VERIFIER_assert((if 1 <= ~l~0 then 1 else 0)); {37933#true} is VALID [2022-04-08 03:54:46,965 INFO L290 TraceCheckUtils]: 23: Hoare triple {38581#(or (<= 0 (div (+ (- 1) main_~r~0) 2)) (< main_~l~0 (+ 2 (div (div (+ (- 1) main_~r~0) 2) 2))))} assume ~l~0 > 1; {38581#(or (<= 0 (div (+ (- 1) main_~r~0) 2)) (< main_~l~0 (+ 2 (div (div (+ (- 1) main_~r~0) 2) 2))))} is VALID [2022-04-08 03:54:46,966 INFO L290 TraceCheckUtils]: 22: Hoare triple {38581#(or (<= 0 (div (+ (- 1) main_~r~0) 2)) (< main_~l~0 (+ 2 (div (div (+ (- 1) main_~r~0) 2) 2))))} assume 0 != #t~nondet5;havoc #t~nondet5; {38581#(or (<= 0 (div (+ (- 1) main_~r~0) 2)) (< main_~l~0 (+ 2 (div (div (+ (- 1) main_~r~0) 2) 2))))} is VALID [2022-04-08 03:54:46,966 INFO L290 TraceCheckUtils]: 21: Hoare triple {38581#(or (<= 0 (div (+ (- 1) main_~r~0) 2)) (< main_~l~0 (+ 2 (div (div (+ (- 1) main_~r~0) 2) 2))))} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {38581#(or (<= 0 (div (+ (- 1) main_~r~0) 2)) (< main_~l~0 (+ 2 (div (div (+ (- 1) main_~r~0) 2) 2))))} is VALID [2022-04-08 03:54:46,966 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {37933#true} {38581#(or (<= 0 (div (+ (- 1) main_~r~0) 2)) (< main_~l~0 (+ 2 (div (div (+ (- 1) main_~r~0) 2) 2))))} #120#return; {38581#(or (<= 0 (div (+ (- 1) main_~r~0) 2)) (< main_~l~0 (+ 2 (div (div (+ (- 1) main_~r~0) 2) 2))))} is VALID [2022-04-08 03:54:46,966 INFO L290 TraceCheckUtils]: 19: Hoare triple {37933#true} assume true; {37933#true} is VALID [2022-04-08 03:54:46,967 INFO L290 TraceCheckUtils]: 18: Hoare triple {37933#true} assume !(0 == ~cond); {37933#true} is VALID [2022-04-08 03:54:46,967 INFO L290 TraceCheckUtils]: 17: Hoare triple {37933#true} ~cond := #in~cond; {37933#true} is VALID [2022-04-08 03:54:46,967 INFO L272 TraceCheckUtils]: 16: Hoare triple {38581#(or (<= 0 (div (+ (- 1) main_~r~0) 2)) (< main_~l~0 (+ 2 (div (div (+ (- 1) main_~r~0) 2) 2))))} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {37933#true} is VALID [2022-04-08 03:54:46,967 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {37933#true} {38581#(or (<= 0 (div (+ (- 1) main_~r~0) 2)) (< main_~l~0 (+ 2 (div (div (+ (- 1) main_~r~0) 2) 2))))} #118#return; {38581#(or (<= 0 (div (+ (- 1) main_~r~0) 2)) (< main_~l~0 (+ 2 (div (div (+ (- 1) main_~r~0) 2) 2))))} is VALID [2022-04-08 03:54:46,967 INFO L290 TraceCheckUtils]: 14: Hoare triple {37933#true} assume true; {37933#true} is VALID [2022-04-08 03:54:46,967 INFO L290 TraceCheckUtils]: 13: Hoare triple {37933#true} assume !(0 == ~cond); {37933#true} is VALID [2022-04-08 03:54:46,968 INFO L290 TraceCheckUtils]: 12: Hoare triple {37933#true} ~cond := #in~cond; {37933#true} is VALID [2022-04-08 03:54:46,968 INFO L272 TraceCheckUtils]: 11: Hoare triple {38581#(or (<= 0 (div (+ (- 1) main_~r~0) 2)) (< main_~l~0 (+ 2 (div (div (+ (- 1) main_~r~0) 2) 2))))} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {37933#true} is VALID [2022-04-08 03:54:46,968 INFO L290 TraceCheckUtils]: 10: Hoare triple {38581#(or (<= 0 (div (+ (- 1) main_~r~0) 2)) (< main_~l~0 (+ 2 (div (div (+ (- 1) main_~r~0) 2) 2))))} assume !(~j~0 < ~r~0); {38581#(or (<= 0 (div (+ (- 1) main_~r~0) 2)) (< main_~l~0 (+ 2 (div (div (+ (- 1) main_~r~0) 2) 2))))} is VALID [2022-04-08 03:54:46,969 INFO L290 TraceCheckUtils]: 9: Hoare triple {38657#(or (<= 0 (+ (div (+ main_~j~0 (- 3)) 2) 1)) (<= main_~l~0 (+ (div (+ (- 1) (div (+ main_~j~0 (- 3)) 2)) 2) 2)))} assume !!(~j~0 <= ~r~0); {38581#(or (<= 0 (div (+ (- 1) main_~r~0) 2)) (< main_~l~0 (+ 2 (div (div (+ (- 1) main_~r~0) 2) 2))))} is VALID [2022-04-08 03:54:46,971 INFO L290 TraceCheckUtils]: 8: Hoare triple {37933#true} assume !!(~r~0 > 1);~i~0 := ~l~0;~j~0 := 2 * ~l~0; {38657#(or (<= 0 (+ (div (+ main_~j~0 (- 3)) 2) 1)) (<= main_~l~0 (+ (div (+ (- 1) (div (+ main_~j~0 (- 3)) 2)) 2) 2)))} is VALID [2022-04-08 03:54:46,971 INFO L290 TraceCheckUtils]: 7: Hoare triple {37933#true} assume ~l~0 > 1;#t~post2 := ~l~0;~l~0 := #t~post2 - 1;havoc #t~post2; {37933#true} is VALID [2022-04-08 03:54:46,971 INFO L290 TraceCheckUtils]: 6: Hoare triple {37933#true} assume !!(1 <= ~n~0 && ~n~0 <= 1000000);~l~0 := 1 + (if ~n~0 < 0 && 0 != ~n~0 % 2 then 1 + ~n~0 / 2 else ~n~0 / 2);~r~0 := ~n~0; {37933#true} is VALID [2022-04-08 03:54:46,971 INFO L290 TraceCheckUtils]: 5: Hoare triple {37933#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;havoc ~n~0;havoc ~l~0;havoc ~r~0;havoc ~i~0;havoc ~j~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {37933#true} is VALID [2022-04-08 03:54:46,971 INFO L272 TraceCheckUtils]: 4: Hoare triple {37933#true} call #t~ret8 := main(#in~argc, #in~argv.base, #in~argv.offset); {37933#true} is VALID [2022-04-08 03:54:46,971 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {37933#true} {37933#true} #138#return; {37933#true} is VALID [2022-04-08 03:54:46,971 INFO L290 TraceCheckUtils]: 2: Hoare triple {37933#true} assume true; {37933#true} is VALID [2022-04-08 03:54:46,971 INFO L290 TraceCheckUtils]: 1: Hoare triple {37933#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(9, 2); {37933#true} is VALID [2022-04-08 03:54:46,972 INFO L272 TraceCheckUtils]: 0: Hoare triple {37933#true} call ULTIMATE.init(); {37933#true} is VALID [2022-04-08 03:54:46,972 INFO L134 CoverageAnalysis]: Checked inductivity of 532 backedges. 33 proven. 19 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2022-04-08 03:54:46,972 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1442328792] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 03:54:46,972 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 03:54:46,972 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 10] total 22 [2022-04-08 03:54:46,973 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 03:54:46,973 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1929612400] [2022-04-08 03:54:46,973 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1929612400] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 03:54:46,973 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 03:54:46,973 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-08 03:54:46,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1900122390] [2022-04-08 03:54:46,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 03:54:46,974 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 7 states have internal predecessors, (30), 4 states have call successors, (19), 3 states have call predecessors, (19), 1 states have return successors, (17), 4 states have call predecessors, (17), 4 states have call successors, (17) Word has length 111 [2022-04-08 03:54:46,974 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 03:54:46,974 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 7 states have internal predecessors, (30), 4 states have call successors, (19), 3 states have call predecessors, (19), 1 states have return successors, (17), 4 states have call predecessors, (17), 4 states have call successors, (17) [2022-04-08 03:54:47,008 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 03:54:47,008 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-08 03:54:47,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 03:54:47,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-08 03:54:47,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=403, Unknown=0, NotChecked=0, Total=462 [2022-04-08 03:54:47,009 INFO L87 Difference]: Start difference. First operand 294 states and 451 transitions. Second operand has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 7 states have internal predecessors, (30), 4 states have call successors, (19), 3 states have call predecessors, (19), 1 states have return successors, (17), 4 states have call predecessors, (17), 4 states have call successors, (17) [2022-04-08 03:54:49,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:54:49,672 INFO L93 Difference]: Finished difference Result 323 states and 492 transitions. [2022-04-08 03:54:49,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-08 03:54:49,672 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 7 states have internal predecessors, (30), 4 states have call successors, (19), 3 states have call predecessors, (19), 1 states have return successors, (17), 4 states have call predecessors, (17), 4 states have call successors, (17) Word has length 111 [2022-04-08 03:54:49,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 03:54:49,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 7 states have internal predecessors, (30), 4 states have call successors, (19), 3 states have call predecessors, (19), 1 states have return successors, (17), 4 states have call predecessors, (17), 4 states have call successors, (17) [2022-04-08 03:54:49,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 107 transitions. [2022-04-08 03:54:49,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 7 states have internal predecessors, (30), 4 states have call successors, (19), 3 states have call predecessors, (19), 1 states have return successors, (17), 4 states have call predecessors, (17), 4 states have call successors, (17) [2022-04-08 03:54:49,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 107 transitions. [2022-04-08 03:54:49,674 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 107 transitions. [2022-04-08 03:54:49,736 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 107 edges. 107 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:54:49,742 INFO L225 Difference]: With dead ends: 323 [2022-04-08 03:54:49,742 INFO L226 Difference]: Without dead ends: 321 [2022-04-08 03:54:49,743 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 273 GetRequests, 244 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=123, Invalid=747, Unknown=0, NotChecked=0, Total=870 [2022-04-08 03:54:49,743 INFO L913 BasicCegarLoop]: 50 mSDtfsCounter, 56 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 428 mSolverCounterSat, 110 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 538 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 110 IncrementalHoareTripleChecker+Valid, 428 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-08 03:54:49,744 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [56 Valid, 77 Invalid, 538 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [110 Valid, 428 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-08 03:54:49,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2022-04-08 03:54:50,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 242. [2022-04-08 03:54:50,709 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 03:54:50,709 INFO L82 GeneralOperation]: Start isEquivalent. First operand 321 states. Second operand has 242 states, 120 states have (on average 1.25) internal successors, (150), 130 states have internal predecessors, (150), 104 states have call successors, (104), 18 states have call predecessors, (104), 17 states have return successors, (103), 93 states have call predecessors, (103), 103 states have call successors, (103) [2022-04-08 03:54:50,710 INFO L74 IsIncluded]: Start isIncluded. First operand 321 states. Second operand has 242 states, 120 states have (on average 1.25) internal successors, (150), 130 states have internal predecessors, (150), 104 states have call successors, (104), 18 states have call predecessors, (104), 17 states have return successors, (103), 93 states have call predecessors, (103), 103 states have call successors, (103) [2022-04-08 03:54:50,710 INFO L87 Difference]: Start difference. First operand 321 states. Second operand has 242 states, 120 states have (on average 1.25) internal successors, (150), 130 states have internal predecessors, (150), 104 states have call successors, (104), 18 states have call predecessors, (104), 17 states have return successors, (103), 93 states have call predecessors, (103), 103 states have call successors, (103) [2022-04-08 03:54:50,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:54:50,716 INFO L93 Difference]: Finished difference Result 321 states and 490 transitions. [2022-04-08 03:54:50,716 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 490 transitions. [2022-04-08 03:54:50,717 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:54:50,717 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:54:50,718 INFO L74 IsIncluded]: Start isIncluded. First operand has 242 states, 120 states have (on average 1.25) internal successors, (150), 130 states have internal predecessors, (150), 104 states have call successors, (104), 18 states have call predecessors, (104), 17 states have return successors, (103), 93 states have call predecessors, (103), 103 states have call successors, (103) Second operand 321 states. [2022-04-08 03:54:50,718 INFO L87 Difference]: Start difference. First operand has 242 states, 120 states have (on average 1.25) internal successors, (150), 130 states have internal predecessors, (150), 104 states have call successors, (104), 18 states have call predecessors, (104), 17 states have return successors, (103), 93 states have call predecessors, (103), 103 states have call successors, (103) Second operand 321 states. [2022-04-08 03:54:50,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:54:50,725 INFO L93 Difference]: Finished difference Result 321 states and 490 transitions. [2022-04-08 03:54:50,725 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 490 transitions. [2022-04-08 03:54:50,725 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:54:50,725 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:54:50,726 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 03:54:50,726 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 03:54:50,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 242 states, 120 states have (on average 1.25) internal successors, (150), 130 states have internal predecessors, (150), 104 states have call successors, (104), 18 states have call predecessors, (104), 17 states have return successors, (103), 93 states have call predecessors, (103), 103 states have call successors, (103) [2022-04-08 03:54:50,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 357 transitions. [2022-04-08 03:54:50,731 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 357 transitions. Word has length 111 [2022-04-08 03:54:50,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 03:54:50,732 INFO L478 AbstractCegarLoop]: Abstraction has 242 states and 357 transitions. [2022-04-08 03:54:50,732 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 7 states have internal predecessors, (30), 4 states have call successors, (19), 3 states have call predecessors, (19), 1 states have return successors, (17), 4 states have call predecessors, (17), 4 states have call successors, (17) [2022-04-08 03:54:50,732 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 242 states and 357 transitions. [2022-04-08 03:54:51,190 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 357 edges. 357 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:54:51,191 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 357 transitions. [2022-04-08 03:54:51,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2022-04-08 03:54:51,192 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 03:54:51,192 INFO L499 BasicCegarLoop]: trace histogram [18, 17, 17, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 03:54:51,210 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 03:54:51,408 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 03:54:51,409 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 03:54:51,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 03:54:51,410 INFO L85 PathProgramCache]: Analyzing trace with hash 1099325000, now seen corresponding path program 3 times [2022-04-08 03:54:51,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 03:54:51,411 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [420755269] [2022-04-08 03:54:51,411 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 03:54:51,411 INFO L85 PathProgramCache]: Analyzing trace with hash 1099325000, now seen corresponding path program 4 times [2022-04-08 03:54:51,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 03:54:51,411 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1629815900] [2022-04-08 03:54:51,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 03:54:51,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 03:54:51,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:54:51,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 03:54:51,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:54:51,496 INFO L290 TraceCheckUtils]: 0: Hoare triple {40557#(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(9, 2); {40477#true} is VALID [2022-04-08 03:54:51,496 INFO L290 TraceCheckUtils]: 1: Hoare triple {40477#true} assume true; {40477#true} is VALID [2022-04-08 03:54:51,497 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {40477#true} {40477#true} #138#return; {40477#true} is VALID [2022-04-08 03:54:51,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-08 03:54:51,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:54:51,499 INFO L290 TraceCheckUtils]: 0: Hoare triple {40477#true} ~cond := #in~cond; {40477#true} is VALID [2022-04-08 03:54:51,499 INFO L290 TraceCheckUtils]: 1: Hoare triple {40477#true} assume !(0 == ~cond); {40477#true} is VALID [2022-04-08 03:54:51,499 INFO L290 TraceCheckUtils]: 2: Hoare triple {40477#true} assume true; {40477#true} is VALID [2022-04-08 03:54:51,499 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {40477#true} {40483#(<= main_~r~0 (* main_~l~0 2))} #118#return; {40483#(<= main_~r~0 (* main_~l~0 2))} is VALID [2022-04-08 03:54:51,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-04-08 03:54:51,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:54:51,502 INFO L290 TraceCheckUtils]: 0: Hoare triple {40477#true} ~cond := #in~cond; {40477#true} is VALID [2022-04-08 03:54:51,502 INFO L290 TraceCheckUtils]: 1: Hoare triple {40477#true} assume !(0 == ~cond); {40477#true} is VALID [2022-04-08 03:54:51,502 INFO L290 TraceCheckUtils]: 2: Hoare triple {40477#true} assume true; {40477#true} is VALID [2022-04-08 03:54:51,502 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {40477#true} {40483#(<= main_~r~0 (* main_~l~0 2))} #120#return; {40483#(<= main_~r~0 (* main_~l~0 2))} is VALID [2022-04-08 03:54:51,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-04-08 03:54:51,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:54:51,504 INFO L290 TraceCheckUtils]: 0: Hoare triple {40477#true} ~cond := #in~cond; {40477#true} is VALID [2022-04-08 03:54:51,504 INFO L290 TraceCheckUtils]: 1: Hoare triple {40477#true} assume !(0 == ~cond); {40477#true} is VALID [2022-04-08 03:54:51,505 INFO L290 TraceCheckUtils]: 2: Hoare triple {40477#true} assume true; {40477#true} is VALID [2022-04-08 03:54:51,505 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {40477#true} {40492#(<= (+ main_~r~0 4) (* main_~l~0 4))} #130#return; {40492#(<= (+ main_~r~0 4) (* main_~l~0 4))} is VALID [2022-04-08 03:54:51,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-04-08 03:54:51,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:54:51,507 INFO L290 TraceCheckUtils]: 0: Hoare triple {40477#true} ~cond := #in~cond; {40477#true} is VALID [2022-04-08 03:54:51,507 INFO L290 TraceCheckUtils]: 1: Hoare triple {40477#true} assume !(0 == ~cond); {40477#true} is VALID [2022-04-08 03:54:51,507 INFO L290 TraceCheckUtils]: 2: Hoare triple {40477#true} assume true; {40477#true} is VALID [2022-04-08 03:54:51,508 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {40477#true} {40492#(<= (+ main_~r~0 4) (* main_~l~0 4))} #132#return; {40492#(<= (+ main_~r~0 4) (* main_~l~0 4))} is VALID [2022-04-08 03:54:51,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-04-08 03:54:51,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:54:51,510 INFO L290 TraceCheckUtils]: 0: Hoare triple {40477#true} ~cond := #in~cond; {40477#true} is VALID [2022-04-08 03:54:51,510 INFO L290 TraceCheckUtils]: 1: Hoare triple {40477#true} assume !(0 == ~cond); {40477#true} is VALID [2022-04-08 03:54:51,510 INFO L290 TraceCheckUtils]: 2: Hoare triple {40477#true} assume true; {40477#true} is VALID [2022-04-08 03:54:51,511 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {40477#true} {40502#(<= main_~r~0 (* main_~j~0 2))} #110#return; {40502#(<= main_~r~0 (* main_~j~0 2))} is VALID [2022-04-08 03:54:51,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-04-08 03:54:51,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:54:51,513 INFO L290 TraceCheckUtils]: 0: Hoare triple {40477#true} ~cond := #in~cond; {40477#true} is VALID [2022-04-08 03:54:51,513 INFO L290 TraceCheckUtils]: 1: Hoare triple {40477#true} assume !(0 == ~cond); {40477#true} is VALID [2022-04-08 03:54:51,513 INFO L290 TraceCheckUtils]: 2: Hoare triple {40477#true} assume true; {40477#true} is VALID [2022-04-08 03:54:51,514 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {40477#true} {40502#(<= main_~r~0 (* main_~j~0 2))} #112#return; {40502#(<= main_~r~0 (* main_~j~0 2))} is VALID [2022-04-08 03:54:51,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-04-08 03:54:51,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:54:51,519 INFO L290 TraceCheckUtils]: 0: Hoare triple {40477#true} ~cond := #in~cond; {40477#true} is VALID [2022-04-08 03:54:51,519 INFO L290 TraceCheckUtils]: 1: Hoare triple {40477#true} assume !(0 == ~cond); {40477#true} is VALID [2022-04-08 03:54:51,519 INFO L290 TraceCheckUtils]: 2: Hoare triple {40477#true} assume true; {40477#true} is VALID [2022-04-08 03:54:51,519 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {40477#true} {40502#(<= main_~r~0 (* main_~j~0 2))} #114#return; {40502#(<= main_~r~0 (* main_~j~0 2))} is VALID [2022-04-08 03:54:51,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-04-08 03:54:51,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:54:51,522 INFO L290 TraceCheckUtils]: 0: Hoare triple {40477#true} ~cond := #in~cond; {40477#true} is VALID [2022-04-08 03:54:51,522 INFO L290 TraceCheckUtils]: 1: Hoare triple {40477#true} assume !(0 == ~cond); {40477#true} is VALID [2022-04-08 03:54:51,522 INFO L290 TraceCheckUtils]: 2: Hoare triple {40477#true} assume true; {40477#true} is VALID [2022-04-08 03:54:51,522 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {40477#true} {40502#(<= main_~r~0 (* main_~j~0 2))} #116#return; {40502#(<= main_~r~0 (* main_~j~0 2))} is VALID [2022-04-08 03:54:51,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-04-08 03:54:51,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:54:51,524 INFO L290 TraceCheckUtils]: 0: Hoare triple {40477#true} ~cond := #in~cond; {40477#true} is VALID [2022-04-08 03:54:51,525 INFO L290 TraceCheckUtils]: 1: Hoare triple {40477#true} assume !(0 == ~cond); {40477#true} is VALID [2022-04-08 03:54:51,525 INFO L290 TraceCheckUtils]: 2: Hoare triple {40477#true} assume true; {40477#true} is VALID [2022-04-08 03:54:51,525 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {40477#true} {40519#(<= (+ main_~r~0 2) (* main_~j~0 2))} #118#return; {40519#(<= (+ main_~r~0 2) (* main_~j~0 2))} is VALID [2022-04-08 03:54:51,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-04-08 03:54:51,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:54:51,528 INFO L290 TraceCheckUtils]: 0: Hoare triple {40477#true} ~cond := #in~cond; {40477#true} is VALID [2022-04-08 03:54:51,528 INFO L290 TraceCheckUtils]: 1: Hoare triple {40477#true} assume !(0 == ~cond); {40477#true} is VALID [2022-04-08 03:54:51,528 INFO L290 TraceCheckUtils]: 2: Hoare triple {40477#true} assume true; {40477#true} is VALID [2022-04-08 03:54:51,529 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {40477#true} {40519#(<= (+ main_~r~0 2) (* main_~j~0 2))} #120#return; {40519#(<= (+ main_~r~0 2) (* main_~j~0 2))} is VALID [2022-04-08 03:54:51,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-04-08 03:54:51,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:54:51,531 INFO L290 TraceCheckUtils]: 0: Hoare triple {40477#true} ~cond := #in~cond; {40477#true} is VALID [2022-04-08 03:54:51,531 INFO L290 TraceCheckUtils]: 1: Hoare triple {40477#true} assume !(0 == ~cond); {40477#true} is VALID [2022-04-08 03:54:51,531 INFO L290 TraceCheckUtils]: 2: Hoare triple {40477#true} assume true; {40477#true} is VALID [2022-04-08 03:54:51,531 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {40477#true} {40519#(<= (+ main_~r~0 2) (* main_~j~0 2))} #122#return; {40519#(<= (+ main_~r~0 2) (* main_~j~0 2))} is VALID [2022-04-08 03:54:51,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-04-08 03:54:51,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:54:51,533 INFO L290 TraceCheckUtils]: 0: Hoare triple {40477#true} ~cond := #in~cond; {40477#true} is VALID [2022-04-08 03:54:51,534 INFO L290 TraceCheckUtils]: 1: Hoare triple {40477#true} assume !(0 == ~cond); {40477#true} is VALID [2022-04-08 03:54:51,534 INFO L290 TraceCheckUtils]: 2: Hoare triple {40477#true} assume true; {40477#true} is VALID [2022-04-08 03:54:51,534 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {40477#true} {40519#(<= (+ main_~r~0 2) (* main_~j~0 2))} #124#return; {40519#(<= (+ main_~r~0 2) (* main_~j~0 2))} is VALID [2022-04-08 03:54:51,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-04-08 03:54:51,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:54:51,536 INFO L290 TraceCheckUtils]: 0: Hoare triple {40477#true} ~cond := #in~cond; {40477#true} is VALID [2022-04-08 03:54:51,536 INFO L290 TraceCheckUtils]: 1: Hoare triple {40477#true} assume !(0 == ~cond); {40477#true} is VALID [2022-04-08 03:54:51,536 INFO L290 TraceCheckUtils]: 2: Hoare triple {40477#true} assume true; {40477#true} is VALID [2022-04-08 03:54:51,537 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {40477#true} {40519#(<= (+ main_~r~0 2) (* main_~j~0 2))} #126#return; {40519#(<= (+ main_~r~0 2) (* main_~j~0 2))} is VALID [2022-04-08 03:54:51,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-04-08 03:54:51,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:54:51,540 INFO L290 TraceCheckUtils]: 0: Hoare triple {40477#true} ~cond := #in~cond; {40477#true} is VALID [2022-04-08 03:54:51,540 INFO L290 TraceCheckUtils]: 1: Hoare triple {40477#true} assume !(0 == ~cond); {40477#true} is VALID [2022-04-08 03:54:51,540 INFO L290 TraceCheckUtils]: 2: Hoare triple {40477#true} assume true; {40477#true} is VALID [2022-04-08 03:54:51,540 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {40477#true} {40519#(<= (+ main_~r~0 2) (* main_~j~0 2))} #128#return; {40519#(<= (+ main_~r~0 2) (* main_~j~0 2))} is VALID [2022-04-08 03:54:51,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-04-08 03:54:51,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:54:51,542 INFO L290 TraceCheckUtils]: 0: Hoare triple {40477#true} ~cond := #in~cond; {40477#true} is VALID [2022-04-08 03:54:51,542 INFO L290 TraceCheckUtils]: 1: Hoare triple {40477#true} assume !(0 == ~cond); {40477#true} is VALID [2022-04-08 03:54:51,543 INFO L290 TraceCheckUtils]: 2: Hoare triple {40477#true} assume true; {40477#true} is VALID [2022-04-08 03:54:51,543 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {40477#true} {40478#false} #118#return; {40478#false} is VALID [2022-04-08 03:54:51,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-04-08 03:54:51,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:54:51,544 INFO L290 TraceCheckUtils]: 0: Hoare triple {40477#true} ~cond := #in~cond; {40477#true} is VALID [2022-04-08 03:54:51,545 INFO L290 TraceCheckUtils]: 1: Hoare triple {40477#true} assume !(0 == ~cond); {40477#true} is VALID [2022-04-08 03:54:51,545 INFO L290 TraceCheckUtils]: 2: Hoare triple {40477#true} assume true; {40477#true} is VALID [2022-04-08 03:54:51,545 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {40477#true} {40478#false} #120#return; {40478#false} is VALID [2022-04-08 03:54:51,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-04-08 03:54:51,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:54:51,546 INFO L290 TraceCheckUtils]: 0: Hoare triple {40477#true} ~cond := #in~cond; {40477#true} is VALID [2022-04-08 03:54:51,547 INFO L290 TraceCheckUtils]: 1: Hoare triple {40477#true} assume !(0 == ~cond); {40477#true} is VALID [2022-04-08 03:54:51,547 INFO L290 TraceCheckUtils]: 2: Hoare triple {40477#true} assume true; {40477#true} is VALID [2022-04-08 03:54:51,547 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {40477#true} {40478#false} #122#return; {40478#false} is VALID [2022-04-08 03:54:51,547 INFO L272 TraceCheckUtils]: 0: Hoare triple {40477#true} call ULTIMATE.init(); {40557#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 03:54:51,547 INFO L290 TraceCheckUtils]: 1: Hoare triple {40557#(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(9, 2); {40477#true} is VALID [2022-04-08 03:54:51,547 INFO L290 TraceCheckUtils]: 2: Hoare triple {40477#true} assume true; {40477#true} is VALID [2022-04-08 03:54:51,547 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {40477#true} {40477#true} #138#return; {40477#true} is VALID [2022-04-08 03:54:51,548 INFO L272 TraceCheckUtils]: 4: Hoare triple {40477#true} call #t~ret8 := main(#in~argc, #in~argv.base, #in~argv.offset); {40477#true} is VALID [2022-04-08 03:54:51,548 INFO L290 TraceCheckUtils]: 5: Hoare triple {40477#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;havoc ~n~0;havoc ~l~0;havoc ~r~0;havoc ~i~0;havoc ~j~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {40477#true} is VALID [2022-04-08 03:54:51,548 INFO L290 TraceCheckUtils]: 6: Hoare triple {40477#true} assume !!(1 <= ~n~0 && ~n~0 <= 1000000);~l~0 := 1 + (if ~n~0 < 0 && 0 != ~n~0 % 2 then 1 + ~n~0 / 2 else ~n~0 / 2);~r~0 := ~n~0; {40477#true} is VALID [2022-04-08 03:54:51,548 INFO L290 TraceCheckUtils]: 7: Hoare triple {40477#true} assume ~l~0 > 1;#t~post2 := ~l~0;~l~0 := #t~post2 - 1;havoc #t~post2; {40477#true} is VALID [2022-04-08 03:54:51,548 INFO L290 TraceCheckUtils]: 8: Hoare triple {40477#true} assume !!(~r~0 > 1);~i~0 := ~l~0;~j~0 := 2 * ~l~0; {40482#(<= main_~j~0 (* main_~l~0 2))} is VALID [2022-04-08 03:54:51,548 INFO L290 TraceCheckUtils]: 9: Hoare triple {40482#(<= main_~j~0 (* main_~l~0 2))} assume !!(~j~0 <= ~r~0); {40482#(<= main_~j~0 (* main_~l~0 2))} is VALID [2022-04-08 03:54:51,549 INFO L290 TraceCheckUtils]: 10: Hoare triple {40482#(<= main_~j~0 (* main_~l~0 2))} assume !(~j~0 < ~r~0); {40483#(<= main_~r~0 (* main_~l~0 2))} is VALID [2022-04-08 03:54:51,549 INFO L272 TraceCheckUtils]: 11: Hoare triple {40483#(<= main_~r~0 (* main_~l~0 2))} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {40477#true} is VALID [2022-04-08 03:54:51,549 INFO L290 TraceCheckUtils]: 12: Hoare triple {40477#true} ~cond := #in~cond; {40477#true} is VALID [2022-04-08 03:54:51,549 INFO L290 TraceCheckUtils]: 13: Hoare triple {40477#true} assume !(0 == ~cond); {40477#true} is VALID [2022-04-08 03:54:51,549 INFO L290 TraceCheckUtils]: 14: Hoare triple {40477#true} assume true; {40477#true} is VALID [2022-04-08 03:54:51,550 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {40477#true} {40483#(<= main_~r~0 (* main_~l~0 2))} #118#return; {40483#(<= main_~r~0 (* main_~l~0 2))} is VALID [2022-04-08 03:54:51,550 INFO L272 TraceCheckUtils]: 16: Hoare triple {40483#(<= main_~r~0 (* main_~l~0 2))} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {40477#true} is VALID [2022-04-08 03:54:51,550 INFO L290 TraceCheckUtils]: 17: Hoare triple {40477#true} ~cond := #in~cond; {40477#true} is VALID [2022-04-08 03:54:51,550 INFO L290 TraceCheckUtils]: 18: Hoare triple {40477#true} assume !(0 == ~cond); {40477#true} is VALID [2022-04-08 03:54:51,550 INFO L290 TraceCheckUtils]: 19: Hoare triple {40477#true} assume true; {40477#true} is VALID [2022-04-08 03:54:51,550 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {40477#true} {40483#(<= main_~r~0 (* main_~l~0 2))} #120#return; {40483#(<= main_~r~0 (* main_~l~0 2))} is VALID [2022-04-08 03:54:51,551 INFO L290 TraceCheckUtils]: 21: Hoare triple {40483#(<= main_~r~0 (* main_~l~0 2))} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {40483#(<= main_~r~0 (* main_~l~0 2))} is VALID [2022-04-08 03:54:51,551 INFO L290 TraceCheckUtils]: 22: Hoare triple {40483#(<= main_~r~0 (* main_~l~0 2))} assume 0 != #t~nondet5;havoc #t~nondet5; {40483#(<= main_~r~0 (* main_~l~0 2))} is VALID [2022-04-08 03:54:51,551 INFO L290 TraceCheckUtils]: 23: Hoare triple {40483#(<= main_~r~0 (* main_~l~0 2))} assume ~l~0 > 1; {40492#(<= (+ main_~r~0 4) (* main_~l~0 4))} is VALID [2022-04-08 03:54:51,552 INFO L272 TraceCheckUtils]: 24: Hoare triple {40492#(<= (+ main_~r~0 4) (* main_~l~0 4))} call __VERIFIER_assert((if 1 <= ~l~0 then 1 else 0)); {40477#true} is VALID [2022-04-08 03:54:51,552 INFO L290 TraceCheckUtils]: 25: Hoare triple {40477#true} ~cond := #in~cond; {40477#true} is VALID [2022-04-08 03:54:51,552 INFO L290 TraceCheckUtils]: 26: Hoare triple {40477#true} assume !(0 == ~cond); {40477#true} is VALID [2022-04-08 03:54:51,552 INFO L290 TraceCheckUtils]: 27: Hoare triple {40477#true} assume true; {40477#true} is VALID [2022-04-08 03:54:51,552 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {40477#true} {40492#(<= (+ main_~r~0 4) (* main_~l~0 4))} #130#return; {40492#(<= (+ main_~r~0 4) (* main_~l~0 4))} is VALID [2022-04-08 03:54:51,552 INFO L272 TraceCheckUtils]: 29: Hoare triple {40492#(<= (+ main_~r~0 4) (* main_~l~0 4))} call __VERIFIER_assert((if ~l~0 <= ~n~0 then 1 else 0)); {40477#true} is VALID [2022-04-08 03:54:51,552 INFO L290 TraceCheckUtils]: 30: Hoare triple {40477#true} ~cond := #in~cond; {40477#true} is VALID [2022-04-08 03:54:51,552 INFO L290 TraceCheckUtils]: 31: Hoare triple {40477#true} assume !(0 == ~cond); {40477#true} is VALID [2022-04-08 03:54:51,553 INFO L290 TraceCheckUtils]: 32: Hoare triple {40477#true} assume true; {40477#true} is VALID [2022-04-08 03:54:51,553 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {40477#true} {40492#(<= (+ main_~r~0 4) (* main_~l~0 4))} #132#return; {40492#(<= (+ main_~r~0 4) (* main_~l~0 4))} is VALID [2022-04-08 03:54:51,553 INFO L290 TraceCheckUtils]: 34: Hoare triple {40492#(<= (+ main_~r~0 4) (* main_~l~0 4))} #t~post6 := ~l~0;~l~0 := #t~post6 - 1;havoc #t~post6; {40501#(<= main_~r~0 (* main_~l~0 4))} is VALID [2022-04-08 03:54:51,554 INFO L290 TraceCheckUtils]: 35: Hoare triple {40501#(<= main_~r~0 (* main_~l~0 4))} assume !!(~r~0 > 1);~i~0 := ~l~0;~j~0 := 2 * ~l~0; {40502#(<= main_~r~0 (* main_~j~0 2))} is VALID [2022-04-08 03:54:51,554 INFO L290 TraceCheckUtils]: 36: Hoare triple {40502#(<= main_~r~0 (* main_~j~0 2))} assume !!(~j~0 <= ~r~0); {40502#(<= main_~r~0 (* main_~j~0 2))} is VALID [2022-04-08 03:54:51,554 INFO L290 TraceCheckUtils]: 37: Hoare triple {40502#(<= main_~r~0 (* main_~j~0 2))} assume ~j~0 < ~r~0; {40502#(<= main_~r~0 (* main_~j~0 2))} is VALID [2022-04-08 03:54:51,554 INFO L272 TraceCheckUtils]: 38: Hoare triple {40502#(<= main_~r~0 (* main_~j~0 2))} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {40477#true} is VALID [2022-04-08 03:54:51,555 INFO L290 TraceCheckUtils]: 39: Hoare triple {40477#true} ~cond := #in~cond; {40477#true} is VALID [2022-04-08 03:54:51,555 INFO L290 TraceCheckUtils]: 40: Hoare triple {40477#true} assume !(0 == ~cond); {40477#true} is VALID [2022-04-08 03:54:51,555 INFO L290 TraceCheckUtils]: 41: Hoare triple {40477#true} assume true; {40477#true} is VALID [2022-04-08 03:54:51,555 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {40477#true} {40502#(<= main_~r~0 (* main_~j~0 2))} #110#return; {40502#(<= main_~r~0 (* main_~j~0 2))} is VALID [2022-04-08 03:54:51,555 INFO L272 TraceCheckUtils]: 43: Hoare triple {40502#(<= main_~r~0 (* main_~j~0 2))} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {40477#true} is VALID [2022-04-08 03:54:51,555 INFO L290 TraceCheckUtils]: 44: Hoare triple {40477#true} ~cond := #in~cond; {40477#true} is VALID [2022-04-08 03:54:51,555 INFO L290 TraceCheckUtils]: 45: Hoare triple {40477#true} assume !(0 == ~cond); {40477#true} is VALID [2022-04-08 03:54:51,555 INFO L290 TraceCheckUtils]: 46: Hoare triple {40477#true} assume true; {40477#true} is VALID [2022-04-08 03:54:51,556 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {40477#true} {40502#(<= main_~r~0 (* main_~j~0 2))} #112#return; {40502#(<= main_~r~0 (* main_~j~0 2))} is VALID [2022-04-08 03:54:51,556 INFO L272 TraceCheckUtils]: 48: Hoare triple {40502#(<= main_~r~0 (* main_~j~0 2))} call __VERIFIER_assert((if 1 <= 1 + ~j~0 then 1 else 0)); {40477#true} is VALID [2022-04-08 03:54:51,556 INFO L290 TraceCheckUtils]: 49: Hoare triple {40477#true} ~cond := #in~cond; {40477#true} is VALID [2022-04-08 03:54:51,556 INFO L290 TraceCheckUtils]: 50: Hoare triple {40477#true} assume !(0 == ~cond); {40477#true} is VALID [2022-04-08 03:54:51,556 INFO L290 TraceCheckUtils]: 51: Hoare triple {40477#true} assume true; {40477#true} is VALID [2022-04-08 03:54:51,557 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {40477#true} {40502#(<= main_~r~0 (* main_~j~0 2))} #114#return; {40502#(<= main_~r~0 (* main_~j~0 2))} is VALID [2022-04-08 03:54:51,557 INFO L272 TraceCheckUtils]: 53: Hoare triple {40502#(<= main_~r~0 (* main_~j~0 2))} call __VERIFIER_assert((if 1 + ~j~0 <= ~n~0 then 1 else 0)); {40477#true} is VALID [2022-04-08 03:54:51,557 INFO L290 TraceCheckUtils]: 54: Hoare triple {40477#true} ~cond := #in~cond; {40477#true} is VALID [2022-04-08 03:54:51,557 INFO L290 TraceCheckUtils]: 55: Hoare triple {40477#true} assume !(0 == ~cond); {40477#true} is VALID [2022-04-08 03:54:51,557 INFO L290 TraceCheckUtils]: 56: Hoare triple {40477#true} assume true; {40477#true} is VALID [2022-04-08 03:54:51,557 INFO L284 TraceCheckUtils]: 57: Hoare quadruple {40477#true} {40502#(<= main_~r~0 (* main_~j~0 2))} #116#return; {40502#(<= main_~r~0 (* main_~j~0 2))} is VALID [2022-04-08 03:54:51,558 INFO L290 TraceCheckUtils]: 58: Hoare triple {40502#(<= main_~r~0 (* main_~j~0 2))} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {40502#(<= main_~r~0 (* main_~j~0 2))} is VALID [2022-04-08 03:54:51,558 INFO L290 TraceCheckUtils]: 59: Hoare triple {40502#(<= main_~r~0 (* main_~j~0 2))} assume 0 != #t~nondet4;havoc #t~nondet4;~j~0 := 1 + ~j~0; {40519#(<= (+ main_~r~0 2) (* main_~j~0 2))} is VALID [2022-04-08 03:54:51,558 INFO L272 TraceCheckUtils]: 60: Hoare triple {40519#(<= (+ main_~r~0 2) (* main_~j~0 2))} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {40477#true} is VALID [2022-04-08 03:54:51,558 INFO L290 TraceCheckUtils]: 61: Hoare triple {40477#true} ~cond := #in~cond; {40477#true} is VALID [2022-04-08 03:54:51,558 INFO L290 TraceCheckUtils]: 62: Hoare triple {40477#true} assume !(0 == ~cond); {40477#true} is VALID [2022-04-08 03:54:51,558 INFO L290 TraceCheckUtils]: 63: Hoare triple {40477#true} assume true; {40477#true} is VALID [2022-04-08 03:54:51,559 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {40477#true} {40519#(<= (+ main_~r~0 2) (* main_~j~0 2))} #118#return; {40519#(<= (+ main_~r~0 2) (* main_~j~0 2))} is VALID [2022-04-08 03:54:51,559 INFO L272 TraceCheckUtils]: 65: Hoare triple {40519#(<= (+ main_~r~0 2) (* main_~j~0 2))} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {40477#true} is VALID [2022-04-08 03:54:51,559 INFO L290 TraceCheckUtils]: 66: Hoare triple {40477#true} ~cond := #in~cond; {40477#true} is VALID [2022-04-08 03:54:51,559 INFO L290 TraceCheckUtils]: 67: Hoare triple {40477#true} assume !(0 == ~cond); {40477#true} is VALID [2022-04-08 03:54:51,559 INFO L290 TraceCheckUtils]: 68: Hoare triple {40477#true} assume true; {40477#true} is VALID [2022-04-08 03:54:51,559 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {40477#true} {40519#(<= (+ main_~r~0 2) (* main_~j~0 2))} #120#return; {40519#(<= (+ main_~r~0 2) (* main_~j~0 2))} is VALID [2022-04-08 03:54:51,560 INFO L290 TraceCheckUtils]: 70: Hoare triple {40519#(<= (+ main_~r~0 2) (* main_~j~0 2))} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {40519#(<= (+ main_~r~0 2) (* main_~j~0 2))} is VALID [2022-04-08 03:54:51,560 INFO L290 TraceCheckUtils]: 71: Hoare triple {40519#(<= (+ main_~r~0 2) (* main_~j~0 2))} assume !(0 != #t~nondet5);havoc #t~nondet5; {40519#(<= (+ main_~r~0 2) (* main_~j~0 2))} is VALID [2022-04-08 03:54:51,560 INFO L272 TraceCheckUtils]: 72: Hoare triple {40519#(<= (+ main_~r~0 2) (* main_~j~0 2))} call __VERIFIER_assert((if 1 <= ~i~0 then 1 else 0)); {40477#true} is VALID [2022-04-08 03:54:51,560 INFO L290 TraceCheckUtils]: 73: Hoare triple {40477#true} ~cond := #in~cond; {40477#true} is VALID [2022-04-08 03:54:51,560 INFO L290 TraceCheckUtils]: 74: Hoare triple {40477#true} assume !(0 == ~cond); {40477#true} is VALID [2022-04-08 03:54:51,560 INFO L290 TraceCheckUtils]: 75: Hoare triple {40477#true} assume true; {40477#true} is VALID [2022-04-08 03:54:51,561 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {40477#true} {40519#(<= (+ main_~r~0 2) (* main_~j~0 2))} #122#return; {40519#(<= (+ main_~r~0 2) (* main_~j~0 2))} is VALID [2022-04-08 03:54:51,561 INFO L272 TraceCheckUtils]: 77: Hoare triple {40519#(<= (+ main_~r~0 2) (* main_~j~0 2))} call __VERIFIER_assert((if ~i~0 <= ~n~0 then 1 else 0)); {40477#true} is VALID [2022-04-08 03:54:51,561 INFO L290 TraceCheckUtils]: 78: Hoare triple {40477#true} ~cond := #in~cond; {40477#true} is VALID [2022-04-08 03:54:51,561 INFO L290 TraceCheckUtils]: 79: Hoare triple {40477#true} assume !(0 == ~cond); {40477#true} is VALID [2022-04-08 03:54:51,561 INFO L290 TraceCheckUtils]: 80: Hoare triple {40477#true} assume true; {40477#true} is VALID [2022-04-08 03:54:51,562 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {40477#true} {40519#(<= (+ main_~r~0 2) (* main_~j~0 2))} #124#return; {40519#(<= (+ main_~r~0 2) (* main_~j~0 2))} is VALID [2022-04-08 03:54:51,562 INFO L272 TraceCheckUtils]: 82: Hoare triple {40519#(<= (+ main_~r~0 2) (* main_~j~0 2))} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {40477#true} is VALID [2022-04-08 03:54:51,562 INFO L290 TraceCheckUtils]: 83: Hoare triple {40477#true} ~cond := #in~cond; {40477#true} is VALID [2022-04-08 03:54:51,562 INFO L290 TraceCheckUtils]: 84: Hoare triple {40477#true} assume !(0 == ~cond); {40477#true} is VALID [2022-04-08 03:54:51,562 INFO L290 TraceCheckUtils]: 85: Hoare triple {40477#true} assume true; {40477#true} is VALID [2022-04-08 03:54:51,562 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {40477#true} {40519#(<= (+ main_~r~0 2) (* main_~j~0 2))} #126#return; {40519#(<= (+ main_~r~0 2) (* main_~j~0 2))} is VALID [2022-04-08 03:54:51,562 INFO L272 TraceCheckUtils]: 87: Hoare triple {40519#(<= (+ main_~r~0 2) (* main_~j~0 2))} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {40477#true} is VALID [2022-04-08 03:54:51,563 INFO L290 TraceCheckUtils]: 88: Hoare triple {40477#true} ~cond := #in~cond; {40477#true} is VALID [2022-04-08 03:54:51,563 INFO L290 TraceCheckUtils]: 89: Hoare triple {40477#true} assume !(0 == ~cond); {40477#true} is VALID [2022-04-08 03:54:51,563 INFO L290 TraceCheckUtils]: 90: Hoare triple {40477#true} assume true; {40477#true} is VALID [2022-04-08 03:54:51,563 INFO L284 TraceCheckUtils]: 91: Hoare quadruple {40477#true} {40519#(<= (+ main_~r~0 2) (* main_~j~0 2))} #128#return; {40519#(<= (+ main_~r~0 2) (* main_~j~0 2))} is VALID [2022-04-08 03:54:51,563 INFO L290 TraceCheckUtils]: 92: Hoare triple {40519#(<= (+ main_~r~0 2) (* main_~j~0 2))} ~i~0 := ~j~0;~j~0 := 2 * ~j~0; {40544#(<= (+ main_~r~0 2) main_~j~0)} is VALID [2022-04-08 03:54:51,564 INFO L290 TraceCheckUtils]: 93: Hoare triple {40544#(<= (+ main_~r~0 2) main_~j~0)} assume !!(~j~0 <= ~r~0); {40478#false} is VALID [2022-04-08 03:54:51,564 INFO L290 TraceCheckUtils]: 94: Hoare triple {40478#false} assume !(~j~0 < ~r~0); {40478#false} is VALID [2022-04-08 03:54:51,564 INFO L272 TraceCheckUtils]: 95: Hoare triple {40478#false} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {40477#true} is VALID [2022-04-08 03:54:51,564 INFO L290 TraceCheckUtils]: 96: Hoare triple {40477#true} ~cond := #in~cond; {40477#true} is VALID [2022-04-08 03:54:51,564 INFO L290 TraceCheckUtils]: 97: Hoare triple {40477#true} assume !(0 == ~cond); {40477#true} is VALID [2022-04-08 03:54:51,564 INFO L290 TraceCheckUtils]: 98: Hoare triple {40477#true} assume true; {40477#true} is VALID [2022-04-08 03:54:51,564 INFO L284 TraceCheckUtils]: 99: Hoare quadruple {40477#true} {40478#false} #118#return; {40478#false} is VALID [2022-04-08 03:54:51,564 INFO L272 TraceCheckUtils]: 100: Hoare triple {40478#false} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {40477#true} is VALID [2022-04-08 03:54:51,565 INFO L290 TraceCheckUtils]: 101: Hoare triple {40477#true} ~cond := #in~cond; {40477#true} is VALID [2022-04-08 03:54:51,567 INFO L290 TraceCheckUtils]: 102: Hoare triple {40477#true} assume !(0 == ~cond); {40477#true} is VALID [2022-04-08 03:54:51,568 INFO L290 TraceCheckUtils]: 103: Hoare triple {40477#true} assume true; {40477#true} is VALID [2022-04-08 03:54:51,568 INFO L284 TraceCheckUtils]: 104: Hoare quadruple {40477#true} {40478#false} #120#return; {40478#false} is VALID [2022-04-08 03:54:51,568 INFO L290 TraceCheckUtils]: 105: Hoare triple {40478#false} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {40478#false} is VALID [2022-04-08 03:54:51,570 INFO L290 TraceCheckUtils]: 106: Hoare triple {40478#false} assume !(0 != #t~nondet5);havoc #t~nondet5; {40478#false} is VALID [2022-04-08 03:54:51,570 INFO L272 TraceCheckUtils]: 107: Hoare triple {40478#false} call __VERIFIER_assert((if 1 <= ~i~0 then 1 else 0)); {40477#true} is VALID [2022-04-08 03:54:51,570 INFO L290 TraceCheckUtils]: 108: Hoare triple {40477#true} ~cond := #in~cond; {40477#true} is VALID [2022-04-08 03:54:51,570 INFO L290 TraceCheckUtils]: 109: Hoare triple {40477#true} assume !(0 == ~cond); {40477#true} is VALID [2022-04-08 03:54:51,570 INFO L290 TraceCheckUtils]: 110: Hoare triple {40477#true} assume true; {40477#true} is VALID [2022-04-08 03:54:51,571 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {40477#true} {40478#false} #122#return; {40478#false} is VALID [2022-04-08 03:54:51,571 INFO L272 TraceCheckUtils]: 112: Hoare triple {40478#false} call __VERIFIER_assert((if ~i~0 <= ~n~0 then 1 else 0)); {40478#false} is VALID [2022-04-08 03:54:51,571 INFO L290 TraceCheckUtils]: 113: Hoare triple {40478#false} ~cond := #in~cond; {40478#false} is VALID [2022-04-08 03:54:51,571 INFO L290 TraceCheckUtils]: 114: Hoare triple {40478#false} assume 0 == ~cond; {40478#false} is VALID [2022-04-08 03:54:51,571 INFO L290 TraceCheckUtils]: 115: Hoare triple {40478#false} assume !false; {40478#false} is VALID [2022-04-08 03:54:51,571 INFO L134 CoverageAnalysis]: Checked inductivity of 599 backedges. 47 proven. 8 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2022-04-08 03:54:51,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 03:54:51,572 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1629815900] [2022-04-08 03:54:51,572 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1629815900] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 03:54:51,572 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [595500649] [2022-04-08 03:54:51,572 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 03:54:51,572 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 03:54:51,572 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 03:54:51,575 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 03:54:51,575 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 03:54:51,635 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 03:54:51,636 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 03:54:51,636 INFO L263 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-08 03:54:51,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:54:51,648 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 03:54:55,912 INFO L272 TraceCheckUtils]: 0: Hoare triple {40477#true} call ULTIMATE.init(); {40477#true} is VALID [2022-04-08 03:54:55,913 INFO L290 TraceCheckUtils]: 1: Hoare triple {40477#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(9, 2); {40477#true} is VALID [2022-04-08 03:54:55,913 INFO L290 TraceCheckUtils]: 2: Hoare triple {40477#true} assume true; {40477#true} is VALID [2022-04-08 03:54:55,913 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {40477#true} {40477#true} #138#return; {40477#true} is VALID [2022-04-08 03:54:55,913 INFO L272 TraceCheckUtils]: 4: Hoare triple {40477#true} call #t~ret8 := main(#in~argc, #in~argv.base, #in~argv.offset); {40477#true} is VALID [2022-04-08 03:54:55,913 INFO L290 TraceCheckUtils]: 5: Hoare triple {40477#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;havoc ~n~0;havoc ~l~0;havoc ~r~0;havoc ~i~0;havoc ~j~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {40477#true} is VALID [2022-04-08 03:54:55,913 INFO L290 TraceCheckUtils]: 6: Hoare triple {40477#true} assume !!(1 <= ~n~0 && ~n~0 <= 1000000);~l~0 := 1 + (if ~n~0 < 0 && 0 != ~n~0 % 2 then 1 + ~n~0 / 2 else ~n~0 / 2);~r~0 := ~n~0; {40477#true} is VALID [2022-04-08 03:54:55,913 INFO L290 TraceCheckUtils]: 7: Hoare triple {40477#true} assume ~l~0 > 1;#t~post2 := ~l~0;~l~0 := #t~post2 - 1;havoc #t~post2; {40477#true} is VALID [2022-04-08 03:54:55,914 INFO L290 TraceCheckUtils]: 8: Hoare triple {40477#true} assume !!(~r~0 > 1);~i~0 := ~l~0;~j~0 := 2 * ~l~0; {40482#(<= main_~j~0 (* main_~l~0 2))} is VALID [2022-04-08 03:54:55,914 INFO L290 TraceCheckUtils]: 9: Hoare triple {40482#(<= main_~j~0 (* main_~l~0 2))} assume !!(~j~0 <= ~r~0); {40482#(<= main_~j~0 (* main_~l~0 2))} is VALID [2022-04-08 03:54:55,915 INFO L290 TraceCheckUtils]: 10: Hoare triple {40482#(<= main_~j~0 (* main_~l~0 2))} assume !(~j~0 < ~r~0); {40483#(<= main_~r~0 (* main_~l~0 2))} is VALID [2022-04-08 03:54:55,915 INFO L272 TraceCheckUtils]: 11: Hoare triple {40483#(<= main_~r~0 (* main_~l~0 2))} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {40477#true} is VALID [2022-04-08 03:54:55,915 INFO L290 TraceCheckUtils]: 12: Hoare triple {40477#true} ~cond := #in~cond; {40477#true} is VALID [2022-04-08 03:54:55,915 INFO L290 TraceCheckUtils]: 13: Hoare triple {40477#true} assume !(0 == ~cond); {40477#true} is VALID [2022-04-08 03:54:55,915 INFO L290 TraceCheckUtils]: 14: Hoare triple {40477#true} assume true; {40477#true} is VALID [2022-04-08 03:54:55,915 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {40477#true} {40483#(<= main_~r~0 (* main_~l~0 2))} #118#return; {40483#(<= main_~r~0 (* main_~l~0 2))} is VALID [2022-04-08 03:54:55,916 INFO L272 TraceCheckUtils]: 16: Hoare triple {40483#(<= main_~r~0 (* main_~l~0 2))} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {40477#true} is VALID [2022-04-08 03:54:55,916 INFO L290 TraceCheckUtils]: 17: Hoare triple {40477#true} ~cond := #in~cond; {40477#true} is VALID [2022-04-08 03:54:55,916 INFO L290 TraceCheckUtils]: 18: Hoare triple {40477#true} assume !(0 == ~cond); {40477#true} is VALID [2022-04-08 03:54:55,916 INFO L290 TraceCheckUtils]: 19: Hoare triple {40477#true} assume true; {40477#true} is VALID [2022-04-08 03:54:55,916 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {40477#true} {40483#(<= main_~r~0 (* main_~l~0 2))} #120#return; {40483#(<= main_~r~0 (* main_~l~0 2))} is VALID [2022-04-08 03:54:55,917 INFO L290 TraceCheckUtils]: 21: Hoare triple {40483#(<= main_~r~0 (* main_~l~0 2))} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {40483#(<= main_~r~0 (* main_~l~0 2))} is VALID [2022-04-08 03:54:55,917 INFO L290 TraceCheckUtils]: 22: Hoare triple {40483#(<= main_~r~0 (* main_~l~0 2))} assume 0 != #t~nondet5;havoc #t~nondet5; {40483#(<= main_~r~0 (* main_~l~0 2))} is VALID [2022-04-08 03:54:55,917 INFO L290 TraceCheckUtils]: 23: Hoare triple {40483#(<= main_~r~0 (* main_~l~0 2))} assume ~l~0 > 1; {40630#(and (< 1 main_~l~0) (<= main_~r~0 (* main_~l~0 2)))} is VALID [2022-04-08 03:54:55,918 INFO L272 TraceCheckUtils]: 24: Hoare triple {40630#(and (< 1 main_~l~0) (<= main_~r~0 (* main_~l~0 2)))} call __VERIFIER_assert((if 1 <= ~l~0 then 1 else 0)); {40477#true} is VALID [2022-04-08 03:54:55,918 INFO L290 TraceCheckUtils]: 25: Hoare triple {40477#true} ~cond := #in~cond; {40477#true} is VALID [2022-04-08 03:54:55,918 INFO L290 TraceCheckUtils]: 26: Hoare triple {40477#true} assume !(0 == ~cond); {40477#true} is VALID [2022-04-08 03:54:55,918 INFO L290 TraceCheckUtils]: 27: Hoare triple {40477#true} assume true; {40477#true} is VALID [2022-04-08 03:54:55,918 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {40477#true} {40630#(and (< 1 main_~l~0) (<= main_~r~0 (* main_~l~0 2)))} #130#return; {40630#(and (< 1 main_~l~0) (<= main_~r~0 (* main_~l~0 2)))} is VALID [2022-04-08 03:54:55,918 INFO L272 TraceCheckUtils]: 29: Hoare triple {40630#(and (< 1 main_~l~0) (<= main_~r~0 (* main_~l~0 2)))} call __VERIFIER_assert((if ~l~0 <= ~n~0 then 1 else 0)); {40477#true} is VALID [2022-04-08 03:54:55,918 INFO L290 TraceCheckUtils]: 30: Hoare triple {40477#true} ~cond := #in~cond; {40477#true} is VALID [2022-04-08 03:54:55,919 INFO L290 TraceCheckUtils]: 31: Hoare triple {40477#true} assume !(0 == ~cond); {40477#true} is VALID [2022-04-08 03:54:55,919 INFO L290 TraceCheckUtils]: 32: Hoare triple {40477#true} assume true; {40477#true} is VALID [2022-04-08 03:54:55,919 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {40477#true} {40630#(and (< 1 main_~l~0) (<= main_~r~0 (* main_~l~0 2)))} #132#return; {40630#(and (< 1 main_~l~0) (<= main_~r~0 (* main_~l~0 2)))} is VALID [2022-04-08 03:54:55,920 INFO L290 TraceCheckUtils]: 34: Hoare triple {40630#(and (< 1 main_~l~0) (<= main_~r~0 (* main_~l~0 2)))} #t~post6 := ~l~0;~l~0 := #t~post6 - 1;havoc #t~post6; {40664#(and (<= (div (- main_~r~0) (- 2)) (+ main_~l~0 1)) (< 0 main_~l~0))} is VALID [2022-04-08 03:54:55,920 INFO L290 TraceCheckUtils]: 35: Hoare triple {40664#(and (<= (div (- main_~r~0) (- 2)) (+ main_~l~0 1)) (< 0 main_~l~0))} assume !!(~r~0 > 1);~i~0 := ~l~0;~j~0 := 2 * ~l~0; {40668#(and (<= (div (* (- 1) main_~r~0) (- 2)) (+ (div main_~j~0 2) 1)) (< 0 (div main_~j~0 2)))} is VALID [2022-04-08 03:54:55,921 INFO L290 TraceCheckUtils]: 36: Hoare triple {40668#(and (<= (div (* (- 1) main_~r~0) (- 2)) (+ (div main_~j~0 2) 1)) (< 0 (div main_~j~0 2)))} assume !!(~j~0 <= ~r~0); {40668#(and (<= (div (* (- 1) main_~r~0) (- 2)) (+ (div main_~j~0 2) 1)) (< 0 (div main_~j~0 2)))} is VALID [2022-04-08 03:54:55,921 INFO L290 TraceCheckUtils]: 37: Hoare triple {40668#(and (<= (div (* (- 1) main_~r~0) (- 2)) (+ (div main_~j~0 2) 1)) (< 0 (div main_~j~0 2)))} assume ~j~0 < ~r~0; {40668#(and (<= (div (* (- 1) main_~r~0) (- 2)) (+ (div main_~j~0 2) 1)) (< 0 (div main_~j~0 2)))} is VALID [2022-04-08 03:54:55,921 INFO L272 TraceCheckUtils]: 38: Hoare triple {40668#(and (<= (div (* (- 1) main_~r~0) (- 2)) (+ (div main_~j~0 2) 1)) (< 0 (div main_~j~0 2)))} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {40477#true} is VALID [2022-04-08 03:54:55,921 INFO L290 TraceCheckUtils]: 39: Hoare triple {40477#true} ~cond := #in~cond; {40477#true} is VALID [2022-04-08 03:54:55,921 INFO L290 TraceCheckUtils]: 40: Hoare triple {40477#true} assume !(0 == ~cond); {40477#true} is VALID [2022-04-08 03:54:55,922 INFO L290 TraceCheckUtils]: 41: Hoare triple {40477#true} assume true; {40477#true} is VALID [2022-04-08 03:54:55,922 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {40477#true} {40668#(and (<= (div (* (- 1) main_~r~0) (- 2)) (+ (div main_~j~0 2) 1)) (< 0 (div main_~j~0 2)))} #110#return; {40668#(and (<= (div (* (- 1) main_~r~0) (- 2)) (+ (div main_~j~0 2) 1)) (< 0 (div main_~j~0 2)))} is VALID [2022-04-08 03:54:55,922 INFO L272 TraceCheckUtils]: 43: Hoare triple {40668#(and (<= (div (* (- 1) main_~r~0) (- 2)) (+ (div main_~j~0 2) 1)) (< 0 (div main_~j~0 2)))} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {40477#true} is VALID [2022-04-08 03:54:55,922 INFO L290 TraceCheckUtils]: 44: Hoare triple {40477#true} ~cond := #in~cond; {40477#true} is VALID [2022-04-08 03:54:55,922 INFO L290 TraceCheckUtils]: 45: Hoare triple {40477#true} assume !(0 == ~cond); {40477#true} is VALID [2022-04-08 03:54:55,922 INFO L290 TraceCheckUtils]: 46: Hoare triple {40477#true} assume true; {40477#true} is VALID [2022-04-08 03:54:55,923 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {40477#true} {40668#(and (<= (div (* (- 1) main_~r~0) (- 2)) (+ (div main_~j~0 2) 1)) (< 0 (div main_~j~0 2)))} #112#return; {40668#(and (<= (div (* (- 1) main_~r~0) (- 2)) (+ (div main_~j~0 2) 1)) (< 0 (div main_~j~0 2)))} is VALID [2022-04-08 03:54:55,923 INFO L272 TraceCheckUtils]: 48: Hoare triple {40668#(and (<= (div (* (- 1) main_~r~0) (- 2)) (+ (div main_~j~0 2) 1)) (< 0 (div main_~j~0 2)))} call __VERIFIER_assert((if 1 <= 1 + ~j~0 then 1 else 0)); {40477#true} is VALID [2022-04-08 03:54:55,923 INFO L290 TraceCheckUtils]: 49: Hoare triple {40477#true} ~cond := #in~cond; {40477#true} is VALID [2022-04-08 03:54:55,923 INFO L290 TraceCheckUtils]: 50: Hoare triple {40477#true} assume !(0 == ~cond); {40477#true} is VALID [2022-04-08 03:54:55,923 INFO L290 TraceCheckUtils]: 51: Hoare triple {40477#true} assume true; {40477#true} is VALID [2022-04-08 03:54:55,924 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {40477#true} {40668#(and (<= (div (* (- 1) main_~r~0) (- 2)) (+ (div main_~j~0 2) 1)) (< 0 (div main_~j~0 2)))} #114#return; {40668#(and (<= (div (* (- 1) main_~r~0) (- 2)) (+ (div main_~j~0 2) 1)) (< 0 (div main_~j~0 2)))} is VALID [2022-04-08 03:54:55,924 INFO L272 TraceCheckUtils]: 53: Hoare triple {40668#(and (<= (div (* (- 1) main_~r~0) (- 2)) (+ (div main_~j~0 2) 1)) (< 0 (div main_~j~0 2)))} call __VERIFIER_assert((if 1 + ~j~0 <= ~n~0 then 1 else 0)); {40477#true} is VALID [2022-04-08 03:54:55,924 INFO L290 TraceCheckUtils]: 54: Hoare triple {40477#true} ~cond := #in~cond; {40477#true} is VALID [2022-04-08 03:54:55,924 INFO L290 TraceCheckUtils]: 55: Hoare triple {40477#true} assume !(0 == ~cond); {40477#true} is VALID [2022-04-08 03:54:55,924 INFO L290 TraceCheckUtils]: 56: Hoare triple {40477#true} assume true; {40477#true} is VALID [2022-04-08 03:54:55,924 INFO L284 TraceCheckUtils]: 57: Hoare quadruple {40477#true} {40668#(and (<= (div (* (- 1) main_~r~0) (- 2)) (+ (div main_~j~0 2) 1)) (< 0 (div main_~j~0 2)))} #116#return; {40668#(and (<= (div (* (- 1) main_~r~0) (- 2)) (+ (div main_~j~0 2) 1)) (< 0 (div main_~j~0 2)))} is VALID [2022-04-08 03:54:55,925 INFO L290 TraceCheckUtils]: 58: Hoare triple {40668#(and (<= (div (* (- 1) main_~r~0) (- 2)) (+ (div main_~j~0 2) 1)) (< 0 (div main_~j~0 2)))} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {40668#(and (<= (div (* (- 1) main_~r~0) (- 2)) (+ (div main_~j~0 2) 1)) (< 0 (div main_~j~0 2)))} is VALID [2022-04-08 03:54:55,926 INFO L290 TraceCheckUtils]: 59: Hoare triple {40668#(and (<= (div (* (- 1) main_~r~0) (- 2)) (+ (div main_~j~0 2) 1)) (< 0 (div main_~j~0 2)))} assume 0 != #t~nondet4;havoc #t~nondet4;~j~0 := 1 + ~j~0; {40741#(and (<= (div (* (- 1) main_~r~0) (- 2)) (+ (div (+ (- 1) main_~j~0) 2) 1)) (< 0 (div (+ (- 1) main_~j~0) 2)))} is VALID [2022-04-08 03:54:55,926 INFO L272 TraceCheckUtils]: 60: Hoare triple {40741#(and (<= (div (* (- 1) main_~r~0) (- 2)) (+ (div (+ (- 1) main_~j~0) 2) 1)) (< 0 (div (+ (- 1) main_~j~0) 2)))} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {40477#true} is VALID [2022-04-08 03:54:55,926 INFO L290 TraceCheckUtils]: 61: Hoare triple {40477#true} ~cond := #in~cond; {40477#true} is VALID [2022-04-08 03:54:55,926 INFO L290 TraceCheckUtils]: 62: Hoare triple {40477#true} assume !(0 == ~cond); {40477#true} is VALID [2022-04-08 03:54:55,926 INFO L290 TraceCheckUtils]: 63: Hoare triple {40477#true} assume true; {40477#true} is VALID [2022-04-08 03:54:55,927 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {40477#true} {40741#(and (<= (div (* (- 1) main_~r~0) (- 2)) (+ (div (+ (- 1) main_~j~0) 2) 1)) (< 0 (div (+ (- 1) main_~j~0) 2)))} #118#return; {40741#(and (<= (div (* (- 1) main_~r~0) (- 2)) (+ (div (+ (- 1) main_~j~0) 2) 1)) (< 0 (div (+ (- 1) main_~j~0) 2)))} is VALID [2022-04-08 03:54:55,927 INFO L272 TraceCheckUtils]: 65: Hoare triple {40741#(and (<= (div (* (- 1) main_~r~0) (- 2)) (+ (div (+ (- 1) main_~j~0) 2) 1)) (< 0 (div (+ (- 1) main_~j~0) 2)))} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {40477#true} is VALID [2022-04-08 03:54:55,927 INFO L290 TraceCheckUtils]: 66: Hoare triple {40477#true} ~cond := #in~cond; {40477#true} is VALID [2022-04-08 03:54:55,927 INFO L290 TraceCheckUtils]: 67: Hoare triple {40477#true} assume !(0 == ~cond); {40477#true} is VALID [2022-04-08 03:54:55,927 INFO L290 TraceCheckUtils]: 68: Hoare triple {40477#true} assume true; {40477#true} is VALID [2022-04-08 03:54:55,927 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {40477#true} {40741#(and (<= (div (* (- 1) main_~r~0) (- 2)) (+ (div (+ (- 1) main_~j~0) 2) 1)) (< 0 (div (+ (- 1) main_~j~0) 2)))} #120#return; {40741#(and (<= (div (* (- 1) main_~r~0) (- 2)) (+ (div (+ (- 1) main_~j~0) 2) 1)) (< 0 (div (+ (- 1) main_~j~0) 2)))} is VALID [2022-04-08 03:54:55,928 INFO L290 TraceCheckUtils]: 70: Hoare triple {40741#(and (<= (div (* (- 1) main_~r~0) (- 2)) (+ (div (+ (- 1) main_~j~0) 2) 1)) (< 0 (div (+ (- 1) main_~j~0) 2)))} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {40741#(and (<= (div (* (- 1) main_~r~0) (- 2)) (+ (div (+ (- 1) main_~j~0) 2) 1)) (< 0 (div (+ (- 1) main_~j~0) 2)))} is VALID [2022-04-08 03:54:55,928 INFO L290 TraceCheckUtils]: 71: Hoare triple {40741#(and (<= (div (* (- 1) main_~r~0) (- 2)) (+ (div (+ (- 1) main_~j~0) 2) 1)) (< 0 (div (+ (- 1) main_~j~0) 2)))} assume !(0 != #t~nondet5);havoc #t~nondet5; {40741#(and (<= (div (* (- 1) main_~r~0) (- 2)) (+ (div (+ (- 1) main_~j~0) 2) 1)) (< 0 (div (+ (- 1) main_~j~0) 2)))} is VALID [2022-04-08 03:54:55,928 INFO L272 TraceCheckUtils]: 72: Hoare triple {40741#(and (<= (div (* (- 1) main_~r~0) (- 2)) (+ (div (+ (- 1) main_~j~0) 2) 1)) (< 0 (div (+ (- 1) main_~j~0) 2)))} call __VERIFIER_assert((if 1 <= ~i~0 then 1 else 0)); {40477#true} is VALID [2022-04-08 03:54:55,929 INFO L290 TraceCheckUtils]: 73: Hoare triple {40477#true} ~cond := #in~cond; {40477#true} is VALID [2022-04-08 03:54:55,929 INFO L290 TraceCheckUtils]: 74: Hoare triple {40477#true} assume !(0 == ~cond); {40477#true} is VALID [2022-04-08 03:54:55,929 INFO L290 TraceCheckUtils]: 75: Hoare triple {40477#true} assume true; {40477#true} is VALID [2022-04-08 03:54:55,929 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {40477#true} {40741#(and (<= (div (* (- 1) main_~r~0) (- 2)) (+ (div (+ (- 1) main_~j~0) 2) 1)) (< 0 (div (+ (- 1) main_~j~0) 2)))} #122#return; {40741#(and (<= (div (* (- 1) main_~r~0) (- 2)) (+ (div (+ (- 1) main_~j~0) 2) 1)) (< 0 (div (+ (- 1) main_~j~0) 2)))} is VALID [2022-04-08 03:54:55,929 INFO L272 TraceCheckUtils]: 77: Hoare triple {40741#(and (<= (div (* (- 1) main_~r~0) (- 2)) (+ (div (+ (- 1) main_~j~0) 2) 1)) (< 0 (div (+ (- 1) main_~j~0) 2)))} call __VERIFIER_assert((if ~i~0 <= ~n~0 then 1 else 0)); {40477#true} is VALID [2022-04-08 03:54:55,929 INFO L290 TraceCheckUtils]: 78: Hoare triple {40477#true} ~cond := #in~cond; {40477#true} is VALID [2022-04-08 03:54:55,929 INFO L290 TraceCheckUtils]: 79: Hoare triple {40477#true} assume !(0 == ~cond); {40477#true} is VALID [2022-04-08 03:54:55,930 INFO L290 TraceCheckUtils]: 80: Hoare triple {40477#true} assume true; {40477#true} is VALID [2022-04-08 03:54:55,930 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {40477#true} {40741#(and (<= (div (* (- 1) main_~r~0) (- 2)) (+ (div (+ (- 1) main_~j~0) 2) 1)) (< 0 (div (+ (- 1) main_~j~0) 2)))} #124#return; {40741#(and (<= (div (* (- 1) main_~r~0) (- 2)) (+ (div (+ (- 1) main_~j~0) 2) 1)) (< 0 (div (+ (- 1) main_~j~0) 2)))} is VALID [2022-04-08 03:54:55,930 INFO L272 TraceCheckUtils]: 82: Hoare triple {40741#(and (<= (div (* (- 1) main_~r~0) (- 2)) (+ (div (+ (- 1) main_~j~0) 2) 1)) (< 0 (div (+ (- 1) main_~j~0) 2)))} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {40477#true} is VALID [2022-04-08 03:54:55,930 INFO L290 TraceCheckUtils]: 83: Hoare triple {40477#true} ~cond := #in~cond; {40477#true} is VALID [2022-04-08 03:54:55,930 INFO L290 TraceCheckUtils]: 84: Hoare triple {40477#true} assume !(0 == ~cond); {40477#true} is VALID [2022-04-08 03:54:55,931 INFO L290 TraceCheckUtils]: 85: Hoare triple {40477#true} assume true; {40477#true} is VALID [2022-04-08 03:54:55,931 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {40477#true} {40741#(and (<= (div (* (- 1) main_~r~0) (- 2)) (+ (div (+ (- 1) main_~j~0) 2) 1)) (< 0 (div (+ (- 1) main_~j~0) 2)))} #126#return; {40741#(and (<= (div (* (- 1) main_~r~0) (- 2)) (+ (div (+ (- 1) main_~j~0) 2) 1)) (< 0 (div (+ (- 1) main_~j~0) 2)))} is VALID [2022-04-08 03:54:55,931 INFO L272 TraceCheckUtils]: 87: Hoare triple {40741#(and (<= (div (* (- 1) main_~r~0) (- 2)) (+ (div (+ (- 1) main_~j~0) 2) 1)) (< 0 (div (+ (- 1) main_~j~0) 2)))} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {40477#true} is VALID [2022-04-08 03:54:55,931 INFO L290 TraceCheckUtils]: 88: Hoare triple {40477#true} ~cond := #in~cond; {40477#true} is VALID [2022-04-08 03:54:55,931 INFO L290 TraceCheckUtils]: 89: Hoare triple {40477#true} assume !(0 == ~cond); {40477#true} is VALID [2022-04-08 03:54:55,931 INFO L290 TraceCheckUtils]: 90: Hoare triple {40477#true} assume true; {40477#true} is VALID [2022-04-08 03:54:55,932 INFO L284 TraceCheckUtils]: 91: Hoare quadruple {40477#true} {40741#(and (<= (div (* (- 1) main_~r~0) (- 2)) (+ (div (+ (- 1) main_~j~0) 2) 1)) (< 0 (div (+ (- 1) main_~j~0) 2)))} #128#return; {40741#(and (<= (div (* (- 1) main_~r~0) (- 2)) (+ (div (+ (- 1) main_~j~0) 2) 1)) (< 0 (div (+ (- 1) main_~j~0) 2)))} is VALID [2022-04-08 03:54:55,933 INFO L290 TraceCheckUtils]: 92: Hoare triple {40741#(and (<= (div (* (- 1) main_~r~0) (- 2)) (+ (div (+ (- 1) main_~j~0) 2) 1)) (< 0 (div (+ (- 1) main_~j~0) 2)))} ~i~0 := ~j~0;~j~0 := 2 * ~j~0; {40841#(and (<= (div (* (- 1) main_~r~0) (- 2)) (+ (div (div (+ (- 2) main_~j~0) 2) 2) 1)) (< 0 (div (div (+ (- 2) main_~j~0) 2) 2)))} is VALID [2022-04-08 03:54:55,933 INFO L290 TraceCheckUtils]: 93: Hoare triple {40841#(and (<= (div (* (- 1) main_~r~0) (- 2)) (+ (div (div (+ (- 2) main_~j~0) 2) 2) 1)) (< 0 (div (div (+ (- 2) main_~j~0) 2) 2)))} assume !!(~j~0 <= ~r~0); {40478#false} is VALID [2022-04-08 03:54:55,933 INFO L290 TraceCheckUtils]: 94: Hoare triple {40478#false} assume !(~j~0 < ~r~0); {40478#false} is VALID [2022-04-08 03:54:55,933 INFO L272 TraceCheckUtils]: 95: Hoare triple {40478#false} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {40478#false} is VALID [2022-04-08 03:54:55,934 INFO L290 TraceCheckUtils]: 96: Hoare triple {40478#false} ~cond := #in~cond; {40478#false} is VALID [2022-04-08 03:54:55,934 INFO L290 TraceCheckUtils]: 97: Hoare triple {40478#false} assume !(0 == ~cond); {40478#false} is VALID [2022-04-08 03:54:55,934 INFO L290 TraceCheckUtils]: 98: Hoare triple {40478#false} assume true; {40478#false} is VALID [2022-04-08 03:54:55,934 INFO L284 TraceCheckUtils]: 99: Hoare quadruple {40478#false} {40478#false} #118#return; {40478#false} is VALID [2022-04-08 03:54:55,934 INFO L272 TraceCheckUtils]: 100: Hoare triple {40478#false} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {40478#false} is VALID [2022-04-08 03:54:55,934 INFO L290 TraceCheckUtils]: 101: Hoare triple {40478#false} ~cond := #in~cond; {40478#false} is VALID [2022-04-08 03:54:55,934 INFO L290 TraceCheckUtils]: 102: Hoare triple {40478#false} assume !(0 == ~cond); {40478#false} is VALID [2022-04-08 03:54:55,934 INFO L290 TraceCheckUtils]: 103: Hoare triple {40478#false} assume true; {40478#false} is VALID [2022-04-08 03:54:55,934 INFO L284 TraceCheckUtils]: 104: Hoare quadruple {40478#false} {40478#false} #120#return; {40478#false} is VALID [2022-04-08 03:54:55,934 INFO L290 TraceCheckUtils]: 105: Hoare triple {40478#false} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {40478#false} is VALID [2022-04-08 03:54:55,935 INFO L290 TraceCheckUtils]: 106: Hoare triple {40478#false} assume !(0 != #t~nondet5);havoc #t~nondet5; {40478#false} is VALID [2022-04-08 03:54:55,935 INFO L272 TraceCheckUtils]: 107: Hoare triple {40478#false} call __VERIFIER_assert((if 1 <= ~i~0 then 1 else 0)); {40478#false} is VALID [2022-04-08 03:54:55,935 INFO L290 TraceCheckUtils]: 108: Hoare triple {40478#false} ~cond := #in~cond; {40478#false} is VALID [2022-04-08 03:54:55,935 INFO L290 TraceCheckUtils]: 109: Hoare triple {40478#false} assume !(0 == ~cond); {40478#false} is VALID [2022-04-08 03:54:55,935 INFO L290 TraceCheckUtils]: 110: Hoare triple {40478#false} assume true; {40478#false} is VALID [2022-04-08 03:54:55,935 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {40478#false} {40478#false} #122#return; {40478#false} is VALID [2022-04-08 03:54:55,935 INFO L272 TraceCheckUtils]: 112: Hoare triple {40478#false} call __VERIFIER_assert((if ~i~0 <= ~n~0 then 1 else 0)); {40478#false} is VALID [2022-04-08 03:54:55,935 INFO L290 TraceCheckUtils]: 113: Hoare triple {40478#false} ~cond := #in~cond; {40478#false} is VALID [2022-04-08 03:54:55,935 INFO L290 TraceCheckUtils]: 114: Hoare triple {40478#false} assume 0 == ~cond; {40478#false} is VALID [2022-04-08 03:54:55,935 INFO L290 TraceCheckUtils]: 115: Hoare triple {40478#false} assume !false; {40478#false} is VALID [2022-04-08 03:54:55,936 INFO L134 CoverageAnalysis]: Checked inductivity of 599 backedges. 210 proven. 7 refuted. 0 times theorem prover too weak. 382 trivial. 0 not checked. [2022-04-08 03:54:55,936 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 03:54:56,692 INFO L290 TraceCheckUtils]: 115: Hoare triple {40478#false} assume !false; {40478#false} is VALID [2022-04-08 03:54:56,693 INFO L290 TraceCheckUtils]: 114: Hoare triple {40478#false} assume 0 == ~cond; {40478#false} is VALID [2022-04-08 03:54:56,693 INFO L290 TraceCheckUtils]: 113: Hoare triple {40478#false} ~cond := #in~cond; {40478#false} is VALID [2022-04-08 03:54:56,693 INFO L272 TraceCheckUtils]: 112: Hoare triple {40478#false} call __VERIFIER_assert((if ~i~0 <= ~n~0 then 1 else 0)); {40478#false} is VALID [2022-04-08 03:54:56,693 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {40477#true} {40478#false} #122#return; {40478#false} is VALID [2022-04-08 03:54:56,693 INFO L290 TraceCheckUtils]: 110: Hoare triple {40477#true} assume true; {40477#true} is VALID [2022-04-08 03:54:56,693 INFO L290 TraceCheckUtils]: 109: Hoare triple {40477#true} assume !(0 == ~cond); {40477#true} is VALID [2022-04-08 03:54:56,693 INFO L290 TraceCheckUtils]: 108: Hoare triple {40477#true} ~cond := #in~cond; {40477#true} is VALID [2022-04-08 03:54:56,693 INFO L272 TraceCheckUtils]: 107: Hoare triple {40478#false} call __VERIFIER_assert((if 1 <= ~i~0 then 1 else 0)); {40477#true} is VALID [2022-04-08 03:54:56,694 INFO L290 TraceCheckUtils]: 106: Hoare triple {40478#false} assume !(0 != #t~nondet5);havoc #t~nondet5; {40478#false} is VALID [2022-04-08 03:54:56,694 INFO L290 TraceCheckUtils]: 105: Hoare triple {40478#false} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {40478#false} is VALID [2022-04-08 03:54:56,694 INFO L284 TraceCheckUtils]: 104: Hoare quadruple {40477#true} {40478#false} #120#return; {40478#false} is VALID [2022-04-08 03:54:56,694 INFO L290 TraceCheckUtils]: 103: Hoare triple {40477#true} assume true; {40477#true} is VALID [2022-04-08 03:54:56,694 INFO L290 TraceCheckUtils]: 102: Hoare triple {40477#true} assume !(0 == ~cond); {40477#true} is VALID [2022-04-08 03:54:56,694 INFO L290 TraceCheckUtils]: 101: Hoare triple {40477#true} ~cond := #in~cond; {40477#true} is VALID [2022-04-08 03:54:56,694 INFO L272 TraceCheckUtils]: 100: Hoare triple {40478#false} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {40477#true} is VALID [2022-04-08 03:54:56,694 INFO L284 TraceCheckUtils]: 99: Hoare quadruple {40477#true} {40478#false} #118#return; {40478#false} is VALID [2022-04-08 03:54:56,694 INFO L290 TraceCheckUtils]: 98: Hoare triple {40477#true} assume true; {40477#true} is VALID [2022-04-08 03:54:56,694 INFO L290 TraceCheckUtils]: 97: Hoare triple {40477#true} assume !(0 == ~cond); {40477#true} is VALID [2022-04-08 03:54:56,695 INFO L290 TraceCheckUtils]: 96: Hoare triple {40477#true} ~cond := #in~cond; {40477#true} is VALID [2022-04-08 03:54:56,695 INFO L272 TraceCheckUtils]: 95: Hoare triple {40478#false} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {40477#true} is VALID [2022-04-08 03:54:56,695 INFO L290 TraceCheckUtils]: 94: Hoare triple {40478#false} assume !(~j~0 < ~r~0); {40478#false} is VALID [2022-04-08 03:54:56,705 INFO L290 TraceCheckUtils]: 93: Hoare triple {40977#(not (<= main_~j~0 main_~r~0))} assume !!(~j~0 <= ~r~0); {40478#false} is VALID [2022-04-08 03:54:56,705 INFO L290 TraceCheckUtils]: 92: Hoare triple {40981#(< main_~r~0 (* main_~j~0 2))} ~i~0 := ~j~0;~j~0 := 2 * ~j~0; {40977#(not (<= main_~j~0 main_~r~0))} is VALID [2022-04-08 03:54:56,706 INFO L284 TraceCheckUtils]: 91: Hoare quadruple {40477#true} {40981#(< main_~r~0 (* main_~j~0 2))} #128#return; {40981#(< main_~r~0 (* main_~j~0 2))} is VALID [2022-04-08 03:54:56,706 INFO L290 TraceCheckUtils]: 90: Hoare triple {40477#true} assume true; {40477#true} is VALID [2022-04-08 03:54:56,706 INFO L290 TraceCheckUtils]: 89: Hoare triple {40477#true} assume !(0 == ~cond); {40477#true} is VALID [2022-04-08 03:54:56,706 INFO L290 TraceCheckUtils]: 88: Hoare triple {40477#true} ~cond := #in~cond; {40477#true} is VALID [2022-04-08 03:54:56,706 INFO L272 TraceCheckUtils]: 87: Hoare triple {40981#(< main_~r~0 (* main_~j~0 2))} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {40477#true} is VALID [2022-04-08 03:54:56,707 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {40477#true} {40981#(< main_~r~0 (* main_~j~0 2))} #126#return; {40981#(< main_~r~0 (* main_~j~0 2))} is VALID [2022-04-08 03:54:56,707 INFO L290 TraceCheckUtils]: 85: Hoare triple {40477#true} assume true; {40477#true} is VALID [2022-04-08 03:54:56,707 INFO L290 TraceCheckUtils]: 84: Hoare triple {40477#true} assume !(0 == ~cond); {40477#true} is VALID [2022-04-08 03:54:56,707 INFO L290 TraceCheckUtils]: 83: Hoare triple {40477#true} ~cond := #in~cond; {40477#true} is VALID [2022-04-08 03:54:56,707 INFO L272 TraceCheckUtils]: 82: Hoare triple {40981#(< main_~r~0 (* main_~j~0 2))} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {40477#true} is VALID [2022-04-08 03:54:56,707 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {40477#true} {40981#(< main_~r~0 (* main_~j~0 2))} #124#return; {40981#(< main_~r~0 (* main_~j~0 2))} is VALID [2022-04-08 03:54:56,707 INFO L290 TraceCheckUtils]: 80: Hoare triple {40477#true} assume true; {40477#true} is VALID [2022-04-08 03:54:56,708 INFO L290 TraceCheckUtils]: 79: Hoare triple {40477#true} assume !(0 == ~cond); {40477#true} is VALID [2022-04-08 03:54:56,708 INFO L290 TraceCheckUtils]: 78: Hoare triple {40477#true} ~cond := #in~cond; {40477#true} is VALID [2022-04-08 03:54:56,708 INFO L272 TraceCheckUtils]: 77: Hoare triple {40981#(< main_~r~0 (* main_~j~0 2))} call __VERIFIER_assert((if ~i~0 <= ~n~0 then 1 else 0)); {40477#true} is VALID [2022-04-08 03:54:56,708 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {40477#true} {40981#(< main_~r~0 (* main_~j~0 2))} #122#return; {40981#(< main_~r~0 (* main_~j~0 2))} is VALID [2022-04-08 03:54:56,708 INFO L290 TraceCheckUtils]: 75: Hoare triple {40477#true} assume true; {40477#true} is VALID [2022-04-08 03:54:56,708 INFO L290 TraceCheckUtils]: 74: Hoare triple {40477#true} assume !(0 == ~cond); {40477#true} is VALID [2022-04-08 03:54:56,708 INFO L290 TraceCheckUtils]: 73: Hoare triple {40477#true} ~cond := #in~cond; {40477#true} is VALID [2022-04-08 03:54:56,709 INFO L272 TraceCheckUtils]: 72: Hoare triple {40981#(< main_~r~0 (* main_~j~0 2))} call __VERIFIER_assert((if 1 <= ~i~0 then 1 else 0)); {40477#true} is VALID [2022-04-08 03:54:56,709 INFO L290 TraceCheckUtils]: 71: Hoare triple {40981#(< main_~r~0 (* main_~j~0 2))} assume !(0 != #t~nondet5);havoc #t~nondet5; {40981#(< main_~r~0 (* main_~j~0 2))} is VALID [2022-04-08 03:54:56,709 INFO L290 TraceCheckUtils]: 70: Hoare triple {40981#(< main_~r~0 (* main_~j~0 2))} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {40981#(< main_~r~0 (* main_~j~0 2))} is VALID [2022-04-08 03:54:56,709 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {40477#true} {40981#(< main_~r~0 (* main_~j~0 2))} #120#return; {40981#(< main_~r~0 (* main_~j~0 2))} is VALID [2022-04-08 03:54:56,710 INFO L290 TraceCheckUtils]: 68: Hoare triple {40477#true} assume true; {40477#true} is VALID [2022-04-08 03:54:56,710 INFO L290 TraceCheckUtils]: 67: Hoare triple {40477#true} assume !(0 == ~cond); {40477#true} is VALID [2022-04-08 03:54:56,710 INFO L290 TraceCheckUtils]: 66: Hoare triple {40477#true} ~cond := #in~cond; {40477#true} is VALID [2022-04-08 03:54:56,710 INFO L272 TraceCheckUtils]: 65: Hoare triple {40981#(< main_~r~0 (* main_~j~0 2))} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {40477#true} is VALID [2022-04-08 03:54:56,710 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {40477#true} {40981#(< main_~r~0 (* main_~j~0 2))} #118#return; {40981#(< main_~r~0 (* main_~j~0 2))} is VALID [2022-04-08 03:54:56,710 INFO L290 TraceCheckUtils]: 63: Hoare triple {40477#true} assume true; {40477#true} is VALID [2022-04-08 03:54:56,710 INFO L290 TraceCheckUtils]: 62: Hoare triple {40477#true} assume !(0 == ~cond); {40477#true} is VALID [2022-04-08 03:54:56,711 INFO L290 TraceCheckUtils]: 61: Hoare triple {40477#true} ~cond := #in~cond; {40477#true} is VALID [2022-04-08 03:54:56,711 INFO L272 TraceCheckUtils]: 60: Hoare triple {40981#(< main_~r~0 (* main_~j~0 2))} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {40477#true} is VALID [2022-04-08 03:54:56,711 INFO L290 TraceCheckUtils]: 59: Hoare triple {41081#(< (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~j~0 2))} assume 0 != #t~nondet4;havoc #t~nondet4;~j~0 := 1 + ~j~0; {40981#(< main_~r~0 (* main_~j~0 2))} is VALID [2022-04-08 03:54:56,711 INFO L290 TraceCheckUtils]: 58: Hoare triple {41081#(< (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~j~0 2))} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {41081#(< (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~j~0 2))} is VALID [2022-04-08 03:54:56,712 INFO L284 TraceCheckUtils]: 57: Hoare quadruple {40477#true} {41081#(< (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~j~0 2))} #116#return; {41081#(< (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~j~0 2))} is VALID [2022-04-08 03:54:56,712 INFO L290 TraceCheckUtils]: 56: Hoare triple {40477#true} assume true; {40477#true} is VALID [2022-04-08 03:54:56,712 INFO L290 TraceCheckUtils]: 55: Hoare triple {40477#true} assume !(0 == ~cond); {40477#true} is VALID [2022-04-08 03:54:56,712 INFO L290 TraceCheckUtils]: 54: Hoare triple {40477#true} ~cond := #in~cond; {40477#true} is VALID [2022-04-08 03:54:56,712 INFO L272 TraceCheckUtils]: 53: Hoare triple {41081#(< (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~j~0 2))} call __VERIFIER_assert((if 1 + ~j~0 <= ~n~0 then 1 else 0)); {40477#true} is VALID [2022-04-08 03:54:56,713 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {40477#true} {41081#(< (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~j~0 2))} #114#return; {41081#(< (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~j~0 2))} is VALID [2022-04-08 03:54:56,713 INFO L290 TraceCheckUtils]: 51: Hoare triple {40477#true} assume true; {40477#true} is VALID [2022-04-08 03:54:56,713 INFO L290 TraceCheckUtils]: 50: Hoare triple {40477#true} assume !(0 == ~cond); {40477#true} is VALID [2022-04-08 03:54:56,713 INFO L290 TraceCheckUtils]: 49: Hoare triple {40477#true} ~cond := #in~cond; {40477#true} is VALID [2022-04-08 03:54:56,713 INFO L272 TraceCheckUtils]: 48: Hoare triple {41081#(< (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~j~0 2))} call __VERIFIER_assert((if 1 <= 1 + ~j~0 then 1 else 0)); {40477#true} is VALID [2022-04-08 03:54:56,713 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {40477#true} {41081#(< (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~j~0 2))} #112#return; {41081#(< (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~j~0 2))} is VALID [2022-04-08 03:54:56,713 INFO L290 TraceCheckUtils]: 46: Hoare triple {40477#true} assume true; {40477#true} is VALID [2022-04-08 03:54:56,713 INFO L290 TraceCheckUtils]: 45: Hoare triple {40477#true} assume !(0 == ~cond); {40477#true} is VALID [2022-04-08 03:54:56,714 INFO L290 TraceCheckUtils]: 44: Hoare triple {40477#true} ~cond := #in~cond; {40477#true} is VALID [2022-04-08 03:54:56,714 INFO L272 TraceCheckUtils]: 43: Hoare triple {41081#(< (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~j~0 2))} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {40477#true} is VALID [2022-04-08 03:54:56,714 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {40477#true} {41081#(< (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~j~0 2))} #110#return; {41081#(< (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~j~0 2))} is VALID [2022-04-08 03:54:56,714 INFO L290 TraceCheckUtils]: 41: Hoare triple {40477#true} assume true; {40477#true} is VALID [2022-04-08 03:54:56,714 INFO L290 TraceCheckUtils]: 40: Hoare triple {40477#true} assume !(0 == ~cond); {40477#true} is VALID [2022-04-08 03:54:56,714 INFO L290 TraceCheckUtils]: 39: Hoare triple {40477#true} ~cond := #in~cond; {40477#true} is VALID [2022-04-08 03:54:56,714 INFO L272 TraceCheckUtils]: 38: Hoare triple {41081#(< (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~j~0 2))} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {40477#true} is VALID [2022-04-08 03:54:56,715 INFO L290 TraceCheckUtils]: 37: Hoare triple {41081#(< (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~j~0 2))} assume ~j~0 < ~r~0; {41081#(< (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~j~0 2))} is VALID [2022-04-08 03:54:56,715 INFO L290 TraceCheckUtils]: 36: Hoare triple {41081#(< (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~j~0 2))} assume !!(~j~0 <= ~r~0); {41081#(< (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~j~0 2))} is VALID [2022-04-08 03:54:56,716 INFO L290 TraceCheckUtils]: 35: Hoare triple {41154#(< (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ (* main_~l~0 2) 2))} assume !!(~r~0 > 1);~i~0 := ~l~0;~j~0 := 2 * ~l~0; {41081#(< (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~j~0 2))} is VALID [2022-04-08 03:54:56,716 INFO L290 TraceCheckUtils]: 34: Hoare triple {41158#(< (div (+ 1 (* (- 1) (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)))) (- 2)) main_~l~0)} #t~post6 := ~l~0;~l~0 := #t~post6 - 1;havoc #t~post6; {41154#(< (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ (* main_~l~0 2) 2))} is VALID [2022-04-08 03:54:56,716 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {40477#true} {41158#(< (div (+ 1 (* (- 1) (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)))) (- 2)) main_~l~0)} #132#return; {41158#(< (div (+ 1 (* (- 1) (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)))) (- 2)) main_~l~0)} is VALID [2022-04-08 03:54:56,716 INFO L290 TraceCheckUtils]: 32: Hoare triple {40477#true} assume true; {40477#true} is VALID [2022-04-08 03:54:56,717 INFO L290 TraceCheckUtils]: 31: Hoare triple {40477#true} assume !(0 == ~cond); {40477#true} is VALID [2022-04-08 03:54:56,717 INFO L290 TraceCheckUtils]: 30: Hoare triple {40477#true} ~cond := #in~cond; {40477#true} is VALID [2022-04-08 03:54:56,717 INFO L272 TraceCheckUtils]: 29: Hoare triple {41158#(< (div (+ 1 (* (- 1) (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)))) (- 2)) main_~l~0)} call __VERIFIER_assert((if ~l~0 <= ~n~0 then 1 else 0)); {40477#true} is VALID [2022-04-08 03:54:56,717 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {40477#true} {41158#(< (div (+ 1 (* (- 1) (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)))) (- 2)) main_~l~0)} #130#return; {41158#(< (div (+ 1 (* (- 1) (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)))) (- 2)) main_~l~0)} is VALID [2022-04-08 03:54:56,717 INFO L290 TraceCheckUtils]: 27: Hoare triple {40477#true} assume true; {40477#true} is VALID [2022-04-08 03:54:56,717 INFO L290 TraceCheckUtils]: 26: Hoare triple {40477#true} assume !(0 == ~cond); {40477#true} is VALID [2022-04-08 03:54:56,717 INFO L290 TraceCheckUtils]: 25: Hoare triple {40477#true} ~cond := #in~cond; {40477#true} is VALID [2022-04-08 03:54:56,718 INFO L272 TraceCheckUtils]: 24: Hoare triple {41158#(< (div (+ 1 (* (- 1) (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)))) (- 2)) main_~l~0)} call __VERIFIER_assert((if 1 <= ~l~0 then 1 else 0)); {40477#true} is VALID [2022-04-08 03:54:56,718 INFO L290 TraceCheckUtils]: 23: Hoare triple {41192#(or (< (div (+ 1 (* (- 1) (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)))) (- 2)) main_~l~0) (not (< 1 main_~l~0)))} assume ~l~0 > 1; {41158#(< (div (+ 1 (* (- 1) (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)))) (- 2)) main_~l~0)} is VALID [2022-04-08 03:54:56,718 INFO L290 TraceCheckUtils]: 22: Hoare triple {41192#(or (< (div (+ 1 (* (- 1) (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)))) (- 2)) main_~l~0) (not (< 1 main_~l~0)))} assume 0 != #t~nondet5;havoc #t~nondet5; {41192#(or (< (div (+ 1 (* (- 1) (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)))) (- 2)) main_~l~0) (not (< 1 main_~l~0)))} is VALID [2022-04-08 03:54:56,719 INFO L290 TraceCheckUtils]: 21: Hoare triple {41192#(or (< (div (+ 1 (* (- 1) (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)))) (- 2)) main_~l~0) (not (< 1 main_~l~0)))} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {41192#(or (< (div (+ 1 (* (- 1) (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)))) (- 2)) main_~l~0) (not (< 1 main_~l~0)))} is VALID [2022-04-08 03:54:56,719 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {40477#true} {41192#(or (< (div (+ 1 (* (- 1) (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)))) (- 2)) main_~l~0) (not (< 1 main_~l~0)))} #120#return; {41192#(or (< (div (+ 1 (* (- 1) (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)))) (- 2)) main_~l~0) (not (< 1 main_~l~0)))} is VALID [2022-04-08 03:54:56,719 INFO L290 TraceCheckUtils]: 19: Hoare triple {40477#true} assume true; {40477#true} is VALID [2022-04-08 03:54:56,719 INFO L290 TraceCheckUtils]: 18: Hoare triple {40477#true} assume !(0 == ~cond); {40477#true} is VALID [2022-04-08 03:54:56,719 INFO L290 TraceCheckUtils]: 17: Hoare triple {40477#true} ~cond := #in~cond; {40477#true} is VALID [2022-04-08 03:54:56,719 INFO L272 TraceCheckUtils]: 16: Hoare triple {41192#(or (< (div (+ 1 (* (- 1) (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)))) (- 2)) main_~l~0) (not (< 1 main_~l~0)))} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {40477#true} is VALID [2022-04-08 03:54:56,720 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {40477#true} {41192#(or (< (div (+ 1 (* (- 1) (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)))) (- 2)) main_~l~0) (not (< 1 main_~l~0)))} #118#return; {41192#(or (< (div (+ 1 (* (- 1) (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)))) (- 2)) main_~l~0) (not (< 1 main_~l~0)))} is VALID [2022-04-08 03:54:56,720 INFO L290 TraceCheckUtils]: 14: Hoare triple {40477#true} assume true; {40477#true} is VALID [2022-04-08 03:54:56,720 INFO L290 TraceCheckUtils]: 13: Hoare triple {40477#true} assume !(0 == ~cond); {40477#true} is VALID [2022-04-08 03:54:56,720 INFO L290 TraceCheckUtils]: 12: Hoare triple {40477#true} ~cond := #in~cond; {40477#true} is VALID [2022-04-08 03:54:56,720 INFO L272 TraceCheckUtils]: 11: Hoare triple {41192#(or (< (div (+ 1 (* (- 1) (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)))) (- 2)) main_~l~0) (not (< 1 main_~l~0)))} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {40477#true} is VALID [2022-04-08 03:54:56,721 INFO L290 TraceCheckUtils]: 10: Hoare triple {41232#(or (not (< 1 main_~l~0)) (<= (div (+ (- 1) (div (+ (- 1) (* (- 1) main_~j~0)) 2)) (- 2)) main_~l~0))} assume !(~j~0 < ~r~0); {41192#(or (< (div (+ 1 (* (- 1) (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)))) (- 2)) main_~l~0) (not (< 1 main_~l~0)))} is VALID [2022-04-08 03:54:56,721 INFO L290 TraceCheckUtils]: 9: Hoare triple {41232#(or (not (< 1 main_~l~0)) (<= (div (+ (- 1) (div (+ (- 1) (* (- 1) main_~j~0)) 2)) (- 2)) main_~l~0))} assume !!(~j~0 <= ~r~0); {41232#(or (not (< 1 main_~l~0)) (<= (div (+ (- 1) (div (+ (- 1) (* (- 1) main_~j~0)) 2)) (- 2)) main_~l~0))} is VALID [2022-04-08 03:54:56,721 INFO L290 TraceCheckUtils]: 8: Hoare triple {40477#true} assume !!(~r~0 > 1);~i~0 := ~l~0;~j~0 := 2 * ~l~0; {41232#(or (not (< 1 main_~l~0)) (<= (div (+ (- 1) (div (+ (- 1) (* (- 1) main_~j~0)) 2)) (- 2)) main_~l~0))} is VALID [2022-04-08 03:54:56,722 INFO L290 TraceCheckUtils]: 7: Hoare triple {40477#true} assume ~l~0 > 1;#t~post2 := ~l~0;~l~0 := #t~post2 - 1;havoc #t~post2; {40477#true} is VALID [2022-04-08 03:54:56,722 INFO L290 TraceCheckUtils]: 6: Hoare triple {40477#true} assume !!(1 <= ~n~0 && ~n~0 <= 1000000);~l~0 := 1 + (if ~n~0 < 0 && 0 != ~n~0 % 2 then 1 + ~n~0 / 2 else ~n~0 / 2);~r~0 := ~n~0; {40477#true} is VALID [2022-04-08 03:54:56,722 INFO L290 TraceCheckUtils]: 5: Hoare triple {40477#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;havoc ~n~0;havoc ~l~0;havoc ~r~0;havoc ~i~0;havoc ~j~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {40477#true} is VALID [2022-04-08 03:54:56,722 INFO L272 TraceCheckUtils]: 4: Hoare triple {40477#true} call #t~ret8 := main(#in~argc, #in~argv.base, #in~argv.offset); {40477#true} is VALID [2022-04-08 03:54:56,722 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {40477#true} {40477#true} #138#return; {40477#true} is VALID [2022-04-08 03:54:56,722 INFO L290 TraceCheckUtils]: 2: Hoare triple {40477#true} assume true; {40477#true} is VALID [2022-04-08 03:54:56,722 INFO L290 TraceCheckUtils]: 1: Hoare triple {40477#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(9, 2); {40477#true} is VALID [2022-04-08 03:54:56,722 INFO L272 TraceCheckUtils]: 0: Hoare triple {40477#true} call ULTIMATE.init(); {40477#true} is VALID [2022-04-08 03:54:56,723 INFO L134 CoverageAnalysis]: Checked inductivity of 599 backedges. 47 proven. 8 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2022-04-08 03:54:56,723 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [595500649] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 03:54:56,723 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 03:54:56,723 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 22 [2022-04-08 03:54:56,723 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 03:54:56,724 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [420755269] [2022-04-08 03:54:56,724 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [420755269] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 03:54:56,724 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 03:54:56,724 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-08 03:54:56,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1878713476] [2022-04-08 03:54:56,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 03:54:56,724 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.0) internal successors, (30), 9 states have internal predecessors, (30), 6 states have call successors, (20), 3 states have call predecessors, (20), 1 states have return successors, (18), 6 states have call predecessors, (18), 6 states have call successors, (18) Word has length 116 [2022-04-08 03:54:56,724 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 03:54:56,725 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 3.0) internal successors, (30), 9 states have internal predecessors, (30), 6 states have call successors, (20), 3 states have call predecessors, (20), 1 states have return successors, (18), 6 states have call predecessors, (18), 6 states have call successors, (18) [2022-04-08 03:54:56,762 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:54:56,762 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-08 03:54:56,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 03:54:56,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-08 03:54:56,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=380, Unknown=0, NotChecked=0, Total=462 [2022-04-08 03:54:56,763 INFO L87 Difference]: Start difference. First operand 242 states and 357 transitions. Second operand has 10 states, 10 states have (on average 3.0) internal successors, (30), 9 states have internal predecessors, (30), 6 states have call successors, (20), 3 states have call predecessors, (20), 1 states have return successors, (18), 6 states have call predecessors, (18), 6 states have call successors, (18) [2022-04-08 03:55:04,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:55:04,182 INFO L93 Difference]: Finished difference Result 756 states and 1173 transitions. [2022-04-08 03:55:04,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-04-08 03:55:04,182 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.0) internal successors, (30), 9 states have internal predecessors, (30), 6 states have call successors, (20), 3 states have call predecessors, (20), 1 states have return successors, (18), 6 states have call predecessors, (18), 6 states have call successors, (18) Word has length 116 [2022-04-08 03:55:04,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 03:55:04,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 3.0) internal successors, (30), 9 states have internal predecessors, (30), 6 states have call successors, (20), 3 states have call predecessors, (20), 1 states have return successors, (18), 6 states have call predecessors, (18), 6 states have call successors, (18) [2022-04-08 03:55:04,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 472 transitions. [2022-04-08 03:55:04,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 3.0) internal successors, (30), 9 states have internal predecessors, (30), 6 states have call successors, (20), 3 states have call predecessors, (20), 1 states have return successors, (18), 6 states have call predecessors, (18), 6 states have call successors, (18) [2022-04-08 03:55:04,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 472 transitions. [2022-04-08 03:55:04,199 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 24 states and 472 transitions. [2022-04-08 03:55:04,463 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 472 edges. 472 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:55:04,474 INFO L225 Difference]: With dead ends: 756 [2022-04-08 03:55:04,474 INFO L226 Difference]: Without dead ends: 452 [2022-04-08 03:55:04,476 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 299 GetRequests, 258 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 414 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=357, Invalid=1449, Unknown=0, NotChecked=0, Total=1806 [2022-04-08 03:55:04,476 INFO L913 BasicCegarLoop]: 84 mSDtfsCounter, 206 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 1309 mSolverCounterSat, 568 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 220 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 1877 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 568 IncrementalHoareTripleChecker+Valid, 1309 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-04-08 03:55:04,476 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [220 Valid, 116 Invalid, 1877 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [568 Valid, 1309 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-04-08 03:55:04,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 452 states. [2022-04-08 03:55:06,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 452 to 364. [2022-04-08 03:55:06,827 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 03:55:06,827 INFO L82 GeneralOperation]: Start isEquivalent. First operand 452 states. Second operand has 364 states, 169 states have (on average 1.2781065088757397) internal successors, (216), 183 states have internal predecessors, (216), 177 states have call successors, (177), 18 states have call predecessors, (177), 17 states have return successors, (176), 162 states have call predecessors, (176), 176 states have call successors, (176) [2022-04-08 03:55:06,828 INFO L74 IsIncluded]: Start isIncluded. First operand 452 states. Second operand has 364 states, 169 states have (on average 1.2781065088757397) internal successors, (216), 183 states have internal predecessors, (216), 177 states have call successors, (177), 18 states have call predecessors, (177), 17 states have return successors, (176), 162 states have call predecessors, (176), 176 states have call successors, (176) [2022-04-08 03:55:06,828 INFO L87 Difference]: Start difference. First operand 452 states. Second operand has 364 states, 169 states have (on average 1.2781065088757397) internal successors, (216), 183 states have internal predecessors, (216), 177 states have call successors, (177), 18 states have call predecessors, (177), 17 states have return successors, (176), 162 states have call predecessors, (176), 176 states have call successors, (176) [2022-04-08 03:55:06,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:55:06,839 INFO L93 Difference]: Finished difference Result 452 states and 699 transitions. [2022-04-08 03:55:06,840 INFO L276 IsEmpty]: Start isEmpty. Operand 452 states and 699 transitions. [2022-04-08 03:55:06,841 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:55:06,841 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:55:06,841 INFO L74 IsIncluded]: Start isIncluded. First operand has 364 states, 169 states have (on average 1.2781065088757397) internal successors, (216), 183 states have internal predecessors, (216), 177 states have call successors, (177), 18 states have call predecessors, (177), 17 states have return successors, (176), 162 states have call predecessors, (176), 176 states have call successors, (176) Second operand 452 states. [2022-04-08 03:55:06,842 INFO L87 Difference]: Start difference. First operand has 364 states, 169 states have (on average 1.2781065088757397) internal successors, (216), 183 states have internal predecessors, (216), 177 states have call successors, (177), 18 states have call predecessors, (177), 17 states have return successors, (176), 162 states have call predecessors, (176), 176 states have call successors, (176) Second operand 452 states. [2022-04-08 03:55:06,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:55:06,853 INFO L93 Difference]: Finished difference Result 452 states and 699 transitions. [2022-04-08 03:55:06,853 INFO L276 IsEmpty]: Start isEmpty. Operand 452 states and 699 transitions. [2022-04-08 03:55:06,855 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:55:06,855 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:55:06,855 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 03:55:06,855 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 03:55:06,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 364 states, 169 states have (on average 1.2781065088757397) internal successors, (216), 183 states have internal predecessors, (216), 177 states have call successors, (177), 18 states have call predecessors, (177), 17 states have return successors, (176), 162 states have call predecessors, (176), 176 states have call successors, (176) [2022-04-08 03:55:06,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 569 transitions. [2022-04-08 03:55:06,865 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 569 transitions. Word has length 116 [2022-04-08 03:55:06,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 03:55:06,866 INFO L478 AbstractCegarLoop]: Abstraction has 364 states and 569 transitions. [2022-04-08 03:55:06,866 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.0) internal successors, (30), 9 states have internal predecessors, (30), 6 states have call successors, (20), 3 states have call predecessors, (20), 1 states have return successors, (18), 6 states have call predecessors, (18), 6 states have call successors, (18) [2022-04-08 03:55:06,866 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 364 states and 569 transitions. [2022-04-08 03:55:07,818 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 569 edges. 569 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:55:07,818 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 569 transitions. [2022-04-08 03:55:07,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2022-04-08 03:55:07,819 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 03:55:07,819 INFO L499 BasicCegarLoop]: trace histogram [18, 17, 17, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 03:55:07,855 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 03:55:08,020 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 03:55:08,020 INFO L403 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 03:55:08,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 03:55:08,020 INFO L85 PathProgramCache]: Analyzing trace with hash -1934725046, now seen corresponding path program 3 times [2022-04-08 03:55:08,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 03:55:08,021 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [406717458] [2022-04-08 03:55:08,021 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 03:55:08,021 INFO L85 PathProgramCache]: Analyzing trace with hash -1934725046, now seen corresponding path program 4 times [2022-04-08 03:55:08,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 03:55:08,021 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [182375341] [2022-04-08 03:55:08,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 03:55:08,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 03:55:08,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:55:08,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 03:55:08,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:55:08,112 INFO L290 TraceCheckUtils]: 0: Hoare triple {44534#(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(9, 2); {44453#true} is VALID [2022-04-08 03:55:08,112 INFO L290 TraceCheckUtils]: 1: Hoare triple {44453#true} assume true; {44453#true} is VALID [2022-04-08 03:55:08,112 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {44453#true} {44453#true} #138#return; {44453#true} is VALID [2022-04-08 03:55:08,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-08 03:55:08,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:55:08,115 INFO L290 TraceCheckUtils]: 0: Hoare triple {44453#true} ~cond := #in~cond; {44453#true} is VALID [2022-04-08 03:55:08,115 INFO L290 TraceCheckUtils]: 1: Hoare triple {44453#true} assume !(0 == ~cond); {44453#true} is VALID [2022-04-08 03:55:08,115 INFO L290 TraceCheckUtils]: 2: Hoare triple {44453#true} assume true; {44453#true} is VALID [2022-04-08 03:55:08,116 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {44453#true} {44460#(<= (* main_~l~0 2) main_~n~0)} #118#return; {44460#(<= (* main_~l~0 2) main_~n~0)} is VALID [2022-04-08 03:55:08,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-04-08 03:55:08,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:55:08,118 INFO L290 TraceCheckUtils]: 0: Hoare triple {44453#true} ~cond := #in~cond; {44453#true} is VALID [2022-04-08 03:55:08,118 INFO L290 TraceCheckUtils]: 1: Hoare triple {44453#true} assume !(0 == ~cond); {44453#true} is VALID [2022-04-08 03:55:08,119 INFO L290 TraceCheckUtils]: 2: Hoare triple {44453#true} assume true; {44453#true} is VALID [2022-04-08 03:55:08,119 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {44453#true} {44460#(<= (* main_~l~0 2) main_~n~0)} #120#return; {44460#(<= (* main_~l~0 2) main_~n~0)} is VALID [2022-04-08 03:55:08,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-04-08 03:55:08,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:55:08,122 INFO L290 TraceCheckUtils]: 0: Hoare triple {44453#true} ~cond := #in~cond; {44453#true} is VALID [2022-04-08 03:55:08,122 INFO L290 TraceCheckUtils]: 1: Hoare triple {44453#true} assume !(0 == ~cond); {44453#true} is VALID [2022-04-08 03:55:08,122 INFO L290 TraceCheckUtils]: 2: Hoare triple {44453#true} assume true; {44453#true} is VALID [2022-04-08 03:55:08,122 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {44453#true} {44460#(<= (* main_~l~0 2) main_~n~0)} #130#return; {44460#(<= (* main_~l~0 2) main_~n~0)} is VALID [2022-04-08 03:55:08,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-04-08 03:55:08,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:55:08,125 INFO L290 TraceCheckUtils]: 0: Hoare triple {44453#true} ~cond := #in~cond; {44453#true} is VALID [2022-04-08 03:55:08,125 INFO L290 TraceCheckUtils]: 1: Hoare triple {44453#true} assume !(0 == ~cond); {44453#true} is VALID [2022-04-08 03:55:08,125 INFO L290 TraceCheckUtils]: 2: Hoare triple {44453#true} assume true; {44453#true} is VALID [2022-04-08 03:55:08,125 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {44453#true} {44460#(<= (* main_~l~0 2) main_~n~0)} #132#return; {44460#(<= (* main_~l~0 2) main_~n~0)} is VALID [2022-04-08 03:55:08,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-04-08 03:55:08,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:55:08,128 INFO L290 TraceCheckUtils]: 0: Hoare triple {44453#true} ~cond := #in~cond; {44453#true} is VALID [2022-04-08 03:55:08,128 INFO L290 TraceCheckUtils]: 1: Hoare triple {44453#true} assume !(0 == ~cond); {44453#true} is VALID [2022-04-08 03:55:08,128 INFO L290 TraceCheckUtils]: 2: Hoare triple {44453#true} assume true; {44453#true} is VALID [2022-04-08 03:55:08,129 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {44453#true} {44478#(<= (+ main_~j~0 2) main_~n~0)} #110#return; {44478#(<= (+ main_~j~0 2) main_~n~0)} is VALID [2022-04-08 03:55:08,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-04-08 03:55:08,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:55:08,131 INFO L290 TraceCheckUtils]: 0: Hoare triple {44453#true} ~cond := #in~cond; {44453#true} is VALID [2022-04-08 03:55:08,131 INFO L290 TraceCheckUtils]: 1: Hoare triple {44453#true} assume !(0 == ~cond); {44453#true} is VALID [2022-04-08 03:55:08,131 INFO L290 TraceCheckUtils]: 2: Hoare triple {44453#true} assume true; {44453#true} is VALID [2022-04-08 03:55:08,132 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {44453#true} {44478#(<= (+ main_~j~0 2) main_~n~0)} #112#return; {44478#(<= (+ main_~j~0 2) main_~n~0)} is VALID [2022-04-08 03:55:08,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-04-08 03:55:08,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:55:08,134 INFO L290 TraceCheckUtils]: 0: Hoare triple {44453#true} ~cond := #in~cond; {44453#true} is VALID [2022-04-08 03:55:08,134 INFO L290 TraceCheckUtils]: 1: Hoare triple {44453#true} assume !(0 == ~cond); {44453#true} is VALID [2022-04-08 03:55:08,134 INFO L290 TraceCheckUtils]: 2: Hoare triple {44453#true} assume true; {44453#true} is VALID [2022-04-08 03:55:08,135 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {44453#true} {44478#(<= (+ main_~j~0 2) main_~n~0)} #114#return; {44478#(<= (+ main_~j~0 2) main_~n~0)} is VALID [2022-04-08 03:55:08,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-04-08 03:55:08,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:55:08,137 INFO L290 TraceCheckUtils]: 0: Hoare triple {44453#true} ~cond := #in~cond; {44453#true} is VALID [2022-04-08 03:55:08,137 INFO L290 TraceCheckUtils]: 1: Hoare triple {44453#true} assume !(0 == ~cond); {44453#true} is VALID [2022-04-08 03:55:08,137 INFO L290 TraceCheckUtils]: 2: Hoare triple {44453#true} assume true; {44453#true} is VALID [2022-04-08 03:55:08,138 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {44453#true} {44478#(<= (+ main_~j~0 2) main_~n~0)} #116#return; {44478#(<= (+ main_~j~0 2) main_~n~0)} is VALID [2022-04-08 03:55:08,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-04-08 03:55:08,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:55:08,140 INFO L290 TraceCheckUtils]: 0: Hoare triple {44453#true} ~cond := #in~cond; {44453#true} is VALID [2022-04-08 03:55:08,140 INFO L290 TraceCheckUtils]: 1: Hoare triple {44453#true} assume !(0 == ~cond); {44453#true} is VALID [2022-04-08 03:55:08,140 INFO L290 TraceCheckUtils]: 2: Hoare triple {44453#true} assume true; {44453#true} is VALID [2022-04-08 03:55:08,141 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {44453#true} {44478#(<= (+ main_~j~0 2) main_~n~0)} #118#return; {44478#(<= (+ main_~j~0 2) main_~n~0)} is VALID [2022-04-08 03:55:08,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-04-08 03:55:08,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:55:08,143 INFO L290 TraceCheckUtils]: 0: Hoare triple {44453#true} ~cond := #in~cond; {44453#true} is VALID [2022-04-08 03:55:08,143 INFO L290 TraceCheckUtils]: 1: Hoare triple {44453#true} assume !(0 == ~cond); {44453#true} is VALID [2022-04-08 03:55:08,143 INFO L290 TraceCheckUtils]: 2: Hoare triple {44453#true} assume true; {44453#true} is VALID [2022-04-08 03:55:08,144 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {44453#true} {44478#(<= (+ main_~j~0 2) main_~n~0)} #120#return; {44478#(<= (+ main_~j~0 2) main_~n~0)} is VALID [2022-04-08 03:55:08,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-04-08 03:55:08,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:55:08,146 INFO L290 TraceCheckUtils]: 0: Hoare triple {44453#true} ~cond := #in~cond; {44453#true} is VALID [2022-04-08 03:55:08,146 INFO L290 TraceCheckUtils]: 1: Hoare triple {44453#true} assume !(0 == ~cond); {44453#true} is VALID [2022-04-08 03:55:08,146 INFO L290 TraceCheckUtils]: 2: Hoare triple {44453#true} assume true; {44453#true} is VALID [2022-04-08 03:55:08,147 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {44453#true} {44478#(<= (+ main_~j~0 2) main_~n~0)} #122#return; {44478#(<= (+ main_~j~0 2) main_~n~0)} is VALID [2022-04-08 03:55:08,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-04-08 03:55:08,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:55:08,149 INFO L290 TraceCheckUtils]: 0: Hoare triple {44453#true} ~cond := #in~cond; {44453#true} is VALID [2022-04-08 03:55:08,149 INFO L290 TraceCheckUtils]: 1: Hoare triple {44453#true} assume !(0 == ~cond); {44453#true} is VALID [2022-04-08 03:55:08,149 INFO L290 TraceCheckUtils]: 2: Hoare triple {44453#true} assume true; {44453#true} is VALID [2022-04-08 03:55:08,150 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {44453#true} {44478#(<= (+ main_~j~0 2) main_~n~0)} #124#return; {44478#(<= (+ main_~j~0 2) main_~n~0)} is VALID [2022-04-08 03:55:08,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-04-08 03:55:08,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:55:08,152 INFO L290 TraceCheckUtils]: 0: Hoare triple {44453#true} ~cond := #in~cond; {44453#true} is VALID [2022-04-08 03:55:08,152 INFO L290 TraceCheckUtils]: 1: Hoare triple {44453#true} assume !(0 == ~cond); {44453#true} is VALID [2022-04-08 03:55:08,152 INFO L290 TraceCheckUtils]: 2: Hoare triple {44453#true} assume true; {44453#true} is VALID [2022-04-08 03:55:08,152 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {44453#true} {44478#(<= (+ main_~j~0 2) main_~n~0)} #126#return; {44478#(<= (+ main_~j~0 2) main_~n~0)} is VALID [2022-04-08 03:55:08,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-04-08 03:55:08,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:55:08,155 INFO L290 TraceCheckUtils]: 0: Hoare triple {44453#true} ~cond := #in~cond; {44453#true} is VALID [2022-04-08 03:55:08,155 INFO L290 TraceCheckUtils]: 1: Hoare triple {44453#true} assume !(0 == ~cond); {44453#true} is VALID [2022-04-08 03:55:08,155 INFO L290 TraceCheckUtils]: 2: Hoare triple {44453#true} assume true; {44453#true} is VALID [2022-04-08 03:55:08,155 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {44453#true} {44478#(<= (+ main_~j~0 2) main_~n~0)} #128#return; {44478#(<= (+ main_~j~0 2) main_~n~0)} is VALID [2022-04-08 03:55:08,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-04-08 03:55:08,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:55:08,158 INFO L290 TraceCheckUtils]: 0: Hoare triple {44453#true} ~cond := #in~cond; {44453#true} is VALID [2022-04-08 03:55:08,158 INFO L290 TraceCheckUtils]: 1: Hoare triple {44453#true} assume !(0 == ~cond); {44453#true} is VALID [2022-04-08 03:55:08,158 INFO L290 TraceCheckUtils]: 2: Hoare triple {44453#true} assume true; {44453#true} is VALID [2022-04-08 03:55:08,158 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {44453#true} {44519#(<= (+ main_~i~0 2) main_~n~0)} #118#return; {44519#(<= (+ main_~i~0 2) main_~n~0)} is VALID [2022-04-08 03:55:08,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-04-08 03:55:08,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:55:08,161 INFO L290 TraceCheckUtils]: 0: Hoare triple {44453#true} ~cond := #in~cond; {44453#true} is VALID [2022-04-08 03:55:08,161 INFO L290 TraceCheckUtils]: 1: Hoare triple {44453#true} assume !(0 == ~cond); {44453#true} is VALID [2022-04-08 03:55:08,161 INFO L290 TraceCheckUtils]: 2: Hoare triple {44453#true} assume true; {44453#true} is VALID [2022-04-08 03:55:08,161 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {44453#true} {44519#(<= (+ main_~i~0 2) main_~n~0)} #120#return; {44519#(<= (+ main_~i~0 2) main_~n~0)} is VALID [2022-04-08 03:55:08,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-04-08 03:55:08,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:55:08,164 INFO L290 TraceCheckUtils]: 0: Hoare triple {44453#true} ~cond := #in~cond; {44453#true} is VALID [2022-04-08 03:55:08,164 INFO L290 TraceCheckUtils]: 1: Hoare triple {44453#true} assume !(0 == ~cond); {44453#true} is VALID [2022-04-08 03:55:08,164 INFO L290 TraceCheckUtils]: 2: Hoare triple {44453#true} assume true; {44453#true} is VALID [2022-04-08 03:55:08,164 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {44453#true} {44519#(<= (+ main_~i~0 2) main_~n~0)} #122#return; {44519#(<= (+ main_~i~0 2) main_~n~0)} is VALID [2022-04-08 03:55:08,165 INFO L272 TraceCheckUtils]: 0: Hoare triple {44453#true} call ULTIMATE.init(); {44534#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 03:55:08,165 INFO L290 TraceCheckUtils]: 1: Hoare triple {44534#(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(9, 2); {44453#true} is VALID [2022-04-08 03:55:08,165 INFO L290 TraceCheckUtils]: 2: Hoare triple {44453#true} assume true; {44453#true} is VALID [2022-04-08 03:55:08,165 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {44453#true} {44453#true} #138#return; {44453#true} is VALID [2022-04-08 03:55:08,165 INFO L272 TraceCheckUtils]: 4: Hoare triple {44453#true} call #t~ret8 := main(#in~argc, #in~argv.base, #in~argv.offset); {44453#true} is VALID [2022-04-08 03:55:08,165 INFO L290 TraceCheckUtils]: 5: Hoare triple {44453#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;havoc ~n~0;havoc ~l~0;havoc ~r~0;havoc ~i~0;havoc ~j~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {44453#true} is VALID [2022-04-08 03:55:08,166 INFO L290 TraceCheckUtils]: 6: Hoare triple {44453#true} assume !!(1 <= ~n~0 && ~n~0 <= 1000000);~l~0 := 1 + (if ~n~0 < 0 && 0 != ~n~0 % 2 then 1 + ~n~0 / 2 else ~n~0 / 2);~r~0 := ~n~0; {44458#(<= main_~r~0 main_~n~0)} is VALID [2022-04-08 03:55:08,166 INFO L290 TraceCheckUtils]: 7: Hoare triple {44458#(<= main_~r~0 main_~n~0)} assume ~l~0 > 1;#t~post2 := ~l~0;~l~0 := #t~post2 - 1;havoc #t~post2; {44458#(<= main_~r~0 main_~n~0)} is VALID [2022-04-08 03:55:08,166 INFO L290 TraceCheckUtils]: 8: Hoare triple {44458#(<= main_~r~0 main_~n~0)} assume !!(~r~0 > 1);~i~0 := ~l~0;~j~0 := 2 * ~l~0; {44459#(<= (+ (* main_~l~0 2) main_~r~0) (+ main_~n~0 main_~j~0))} is VALID [2022-04-08 03:55:08,167 INFO L290 TraceCheckUtils]: 9: Hoare triple {44459#(<= (+ (* main_~l~0 2) main_~r~0) (+ main_~n~0 main_~j~0))} assume !!(~j~0 <= ~r~0); {44460#(<= (* main_~l~0 2) main_~n~0)} is VALID [2022-04-08 03:55:08,167 INFO L290 TraceCheckUtils]: 10: Hoare triple {44460#(<= (* main_~l~0 2) main_~n~0)} assume !(~j~0 < ~r~0); {44460#(<= (* main_~l~0 2) main_~n~0)} is VALID [2022-04-08 03:55:08,167 INFO L272 TraceCheckUtils]: 11: Hoare triple {44460#(<= (* main_~l~0 2) main_~n~0)} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {44453#true} is VALID [2022-04-08 03:55:08,167 INFO L290 TraceCheckUtils]: 12: Hoare triple {44453#true} ~cond := #in~cond; {44453#true} is VALID [2022-04-08 03:55:08,168 INFO L290 TraceCheckUtils]: 13: Hoare triple {44453#true} assume !(0 == ~cond); {44453#true} is VALID [2022-04-08 03:55:08,168 INFO L290 TraceCheckUtils]: 14: Hoare triple {44453#true} assume true; {44453#true} is VALID [2022-04-08 03:55:08,168 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {44453#true} {44460#(<= (* main_~l~0 2) main_~n~0)} #118#return; {44460#(<= (* main_~l~0 2) main_~n~0)} is VALID [2022-04-08 03:55:08,168 INFO L272 TraceCheckUtils]: 16: Hoare triple {44460#(<= (* main_~l~0 2) main_~n~0)} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {44453#true} is VALID [2022-04-08 03:55:08,168 INFO L290 TraceCheckUtils]: 17: Hoare triple {44453#true} ~cond := #in~cond; {44453#true} is VALID [2022-04-08 03:55:08,168 INFO L290 TraceCheckUtils]: 18: Hoare triple {44453#true} assume !(0 == ~cond); {44453#true} is VALID [2022-04-08 03:55:08,168 INFO L290 TraceCheckUtils]: 19: Hoare triple {44453#true} assume true; {44453#true} is VALID [2022-04-08 03:55:08,169 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {44453#true} {44460#(<= (* main_~l~0 2) main_~n~0)} #120#return; {44460#(<= (* main_~l~0 2) main_~n~0)} is VALID [2022-04-08 03:55:08,169 INFO L290 TraceCheckUtils]: 21: Hoare triple {44460#(<= (* main_~l~0 2) main_~n~0)} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {44460#(<= (* main_~l~0 2) main_~n~0)} is VALID [2022-04-08 03:55:08,170 INFO L290 TraceCheckUtils]: 22: Hoare triple {44460#(<= (* main_~l~0 2) main_~n~0)} assume 0 != #t~nondet5;havoc #t~nondet5; {44460#(<= (* main_~l~0 2) main_~n~0)} is VALID [2022-04-08 03:55:08,170 INFO L290 TraceCheckUtils]: 23: Hoare triple {44460#(<= (* main_~l~0 2) main_~n~0)} assume ~l~0 > 1; {44460#(<= (* main_~l~0 2) main_~n~0)} is VALID [2022-04-08 03:55:08,170 INFO L272 TraceCheckUtils]: 24: Hoare triple {44460#(<= (* main_~l~0 2) main_~n~0)} call __VERIFIER_assert((if 1 <= ~l~0 then 1 else 0)); {44453#true} is VALID [2022-04-08 03:55:08,170 INFO L290 TraceCheckUtils]: 25: Hoare triple {44453#true} ~cond := #in~cond; {44453#true} is VALID [2022-04-08 03:55:08,170 INFO L290 TraceCheckUtils]: 26: Hoare triple {44453#true} assume !(0 == ~cond); {44453#true} is VALID [2022-04-08 03:55:08,170 INFO L290 TraceCheckUtils]: 27: Hoare triple {44453#true} assume true; {44453#true} is VALID [2022-04-08 03:55:08,171 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {44453#true} {44460#(<= (* main_~l~0 2) main_~n~0)} #130#return; {44460#(<= (* main_~l~0 2) main_~n~0)} is VALID [2022-04-08 03:55:08,171 INFO L272 TraceCheckUtils]: 29: Hoare triple {44460#(<= (* main_~l~0 2) main_~n~0)} call __VERIFIER_assert((if ~l~0 <= ~n~0 then 1 else 0)); {44453#true} is VALID [2022-04-08 03:55:08,171 INFO L290 TraceCheckUtils]: 30: Hoare triple {44453#true} ~cond := #in~cond; {44453#true} is VALID [2022-04-08 03:55:08,171 INFO L290 TraceCheckUtils]: 31: Hoare triple {44453#true} assume !(0 == ~cond); {44453#true} is VALID [2022-04-08 03:55:08,171 INFO L290 TraceCheckUtils]: 32: Hoare triple {44453#true} assume true; {44453#true} is VALID [2022-04-08 03:55:08,171 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {44453#true} {44460#(<= (* main_~l~0 2) main_~n~0)} #132#return; {44460#(<= (* main_~l~0 2) main_~n~0)} is VALID [2022-04-08 03:55:08,172 INFO L290 TraceCheckUtils]: 34: Hoare triple {44460#(<= (* main_~l~0 2) main_~n~0)} #t~post6 := ~l~0;~l~0 := #t~post6 - 1;havoc #t~post6; {44477#(<= (+ (* main_~l~0 2) 2) main_~n~0)} is VALID [2022-04-08 03:55:08,172 INFO L290 TraceCheckUtils]: 35: Hoare triple {44477#(<= (+ (* main_~l~0 2) 2) main_~n~0)} assume !!(~r~0 > 1);~i~0 := ~l~0;~j~0 := 2 * ~l~0; {44478#(<= (+ main_~j~0 2) main_~n~0)} is VALID [2022-04-08 03:55:08,173 INFO L290 TraceCheckUtils]: 36: Hoare triple {44478#(<= (+ main_~j~0 2) main_~n~0)} assume !!(~j~0 <= ~r~0); {44478#(<= (+ main_~j~0 2) main_~n~0)} is VALID [2022-04-08 03:55:08,173 INFO L290 TraceCheckUtils]: 37: Hoare triple {44478#(<= (+ main_~j~0 2) main_~n~0)} assume ~j~0 < ~r~0; {44478#(<= (+ main_~j~0 2) main_~n~0)} is VALID [2022-04-08 03:55:08,173 INFO L272 TraceCheckUtils]: 38: Hoare triple {44478#(<= (+ main_~j~0 2) main_~n~0)} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {44453#true} is VALID [2022-04-08 03:55:08,173 INFO L290 TraceCheckUtils]: 39: Hoare triple {44453#true} ~cond := #in~cond; {44453#true} is VALID [2022-04-08 03:55:08,173 INFO L290 TraceCheckUtils]: 40: Hoare triple {44453#true} assume !(0 == ~cond); {44453#true} is VALID [2022-04-08 03:55:08,173 INFO L290 TraceCheckUtils]: 41: Hoare triple {44453#true} assume true; {44453#true} is VALID [2022-04-08 03:55:08,174 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {44453#true} {44478#(<= (+ main_~j~0 2) main_~n~0)} #110#return; {44478#(<= (+ main_~j~0 2) main_~n~0)} is VALID [2022-04-08 03:55:08,174 INFO L272 TraceCheckUtils]: 43: Hoare triple {44478#(<= (+ main_~j~0 2) main_~n~0)} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {44453#true} is VALID [2022-04-08 03:55:08,174 INFO L290 TraceCheckUtils]: 44: Hoare triple {44453#true} ~cond := #in~cond; {44453#true} is VALID [2022-04-08 03:55:08,174 INFO L290 TraceCheckUtils]: 45: Hoare triple {44453#true} assume !(0 == ~cond); {44453#true} is VALID [2022-04-08 03:55:08,174 INFO L290 TraceCheckUtils]: 46: Hoare triple {44453#true} assume true; {44453#true} is VALID [2022-04-08 03:55:08,175 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {44453#true} {44478#(<= (+ main_~j~0 2) main_~n~0)} #112#return; {44478#(<= (+ main_~j~0 2) main_~n~0)} is VALID [2022-04-08 03:55:08,175 INFO L272 TraceCheckUtils]: 48: Hoare triple {44478#(<= (+ main_~j~0 2) main_~n~0)} call __VERIFIER_assert((if 1 <= 1 + ~j~0 then 1 else 0)); {44453#true} is VALID [2022-04-08 03:55:08,175 INFO L290 TraceCheckUtils]: 49: Hoare triple {44453#true} ~cond := #in~cond; {44453#true} is VALID [2022-04-08 03:55:08,175 INFO L290 TraceCheckUtils]: 50: Hoare triple {44453#true} assume !(0 == ~cond); {44453#true} is VALID [2022-04-08 03:55:08,175 INFO L290 TraceCheckUtils]: 51: Hoare triple {44453#true} assume true; {44453#true} is VALID [2022-04-08 03:55:08,175 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {44453#true} {44478#(<= (+ main_~j~0 2) main_~n~0)} #114#return; {44478#(<= (+ main_~j~0 2) main_~n~0)} is VALID [2022-04-08 03:55:08,175 INFO L272 TraceCheckUtils]: 53: Hoare triple {44478#(<= (+ main_~j~0 2) main_~n~0)} call __VERIFIER_assert((if 1 + ~j~0 <= ~n~0 then 1 else 0)); {44453#true} is VALID [2022-04-08 03:55:08,176 INFO L290 TraceCheckUtils]: 54: Hoare triple {44453#true} ~cond := #in~cond; {44453#true} is VALID [2022-04-08 03:55:08,176 INFO L290 TraceCheckUtils]: 55: Hoare triple {44453#true} assume !(0 == ~cond); {44453#true} is VALID [2022-04-08 03:55:08,176 INFO L290 TraceCheckUtils]: 56: Hoare triple {44453#true} assume true; {44453#true} is VALID [2022-04-08 03:55:08,176 INFO L284 TraceCheckUtils]: 57: Hoare quadruple {44453#true} {44478#(<= (+ main_~j~0 2) main_~n~0)} #116#return; {44478#(<= (+ main_~j~0 2) main_~n~0)} is VALID [2022-04-08 03:55:08,177 INFO L290 TraceCheckUtils]: 58: Hoare triple {44478#(<= (+ main_~j~0 2) main_~n~0)} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {44478#(<= (+ main_~j~0 2) main_~n~0)} is VALID [2022-04-08 03:55:08,177 INFO L290 TraceCheckUtils]: 59: Hoare triple {44478#(<= (+ main_~j~0 2) main_~n~0)} assume !(0 != #t~nondet4);havoc #t~nondet4; {44478#(<= (+ main_~j~0 2) main_~n~0)} is VALID [2022-04-08 03:55:08,177 INFO L272 TraceCheckUtils]: 60: Hoare triple {44478#(<= (+ main_~j~0 2) main_~n~0)} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {44453#true} is VALID [2022-04-08 03:55:08,177 INFO L290 TraceCheckUtils]: 61: Hoare triple {44453#true} ~cond := #in~cond; {44453#true} is VALID [2022-04-08 03:55:08,177 INFO L290 TraceCheckUtils]: 62: Hoare triple {44453#true} assume !(0 == ~cond); {44453#true} is VALID [2022-04-08 03:55:08,177 INFO L290 TraceCheckUtils]: 63: Hoare triple {44453#true} assume true; {44453#true} is VALID [2022-04-08 03:55:08,178 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {44453#true} {44478#(<= (+ main_~j~0 2) main_~n~0)} #118#return; {44478#(<= (+ main_~j~0 2) main_~n~0)} is VALID [2022-04-08 03:55:08,178 INFO L272 TraceCheckUtils]: 65: Hoare triple {44478#(<= (+ main_~j~0 2) main_~n~0)} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {44453#true} is VALID [2022-04-08 03:55:08,178 INFO L290 TraceCheckUtils]: 66: Hoare triple {44453#true} ~cond := #in~cond; {44453#true} is VALID [2022-04-08 03:55:08,178 INFO L290 TraceCheckUtils]: 67: Hoare triple {44453#true} assume !(0 == ~cond); {44453#true} is VALID [2022-04-08 03:55:08,178 INFO L290 TraceCheckUtils]: 68: Hoare triple {44453#true} assume true; {44453#true} is VALID [2022-04-08 03:55:08,178 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {44453#true} {44478#(<= (+ main_~j~0 2) main_~n~0)} #120#return; {44478#(<= (+ main_~j~0 2) main_~n~0)} is VALID [2022-04-08 03:55:08,179 INFO L290 TraceCheckUtils]: 70: Hoare triple {44478#(<= (+ main_~j~0 2) main_~n~0)} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {44478#(<= (+ main_~j~0 2) main_~n~0)} is VALID [2022-04-08 03:55:08,179 INFO L290 TraceCheckUtils]: 71: Hoare triple {44478#(<= (+ main_~j~0 2) main_~n~0)} assume !(0 != #t~nondet5);havoc #t~nondet5; {44478#(<= (+ main_~j~0 2) main_~n~0)} is VALID [2022-04-08 03:55:08,179 INFO L272 TraceCheckUtils]: 72: Hoare triple {44478#(<= (+ main_~j~0 2) main_~n~0)} call __VERIFIER_assert((if 1 <= ~i~0 then 1 else 0)); {44453#true} is VALID [2022-04-08 03:55:08,179 INFO L290 TraceCheckUtils]: 73: Hoare triple {44453#true} ~cond := #in~cond; {44453#true} is VALID [2022-04-08 03:55:08,179 INFO L290 TraceCheckUtils]: 74: Hoare triple {44453#true} assume !(0 == ~cond); {44453#true} is VALID [2022-04-08 03:55:08,179 INFO L290 TraceCheckUtils]: 75: Hoare triple {44453#true} assume true; {44453#true} is VALID [2022-04-08 03:55:08,180 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {44453#true} {44478#(<= (+ main_~j~0 2) main_~n~0)} #122#return; {44478#(<= (+ main_~j~0 2) main_~n~0)} is VALID [2022-04-08 03:55:08,180 INFO L272 TraceCheckUtils]: 77: Hoare triple {44478#(<= (+ main_~j~0 2) main_~n~0)} call __VERIFIER_assert((if ~i~0 <= ~n~0 then 1 else 0)); {44453#true} is VALID [2022-04-08 03:55:08,180 INFO L290 TraceCheckUtils]: 78: Hoare triple {44453#true} ~cond := #in~cond; {44453#true} is VALID [2022-04-08 03:55:08,180 INFO L290 TraceCheckUtils]: 79: Hoare triple {44453#true} assume !(0 == ~cond); {44453#true} is VALID [2022-04-08 03:55:08,180 INFO L290 TraceCheckUtils]: 80: Hoare triple {44453#true} assume true; {44453#true} is VALID [2022-04-08 03:55:08,181 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {44453#true} {44478#(<= (+ main_~j~0 2) main_~n~0)} #124#return; {44478#(<= (+ main_~j~0 2) main_~n~0)} is VALID [2022-04-08 03:55:08,181 INFO L272 TraceCheckUtils]: 82: Hoare triple {44478#(<= (+ main_~j~0 2) main_~n~0)} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {44453#true} is VALID [2022-04-08 03:55:08,181 INFO L290 TraceCheckUtils]: 83: Hoare triple {44453#true} ~cond := #in~cond; {44453#true} is VALID [2022-04-08 03:55:08,181 INFO L290 TraceCheckUtils]: 84: Hoare triple {44453#true} assume !(0 == ~cond); {44453#true} is VALID [2022-04-08 03:55:08,181 INFO L290 TraceCheckUtils]: 85: Hoare triple {44453#true} assume true; {44453#true} is VALID [2022-04-08 03:55:08,181 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {44453#true} {44478#(<= (+ main_~j~0 2) main_~n~0)} #126#return; {44478#(<= (+ main_~j~0 2) main_~n~0)} is VALID [2022-04-08 03:55:08,182 INFO L272 TraceCheckUtils]: 87: Hoare triple {44478#(<= (+ main_~j~0 2) main_~n~0)} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {44453#true} is VALID [2022-04-08 03:55:08,182 INFO L290 TraceCheckUtils]: 88: Hoare triple {44453#true} ~cond := #in~cond; {44453#true} is VALID [2022-04-08 03:55:08,182 INFO L290 TraceCheckUtils]: 89: Hoare triple {44453#true} assume !(0 == ~cond); {44453#true} is VALID [2022-04-08 03:55:08,182 INFO L290 TraceCheckUtils]: 90: Hoare triple {44453#true} assume true; {44453#true} is VALID [2022-04-08 03:55:08,182 INFO L284 TraceCheckUtils]: 91: Hoare quadruple {44453#true} {44478#(<= (+ main_~j~0 2) main_~n~0)} #128#return; {44478#(<= (+ main_~j~0 2) main_~n~0)} is VALID [2022-04-08 03:55:08,183 INFO L290 TraceCheckUtils]: 92: Hoare triple {44478#(<= (+ main_~j~0 2) main_~n~0)} ~i~0 := ~j~0;~j~0 := 2 * ~j~0; {44519#(<= (+ main_~i~0 2) main_~n~0)} is VALID [2022-04-08 03:55:08,183 INFO L290 TraceCheckUtils]: 93: Hoare triple {44519#(<= (+ main_~i~0 2) main_~n~0)} assume !!(~j~0 <= ~r~0); {44519#(<= (+ main_~i~0 2) main_~n~0)} is VALID [2022-04-08 03:55:08,183 INFO L290 TraceCheckUtils]: 94: Hoare triple {44519#(<= (+ main_~i~0 2) main_~n~0)} assume !(~j~0 < ~r~0); {44519#(<= (+ main_~i~0 2) main_~n~0)} is VALID [2022-04-08 03:55:08,183 INFO L272 TraceCheckUtils]: 95: Hoare triple {44519#(<= (+ main_~i~0 2) main_~n~0)} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {44453#true} is VALID [2022-04-08 03:55:08,183 INFO L290 TraceCheckUtils]: 96: Hoare triple {44453#true} ~cond := #in~cond; {44453#true} is VALID [2022-04-08 03:55:08,184 INFO L290 TraceCheckUtils]: 97: Hoare triple {44453#true} assume !(0 == ~cond); {44453#true} is VALID [2022-04-08 03:55:08,184 INFO L290 TraceCheckUtils]: 98: Hoare triple {44453#true} assume true; {44453#true} is VALID [2022-04-08 03:55:08,184 INFO L284 TraceCheckUtils]: 99: Hoare quadruple {44453#true} {44519#(<= (+ main_~i~0 2) main_~n~0)} #118#return; {44519#(<= (+ main_~i~0 2) main_~n~0)} is VALID [2022-04-08 03:55:08,184 INFO L272 TraceCheckUtils]: 100: Hoare triple {44519#(<= (+ main_~i~0 2) main_~n~0)} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {44453#true} is VALID [2022-04-08 03:55:08,184 INFO L290 TraceCheckUtils]: 101: Hoare triple {44453#true} ~cond := #in~cond; {44453#true} is VALID [2022-04-08 03:55:08,184 INFO L290 TraceCheckUtils]: 102: Hoare triple {44453#true} assume !(0 == ~cond); {44453#true} is VALID [2022-04-08 03:55:08,184 INFO L290 TraceCheckUtils]: 103: Hoare triple {44453#true} assume true; {44453#true} is VALID [2022-04-08 03:55:08,185 INFO L284 TraceCheckUtils]: 104: Hoare quadruple {44453#true} {44519#(<= (+ main_~i~0 2) main_~n~0)} #120#return; {44519#(<= (+ main_~i~0 2) main_~n~0)} is VALID [2022-04-08 03:55:08,185 INFO L290 TraceCheckUtils]: 105: Hoare triple {44519#(<= (+ main_~i~0 2) main_~n~0)} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {44519#(<= (+ main_~i~0 2) main_~n~0)} is VALID [2022-04-08 03:55:08,185 INFO L290 TraceCheckUtils]: 106: Hoare triple {44519#(<= (+ main_~i~0 2) main_~n~0)} assume !(0 != #t~nondet5);havoc #t~nondet5; {44519#(<= (+ main_~i~0 2) main_~n~0)} is VALID [2022-04-08 03:55:08,186 INFO L272 TraceCheckUtils]: 107: Hoare triple {44519#(<= (+ main_~i~0 2) main_~n~0)} call __VERIFIER_assert((if 1 <= ~i~0 then 1 else 0)); {44453#true} is VALID [2022-04-08 03:55:08,186 INFO L290 TraceCheckUtils]: 108: Hoare triple {44453#true} ~cond := #in~cond; {44453#true} is VALID [2022-04-08 03:55:08,186 INFO L290 TraceCheckUtils]: 109: Hoare triple {44453#true} assume !(0 == ~cond); {44453#true} is VALID [2022-04-08 03:55:08,186 INFO L290 TraceCheckUtils]: 110: Hoare triple {44453#true} assume true; {44453#true} is VALID [2022-04-08 03:55:08,186 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {44453#true} {44519#(<= (+ main_~i~0 2) main_~n~0)} #122#return; {44519#(<= (+ main_~i~0 2) main_~n~0)} is VALID [2022-04-08 03:55:08,187 INFO L272 TraceCheckUtils]: 112: Hoare triple {44519#(<= (+ main_~i~0 2) main_~n~0)} call __VERIFIER_assert((if ~i~0 <= ~n~0 then 1 else 0)); {44532#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 03:55:08,187 INFO L290 TraceCheckUtils]: 113: Hoare triple {44532#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {44533#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 03:55:08,187 INFO L290 TraceCheckUtils]: 114: Hoare triple {44533#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {44454#false} is VALID [2022-04-08 03:55:08,187 INFO L290 TraceCheckUtils]: 115: Hoare triple {44454#false} assume !false; {44454#false} is VALID [2022-04-08 03:55:08,188 INFO L134 CoverageAnalysis]: Checked inductivity of 599 backedges. 34 proven. 21 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2022-04-08 03:55:08,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 03:55:08,188 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [182375341] [2022-04-08 03:55:08,188 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [182375341] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 03:55:08,188 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [88677115] [2022-04-08 03:55:08,188 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 03:55:08,189 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 03:55:08,189 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 03:55:08,204 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 03:55:08,264 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 03:55:08,314 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 03:55:08,314 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 03:55:08,315 INFO L263 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-08 03:55:08,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:55:08,330 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 03:55:11,156 INFO L272 TraceCheckUtils]: 0: Hoare triple {44453#true} call ULTIMATE.init(); {44453#true} is VALID [2022-04-08 03:55:11,156 INFO L290 TraceCheckUtils]: 1: Hoare triple {44453#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(9, 2); {44453#true} is VALID [2022-04-08 03:55:11,156 INFO L290 TraceCheckUtils]: 2: Hoare triple {44453#true} assume true; {44453#true} is VALID [2022-04-08 03:55:11,156 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {44453#true} {44453#true} #138#return; {44453#true} is VALID [2022-04-08 03:55:11,156 INFO L272 TraceCheckUtils]: 4: Hoare triple {44453#true} call #t~ret8 := main(#in~argc, #in~argv.base, #in~argv.offset); {44453#true} is VALID [2022-04-08 03:55:11,156 INFO L290 TraceCheckUtils]: 5: Hoare triple {44453#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;havoc ~n~0;havoc ~l~0;havoc ~r~0;havoc ~i~0;havoc ~j~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {44453#true} is VALID [2022-04-08 03:55:11,156 INFO L290 TraceCheckUtils]: 6: Hoare triple {44453#true} assume !!(1 <= ~n~0 && ~n~0 <= 1000000);~l~0 := 1 + (if ~n~0 < 0 && 0 != ~n~0 % 2 then 1 + ~n~0 / 2 else ~n~0 / 2);~r~0 := ~n~0; {44453#true} is VALID [2022-04-08 03:55:11,157 INFO L290 TraceCheckUtils]: 7: Hoare triple {44453#true} assume ~l~0 > 1;#t~post2 := ~l~0;~l~0 := #t~post2 - 1;havoc #t~post2; {44453#true} is VALID [2022-04-08 03:55:11,157 INFO L290 TraceCheckUtils]: 8: Hoare triple {44453#true} assume !!(~r~0 > 1);~i~0 := ~l~0;~j~0 := 2 * ~l~0; {44562#(<= (* main_~l~0 2) main_~j~0)} is VALID [2022-04-08 03:55:11,157 INFO L290 TraceCheckUtils]: 9: Hoare triple {44562#(<= (* main_~l~0 2) main_~j~0)} assume !!(~j~0 <= ~r~0); {44562#(<= (* main_~l~0 2) main_~j~0)} is VALID [2022-04-08 03:55:11,157 INFO L290 TraceCheckUtils]: 10: Hoare triple {44562#(<= (* main_~l~0 2) main_~j~0)} assume !(~j~0 < ~r~0); {44562#(<= (* main_~l~0 2) main_~j~0)} is VALID [2022-04-08 03:55:11,158 INFO L272 TraceCheckUtils]: 11: Hoare triple {44562#(<= (* main_~l~0 2) main_~j~0)} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {44453#true} is VALID [2022-04-08 03:55:11,158 INFO L290 TraceCheckUtils]: 12: Hoare triple {44453#true} ~cond := #in~cond; {44453#true} is VALID [2022-04-08 03:55:11,158 INFO L290 TraceCheckUtils]: 13: Hoare triple {44453#true} assume !(0 == ~cond); {44453#true} is VALID [2022-04-08 03:55:11,158 INFO L290 TraceCheckUtils]: 14: Hoare triple {44453#true} assume true; {44453#true} is VALID [2022-04-08 03:55:11,158 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {44453#true} {44562#(<= (* main_~l~0 2) main_~j~0)} #118#return; {44562#(<= (* main_~l~0 2) main_~j~0)} is VALID [2022-04-08 03:55:11,158 INFO L272 TraceCheckUtils]: 16: Hoare triple {44562#(<= (* main_~l~0 2) main_~j~0)} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {44453#true} is VALID [2022-04-08 03:55:11,159 INFO L290 TraceCheckUtils]: 17: Hoare triple {44453#true} ~cond := #in~cond; {44590#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 03:55:11,159 INFO L290 TraceCheckUtils]: 18: Hoare triple {44590#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {44532#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 03:55:11,159 INFO L290 TraceCheckUtils]: 19: Hoare triple {44532#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {44532#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 03:55:11,160 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {44532#(not (= |__VERIFIER_assert_#in~cond| 0))} {44562#(<= (* main_~l~0 2) main_~j~0)} #120#return; {44460#(<= (* main_~l~0 2) main_~n~0)} is VALID [2022-04-08 03:55:11,160 INFO L290 TraceCheckUtils]: 21: Hoare triple {44460#(<= (* main_~l~0 2) main_~n~0)} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {44460#(<= (* main_~l~0 2) main_~n~0)} is VALID [2022-04-08 03:55:11,160 INFO L290 TraceCheckUtils]: 22: Hoare triple {44460#(<= (* main_~l~0 2) main_~n~0)} assume 0 != #t~nondet5;havoc #t~nondet5; {44460#(<= (* main_~l~0 2) main_~n~0)} is VALID [2022-04-08 03:55:11,160 INFO L290 TraceCheckUtils]: 23: Hoare triple {44460#(<= (* main_~l~0 2) main_~n~0)} assume ~l~0 > 1; {44460#(<= (* main_~l~0 2) main_~n~0)} is VALID [2022-04-08 03:55:11,161 INFO L272 TraceCheckUtils]: 24: Hoare triple {44460#(<= (* main_~l~0 2) main_~n~0)} call __VERIFIER_assert((if 1 <= ~l~0 then 1 else 0)); {44453#true} is VALID [2022-04-08 03:55:11,161 INFO L290 TraceCheckUtils]: 25: Hoare triple {44453#true} ~cond := #in~cond; {44453#true} is VALID [2022-04-08 03:55:11,161 INFO L290 TraceCheckUtils]: 26: Hoare triple {44453#true} assume !(0 == ~cond); {44453#true} is VALID [2022-04-08 03:55:11,161 INFO L290 TraceCheckUtils]: 27: Hoare triple {44453#true} assume true; {44453#true} is VALID [2022-04-08 03:55:11,161 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {44453#true} {44460#(<= (* main_~l~0 2) main_~n~0)} #130#return; {44460#(<= (* main_~l~0 2) main_~n~0)} is VALID [2022-04-08 03:55:11,161 INFO L272 TraceCheckUtils]: 29: Hoare triple {44460#(<= (* main_~l~0 2) main_~n~0)} call __VERIFIER_assert((if ~l~0 <= ~n~0 then 1 else 0)); {44453#true} is VALID [2022-04-08 03:55:11,161 INFO L290 TraceCheckUtils]: 30: Hoare triple {44453#true} ~cond := #in~cond; {44453#true} is VALID [2022-04-08 03:55:11,162 INFO L290 TraceCheckUtils]: 31: Hoare triple {44453#true} assume !(0 == ~cond); {44453#true} is VALID [2022-04-08 03:55:11,162 INFO L290 TraceCheckUtils]: 32: Hoare triple {44453#true} assume true; {44453#true} is VALID [2022-04-08 03:55:11,162 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {44453#true} {44460#(<= (* main_~l~0 2) main_~n~0)} #132#return; {44460#(<= (* main_~l~0 2) main_~n~0)} is VALID [2022-04-08 03:55:11,162 INFO L290 TraceCheckUtils]: 34: Hoare triple {44460#(<= (* main_~l~0 2) main_~n~0)} #t~post6 := ~l~0;~l~0 := #t~post6 - 1;havoc #t~post6; {44477#(<= (+ (* main_~l~0 2) 2) main_~n~0)} is VALID [2022-04-08 03:55:11,163 INFO L290 TraceCheckUtils]: 35: Hoare triple {44477#(<= (+ (* main_~l~0 2) 2) main_~n~0)} assume !!(~r~0 > 1);~i~0 := ~l~0;~j~0 := 2 * ~l~0; {44645#(<= (div (- main_~j~0) (- 2)) (div (+ (- 2) main_~n~0) 2))} is VALID [2022-04-08 03:55:11,163 INFO L290 TraceCheckUtils]: 36: Hoare triple {44645#(<= (div (- main_~j~0) (- 2)) (div (+ (- 2) main_~n~0) 2))} assume !!(~j~0 <= ~r~0); {44645#(<= (div (- main_~j~0) (- 2)) (div (+ (- 2) main_~n~0) 2))} is VALID [2022-04-08 03:55:11,164 INFO L290 TraceCheckUtils]: 37: Hoare triple {44645#(<= (div (- main_~j~0) (- 2)) (div (+ (- 2) main_~n~0) 2))} assume ~j~0 < ~r~0; {44645#(<= (div (- main_~j~0) (- 2)) (div (+ (- 2) main_~n~0) 2))} is VALID [2022-04-08 03:55:11,164 INFO L272 TraceCheckUtils]: 38: Hoare triple {44645#(<= (div (- main_~j~0) (- 2)) (div (+ (- 2) main_~n~0) 2))} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {44453#true} is VALID [2022-04-08 03:55:11,164 INFO L290 TraceCheckUtils]: 39: Hoare triple {44453#true} ~cond := #in~cond; {44453#true} is VALID [2022-04-08 03:55:11,164 INFO L290 TraceCheckUtils]: 40: Hoare triple {44453#true} assume !(0 == ~cond); {44453#true} is VALID [2022-04-08 03:55:11,164 INFO L290 TraceCheckUtils]: 41: Hoare triple {44453#true} assume true; {44453#true} is VALID [2022-04-08 03:55:11,175 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {44453#true} {44645#(<= (div (- main_~j~0) (- 2)) (div (+ (- 2) main_~n~0) 2))} #110#return; {44645#(<= (div (- main_~j~0) (- 2)) (div (+ (- 2) main_~n~0) 2))} is VALID [2022-04-08 03:55:11,175 INFO L272 TraceCheckUtils]: 43: Hoare triple {44645#(<= (div (- main_~j~0) (- 2)) (div (+ (- 2) main_~n~0) 2))} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {44453#true} is VALID [2022-04-08 03:55:11,175 INFO L290 TraceCheckUtils]: 44: Hoare triple {44453#true} ~cond := #in~cond; {44453#true} is VALID [2022-04-08 03:55:11,175 INFO L290 TraceCheckUtils]: 45: Hoare triple {44453#true} assume !(0 == ~cond); {44453#true} is VALID [2022-04-08 03:55:11,175 INFO L290 TraceCheckUtils]: 46: Hoare triple {44453#true} assume true; {44453#true} is VALID [2022-04-08 03:55:11,176 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {44453#true} {44645#(<= (div (- main_~j~0) (- 2)) (div (+ (- 2) main_~n~0) 2))} #112#return; {44645#(<= (div (- main_~j~0) (- 2)) (div (+ (- 2) main_~n~0) 2))} is VALID [2022-04-08 03:55:11,176 INFO L272 TraceCheckUtils]: 48: Hoare triple {44645#(<= (div (- main_~j~0) (- 2)) (div (+ (- 2) main_~n~0) 2))} call __VERIFIER_assert((if 1 <= 1 + ~j~0 then 1 else 0)); {44453#true} is VALID [2022-04-08 03:55:11,176 INFO L290 TraceCheckUtils]: 49: Hoare triple {44453#true} ~cond := #in~cond; {44453#true} is VALID [2022-04-08 03:55:11,176 INFO L290 TraceCheckUtils]: 50: Hoare triple {44453#true} assume !(0 == ~cond); {44453#true} is VALID [2022-04-08 03:55:11,176 INFO L290 TraceCheckUtils]: 51: Hoare triple {44453#true} assume true; {44453#true} is VALID [2022-04-08 03:55:11,177 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {44453#true} {44645#(<= (div (- main_~j~0) (- 2)) (div (+ (- 2) main_~n~0) 2))} #114#return; {44645#(<= (div (- main_~j~0) (- 2)) (div (+ (- 2) main_~n~0) 2))} is VALID [2022-04-08 03:55:11,177 INFO L272 TraceCheckUtils]: 53: Hoare triple {44645#(<= (div (- main_~j~0) (- 2)) (div (+ (- 2) main_~n~0) 2))} call __VERIFIER_assert((if 1 + ~j~0 <= ~n~0 then 1 else 0)); {44453#true} is VALID [2022-04-08 03:55:11,177 INFO L290 TraceCheckUtils]: 54: Hoare triple {44453#true} ~cond := #in~cond; {44453#true} is VALID [2022-04-08 03:55:11,177 INFO L290 TraceCheckUtils]: 55: Hoare triple {44453#true} assume !(0 == ~cond); {44453#true} is VALID [2022-04-08 03:55:11,177 INFO L290 TraceCheckUtils]: 56: Hoare triple {44453#true} assume true; {44453#true} is VALID [2022-04-08 03:55:11,178 INFO L284 TraceCheckUtils]: 57: Hoare quadruple {44453#true} {44645#(<= (div (- main_~j~0) (- 2)) (div (+ (- 2) main_~n~0) 2))} #116#return; {44645#(<= (div (- main_~j~0) (- 2)) (div (+ (- 2) main_~n~0) 2))} is VALID [2022-04-08 03:55:11,178 INFO L290 TraceCheckUtils]: 58: Hoare triple {44645#(<= (div (- main_~j~0) (- 2)) (div (+ (- 2) main_~n~0) 2))} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {44645#(<= (div (- main_~j~0) (- 2)) (div (+ (- 2) main_~n~0) 2))} is VALID [2022-04-08 03:55:11,179 INFO L290 TraceCheckUtils]: 59: Hoare triple {44645#(<= (div (- main_~j~0) (- 2)) (div (+ (- 2) main_~n~0) 2))} assume !(0 != #t~nondet4);havoc #t~nondet4; {44645#(<= (div (- main_~j~0) (- 2)) (div (+ (- 2) main_~n~0) 2))} is VALID [2022-04-08 03:55:11,179 INFO L272 TraceCheckUtils]: 60: Hoare triple {44645#(<= (div (- main_~j~0) (- 2)) (div (+ (- 2) main_~n~0) 2))} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {44453#true} is VALID [2022-04-08 03:55:11,179 INFO L290 TraceCheckUtils]: 61: Hoare triple {44453#true} ~cond := #in~cond; {44453#true} is VALID [2022-04-08 03:55:11,179 INFO L290 TraceCheckUtils]: 62: Hoare triple {44453#true} assume !(0 == ~cond); {44453#true} is VALID [2022-04-08 03:55:11,179 INFO L290 TraceCheckUtils]: 63: Hoare triple {44453#true} assume true; {44453#true} is VALID [2022-04-08 03:55:11,180 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {44453#true} {44645#(<= (div (- main_~j~0) (- 2)) (div (+ (- 2) main_~n~0) 2))} #118#return; {44645#(<= (div (- main_~j~0) (- 2)) (div (+ (- 2) main_~n~0) 2))} is VALID [2022-04-08 03:55:11,180 INFO L272 TraceCheckUtils]: 65: Hoare triple {44645#(<= (div (- main_~j~0) (- 2)) (div (+ (- 2) main_~n~0) 2))} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {44453#true} is VALID [2022-04-08 03:55:11,180 INFO L290 TraceCheckUtils]: 66: Hoare triple {44453#true} ~cond := #in~cond; {44453#true} is VALID [2022-04-08 03:55:11,180 INFO L290 TraceCheckUtils]: 67: Hoare triple {44453#true} assume !(0 == ~cond); {44453#true} is VALID [2022-04-08 03:55:11,180 INFO L290 TraceCheckUtils]: 68: Hoare triple {44453#true} assume true; {44453#true} is VALID [2022-04-08 03:55:11,180 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {44453#true} {44645#(<= (div (- main_~j~0) (- 2)) (div (+ (- 2) main_~n~0) 2))} #120#return; {44645#(<= (div (- main_~j~0) (- 2)) (div (+ (- 2) main_~n~0) 2))} is VALID [2022-04-08 03:55:11,181 INFO L290 TraceCheckUtils]: 70: Hoare triple {44645#(<= (div (- main_~j~0) (- 2)) (div (+ (- 2) main_~n~0) 2))} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {44645#(<= (div (- main_~j~0) (- 2)) (div (+ (- 2) main_~n~0) 2))} is VALID [2022-04-08 03:55:11,181 INFO L290 TraceCheckUtils]: 71: Hoare triple {44645#(<= (div (- main_~j~0) (- 2)) (div (+ (- 2) main_~n~0) 2))} assume !(0 != #t~nondet5);havoc #t~nondet5; {44645#(<= (div (- main_~j~0) (- 2)) (div (+ (- 2) main_~n~0) 2))} is VALID [2022-04-08 03:55:11,181 INFO L272 TraceCheckUtils]: 72: Hoare triple {44645#(<= (div (- main_~j~0) (- 2)) (div (+ (- 2) main_~n~0) 2))} call __VERIFIER_assert((if 1 <= ~i~0 then 1 else 0)); {44453#true} is VALID [2022-04-08 03:55:11,182 INFO L290 TraceCheckUtils]: 73: Hoare triple {44453#true} ~cond := #in~cond; {44453#true} is VALID [2022-04-08 03:55:11,182 INFO L290 TraceCheckUtils]: 74: Hoare triple {44453#true} assume !(0 == ~cond); {44453#true} is VALID [2022-04-08 03:55:11,182 INFO L290 TraceCheckUtils]: 75: Hoare triple {44453#true} assume true; {44453#true} is VALID [2022-04-08 03:55:11,182 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {44453#true} {44645#(<= (div (- main_~j~0) (- 2)) (div (+ (- 2) main_~n~0) 2))} #122#return; {44645#(<= (div (- main_~j~0) (- 2)) (div (+ (- 2) main_~n~0) 2))} is VALID [2022-04-08 03:55:11,182 INFO L272 TraceCheckUtils]: 77: Hoare triple {44645#(<= (div (- main_~j~0) (- 2)) (div (+ (- 2) main_~n~0) 2))} call __VERIFIER_assert((if ~i~0 <= ~n~0 then 1 else 0)); {44453#true} is VALID [2022-04-08 03:55:11,183 INFO L290 TraceCheckUtils]: 78: Hoare triple {44453#true} ~cond := #in~cond; {44453#true} is VALID [2022-04-08 03:55:11,183 INFO L290 TraceCheckUtils]: 79: Hoare triple {44453#true} assume !(0 == ~cond); {44453#true} is VALID [2022-04-08 03:55:11,183 INFO L290 TraceCheckUtils]: 80: Hoare triple {44453#true} assume true; {44453#true} is VALID [2022-04-08 03:55:11,183 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {44453#true} {44645#(<= (div (- main_~j~0) (- 2)) (div (+ (- 2) main_~n~0) 2))} #124#return; {44645#(<= (div (- main_~j~0) (- 2)) (div (+ (- 2) main_~n~0) 2))} is VALID [2022-04-08 03:55:11,183 INFO L272 TraceCheckUtils]: 82: Hoare triple {44645#(<= (div (- main_~j~0) (- 2)) (div (+ (- 2) main_~n~0) 2))} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {44453#true} is VALID [2022-04-08 03:55:11,183 INFO L290 TraceCheckUtils]: 83: Hoare triple {44453#true} ~cond := #in~cond; {44453#true} is VALID [2022-04-08 03:55:11,184 INFO L290 TraceCheckUtils]: 84: Hoare triple {44453#true} assume !(0 == ~cond); {44453#true} is VALID [2022-04-08 03:55:11,184 INFO L290 TraceCheckUtils]: 85: Hoare triple {44453#true} assume true; {44453#true} is VALID [2022-04-08 03:55:11,184 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {44453#true} {44645#(<= (div (- main_~j~0) (- 2)) (div (+ (- 2) main_~n~0) 2))} #126#return; {44645#(<= (div (- main_~j~0) (- 2)) (div (+ (- 2) main_~n~0) 2))} is VALID [2022-04-08 03:55:11,184 INFO L272 TraceCheckUtils]: 87: Hoare triple {44645#(<= (div (- main_~j~0) (- 2)) (div (+ (- 2) main_~n~0) 2))} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {44453#true} is VALID [2022-04-08 03:55:11,184 INFO L290 TraceCheckUtils]: 88: Hoare triple {44453#true} ~cond := #in~cond; {44453#true} is VALID [2022-04-08 03:55:11,184 INFO L290 TraceCheckUtils]: 89: Hoare triple {44453#true} assume !(0 == ~cond); {44453#true} is VALID [2022-04-08 03:55:11,184 INFO L290 TraceCheckUtils]: 90: Hoare triple {44453#true} assume true; {44453#true} is VALID [2022-04-08 03:55:11,185 INFO L284 TraceCheckUtils]: 91: Hoare quadruple {44453#true} {44645#(<= (div (- main_~j~0) (- 2)) (div (+ (- 2) main_~n~0) 2))} #128#return; {44645#(<= (div (- main_~j~0) (- 2)) (div (+ (- 2) main_~n~0) 2))} is VALID [2022-04-08 03:55:11,185 INFO L290 TraceCheckUtils]: 92: Hoare triple {44645#(<= (div (- main_~j~0) (- 2)) (div (+ (- 2) main_~n~0) 2))} ~i~0 := ~j~0;~j~0 := 2 * ~j~0; {44817#(<= (div (- main_~i~0) (- 2)) (div (+ (- 2) main_~n~0) 2))} is VALID [2022-04-08 03:55:11,186 INFO L290 TraceCheckUtils]: 93: Hoare triple {44817#(<= (div (- main_~i~0) (- 2)) (div (+ (- 2) main_~n~0) 2))} assume !!(~j~0 <= ~r~0); {44817#(<= (div (- main_~i~0) (- 2)) (div (+ (- 2) main_~n~0) 2))} is VALID [2022-04-08 03:55:11,186 INFO L290 TraceCheckUtils]: 94: Hoare triple {44817#(<= (div (- main_~i~0) (- 2)) (div (+ (- 2) main_~n~0) 2))} assume !(~j~0 < ~r~0); {44817#(<= (div (- main_~i~0) (- 2)) (div (+ (- 2) main_~n~0) 2))} is VALID [2022-04-08 03:55:11,186 INFO L272 TraceCheckUtils]: 95: Hoare triple {44817#(<= (div (- main_~i~0) (- 2)) (div (+ (- 2) main_~n~0) 2))} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {44453#true} is VALID [2022-04-08 03:55:11,186 INFO L290 TraceCheckUtils]: 96: Hoare triple {44453#true} ~cond := #in~cond; {44453#true} is VALID [2022-04-08 03:55:11,187 INFO L290 TraceCheckUtils]: 97: Hoare triple {44453#true} assume !(0 == ~cond); {44453#true} is VALID [2022-04-08 03:55:11,187 INFO L290 TraceCheckUtils]: 98: Hoare triple {44453#true} assume true; {44453#true} is VALID [2022-04-08 03:55:11,187 INFO L284 TraceCheckUtils]: 99: Hoare quadruple {44453#true} {44817#(<= (div (- main_~i~0) (- 2)) (div (+ (- 2) main_~n~0) 2))} #118#return; {44817#(<= (div (- main_~i~0) (- 2)) (div (+ (- 2) main_~n~0) 2))} is VALID [2022-04-08 03:55:11,187 INFO L272 TraceCheckUtils]: 100: Hoare triple {44817#(<= (div (- main_~i~0) (- 2)) (div (+ (- 2) main_~n~0) 2))} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {44453#true} is VALID [2022-04-08 03:55:11,187 INFO L290 TraceCheckUtils]: 101: Hoare triple {44453#true} ~cond := #in~cond; {44453#true} is VALID [2022-04-08 03:55:11,187 INFO L290 TraceCheckUtils]: 102: Hoare triple {44453#true} assume !(0 == ~cond); {44453#true} is VALID [2022-04-08 03:55:11,187 INFO L290 TraceCheckUtils]: 103: Hoare triple {44453#true} assume true; {44453#true} is VALID [2022-04-08 03:55:11,188 INFO L284 TraceCheckUtils]: 104: Hoare quadruple {44453#true} {44817#(<= (div (- main_~i~0) (- 2)) (div (+ (- 2) main_~n~0) 2))} #120#return; {44817#(<= (div (- main_~i~0) (- 2)) (div (+ (- 2) main_~n~0) 2))} is VALID [2022-04-08 03:55:11,188 INFO L290 TraceCheckUtils]: 105: Hoare triple {44817#(<= (div (- main_~i~0) (- 2)) (div (+ (- 2) main_~n~0) 2))} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {44817#(<= (div (- main_~i~0) (- 2)) (div (+ (- 2) main_~n~0) 2))} is VALID [2022-04-08 03:55:11,189 INFO L290 TraceCheckUtils]: 106: Hoare triple {44817#(<= (div (- main_~i~0) (- 2)) (div (+ (- 2) main_~n~0) 2))} assume !(0 != #t~nondet5);havoc #t~nondet5; {44817#(<= (div (- main_~i~0) (- 2)) (div (+ (- 2) main_~n~0) 2))} is VALID [2022-04-08 03:55:11,189 INFO L272 TraceCheckUtils]: 107: Hoare triple {44817#(<= (div (- main_~i~0) (- 2)) (div (+ (- 2) main_~n~0) 2))} call __VERIFIER_assert((if 1 <= ~i~0 then 1 else 0)); {44453#true} is VALID [2022-04-08 03:55:11,189 INFO L290 TraceCheckUtils]: 108: Hoare triple {44453#true} ~cond := #in~cond; {44453#true} is VALID [2022-04-08 03:55:11,189 INFO L290 TraceCheckUtils]: 109: Hoare triple {44453#true} assume !(0 == ~cond); {44453#true} is VALID [2022-04-08 03:55:11,189 INFO L290 TraceCheckUtils]: 110: Hoare triple {44453#true} assume true; {44453#true} is VALID [2022-04-08 03:55:11,190 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {44453#true} {44817#(<= (div (- main_~i~0) (- 2)) (div (+ (- 2) main_~n~0) 2))} #122#return; {44817#(<= (div (- main_~i~0) (- 2)) (div (+ (- 2) main_~n~0) 2))} is VALID [2022-04-08 03:55:11,190 INFO L272 TraceCheckUtils]: 112: Hoare triple {44817#(<= (div (- main_~i~0) (- 2)) (div (+ (- 2) main_~n~0) 2))} call __VERIFIER_assert((if ~i~0 <= ~n~0 then 1 else 0)); {44878#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 03:55:11,191 INFO L290 TraceCheckUtils]: 113: Hoare triple {44878#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {44882#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 03:55:11,191 INFO L290 TraceCheckUtils]: 114: Hoare triple {44882#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {44454#false} is VALID [2022-04-08 03:55:11,191 INFO L290 TraceCheckUtils]: 115: Hoare triple {44454#false} assume !false; {44454#false} is VALID [2022-04-08 03:55:11,192 INFO L134 CoverageAnalysis]: Checked inductivity of 599 backedges. 37 proven. 66 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2022-04-08 03:55:11,192 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 03:55:12,266 INFO L290 TraceCheckUtils]: 115: Hoare triple {44454#false} assume !false; {44454#false} is VALID [2022-04-08 03:55:12,267 INFO L290 TraceCheckUtils]: 114: Hoare triple {44882#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {44454#false} is VALID [2022-04-08 03:55:12,267 INFO L290 TraceCheckUtils]: 113: Hoare triple {44878#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {44882#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 03:55:12,268 INFO L272 TraceCheckUtils]: 112: Hoare triple {44898#(<= main_~i~0 main_~n~0)} call __VERIFIER_assert((if ~i~0 <= ~n~0 then 1 else 0)); {44878#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 03:55:12,268 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {44453#true} {44898#(<= main_~i~0 main_~n~0)} #122#return; {44898#(<= main_~i~0 main_~n~0)} is VALID [2022-04-08 03:55:12,268 INFO L290 TraceCheckUtils]: 110: Hoare triple {44453#true} assume true; {44453#true} is VALID [2022-04-08 03:55:12,268 INFO L290 TraceCheckUtils]: 109: Hoare triple {44453#true} assume !(0 == ~cond); {44453#true} is VALID [2022-04-08 03:55:12,268 INFO L290 TraceCheckUtils]: 108: Hoare triple {44453#true} ~cond := #in~cond; {44453#true} is VALID [2022-04-08 03:55:12,268 INFO L272 TraceCheckUtils]: 107: Hoare triple {44898#(<= main_~i~0 main_~n~0)} call __VERIFIER_assert((if 1 <= ~i~0 then 1 else 0)); {44453#true} is VALID [2022-04-08 03:55:12,269 INFO L290 TraceCheckUtils]: 106: Hoare triple {44898#(<= main_~i~0 main_~n~0)} assume !(0 != #t~nondet5);havoc #t~nondet5; {44898#(<= main_~i~0 main_~n~0)} is VALID [2022-04-08 03:55:12,269 INFO L290 TraceCheckUtils]: 105: Hoare triple {44898#(<= main_~i~0 main_~n~0)} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {44898#(<= main_~i~0 main_~n~0)} is VALID [2022-04-08 03:55:12,269 INFO L284 TraceCheckUtils]: 104: Hoare quadruple {44453#true} {44898#(<= main_~i~0 main_~n~0)} #120#return; {44898#(<= main_~i~0 main_~n~0)} is VALID [2022-04-08 03:55:12,269 INFO L290 TraceCheckUtils]: 103: Hoare triple {44453#true} assume true; {44453#true} is VALID [2022-04-08 03:55:12,269 INFO L290 TraceCheckUtils]: 102: Hoare triple {44453#true} assume !(0 == ~cond); {44453#true} is VALID [2022-04-08 03:55:12,270 INFO L290 TraceCheckUtils]: 101: Hoare triple {44453#true} ~cond := #in~cond; {44453#true} is VALID [2022-04-08 03:55:12,270 INFO L272 TraceCheckUtils]: 100: Hoare triple {44898#(<= main_~i~0 main_~n~0)} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {44453#true} is VALID [2022-04-08 03:55:12,270 INFO L284 TraceCheckUtils]: 99: Hoare quadruple {44453#true} {44898#(<= main_~i~0 main_~n~0)} #118#return; {44898#(<= main_~i~0 main_~n~0)} is VALID [2022-04-08 03:55:12,270 INFO L290 TraceCheckUtils]: 98: Hoare triple {44453#true} assume true; {44453#true} is VALID [2022-04-08 03:55:12,270 INFO L290 TraceCheckUtils]: 97: Hoare triple {44453#true} assume !(0 == ~cond); {44453#true} is VALID [2022-04-08 03:55:12,270 INFO L290 TraceCheckUtils]: 96: Hoare triple {44453#true} ~cond := #in~cond; {44453#true} is VALID [2022-04-08 03:55:12,270 INFO L272 TraceCheckUtils]: 95: Hoare triple {44898#(<= main_~i~0 main_~n~0)} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {44453#true} is VALID [2022-04-08 03:55:12,271 INFO L290 TraceCheckUtils]: 94: Hoare triple {44898#(<= main_~i~0 main_~n~0)} assume !(~j~0 < ~r~0); {44898#(<= main_~i~0 main_~n~0)} is VALID [2022-04-08 03:55:12,271 INFO L290 TraceCheckUtils]: 93: Hoare triple {44898#(<= main_~i~0 main_~n~0)} assume !!(~j~0 <= ~r~0); {44898#(<= main_~i~0 main_~n~0)} is VALID [2022-04-08 03:55:12,271 INFO L290 TraceCheckUtils]: 92: Hoare triple {44959#(<= main_~j~0 main_~n~0)} ~i~0 := ~j~0;~j~0 := 2 * ~j~0; {44898#(<= main_~i~0 main_~n~0)} is VALID [2022-04-08 03:55:12,272 INFO L284 TraceCheckUtils]: 91: Hoare quadruple {44453#true} {44959#(<= main_~j~0 main_~n~0)} #128#return; {44959#(<= main_~j~0 main_~n~0)} is VALID [2022-04-08 03:55:12,272 INFO L290 TraceCheckUtils]: 90: Hoare triple {44453#true} assume true; {44453#true} is VALID [2022-04-08 03:55:12,272 INFO L290 TraceCheckUtils]: 89: Hoare triple {44453#true} assume !(0 == ~cond); {44453#true} is VALID [2022-04-08 03:55:12,272 INFO L290 TraceCheckUtils]: 88: Hoare triple {44453#true} ~cond := #in~cond; {44453#true} is VALID [2022-04-08 03:55:12,272 INFO L272 TraceCheckUtils]: 87: Hoare triple {44959#(<= main_~j~0 main_~n~0)} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {44453#true} is VALID [2022-04-08 03:55:12,272 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {44453#true} {44959#(<= main_~j~0 main_~n~0)} #126#return; {44959#(<= main_~j~0 main_~n~0)} is VALID [2022-04-08 03:55:12,272 INFO L290 TraceCheckUtils]: 85: Hoare triple {44453#true} assume true; {44453#true} is VALID [2022-04-08 03:55:12,272 INFO L290 TraceCheckUtils]: 84: Hoare triple {44453#true} assume !(0 == ~cond); {44453#true} is VALID [2022-04-08 03:55:12,273 INFO L290 TraceCheckUtils]: 83: Hoare triple {44453#true} ~cond := #in~cond; {44453#true} is VALID [2022-04-08 03:55:12,273 INFO L272 TraceCheckUtils]: 82: Hoare triple {44959#(<= main_~j~0 main_~n~0)} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {44453#true} is VALID [2022-04-08 03:55:12,273 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {44453#true} {44959#(<= main_~j~0 main_~n~0)} #124#return; {44959#(<= main_~j~0 main_~n~0)} is VALID [2022-04-08 03:55:12,273 INFO L290 TraceCheckUtils]: 80: Hoare triple {44453#true} assume true; {44453#true} is VALID [2022-04-08 03:55:12,273 INFO L290 TraceCheckUtils]: 79: Hoare triple {44453#true} assume !(0 == ~cond); {44453#true} is VALID [2022-04-08 03:55:12,273 INFO L290 TraceCheckUtils]: 78: Hoare triple {44453#true} ~cond := #in~cond; {44453#true} is VALID [2022-04-08 03:55:12,273 INFO L272 TraceCheckUtils]: 77: Hoare triple {44959#(<= main_~j~0 main_~n~0)} call __VERIFIER_assert((if ~i~0 <= ~n~0 then 1 else 0)); {44453#true} is VALID [2022-04-08 03:55:12,274 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {44453#true} {44959#(<= main_~j~0 main_~n~0)} #122#return; {44959#(<= main_~j~0 main_~n~0)} is VALID [2022-04-08 03:55:12,274 INFO L290 TraceCheckUtils]: 75: Hoare triple {44453#true} assume true; {44453#true} is VALID [2022-04-08 03:55:12,274 INFO L290 TraceCheckUtils]: 74: Hoare triple {44453#true} assume !(0 == ~cond); {44453#true} is VALID [2022-04-08 03:55:12,274 INFO L290 TraceCheckUtils]: 73: Hoare triple {44453#true} ~cond := #in~cond; {44453#true} is VALID [2022-04-08 03:55:12,274 INFO L272 TraceCheckUtils]: 72: Hoare triple {44959#(<= main_~j~0 main_~n~0)} call __VERIFIER_assert((if 1 <= ~i~0 then 1 else 0)); {44453#true} is VALID [2022-04-08 03:55:12,274 INFO L290 TraceCheckUtils]: 71: Hoare triple {44959#(<= main_~j~0 main_~n~0)} assume !(0 != #t~nondet5);havoc #t~nondet5; {44959#(<= main_~j~0 main_~n~0)} is VALID [2022-04-08 03:55:12,275 INFO L290 TraceCheckUtils]: 70: Hoare triple {44959#(<= main_~j~0 main_~n~0)} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {44959#(<= main_~j~0 main_~n~0)} is VALID [2022-04-08 03:55:12,275 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {44453#true} {44959#(<= main_~j~0 main_~n~0)} #120#return; {44959#(<= main_~j~0 main_~n~0)} is VALID [2022-04-08 03:55:12,275 INFO L290 TraceCheckUtils]: 68: Hoare triple {44453#true} assume true; {44453#true} is VALID [2022-04-08 03:55:12,275 INFO L290 TraceCheckUtils]: 67: Hoare triple {44453#true} assume !(0 == ~cond); {44453#true} is VALID [2022-04-08 03:55:12,275 INFO L290 TraceCheckUtils]: 66: Hoare triple {44453#true} ~cond := #in~cond; {44453#true} is VALID [2022-04-08 03:55:12,275 INFO L272 TraceCheckUtils]: 65: Hoare triple {44959#(<= main_~j~0 main_~n~0)} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {44453#true} is VALID [2022-04-08 03:55:12,278 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {44453#true} {44959#(<= main_~j~0 main_~n~0)} #118#return; {44959#(<= main_~j~0 main_~n~0)} is VALID [2022-04-08 03:55:12,278 INFO L290 TraceCheckUtils]: 63: Hoare triple {44453#true} assume true; {44453#true} is VALID [2022-04-08 03:55:12,278 INFO L290 TraceCheckUtils]: 62: Hoare triple {44453#true} assume !(0 == ~cond); {44453#true} is VALID [2022-04-08 03:55:12,278 INFO L290 TraceCheckUtils]: 61: Hoare triple {44453#true} ~cond := #in~cond; {44453#true} is VALID [2022-04-08 03:55:12,278 INFO L272 TraceCheckUtils]: 60: Hoare triple {44959#(<= main_~j~0 main_~n~0)} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {44453#true} is VALID [2022-04-08 03:55:12,283 INFO L290 TraceCheckUtils]: 59: Hoare triple {44959#(<= main_~j~0 main_~n~0)} assume !(0 != #t~nondet4);havoc #t~nondet4; {44959#(<= main_~j~0 main_~n~0)} is VALID [2022-04-08 03:55:12,284 INFO L290 TraceCheckUtils]: 58: Hoare triple {44959#(<= main_~j~0 main_~n~0)} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {44959#(<= main_~j~0 main_~n~0)} is VALID [2022-04-08 03:55:12,284 INFO L284 TraceCheckUtils]: 57: Hoare quadruple {44453#true} {44959#(<= main_~j~0 main_~n~0)} #116#return; {44959#(<= main_~j~0 main_~n~0)} is VALID [2022-04-08 03:55:12,284 INFO L290 TraceCheckUtils]: 56: Hoare triple {44453#true} assume true; {44453#true} is VALID [2022-04-08 03:55:12,285 INFO L290 TraceCheckUtils]: 55: Hoare triple {44453#true} assume !(0 == ~cond); {44453#true} is VALID [2022-04-08 03:55:12,285 INFO L290 TraceCheckUtils]: 54: Hoare triple {44453#true} ~cond := #in~cond; {44453#true} is VALID [2022-04-08 03:55:12,285 INFO L272 TraceCheckUtils]: 53: Hoare triple {44959#(<= main_~j~0 main_~n~0)} call __VERIFIER_assert((if 1 + ~j~0 <= ~n~0 then 1 else 0)); {44453#true} is VALID [2022-04-08 03:55:12,285 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {44453#true} {44959#(<= main_~j~0 main_~n~0)} #114#return; {44959#(<= main_~j~0 main_~n~0)} is VALID [2022-04-08 03:55:12,285 INFO L290 TraceCheckUtils]: 51: Hoare triple {44453#true} assume true; {44453#true} is VALID [2022-04-08 03:55:12,285 INFO L290 TraceCheckUtils]: 50: Hoare triple {44453#true} assume !(0 == ~cond); {44453#true} is VALID [2022-04-08 03:55:12,285 INFO L290 TraceCheckUtils]: 49: Hoare triple {44453#true} ~cond := #in~cond; {44453#true} is VALID [2022-04-08 03:55:12,286 INFO L272 TraceCheckUtils]: 48: Hoare triple {44959#(<= main_~j~0 main_~n~0)} call __VERIFIER_assert((if 1 <= 1 + ~j~0 then 1 else 0)); {44453#true} is VALID [2022-04-08 03:55:12,286 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {44453#true} {44959#(<= main_~j~0 main_~n~0)} #112#return; {44959#(<= main_~j~0 main_~n~0)} is VALID [2022-04-08 03:55:12,286 INFO L290 TraceCheckUtils]: 46: Hoare triple {44453#true} assume true; {44453#true} is VALID [2022-04-08 03:55:12,286 INFO L290 TraceCheckUtils]: 45: Hoare triple {44453#true} assume !(0 == ~cond); {44453#true} is VALID [2022-04-08 03:55:12,286 INFO L290 TraceCheckUtils]: 44: Hoare triple {44453#true} ~cond := #in~cond; {44453#true} is VALID [2022-04-08 03:55:12,286 INFO L272 TraceCheckUtils]: 43: Hoare triple {44959#(<= main_~j~0 main_~n~0)} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {44453#true} is VALID [2022-04-08 03:55:12,287 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {44453#true} {44959#(<= main_~j~0 main_~n~0)} #110#return; {44959#(<= main_~j~0 main_~n~0)} is VALID [2022-04-08 03:55:12,287 INFO L290 TraceCheckUtils]: 41: Hoare triple {44453#true} assume true; {44453#true} is VALID [2022-04-08 03:55:12,287 INFO L290 TraceCheckUtils]: 40: Hoare triple {44453#true} assume !(0 == ~cond); {44453#true} is VALID [2022-04-08 03:55:12,287 INFO L290 TraceCheckUtils]: 39: Hoare triple {44453#true} ~cond := #in~cond; {44453#true} is VALID [2022-04-08 03:55:12,287 INFO L272 TraceCheckUtils]: 38: Hoare triple {44959#(<= main_~j~0 main_~n~0)} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {44453#true} is VALID [2022-04-08 03:55:12,288 INFO L290 TraceCheckUtils]: 37: Hoare triple {44959#(<= main_~j~0 main_~n~0)} assume ~j~0 < ~r~0; {44959#(<= main_~j~0 main_~n~0)} is VALID [2022-04-08 03:55:12,288 INFO L290 TraceCheckUtils]: 36: Hoare triple {44959#(<= main_~j~0 main_~n~0)} assume !!(~j~0 <= ~r~0); {44959#(<= main_~j~0 main_~n~0)} is VALID [2022-04-08 03:55:12,288 INFO L290 TraceCheckUtils]: 35: Hoare triple {44460#(<= (* main_~l~0 2) main_~n~0)} assume !!(~r~0 > 1);~i~0 := ~l~0;~j~0 := 2 * ~l~0; {44959#(<= main_~j~0 main_~n~0)} is VALID [2022-04-08 03:55:12,289 INFO L290 TraceCheckUtils]: 34: Hoare triple {45134#(<= main_~l~0 (+ (div main_~n~0 2) 1))} #t~post6 := ~l~0;~l~0 := #t~post6 - 1;havoc #t~post6; {44460#(<= (* main_~l~0 2) main_~n~0)} is VALID [2022-04-08 03:55:12,289 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {44453#true} {45134#(<= main_~l~0 (+ (div main_~n~0 2) 1))} #132#return; {45134#(<= main_~l~0 (+ (div main_~n~0 2) 1))} is VALID [2022-04-08 03:55:12,289 INFO L290 TraceCheckUtils]: 32: Hoare triple {44453#true} assume true; {44453#true} is VALID [2022-04-08 03:55:12,290 INFO L290 TraceCheckUtils]: 31: Hoare triple {44453#true} assume !(0 == ~cond); {44453#true} is VALID [2022-04-08 03:55:12,290 INFO L290 TraceCheckUtils]: 30: Hoare triple {44453#true} ~cond := #in~cond; {44453#true} is VALID [2022-04-08 03:55:12,290 INFO L272 TraceCheckUtils]: 29: Hoare triple {45134#(<= main_~l~0 (+ (div main_~n~0 2) 1))} call __VERIFIER_assert((if ~l~0 <= ~n~0 then 1 else 0)); {44453#true} is VALID [2022-04-08 03:55:12,290 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {44453#true} {45134#(<= main_~l~0 (+ (div main_~n~0 2) 1))} #130#return; {45134#(<= main_~l~0 (+ (div main_~n~0 2) 1))} is VALID [2022-04-08 03:55:12,290 INFO L290 TraceCheckUtils]: 27: Hoare triple {44453#true} assume true; {44453#true} is VALID [2022-04-08 03:55:12,290 INFO L290 TraceCheckUtils]: 26: Hoare triple {44453#true} assume !(0 == ~cond); {44453#true} is VALID [2022-04-08 03:55:12,291 INFO L290 TraceCheckUtils]: 25: Hoare triple {44453#true} ~cond := #in~cond; {44453#true} is VALID [2022-04-08 03:55:12,291 INFO L272 TraceCheckUtils]: 24: Hoare triple {45134#(<= main_~l~0 (+ (div main_~n~0 2) 1))} call __VERIFIER_assert((if 1 <= ~l~0 then 1 else 0)); {44453#true} is VALID [2022-04-08 03:55:12,291 INFO L290 TraceCheckUtils]: 23: Hoare triple {45134#(<= main_~l~0 (+ (div main_~n~0 2) 1))} assume ~l~0 > 1; {45134#(<= main_~l~0 (+ (div main_~n~0 2) 1))} is VALID [2022-04-08 03:55:12,291 INFO L290 TraceCheckUtils]: 22: Hoare triple {45134#(<= main_~l~0 (+ (div main_~n~0 2) 1))} assume 0 != #t~nondet5;havoc #t~nondet5; {45134#(<= main_~l~0 (+ (div main_~n~0 2) 1))} is VALID [2022-04-08 03:55:12,292 INFO L290 TraceCheckUtils]: 21: Hoare triple {45134#(<= main_~l~0 (+ (div main_~n~0 2) 1))} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {45134#(<= main_~l~0 (+ (div main_~n~0 2) 1))} is VALID [2022-04-08 03:55:12,293 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {44532#(not (= |__VERIFIER_assert_#in~cond| 0))} {45177#(<= main_~l~0 (+ 2 (div (+ (- 2) main_~j~0) 2)))} #120#return; {45134#(<= main_~l~0 (+ (div main_~n~0 2) 1))} is VALID [2022-04-08 03:55:12,293 INFO L290 TraceCheckUtils]: 19: Hoare triple {44532#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {44532#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 03:55:12,293 INFO L290 TraceCheckUtils]: 18: Hoare triple {45187#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {44532#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 03:55:12,294 INFO L290 TraceCheckUtils]: 17: Hoare triple {44453#true} ~cond := #in~cond; {45187#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 03:55:12,294 INFO L272 TraceCheckUtils]: 16: Hoare triple {45177#(<= main_~l~0 (+ 2 (div (+ (- 2) main_~j~0) 2)))} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {44453#true} is VALID [2022-04-08 03:55:12,294 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {44453#true} {45177#(<= main_~l~0 (+ 2 (div (+ (- 2) main_~j~0) 2)))} #118#return; {45177#(<= main_~l~0 (+ 2 (div (+ (- 2) main_~j~0) 2)))} is VALID [2022-04-08 03:55:12,294 INFO L290 TraceCheckUtils]: 14: Hoare triple {44453#true} assume true; {44453#true} is VALID [2022-04-08 03:55:12,295 INFO L290 TraceCheckUtils]: 13: Hoare triple {44453#true} assume !(0 == ~cond); {44453#true} is VALID [2022-04-08 03:55:12,295 INFO L290 TraceCheckUtils]: 12: Hoare triple {44453#true} ~cond := #in~cond; {44453#true} is VALID [2022-04-08 03:55:12,295 INFO L272 TraceCheckUtils]: 11: Hoare triple {45177#(<= main_~l~0 (+ 2 (div (+ (- 2) main_~j~0) 2)))} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {44453#true} is VALID [2022-04-08 03:55:12,295 INFO L290 TraceCheckUtils]: 10: Hoare triple {45177#(<= main_~l~0 (+ 2 (div (+ (- 2) main_~j~0) 2)))} assume !(~j~0 < ~r~0); {45177#(<= main_~l~0 (+ 2 (div (+ (- 2) main_~j~0) 2)))} is VALID [2022-04-08 03:55:12,296 INFO L290 TraceCheckUtils]: 9: Hoare triple {45177#(<= main_~l~0 (+ 2 (div (+ (- 2) main_~j~0) 2)))} assume !!(~j~0 <= ~r~0); {45177#(<= main_~l~0 (+ 2 (div (+ (- 2) main_~j~0) 2)))} is VALID [2022-04-08 03:55:12,296 INFO L290 TraceCheckUtils]: 8: Hoare triple {44453#true} assume !!(~r~0 > 1);~i~0 := ~l~0;~j~0 := 2 * ~l~0; {45177#(<= main_~l~0 (+ 2 (div (+ (- 2) main_~j~0) 2)))} is VALID [2022-04-08 03:55:12,296 INFO L290 TraceCheckUtils]: 7: Hoare triple {44453#true} assume ~l~0 > 1;#t~post2 := ~l~0;~l~0 := #t~post2 - 1;havoc #t~post2; {44453#true} is VALID [2022-04-08 03:55:12,296 INFO L290 TraceCheckUtils]: 6: Hoare triple {44453#true} assume !!(1 <= ~n~0 && ~n~0 <= 1000000);~l~0 := 1 + (if ~n~0 < 0 && 0 != ~n~0 % 2 then 1 + ~n~0 / 2 else ~n~0 / 2);~r~0 := ~n~0; {44453#true} is VALID [2022-04-08 03:55:12,297 INFO L290 TraceCheckUtils]: 5: Hoare triple {44453#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;havoc ~n~0;havoc ~l~0;havoc ~r~0;havoc ~i~0;havoc ~j~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {44453#true} is VALID [2022-04-08 03:55:12,297 INFO L272 TraceCheckUtils]: 4: Hoare triple {44453#true} call #t~ret8 := main(#in~argc, #in~argv.base, #in~argv.offset); {44453#true} is VALID [2022-04-08 03:55:12,297 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {44453#true} {44453#true} #138#return; {44453#true} is VALID [2022-04-08 03:55:12,297 INFO L290 TraceCheckUtils]: 2: Hoare triple {44453#true} assume true; {44453#true} is VALID [2022-04-08 03:55:12,297 INFO L290 TraceCheckUtils]: 1: Hoare triple {44453#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(9, 2); {44453#true} is VALID [2022-04-08 03:55:12,297 INFO L272 TraceCheckUtils]: 0: Hoare triple {44453#true} call ULTIMATE.init(); {44453#true} is VALID [2022-04-08 03:55:12,297 INFO L134 CoverageAnalysis]: Checked inductivity of 599 backedges. 37 proven. 66 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2022-04-08 03:55:12,298 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [88677115] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 03:55:12,298 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 03:55:12,298 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 22 [2022-04-08 03:55:12,298 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 03:55:12,298 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [406717458] [2022-04-08 03:55:12,298 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [406717458] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 03:55:12,298 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 03:55:12,298 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-08 03:55:12,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648622782] [2022-04-08 03:55:12,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 03:55:12,299 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.727272727272727) internal successors, (30), 9 states have internal predecessors, (30), 4 states have call successors, (20), 3 states have call predecessors, (20), 1 states have return successors, (18), 4 states have call predecessors, (18), 4 states have call successors, (18) Word has length 116 [2022-04-08 03:55:12,299 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 03:55:12,299 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 2.727272727272727) internal successors, (30), 9 states have internal predecessors, (30), 4 states have call successors, (20), 3 states have call predecessors, (20), 1 states have return successors, (18), 4 states have call predecessors, (18), 4 states have call successors, (18) [2022-04-08 03:55:12,351 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:55:12,351 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-08 03:55:12,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 03:55:12,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-08 03:55:12,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=406, Unknown=0, NotChecked=0, Total=462 [2022-04-08 03:55:12,352 INFO L87 Difference]: Start difference. First operand 364 states and 569 transitions. Second operand has 11 states, 11 states have (on average 2.727272727272727) internal successors, (30), 9 states have internal predecessors, (30), 4 states have call successors, (20), 3 states have call predecessors, (20), 1 states have return successors, (18), 4 states have call predecessors, (18), 4 states have call successors, (18) [2022-04-08 03:55:17,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:55:17,745 INFO L93 Difference]: Finished difference Result 620 states and 983 transitions. [2022-04-08 03:55:17,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-08 03:55:17,745 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.727272727272727) internal successors, (30), 9 states have internal predecessors, (30), 4 states have call successors, (20), 3 states have call predecessors, (20), 1 states have return successors, (18), 4 states have call predecessors, (18), 4 states have call successors, (18) Word has length 116 [2022-04-08 03:55:17,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 03:55:17,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 2.727272727272727) internal successors, (30), 9 states have internal predecessors, (30), 4 states have call successors, (20), 3 states have call predecessors, (20), 1 states have return successors, (18), 4 states have call predecessors, (18), 4 states have call successors, (18) [2022-04-08 03:55:17,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 245 transitions. [2022-04-08 03:55:17,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 2.727272727272727) internal successors, (30), 9 states have internal predecessors, (30), 4 states have call successors, (20), 3 states have call predecessors, (20), 1 states have return successors, (18), 4 states have call predecessors, (18), 4 states have call successors, (18) [2022-04-08 03:55:17,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 245 transitions. [2022-04-08 03:55:17,751 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 245 transitions. [2022-04-08 03:55:17,911 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 245 edges. 245 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:55:17,929 INFO L225 Difference]: With dead ends: 620 [2022-04-08 03:55:17,929 INFO L226 Difference]: Without dead ends: 618 [2022-04-08 03:55:17,930 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 290 GetRequests, 256 SyntacticMatches, 2 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 155 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=171, Invalid=951, Unknown=0, NotChecked=0, Total=1122 [2022-04-08 03:55:17,930 INFO L913 BasicCegarLoop]: 52 mSDtfsCounter, 187 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 796 mSolverCounterSat, 450 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 1246 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 450 IncrementalHoareTripleChecker+Valid, 796 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-04-08 03:55:17,930 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [187 Valid, 89 Invalid, 1246 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [450 Valid, 796 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-04-08 03:55:17,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 618 states. [2022-04-08 03:55:20,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 618 to 501. [2022-04-08 03:55:20,809 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 03:55:20,810 INFO L82 GeneralOperation]: Start isEquivalent. First operand 618 states. Second operand has 501 states, 228 states have (on average 1.3114035087719298) internal successors, (299), 250 states have internal predecessors, (299), 250 states have call successors, (250), 23 states have call predecessors, (250), 22 states have return successors, (249), 227 states have call predecessors, (249), 249 states have call successors, (249) [2022-04-08 03:55:20,811 INFO L74 IsIncluded]: Start isIncluded. First operand 618 states. Second operand has 501 states, 228 states have (on average 1.3114035087719298) internal successors, (299), 250 states have internal predecessors, (299), 250 states have call successors, (250), 23 states have call predecessors, (250), 22 states have return successors, (249), 227 states have call predecessors, (249), 249 states have call successors, (249) [2022-04-08 03:55:20,811 INFO L87 Difference]: Start difference. First operand 618 states. Second operand has 501 states, 228 states have (on average 1.3114035087719298) internal successors, (299), 250 states have internal predecessors, (299), 250 states have call successors, (250), 23 states have call predecessors, (250), 22 states have return successors, (249), 227 states have call predecessors, (249), 249 states have call successors, (249) [2022-04-08 03:55:20,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:55:20,830 INFO L93 Difference]: Finished difference Result 618 states and 981 transitions. [2022-04-08 03:55:20,830 INFO L276 IsEmpty]: Start isEmpty. Operand 618 states and 981 transitions. [2022-04-08 03:55:20,831 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:55:20,831 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:55:20,832 INFO L74 IsIncluded]: Start isIncluded. First operand has 501 states, 228 states have (on average 1.3114035087719298) internal successors, (299), 250 states have internal predecessors, (299), 250 states have call successors, (250), 23 states have call predecessors, (250), 22 states have return successors, (249), 227 states have call predecessors, (249), 249 states have call successors, (249) Second operand 618 states. [2022-04-08 03:55:20,833 INFO L87 Difference]: Start difference. First operand has 501 states, 228 states have (on average 1.3114035087719298) internal successors, (299), 250 states have internal predecessors, (299), 250 states have call successors, (250), 23 states have call predecessors, (250), 22 states have return successors, (249), 227 states have call predecessors, (249), 249 states have call successors, (249) Second operand 618 states. [2022-04-08 03:55:20,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:55:20,852 INFO L93 Difference]: Finished difference Result 618 states and 981 transitions. [2022-04-08 03:55:20,853 INFO L276 IsEmpty]: Start isEmpty. Operand 618 states and 981 transitions. [2022-04-08 03:55:20,854 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:55:20,854 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:55:20,854 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 03:55:20,855 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 03:55:20,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 501 states, 228 states have (on average 1.3114035087719298) internal successors, (299), 250 states have internal predecessors, (299), 250 states have call successors, (250), 23 states have call predecessors, (250), 22 states have return successors, (249), 227 states have call predecessors, (249), 249 states have call successors, (249) [2022-04-08 03:55:20,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 501 states to 501 states and 798 transitions. [2022-04-08 03:55:20,872 INFO L78 Accepts]: Start accepts. Automaton has 501 states and 798 transitions. Word has length 116 [2022-04-08 03:55:20,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 03:55:20,872 INFO L478 AbstractCegarLoop]: Abstraction has 501 states and 798 transitions. [2022-04-08 03:55:20,873 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.727272727272727) internal successors, (30), 9 states have internal predecessors, (30), 4 states have call successors, (20), 3 states have call predecessors, (20), 1 states have return successors, (18), 4 states have call predecessors, (18), 4 states have call successors, (18) [2022-04-08 03:55:20,873 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 501 states and 798 transitions. [2022-04-08 03:55:22,005 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 798 edges. 798 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:55:22,005 INFO L276 IsEmpty]: Start isEmpty. Operand 501 states and 798 transitions. [2022-04-08 03:55:22,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2022-04-08 03:55:22,007 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 03:55:22,007 INFO L499 BasicCegarLoop]: trace histogram [22, 21, 21, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 03:55:22,025 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 03:55:22,223 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 03:55:22,223 INFO L403 AbstractCegarLoop]: === Iteration 24 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 03:55:22,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 03:55:22,224 INFO L85 PathProgramCache]: Analyzing trace with hash -1563563510, now seen corresponding path program 5 times [2022-04-08 03:55:22,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 03:55:22,224 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [923685281] [2022-04-08 03:55:22,224 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 03:55:22,224 INFO L85 PathProgramCache]: Analyzing trace with hash -1563563510, now seen corresponding path program 6 times [2022-04-08 03:55:22,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 03:55:22,225 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [39780829] [2022-04-08 03:55:22,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 03:55:22,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 03:55:22,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:55:22,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 03:55:22,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:55:22,330 INFO L290 TraceCheckUtils]: 0: Hoare triple {48841#(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(9, 2); {48744#true} is VALID [2022-04-08 03:55:22,330 INFO L290 TraceCheckUtils]: 1: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-08 03:55:22,330 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {48744#true} {48744#true} #138#return; {48744#true} is VALID [2022-04-08 03:55:22,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-08 03:55:22,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:55:22,333 INFO L290 TraceCheckUtils]: 0: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-08 03:55:22,334 INFO L290 TraceCheckUtils]: 1: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-08 03:55:22,334 INFO L290 TraceCheckUtils]: 2: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-08 03:55:22,334 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {48744#true} {48751#(<= (+ (* main_~l~0 2) main_~r~0 1) (* main_~n~0 2))} #110#return; {48751#(<= (+ (* main_~l~0 2) main_~r~0 1) (* main_~n~0 2))} is VALID [2022-04-08 03:55:22,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-04-08 03:55:22,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:55:22,336 INFO L290 TraceCheckUtils]: 0: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-08 03:55:22,336 INFO L290 TraceCheckUtils]: 1: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-08 03:55:22,336 INFO L290 TraceCheckUtils]: 2: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-08 03:55:22,337 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {48744#true} {48751#(<= (+ (* main_~l~0 2) main_~r~0 1) (* main_~n~0 2))} #112#return; {48751#(<= (+ (* main_~l~0 2) main_~r~0 1) (* main_~n~0 2))} is VALID [2022-04-08 03:55:22,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-04-08 03:55:22,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:55:22,339 INFO L290 TraceCheckUtils]: 0: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-08 03:55:22,339 INFO L290 TraceCheckUtils]: 1: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-08 03:55:22,339 INFO L290 TraceCheckUtils]: 2: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-08 03:55:22,339 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {48744#true} {48751#(<= (+ (* main_~l~0 2) main_~r~0 1) (* main_~n~0 2))} #114#return; {48751#(<= (+ (* main_~l~0 2) main_~r~0 1) (* main_~n~0 2))} is VALID [2022-04-08 03:55:22,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-04-08 03:55:22,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:55:22,341 INFO L290 TraceCheckUtils]: 0: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-08 03:55:22,341 INFO L290 TraceCheckUtils]: 1: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-08 03:55:22,342 INFO L290 TraceCheckUtils]: 2: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-08 03:55:22,342 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {48744#true} {48751#(<= (+ (* main_~l~0 2) main_~r~0 1) (* main_~n~0 2))} #116#return; {48751#(<= (+ (* main_~l~0 2) main_~r~0 1) (* main_~n~0 2))} is VALID [2022-04-08 03:55:22,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-04-08 03:55:22,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:55:22,344 INFO L290 TraceCheckUtils]: 0: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-08 03:55:22,344 INFO L290 TraceCheckUtils]: 1: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-08 03:55:22,344 INFO L290 TraceCheckUtils]: 2: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-08 03:55:22,345 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {48744#true} {48751#(<= (+ (* main_~l~0 2) main_~r~0 1) (* main_~n~0 2))} #118#return; {48751#(<= (+ (* main_~l~0 2) main_~r~0 1) (* main_~n~0 2))} is VALID [2022-04-08 03:55:22,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-04-08 03:55:22,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:55:22,347 INFO L290 TraceCheckUtils]: 0: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-08 03:55:22,347 INFO L290 TraceCheckUtils]: 1: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-08 03:55:22,347 INFO L290 TraceCheckUtils]: 2: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-08 03:55:22,347 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {48744#true} {48751#(<= (+ (* main_~l~0 2) main_~r~0 1) (* main_~n~0 2))} #120#return; {48751#(<= (+ (* main_~l~0 2) main_~r~0 1) (* main_~n~0 2))} is VALID [2022-04-08 03:55:22,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-04-08 03:55:22,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:55:22,349 INFO L290 TraceCheckUtils]: 0: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-08 03:55:22,349 INFO L290 TraceCheckUtils]: 1: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-08 03:55:22,349 INFO L290 TraceCheckUtils]: 2: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-08 03:55:22,350 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {48744#true} {48776#(<= (+ 5 main_~r~0) (* main_~n~0 2))} #130#return; {48776#(<= (+ 5 main_~r~0) (* main_~n~0 2))} is VALID [2022-04-08 03:55:22,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-04-08 03:55:22,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:55:22,353 INFO L290 TraceCheckUtils]: 0: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-08 03:55:22,353 INFO L290 TraceCheckUtils]: 1: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-08 03:55:22,353 INFO L290 TraceCheckUtils]: 2: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-08 03:55:22,353 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {48744#true} {48776#(<= (+ 5 main_~r~0) (* main_~n~0 2))} #132#return; {48776#(<= (+ 5 main_~r~0) (* main_~n~0 2))} is VALID [2022-04-08 03:55:22,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-04-08 03:55:22,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:55:22,355 INFO L290 TraceCheckUtils]: 0: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-08 03:55:22,356 INFO L290 TraceCheckUtils]: 1: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-08 03:55:22,356 INFO L290 TraceCheckUtils]: 2: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-08 03:55:22,356 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {48744#true} {48776#(<= (+ 5 main_~r~0) (* main_~n~0 2))} #110#return; {48776#(<= (+ 5 main_~r~0) (* main_~n~0 2))} is VALID [2022-04-08 03:55:22,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-04-08 03:55:22,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:55:22,358 INFO L290 TraceCheckUtils]: 0: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-08 03:55:22,358 INFO L290 TraceCheckUtils]: 1: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-08 03:55:22,358 INFO L290 TraceCheckUtils]: 2: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-08 03:55:22,359 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {48744#true} {48776#(<= (+ 5 main_~r~0) (* main_~n~0 2))} #112#return; {48776#(<= (+ 5 main_~r~0) (* main_~n~0 2))} is VALID [2022-04-08 03:55:22,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-04-08 03:55:22,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:55:22,361 INFO L290 TraceCheckUtils]: 0: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-08 03:55:22,361 INFO L290 TraceCheckUtils]: 1: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-08 03:55:22,361 INFO L290 TraceCheckUtils]: 2: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-08 03:55:22,362 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {48744#true} {48776#(<= (+ 5 main_~r~0) (* main_~n~0 2))} #114#return; {48776#(<= (+ 5 main_~r~0) (* main_~n~0 2))} is VALID [2022-04-08 03:55:22,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-04-08 03:55:22,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:55:22,365 INFO L290 TraceCheckUtils]: 0: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-08 03:55:22,366 INFO L290 TraceCheckUtils]: 1: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-08 03:55:22,366 INFO L290 TraceCheckUtils]: 2: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-08 03:55:22,366 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {48744#true} {48776#(<= (+ 5 main_~r~0) (* main_~n~0 2))} #116#return; {48776#(<= (+ 5 main_~r~0) (* main_~n~0 2))} is VALID [2022-04-08 03:55:22,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-04-08 03:55:22,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:55:22,368 INFO L290 TraceCheckUtils]: 0: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-08 03:55:22,369 INFO L290 TraceCheckUtils]: 1: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-08 03:55:22,369 INFO L290 TraceCheckUtils]: 2: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-08 03:55:22,369 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {48744#true} {48776#(<= (+ 5 main_~r~0) (* main_~n~0 2))} #118#return; {48776#(<= (+ 5 main_~r~0) (* main_~n~0 2))} is VALID [2022-04-08 03:55:22,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-04-08 03:55:22,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:55:22,371 INFO L290 TraceCheckUtils]: 0: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-08 03:55:22,371 INFO L290 TraceCheckUtils]: 1: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-08 03:55:22,371 INFO L290 TraceCheckUtils]: 2: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-08 03:55:22,372 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {48744#true} {48776#(<= (+ 5 main_~r~0) (* main_~n~0 2))} #120#return; {48776#(<= (+ 5 main_~r~0) (* main_~n~0 2))} is VALID [2022-04-08 03:55:22,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-04-08 03:55:22,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:55:22,374 INFO L290 TraceCheckUtils]: 0: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-08 03:55:22,374 INFO L290 TraceCheckUtils]: 1: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-08 03:55:22,374 INFO L290 TraceCheckUtils]: 2: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-08 03:55:22,374 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {48744#true} {48776#(<= (+ 5 main_~r~0) (* main_~n~0 2))} #122#return; {48776#(<= (+ 5 main_~r~0) (* main_~n~0 2))} is VALID [2022-04-08 03:55:22,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-04-08 03:55:22,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:55:22,377 INFO L290 TraceCheckUtils]: 0: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-08 03:55:22,377 INFO L290 TraceCheckUtils]: 1: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-08 03:55:22,377 INFO L290 TraceCheckUtils]: 2: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-08 03:55:22,377 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {48744#true} {48776#(<= (+ 5 main_~r~0) (* main_~n~0 2))} #124#return; {48776#(<= (+ 5 main_~r~0) (* main_~n~0 2))} is VALID [2022-04-08 03:55:22,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-04-08 03:55:22,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:55:22,379 INFO L290 TraceCheckUtils]: 0: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-08 03:55:22,380 INFO L290 TraceCheckUtils]: 1: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-08 03:55:22,380 INFO L290 TraceCheckUtils]: 2: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-08 03:55:22,380 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {48744#true} {48776#(<= (+ 5 main_~r~0) (* main_~n~0 2))} #126#return; {48776#(<= (+ 5 main_~r~0) (* main_~n~0 2))} is VALID [2022-04-08 03:55:22,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-04-08 03:55:22,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:55:22,382 INFO L290 TraceCheckUtils]: 0: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-08 03:55:22,382 INFO L290 TraceCheckUtils]: 1: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-08 03:55:22,382 INFO L290 TraceCheckUtils]: 2: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-08 03:55:22,383 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {48744#true} {48776#(<= (+ 5 main_~r~0) (* main_~n~0 2))} #128#return; {48776#(<= (+ 5 main_~r~0) (* main_~n~0 2))} is VALID [2022-04-08 03:55:22,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-04-08 03:55:22,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:55:22,385 INFO L290 TraceCheckUtils]: 0: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-08 03:55:22,385 INFO L290 TraceCheckUtils]: 1: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-08 03:55:22,385 INFO L290 TraceCheckUtils]: 2: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-08 03:55:22,385 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {48744#true} {48826#(<= (+ main_~i~0 3) main_~n~0)} #118#return; {48826#(<= (+ main_~i~0 3) main_~n~0)} is VALID [2022-04-08 03:55:22,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-04-08 03:55:22,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:55:22,388 INFO L290 TraceCheckUtils]: 0: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-08 03:55:22,389 INFO L290 TraceCheckUtils]: 1: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-08 03:55:22,389 INFO L290 TraceCheckUtils]: 2: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-08 03:55:22,389 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {48744#true} {48826#(<= (+ main_~i~0 3) main_~n~0)} #120#return; {48826#(<= (+ main_~i~0 3) main_~n~0)} is VALID [2022-04-08 03:55:22,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-04-08 03:55:22,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:55:22,392 INFO L290 TraceCheckUtils]: 0: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-08 03:55:22,392 INFO L290 TraceCheckUtils]: 1: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-08 03:55:22,392 INFO L290 TraceCheckUtils]: 2: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-08 03:55:22,392 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {48744#true} {48826#(<= (+ main_~i~0 3) main_~n~0)} #122#return; {48826#(<= (+ main_~i~0 3) main_~n~0)} is VALID [2022-04-08 03:55:22,393 INFO L272 TraceCheckUtils]: 0: Hoare triple {48744#true} call ULTIMATE.init(); {48841#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 03:55:22,393 INFO L290 TraceCheckUtils]: 1: Hoare triple {48841#(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(9, 2); {48744#true} is VALID [2022-04-08 03:55:22,393 INFO L290 TraceCheckUtils]: 2: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-08 03:55:22,393 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {48744#true} {48744#true} #138#return; {48744#true} is VALID [2022-04-08 03:55:22,393 INFO L272 TraceCheckUtils]: 4: Hoare triple {48744#true} call #t~ret8 := main(#in~argc, #in~argv.base, #in~argv.offset); {48744#true} is VALID [2022-04-08 03:55:22,393 INFO L290 TraceCheckUtils]: 5: Hoare triple {48744#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;havoc ~n~0;havoc ~l~0;havoc ~r~0;havoc ~i~0;havoc ~j~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {48744#true} is VALID [2022-04-08 03:55:22,393 INFO L290 TraceCheckUtils]: 6: Hoare triple {48744#true} assume !!(1 <= ~n~0 && ~n~0 <= 1000000);~l~0 := 1 + (if ~n~0 < 0 && 0 != ~n~0 % 2 then 1 + ~n~0 / 2 else ~n~0 / 2);~r~0 := ~n~0; {48749#(<= main_~r~0 main_~n~0)} is VALID [2022-04-08 03:55:22,394 INFO L290 TraceCheckUtils]: 7: Hoare triple {48749#(<= main_~r~0 main_~n~0)} assume ~l~0 > 1;#t~post2 := ~l~0;~l~0 := #t~post2 - 1;havoc #t~post2; {48749#(<= main_~r~0 main_~n~0)} is VALID [2022-04-08 03:55:22,394 INFO L290 TraceCheckUtils]: 8: Hoare triple {48749#(<= main_~r~0 main_~n~0)} assume !!(~r~0 > 1);~i~0 := ~l~0;~j~0 := 2 * ~l~0; {48750#(<= (+ (* main_~l~0 2) (* main_~r~0 2)) (+ main_~j~0 (* main_~n~0 2)))} is VALID [2022-04-08 03:55:22,395 INFO L290 TraceCheckUtils]: 9: Hoare triple {48750#(<= (+ (* main_~l~0 2) (* main_~r~0 2)) (+ main_~j~0 (* main_~n~0 2)))} assume !!(~j~0 <= ~r~0); {48750#(<= (+ (* main_~l~0 2) (* main_~r~0 2)) (+ main_~j~0 (* main_~n~0 2)))} is VALID [2022-04-08 03:55:22,395 INFO L290 TraceCheckUtils]: 10: Hoare triple {48750#(<= (+ (* main_~l~0 2) (* main_~r~0 2)) (+ main_~j~0 (* main_~n~0 2)))} assume ~j~0 < ~r~0; {48751#(<= (+ (* main_~l~0 2) main_~r~0 1) (* main_~n~0 2))} is VALID [2022-04-08 03:55:22,395 INFO L272 TraceCheckUtils]: 11: Hoare triple {48751#(<= (+ (* main_~l~0 2) main_~r~0 1) (* main_~n~0 2))} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {48744#true} is VALID [2022-04-08 03:55:22,395 INFO L290 TraceCheckUtils]: 12: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-08 03:55:22,395 INFO L290 TraceCheckUtils]: 13: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-08 03:55:22,395 INFO L290 TraceCheckUtils]: 14: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-08 03:55:22,396 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {48744#true} {48751#(<= (+ (* main_~l~0 2) main_~r~0 1) (* main_~n~0 2))} #110#return; {48751#(<= (+ (* main_~l~0 2) main_~r~0 1) (* main_~n~0 2))} is VALID [2022-04-08 03:55:22,396 INFO L272 TraceCheckUtils]: 16: Hoare triple {48751#(<= (+ (* main_~l~0 2) main_~r~0 1) (* main_~n~0 2))} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {48744#true} is VALID [2022-04-08 03:55:22,396 INFO L290 TraceCheckUtils]: 17: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-08 03:55:22,396 INFO L290 TraceCheckUtils]: 18: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-08 03:55:22,396 INFO L290 TraceCheckUtils]: 19: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-08 03:55:22,397 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {48744#true} {48751#(<= (+ (* main_~l~0 2) main_~r~0 1) (* main_~n~0 2))} #112#return; {48751#(<= (+ (* main_~l~0 2) main_~r~0 1) (* main_~n~0 2))} is VALID [2022-04-08 03:55:22,397 INFO L272 TraceCheckUtils]: 21: Hoare triple {48751#(<= (+ (* main_~l~0 2) main_~r~0 1) (* main_~n~0 2))} call __VERIFIER_assert((if 1 <= 1 + ~j~0 then 1 else 0)); {48744#true} is VALID [2022-04-08 03:55:22,397 INFO L290 TraceCheckUtils]: 22: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-08 03:55:22,397 INFO L290 TraceCheckUtils]: 23: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-08 03:55:22,397 INFO L290 TraceCheckUtils]: 24: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-08 03:55:22,397 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {48744#true} {48751#(<= (+ (* main_~l~0 2) main_~r~0 1) (* main_~n~0 2))} #114#return; {48751#(<= (+ (* main_~l~0 2) main_~r~0 1) (* main_~n~0 2))} is VALID [2022-04-08 03:55:22,398 INFO L272 TraceCheckUtils]: 26: Hoare triple {48751#(<= (+ (* main_~l~0 2) main_~r~0 1) (* main_~n~0 2))} call __VERIFIER_assert((if 1 + ~j~0 <= ~n~0 then 1 else 0)); {48744#true} is VALID [2022-04-08 03:55:22,398 INFO L290 TraceCheckUtils]: 27: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-08 03:55:22,398 INFO L290 TraceCheckUtils]: 28: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-08 03:55:22,398 INFO L290 TraceCheckUtils]: 29: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-08 03:55:22,398 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {48744#true} {48751#(<= (+ (* main_~l~0 2) main_~r~0 1) (* main_~n~0 2))} #116#return; {48751#(<= (+ (* main_~l~0 2) main_~r~0 1) (* main_~n~0 2))} is VALID [2022-04-08 03:55:22,399 INFO L290 TraceCheckUtils]: 31: Hoare triple {48751#(<= (+ (* main_~l~0 2) main_~r~0 1) (* main_~n~0 2))} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {48751#(<= (+ (* main_~l~0 2) main_~r~0 1) (* main_~n~0 2))} is VALID [2022-04-08 03:55:22,399 INFO L290 TraceCheckUtils]: 32: Hoare triple {48751#(<= (+ (* main_~l~0 2) main_~r~0 1) (* main_~n~0 2))} assume 0 != #t~nondet4;havoc #t~nondet4;~j~0 := 1 + ~j~0; {48751#(<= (+ (* main_~l~0 2) main_~r~0 1) (* main_~n~0 2))} is VALID [2022-04-08 03:55:22,399 INFO L272 TraceCheckUtils]: 33: Hoare triple {48751#(<= (+ (* main_~l~0 2) main_~r~0 1) (* main_~n~0 2))} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {48744#true} is VALID [2022-04-08 03:55:22,399 INFO L290 TraceCheckUtils]: 34: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-08 03:55:22,399 INFO L290 TraceCheckUtils]: 35: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-08 03:55:22,399 INFO L290 TraceCheckUtils]: 36: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-08 03:55:22,400 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {48744#true} {48751#(<= (+ (* main_~l~0 2) main_~r~0 1) (* main_~n~0 2))} #118#return; {48751#(<= (+ (* main_~l~0 2) main_~r~0 1) (* main_~n~0 2))} is VALID [2022-04-08 03:55:22,400 INFO L272 TraceCheckUtils]: 38: Hoare triple {48751#(<= (+ (* main_~l~0 2) main_~r~0 1) (* main_~n~0 2))} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {48744#true} is VALID [2022-04-08 03:55:22,400 INFO L290 TraceCheckUtils]: 39: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-08 03:55:22,400 INFO L290 TraceCheckUtils]: 40: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-08 03:55:22,400 INFO L290 TraceCheckUtils]: 41: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-08 03:55:22,400 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {48744#true} {48751#(<= (+ (* main_~l~0 2) main_~r~0 1) (* main_~n~0 2))} #120#return; {48751#(<= (+ (* main_~l~0 2) main_~r~0 1) (* main_~n~0 2))} is VALID [2022-04-08 03:55:22,401 INFO L290 TraceCheckUtils]: 43: Hoare triple {48751#(<= (+ (* main_~l~0 2) main_~r~0 1) (* main_~n~0 2))} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {48751#(<= (+ (* main_~l~0 2) main_~r~0 1) (* main_~n~0 2))} is VALID [2022-04-08 03:55:22,401 INFO L290 TraceCheckUtils]: 44: Hoare triple {48751#(<= (+ (* main_~l~0 2) main_~r~0 1) (* main_~n~0 2))} assume 0 != #t~nondet5;havoc #t~nondet5; {48751#(<= (+ (* main_~l~0 2) main_~r~0 1) (* main_~n~0 2))} is VALID [2022-04-08 03:55:22,401 INFO L290 TraceCheckUtils]: 45: Hoare triple {48751#(<= (+ (* main_~l~0 2) main_~r~0 1) (* main_~n~0 2))} assume ~l~0 > 1; {48776#(<= (+ 5 main_~r~0) (* main_~n~0 2))} is VALID [2022-04-08 03:55:22,402 INFO L272 TraceCheckUtils]: 46: Hoare triple {48776#(<= (+ 5 main_~r~0) (* main_~n~0 2))} call __VERIFIER_assert((if 1 <= ~l~0 then 1 else 0)); {48744#true} is VALID [2022-04-08 03:55:22,402 INFO L290 TraceCheckUtils]: 47: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-08 03:55:22,402 INFO L290 TraceCheckUtils]: 48: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-08 03:55:22,402 INFO L290 TraceCheckUtils]: 49: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-08 03:55:22,402 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {48744#true} {48776#(<= (+ 5 main_~r~0) (* main_~n~0 2))} #130#return; {48776#(<= (+ 5 main_~r~0) (* main_~n~0 2))} is VALID [2022-04-08 03:55:22,402 INFO L272 TraceCheckUtils]: 51: Hoare triple {48776#(<= (+ 5 main_~r~0) (* main_~n~0 2))} call __VERIFIER_assert((if ~l~0 <= ~n~0 then 1 else 0)); {48744#true} is VALID [2022-04-08 03:55:22,402 INFO L290 TraceCheckUtils]: 52: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-08 03:55:22,402 INFO L290 TraceCheckUtils]: 53: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-08 03:55:22,403 INFO L290 TraceCheckUtils]: 54: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-08 03:55:22,403 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {48744#true} {48776#(<= (+ 5 main_~r~0) (* main_~n~0 2))} #132#return; {48776#(<= (+ 5 main_~r~0) (* main_~n~0 2))} is VALID [2022-04-08 03:55:22,403 INFO L290 TraceCheckUtils]: 56: Hoare triple {48776#(<= (+ 5 main_~r~0) (* main_~n~0 2))} #t~post6 := ~l~0;~l~0 := #t~post6 - 1;havoc #t~post6; {48776#(<= (+ 5 main_~r~0) (* main_~n~0 2))} is VALID [2022-04-08 03:55:22,404 INFO L290 TraceCheckUtils]: 57: Hoare triple {48776#(<= (+ 5 main_~r~0) (* main_~n~0 2))} assume !!(~r~0 > 1);~i~0 := ~l~0;~j~0 := 2 * ~l~0; {48776#(<= (+ 5 main_~r~0) (* main_~n~0 2))} is VALID [2022-04-08 03:55:22,404 INFO L290 TraceCheckUtils]: 58: Hoare triple {48776#(<= (+ 5 main_~r~0) (* main_~n~0 2))} assume !!(~j~0 <= ~r~0); {48776#(<= (+ 5 main_~r~0) (* main_~n~0 2))} is VALID [2022-04-08 03:55:22,404 INFO L290 TraceCheckUtils]: 59: Hoare triple {48776#(<= (+ 5 main_~r~0) (* main_~n~0 2))} assume ~j~0 < ~r~0; {48776#(<= (+ 5 main_~r~0) (* main_~n~0 2))} is VALID [2022-04-08 03:55:22,404 INFO L272 TraceCheckUtils]: 60: Hoare triple {48776#(<= (+ 5 main_~r~0) (* main_~n~0 2))} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {48744#true} is VALID [2022-04-08 03:55:22,404 INFO L290 TraceCheckUtils]: 61: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-08 03:55:22,404 INFO L290 TraceCheckUtils]: 62: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-08 03:55:22,405 INFO L290 TraceCheckUtils]: 63: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-08 03:55:22,405 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {48744#true} {48776#(<= (+ 5 main_~r~0) (* main_~n~0 2))} #110#return; {48776#(<= (+ 5 main_~r~0) (* main_~n~0 2))} is VALID [2022-04-08 03:55:22,405 INFO L272 TraceCheckUtils]: 65: Hoare triple {48776#(<= (+ 5 main_~r~0) (* main_~n~0 2))} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {48744#true} is VALID [2022-04-08 03:55:22,405 INFO L290 TraceCheckUtils]: 66: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-08 03:55:22,405 INFO L290 TraceCheckUtils]: 67: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-08 03:55:22,405 INFO L290 TraceCheckUtils]: 68: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-08 03:55:22,406 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {48744#true} {48776#(<= (+ 5 main_~r~0) (* main_~n~0 2))} #112#return; {48776#(<= (+ 5 main_~r~0) (* main_~n~0 2))} is VALID [2022-04-08 03:55:22,406 INFO L272 TraceCheckUtils]: 70: Hoare triple {48776#(<= (+ 5 main_~r~0) (* main_~n~0 2))} call __VERIFIER_assert((if 1 <= 1 + ~j~0 then 1 else 0)); {48744#true} is VALID [2022-04-08 03:55:22,406 INFO L290 TraceCheckUtils]: 71: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-08 03:55:22,406 INFO L290 TraceCheckUtils]: 72: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-08 03:55:22,406 INFO L290 TraceCheckUtils]: 73: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-08 03:55:22,406 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {48744#true} {48776#(<= (+ 5 main_~r~0) (* main_~n~0 2))} #114#return; {48776#(<= (+ 5 main_~r~0) (* main_~n~0 2))} is VALID [2022-04-08 03:55:22,407 INFO L272 TraceCheckUtils]: 75: Hoare triple {48776#(<= (+ 5 main_~r~0) (* main_~n~0 2))} call __VERIFIER_assert((if 1 + ~j~0 <= ~n~0 then 1 else 0)); {48744#true} is VALID [2022-04-08 03:55:22,407 INFO L290 TraceCheckUtils]: 76: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-08 03:55:22,407 INFO L290 TraceCheckUtils]: 77: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-08 03:55:22,407 INFO L290 TraceCheckUtils]: 78: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-08 03:55:22,407 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {48744#true} {48776#(<= (+ 5 main_~r~0) (* main_~n~0 2))} #116#return; {48776#(<= (+ 5 main_~r~0) (* main_~n~0 2))} is VALID [2022-04-08 03:55:22,408 INFO L290 TraceCheckUtils]: 80: Hoare triple {48776#(<= (+ 5 main_~r~0) (* main_~n~0 2))} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {48776#(<= (+ 5 main_~r~0) (* main_~n~0 2))} is VALID [2022-04-08 03:55:22,408 INFO L290 TraceCheckUtils]: 81: Hoare triple {48776#(<= (+ 5 main_~r~0) (* main_~n~0 2))} assume 0 != #t~nondet4;havoc #t~nondet4;~j~0 := 1 + ~j~0; {48776#(<= (+ 5 main_~r~0) (* main_~n~0 2))} is VALID [2022-04-08 03:55:22,408 INFO L272 TraceCheckUtils]: 82: Hoare triple {48776#(<= (+ 5 main_~r~0) (* main_~n~0 2))} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {48744#true} is VALID [2022-04-08 03:55:22,408 INFO L290 TraceCheckUtils]: 83: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-08 03:55:22,408 INFO L290 TraceCheckUtils]: 84: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-08 03:55:22,408 INFO L290 TraceCheckUtils]: 85: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-08 03:55:22,409 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {48744#true} {48776#(<= (+ 5 main_~r~0) (* main_~n~0 2))} #118#return; {48776#(<= (+ 5 main_~r~0) (* main_~n~0 2))} is VALID [2022-04-08 03:55:22,409 INFO L272 TraceCheckUtils]: 87: Hoare triple {48776#(<= (+ 5 main_~r~0) (* main_~n~0 2))} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {48744#true} is VALID [2022-04-08 03:55:22,409 INFO L290 TraceCheckUtils]: 88: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-08 03:55:22,409 INFO L290 TraceCheckUtils]: 89: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-08 03:55:22,409 INFO L290 TraceCheckUtils]: 90: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-08 03:55:22,409 INFO L284 TraceCheckUtils]: 91: Hoare quadruple {48744#true} {48776#(<= (+ 5 main_~r~0) (* main_~n~0 2))} #120#return; {48776#(<= (+ 5 main_~r~0) (* main_~n~0 2))} is VALID [2022-04-08 03:55:22,410 INFO L290 TraceCheckUtils]: 92: Hoare triple {48776#(<= (+ 5 main_~r~0) (* main_~n~0 2))} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {48776#(<= (+ 5 main_~r~0) (* main_~n~0 2))} is VALID [2022-04-08 03:55:22,410 INFO L290 TraceCheckUtils]: 93: Hoare triple {48776#(<= (+ 5 main_~r~0) (* main_~n~0 2))} assume !(0 != #t~nondet5);havoc #t~nondet5; {48776#(<= (+ 5 main_~r~0) (* main_~n~0 2))} is VALID [2022-04-08 03:55:22,410 INFO L272 TraceCheckUtils]: 94: Hoare triple {48776#(<= (+ 5 main_~r~0) (* main_~n~0 2))} call __VERIFIER_assert((if 1 <= ~i~0 then 1 else 0)); {48744#true} is VALID [2022-04-08 03:55:22,410 INFO L290 TraceCheckUtils]: 95: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-08 03:55:22,410 INFO L290 TraceCheckUtils]: 96: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-08 03:55:22,410 INFO L290 TraceCheckUtils]: 97: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-08 03:55:22,411 INFO L284 TraceCheckUtils]: 98: Hoare quadruple {48744#true} {48776#(<= (+ 5 main_~r~0) (* main_~n~0 2))} #122#return; {48776#(<= (+ 5 main_~r~0) (* main_~n~0 2))} is VALID [2022-04-08 03:55:22,411 INFO L272 TraceCheckUtils]: 99: Hoare triple {48776#(<= (+ 5 main_~r~0) (* main_~n~0 2))} call __VERIFIER_assert((if ~i~0 <= ~n~0 then 1 else 0)); {48744#true} is VALID [2022-04-08 03:55:22,411 INFO L290 TraceCheckUtils]: 100: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-08 03:55:22,411 INFO L290 TraceCheckUtils]: 101: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-08 03:55:22,411 INFO L290 TraceCheckUtils]: 102: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-08 03:55:22,411 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {48744#true} {48776#(<= (+ 5 main_~r~0) (* main_~n~0 2))} #124#return; {48776#(<= (+ 5 main_~r~0) (* main_~n~0 2))} is VALID [2022-04-08 03:55:22,412 INFO L272 TraceCheckUtils]: 104: Hoare triple {48776#(<= (+ 5 main_~r~0) (* main_~n~0 2))} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {48744#true} is VALID [2022-04-08 03:55:22,412 INFO L290 TraceCheckUtils]: 105: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-08 03:55:22,412 INFO L290 TraceCheckUtils]: 106: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-08 03:55:22,412 INFO L290 TraceCheckUtils]: 107: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-08 03:55:22,412 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {48744#true} {48776#(<= (+ 5 main_~r~0) (* main_~n~0 2))} #126#return; {48776#(<= (+ 5 main_~r~0) (* main_~n~0 2))} is VALID [2022-04-08 03:55:22,412 INFO L272 TraceCheckUtils]: 109: Hoare triple {48776#(<= (+ 5 main_~r~0) (* main_~n~0 2))} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {48744#true} is VALID [2022-04-08 03:55:22,412 INFO L290 TraceCheckUtils]: 110: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-08 03:55:22,413 INFO L290 TraceCheckUtils]: 111: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-08 03:55:22,413 INFO L290 TraceCheckUtils]: 112: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-08 03:55:22,413 INFO L284 TraceCheckUtils]: 113: Hoare quadruple {48744#true} {48776#(<= (+ 5 main_~r~0) (* main_~n~0 2))} #128#return; {48776#(<= (+ 5 main_~r~0) (* main_~n~0 2))} is VALID [2022-04-08 03:55:22,413 INFO L290 TraceCheckUtils]: 114: Hoare triple {48776#(<= (+ 5 main_~r~0) (* main_~n~0 2))} ~i~0 := ~j~0;~j~0 := 2 * ~j~0; {48825#(<= (+ 5 main_~r~0 (* main_~i~0 2)) (+ main_~j~0 (* main_~n~0 2)))} is VALID [2022-04-08 03:55:22,414 INFO L290 TraceCheckUtils]: 115: Hoare triple {48825#(<= (+ 5 main_~r~0 (* main_~i~0 2)) (+ main_~j~0 (* main_~n~0 2)))} assume !!(~j~0 <= ~r~0); {48826#(<= (+ main_~i~0 3) main_~n~0)} is VALID [2022-04-08 03:55:22,414 INFO L290 TraceCheckUtils]: 116: Hoare triple {48826#(<= (+ main_~i~0 3) main_~n~0)} assume !(~j~0 < ~r~0); {48826#(<= (+ main_~i~0 3) main_~n~0)} is VALID [2022-04-08 03:55:22,414 INFO L272 TraceCheckUtils]: 117: Hoare triple {48826#(<= (+ main_~i~0 3) main_~n~0)} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {48744#true} is VALID [2022-04-08 03:55:22,414 INFO L290 TraceCheckUtils]: 118: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-08 03:55:22,414 INFO L290 TraceCheckUtils]: 119: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-08 03:55:22,415 INFO L290 TraceCheckUtils]: 120: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-08 03:55:22,415 INFO L284 TraceCheckUtils]: 121: Hoare quadruple {48744#true} {48826#(<= (+ main_~i~0 3) main_~n~0)} #118#return; {48826#(<= (+ main_~i~0 3) main_~n~0)} is VALID [2022-04-08 03:55:22,415 INFO L272 TraceCheckUtils]: 122: Hoare triple {48826#(<= (+ main_~i~0 3) main_~n~0)} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {48744#true} is VALID [2022-04-08 03:55:22,415 INFO L290 TraceCheckUtils]: 123: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-08 03:55:22,415 INFO L290 TraceCheckUtils]: 124: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-08 03:55:22,415 INFO L290 TraceCheckUtils]: 125: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-08 03:55:22,416 INFO L284 TraceCheckUtils]: 126: Hoare quadruple {48744#true} {48826#(<= (+ main_~i~0 3) main_~n~0)} #120#return; {48826#(<= (+ main_~i~0 3) main_~n~0)} is VALID [2022-04-08 03:55:22,416 INFO L290 TraceCheckUtils]: 127: Hoare triple {48826#(<= (+ main_~i~0 3) main_~n~0)} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {48826#(<= (+ main_~i~0 3) main_~n~0)} is VALID [2022-04-08 03:55:22,416 INFO L290 TraceCheckUtils]: 128: Hoare triple {48826#(<= (+ main_~i~0 3) main_~n~0)} assume !(0 != #t~nondet5);havoc #t~nondet5; {48826#(<= (+ main_~i~0 3) main_~n~0)} is VALID [2022-04-08 03:55:22,416 INFO L272 TraceCheckUtils]: 129: Hoare triple {48826#(<= (+ main_~i~0 3) main_~n~0)} call __VERIFIER_assert((if 1 <= ~i~0 then 1 else 0)); {48744#true} is VALID [2022-04-08 03:55:22,416 INFO L290 TraceCheckUtils]: 130: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-08 03:55:22,416 INFO L290 TraceCheckUtils]: 131: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-08 03:55:22,417 INFO L290 TraceCheckUtils]: 132: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-08 03:55:22,417 INFO L284 TraceCheckUtils]: 133: Hoare quadruple {48744#true} {48826#(<= (+ main_~i~0 3) main_~n~0)} #122#return; {48826#(<= (+ main_~i~0 3) main_~n~0)} is VALID [2022-04-08 03:55:22,417 INFO L272 TraceCheckUtils]: 134: Hoare triple {48826#(<= (+ main_~i~0 3) main_~n~0)} call __VERIFIER_assert((if ~i~0 <= ~n~0 then 1 else 0)); {48839#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 03:55:22,418 INFO L290 TraceCheckUtils]: 135: Hoare triple {48839#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {48840#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 03:55:22,418 INFO L290 TraceCheckUtils]: 136: Hoare triple {48840#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {48745#false} is VALID [2022-04-08 03:55:22,418 INFO L290 TraceCheckUtils]: 137: Hoare triple {48745#false} assume !false; {48745#false} is VALID [2022-04-08 03:55:22,418 INFO L134 CoverageAnalysis]: Checked inductivity of 909 backedges. 42 proven. 27 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2022-04-08 03:55:22,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 03:55:22,419 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [39780829] [2022-04-08 03:55:22,419 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [39780829] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 03:55:22,419 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [315195758] [2022-04-08 03:55:22,419 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 03:55:22,419 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 03:55:22,419 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 03:55:22,420 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 03:55:22,421 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 03:55:22,470 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-04-08 03:55:22,470 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 03:55:22,471 INFO L263 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-08 03:55:22,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:55:22,485 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 03:55:23,448 INFO L272 TraceCheckUtils]: 0: Hoare triple {48744#true} call ULTIMATE.init(); {48744#true} is VALID [2022-04-08 03:55:23,449 INFO L290 TraceCheckUtils]: 1: Hoare triple {48744#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(9, 2); {48744#true} is VALID [2022-04-08 03:55:23,449 INFO L290 TraceCheckUtils]: 2: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-08 03:55:23,449 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {48744#true} {48744#true} #138#return; {48744#true} is VALID [2022-04-08 03:55:23,449 INFO L272 TraceCheckUtils]: 4: Hoare triple {48744#true} call #t~ret8 := main(#in~argc, #in~argv.base, #in~argv.offset); {48744#true} is VALID [2022-04-08 03:55:23,449 INFO L290 TraceCheckUtils]: 5: Hoare triple {48744#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;havoc ~n~0;havoc ~l~0;havoc ~r~0;havoc ~i~0;havoc ~j~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {48744#true} is VALID [2022-04-08 03:55:23,449 INFO L290 TraceCheckUtils]: 6: Hoare triple {48744#true} assume !!(1 <= ~n~0 && ~n~0 <= 1000000);~l~0 := 1 + (if ~n~0 < 0 && 0 != ~n~0 % 2 then 1 + ~n~0 / 2 else ~n~0 / 2);~r~0 := ~n~0; {48749#(<= main_~r~0 main_~n~0)} is VALID [2022-04-08 03:55:23,450 INFO L290 TraceCheckUtils]: 7: Hoare triple {48749#(<= main_~r~0 main_~n~0)} assume ~l~0 > 1;#t~post2 := ~l~0;~l~0 := #t~post2 - 1;havoc #t~post2; {48749#(<= main_~r~0 main_~n~0)} is VALID [2022-04-08 03:55:23,450 INFO L290 TraceCheckUtils]: 8: Hoare triple {48749#(<= main_~r~0 main_~n~0)} assume !!(~r~0 > 1);~i~0 := ~l~0;~j~0 := 2 * ~l~0; {48749#(<= main_~r~0 main_~n~0)} is VALID [2022-04-08 03:55:23,450 INFO L290 TraceCheckUtils]: 9: Hoare triple {48749#(<= main_~r~0 main_~n~0)} assume !!(~j~0 <= ~r~0); {48749#(<= main_~r~0 main_~n~0)} is VALID [2022-04-08 03:55:23,450 INFO L290 TraceCheckUtils]: 10: Hoare triple {48749#(<= main_~r~0 main_~n~0)} assume ~j~0 < ~r~0; {48749#(<= main_~r~0 main_~n~0)} is VALID [2022-04-08 03:55:23,450 INFO L272 TraceCheckUtils]: 11: Hoare triple {48749#(<= main_~r~0 main_~n~0)} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {48744#true} is VALID [2022-04-08 03:55:23,451 INFO L290 TraceCheckUtils]: 12: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-08 03:55:23,451 INFO L290 TraceCheckUtils]: 13: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-08 03:55:23,451 INFO L290 TraceCheckUtils]: 14: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-08 03:55:23,451 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {48744#true} {48749#(<= main_~r~0 main_~n~0)} #110#return; {48749#(<= main_~r~0 main_~n~0)} is VALID [2022-04-08 03:55:23,451 INFO L272 TraceCheckUtils]: 16: Hoare triple {48749#(<= main_~r~0 main_~n~0)} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {48744#true} is VALID [2022-04-08 03:55:23,451 INFO L290 TraceCheckUtils]: 17: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-08 03:55:23,451 INFO L290 TraceCheckUtils]: 18: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-08 03:55:23,451 INFO L290 TraceCheckUtils]: 19: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-08 03:55:23,452 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {48744#true} {48749#(<= main_~r~0 main_~n~0)} #112#return; {48749#(<= main_~r~0 main_~n~0)} is VALID [2022-04-08 03:55:23,452 INFO L272 TraceCheckUtils]: 21: Hoare triple {48749#(<= main_~r~0 main_~n~0)} call __VERIFIER_assert((if 1 <= 1 + ~j~0 then 1 else 0)); {48744#true} is VALID [2022-04-08 03:55:23,452 INFO L290 TraceCheckUtils]: 22: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-08 03:55:23,452 INFO L290 TraceCheckUtils]: 23: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-08 03:55:23,452 INFO L290 TraceCheckUtils]: 24: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-08 03:55:23,453 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {48744#true} {48749#(<= main_~r~0 main_~n~0)} #114#return; {48749#(<= main_~r~0 main_~n~0)} is VALID [2022-04-08 03:55:23,453 INFO L272 TraceCheckUtils]: 26: Hoare triple {48749#(<= main_~r~0 main_~n~0)} call __VERIFIER_assert((if 1 + ~j~0 <= ~n~0 then 1 else 0)); {48744#true} is VALID [2022-04-08 03:55:23,453 INFO L290 TraceCheckUtils]: 27: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-08 03:55:23,453 INFO L290 TraceCheckUtils]: 28: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-08 03:55:23,453 INFO L290 TraceCheckUtils]: 29: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-08 03:55:23,453 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {48744#true} {48749#(<= main_~r~0 main_~n~0)} #116#return; {48749#(<= main_~r~0 main_~n~0)} is VALID [2022-04-08 03:55:23,453 INFO L290 TraceCheckUtils]: 31: Hoare triple {48749#(<= main_~r~0 main_~n~0)} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {48749#(<= main_~r~0 main_~n~0)} is VALID [2022-04-08 03:55:23,454 INFO L290 TraceCheckUtils]: 32: Hoare triple {48749#(<= main_~r~0 main_~n~0)} assume 0 != #t~nondet4;havoc #t~nondet4;~j~0 := 1 + ~j~0; {48749#(<= main_~r~0 main_~n~0)} is VALID [2022-04-08 03:55:23,454 INFO L272 TraceCheckUtils]: 33: Hoare triple {48749#(<= main_~r~0 main_~n~0)} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {48744#true} is VALID [2022-04-08 03:55:23,454 INFO L290 TraceCheckUtils]: 34: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-08 03:55:23,454 INFO L290 TraceCheckUtils]: 35: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-08 03:55:23,454 INFO L290 TraceCheckUtils]: 36: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-08 03:55:23,454 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {48744#true} {48749#(<= main_~r~0 main_~n~0)} #118#return; {48749#(<= main_~r~0 main_~n~0)} is VALID [2022-04-08 03:55:23,454 INFO L272 TraceCheckUtils]: 38: Hoare triple {48749#(<= main_~r~0 main_~n~0)} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {48744#true} is VALID [2022-04-08 03:55:23,455 INFO L290 TraceCheckUtils]: 39: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-08 03:55:23,455 INFO L290 TraceCheckUtils]: 40: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-08 03:55:23,455 INFO L290 TraceCheckUtils]: 41: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-08 03:55:23,455 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {48744#true} {48749#(<= main_~r~0 main_~n~0)} #120#return; {48749#(<= main_~r~0 main_~n~0)} is VALID [2022-04-08 03:55:23,455 INFO L290 TraceCheckUtils]: 43: Hoare triple {48749#(<= main_~r~0 main_~n~0)} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {48749#(<= main_~r~0 main_~n~0)} is VALID [2022-04-08 03:55:23,456 INFO L290 TraceCheckUtils]: 44: Hoare triple {48749#(<= main_~r~0 main_~n~0)} assume 0 != #t~nondet5;havoc #t~nondet5; {48749#(<= main_~r~0 main_~n~0)} is VALID [2022-04-08 03:55:23,456 INFO L290 TraceCheckUtils]: 45: Hoare triple {48749#(<= main_~r~0 main_~n~0)} assume ~l~0 > 1; {48749#(<= main_~r~0 main_~n~0)} is VALID [2022-04-08 03:55:23,456 INFO L272 TraceCheckUtils]: 46: Hoare triple {48749#(<= main_~r~0 main_~n~0)} call __VERIFIER_assert((if 1 <= ~l~0 then 1 else 0)); {48744#true} is VALID [2022-04-08 03:55:23,456 INFO L290 TraceCheckUtils]: 47: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-08 03:55:23,456 INFO L290 TraceCheckUtils]: 48: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-08 03:55:23,456 INFO L290 TraceCheckUtils]: 49: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-08 03:55:23,456 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {48744#true} {48749#(<= main_~r~0 main_~n~0)} #130#return; {48749#(<= main_~r~0 main_~n~0)} is VALID [2022-04-08 03:55:23,457 INFO L272 TraceCheckUtils]: 51: Hoare triple {48749#(<= main_~r~0 main_~n~0)} call __VERIFIER_assert((if ~l~0 <= ~n~0 then 1 else 0)); {48744#true} is VALID [2022-04-08 03:55:23,457 INFO L290 TraceCheckUtils]: 52: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-08 03:55:23,457 INFO L290 TraceCheckUtils]: 53: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-08 03:55:23,457 INFO L290 TraceCheckUtils]: 54: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-08 03:55:23,457 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {48744#true} {48749#(<= main_~r~0 main_~n~0)} #132#return; {48749#(<= main_~r~0 main_~n~0)} is VALID [2022-04-08 03:55:23,457 INFO L290 TraceCheckUtils]: 56: Hoare triple {48749#(<= main_~r~0 main_~n~0)} #t~post6 := ~l~0;~l~0 := #t~post6 - 1;havoc #t~post6; {48749#(<= main_~r~0 main_~n~0)} is VALID [2022-04-08 03:55:23,458 INFO L290 TraceCheckUtils]: 57: Hoare triple {48749#(<= main_~r~0 main_~n~0)} assume !!(~r~0 > 1);~i~0 := ~l~0;~j~0 := 2 * ~l~0; {49016#(and (< 1 main_~r~0) (<= main_~r~0 main_~n~0))} is VALID [2022-04-08 03:55:23,458 INFO L290 TraceCheckUtils]: 58: Hoare triple {49016#(and (< 1 main_~r~0) (<= main_~r~0 main_~n~0))} assume !!(~j~0 <= ~r~0); {49016#(and (< 1 main_~r~0) (<= main_~r~0 main_~n~0))} is VALID [2022-04-08 03:55:23,458 INFO L290 TraceCheckUtils]: 59: Hoare triple {49016#(and (< 1 main_~r~0) (<= main_~r~0 main_~n~0))} assume ~j~0 < ~r~0; {49016#(and (< 1 main_~r~0) (<= main_~r~0 main_~n~0))} is VALID [2022-04-08 03:55:23,458 INFO L272 TraceCheckUtils]: 60: Hoare triple {49016#(and (< 1 main_~r~0) (<= main_~r~0 main_~n~0))} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {48744#true} is VALID [2022-04-08 03:55:23,458 INFO L290 TraceCheckUtils]: 61: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-08 03:55:23,459 INFO L290 TraceCheckUtils]: 62: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-08 03:55:23,459 INFO L290 TraceCheckUtils]: 63: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-08 03:55:23,459 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {48744#true} {49016#(and (< 1 main_~r~0) (<= main_~r~0 main_~n~0))} #110#return; {49016#(and (< 1 main_~r~0) (<= main_~r~0 main_~n~0))} is VALID [2022-04-08 03:55:23,459 INFO L272 TraceCheckUtils]: 65: Hoare triple {49016#(and (< 1 main_~r~0) (<= main_~r~0 main_~n~0))} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {48744#true} is VALID [2022-04-08 03:55:23,459 INFO L290 TraceCheckUtils]: 66: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-08 03:55:23,459 INFO L290 TraceCheckUtils]: 67: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-08 03:55:23,459 INFO L290 TraceCheckUtils]: 68: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-08 03:55:23,460 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {48744#true} {49016#(and (< 1 main_~r~0) (<= main_~r~0 main_~n~0))} #112#return; {49016#(and (< 1 main_~r~0) (<= main_~r~0 main_~n~0))} is VALID [2022-04-08 03:55:23,460 INFO L272 TraceCheckUtils]: 70: Hoare triple {49016#(and (< 1 main_~r~0) (<= main_~r~0 main_~n~0))} call __VERIFIER_assert((if 1 <= 1 + ~j~0 then 1 else 0)); {48744#true} is VALID [2022-04-08 03:55:23,460 INFO L290 TraceCheckUtils]: 71: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-08 03:55:23,460 INFO L290 TraceCheckUtils]: 72: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-08 03:55:23,460 INFO L290 TraceCheckUtils]: 73: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-08 03:55:23,460 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {48744#true} {49016#(and (< 1 main_~r~0) (<= main_~r~0 main_~n~0))} #114#return; {49016#(and (< 1 main_~r~0) (<= main_~r~0 main_~n~0))} is VALID [2022-04-08 03:55:23,460 INFO L272 TraceCheckUtils]: 75: Hoare triple {49016#(and (< 1 main_~r~0) (<= main_~r~0 main_~n~0))} call __VERIFIER_assert((if 1 + ~j~0 <= ~n~0 then 1 else 0)); {48744#true} is VALID [2022-04-08 03:55:23,461 INFO L290 TraceCheckUtils]: 76: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-08 03:55:23,461 INFO L290 TraceCheckUtils]: 77: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-08 03:55:23,461 INFO L290 TraceCheckUtils]: 78: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-08 03:55:23,461 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {48744#true} {49016#(and (< 1 main_~r~0) (<= main_~r~0 main_~n~0))} #116#return; {49016#(and (< 1 main_~r~0) (<= main_~r~0 main_~n~0))} is VALID [2022-04-08 03:55:23,461 INFO L290 TraceCheckUtils]: 80: Hoare triple {49016#(and (< 1 main_~r~0) (<= main_~r~0 main_~n~0))} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {49016#(and (< 1 main_~r~0) (<= main_~r~0 main_~n~0))} is VALID [2022-04-08 03:55:23,462 INFO L290 TraceCheckUtils]: 81: Hoare triple {49016#(and (< 1 main_~r~0) (<= main_~r~0 main_~n~0))} assume 0 != #t~nondet4;havoc #t~nondet4;~j~0 := 1 + ~j~0; {49016#(and (< 1 main_~r~0) (<= main_~r~0 main_~n~0))} is VALID [2022-04-08 03:55:23,462 INFO L272 TraceCheckUtils]: 82: Hoare triple {49016#(and (< 1 main_~r~0) (<= main_~r~0 main_~n~0))} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {48744#true} is VALID [2022-04-08 03:55:23,462 INFO L290 TraceCheckUtils]: 83: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-08 03:55:23,462 INFO L290 TraceCheckUtils]: 84: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-08 03:55:23,462 INFO L290 TraceCheckUtils]: 85: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-08 03:55:23,462 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {48744#true} {49016#(and (< 1 main_~r~0) (<= main_~r~0 main_~n~0))} #118#return; {49016#(and (< 1 main_~r~0) (<= main_~r~0 main_~n~0))} is VALID [2022-04-08 03:55:23,462 INFO L272 TraceCheckUtils]: 87: Hoare triple {49016#(and (< 1 main_~r~0) (<= main_~r~0 main_~n~0))} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {48744#true} is VALID [2022-04-08 03:55:23,463 INFO L290 TraceCheckUtils]: 88: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-08 03:55:23,463 INFO L290 TraceCheckUtils]: 89: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-08 03:55:23,463 INFO L290 TraceCheckUtils]: 90: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-08 03:55:23,463 INFO L284 TraceCheckUtils]: 91: Hoare quadruple {48744#true} {49016#(and (< 1 main_~r~0) (<= main_~r~0 main_~n~0))} #120#return; {49016#(and (< 1 main_~r~0) (<= main_~r~0 main_~n~0))} is VALID [2022-04-08 03:55:23,463 INFO L290 TraceCheckUtils]: 92: Hoare triple {49016#(and (< 1 main_~r~0) (<= main_~r~0 main_~n~0))} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {49016#(and (< 1 main_~r~0) (<= main_~r~0 main_~n~0))} is VALID [2022-04-08 03:55:23,464 INFO L290 TraceCheckUtils]: 93: Hoare triple {49016#(and (< 1 main_~r~0) (<= main_~r~0 main_~n~0))} assume !(0 != #t~nondet5);havoc #t~nondet5; {49016#(and (< 1 main_~r~0) (<= main_~r~0 main_~n~0))} is VALID [2022-04-08 03:55:23,464 INFO L272 TraceCheckUtils]: 94: Hoare triple {49016#(and (< 1 main_~r~0) (<= main_~r~0 main_~n~0))} call __VERIFIER_assert((if 1 <= ~i~0 then 1 else 0)); {48744#true} is VALID [2022-04-08 03:55:23,464 INFO L290 TraceCheckUtils]: 95: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-08 03:55:23,464 INFO L290 TraceCheckUtils]: 96: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-08 03:55:23,464 INFO L290 TraceCheckUtils]: 97: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-08 03:55:23,464 INFO L284 TraceCheckUtils]: 98: Hoare quadruple {48744#true} {49016#(and (< 1 main_~r~0) (<= main_~r~0 main_~n~0))} #122#return; {49016#(and (< 1 main_~r~0) (<= main_~r~0 main_~n~0))} is VALID [2022-04-08 03:55:23,464 INFO L272 TraceCheckUtils]: 99: Hoare triple {49016#(and (< 1 main_~r~0) (<= main_~r~0 main_~n~0))} call __VERIFIER_assert((if ~i~0 <= ~n~0 then 1 else 0)); {48744#true} is VALID [2022-04-08 03:55:23,465 INFO L290 TraceCheckUtils]: 100: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-08 03:55:23,465 INFO L290 TraceCheckUtils]: 101: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-08 03:55:23,465 INFO L290 TraceCheckUtils]: 102: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-08 03:55:23,465 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {48744#true} {49016#(and (< 1 main_~r~0) (<= main_~r~0 main_~n~0))} #124#return; {49016#(and (< 1 main_~r~0) (<= main_~r~0 main_~n~0))} is VALID [2022-04-08 03:55:23,465 INFO L272 TraceCheckUtils]: 104: Hoare triple {49016#(and (< 1 main_~r~0) (<= main_~r~0 main_~n~0))} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {48744#true} is VALID [2022-04-08 03:55:23,465 INFO L290 TraceCheckUtils]: 105: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-08 03:55:23,465 INFO L290 TraceCheckUtils]: 106: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-08 03:55:23,465 INFO L290 TraceCheckUtils]: 107: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-08 03:55:23,466 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {48744#true} {49016#(and (< 1 main_~r~0) (<= main_~r~0 main_~n~0))} #126#return; {49016#(and (< 1 main_~r~0) (<= main_~r~0 main_~n~0))} is VALID [2022-04-08 03:55:23,466 INFO L272 TraceCheckUtils]: 109: Hoare triple {49016#(and (< 1 main_~r~0) (<= main_~r~0 main_~n~0))} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {48744#true} is VALID [2022-04-08 03:55:23,466 INFO L290 TraceCheckUtils]: 110: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-08 03:55:23,466 INFO L290 TraceCheckUtils]: 111: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-08 03:55:23,466 INFO L290 TraceCheckUtils]: 112: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-08 03:55:23,466 INFO L284 TraceCheckUtils]: 113: Hoare quadruple {48744#true} {49016#(and (< 1 main_~r~0) (<= main_~r~0 main_~n~0))} #128#return; {49016#(and (< 1 main_~r~0) (<= main_~r~0 main_~n~0))} is VALID [2022-04-08 03:55:23,467 INFO L290 TraceCheckUtils]: 114: Hoare triple {49016#(and (< 1 main_~r~0) (<= main_~r~0 main_~n~0))} ~i~0 := ~j~0;~j~0 := 2 * ~j~0; {49188#(and (< 1 main_~r~0) (<= main_~r~0 main_~n~0) (<= main_~i~0 (div main_~j~0 2)))} is VALID [2022-04-08 03:55:23,468 INFO L290 TraceCheckUtils]: 115: Hoare triple {49188#(and (< 1 main_~r~0) (<= main_~r~0 main_~n~0) (<= main_~i~0 (div main_~j~0 2)))} assume !!(~j~0 <= ~r~0); {49192#(and (<= main_~i~0 (div main_~n~0 2)) (< 1 main_~n~0))} is VALID [2022-04-08 03:55:23,468 INFO L290 TraceCheckUtils]: 116: Hoare triple {49192#(and (<= main_~i~0 (div main_~n~0 2)) (< 1 main_~n~0))} assume !(~j~0 < ~r~0); {49192#(and (<= main_~i~0 (div main_~n~0 2)) (< 1 main_~n~0))} is VALID [2022-04-08 03:55:23,468 INFO L272 TraceCheckUtils]: 117: Hoare triple {49192#(and (<= main_~i~0 (div main_~n~0 2)) (< 1 main_~n~0))} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {48744#true} is VALID [2022-04-08 03:55:23,468 INFO L290 TraceCheckUtils]: 118: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-08 03:55:23,468 INFO L290 TraceCheckUtils]: 119: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-08 03:55:23,468 INFO L290 TraceCheckUtils]: 120: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-08 03:55:23,469 INFO L284 TraceCheckUtils]: 121: Hoare quadruple {48744#true} {49192#(and (<= main_~i~0 (div main_~n~0 2)) (< 1 main_~n~0))} #118#return; {49192#(and (<= main_~i~0 (div main_~n~0 2)) (< 1 main_~n~0))} is VALID [2022-04-08 03:55:23,469 INFO L272 TraceCheckUtils]: 122: Hoare triple {49192#(and (<= main_~i~0 (div main_~n~0 2)) (< 1 main_~n~0))} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {48744#true} is VALID [2022-04-08 03:55:23,469 INFO L290 TraceCheckUtils]: 123: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-08 03:55:23,469 INFO L290 TraceCheckUtils]: 124: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-08 03:55:23,469 INFO L290 TraceCheckUtils]: 125: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-08 03:55:23,469 INFO L284 TraceCheckUtils]: 126: Hoare quadruple {48744#true} {49192#(and (<= main_~i~0 (div main_~n~0 2)) (< 1 main_~n~0))} #120#return; {49192#(and (<= main_~i~0 (div main_~n~0 2)) (< 1 main_~n~0))} is VALID [2022-04-08 03:55:23,470 INFO L290 TraceCheckUtils]: 127: Hoare triple {49192#(and (<= main_~i~0 (div main_~n~0 2)) (< 1 main_~n~0))} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {49192#(and (<= main_~i~0 (div main_~n~0 2)) (< 1 main_~n~0))} is VALID [2022-04-08 03:55:23,470 INFO L290 TraceCheckUtils]: 128: Hoare triple {49192#(and (<= main_~i~0 (div main_~n~0 2)) (< 1 main_~n~0))} assume !(0 != #t~nondet5);havoc #t~nondet5; {49192#(and (<= main_~i~0 (div main_~n~0 2)) (< 1 main_~n~0))} is VALID [2022-04-08 03:55:23,470 INFO L272 TraceCheckUtils]: 129: Hoare triple {49192#(and (<= main_~i~0 (div main_~n~0 2)) (< 1 main_~n~0))} call __VERIFIER_assert((if 1 <= ~i~0 then 1 else 0)); {48744#true} is VALID [2022-04-08 03:55:23,470 INFO L290 TraceCheckUtils]: 130: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-08 03:55:23,470 INFO L290 TraceCheckUtils]: 131: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-08 03:55:23,470 INFO L290 TraceCheckUtils]: 132: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-08 03:55:23,495 INFO L284 TraceCheckUtils]: 133: Hoare quadruple {48744#true} {49192#(and (<= main_~i~0 (div main_~n~0 2)) (< 1 main_~n~0))} #122#return; {49192#(and (<= main_~i~0 (div main_~n~0 2)) (< 1 main_~n~0))} is VALID [2022-04-08 03:55:23,496 INFO L272 TraceCheckUtils]: 134: Hoare triple {49192#(and (<= main_~i~0 (div main_~n~0 2)) (< 1 main_~n~0))} call __VERIFIER_assert((if ~i~0 <= ~n~0 then 1 else 0)); {49250#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 03:55:23,497 INFO L290 TraceCheckUtils]: 135: Hoare triple {49250#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {49254#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 03:55:23,497 INFO L290 TraceCheckUtils]: 136: Hoare triple {49254#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {48745#false} is VALID [2022-04-08 03:55:23,497 INFO L290 TraceCheckUtils]: 137: Hoare triple {48745#false} assume !false; {48745#false} is VALID [2022-04-08 03:55:23,497 INFO L134 CoverageAnalysis]: Checked inductivity of 909 backedges. 56 proven. 12 refuted. 0 times theorem prover too weak. 841 trivial. 0 not checked. [2022-04-08 03:55:23,498 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 03:55:23,917 INFO L290 TraceCheckUtils]: 137: Hoare triple {48745#false} assume !false; {48745#false} is VALID [2022-04-08 03:55:23,917 INFO L290 TraceCheckUtils]: 136: Hoare triple {49254#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {48745#false} is VALID [2022-04-08 03:55:23,918 INFO L290 TraceCheckUtils]: 135: Hoare triple {49250#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {49254#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 03:55:23,918 INFO L272 TraceCheckUtils]: 134: Hoare triple {49270#(<= main_~i~0 main_~n~0)} call __VERIFIER_assert((if ~i~0 <= ~n~0 then 1 else 0)); {49250#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 03:55:23,918 INFO L284 TraceCheckUtils]: 133: Hoare quadruple {48744#true} {49270#(<= main_~i~0 main_~n~0)} #122#return; {49270#(<= main_~i~0 main_~n~0)} is VALID [2022-04-08 03:55:23,918 INFO L290 TraceCheckUtils]: 132: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-08 03:55:23,919 INFO L290 TraceCheckUtils]: 131: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-08 03:55:23,919 INFO L290 TraceCheckUtils]: 130: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-08 03:55:23,919 INFO L272 TraceCheckUtils]: 129: Hoare triple {49270#(<= main_~i~0 main_~n~0)} call __VERIFIER_assert((if 1 <= ~i~0 then 1 else 0)); {48744#true} is VALID [2022-04-08 03:55:23,919 INFO L290 TraceCheckUtils]: 128: Hoare triple {49270#(<= main_~i~0 main_~n~0)} assume !(0 != #t~nondet5);havoc #t~nondet5; {49270#(<= main_~i~0 main_~n~0)} is VALID [2022-04-08 03:55:23,919 INFO L290 TraceCheckUtils]: 127: Hoare triple {49270#(<= main_~i~0 main_~n~0)} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {49270#(<= main_~i~0 main_~n~0)} is VALID [2022-04-08 03:55:23,919 INFO L284 TraceCheckUtils]: 126: Hoare quadruple {48744#true} {49270#(<= main_~i~0 main_~n~0)} #120#return; {49270#(<= main_~i~0 main_~n~0)} is VALID [2022-04-08 03:55:23,920 INFO L290 TraceCheckUtils]: 125: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-08 03:55:23,920 INFO L290 TraceCheckUtils]: 124: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-08 03:55:23,920 INFO L290 TraceCheckUtils]: 123: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-08 03:55:23,920 INFO L272 TraceCheckUtils]: 122: Hoare triple {49270#(<= main_~i~0 main_~n~0)} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {48744#true} is VALID [2022-04-08 03:55:23,920 INFO L284 TraceCheckUtils]: 121: Hoare quadruple {48744#true} {49270#(<= main_~i~0 main_~n~0)} #118#return; {49270#(<= main_~i~0 main_~n~0)} is VALID [2022-04-08 03:55:23,920 INFO L290 TraceCheckUtils]: 120: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-08 03:55:23,920 INFO L290 TraceCheckUtils]: 119: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-08 03:55:23,920 INFO L290 TraceCheckUtils]: 118: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-08 03:55:23,921 INFO L272 TraceCheckUtils]: 117: Hoare triple {49270#(<= main_~i~0 main_~n~0)} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {48744#true} is VALID [2022-04-08 03:55:23,921 INFO L290 TraceCheckUtils]: 116: Hoare triple {49270#(<= main_~i~0 main_~n~0)} assume !(~j~0 < ~r~0); {49270#(<= main_~i~0 main_~n~0)} is VALID [2022-04-08 03:55:23,921 INFO L290 TraceCheckUtils]: 115: Hoare triple {49328#(or (<= main_~i~0 main_~n~0) (not (<= main_~j~0 main_~r~0)))} assume !!(~j~0 <= ~r~0); {49270#(<= main_~i~0 main_~n~0)} is VALID [2022-04-08 03:55:23,922 INFO L290 TraceCheckUtils]: 114: Hoare triple {49332#(<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1))} ~i~0 := ~j~0;~j~0 := 2 * ~j~0; {49328#(or (<= main_~i~0 main_~n~0) (not (<= main_~j~0 main_~r~0)))} is VALID [2022-04-08 03:55:23,922 INFO L284 TraceCheckUtils]: 113: Hoare quadruple {48744#true} {49332#(<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1))} #128#return; {49332#(<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1))} is VALID [2022-04-08 03:55:23,922 INFO L290 TraceCheckUtils]: 112: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-08 03:55:23,922 INFO L290 TraceCheckUtils]: 111: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-08 03:55:23,922 INFO L290 TraceCheckUtils]: 110: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-08 03:55:23,922 INFO L272 TraceCheckUtils]: 109: Hoare triple {49332#(<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1))} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {48744#true} is VALID [2022-04-08 03:55:23,923 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {48744#true} {49332#(<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1))} #126#return; {49332#(<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1))} is VALID [2022-04-08 03:55:23,923 INFO L290 TraceCheckUtils]: 107: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-08 03:55:23,923 INFO L290 TraceCheckUtils]: 106: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-08 03:55:23,923 INFO L290 TraceCheckUtils]: 105: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-08 03:55:23,923 INFO L272 TraceCheckUtils]: 104: Hoare triple {49332#(<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1))} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {48744#true} is VALID [2022-04-08 03:55:23,923 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {48744#true} {49332#(<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1))} #124#return; {49332#(<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1))} is VALID [2022-04-08 03:55:23,923 INFO L290 TraceCheckUtils]: 102: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-08 03:55:23,923 INFO L290 TraceCheckUtils]: 101: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-08 03:55:23,924 INFO L290 TraceCheckUtils]: 100: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-08 03:55:23,924 INFO L272 TraceCheckUtils]: 99: Hoare triple {49332#(<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1))} call __VERIFIER_assert((if ~i~0 <= ~n~0 then 1 else 0)); {48744#true} is VALID [2022-04-08 03:55:23,924 INFO L284 TraceCheckUtils]: 98: Hoare quadruple {48744#true} {49332#(<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1))} #122#return; {49332#(<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1))} is VALID [2022-04-08 03:55:23,924 INFO L290 TraceCheckUtils]: 97: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-08 03:55:23,924 INFO L290 TraceCheckUtils]: 96: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-08 03:55:23,924 INFO L290 TraceCheckUtils]: 95: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-08 03:55:23,924 INFO L272 TraceCheckUtils]: 94: Hoare triple {49332#(<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1))} call __VERIFIER_assert((if 1 <= ~i~0 then 1 else 0)); {48744#true} is VALID [2022-04-08 03:55:23,925 INFO L290 TraceCheckUtils]: 93: Hoare triple {49332#(<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1))} assume !(0 != #t~nondet5);havoc #t~nondet5; {49332#(<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1))} is VALID [2022-04-08 03:55:23,925 INFO L290 TraceCheckUtils]: 92: Hoare triple {49332#(<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1))} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {49332#(<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1))} is VALID [2022-04-08 03:55:23,925 INFO L284 TraceCheckUtils]: 91: Hoare quadruple {48744#true} {49332#(<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1))} #120#return; {49332#(<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1))} is VALID [2022-04-08 03:55:23,925 INFO L290 TraceCheckUtils]: 90: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-08 03:55:23,925 INFO L290 TraceCheckUtils]: 89: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-08 03:55:23,925 INFO L290 TraceCheckUtils]: 88: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-08 03:55:23,926 INFO L272 TraceCheckUtils]: 87: Hoare triple {49332#(<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1))} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {48744#true} is VALID [2022-04-08 03:55:23,926 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {48744#true} {49332#(<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1))} #118#return; {49332#(<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1))} is VALID [2022-04-08 03:55:23,926 INFO L290 TraceCheckUtils]: 85: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-08 03:55:23,926 INFO L290 TraceCheckUtils]: 84: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-08 03:55:23,926 INFO L290 TraceCheckUtils]: 83: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-08 03:55:23,926 INFO L272 TraceCheckUtils]: 82: Hoare triple {49332#(<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1))} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {48744#true} is VALID [2022-04-08 03:55:23,927 INFO L290 TraceCheckUtils]: 81: Hoare triple {49332#(<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1))} assume 0 != #t~nondet4;havoc #t~nondet4;~j~0 := 1 + ~j~0; {49332#(<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1))} is VALID [2022-04-08 03:55:23,927 INFO L290 TraceCheckUtils]: 80: Hoare triple {49332#(<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1))} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {49332#(<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1))} is VALID [2022-04-08 03:55:23,927 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {48744#true} {49332#(<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1))} #116#return; {49332#(<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1))} is VALID [2022-04-08 03:55:23,927 INFO L290 TraceCheckUtils]: 78: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-08 03:55:23,927 INFO L290 TraceCheckUtils]: 77: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-08 03:55:23,927 INFO L290 TraceCheckUtils]: 76: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-08 03:55:23,927 INFO L272 TraceCheckUtils]: 75: Hoare triple {49332#(<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1))} call __VERIFIER_assert((if 1 + ~j~0 <= ~n~0 then 1 else 0)); {48744#true} is VALID [2022-04-08 03:55:23,928 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {48744#true} {49332#(<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1))} #114#return; {49332#(<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1))} is VALID [2022-04-08 03:55:23,928 INFO L290 TraceCheckUtils]: 73: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-08 03:55:23,928 INFO L290 TraceCheckUtils]: 72: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-08 03:55:23,928 INFO L290 TraceCheckUtils]: 71: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-08 03:55:23,928 INFO L272 TraceCheckUtils]: 70: Hoare triple {49332#(<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1))} call __VERIFIER_assert((if 1 <= 1 + ~j~0 then 1 else 0)); {48744#true} is VALID [2022-04-08 03:55:23,928 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {48744#true} {49332#(<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1))} #112#return; {49332#(<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1))} is VALID [2022-04-08 03:55:23,929 INFO L290 TraceCheckUtils]: 68: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-08 03:55:23,929 INFO L290 TraceCheckUtils]: 67: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-08 03:55:23,929 INFO L290 TraceCheckUtils]: 66: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-08 03:55:23,929 INFO L272 TraceCheckUtils]: 65: Hoare triple {49332#(<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1))} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {48744#true} is VALID [2022-04-08 03:55:23,955 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {48744#true} {49332#(<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1))} #110#return; {49332#(<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1))} is VALID [2022-04-08 03:55:23,955 INFO L290 TraceCheckUtils]: 63: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-08 03:55:23,956 INFO L290 TraceCheckUtils]: 62: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-08 03:55:23,956 INFO L290 TraceCheckUtils]: 61: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-08 03:55:23,956 INFO L272 TraceCheckUtils]: 60: Hoare triple {49332#(<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1))} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {48744#true} is VALID [2022-04-08 03:55:23,956 INFO L290 TraceCheckUtils]: 59: Hoare triple {49332#(<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1))} assume ~j~0 < ~r~0; {49332#(<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1))} is VALID [2022-04-08 03:55:23,956 INFO L290 TraceCheckUtils]: 58: Hoare triple {49332#(<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1))} assume !!(~j~0 <= ~r~0); {49332#(<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1))} is VALID [2022-04-08 03:55:23,957 INFO L290 TraceCheckUtils]: 57: Hoare triple {49504#(or (not (< 1 main_~r~0)) (<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1)))} assume !!(~r~0 > 1);~i~0 := ~l~0;~j~0 := 2 * ~l~0; {49332#(<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1))} is VALID [2022-04-08 03:55:23,957 INFO L290 TraceCheckUtils]: 56: Hoare triple {49504#(or (not (< 1 main_~r~0)) (<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1)))} #t~post6 := ~l~0;~l~0 := #t~post6 - 1;havoc #t~post6; {49504#(or (not (< 1 main_~r~0)) (<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1)))} is VALID [2022-04-08 03:55:23,957 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {48744#true} {49504#(or (not (< 1 main_~r~0)) (<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1)))} #132#return; {49504#(or (not (< 1 main_~r~0)) (<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1)))} is VALID [2022-04-08 03:55:23,957 INFO L290 TraceCheckUtils]: 54: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-08 03:55:23,957 INFO L290 TraceCheckUtils]: 53: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-08 03:55:23,958 INFO L290 TraceCheckUtils]: 52: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-08 03:55:23,958 INFO L272 TraceCheckUtils]: 51: Hoare triple {49504#(or (not (< 1 main_~r~0)) (<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1)))} call __VERIFIER_assert((if ~l~0 <= ~n~0 then 1 else 0)); {48744#true} is VALID [2022-04-08 03:55:23,958 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {48744#true} {49504#(or (not (< 1 main_~r~0)) (<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1)))} #130#return; {49504#(or (not (< 1 main_~r~0)) (<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1)))} is VALID [2022-04-08 03:55:23,958 INFO L290 TraceCheckUtils]: 49: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-08 03:55:23,958 INFO L290 TraceCheckUtils]: 48: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-08 03:55:23,958 INFO L290 TraceCheckUtils]: 47: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-08 03:55:23,958 INFO L272 TraceCheckUtils]: 46: Hoare triple {49504#(or (not (< 1 main_~r~0)) (<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1)))} call __VERIFIER_assert((if 1 <= ~l~0 then 1 else 0)); {48744#true} is VALID [2022-04-08 03:55:23,959 INFO L290 TraceCheckUtils]: 45: Hoare triple {49504#(or (not (< 1 main_~r~0)) (<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1)))} assume ~l~0 > 1; {49504#(or (not (< 1 main_~r~0)) (<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1)))} is VALID [2022-04-08 03:55:23,959 INFO L290 TraceCheckUtils]: 44: Hoare triple {49504#(or (not (< 1 main_~r~0)) (<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1)))} assume 0 != #t~nondet5;havoc #t~nondet5; {49504#(or (not (< 1 main_~r~0)) (<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1)))} is VALID [2022-04-08 03:55:23,959 INFO L290 TraceCheckUtils]: 43: Hoare triple {49504#(or (not (< 1 main_~r~0)) (<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1)))} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {49504#(or (not (< 1 main_~r~0)) (<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1)))} is VALID [2022-04-08 03:55:23,960 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {48744#true} {49504#(or (not (< 1 main_~r~0)) (<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1)))} #120#return; {49504#(or (not (< 1 main_~r~0)) (<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1)))} is VALID [2022-04-08 03:55:23,960 INFO L290 TraceCheckUtils]: 41: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-08 03:55:23,960 INFO L290 TraceCheckUtils]: 40: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-08 03:55:23,960 INFO L290 TraceCheckUtils]: 39: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-08 03:55:23,960 INFO L272 TraceCheckUtils]: 38: Hoare triple {49504#(or (not (< 1 main_~r~0)) (<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1)))} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {48744#true} is VALID [2022-04-08 03:55:23,960 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {48744#true} {49504#(or (not (< 1 main_~r~0)) (<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1)))} #118#return; {49504#(or (not (< 1 main_~r~0)) (<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1)))} is VALID [2022-04-08 03:55:23,960 INFO L290 TraceCheckUtils]: 36: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-08 03:55:23,961 INFO L290 TraceCheckUtils]: 35: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-08 03:55:23,961 INFO L290 TraceCheckUtils]: 34: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-08 03:55:23,961 INFO L272 TraceCheckUtils]: 33: Hoare triple {49504#(or (not (< 1 main_~r~0)) (<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1)))} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {48744#true} is VALID [2022-04-08 03:55:23,961 INFO L290 TraceCheckUtils]: 32: Hoare triple {49504#(or (not (< 1 main_~r~0)) (<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1)))} assume 0 != #t~nondet4;havoc #t~nondet4;~j~0 := 1 + ~j~0; {49504#(or (not (< 1 main_~r~0)) (<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1)))} is VALID [2022-04-08 03:55:23,961 INFO L290 TraceCheckUtils]: 31: Hoare triple {49504#(or (not (< 1 main_~r~0)) (<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1)))} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {49504#(or (not (< 1 main_~r~0)) (<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1)))} is VALID [2022-04-08 03:55:23,962 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {48744#true} {49504#(or (not (< 1 main_~r~0)) (<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1)))} #116#return; {49504#(or (not (< 1 main_~r~0)) (<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1)))} is VALID [2022-04-08 03:55:23,962 INFO L290 TraceCheckUtils]: 29: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-08 03:55:23,962 INFO L290 TraceCheckUtils]: 28: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-08 03:55:23,962 INFO L290 TraceCheckUtils]: 27: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-08 03:55:23,962 INFO L272 TraceCheckUtils]: 26: Hoare triple {49504#(or (not (< 1 main_~r~0)) (<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1)))} call __VERIFIER_assert((if 1 + ~j~0 <= ~n~0 then 1 else 0)); {48744#true} is VALID [2022-04-08 03:55:23,962 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {48744#true} {49504#(or (not (< 1 main_~r~0)) (<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1)))} #114#return; {49504#(or (not (< 1 main_~r~0)) (<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1)))} is VALID [2022-04-08 03:55:23,962 INFO L290 TraceCheckUtils]: 24: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-08 03:55:23,963 INFO L290 TraceCheckUtils]: 23: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-08 03:55:23,963 INFO L290 TraceCheckUtils]: 22: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-08 03:55:23,963 INFO L272 TraceCheckUtils]: 21: Hoare triple {49504#(or (not (< 1 main_~r~0)) (<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1)))} call __VERIFIER_assert((if 1 <= 1 + ~j~0 then 1 else 0)); {48744#true} is VALID [2022-04-08 03:55:23,963 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {48744#true} {49504#(or (not (< 1 main_~r~0)) (<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1)))} #112#return; {49504#(or (not (< 1 main_~r~0)) (<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1)))} is VALID [2022-04-08 03:55:23,963 INFO L290 TraceCheckUtils]: 19: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-08 03:55:23,963 INFO L290 TraceCheckUtils]: 18: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-08 03:55:23,963 INFO L290 TraceCheckUtils]: 17: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-08 03:55:23,964 INFO L272 TraceCheckUtils]: 16: Hoare triple {49504#(or (not (< 1 main_~r~0)) (<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1)))} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {48744#true} is VALID [2022-04-08 03:55:23,964 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {48744#true} {49504#(or (not (< 1 main_~r~0)) (<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1)))} #110#return; {49504#(or (not (< 1 main_~r~0)) (<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1)))} is VALID [2022-04-08 03:55:23,964 INFO L290 TraceCheckUtils]: 14: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-08 03:55:23,964 INFO L290 TraceCheckUtils]: 13: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-08 03:55:23,964 INFO L290 TraceCheckUtils]: 12: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-08 03:55:23,964 INFO L272 TraceCheckUtils]: 11: Hoare triple {49504#(or (not (< 1 main_~r~0)) (<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1)))} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {48744#true} is VALID [2022-04-08 03:55:23,965 INFO L290 TraceCheckUtils]: 10: Hoare triple {49504#(or (not (< 1 main_~r~0)) (<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1)))} assume ~j~0 < ~r~0; {49504#(or (not (< 1 main_~r~0)) (<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1)))} is VALID [2022-04-08 03:55:23,965 INFO L290 TraceCheckUtils]: 9: Hoare triple {49504#(or (not (< 1 main_~r~0)) (<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1)))} assume !!(~j~0 <= ~r~0); {49504#(or (not (< 1 main_~r~0)) (<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1)))} is VALID [2022-04-08 03:55:23,965 INFO L290 TraceCheckUtils]: 8: Hoare triple {49504#(or (not (< 1 main_~r~0)) (<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1)))} assume !!(~r~0 > 1);~i~0 := ~l~0;~j~0 := 2 * ~l~0; {49504#(or (not (< 1 main_~r~0)) (<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1)))} is VALID [2022-04-08 03:55:23,965 INFO L290 TraceCheckUtils]: 7: Hoare triple {49504#(or (not (< 1 main_~r~0)) (<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1)))} assume ~l~0 > 1;#t~post2 := ~l~0;~l~0 := #t~post2 - 1;havoc #t~post2; {49504#(or (not (< 1 main_~r~0)) (<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1)))} is VALID [2022-04-08 03:55:23,966 INFO L290 TraceCheckUtils]: 6: Hoare triple {48744#true} assume !!(1 <= ~n~0 && ~n~0 <= 1000000);~l~0 := 1 + (if ~n~0 < 0 && 0 != ~n~0 % 2 then 1 + ~n~0 / 2 else ~n~0 / 2);~r~0 := ~n~0; {49504#(or (not (< 1 main_~r~0)) (<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1)))} is VALID [2022-04-08 03:55:23,966 INFO L290 TraceCheckUtils]: 5: Hoare triple {48744#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;havoc ~n~0;havoc ~l~0;havoc ~r~0;havoc ~i~0;havoc ~j~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {48744#true} is VALID [2022-04-08 03:55:23,966 INFO L272 TraceCheckUtils]: 4: Hoare triple {48744#true} call #t~ret8 := main(#in~argc, #in~argv.base, #in~argv.offset); {48744#true} is VALID [2022-04-08 03:55:23,966 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {48744#true} {48744#true} #138#return; {48744#true} is VALID [2022-04-08 03:55:23,966 INFO L290 TraceCheckUtils]: 2: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-08 03:55:23,967 INFO L290 TraceCheckUtils]: 1: Hoare triple {48744#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(9, 2); {48744#true} is VALID [2022-04-08 03:55:23,967 INFO L272 TraceCheckUtils]: 0: Hoare triple {48744#true} call ULTIMATE.init(); {48744#true} is VALID [2022-04-08 03:55:23,967 INFO L134 CoverageAnalysis]: Checked inductivity of 909 backedges. 54 proven. 14 refuted. 0 times theorem prover too weak. 841 trivial. 0 not checked. [2022-04-08 03:55:23,967 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [315195758] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 03:55:23,967 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 03:55:23,968 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 8] total 20 [2022-04-08 03:55:23,968 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 03:55:23,968 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [923685281] [2022-04-08 03:55:23,968 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [923685281] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 03:55:23,968 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 03:55:23,968 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-08 03:55:23,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1098388102] [2022-04-08 03:55:23,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 03:55:23,971 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 9 states have internal predecessors, (32), 4 states have call successors, (24), 3 states have call predecessors, (24), 1 states have return successors, (22), 4 states have call predecessors, (22), 4 states have call successors, (22) Word has length 138 [2022-04-08 03:55:23,971 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 03:55:23,971 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 9 states have internal predecessors, (32), 4 states have call successors, (24), 3 states have call predecessors, (24), 1 states have return successors, (22), 4 states have call predecessors, (22), 4 states have call successors, (22) [2022-04-08 03:55:24,027 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:55:24,027 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-08 03:55:24,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 03:55:24,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-08 03:55:24,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=323, Unknown=0, NotChecked=0, Total=380 [2022-04-08 03:55:24,028 INFO L87 Difference]: Start difference. First operand 501 states and 798 transitions. Second operand has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 9 states have internal predecessors, (32), 4 states have call successors, (24), 3 states have call predecessors, (24), 1 states have return successors, (22), 4 states have call predecessors, (22), 4 states have call successors, (22) [2022-04-08 03:55:30,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:55:30,773 INFO L93 Difference]: Finished difference Result 770 states and 1246 transitions. [2022-04-08 03:55:30,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-04-08 03:55:30,773 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 9 states have internal predecessors, (32), 4 states have call successors, (24), 3 states have call predecessors, (24), 1 states have return successors, (22), 4 states have call predecessors, (22), 4 states have call successors, (22) Word has length 138 [2022-04-08 03:55:30,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 03:55:30,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 9 states have internal predecessors, (32), 4 states have call successors, (24), 3 states have call predecessors, (24), 1 states have return successors, (22), 4 states have call predecessors, (22), 4 states have call successors, (22) [2022-04-08 03:55:30,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 240 transitions. [2022-04-08 03:55:30,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 9 states have internal predecessors, (32), 4 states have call successors, (24), 3 states have call predecessors, (24), 1 states have return successors, (22), 4 states have call predecessors, (22), 4 states have call successors, (22) [2022-04-08 03:55:30,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 240 transitions. [2022-04-08 03:55:30,780 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 240 transitions. [2022-04-08 03:55:30,939 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 240 edges. 240 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:55:30,946 INFO L225 Difference]: With dead ends: 770 [2022-04-08 03:55:30,946 INFO L226 Difference]: Without dead ends: 309 [2022-04-08 03:55:30,948 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 343 GetRequests, 311 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=194, Invalid=862, Unknown=0, NotChecked=0, Total=1056 [2022-04-08 03:55:30,949 INFO L913 BasicCegarLoop]: 63 mSDtfsCounter, 132 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 980 mSolverCounterSat, 350 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 1330 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 350 IncrementalHoareTripleChecker+Valid, 980 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-04-08 03:55:30,949 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [132 Valid, 105 Invalid, 1330 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [350 Valid, 980 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-04-08 03:55:30,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2022-04-08 03:55:32,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 213. [2022-04-08 03:55:32,076 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 03:55:32,076 INFO L82 GeneralOperation]: Start isEquivalent. First operand 309 states. Second operand has 213 states, 118 states have (on average 1.1610169491525424) internal successors, (137), 124 states have internal predecessors, (137), 72 states have call successors, (72), 23 states have call predecessors, (72), 22 states have return successors, (71), 65 states have call predecessors, (71), 71 states have call successors, (71) [2022-04-08 03:55:32,076 INFO L74 IsIncluded]: Start isIncluded. First operand 309 states. Second operand has 213 states, 118 states have (on average 1.1610169491525424) internal successors, (137), 124 states have internal predecessors, (137), 72 states have call successors, (72), 23 states have call predecessors, (72), 22 states have return successors, (71), 65 states have call predecessors, (71), 71 states have call successors, (71) [2022-04-08 03:55:32,076 INFO L87 Difference]: Start difference. First operand 309 states. Second operand has 213 states, 118 states have (on average 1.1610169491525424) internal successors, (137), 124 states have internal predecessors, (137), 72 states have call successors, (72), 23 states have call predecessors, (72), 22 states have return successors, (71), 65 states have call predecessors, (71), 71 states have call successors, (71) [2022-04-08 03:55:32,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:55:32,082 INFO L93 Difference]: Finished difference Result 309 states and 449 transitions. [2022-04-08 03:55:32,082 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 449 transitions. [2022-04-08 03:55:32,083 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:55:32,083 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:55:32,084 INFO L74 IsIncluded]: Start isIncluded. First operand has 213 states, 118 states have (on average 1.1610169491525424) internal successors, (137), 124 states have internal predecessors, (137), 72 states have call successors, (72), 23 states have call predecessors, (72), 22 states have return successors, (71), 65 states have call predecessors, (71), 71 states have call successors, (71) Second operand 309 states. [2022-04-08 03:55:32,084 INFO L87 Difference]: Start difference. First operand has 213 states, 118 states have (on average 1.1610169491525424) internal successors, (137), 124 states have internal predecessors, (137), 72 states have call successors, (72), 23 states have call predecessors, (72), 22 states have return successors, (71), 65 states have call predecessors, (71), 71 states have call successors, (71) Second operand 309 states. [2022-04-08 03:55:32,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:55:32,090 INFO L93 Difference]: Finished difference Result 309 states and 449 transitions. [2022-04-08 03:55:32,090 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 449 transitions. [2022-04-08 03:55:32,091 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:55:32,091 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:55:32,091 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 03:55:32,091 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 03:55:32,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 213 states, 118 states have (on average 1.1610169491525424) internal successors, (137), 124 states have internal predecessors, (137), 72 states have call successors, (72), 23 states have call predecessors, (72), 22 states have return successors, (71), 65 states have call predecessors, (71), 71 states have call successors, (71) [2022-04-08 03:55:32,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 280 transitions. [2022-04-08 03:55:32,095 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 280 transitions. Word has length 138 [2022-04-08 03:55:32,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 03:55:32,095 INFO L478 AbstractCegarLoop]: Abstraction has 213 states and 280 transitions. [2022-04-08 03:55:32,096 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 9 states have internal predecessors, (32), 4 states have call successors, (24), 3 states have call predecessors, (24), 1 states have return successors, (22), 4 states have call predecessors, (22), 4 states have call successors, (22) [2022-04-08 03:55:32,096 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 213 states and 280 transitions. [2022-04-08 03:55:32,529 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 280 edges. 280 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:55:32,529 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 280 transitions. [2022-04-08 03:55:32,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2022-04-08 03:55:32,530 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 03:55:32,530 INFO L499 BasicCegarLoop]: trace histogram [28, 27, 27, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 03:55:32,549 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-04-08 03:55:32,749 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,SelfDestructingSolverStorable23 [2022-04-08 03:55:32,750 INFO L403 AbstractCegarLoop]: === Iteration 25 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 03:55:32,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 03:55:32,750 INFO L85 PathProgramCache]: Analyzing trace with hash -915763573, now seen corresponding path program 1 times [2022-04-08 03:55:32,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 03:55:32,750 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2140864721] [2022-04-08 03:55:32,750 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 03:55:32,751 INFO L85 PathProgramCache]: Analyzing trace with hash -915763573, now seen corresponding path program 2 times [2022-04-08 03:55:32,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 03:55:32,751 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2065673399] [2022-04-08 03:55:32,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 03:55:32,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 03:55:32,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:55:32,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 03:55:32,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:55:32,854 INFO L290 TraceCheckUtils]: 0: Hoare triple {52410#(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(9, 2); {52289#true} is VALID [2022-04-08 03:55:32,854 INFO L290 TraceCheckUtils]: 1: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-08 03:55:32,854 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {52289#true} {52289#true} #138#return; {52289#true} is VALID [2022-04-08 03:55:32,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-08 03:55:32,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:55:32,860 INFO L290 TraceCheckUtils]: 0: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-08 03:55:32,860 INFO L290 TraceCheckUtils]: 1: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-08 03:55:32,860 INFO L290 TraceCheckUtils]: 2: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-08 03:55:32,861 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {52289#true} {52295#(<= main_~r~0 (* main_~l~0 2))} #118#return; {52295#(<= main_~r~0 (* main_~l~0 2))} is VALID [2022-04-08 03:55:32,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-04-08 03:55:32,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:55:32,863 INFO L290 TraceCheckUtils]: 0: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-08 03:55:32,863 INFO L290 TraceCheckUtils]: 1: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-08 03:55:32,863 INFO L290 TraceCheckUtils]: 2: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-08 03:55:32,863 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {52289#true} {52295#(<= main_~r~0 (* main_~l~0 2))} #120#return; {52295#(<= main_~r~0 (* main_~l~0 2))} is VALID [2022-04-08 03:55:32,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-04-08 03:55:32,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:55:32,865 INFO L290 TraceCheckUtils]: 0: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-08 03:55:32,865 INFO L290 TraceCheckUtils]: 1: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-08 03:55:32,865 INFO L290 TraceCheckUtils]: 2: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-08 03:55:32,866 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {52289#true} {52304#(<= (+ main_~r~0 12) (* main_~l~0 8))} #130#return; {52304#(<= (+ main_~r~0 12) (* main_~l~0 8))} is VALID [2022-04-08 03:55:32,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-04-08 03:55:32,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:55:32,868 INFO L290 TraceCheckUtils]: 0: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-08 03:55:32,868 INFO L290 TraceCheckUtils]: 1: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-08 03:55:32,868 INFO L290 TraceCheckUtils]: 2: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-08 03:55:32,868 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {52289#true} {52304#(<= (+ main_~r~0 12) (* main_~l~0 8))} #132#return; {52304#(<= (+ main_~r~0 12) (* main_~l~0 8))} is VALID [2022-04-08 03:55:32,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-04-08 03:55:32,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:55:32,871 INFO L290 TraceCheckUtils]: 0: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-08 03:55:32,871 INFO L290 TraceCheckUtils]: 1: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-08 03:55:32,871 INFO L290 TraceCheckUtils]: 2: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-08 03:55:32,872 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {52289#true} {52314#(<= (+ main_~r~0 4) (* main_~j~0 4))} #110#return; {52314#(<= (+ main_~r~0 4) (* main_~j~0 4))} is VALID [2022-04-08 03:55:32,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-04-08 03:55:32,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:55:32,873 INFO L290 TraceCheckUtils]: 0: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-08 03:55:32,874 INFO L290 TraceCheckUtils]: 1: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-08 03:55:32,874 INFO L290 TraceCheckUtils]: 2: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-08 03:55:32,874 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {52289#true} {52314#(<= (+ main_~r~0 4) (* main_~j~0 4))} #112#return; {52314#(<= (+ main_~r~0 4) (* main_~j~0 4))} is VALID [2022-04-08 03:55:32,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-04-08 03:55:32,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:55:32,876 INFO L290 TraceCheckUtils]: 0: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-08 03:55:32,876 INFO L290 TraceCheckUtils]: 1: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-08 03:55:32,876 INFO L290 TraceCheckUtils]: 2: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-08 03:55:32,877 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {52289#true} {52314#(<= (+ main_~r~0 4) (* main_~j~0 4))} #114#return; {52314#(<= (+ main_~r~0 4) (* main_~j~0 4))} is VALID [2022-04-08 03:55:32,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-04-08 03:55:32,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:55:32,879 INFO L290 TraceCheckUtils]: 0: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-08 03:55:32,879 INFO L290 TraceCheckUtils]: 1: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-08 03:55:32,879 INFO L290 TraceCheckUtils]: 2: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-08 03:55:32,879 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {52289#true} {52314#(<= (+ main_~r~0 4) (* main_~j~0 4))} #116#return; {52314#(<= (+ main_~r~0 4) (* main_~j~0 4))} is VALID [2022-04-08 03:55:32,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-04-08 03:55:32,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:55:32,881 INFO L290 TraceCheckUtils]: 0: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-08 03:55:32,881 INFO L290 TraceCheckUtils]: 1: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-08 03:55:32,881 INFO L290 TraceCheckUtils]: 2: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-08 03:55:32,882 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {52289#true} {52314#(<= (+ main_~r~0 4) (* main_~j~0 4))} #118#return; {52314#(<= (+ main_~r~0 4) (* main_~j~0 4))} is VALID [2022-04-08 03:55:32,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-04-08 03:55:32,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:55:32,883 INFO L290 TraceCheckUtils]: 0: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-08 03:55:32,884 INFO L290 TraceCheckUtils]: 1: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-08 03:55:32,884 INFO L290 TraceCheckUtils]: 2: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-08 03:55:32,884 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {52289#true} {52314#(<= (+ main_~r~0 4) (* main_~j~0 4))} #120#return; {52314#(<= (+ main_~r~0 4) (* main_~j~0 4))} is VALID [2022-04-08 03:55:32,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-04-08 03:55:32,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:55:32,886 INFO L290 TraceCheckUtils]: 0: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-08 03:55:32,886 INFO L290 TraceCheckUtils]: 1: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-08 03:55:32,886 INFO L290 TraceCheckUtils]: 2: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-08 03:55:32,887 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {52289#true} {52314#(<= (+ main_~r~0 4) (* main_~j~0 4))} #122#return; {52314#(<= (+ main_~r~0 4) (* main_~j~0 4))} is VALID [2022-04-08 03:55:32,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-04-08 03:55:32,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:55:32,889 INFO L290 TraceCheckUtils]: 0: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-08 03:55:32,889 INFO L290 TraceCheckUtils]: 1: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-08 03:55:32,889 INFO L290 TraceCheckUtils]: 2: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-08 03:55:32,889 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {52289#true} {52314#(<= (+ main_~r~0 4) (* main_~j~0 4))} #124#return; {52314#(<= (+ main_~r~0 4) (* main_~j~0 4))} is VALID [2022-04-08 03:55:32,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-04-08 03:55:32,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:55:32,891 INFO L290 TraceCheckUtils]: 0: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-08 03:55:32,892 INFO L290 TraceCheckUtils]: 1: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-08 03:55:32,892 INFO L290 TraceCheckUtils]: 2: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-08 03:55:32,892 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {52289#true} {52314#(<= (+ main_~r~0 4) (* main_~j~0 4))} #126#return; {52314#(<= (+ main_~r~0 4) (* main_~j~0 4))} is VALID [2022-04-08 03:55:32,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-04-08 03:55:32,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:55:32,894 INFO L290 TraceCheckUtils]: 0: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-08 03:55:32,894 INFO L290 TraceCheckUtils]: 1: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-08 03:55:32,894 INFO L290 TraceCheckUtils]: 2: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-08 03:55:32,894 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {52289#true} {52314#(<= (+ main_~r~0 4) (* main_~j~0 4))} #128#return; {52314#(<= (+ main_~r~0 4) (* main_~j~0 4))} is VALID [2022-04-08 03:55:32,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-04-08 03:55:32,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:55:32,896 INFO L290 TraceCheckUtils]: 0: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-08 03:55:32,896 INFO L290 TraceCheckUtils]: 1: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-08 03:55:32,897 INFO L290 TraceCheckUtils]: 2: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-08 03:55:32,897 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {52289#true} {52355#(<= (+ main_~r~0 4) (* main_~j~0 2))} #110#return; {52355#(<= (+ main_~r~0 4) (* main_~j~0 2))} is VALID [2022-04-08 03:55:32,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-04-08 03:55:32,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:55:32,899 INFO L290 TraceCheckUtils]: 0: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-08 03:55:32,899 INFO L290 TraceCheckUtils]: 1: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-08 03:55:32,899 INFO L290 TraceCheckUtils]: 2: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-08 03:55:32,899 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {52289#true} {52355#(<= (+ main_~r~0 4) (* main_~j~0 2))} #112#return; {52355#(<= (+ main_~r~0 4) (* main_~j~0 2))} is VALID [2022-04-08 03:55:32,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-04-08 03:55:32,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:55:32,902 INFO L290 TraceCheckUtils]: 0: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-08 03:55:32,902 INFO L290 TraceCheckUtils]: 1: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-08 03:55:32,902 INFO L290 TraceCheckUtils]: 2: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-08 03:55:32,902 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {52289#true} {52355#(<= (+ main_~r~0 4) (* main_~j~0 2))} #114#return; {52355#(<= (+ main_~r~0 4) (* main_~j~0 2))} is VALID [2022-04-08 03:55:32,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-04-08 03:55:32,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:55:32,904 INFO L290 TraceCheckUtils]: 0: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-08 03:55:32,904 INFO L290 TraceCheckUtils]: 1: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-08 03:55:32,904 INFO L290 TraceCheckUtils]: 2: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-08 03:55:32,905 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {52289#true} {52355#(<= (+ main_~r~0 4) (* main_~j~0 2))} #116#return; {52355#(<= (+ main_~r~0 4) (* main_~j~0 2))} is VALID [2022-04-08 03:55:32,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-04-08 03:55:32,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:55:32,907 INFO L290 TraceCheckUtils]: 0: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-08 03:55:32,907 INFO L290 TraceCheckUtils]: 1: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-08 03:55:32,907 INFO L290 TraceCheckUtils]: 2: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-08 03:55:32,907 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {52289#true} {52372#(<= (+ main_~r~0 6) (* main_~j~0 2))} #118#return; {52372#(<= (+ main_~r~0 6) (* main_~j~0 2))} is VALID [2022-04-08 03:55:32,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-04-08 03:55:32,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:55:32,909 INFO L290 TraceCheckUtils]: 0: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-08 03:55:32,909 INFO L290 TraceCheckUtils]: 1: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-08 03:55:32,909 INFO L290 TraceCheckUtils]: 2: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-08 03:55:32,910 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {52289#true} {52372#(<= (+ main_~r~0 6) (* main_~j~0 2))} #120#return; {52372#(<= (+ main_~r~0 6) (* main_~j~0 2))} is VALID [2022-04-08 03:55:32,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-04-08 03:55:32,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:55:32,912 INFO L290 TraceCheckUtils]: 0: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-08 03:55:32,912 INFO L290 TraceCheckUtils]: 1: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-08 03:55:32,912 INFO L290 TraceCheckUtils]: 2: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-08 03:55:32,912 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {52289#true} {52372#(<= (+ main_~r~0 6) (* main_~j~0 2))} #122#return; {52372#(<= (+ main_~r~0 6) (* main_~j~0 2))} is VALID [2022-04-08 03:55:32,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2022-04-08 03:55:32,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:55:32,914 INFO L290 TraceCheckUtils]: 0: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-08 03:55:32,914 INFO L290 TraceCheckUtils]: 1: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-08 03:55:32,914 INFO L290 TraceCheckUtils]: 2: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-08 03:55:32,915 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {52289#true} {52372#(<= (+ main_~r~0 6) (* main_~j~0 2))} #124#return; {52372#(<= (+ main_~r~0 6) (* main_~j~0 2))} is VALID [2022-04-08 03:55:32,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2022-04-08 03:55:32,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:55:32,917 INFO L290 TraceCheckUtils]: 0: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-08 03:55:32,917 INFO L290 TraceCheckUtils]: 1: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-08 03:55:32,917 INFO L290 TraceCheckUtils]: 2: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-08 03:55:32,917 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {52289#true} {52372#(<= (+ main_~r~0 6) (* main_~j~0 2))} #126#return; {52372#(<= (+ main_~r~0 6) (* main_~j~0 2))} is VALID [2022-04-08 03:55:32,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2022-04-08 03:55:32,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:55:32,919 INFO L290 TraceCheckUtils]: 0: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-08 03:55:32,919 INFO L290 TraceCheckUtils]: 1: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-08 03:55:32,919 INFO L290 TraceCheckUtils]: 2: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-08 03:55:32,920 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {52289#true} {52372#(<= (+ main_~r~0 6) (* main_~j~0 2))} #128#return; {52372#(<= (+ main_~r~0 6) (* main_~j~0 2))} is VALID [2022-04-08 03:55:32,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2022-04-08 03:55:32,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:55:32,921 INFO L290 TraceCheckUtils]: 0: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-08 03:55:32,922 INFO L290 TraceCheckUtils]: 1: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-08 03:55:32,922 INFO L290 TraceCheckUtils]: 2: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-08 03:55:32,922 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {52289#true} {52290#false} #118#return; {52290#false} is VALID [2022-04-08 03:55:32,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2022-04-08 03:55:32,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:55:32,924 INFO L290 TraceCheckUtils]: 0: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-08 03:55:32,924 INFO L290 TraceCheckUtils]: 1: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-08 03:55:32,924 INFO L290 TraceCheckUtils]: 2: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-08 03:55:32,924 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {52289#true} {52290#false} #120#return; {52290#false} is VALID [2022-04-08 03:55:32,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2022-04-08 03:55:32,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:55:32,926 INFO L290 TraceCheckUtils]: 0: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-08 03:55:32,926 INFO L290 TraceCheckUtils]: 1: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-08 03:55:32,926 INFO L290 TraceCheckUtils]: 2: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-08 03:55:32,926 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {52289#true} {52290#false} #122#return; {52290#false} is VALID [2022-04-08 03:55:32,927 INFO L272 TraceCheckUtils]: 0: Hoare triple {52289#true} call ULTIMATE.init(); {52410#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 03:55:32,927 INFO L290 TraceCheckUtils]: 1: Hoare triple {52410#(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(9, 2); {52289#true} is VALID [2022-04-08 03:55:32,927 INFO L290 TraceCheckUtils]: 2: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-08 03:55:32,927 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {52289#true} {52289#true} #138#return; {52289#true} is VALID [2022-04-08 03:55:32,927 INFO L272 TraceCheckUtils]: 4: Hoare triple {52289#true} call #t~ret8 := main(#in~argc, #in~argv.base, #in~argv.offset); {52289#true} is VALID [2022-04-08 03:55:32,927 INFO L290 TraceCheckUtils]: 5: Hoare triple {52289#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;havoc ~n~0;havoc ~l~0;havoc ~r~0;havoc ~i~0;havoc ~j~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {52289#true} is VALID [2022-04-08 03:55:32,927 INFO L290 TraceCheckUtils]: 6: Hoare triple {52289#true} assume !!(1 <= ~n~0 && ~n~0 <= 1000000);~l~0 := 1 + (if ~n~0 < 0 && 0 != ~n~0 % 2 then 1 + ~n~0 / 2 else ~n~0 / 2);~r~0 := ~n~0; {52289#true} is VALID [2022-04-08 03:55:32,927 INFO L290 TraceCheckUtils]: 7: Hoare triple {52289#true} assume ~l~0 > 1;#t~post2 := ~l~0;~l~0 := #t~post2 - 1;havoc #t~post2; {52289#true} is VALID [2022-04-08 03:55:32,928 INFO L290 TraceCheckUtils]: 8: Hoare triple {52289#true} assume !!(~r~0 > 1);~i~0 := ~l~0;~j~0 := 2 * ~l~0; {52294#(<= main_~j~0 (* main_~l~0 2))} is VALID [2022-04-08 03:55:32,928 INFO L290 TraceCheckUtils]: 9: Hoare triple {52294#(<= main_~j~0 (* main_~l~0 2))} assume !!(~j~0 <= ~r~0); {52294#(<= main_~j~0 (* main_~l~0 2))} is VALID [2022-04-08 03:55:32,929 INFO L290 TraceCheckUtils]: 10: Hoare triple {52294#(<= main_~j~0 (* main_~l~0 2))} assume !(~j~0 < ~r~0); {52295#(<= main_~r~0 (* main_~l~0 2))} is VALID [2022-04-08 03:55:32,929 INFO L272 TraceCheckUtils]: 11: Hoare triple {52295#(<= main_~r~0 (* main_~l~0 2))} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {52289#true} is VALID [2022-04-08 03:55:32,929 INFO L290 TraceCheckUtils]: 12: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-08 03:55:32,929 INFO L290 TraceCheckUtils]: 13: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-08 03:55:32,929 INFO L290 TraceCheckUtils]: 14: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-08 03:55:32,929 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {52289#true} {52295#(<= main_~r~0 (* main_~l~0 2))} #118#return; {52295#(<= main_~r~0 (* main_~l~0 2))} is VALID [2022-04-08 03:55:32,929 INFO L272 TraceCheckUtils]: 16: Hoare triple {52295#(<= main_~r~0 (* main_~l~0 2))} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {52289#true} is VALID [2022-04-08 03:55:32,930 INFO L290 TraceCheckUtils]: 17: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-08 03:55:32,930 INFO L290 TraceCheckUtils]: 18: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-08 03:55:32,930 INFO L290 TraceCheckUtils]: 19: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-08 03:55:32,930 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {52289#true} {52295#(<= main_~r~0 (* main_~l~0 2))} #120#return; {52295#(<= main_~r~0 (* main_~l~0 2))} is VALID [2022-04-08 03:55:32,930 INFO L290 TraceCheckUtils]: 21: Hoare triple {52295#(<= main_~r~0 (* main_~l~0 2))} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {52295#(<= main_~r~0 (* main_~l~0 2))} is VALID [2022-04-08 03:55:32,931 INFO L290 TraceCheckUtils]: 22: Hoare triple {52295#(<= main_~r~0 (* main_~l~0 2))} assume 0 != #t~nondet5;havoc #t~nondet5; {52295#(<= main_~r~0 (* main_~l~0 2))} is VALID [2022-04-08 03:55:32,931 INFO L290 TraceCheckUtils]: 23: Hoare triple {52295#(<= main_~r~0 (* main_~l~0 2))} assume ~l~0 > 1; {52304#(<= (+ main_~r~0 12) (* main_~l~0 8))} is VALID [2022-04-08 03:55:32,931 INFO L272 TraceCheckUtils]: 24: Hoare triple {52304#(<= (+ main_~r~0 12) (* main_~l~0 8))} call __VERIFIER_assert((if 1 <= ~l~0 then 1 else 0)); {52289#true} is VALID [2022-04-08 03:55:32,931 INFO L290 TraceCheckUtils]: 25: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-08 03:55:32,931 INFO L290 TraceCheckUtils]: 26: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-08 03:55:32,932 INFO L290 TraceCheckUtils]: 27: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-08 03:55:32,932 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {52289#true} {52304#(<= (+ main_~r~0 12) (* main_~l~0 8))} #130#return; {52304#(<= (+ main_~r~0 12) (* main_~l~0 8))} is VALID [2022-04-08 03:55:32,932 INFO L272 TraceCheckUtils]: 29: Hoare triple {52304#(<= (+ main_~r~0 12) (* main_~l~0 8))} call __VERIFIER_assert((if ~l~0 <= ~n~0 then 1 else 0)); {52289#true} is VALID [2022-04-08 03:55:32,932 INFO L290 TraceCheckUtils]: 30: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-08 03:55:32,932 INFO L290 TraceCheckUtils]: 31: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-08 03:55:32,932 INFO L290 TraceCheckUtils]: 32: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-08 03:55:32,933 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {52289#true} {52304#(<= (+ main_~r~0 12) (* main_~l~0 8))} #132#return; {52304#(<= (+ main_~r~0 12) (* main_~l~0 8))} is VALID [2022-04-08 03:55:32,933 INFO L290 TraceCheckUtils]: 34: Hoare triple {52304#(<= (+ main_~r~0 12) (* main_~l~0 8))} #t~post6 := ~l~0;~l~0 := #t~post6 - 1;havoc #t~post6; {52313#(<= (+ main_~r~0 4) (* main_~l~0 8))} is VALID [2022-04-08 03:55:32,934 INFO L290 TraceCheckUtils]: 35: Hoare triple {52313#(<= (+ main_~r~0 4) (* main_~l~0 8))} assume !!(~r~0 > 1);~i~0 := ~l~0;~j~0 := 2 * ~l~0; {52314#(<= (+ main_~r~0 4) (* main_~j~0 4))} is VALID [2022-04-08 03:55:32,934 INFO L290 TraceCheckUtils]: 36: Hoare triple {52314#(<= (+ main_~r~0 4) (* main_~j~0 4))} assume !!(~j~0 <= ~r~0); {52314#(<= (+ main_~r~0 4) (* main_~j~0 4))} is VALID [2022-04-08 03:55:32,934 INFO L290 TraceCheckUtils]: 37: Hoare triple {52314#(<= (+ main_~r~0 4) (* main_~j~0 4))} assume ~j~0 < ~r~0; {52314#(<= (+ main_~r~0 4) (* main_~j~0 4))} is VALID [2022-04-08 03:55:32,934 INFO L272 TraceCheckUtils]: 38: Hoare triple {52314#(<= (+ main_~r~0 4) (* main_~j~0 4))} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {52289#true} is VALID [2022-04-08 03:55:32,934 INFO L290 TraceCheckUtils]: 39: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-08 03:55:32,934 INFO L290 TraceCheckUtils]: 40: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-08 03:55:32,935 INFO L290 TraceCheckUtils]: 41: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-08 03:55:32,935 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {52289#true} {52314#(<= (+ main_~r~0 4) (* main_~j~0 4))} #110#return; {52314#(<= (+ main_~r~0 4) (* main_~j~0 4))} is VALID [2022-04-08 03:55:32,935 INFO L272 TraceCheckUtils]: 43: Hoare triple {52314#(<= (+ main_~r~0 4) (* main_~j~0 4))} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {52289#true} is VALID [2022-04-08 03:55:32,935 INFO L290 TraceCheckUtils]: 44: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-08 03:55:32,935 INFO L290 TraceCheckUtils]: 45: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-08 03:55:32,935 INFO L290 TraceCheckUtils]: 46: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-08 03:55:32,936 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {52289#true} {52314#(<= (+ main_~r~0 4) (* main_~j~0 4))} #112#return; {52314#(<= (+ main_~r~0 4) (* main_~j~0 4))} is VALID [2022-04-08 03:55:32,936 INFO L272 TraceCheckUtils]: 48: Hoare triple {52314#(<= (+ main_~r~0 4) (* main_~j~0 4))} call __VERIFIER_assert((if 1 <= 1 + ~j~0 then 1 else 0)); {52289#true} is VALID [2022-04-08 03:55:32,936 INFO L290 TraceCheckUtils]: 49: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-08 03:55:32,936 INFO L290 TraceCheckUtils]: 50: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-08 03:55:32,936 INFO L290 TraceCheckUtils]: 51: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-08 03:55:32,936 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {52289#true} {52314#(<= (+ main_~r~0 4) (* main_~j~0 4))} #114#return; {52314#(<= (+ main_~r~0 4) (* main_~j~0 4))} is VALID [2022-04-08 03:55:32,937 INFO L272 TraceCheckUtils]: 53: Hoare triple {52314#(<= (+ main_~r~0 4) (* main_~j~0 4))} call __VERIFIER_assert((if 1 + ~j~0 <= ~n~0 then 1 else 0)); {52289#true} is VALID [2022-04-08 03:55:32,937 INFO L290 TraceCheckUtils]: 54: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-08 03:55:32,937 INFO L290 TraceCheckUtils]: 55: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-08 03:55:32,937 INFO L290 TraceCheckUtils]: 56: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-08 03:55:32,937 INFO L284 TraceCheckUtils]: 57: Hoare quadruple {52289#true} {52314#(<= (+ main_~r~0 4) (* main_~j~0 4))} #116#return; {52314#(<= (+ main_~r~0 4) (* main_~j~0 4))} is VALID [2022-04-08 03:55:32,937 INFO L290 TraceCheckUtils]: 58: Hoare triple {52314#(<= (+ main_~r~0 4) (* main_~j~0 4))} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {52314#(<= (+ main_~r~0 4) (* main_~j~0 4))} is VALID [2022-04-08 03:55:32,938 INFO L290 TraceCheckUtils]: 59: Hoare triple {52314#(<= (+ main_~r~0 4) (* main_~j~0 4))} assume !(0 != #t~nondet4);havoc #t~nondet4; {52314#(<= (+ main_~r~0 4) (* main_~j~0 4))} is VALID [2022-04-08 03:55:32,938 INFO L272 TraceCheckUtils]: 60: Hoare triple {52314#(<= (+ main_~r~0 4) (* main_~j~0 4))} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {52289#true} is VALID [2022-04-08 03:55:32,938 INFO L290 TraceCheckUtils]: 61: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-08 03:55:32,938 INFO L290 TraceCheckUtils]: 62: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-08 03:55:32,938 INFO L290 TraceCheckUtils]: 63: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-08 03:55:32,939 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {52289#true} {52314#(<= (+ main_~r~0 4) (* main_~j~0 4))} #118#return; {52314#(<= (+ main_~r~0 4) (* main_~j~0 4))} is VALID [2022-04-08 03:55:32,939 INFO L272 TraceCheckUtils]: 65: Hoare triple {52314#(<= (+ main_~r~0 4) (* main_~j~0 4))} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {52289#true} is VALID [2022-04-08 03:55:32,939 INFO L290 TraceCheckUtils]: 66: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-08 03:55:32,939 INFO L290 TraceCheckUtils]: 67: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-08 03:55:32,939 INFO L290 TraceCheckUtils]: 68: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-08 03:55:32,939 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {52289#true} {52314#(<= (+ main_~r~0 4) (* main_~j~0 4))} #120#return; {52314#(<= (+ main_~r~0 4) (* main_~j~0 4))} is VALID [2022-04-08 03:55:32,940 INFO L290 TraceCheckUtils]: 70: Hoare triple {52314#(<= (+ main_~r~0 4) (* main_~j~0 4))} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {52314#(<= (+ main_~r~0 4) (* main_~j~0 4))} is VALID [2022-04-08 03:55:32,940 INFO L290 TraceCheckUtils]: 71: Hoare triple {52314#(<= (+ main_~r~0 4) (* main_~j~0 4))} assume !(0 != #t~nondet5);havoc #t~nondet5; {52314#(<= (+ main_~r~0 4) (* main_~j~0 4))} is VALID [2022-04-08 03:55:32,940 INFO L272 TraceCheckUtils]: 72: Hoare triple {52314#(<= (+ main_~r~0 4) (* main_~j~0 4))} call __VERIFIER_assert((if 1 <= ~i~0 then 1 else 0)); {52289#true} is VALID [2022-04-08 03:55:32,940 INFO L290 TraceCheckUtils]: 73: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-08 03:55:32,940 INFO L290 TraceCheckUtils]: 74: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-08 03:55:32,940 INFO L290 TraceCheckUtils]: 75: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-08 03:55:32,941 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {52289#true} {52314#(<= (+ main_~r~0 4) (* main_~j~0 4))} #122#return; {52314#(<= (+ main_~r~0 4) (* main_~j~0 4))} is VALID [2022-04-08 03:55:32,941 INFO L272 TraceCheckUtils]: 77: Hoare triple {52314#(<= (+ main_~r~0 4) (* main_~j~0 4))} call __VERIFIER_assert((if ~i~0 <= ~n~0 then 1 else 0)); {52289#true} is VALID [2022-04-08 03:55:32,941 INFO L290 TraceCheckUtils]: 78: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-08 03:55:32,941 INFO L290 TraceCheckUtils]: 79: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-08 03:55:32,941 INFO L290 TraceCheckUtils]: 80: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-08 03:55:32,941 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {52289#true} {52314#(<= (+ main_~r~0 4) (* main_~j~0 4))} #124#return; {52314#(<= (+ main_~r~0 4) (* main_~j~0 4))} is VALID [2022-04-08 03:55:32,942 INFO L272 TraceCheckUtils]: 82: Hoare triple {52314#(<= (+ main_~r~0 4) (* main_~j~0 4))} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {52289#true} is VALID [2022-04-08 03:55:32,942 INFO L290 TraceCheckUtils]: 83: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-08 03:55:32,942 INFO L290 TraceCheckUtils]: 84: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-08 03:55:32,942 INFO L290 TraceCheckUtils]: 85: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-08 03:55:32,942 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {52289#true} {52314#(<= (+ main_~r~0 4) (* main_~j~0 4))} #126#return; {52314#(<= (+ main_~r~0 4) (* main_~j~0 4))} is VALID [2022-04-08 03:55:32,942 INFO L272 TraceCheckUtils]: 87: Hoare triple {52314#(<= (+ main_~r~0 4) (* main_~j~0 4))} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {52289#true} is VALID [2022-04-08 03:55:32,942 INFO L290 TraceCheckUtils]: 88: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-08 03:55:32,942 INFO L290 TraceCheckUtils]: 89: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-08 03:55:32,943 INFO L290 TraceCheckUtils]: 90: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-08 03:55:32,943 INFO L284 TraceCheckUtils]: 91: Hoare quadruple {52289#true} {52314#(<= (+ main_~r~0 4) (* main_~j~0 4))} #128#return; {52314#(<= (+ main_~r~0 4) (* main_~j~0 4))} is VALID [2022-04-08 03:55:32,943 INFO L290 TraceCheckUtils]: 92: Hoare triple {52314#(<= (+ main_~r~0 4) (* main_~j~0 4))} ~i~0 := ~j~0;~j~0 := 2 * ~j~0; {52355#(<= (+ main_~r~0 4) (* main_~j~0 2))} is VALID [2022-04-08 03:55:32,944 INFO L290 TraceCheckUtils]: 93: Hoare triple {52355#(<= (+ main_~r~0 4) (* main_~j~0 2))} assume !!(~j~0 <= ~r~0); {52355#(<= (+ main_~r~0 4) (* main_~j~0 2))} is VALID [2022-04-08 03:55:32,944 INFO L290 TraceCheckUtils]: 94: Hoare triple {52355#(<= (+ main_~r~0 4) (* main_~j~0 2))} assume ~j~0 < ~r~0; {52355#(<= (+ main_~r~0 4) (* main_~j~0 2))} is VALID [2022-04-08 03:55:32,944 INFO L272 TraceCheckUtils]: 95: Hoare triple {52355#(<= (+ main_~r~0 4) (* main_~j~0 2))} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {52289#true} is VALID [2022-04-08 03:55:32,944 INFO L290 TraceCheckUtils]: 96: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-08 03:55:32,944 INFO L290 TraceCheckUtils]: 97: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-08 03:55:32,945 INFO L290 TraceCheckUtils]: 98: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-08 03:55:32,945 INFO L284 TraceCheckUtils]: 99: Hoare quadruple {52289#true} {52355#(<= (+ main_~r~0 4) (* main_~j~0 2))} #110#return; {52355#(<= (+ main_~r~0 4) (* main_~j~0 2))} is VALID [2022-04-08 03:55:32,945 INFO L272 TraceCheckUtils]: 100: Hoare triple {52355#(<= (+ main_~r~0 4) (* main_~j~0 2))} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {52289#true} is VALID [2022-04-08 03:55:32,945 INFO L290 TraceCheckUtils]: 101: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-08 03:55:32,945 INFO L290 TraceCheckUtils]: 102: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-08 03:55:32,945 INFO L290 TraceCheckUtils]: 103: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-08 03:55:32,946 INFO L284 TraceCheckUtils]: 104: Hoare quadruple {52289#true} {52355#(<= (+ main_~r~0 4) (* main_~j~0 2))} #112#return; {52355#(<= (+ main_~r~0 4) (* main_~j~0 2))} is VALID [2022-04-08 03:55:32,946 INFO L272 TraceCheckUtils]: 105: Hoare triple {52355#(<= (+ main_~r~0 4) (* main_~j~0 2))} call __VERIFIER_assert((if 1 <= 1 + ~j~0 then 1 else 0)); {52289#true} is VALID [2022-04-08 03:55:32,946 INFO L290 TraceCheckUtils]: 106: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-08 03:55:32,946 INFO L290 TraceCheckUtils]: 107: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-08 03:55:32,946 INFO L290 TraceCheckUtils]: 108: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-08 03:55:32,946 INFO L284 TraceCheckUtils]: 109: Hoare quadruple {52289#true} {52355#(<= (+ main_~r~0 4) (* main_~j~0 2))} #114#return; {52355#(<= (+ main_~r~0 4) (* main_~j~0 2))} is VALID [2022-04-08 03:55:32,947 INFO L272 TraceCheckUtils]: 110: Hoare triple {52355#(<= (+ main_~r~0 4) (* main_~j~0 2))} call __VERIFIER_assert((if 1 + ~j~0 <= ~n~0 then 1 else 0)); {52289#true} is VALID [2022-04-08 03:55:32,947 INFO L290 TraceCheckUtils]: 111: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-08 03:55:32,947 INFO L290 TraceCheckUtils]: 112: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-08 03:55:32,947 INFO L290 TraceCheckUtils]: 113: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-08 03:55:32,947 INFO L284 TraceCheckUtils]: 114: Hoare quadruple {52289#true} {52355#(<= (+ main_~r~0 4) (* main_~j~0 2))} #116#return; {52355#(<= (+ main_~r~0 4) (* main_~j~0 2))} is VALID [2022-04-08 03:55:32,948 INFO L290 TraceCheckUtils]: 115: Hoare triple {52355#(<= (+ main_~r~0 4) (* main_~j~0 2))} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {52355#(<= (+ main_~r~0 4) (* main_~j~0 2))} is VALID [2022-04-08 03:55:32,948 INFO L290 TraceCheckUtils]: 116: Hoare triple {52355#(<= (+ main_~r~0 4) (* main_~j~0 2))} assume 0 != #t~nondet4;havoc #t~nondet4;~j~0 := 1 + ~j~0; {52372#(<= (+ main_~r~0 6) (* main_~j~0 2))} is VALID [2022-04-08 03:55:32,948 INFO L272 TraceCheckUtils]: 117: Hoare triple {52372#(<= (+ main_~r~0 6) (* main_~j~0 2))} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {52289#true} is VALID [2022-04-08 03:55:32,948 INFO L290 TraceCheckUtils]: 118: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-08 03:55:32,948 INFO L290 TraceCheckUtils]: 119: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-08 03:55:32,948 INFO L290 TraceCheckUtils]: 120: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-08 03:55:32,949 INFO L284 TraceCheckUtils]: 121: Hoare quadruple {52289#true} {52372#(<= (+ main_~r~0 6) (* main_~j~0 2))} #118#return; {52372#(<= (+ main_~r~0 6) (* main_~j~0 2))} is VALID [2022-04-08 03:55:32,949 INFO L272 TraceCheckUtils]: 122: Hoare triple {52372#(<= (+ main_~r~0 6) (* main_~j~0 2))} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {52289#true} is VALID [2022-04-08 03:55:32,949 INFO L290 TraceCheckUtils]: 123: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-08 03:55:32,949 INFO L290 TraceCheckUtils]: 124: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-08 03:55:32,949 INFO L290 TraceCheckUtils]: 125: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-08 03:55:32,950 INFO L284 TraceCheckUtils]: 126: Hoare quadruple {52289#true} {52372#(<= (+ main_~r~0 6) (* main_~j~0 2))} #120#return; {52372#(<= (+ main_~r~0 6) (* main_~j~0 2))} is VALID [2022-04-08 03:55:32,950 INFO L290 TraceCheckUtils]: 127: Hoare triple {52372#(<= (+ main_~r~0 6) (* main_~j~0 2))} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {52372#(<= (+ main_~r~0 6) (* main_~j~0 2))} is VALID [2022-04-08 03:55:32,950 INFO L290 TraceCheckUtils]: 128: Hoare triple {52372#(<= (+ main_~r~0 6) (* main_~j~0 2))} assume !(0 != #t~nondet5);havoc #t~nondet5; {52372#(<= (+ main_~r~0 6) (* main_~j~0 2))} is VALID [2022-04-08 03:55:32,950 INFO L272 TraceCheckUtils]: 129: Hoare triple {52372#(<= (+ main_~r~0 6) (* main_~j~0 2))} call __VERIFIER_assert((if 1 <= ~i~0 then 1 else 0)); {52289#true} is VALID [2022-04-08 03:55:32,950 INFO L290 TraceCheckUtils]: 130: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-08 03:55:32,951 INFO L290 TraceCheckUtils]: 131: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-08 03:55:32,951 INFO L290 TraceCheckUtils]: 132: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-08 03:55:32,951 INFO L284 TraceCheckUtils]: 133: Hoare quadruple {52289#true} {52372#(<= (+ main_~r~0 6) (* main_~j~0 2))} #122#return; {52372#(<= (+ main_~r~0 6) (* main_~j~0 2))} is VALID [2022-04-08 03:55:32,951 INFO L272 TraceCheckUtils]: 134: Hoare triple {52372#(<= (+ main_~r~0 6) (* main_~j~0 2))} call __VERIFIER_assert((if ~i~0 <= ~n~0 then 1 else 0)); {52289#true} is VALID [2022-04-08 03:55:32,951 INFO L290 TraceCheckUtils]: 135: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-08 03:55:32,951 INFO L290 TraceCheckUtils]: 136: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-08 03:55:32,951 INFO L290 TraceCheckUtils]: 137: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-08 03:55:32,952 INFO L284 TraceCheckUtils]: 138: Hoare quadruple {52289#true} {52372#(<= (+ main_~r~0 6) (* main_~j~0 2))} #124#return; {52372#(<= (+ main_~r~0 6) (* main_~j~0 2))} is VALID [2022-04-08 03:55:32,952 INFO L272 TraceCheckUtils]: 139: Hoare triple {52372#(<= (+ main_~r~0 6) (* main_~j~0 2))} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {52289#true} is VALID [2022-04-08 03:55:32,952 INFO L290 TraceCheckUtils]: 140: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-08 03:55:32,952 INFO L290 TraceCheckUtils]: 141: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-08 03:55:32,952 INFO L290 TraceCheckUtils]: 142: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-08 03:55:32,953 INFO L284 TraceCheckUtils]: 143: Hoare quadruple {52289#true} {52372#(<= (+ main_~r~0 6) (* main_~j~0 2))} #126#return; {52372#(<= (+ main_~r~0 6) (* main_~j~0 2))} is VALID [2022-04-08 03:55:32,953 INFO L272 TraceCheckUtils]: 144: Hoare triple {52372#(<= (+ main_~r~0 6) (* main_~j~0 2))} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {52289#true} is VALID [2022-04-08 03:55:32,953 INFO L290 TraceCheckUtils]: 145: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-08 03:55:32,953 INFO L290 TraceCheckUtils]: 146: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-08 03:55:32,953 INFO L290 TraceCheckUtils]: 147: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-08 03:55:32,953 INFO L284 TraceCheckUtils]: 148: Hoare quadruple {52289#true} {52372#(<= (+ main_~r~0 6) (* main_~j~0 2))} #128#return; {52372#(<= (+ main_~r~0 6) (* main_~j~0 2))} is VALID [2022-04-08 03:55:32,954 INFO L290 TraceCheckUtils]: 149: Hoare triple {52372#(<= (+ main_~r~0 6) (* main_~j~0 2))} ~i~0 := ~j~0;~j~0 := 2 * ~j~0; {52397#(<= (+ main_~r~0 6) main_~j~0)} is VALID [2022-04-08 03:55:32,954 INFO L290 TraceCheckUtils]: 150: Hoare triple {52397#(<= (+ main_~r~0 6) main_~j~0)} assume !!(~j~0 <= ~r~0); {52290#false} is VALID [2022-04-08 03:55:32,954 INFO L290 TraceCheckUtils]: 151: Hoare triple {52290#false} assume !(~j~0 < ~r~0); {52290#false} is VALID [2022-04-08 03:55:32,954 INFO L272 TraceCheckUtils]: 152: Hoare triple {52290#false} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {52289#true} is VALID [2022-04-08 03:55:32,954 INFO L290 TraceCheckUtils]: 153: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-08 03:55:32,955 INFO L290 TraceCheckUtils]: 154: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-08 03:55:32,955 INFO L290 TraceCheckUtils]: 155: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-08 03:55:32,955 INFO L284 TraceCheckUtils]: 156: Hoare quadruple {52289#true} {52290#false} #118#return; {52290#false} is VALID [2022-04-08 03:55:32,955 INFO L272 TraceCheckUtils]: 157: Hoare triple {52290#false} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {52289#true} is VALID [2022-04-08 03:55:32,955 INFO L290 TraceCheckUtils]: 158: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-08 03:55:32,955 INFO L290 TraceCheckUtils]: 159: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-08 03:55:32,955 INFO L290 TraceCheckUtils]: 160: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-08 03:55:32,955 INFO L284 TraceCheckUtils]: 161: Hoare quadruple {52289#true} {52290#false} #120#return; {52290#false} is VALID [2022-04-08 03:55:32,955 INFO L290 TraceCheckUtils]: 162: Hoare triple {52290#false} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {52290#false} is VALID [2022-04-08 03:55:32,955 INFO L290 TraceCheckUtils]: 163: Hoare triple {52290#false} assume !(0 != #t~nondet5);havoc #t~nondet5; {52290#false} is VALID [2022-04-08 03:55:32,956 INFO L272 TraceCheckUtils]: 164: Hoare triple {52290#false} call __VERIFIER_assert((if 1 <= ~i~0 then 1 else 0)); {52289#true} is VALID [2022-04-08 03:55:32,956 INFO L290 TraceCheckUtils]: 165: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-08 03:55:32,956 INFO L290 TraceCheckUtils]: 166: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-08 03:55:32,956 INFO L290 TraceCheckUtils]: 167: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-08 03:55:32,956 INFO L284 TraceCheckUtils]: 168: Hoare quadruple {52289#true} {52290#false} #122#return; {52290#false} is VALID [2022-04-08 03:55:32,956 INFO L272 TraceCheckUtils]: 169: Hoare triple {52290#false} call __VERIFIER_assert((if ~i~0 <= ~n~0 then 1 else 0)); {52290#false} is VALID [2022-04-08 03:55:32,956 INFO L290 TraceCheckUtils]: 170: Hoare triple {52290#false} ~cond := #in~cond; {52290#false} is VALID [2022-04-08 03:55:32,956 INFO L290 TraceCheckUtils]: 171: Hoare triple {52290#false} assume 0 == ~cond; {52290#false} is VALID [2022-04-08 03:55:32,956 INFO L290 TraceCheckUtils]: 172: Hoare triple {52290#false} assume !false; {52290#false} is VALID [2022-04-08 03:55:32,957 INFO L134 CoverageAnalysis]: Checked inductivity of 1510 backedges. 74 proven. 32 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2022-04-08 03:55:32,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 03:55:32,957 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2065673399] [2022-04-08 03:55:32,957 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2065673399] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 03:55:32,958 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1844609610] [2022-04-08 03:55:32,958 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 03:55:32,958 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 03:55:32,958 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 03:55:32,959 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 03:55:32,972 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 03:55:33,053 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 03:55:33,054 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 03:55:33,055 INFO L263 TraceCheckSpWp]: Trace formula consists of 364 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-08 03:55:33,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:55:33,087 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 03:55:37,176 INFO L272 TraceCheckUtils]: 0: Hoare triple {52289#true} call ULTIMATE.init(); {52289#true} is VALID [2022-04-08 03:55:37,176 INFO L290 TraceCheckUtils]: 1: Hoare triple {52289#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(9, 2); {52289#true} is VALID [2022-04-08 03:55:37,176 INFO L290 TraceCheckUtils]: 2: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-08 03:55:37,176 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {52289#true} {52289#true} #138#return; {52289#true} is VALID [2022-04-08 03:55:37,177 INFO L272 TraceCheckUtils]: 4: Hoare triple {52289#true} call #t~ret8 := main(#in~argc, #in~argv.base, #in~argv.offset); {52289#true} is VALID [2022-04-08 03:55:37,177 INFO L290 TraceCheckUtils]: 5: Hoare triple {52289#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;havoc ~n~0;havoc ~l~0;havoc ~r~0;havoc ~i~0;havoc ~j~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {52289#true} is VALID [2022-04-08 03:55:37,177 INFO L290 TraceCheckUtils]: 6: Hoare triple {52289#true} assume !!(1 <= ~n~0 && ~n~0 <= 1000000);~l~0 := 1 + (if ~n~0 < 0 && 0 != ~n~0 % 2 then 1 + ~n~0 / 2 else ~n~0 / 2);~r~0 := ~n~0; {52289#true} is VALID [2022-04-08 03:55:37,177 INFO L290 TraceCheckUtils]: 7: Hoare triple {52289#true} assume ~l~0 > 1;#t~post2 := ~l~0;~l~0 := #t~post2 - 1;havoc #t~post2; {52289#true} is VALID [2022-04-08 03:55:37,177 INFO L290 TraceCheckUtils]: 8: Hoare triple {52289#true} assume !!(~r~0 > 1);~i~0 := ~l~0;~j~0 := 2 * ~l~0; {52294#(<= main_~j~0 (* main_~l~0 2))} is VALID [2022-04-08 03:55:37,178 INFO L290 TraceCheckUtils]: 9: Hoare triple {52294#(<= main_~j~0 (* main_~l~0 2))} assume !!(~j~0 <= ~r~0); {52294#(<= main_~j~0 (* main_~l~0 2))} is VALID [2022-04-08 03:55:37,178 INFO L290 TraceCheckUtils]: 10: Hoare triple {52294#(<= main_~j~0 (* main_~l~0 2))} assume !(~j~0 < ~r~0); {52295#(<= main_~r~0 (* main_~l~0 2))} is VALID [2022-04-08 03:55:37,178 INFO L272 TraceCheckUtils]: 11: Hoare triple {52295#(<= main_~r~0 (* main_~l~0 2))} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {52289#true} is VALID [2022-04-08 03:55:37,178 INFO L290 TraceCheckUtils]: 12: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-08 03:55:37,178 INFO L290 TraceCheckUtils]: 13: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-08 03:55:37,178 INFO L290 TraceCheckUtils]: 14: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-08 03:55:37,179 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {52289#true} {52295#(<= main_~r~0 (* main_~l~0 2))} #118#return; {52295#(<= main_~r~0 (* main_~l~0 2))} is VALID [2022-04-08 03:55:37,179 INFO L272 TraceCheckUtils]: 16: Hoare triple {52295#(<= main_~r~0 (* main_~l~0 2))} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {52289#true} is VALID [2022-04-08 03:55:37,179 INFO L290 TraceCheckUtils]: 17: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-08 03:55:37,179 INFO L290 TraceCheckUtils]: 18: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-08 03:55:37,179 INFO L290 TraceCheckUtils]: 19: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-08 03:55:37,180 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {52289#true} {52295#(<= main_~r~0 (* main_~l~0 2))} #120#return; {52295#(<= main_~r~0 (* main_~l~0 2))} is VALID [2022-04-08 03:55:37,180 INFO L290 TraceCheckUtils]: 21: Hoare triple {52295#(<= main_~r~0 (* main_~l~0 2))} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {52295#(<= main_~r~0 (* main_~l~0 2))} is VALID [2022-04-08 03:55:37,180 INFO L290 TraceCheckUtils]: 22: Hoare triple {52295#(<= main_~r~0 (* main_~l~0 2))} assume 0 != #t~nondet5;havoc #t~nondet5; {52295#(<= main_~r~0 (* main_~l~0 2))} is VALID [2022-04-08 03:55:37,181 INFO L290 TraceCheckUtils]: 23: Hoare triple {52295#(<= main_~r~0 (* main_~l~0 2))} assume ~l~0 > 1; {52483#(and (< 1 main_~l~0) (<= main_~r~0 (* main_~l~0 2)))} is VALID [2022-04-08 03:55:37,181 INFO L272 TraceCheckUtils]: 24: Hoare triple {52483#(and (< 1 main_~l~0) (<= main_~r~0 (* main_~l~0 2)))} call __VERIFIER_assert((if 1 <= ~l~0 then 1 else 0)); {52289#true} is VALID [2022-04-08 03:55:37,181 INFO L290 TraceCheckUtils]: 25: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-08 03:55:37,181 INFO L290 TraceCheckUtils]: 26: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-08 03:55:37,181 INFO L290 TraceCheckUtils]: 27: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-08 03:55:37,182 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {52289#true} {52483#(and (< 1 main_~l~0) (<= main_~r~0 (* main_~l~0 2)))} #130#return; {52483#(and (< 1 main_~l~0) (<= main_~r~0 (* main_~l~0 2)))} is VALID [2022-04-08 03:55:37,182 INFO L272 TraceCheckUtils]: 29: Hoare triple {52483#(and (< 1 main_~l~0) (<= main_~r~0 (* main_~l~0 2)))} call __VERIFIER_assert((if ~l~0 <= ~n~0 then 1 else 0)); {52289#true} is VALID [2022-04-08 03:55:37,182 INFO L290 TraceCheckUtils]: 30: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-08 03:55:37,182 INFO L290 TraceCheckUtils]: 31: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-08 03:55:37,182 INFO L290 TraceCheckUtils]: 32: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-08 03:55:37,182 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {52289#true} {52483#(and (< 1 main_~l~0) (<= main_~r~0 (* main_~l~0 2)))} #132#return; {52483#(and (< 1 main_~l~0) (<= main_~r~0 (* main_~l~0 2)))} is VALID [2022-04-08 03:55:37,183 INFO L290 TraceCheckUtils]: 34: Hoare triple {52483#(and (< 1 main_~l~0) (<= main_~r~0 (* main_~l~0 2)))} #t~post6 := ~l~0;~l~0 := #t~post6 - 1;havoc #t~post6; {52517#(and (<= (div (- main_~r~0) (- 2)) (+ main_~l~0 1)) (< 0 main_~l~0))} is VALID [2022-04-08 03:55:37,184 INFO L290 TraceCheckUtils]: 35: Hoare triple {52517#(and (<= (div (- main_~r~0) (- 2)) (+ main_~l~0 1)) (< 0 main_~l~0))} assume !!(~r~0 > 1);~i~0 := ~l~0;~j~0 := 2 * ~l~0; {52521#(and (<= (div (* (- 1) main_~r~0) (- 2)) (+ (div main_~j~0 2) 1)) (< 0 (div main_~j~0 2)))} is VALID [2022-04-08 03:55:37,184 INFO L290 TraceCheckUtils]: 36: Hoare triple {52521#(and (<= (div (* (- 1) main_~r~0) (- 2)) (+ (div main_~j~0 2) 1)) (< 0 (div main_~j~0 2)))} assume !!(~j~0 <= ~r~0); {52521#(and (<= (div (* (- 1) main_~r~0) (- 2)) (+ (div main_~j~0 2) 1)) (< 0 (div main_~j~0 2)))} is VALID [2022-04-08 03:55:37,184 INFO L290 TraceCheckUtils]: 37: Hoare triple {52521#(and (<= (div (* (- 1) main_~r~0) (- 2)) (+ (div main_~j~0 2) 1)) (< 0 (div main_~j~0 2)))} assume ~j~0 < ~r~0; {52521#(and (<= (div (* (- 1) main_~r~0) (- 2)) (+ (div main_~j~0 2) 1)) (< 0 (div main_~j~0 2)))} is VALID [2022-04-08 03:55:37,185 INFO L272 TraceCheckUtils]: 38: Hoare triple {52521#(and (<= (div (* (- 1) main_~r~0) (- 2)) (+ (div main_~j~0 2) 1)) (< 0 (div main_~j~0 2)))} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {52289#true} is VALID [2022-04-08 03:55:37,185 INFO L290 TraceCheckUtils]: 39: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-08 03:55:37,185 INFO L290 TraceCheckUtils]: 40: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-08 03:55:37,185 INFO L290 TraceCheckUtils]: 41: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-08 03:55:37,185 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {52289#true} {52521#(and (<= (div (* (- 1) main_~r~0) (- 2)) (+ (div main_~j~0 2) 1)) (< 0 (div main_~j~0 2)))} #110#return; {52521#(and (<= (div (* (- 1) main_~r~0) (- 2)) (+ (div main_~j~0 2) 1)) (< 0 (div main_~j~0 2)))} is VALID [2022-04-08 03:55:37,185 INFO L272 TraceCheckUtils]: 43: Hoare triple {52521#(and (<= (div (* (- 1) main_~r~0) (- 2)) (+ (div main_~j~0 2) 1)) (< 0 (div main_~j~0 2)))} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {52289#true} is VALID [2022-04-08 03:55:37,185 INFO L290 TraceCheckUtils]: 44: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-08 03:55:37,186 INFO L290 TraceCheckUtils]: 45: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-08 03:55:37,186 INFO L290 TraceCheckUtils]: 46: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-08 03:55:37,186 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {52289#true} {52521#(and (<= (div (* (- 1) main_~r~0) (- 2)) (+ (div main_~j~0 2) 1)) (< 0 (div main_~j~0 2)))} #112#return; {52521#(and (<= (div (* (- 1) main_~r~0) (- 2)) (+ (div main_~j~0 2) 1)) (< 0 (div main_~j~0 2)))} is VALID [2022-04-08 03:55:37,186 INFO L272 TraceCheckUtils]: 48: Hoare triple {52521#(and (<= (div (* (- 1) main_~r~0) (- 2)) (+ (div main_~j~0 2) 1)) (< 0 (div main_~j~0 2)))} call __VERIFIER_assert((if 1 <= 1 + ~j~0 then 1 else 0)); {52289#true} is VALID [2022-04-08 03:55:37,186 INFO L290 TraceCheckUtils]: 49: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-08 03:55:37,186 INFO L290 TraceCheckUtils]: 50: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-08 03:55:37,187 INFO L290 TraceCheckUtils]: 51: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-08 03:55:37,187 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {52289#true} {52521#(and (<= (div (* (- 1) main_~r~0) (- 2)) (+ (div main_~j~0 2) 1)) (< 0 (div main_~j~0 2)))} #114#return; {52521#(and (<= (div (* (- 1) main_~r~0) (- 2)) (+ (div main_~j~0 2) 1)) (< 0 (div main_~j~0 2)))} is VALID [2022-04-08 03:55:37,187 INFO L272 TraceCheckUtils]: 53: Hoare triple {52521#(and (<= (div (* (- 1) main_~r~0) (- 2)) (+ (div main_~j~0 2) 1)) (< 0 (div main_~j~0 2)))} call __VERIFIER_assert((if 1 + ~j~0 <= ~n~0 then 1 else 0)); {52289#true} is VALID [2022-04-08 03:55:37,187 INFO L290 TraceCheckUtils]: 54: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-08 03:55:37,187 INFO L290 TraceCheckUtils]: 55: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-08 03:55:37,187 INFO L290 TraceCheckUtils]: 56: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-08 03:55:37,191 INFO L284 TraceCheckUtils]: 57: Hoare quadruple {52289#true} {52521#(and (<= (div (* (- 1) main_~r~0) (- 2)) (+ (div main_~j~0 2) 1)) (< 0 (div main_~j~0 2)))} #116#return; {52521#(and (<= (div (* (- 1) main_~r~0) (- 2)) (+ (div main_~j~0 2) 1)) (< 0 (div main_~j~0 2)))} is VALID [2022-04-08 03:55:37,191 INFO L290 TraceCheckUtils]: 58: Hoare triple {52521#(and (<= (div (* (- 1) main_~r~0) (- 2)) (+ (div main_~j~0 2) 1)) (< 0 (div main_~j~0 2)))} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {52521#(and (<= (div (* (- 1) main_~r~0) (- 2)) (+ (div main_~j~0 2) 1)) (< 0 (div main_~j~0 2)))} is VALID [2022-04-08 03:55:37,192 INFO L290 TraceCheckUtils]: 59: Hoare triple {52521#(and (<= (div (* (- 1) main_~r~0) (- 2)) (+ (div main_~j~0 2) 1)) (< 0 (div main_~j~0 2)))} assume !(0 != #t~nondet4);havoc #t~nondet4; {52521#(and (<= (div (* (- 1) main_~r~0) (- 2)) (+ (div main_~j~0 2) 1)) (< 0 (div main_~j~0 2)))} is VALID [2022-04-08 03:55:37,192 INFO L272 TraceCheckUtils]: 60: Hoare triple {52521#(and (<= (div (* (- 1) main_~r~0) (- 2)) (+ (div main_~j~0 2) 1)) (< 0 (div main_~j~0 2)))} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {52289#true} is VALID [2022-04-08 03:55:37,192 INFO L290 TraceCheckUtils]: 61: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-08 03:55:37,192 INFO L290 TraceCheckUtils]: 62: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-08 03:55:37,192 INFO L290 TraceCheckUtils]: 63: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-08 03:55:37,192 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {52289#true} {52521#(and (<= (div (* (- 1) main_~r~0) (- 2)) (+ (div main_~j~0 2) 1)) (< 0 (div main_~j~0 2)))} #118#return; {52521#(and (<= (div (* (- 1) main_~r~0) (- 2)) (+ (div main_~j~0 2) 1)) (< 0 (div main_~j~0 2)))} is VALID [2022-04-08 03:55:37,193 INFO L272 TraceCheckUtils]: 65: Hoare triple {52521#(and (<= (div (* (- 1) main_~r~0) (- 2)) (+ (div main_~j~0 2) 1)) (< 0 (div main_~j~0 2)))} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {52289#true} is VALID [2022-04-08 03:55:37,193 INFO L290 TraceCheckUtils]: 66: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-08 03:55:37,193 INFO L290 TraceCheckUtils]: 67: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-08 03:55:37,193 INFO L290 TraceCheckUtils]: 68: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-08 03:55:37,193 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {52289#true} {52521#(and (<= (div (* (- 1) main_~r~0) (- 2)) (+ (div main_~j~0 2) 1)) (< 0 (div main_~j~0 2)))} #120#return; {52521#(and (<= (div (* (- 1) main_~r~0) (- 2)) (+ (div main_~j~0 2) 1)) (< 0 (div main_~j~0 2)))} is VALID [2022-04-08 03:55:37,194 INFO L290 TraceCheckUtils]: 70: Hoare triple {52521#(and (<= (div (* (- 1) main_~r~0) (- 2)) (+ (div main_~j~0 2) 1)) (< 0 (div main_~j~0 2)))} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {52521#(and (<= (div (* (- 1) main_~r~0) (- 2)) (+ (div main_~j~0 2) 1)) (< 0 (div main_~j~0 2)))} is VALID [2022-04-08 03:55:37,194 INFO L290 TraceCheckUtils]: 71: Hoare triple {52521#(and (<= (div (* (- 1) main_~r~0) (- 2)) (+ (div main_~j~0 2) 1)) (< 0 (div main_~j~0 2)))} assume !(0 != #t~nondet5);havoc #t~nondet5; {52521#(and (<= (div (* (- 1) main_~r~0) (- 2)) (+ (div main_~j~0 2) 1)) (< 0 (div main_~j~0 2)))} is VALID [2022-04-08 03:55:37,194 INFO L272 TraceCheckUtils]: 72: Hoare triple {52521#(and (<= (div (* (- 1) main_~r~0) (- 2)) (+ (div main_~j~0 2) 1)) (< 0 (div main_~j~0 2)))} call __VERIFIER_assert((if 1 <= ~i~0 then 1 else 0)); {52289#true} is VALID [2022-04-08 03:55:37,194 INFO L290 TraceCheckUtils]: 73: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-08 03:55:37,194 INFO L290 TraceCheckUtils]: 74: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-08 03:55:37,195 INFO L290 TraceCheckUtils]: 75: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-08 03:55:37,195 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {52289#true} {52521#(and (<= (div (* (- 1) main_~r~0) (- 2)) (+ (div main_~j~0 2) 1)) (< 0 (div main_~j~0 2)))} #122#return; {52521#(and (<= (div (* (- 1) main_~r~0) (- 2)) (+ (div main_~j~0 2) 1)) (< 0 (div main_~j~0 2)))} is VALID [2022-04-08 03:55:37,195 INFO L272 TraceCheckUtils]: 77: Hoare triple {52521#(and (<= (div (* (- 1) main_~r~0) (- 2)) (+ (div main_~j~0 2) 1)) (< 0 (div main_~j~0 2)))} call __VERIFIER_assert((if ~i~0 <= ~n~0 then 1 else 0)); {52289#true} is VALID [2022-04-08 03:55:37,195 INFO L290 TraceCheckUtils]: 78: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-08 03:55:37,195 INFO L290 TraceCheckUtils]: 79: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-08 03:55:37,195 INFO L290 TraceCheckUtils]: 80: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-08 03:55:37,196 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {52289#true} {52521#(and (<= (div (* (- 1) main_~r~0) (- 2)) (+ (div main_~j~0 2) 1)) (< 0 (div main_~j~0 2)))} #124#return; {52521#(and (<= (div (* (- 1) main_~r~0) (- 2)) (+ (div main_~j~0 2) 1)) (< 0 (div main_~j~0 2)))} is VALID [2022-04-08 03:55:37,196 INFO L272 TraceCheckUtils]: 82: Hoare triple {52521#(and (<= (div (* (- 1) main_~r~0) (- 2)) (+ (div main_~j~0 2) 1)) (< 0 (div main_~j~0 2)))} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {52289#true} is VALID [2022-04-08 03:55:37,197 INFO L290 TraceCheckUtils]: 83: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-08 03:55:37,197 INFO L290 TraceCheckUtils]: 84: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-08 03:55:37,198 INFO L290 TraceCheckUtils]: 85: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-08 03:55:37,199 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {52289#true} {52521#(and (<= (div (* (- 1) main_~r~0) (- 2)) (+ (div main_~j~0 2) 1)) (< 0 (div main_~j~0 2)))} #126#return; {52521#(and (<= (div (* (- 1) main_~r~0) (- 2)) (+ (div main_~j~0 2) 1)) (< 0 (div main_~j~0 2)))} is VALID [2022-04-08 03:55:37,199 INFO L272 TraceCheckUtils]: 87: Hoare triple {52521#(and (<= (div (* (- 1) main_~r~0) (- 2)) (+ (div main_~j~0 2) 1)) (< 0 (div main_~j~0 2)))} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {52289#true} is VALID [2022-04-08 03:55:37,199 INFO L290 TraceCheckUtils]: 88: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-08 03:55:37,199 INFO L290 TraceCheckUtils]: 89: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-08 03:55:37,199 INFO L290 TraceCheckUtils]: 90: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-08 03:55:37,199 INFO L284 TraceCheckUtils]: 91: Hoare quadruple {52289#true} {52521#(and (<= (div (* (- 1) main_~r~0) (- 2)) (+ (div main_~j~0 2) 1)) (< 0 (div main_~j~0 2)))} #128#return; {52521#(and (<= (div (* (- 1) main_~r~0) (- 2)) (+ (div main_~j~0 2) 1)) (< 0 (div main_~j~0 2)))} is VALID [2022-04-08 03:55:37,200 INFO L290 TraceCheckUtils]: 92: Hoare triple {52521#(and (<= (div (* (- 1) main_~r~0) (- 2)) (+ (div main_~j~0 2) 1)) (< 0 (div main_~j~0 2)))} ~i~0 := ~j~0;~j~0 := 2 * ~j~0; {52693#(and (< 0 (div (div main_~j~0 2) 2)) (<= (div (* (- 1) main_~r~0) (- 2)) (+ (div (div main_~j~0 2) 2) 1)))} is VALID [2022-04-08 03:55:37,201 INFO L290 TraceCheckUtils]: 93: Hoare triple {52693#(and (< 0 (div (div main_~j~0 2) 2)) (<= (div (* (- 1) main_~r~0) (- 2)) (+ (div (div main_~j~0 2) 2) 1)))} assume !!(~j~0 <= ~r~0); {52693#(and (< 0 (div (div main_~j~0 2) 2)) (<= (div (* (- 1) main_~r~0) (- 2)) (+ (div (div main_~j~0 2) 2) 1)))} is VALID [2022-04-08 03:55:37,201 INFO L290 TraceCheckUtils]: 94: Hoare triple {52693#(and (< 0 (div (div main_~j~0 2) 2)) (<= (div (* (- 1) main_~r~0) (- 2)) (+ (div (div main_~j~0 2) 2) 1)))} assume ~j~0 < ~r~0; {52290#false} is VALID [2022-04-08 03:55:37,201 INFO L272 TraceCheckUtils]: 95: Hoare triple {52290#false} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {52290#false} is VALID [2022-04-08 03:55:37,201 INFO L290 TraceCheckUtils]: 96: Hoare triple {52290#false} ~cond := #in~cond; {52290#false} is VALID [2022-04-08 03:55:37,201 INFO L290 TraceCheckUtils]: 97: Hoare triple {52290#false} assume !(0 == ~cond); {52290#false} is VALID [2022-04-08 03:55:37,202 INFO L290 TraceCheckUtils]: 98: Hoare triple {52290#false} assume true; {52290#false} is VALID [2022-04-08 03:55:37,202 INFO L284 TraceCheckUtils]: 99: Hoare quadruple {52290#false} {52290#false} #110#return; {52290#false} is VALID [2022-04-08 03:55:37,202 INFO L272 TraceCheckUtils]: 100: Hoare triple {52290#false} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {52290#false} is VALID [2022-04-08 03:55:37,202 INFO L290 TraceCheckUtils]: 101: Hoare triple {52290#false} ~cond := #in~cond; {52290#false} is VALID [2022-04-08 03:55:37,202 INFO L290 TraceCheckUtils]: 102: Hoare triple {52290#false} assume !(0 == ~cond); {52290#false} is VALID [2022-04-08 03:55:37,202 INFO L290 TraceCheckUtils]: 103: Hoare triple {52290#false} assume true; {52290#false} is VALID [2022-04-08 03:55:37,202 INFO L284 TraceCheckUtils]: 104: Hoare quadruple {52290#false} {52290#false} #112#return; {52290#false} is VALID [2022-04-08 03:55:37,202 INFO L272 TraceCheckUtils]: 105: Hoare triple {52290#false} call __VERIFIER_assert((if 1 <= 1 + ~j~0 then 1 else 0)); {52290#false} is VALID [2022-04-08 03:55:37,202 INFO L290 TraceCheckUtils]: 106: Hoare triple {52290#false} ~cond := #in~cond; {52290#false} is VALID [2022-04-08 03:55:37,202 INFO L290 TraceCheckUtils]: 107: Hoare triple {52290#false} assume !(0 == ~cond); {52290#false} is VALID [2022-04-08 03:55:37,203 INFO L290 TraceCheckUtils]: 108: Hoare triple {52290#false} assume true; {52290#false} is VALID [2022-04-08 03:55:37,203 INFO L284 TraceCheckUtils]: 109: Hoare quadruple {52290#false} {52290#false} #114#return; {52290#false} is VALID [2022-04-08 03:55:37,203 INFO L272 TraceCheckUtils]: 110: Hoare triple {52290#false} call __VERIFIER_assert((if 1 + ~j~0 <= ~n~0 then 1 else 0)); {52290#false} is VALID [2022-04-08 03:55:37,203 INFO L290 TraceCheckUtils]: 111: Hoare triple {52290#false} ~cond := #in~cond; {52290#false} is VALID [2022-04-08 03:55:37,203 INFO L290 TraceCheckUtils]: 112: Hoare triple {52290#false} assume !(0 == ~cond); {52290#false} is VALID [2022-04-08 03:55:37,203 INFO L290 TraceCheckUtils]: 113: Hoare triple {52290#false} assume true; {52290#false} is VALID [2022-04-08 03:55:37,203 INFO L284 TraceCheckUtils]: 114: Hoare quadruple {52290#false} {52290#false} #116#return; {52290#false} is VALID [2022-04-08 03:55:37,203 INFO L290 TraceCheckUtils]: 115: Hoare triple {52290#false} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {52290#false} is VALID [2022-04-08 03:55:37,203 INFO L290 TraceCheckUtils]: 116: Hoare triple {52290#false} assume 0 != #t~nondet4;havoc #t~nondet4;~j~0 := 1 + ~j~0; {52290#false} is VALID [2022-04-08 03:55:37,203 INFO L272 TraceCheckUtils]: 117: Hoare triple {52290#false} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {52290#false} is VALID [2022-04-08 03:55:37,203 INFO L290 TraceCheckUtils]: 118: Hoare triple {52290#false} ~cond := #in~cond; {52290#false} is VALID [2022-04-08 03:55:37,204 INFO L290 TraceCheckUtils]: 119: Hoare triple {52290#false} assume !(0 == ~cond); {52290#false} is VALID [2022-04-08 03:55:37,204 INFO L290 TraceCheckUtils]: 120: Hoare triple {52290#false} assume true; {52290#false} is VALID [2022-04-08 03:55:37,204 INFO L284 TraceCheckUtils]: 121: Hoare quadruple {52290#false} {52290#false} #118#return; {52290#false} is VALID [2022-04-08 03:55:37,204 INFO L272 TraceCheckUtils]: 122: Hoare triple {52290#false} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {52290#false} is VALID [2022-04-08 03:55:37,204 INFO L290 TraceCheckUtils]: 123: Hoare triple {52290#false} ~cond := #in~cond; {52290#false} is VALID [2022-04-08 03:55:37,204 INFO L290 TraceCheckUtils]: 124: Hoare triple {52290#false} assume !(0 == ~cond); {52290#false} is VALID [2022-04-08 03:55:37,204 INFO L290 TraceCheckUtils]: 125: Hoare triple {52290#false} assume true; {52290#false} is VALID [2022-04-08 03:55:37,204 INFO L284 TraceCheckUtils]: 126: Hoare quadruple {52290#false} {52290#false} #120#return; {52290#false} is VALID [2022-04-08 03:55:37,204 INFO L290 TraceCheckUtils]: 127: Hoare triple {52290#false} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {52290#false} is VALID [2022-04-08 03:55:37,204 INFO L290 TraceCheckUtils]: 128: Hoare triple {52290#false} assume !(0 != #t~nondet5);havoc #t~nondet5; {52290#false} is VALID [2022-04-08 03:55:37,205 INFO L272 TraceCheckUtils]: 129: Hoare triple {52290#false} call __VERIFIER_assert((if 1 <= ~i~0 then 1 else 0)); {52290#false} is VALID [2022-04-08 03:55:37,205 INFO L290 TraceCheckUtils]: 130: Hoare triple {52290#false} ~cond := #in~cond; {52290#false} is VALID [2022-04-08 03:55:37,205 INFO L290 TraceCheckUtils]: 131: Hoare triple {52290#false} assume !(0 == ~cond); {52290#false} is VALID [2022-04-08 03:55:37,205 INFO L290 TraceCheckUtils]: 132: Hoare triple {52290#false} assume true; {52290#false} is VALID [2022-04-08 03:55:37,205 INFO L284 TraceCheckUtils]: 133: Hoare quadruple {52290#false} {52290#false} #122#return; {52290#false} is VALID [2022-04-08 03:55:37,205 INFO L272 TraceCheckUtils]: 134: Hoare triple {52290#false} call __VERIFIER_assert((if ~i~0 <= ~n~0 then 1 else 0)); {52290#false} is VALID [2022-04-08 03:55:37,205 INFO L290 TraceCheckUtils]: 135: Hoare triple {52290#false} ~cond := #in~cond; {52290#false} is VALID [2022-04-08 03:55:37,205 INFO L290 TraceCheckUtils]: 136: Hoare triple {52290#false} assume !(0 == ~cond); {52290#false} is VALID [2022-04-08 03:55:37,205 INFO L290 TraceCheckUtils]: 137: Hoare triple {52290#false} assume true; {52290#false} is VALID [2022-04-08 03:55:37,205 INFO L284 TraceCheckUtils]: 138: Hoare quadruple {52290#false} {52290#false} #124#return; {52290#false} is VALID [2022-04-08 03:55:37,205 INFO L272 TraceCheckUtils]: 139: Hoare triple {52290#false} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {52290#false} is VALID [2022-04-08 03:55:37,206 INFO L290 TraceCheckUtils]: 140: Hoare triple {52290#false} ~cond := #in~cond; {52290#false} is VALID [2022-04-08 03:55:37,206 INFO L290 TraceCheckUtils]: 141: Hoare triple {52290#false} assume !(0 == ~cond); {52290#false} is VALID [2022-04-08 03:55:37,206 INFO L290 TraceCheckUtils]: 142: Hoare triple {52290#false} assume true; {52290#false} is VALID [2022-04-08 03:55:37,206 INFO L284 TraceCheckUtils]: 143: Hoare quadruple {52290#false} {52290#false} #126#return; {52290#false} is VALID [2022-04-08 03:55:37,206 INFO L272 TraceCheckUtils]: 144: Hoare triple {52290#false} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {52290#false} is VALID [2022-04-08 03:55:37,206 INFO L290 TraceCheckUtils]: 145: Hoare triple {52290#false} ~cond := #in~cond; {52290#false} is VALID [2022-04-08 03:55:37,206 INFO L290 TraceCheckUtils]: 146: Hoare triple {52290#false} assume !(0 == ~cond); {52290#false} is VALID [2022-04-08 03:55:37,206 INFO L290 TraceCheckUtils]: 147: Hoare triple {52290#false} assume true; {52290#false} is VALID [2022-04-08 03:55:37,206 INFO L284 TraceCheckUtils]: 148: Hoare quadruple {52290#false} {52290#false} #128#return; {52290#false} is VALID [2022-04-08 03:55:37,206 INFO L290 TraceCheckUtils]: 149: Hoare triple {52290#false} ~i~0 := ~j~0;~j~0 := 2 * ~j~0; {52290#false} is VALID [2022-04-08 03:55:37,207 INFO L290 TraceCheckUtils]: 150: Hoare triple {52290#false} assume !!(~j~0 <= ~r~0); {52290#false} is VALID [2022-04-08 03:55:37,207 INFO L290 TraceCheckUtils]: 151: Hoare triple {52290#false} assume !(~j~0 < ~r~0); {52290#false} is VALID [2022-04-08 03:55:37,207 INFO L272 TraceCheckUtils]: 152: Hoare triple {52290#false} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {52290#false} is VALID [2022-04-08 03:55:37,207 INFO L290 TraceCheckUtils]: 153: Hoare triple {52290#false} ~cond := #in~cond; {52290#false} is VALID [2022-04-08 03:55:37,207 INFO L290 TraceCheckUtils]: 154: Hoare triple {52290#false} assume !(0 == ~cond); {52290#false} is VALID [2022-04-08 03:55:37,207 INFO L290 TraceCheckUtils]: 155: Hoare triple {52290#false} assume true; {52290#false} is VALID [2022-04-08 03:55:37,207 INFO L284 TraceCheckUtils]: 156: Hoare quadruple {52290#false} {52290#false} #118#return; {52290#false} is VALID [2022-04-08 03:55:37,207 INFO L272 TraceCheckUtils]: 157: Hoare triple {52290#false} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {52290#false} is VALID [2022-04-08 03:55:37,207 INFO L290 TraceCheckUtils]: 158: Hoare triple {52290#false} ~cond := #in~cond; {52290#false} is VALID [2022-04-08 03:55:37,207 INFO L290 TraceCheckUtils]: 159: Hoare triple {52290#false} assume !(0 == ~cond); {52290#false} is VALID [2022-04-08 03:55:37,208 INFO L290 TraceCheckUtils]: 160: Hoare triple {52290#false} assume true; {52290#false} is VALID [2022-04-08 03:55:37,208 INFO L284 TraceCheckUtils]: 161: Hoare quadruple {52290#false} {52290#false} #120#return; {52290#false} is VALID [2022-04-08 03:55:37,208 INFO L290 TraceCheckUtils]: 162: Hoare triple {52290#false} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {52290#false} is VALID [2022-04-08 03:55:37,208 INFO L290 TraceCheckUtils]: 163: Hoare triple {52290#false} assume !(0 != #t~nondet5);havoc #t~nondet5; {52290#false} is VALID [2022-04-08 03:55:37,208 INFO L272 TraceCheckUtils]: 164: Hoare triple {52290#false} call __VERIFIER_assert((if 1 <= ~i~0 then 1 else 0)); {52290#false} is VALID [2022-04-08 03:55:37,208 INFO L290 TraceCheckUtils]: 165: Hoare triple {52290#false} ~cond := #in~cond; {52290#false} is VALID [2022-04-08 03:55:37,208 INFO L290 TraceCheckUtils]: 166: Hoare triple {52290#false} assume !(0 == ~cond); {52290#false} is VALID [2022-04-08 03:55:37,208 INFO L290 TraceCheckUtils]: 167: Hoare triple {52290#false} assume true; {52290#false} is VALID [2022-04-08 03:55:37,208 INFO L284 TraceCheckUtils]: 168: Hoare quadruple {52290#false} {52290#false} #122#return; {52290#false} is VALID [2022-04-08 03:55:37,208 INFO L272 TraceCheckUtils]: 169: Hoare triple {52290#false} call __VERIFIER_assert((if ~i~0 <= ~n~0 then 1 else 0)); {52290#false} is VALID [2022-04-08 03:55:37,209 INFO L290 TraceCheckUtils]: 170: Hoare triple {52290#false} ~cond := #in~cond; {52290#false} is VALID [2022-04-08 03:55:37,209 INFO L290 TraceCheckUtils]: 171: Hoare triple {52290#false} assume 0 == ~cond; {52290#false} is VALID [2022-04-08 03:55:37,209 INFO L290 TraceCheckUtils]: 172: Hoare triple {52290#false} assume !false; {52290#false} is VALID [2022-04-08 03:55:37,209 INFO L134 CoverageAnalysis]: Checked inductivity of 1510 backedges. 794 proven. 8 refuted. 0 times theorem prover too weak. 708 trivial. 0 not checked. [2022-04-08 03:55:37,209 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 03:55:38,169 INFO L290 TraceCheckUtils]: 172: Hoare triple {52290#false} assume !false; {52290#false} is VALID [2022-04-08 03:55:38,169 INFO L290 TraceCheckUtils]: 171: Hoare triple {52290#false} assume 0 == ~cond; {52290#false} is VALID [2022-04-08 03:55:38,169 INFO L290 TraceCheckUtils]: 170: Hoare triple {52290#false} ~cond := #in~cond; {52290#false} is VALID [2022-04-08 03:55:38,169 INFO L272 TraceCheckUtils]: 169: Hoare triple {52290#false} call __VERIFIER_assert((if ~i~0 <= ~n~0 then 1 else 0)); {52290#false} is VALID [2022-04-08 03:55:38,170 INFO L284 TraceCheckUtils]: 168: Hoare quadruple {52289#true} {52290#false} #122#return; {52290#false} is VALID [2022-04-08 03:55:38,170 INFO L290 TraceCheckUtils]: 167: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-08 03:55:38,170 INFO L290 TraceCheckUtils]: 166: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-08 03:55:38,170 INFO L290 TraceCheckUtils]: 165: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-08 03:55:38,170 INFO L272 TraceCheckUtils]: 164: Hoare triple {52290#false} call __VERIFIER_assert((if 1 <= ~i~0 then 1 else 0)); {52289#true} is VALID [2022-04-08 03:55:38,170 INFO L290 TraceCheckUtils]: 163: Hoare triple {52290#false} assume !(0 != #t~nondet5);havoc #t~nondet5; {52290#false} is VALID [2022-04-08 03:55:38,170 INFO L290 TraceCheckUtils]: 162: Hoare triple {52290#false} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {52290#false} is VALID [2022-04-08 03:55:38,170 INFO L284 TraceCheckUtils]: 161: Hoare quadruple {52289#true} {52290#false} #120#return; {52290#false} is VALID [2022-04-08 03:55:38,171 INFO L290 TraceCheckUtils]: 160: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-08 03:55:38,171 INFO L290 TraceCheckUtils]: 159: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-08 03:55:38,171 INFO L290 TraceCheckUtils]: 158: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-08 03:55:38,171 INFO L272 TraceCheckUtils]: 157: Hoare triple {52290#false} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {52289#true} is VALID [2022-04-08 03:55:38,171 INFO L284 TraceCheckUtils]: 156: Hoare quadruple {52289#true} {52290#false} #118#return; {52290#false} is VALID [2022-04-08 03:55:38,171 INFO L290 TraceCheckUtils]: 155: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-08 03:55:38,171 INFO L290 TraceCheckUtils]: 154: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-08 03:55:38,171 INFO L290 TraceCheckUtils]: 153: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-08 03:55:38,172 INFO L272 TraceCheckUtils]: 152: Hoare triple {52290#false} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {52289#true} is VALID [2022-04-08 03:55:38,172 INFO L290 TraceCheckUtils]: 151: Hoare triple {52290#false} assume !(~j~0 < ~r~0); {52290#false} is VALID [2022-04-08 03:55:38,172 INFO L290 TraceCheckUtils]: 150: Hoare triple {52290#false} assume !!(~j~0 <= ~r~0); {52290#false} is VALID [2022-04-08 03:55:38,172 INFO L290 TraceCheckUtils]: 149: Hoare triple {52290#false} ~i~0 := ~j~0;~j~0 := 2 * ~j~0; {52290#false} is VALID [2022-04-08 03:55:38,172 INFO L284 TraceCheckUtils]: 148: Hoare quadruple {52289#true} {52290#false} #128#return; {52290#false} is VALID [2022-04-08 03:55:38,172 INFO L290 TraceCheckUtils]: 147: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-08 03:55:38,172 INFO L290 TraceCheckUtils]: 146: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-08 03:55:38,173 INFO L290 TraceCheckUtils]: 145: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-08 03:55:38,173 INFO L272 TraceCheckUtils]: 144: Hoare triple {52290#false} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {52289#true} is VALID [2022-04-08 03:55:38,173 INFO L284 TraceCheckUtils]: 143: Hoare quadruple {52289#true} {52290#false} #126#return; {52290#false} is VALID [2022-04-08 03:55:38,173 INFO L290 TraceCheckUtils]: 142: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-08 03:55:38,173 INFO L290 TraceCheckUtils]: 141: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-08 03:55:38,173 INFO L290 TraceCheckUtils]: 140: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-08 03:55:38,173 INFO L272 TraceCheckUtils]: 139: Hoare triple {52290#false} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {52289#true} is VALID [2022-04-08 03:55:38,173 INFO L284 TraceCheckUtils]: 138: Hoare quadruple {52289#true} {52290#false} #124#return; {52290#false} is VALID [2022-04-08 03:55:38,173 INFO L290 TraceCheckUtils]: 137: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-08 03:55:38,174 INFO L290 TraceCheckUtils]: 136: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-08 03:55:38,174 INFO L290 TraceCheckUtils]: 135: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-08 03:55:38,174 INFO L272 TraceCheckUtils]: 134: Hoare triple {52290#false} call __VERIFIER_assert((if ~i~0 <= ~n~0 then 1 else 0)); {52289#true} is VALID [2022-04-08 03:55:38,174 INFO L284 TraceCheckUtils]: 133: Hoare quadruple {52289#true} {52290#false} #122#return; {52290#false} is VALID [2022-04-08 03:55:38,174 INFO L290 TraceCheckUtils]: 132: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-08 03:55:38,174 INFO L290 TraceCheckUtils]: 131: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-08 03:55:38,174 INFO L290 TraceCheckUtils]: 130: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-08 03:55:38,174 INFO L272 TraceCheckUtils]: 129: Hoare triple {52290#false} call __VERIFIER_assert((if 1 <= ~i~0 then 1 else 0)); {52289#true} is VALID [2022-04-08 03:55:38,174 INFO L290 TraceCheckUtils]: 128: Hoare triple {52290#false} assume !(0 != #t~nondet5);havoc #t~nondet5; {52290#false} is VALID [2022-04-08 03:55:38,174 INFO L290 TraceCheckUtils]: 127: Hoare triple {52290#false} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {52290#false} is VALID [2022-04-08 03:55:38,175 INFO L284 TraceCheckUtils]: 126: Hoare quadruple {52289#true} {52290#false} #120#return; {52290#false} is VALID [2022-04-08 03:55:38,175 INFO L290 TraceCheckUtils]: 125: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-08 03:55:38,175 INFO L290 TraceCheckUtils]: 124: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-08 03:55:38,175 INFO L290 TraceCheckUtils]: 123: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-08 03:55:38,175 INFO L272 TraceCheckUtils]: 122: Hoare triple {52290#false} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {52289#true} is VALID [2022-04-08 03:55:38,175 INFO L284 TraceCheckUtils]: 121: Hoare quadruple {52289#true} {52290#false} #118#return; {52290#false} is VALID [2022-04-08 03:55:38,175 INFO L290 TraceCheckUtils]: 120: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-08 03:55:38,175 INFO L290 TraceCheckUtils]: 119: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-08 03:55:38,175 INFO L290 TraceCheckUtils]: 118: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-08 03:55:38,176 INFO L272 TraceCheckUtils]: 117: Hoare triple {52290#false} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {52289#true} is VALID [2022-04-08 03:55:38,176 INFO L290 TraceCheckUtils]: 116: Hoare triple {52290#false} assume 0 != #t~nondet4;havoc #t~nondet4;~j~0 := 1 + ~j~0; {52290#false} is VALID [2022-04-08 03:55:38,176 INFO L290 TraceCheckUtils]: 115: Hoare triple {52290#false} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {52290#false} is VALID [2022-04-08 03:55:38,176 INFO L284 TraceCheckUtils]: 114: Hoare quadruple {52289#true} {52290#false} #116#return; {52290#false} is VALID [2022-04-08 03:55:38,176 INFO L290 TraceCheckUtils]: 113: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-08 03:55:38,176 INFO L290 TraceCheckUtils]: 112: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-08 03:55:38,176 INFO L290 TraceCheckUtils]: 111: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-08 03:55:38,176 INFO L272 TraceCheckUtils]: 110: Hoare triple {52290#false} call __VERIFIER_assert((if 1 + ~j~0 <= ~n~0 then 1 else 0)); {52289#true} is VALID [2022-04-08 03:55:38,176 INFO L284 TraceCheckUtils]: 109: Hoare quadruple {52289#true} {52290#false} #114#return; {52290#false} is VALID [2022-04-08 03:55:38,177 INFO L290 TraceCheckUtils]: 108: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-08 03:55:38,177 INFO L290 TraceCheckUtils]: 107: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-08 03:55:38,177 INFO L290 TraceCheckUtils]: 106: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-08 03:55:38,177 INFO L272 TraceCheckUtils]: 105: Hoare triple {52290#false} call __VERIFIER_assert((if 1 <= 1 + ~j~0 then 1 else 0)); {52289#true} is VALID [2022-04-08 03:55:38,177 INFO L284 TraceCheckUtils]: 104: Hoare quadruple {52289#true} {52290#false} #112#return; {52290#false} is VALID [2022-04-08 03:55:38,177 INFO L290 TraceCheckUtils]: 103: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-08 03:55:38,177 INFO L290 TraceCheckUtils]: 102: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-08 03:55:38,177 INFO L290 TraceCheckUtils]: 101: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-08 03:55:38,177 INFO L272 TraceCheckUtils]: 100: Hoare triple {52290#false} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {52289#true} is VALID [2022-04-08 03:55:38,177 INFO L284 TraceCheckUtils]: 99: Hoare quadruple {52289#true} {52290#false} #110#return; {52290#false} is VALID [2022-04-08 03:55:38,178 INFO L290 TraceCheckUtils]: 98: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-08 03:55:38,178 INFO L290 TraceCheckUtils]: 97: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-08 03:55:38,178 INFO L290 TraceCheckUtils]: 96: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-08 03:55:38,178 INFO L272 TraceCheckUtils]: 95: Hoare triple {52290#false} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {52289#true} is VALID [2022-04-08 03:55:38,178 INFO L290 TraceCheckUtils]: 94: Hoare triple {53168#(not (< main_~j~0 main_~r~0))} assume ~j~0 < ~r~0; {52290#false} is VALID [2022-04-08 03:55:38,179 INFO L290 TraceCheckUtils]: 93: Hoare triple {53168#(not (< main_~j~0 main_~r~0))} assume !!(~j~0 <= ~r~0); {53168#(not (< main_~j~0 main_~r~0))} is VALID [2022-04-08 03:55:38,179 INFO L290 TraceCheckUtils]: 92: Hoare triple {53175#(<= main_~r~0 (* main_~j~0 2))} ~i~0 := ~j~0;~j~0 := 2 * ~j~0; {53168#(not (< main_~j~0 main_~r~0))} is VALID [2022-04-08 03:55:38,180 INFO L284 TraceCheckUtils]: 91: Hoare quadruple {52289#true} {53175#(<= main_~r~0 (* main_~j~0 2))} #128#return; {53175#(<= main_~r~0 (* main_~j~0 2))} is VALID [2022-04-08 03:55:38,180 INFO L290 TraceCheckUtils]: 90: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-08 03:55:38,180 INFO L290 TraceCheckUtils]: 89: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-08 03:55:38,180 INFO L290 TraceCheckUtils]: 88: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-08 03:55:38,180 INFO L272 TraceCheckUtils]: 87: Hoare triple {53175#(<= main_~r~0 (* main_~j~0 2))} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {52289#true} is VALID [2022-04-08 03:55:38,181 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {52289#true} {53175#(<= main_~r~0 (* main_~j~0 2))} #126#return; {53175#(<= main_~r~0 (* main_~j~0 2))} is VALID [2022-04-08 03:55:38,181 INFO L290 TraceCheckUtils]: 85: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-08 03:55:38,181 INFO L290 TraceCheckUtils]: 84: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-08 03:55:38,181 INFO L290 TraceCheckUtils]: 83: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-08 03:55:38,181 INFO L272 TraceCheckUtils]: 82: Hoare triple {53175#(<= main_~r~0 (* main_~j~0 2))} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {52289#true} is VALID [2022-04-08 03:55:38,182 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {52289#true} {53175#(<= main_~r~0 (* main_~j~0 2))} #124#return; {53175#(<= main_~r~0 (* main_~j~0 2))} is VALID [2022-04-08 03:55:38,182 INFO L290 TraceCheckUtils]: 80: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-08 03:55:38,182 INFO L290 TraceCheckUtils]: 79: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-08 03:55:38,182 INFO L290 TraceCheckUtils]: 78: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-08 03:55:38,182 INFO L272 TraceCheckUtils]: 77: Hoare triple {53175#(<= main_~r~0 (* main_~j~0 2))} call __VERIFIER_assert((if ~i~0 <= ~n~0 then 1 else 0)); {52289#true} is VALID [2022-04-08 03:55:38,183 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {52289#true} {53175#(<= main_~r~0 (* main_~j~0 2))} #122#return; {53175#(<= main_~r~0 (* main_~j~0 2))} is VALID [2022-04-08 03:55:38,183 INFO L290 TraceCheckUtils]: 75: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-08 03:55:38,183 INFO L290 TraceCheckUtils]: 74: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-08 03:55:38,183 INFO L290 TraceCheckUtils]: 73: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-08 03:55:38,183 INFO L272 TraceCheckUtils]: 72: Hoare triple {53175#(<= main_~r~0 (* main_~j~0 2))} call __VERIFIER_assert((if 1 <= ~i~0 then 1 else 0)); {52289#true} is VALID [2022-04-08 03:55:38,183 INFO L290 TraceCheckUtils]: 71: Hoare triple {53175#(<= main_~r~0 (* main_~j~0 2))} assume !(0 != #t~nondet5);havoc #t~nondet5; {53175#(<= main_~r~0 (* main_~j~0 2))} is VALID [2022-04-08 03:55:38,184 INFO L290 TraceCheckUtils]: 70: Hoare triple {53175#(<= main_~r~0 (* main_~j~0 2))} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {53175#(<= main_~r~0 (* main_~j~0 2))} is VALID [2022-04-08 03:55:38,184 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {52289#true} {53175#(<= main_~r~0 (* main_~j~0 2))} #120#return; {53175#(<= main_~r~0 (* main_~j~0 2))} is VALID [2022-04-08 03:55:38,184 INFO L290 TraceCheckUtils]: 68: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-08 03:55:38,184 INFO L290 TraceCheckUtils]: 67: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-08 03:55:38,184 INFO L290 TraceCheckUtils]: 66: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-08 03:55:38,185 INFO L272 TraceCheckUtils]: 65: Hoare triple {53175#(<= main_~r~0 (* main_~j~0 2))} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {52289#true} is VALID [2022-04-08 03:55:38,185 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {52289#true} {53175#(<= main_~r~0 (* main_~j~0 2))} #118#return; {53175#(<= main_~r~0 (* main_~j~0 2))} is VALID [2022-04-08 03:55:38,185 INFO L290 TraceCheckUtils]: 63: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-08 03:55:38,185 INFO L290 TraceCheckUtils]: 62: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-08 03:55:38,185 INFO L290 TraceCheckUtils]: 61: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-08 03:55:38,185 INFO L272 TraceCheckUtils]: 60: Hoare triple {53175#(<= main_~r~0 (* main_~j~0 2))} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {52289#true} is VALID [2022-04-08 03:55:38,186 INFO L290 TraceCheckUtils]: 59: Hoare triple {53175#(<= main_~r~0 (* main_~j~0 2))} assume !(0 != #t~nondet4);havoc #t~nondet4; {53175#(<= main_~r~0 (* main_~j~0 2))} is VALID [2022-04-08 03:55:38,186 INFO L290 TraceCheckUtils]: 58: Hoare triple {53175#(<= main_~r~0 (* main_~j~0 2))} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {53175#(<= main_~r~0 (* main_~j~0 2))} is VALID [2022-04-08 03:55:38,187 INFO L284 TraceCheckUtils]: 57: Hoare quadruple {52289#true} {53175#(<= main_~r~0 (* main_~j~0 2))} #116#return; {53175#(<= main_~r~0 (* main_~j~0 2))} is VALID [2022-04-08 03:55:38,187 INFO L290 TraceCheckUtils]: 56: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-08 03:55:38,187 INFO L290 TraceCheckUtils]: 55: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-08 03:55:38,187 INFO L290 TraceCheckUtils]: 54: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-08 03:55:38,187 INFO L272 TraceCheckUtils]: 53: Hoare triple {53175#(<= main_~r~0 (* main_~j~0 2))} call __VERIFIER_assert((if 1 + ~j~0 <= ~n~0 then 1 else 0)); {52289#true} is VALID [2022-04-08 03:55:38,188 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {52289#true} {53175#(<= main_~r~0 (* main_~j~0 2))} #114#return; {53175#(<= main_~r~0 (* main_~j~0 2))} is VALID [2022-04-08 03:55:38,188 INFO L290 TraceCheckUtils]: 51: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-08 03:55:38,188 INFO L290 TraceCheckUtils]: 50: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-08 03:55:38,188 INFO L290 TraceCheckUtils]: 49: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-08 03:55:38,188 INFO L272 TraceCheckUtils]: 48: Hoare triple {53175#(<= main_~r~0 (* main_~j~0 2))} call __VERIFIER_assert((if 1 <= 1 + ~j~0 then 1 else 0)); {52289#true} is VALID [2022-04-08 03:55:38,189 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {52289#true} {53175#(<= main_~r~0 (* main_~j~0 2))} #112#return; {53175#(<= main_~r~0 (* main_~j~0 2))} is VALID [2022-04-08 03:55:38,189 INFO L290 TraceCheckUtils]: 46: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-08 03:55:38,189 INFO L290 TraceCheckUtils]: 45: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-08 03:55:38,189 INFO L290 TraceCheckUtils]: 44: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-08 03:55:38,189 INFO L272 TraceCheckUtils]: 43: Hoare triple {53175#(<= main_~r~0 (* main_~j~0 2))} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {52289#true} is VALID [2022-04-08 03:55:38,189 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {52289#true} {53175#(<= main_~r~0 (* main_~j~0 2))} #110#return; {53175#(<= main_~r~0 (* main_~j~0 2))} is VALID [2022-04-08 03:55:38,190 INFO L290 TraceCheckUtils]: 41: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-08 03:55:38,190 INFO L290 TraceCheckUtils]: 40: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-08 03:55:38,190 INFO L290 TraceCheckUtils]: 39: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-08 03:55:38,190 INFO L272 TraceCheckUtils]: 38: Hoare triple {53175#(<= main_~r~0 (* main_~j~0 2))} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {52289#true} is VALID [2022-04-08 03:55:38,190 INFO L290 TraceCheckUtils]: 37: Hoare triple {53175#(<= main_~r~0 (* main_~j~0 2))} assume ~j~0 < ~r~0; {53175#(<= main_~r~0 (* main_~j~0 2))} is VALID [2022-04-08 03:55:38,191 INFO L290 TraceCheckUtils]: 36: Hoare triple {53175#(<= main_~r~0 (* main_~j~0 2))} assume !!(~j~0 <= ~r~0); {53175#(<= main_~r~0 (* main_~j~0 2))} is VALID [2022-04-08 03:55:38,191 INFO L290 TraceCheckUtils]: 35: Hoare triple {53347#(<= (div (- main_~r~0) (- 2)) (* main_~l~0 2))} assume !!(~r~0 > 1);~i~0 := ~l~0;~j~0 := 2 * ~l~0; {53175#(<= main_~r~0 (* main_~j~0 2))} is VALID [2022-04-08 03:55:38,192 INFO L290 TraceCheckUtils]: 34: Hoare triple {53351#(<= (+ (div (- (div (* (- 1) main_~r~0) (- 2))) (- 2)) 1) main_~l~0)} #t~post6 := ~l~0;~l~0 := #t~post6 - 1;havoc #t~post6; {53347#(<= (div (- main_~r~0) (- 2)) (* main_~l~0 2))} is VALID [2022-04-08 03:55:38,192 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {52289#true} {53351#(<= (+ (div (- (div (* (- 1) main_~r~0) (- 2))) (- 2)) 1) main_~l~0)} #132#return; {53351#(<= (+ (div (- (div (* (- 1) main_~r~0) (- 2))) (- 2)) 1) main_~l~0)} is VALID [2022-04-08 03:55:38,193 INFO L290 TraceCheckUtils]: 32: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-08 03:55:38,193 INFO L290 TraceCheckUtils]: 31: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-08 03:55:38,193 INFO L290 TraceCheckUtils]: 30: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-08 03:55:38,193 INFO L272 TraceCheckUtils]: 29: Hoare triple {53351#(<= (+ (div (- (div (* (- 1) main_~r~0) (- 2))) (- 2)) 1) main_~l~0)} call __VERIFIER_assert((if ~l~0 <= ~n~0 then 1 else 0)); {52289#true} is VALID [2022-04-08 03:55:38,193 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {52289#true} {53351#(<= (+ (div (- (div (* (- 1) main_~r~0) (- 2))) (- 2)) 1) main_~l~0)} #130#return; {53351#(<= (+ (div (- (div (* (- 1) main_~r~0) (- 2))) (- 2)) 1) main_~l~0)} is VALID [2022-04-08 03:55:38,193 INFO L290 TraceCheckUtils]: 27: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-08 03:55:38,194 INFO L290 TraceCheckUtils]: 26: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-08 03:55:38,194 INFO L290 TraceCheckUtils]: 25: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-08 03:55:38,194 INFO L272 TraceCheckUtils]: 24: Hoare triple {53351#(<= (+ (div (- (div (* (- 1) main_~r~0) (- 2))) (- 2)) 1) main_~l~0)} call __VERIFIER_assert((if 1 <= ~l~0 then 1 else 0)); {52289#true} is VALID [2022-04-08 03:55:38,194 INFO L290 TraceCheckUtils]: 23: Hoare triple {53385#(or (not (< 1 main_~l~0)) (<= (+ (div (- (div (* (- 1) main_~r~0) (- 2))) (- 2)) 1) main_~l~0))} assume ~l~0 > 1; {53351#(<= (+ (div (- (div (* (- 1) main_~r~0) (- 2))) (- 2)) 1) main_~l~0)} is VALID [2022-04-08 03:55:38,195 INFO L290 TraceCheckUtils]: 22: Hoare triple {53385#(or (not (< 1 main_~l~0)) (<= (+ (div (- (div (* (- 1) main_~r~0) (- 2))) (- 2)) 1) main_~l~0))} assume 0 != #t~nondet5;havoc #t~nondet5; {53385#(or (not (< 1 main_~l~0)) (<= (+ (div (- (div (* (- 1) main_~r~0) (- 2))) (- 2)) 1) main_~l~0))} is VALID [2022-04-08 03:55:38,195 INFO L290 TraceCheckUtils]: 21: Hoare triple {53385#(or (not (< 1 main_~l~0)) (<= (+ (div (- (div (* (- 1) main_~r~0) (- 2))) (- 2)) 1) main_~l~0))} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {53385#(or (not (< 1 main_~l~0)) (<= (+ (div (- (div (* (- 1) main_~r~0) (- 2))) (- 2)) 1) main_~l~0))} is VALID [2022-04-08 03:55:38,196 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {52289#true} {53385#(or (not (< 1 main_~l~0)) (<= (+ (div (- (div (* (- 1) main_~r~0) (- 2))) (- 2)) 1) main_~l~0))} #120#return; {53385#(or (not (< 1 main_~l~0)) (<= (+ (div (- (div (* (- 1) main_~r~0) (- 2))) (- 2)) 1) main_~l~0))} is VALID [2022-04-08 03:55:38,196 INFO L290 TraceCheckUtils]: 19: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-08 03:55:38,196 INFO L290 TraceCheckUtils]: 18: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-08 03:55:38,196 INFO L290 TraceCheckUtils]: 17: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-08 03:55:38,196 INFO L272 TraceCheckUtils]: 16: Hoare triple {53385#(or (not (< 1 main_~l~0)) (<= (+ (div (- (div (* (- 1) main_~r~0) (- 2))) (- 2)) 1) main_~l~0))} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {52289#true} is VALID [2022-04-08 03:55:38,196 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {52289#true} {53385#(or (not (< 1 main_~l~0)) (<= (+ (div (- (div (* (- 1) main_~r~0) (- 2))) (- 2)) 1) main_~l~0))} #118#return; {53385#(or (not (< 1 main_~l~0)) (<= (+ (div (- (div (* (- 1) main_~r~0) (- 2))) (- 2)) 1) main_~l~0))} is VALID [2022-04-08 03:55:38,197 INFO L290 TraceCheckUtils]: 14: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-08 03:55:38,197 INFO L290 TraceCheckUtils]: 13: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-08 03:55:38,197 INFO L290 TraceCheckUtils]: 12: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-08 03:55:38,197 INFO L272 TraceCheckUtils]: 11: Hoare triple {53385#(or (not (< 1 main_~l~0)) (<= (+ (div (- (div (* (- 1) main_~r~0) (- 2))) (- 2)) 1) main_~l~0))} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {52289#true} is VALID [2022-04-08 03:55:38,197 INFO L290 TraceCheckUtils]: 10: Hoare triple {53425#(or (<= (div (+ (- 1) (div (+ (- 2) (* (- 1) main_~j~0)) 2)) (- 2)) main_~l~0) (not (< 1 main_~l~0)))} assume !(~j~0 < ~r~0); {53385#(or (not (< 1 main_~l~0)) (<= (+ (div (- (div (* (- 1) main_~r~0) (- 2))) (- 2)) 1) main_~l~0))} is VALID [2022-04-08 03:55:38,198 INFO L290 TraceCheckUtils]: 9: Hoare triple {53425#(or (<= (div (+ (- 1) (div (+ (- 2) (* (- 1) main_~j~0)) 2)) (- 2)) main_~l~0) (not (< 1 main_~l~0)))} assume !!(~j~0 <= ~r~0); {53425#(or (<= (div (+ (- 1) (div (+ (- 2) (* (- 1) main_~j~0)) 2)) (- 2)) main_~l~0) (not (< 1 main_~l~0)))} is VALID [2022-04-08 03:55:38,198 INFO L290 TraceCheckUtils]: 8: Hoare triple {52289#true} assume !!(~r~0 > 1);~i~0 := ~l~0;~j~0 := 2 * ~l~0; {53425#(or (<= (div (+ (- 1) (div (+ (- 2) (* (- 1) main_~j~0)) 2)) (- 2)) main_~l~0) (not (< 1 main_~l~0)))} is VALID [2022-04-08 03:55:38,199 INFO L290 TraceCheckUtils]: 7: Hoare triple {52289#true} assume ~l~0 > 1;#t~post2 := ~l~0;~l~0 := #t~post2 - 1;havoc #t~post2; {52289#true} is VALID [2022-04-08 03:55:38,199 INFO L290 TraceCheckUtils]: 6: Hoare triple {52289#true} assume !!(1 <= ~n~0 && ~n~0 <= 1000000);~l~0 := 1 + (if ~n~0 < 0 && 0 != ~n~0 % 2 then 1 + ~n~0 / 2 else ~n~0 / 2);~r~0 := ~n~0; {52289#true} is VALID [2022-04-08 03:55:38,199 INFO L290 TraceCheckUtils]: 5: Hoare triple {52289#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;havoc ~n~0;havoc ~l~0;havoc ~r~0;havoc ~i~0;havoc ~j~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {52289#true} is VALID [2022-04-08 03:55:38,199 INFO L272 TraceCheckUtils]: 4: Hoare triple {52289#true} call #t~ret8 := main(#in~argc, #in~argv.base, #in~argv.offset); {52289#true} is VALID [2022-04-08 03:55:38,199 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {52289#true} {52289#true} #138#return; {52289#true} is VALID [2022-04-08 03:55:38,199 INFO L290 TraceCheckUtils]: 2: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-08 03:55:38,199 INFO L290 TraceCheckUtils]: 1: Hoare triple {52289#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(9, 2); {52289#true} is VALID [2022-04-08 03:55:38,199 INFO L272 TraceCheckUtils]: 0: Hoare triple {52289#true} call ULTIMATE.init(); {52289#true} is VALID [2022-04-08 03:55:38,200 INFO L134 CoverageAnalysis]: Checked inductivity of 1510 backedges. 90 proven. 10 refuted. 0 times theorem prover too weak. 1410 trivial. 0 not checked. [2022-04-08 03:55:38,200 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1844609610] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 03:55:38,200 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 03:55:38,200 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 8] total 21 [2022-04-08 03:55:38,200 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 03:55:38,201 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2140864721] [2022-04-08 03:55:38,201 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2140864721] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 03:55:38,201 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 03:55:38,201 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-08 03:55:38,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1325298123] [2022-04-08 03:55:38,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 03:55:38,201 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 10 states have internal predecessors, (37), 7 states have call successors, (30), 3 states have call predecessors, (30), 1 states have return successors, (28), 7 states have call predecessors, (28), 7 states have call successors, (28) Word has length 173 [2022-04-08 03:55:38,202 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 03:55:38,202 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 10 states have internal predecessors, (37), 7 states have call successors, (30), 3 states have call predecessors, (30), 1 states have return successors, (28), 7 states have call predecessors, (28), 7 states have call successors, (28) [2022-04-08 03:55:38,275 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 95 edges. 95 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:55:38,275 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-08 03:55:38,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 03:55:38,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-08 03:55:38,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=356, Unknown=0, NotChecked=0, Total=420 [2022-04-08 03:55:38,276 INFO L87 Difference]: Start difference. First operand 213 states and 280 transitions. Second operand has 11 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 10 states have internal predecessors, (37), 7 states have call successors, (30), 3 states have call predecessors, (30), 1 states have return successors, (28), 7 states have call predecessors, (28), 7 states have call successors, (28) [2022-04-08 03:55:42,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:55:42,295 INFO L93 Difference]: Finished difference Result 399 states and 535 transitions. [2022-04-08 03:55:42,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-08 03:55:42,295 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 10 states have internal predecessors, (37), 7 states have call successors, (30), 3 states have call predecessors, (30), 1 states have return successors, (28), 7 states have call predecessors, (28), 7 states have call successors, (28) Word has length 173 [2022-04-08 03:55:42,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 03:55:42,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 10 states have internal predecessors, (37), 7 states have call successors, (30), 3 states have call predecessors, (30), 1 states have return successors, (28), 7 states have call predecessors, (28), 7 states have call successors, (28) [2022-04-08 03:55:42,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 223 transitions. [2022-04-08 03:55:42,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 10 states have internal predecessors, (37), 7 states have call successors, (30), 3 states have call predecessors, (30), 1 states have return successors, (28), 7 states have call predecessors, (28), 7 states have call successors, (28) [2022-04-08 03:55:42,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 223 transitions. [2022-04-08 03:55:42,300 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 223 transitions. [2022-04-08 03:55:42,426 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 223 edges. 223 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:55:42,430 INFO L225 Difference]: With dead ends: 399 [2022-04-08 03:55:42,430 INFO L226 Difference]: Without dead ends: 246 [2022-04-08 03:55:42,431 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 423 GetRequests, 392 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 170 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=188, Invalid=868, Unknown=0, NotChecked=0, Total=1056 [2022-04-08 03:55:42,432 INFO L913 BasicCegarLoop]: 67 mSDtfsCounter, 88 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 953 mSolverCounterSat, 230 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 1183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 230 IncrementalHoareTripleChecker+Valid, 953 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-04-08 03:55:42,432 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [88 Valid, 104 Invalid, 1183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [230 Valid, 953 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-04-08 03:55:42,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2022-04-08 03:55:43,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 211. [2022-04-08 03:55:43,846 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 03:55:43,846 INFO L82 GeneralOperation]: Start isEquivalent. First operand 246 states. Second operand has 211 states, 118 states have (on average 1.1610169491525424) internal successors, (137), 124 states have internal predecessors, (137), 70 states have call successors, (70), 23 states have call predecessors, (70), 22 states have return successors, (69), 63 states have call predecessors, (69), 69 states have call successors, (69) [2022-04-08 03:55:43,846 INFO L74 IsIncluded]: Start isIncluded. First operand 246 states. Second operand has 211 states, 118 states have (on average 1.1610169491525424) internal successors, (137), 124 states have internal predecessors, (137), 70 states have call successors, (70), 23 states have call predecessors, (70), 22 states have return successors, (69), 63 states have call predecessors, (69), 69 states have call successors, (69) [2022-04-08 03:55:43,846 INFO L87 Difference]: Start difference. First operand 246 states. Second operand has 211 states, 118 states have (on average 1.1610169491525424) internal successors, (137), 124 states have internal predecessors, (137), 70 states have call successors, (70), 23 states have call predecessors, (70), 22 states have return successors, (69), 63 states have call predecessors, (69), 69 states have call successors, (69) [2022-04-08 03:55:43,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:55:43,850 INFO L93 Difference]: Finished difference Result 246 states and 325 transitions. [2022-04-08 03:55:43,850 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 325 transitions. [2022-04-08 03:55:43,851 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:55:43,851 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:55:43,851 INFO L74 IsIncluded]: Start isIncluded. First operand has 211 states, 118 states have (on average 1.1610169491525424) internal successors, (137), 124 states have internal predecessors, (137), 70 states have call successors, (70), 23 states have call predecessors, (70), 22 states have return successors, (69), 63 states have call predecessors, (69), 69 states have call successors, (69) Second operand 246 states. [2022-04-08 03:55:43,851 INFO L87 Difference]: Start difference. First operand has 211 states, 118 states have (on average 1.1610169491525424) internal successors, (137), 124 states have internal predecessors, (137), 70 states have call successors, (70), 23 states have call predecessors, (70), 22 states have return successors, (69), 63 states have call predecessors, (69), 69 states have call successors, (69) Second operand 246 states. [2022-04-08 03:55:43,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:55:43,855 INFO L93 Difference]: Finished difference Result 246 states and 325 transitions. [2022-04-08 03:55:43,855 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 325 transitions. [2022-04-08 03:55:43,856 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:55:43,856 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:55:43,856 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 03:55:43,856 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 03:55:43,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 118 states have (on average 1.1610169491525424) internal successors, (137), 124 states have internal predecessors, (137), 70 states have call successors, (70), 23 states have call predecessors, (70), 22 states have return successors, (69), 63 states have call predecessors, (69), 69 states have call successors, (69) [2022-04-08 03:55:43,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 276 transitions. [2022-04-08 03:55:43,861 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 276 transitions. Word has length 173 [2022-04-08 03:55:43,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 03:55:43,861 INFO L478 AbstractCegarLoop]: Abstraction has 211 states and 276 transitions. [2022-04-08 03:55:43,861 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 10 states have internal predecessors, (37), 7 states have call successors, (30), 3 states have call predecessors, (30), 1 states have return successors, (28), 7 states have call predecessors, (28), 7 states have call successors, (28) [2022-04-08 03:55:43,861 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 211 states and 276 transitions. [2022-04-08 03:55:44,452 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 276 edges. 276 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:55:44,453 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 276 transitions. [2022-04-08 03:55:44,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2022-04-08 03:55:44,453 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 03:55:44,454 INFO L499 BasicCegarLoop]: trace histogram [28, 27, 27, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 03:55:44,470 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 03:55:44,654 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,SelfDestructingSolverStorable24 [2022-04-08 03:55:44,654 INFO L403 AbstractCegarLoop]: === Iteration 26 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 03:55:44,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 03:55:44,654 INFO L85 PathProgramCache]: Analyzing trace with hash 345153677, now seen corresponding path program 5 times [2022-04-08 03:55:44,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 03:55:44,655 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1397392961] [2022-04-08 03:55:44,655 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 03:55:44,655 INFO L85 PathProgramCache]: Analyzing trace with hash 345153677, now seen corresponding path program 6 times [2022-04-08 03:55:44,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 03:55:44,655 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [10631630] [2022-04-08 03:55:44,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 03:55:44,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 03:55:44,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:55:44,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 03:55:44,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:55:44,745 INFO L290 TraceCheckUtils]: 0: Hoare triple {55313#(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(9, 2); {55194#true} is VALID [2022-04-08 03:55:44,745 INFO L290 TraceCheckUtils]: 1: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-08 03:55:44,745 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {55194#true} {55194#true} #138#return; {55194#true} is VALID [2022-04-08 03:55:44,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-08 03:55:44,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:55:44,748 INFO L290 TraceCheckUtils]: 0: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-08 03:55:44,748 INFO L290 TraceCheckUtils]: 1: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-08 03:55:44,748 INFO L290 TraceCheckUtils]: 2: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-08 03:55:44,749 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {55194#true} {55200#(<= main_~r~0 (* main_~l~0 2))} #118#return; {55200#(<= main_~r~0 (* main_~l~0 2))} is VALID [2022-04-08 03:55:44,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-04-08 03:55:44,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:55:44,751 INFO L290 TraceCheckUtils]: 0: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-08 03:55:44,751 INFO L290 TraceCheckUtils]: 1: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-08 03:55:44,751 INFO L290 TraceCheckUtils]: 2: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-08 03:55:44,751 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {55194#true} {55200#(<= main_~r~0 (* main_~l~0 2))} #120#return; {55200#(<= main_~r~0 (* main_~l~0 2))} is VALID [2022-04-08 03:55:44,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-04-08 03:55:44,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:55:44,754 INFO L290 TraceCheckUtils]: 0: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-08 03:55:44,754 INFO L290 TraceCheckUtils]: 1: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-08 03:55:44,754 INFO L290 TraceCheckUtils]: 2: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-08 03:55:44,755 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {55194#true} {55209#(<= (+ main_~r~0 4) (* main_~l~0 4))} #130#return; {55209#(<= (+ main_~r~0 4) (* main_~l~0 4))} is VALID [2022-04-08 03:55:44,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-04-08 03:55:44,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:55:44,757 INFO L290 TraceCheckUtils]: 0: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-08 03:55:44,757 INFO L290 TraceCheckUtils]: 1: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-08 03:55:44,757 INFO L290 TraceCheckUtils]: 2: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-08 03:55:44,757 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {55194#true} {55209#(<= (+ main_~r~0 4) (* main_~l~0 4))} #132#return; {55209#(<= (+ main_~r~0 4) (* main_~l~0 4))} is VALID [2022-04-08 03:55:44,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-04-08 03:55:44,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:55:44,759 INFO L290 TraceCheckUtils]: 0: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-08 03:55:44,759 INFO L290 TraceCheckUtils]: 1: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-08 03:55:44,759 INFO L290 TraceCheckUtils]: 2: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-08 03:55:44,760 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {55194#true} {55219#(<= main_~r~0 (* main_~j~0 2))} #110#return; {55219#(<= main_~r~0 (* main_~j~0 2))} is VALID [2022-04-08 03:55:44,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-04-08 03:55:44,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:55:44,762 INFO L290 TraceCheckUtils]: 0: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-08 03:55:44,762 INFO L290 TraceCheckUtils]: 1: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-08 03:55:44,762 INFO L290 TraceCheckUtils]: 2: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-08 03:55:44,762 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {55194#true} {55219#(<= main_~r~0 (* main_~j~0 2))} #112#return; {55219#(<= main_~r~0 (* main_~j~0 2))} is VALID [2022-04-08 03:55:44,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-04-08 03:55:44,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:55:44,764 INFO L290 TraceCheckUtils]: 0: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-08 03:55:44,764 INFO L290 TraceCheckUtils]: 1: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-08 03:55:44,764 INFO L290 TraceCheckUtils]: 2: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-08 03:55:44,765 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {55194#true} {55219#(<= main_~r~0 (* main_~j~0 2))} #114#return; {55219#(<= main_~r~0 (* main_~j~0 2))} is VALID [2022-04-08 03:55:44,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-04-08 03:55:44,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:55:44,773 INFO L290 TraceCheckUtils]: 0: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-08 03:55:44,773 INFO L290 TraceCheckUtils]: 1: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-08 03:55:44,773 INFO L290 TraceCheckUtils]: 2: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-08 03:55:44,774 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {55194#true} {55219#(<= main_~r~0 (* main_~j~0 2))} #116#return; {55219#(<= main_~r~0 (* main_~j~0 2))} is VALID [2022-04-08 03:55:44,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-04-08 03:55:44,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:55:44,776 INFO L290 TraceCheckUtils]: 0: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-08 03:55:44,776 INFO L290 TraceCheckUtils]: 1: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-08 03:55:44,776 INFO L290 TraceCheckUtils]: 2: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-08 03:55:44,776 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {55194#true} {55219#(<= main_~r~0 (* main_~j~0 2))} #118#return; {55219#(<= main_~r~0 (* main_~j~0 2))} is VALID [2022-04-08 03:55:44,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-04-08 03:55:44,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:55:44,778 INFO L290 TraceCheckUtils]: 0: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-08 03:55:44,779 INFO L290 TraceCheckUtils]: 1: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-08 03:55:44,779 INFO L290 TraceCheckUtils]: 2: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-08 03:55:44,779 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {55194#true} {55219#(<= main_~r~0 (* main_~j~0 2))} #120#return; {55219#(<= main_~r~0 (* main_~j~0 2))} is VALID [2022-04-08 03:55:44,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-04-08 03:55:44,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:55:44,782 INFO L290 TraceCheckUtils]: 0: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-08 03:55:44,782 INFO L290 TraceCheckUtils]: 1: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-08 03:55:44,782 INFO L290 TraceCheckUtils]: 2: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-08 03:55:44,782 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {55194#true} {55219#(<= main_~r~0 (* main_~j~0 2))} #122#return; {55219#(<= main_~r~0 (* main_~j~0 2))} is VALID [2022-04-08 03:55:44,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-04-08 03:55:44,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:55:44,784 INFO L290 TraceCheckUtils]: 0: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-08 03:55:44,784 INFO L290 TraceCheckUtils]: 1: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-08 03:55:44,785 INFO L290 TraceCheckUtils]: 2: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-08 03:55:44,785 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {55194#true} {55219#(<= main_~r~0 (* main_~j~0 2))} #124#return; {55219#(<= main_~r~0 (* main_~j~0 2))} is VALID [2022-04-08 03:55:44,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-04-08 03:55:44,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:55:44,787 INFO L290 TraceCheckUtils]: 0: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-08 03:55:44,787 INFO L290 TraceCheckUtils]: 1: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-08 03:55:44,787 INFO L290 TraceCheckUtils]: 2: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-08 03:55:44,788 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {55194#true} {55219#(<= main_~r~0 (* main_~j~0 2))} #126#return; {55219#(<= main_~r~0 (* main_~j~0 2))} is VALID [2022-04-08 03:55:44,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-04-08 03:55:44,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:55:44,791 INFO L290 TraceCheckUtils]: 0: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-08 03:55:44,792 INFO L290 TraceCheckUtils]: 1: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-08 03:55:44,792 INFO L290 TraceCheckUtils]: 2: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-08 03:55:44,792 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {55194#true} {55219#(<= main_~r~0 (* main_~j~0 2))} #128#return; {55219#(<= main_~r~0 (* main_~j~0 2))} is VALID [2022-04-08 03:55:44,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-04-08 03:55:44,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:55:44,794 INFO L290 TraceCheckUtils]: 0: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-08 03:55:44,794 INFO L290 TraceCheckUtils]: 1: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-08 03:55:44,794 INFO L290 TraceCheckUtils]: 2: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-08 03:55:44,794 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {55194#true} {55195#false} #110#return; {55195#false} is VALID [2022-04-08 03:55:44,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-04-08 03:55:44,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:55:44,796 INFO L290 TraceCheckUtils]: 0: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-08 03:55:44,796 INFO L290 TraceCheckUtils]: 1: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-08 03:55:44,796 INFO L290 TraceCheckUtils]: 2: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-08 03:55:44,796 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {55194#true} {55195#false} #112#return; {55195#false} is VALID [2022-04-08 03:55:44,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-04-08 03:55:44,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:55:44,799 INFO L290 TraceCheckUtils]: 0: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-08 03:55:44,799 INFO L290 TraceCheckUtils]: 1: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-08 03:55:44,800 INFO L290 TraceCheckUtils]: 2: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-08 03:55:44,800 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {55194#true} {55195#false} #114#return; {55195#false} is VALID [2022-04-08 03:55:44,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-04-08 03:55:44,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:55:44,801 INFO L290 TraceCheckUtils]: 0: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-08 03:55:44,801 INFO L290 TraceCheckUtils]: 1: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-08 03:55:44,802 INFO L290 TraceCheckUtils]: 2: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-08 03:55:44,802 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {55194#true} {55195#false} #116#return; {55195#false} is VALID [2022-04-08 03:55:44,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-04-08 03:55:44,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:55:44,803 INFO L290 TraceCheckUtils]: 0: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-08 03:55:44,803 INFO L290 TraceCheckUtils]: 1: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-08 03:55:44,803 INFO L290 TraceCheckUtils]: 2: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-08 03:55:44,804 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {55194#true} {55195#false} #118#return; {55195#false} is VALID [2022-04-08 03:55:44,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-04-08 03:55:44,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:55:44,805 INFO L290 TraceCheckUtils]: 0: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-08 03:55:44,805 INFO L290 TraceCheckUtils]: 1: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-08 03:55:44,805 INFO L290 TraceCheckUtils]: 2: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-08 03:55:44,805 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {55194#true} {55195#false} #120#return; {55195#false} is VALID [2022-04-08 03:55:44,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-04-08 03:55:44,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:55:44,807 INFO L290 TraceCheckUtils]: 0: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-08 03:55:44,807 INFO L290 TraceCheckUtils]: 1: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-08 03:55:44,807 INFO L290 TraceCheckUtils]: 2: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-08 03:55:44,807 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {55194#true} {55195#false} #122#return; {55195#false} is VALID [2022-04-08 03:55:44,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2022-04-08 03:55:44,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:55:44,809 INFO L290 TraceCheckUtils]: 0: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-08 03:55:44,809 INFO L290 TraceCheckUtils]: 1: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-08 03:55:44,810 INFO L290 TraceCheckUtils]: 2: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-08 03:55:44,810 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {55194#true} {55195#false} #124#return; {55195#false} is VALID [2022-04-08 03:55:44,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2022-04-08 03:55:44,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:55:44,812 INFO L290 TraceCheckUtils]: 0: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-08 03:55:44,813 INFO L290 TraceCheckUtils]: 1: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-08 03:55:44,813 INFO L290 TraceCheckUtils]: 2: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-08 03:55:44,813 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {55194#true} {55195#false} #126#return; {55195#false} is VALID [2022-04-08 03:55:44,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2022-04-08 03:55:44,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:55:44,814 INFO L290 TraceCheckUtils]: 0: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-08 03:55:44,815 INFO L290 TraceCheckUtils]: 1: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-08 03:55:44,815 INFO L290 TraceCheckUtils]: 2: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-08 03:55:44,815 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {55194#true} {55195#false} #128#return; {55195#false} is VALID [2022-04-08 03:55:44,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2022-04-08 03:55:44,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:55:44,816 INFO L290 TraceCheckUtils]: 0: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-08 03:55:44,816 INFO L290 TraceCheckUtils]: 1: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-08 03:55:44,817 INFO L290 TraceCheckUtils]: 2: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-08 03:55:44,817 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {55194#true} {55195#false} #118#return; {55195#false} is VALID [2022-04-08 03:55:44,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2022-04-08 03:55:44,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:55:44,828 INFO L290 TraceCheckUtils]: 0: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-08 03:55:44,828 INFO L290 TraceCheckUtils]: 1: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-08 03:55:44,828 INFO L290 TraceCheckUtils]: 2: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-08 03:55:44,828 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {55194#true} {55195#false} #120#return; {55195#false} is VALID [2022-04-08 03:55:44,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2022-04-08 03:55:44,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:55:44,831 INFO L290 TraceCheckUtils]: 0: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-08 03:55:44,831 INFO L290 TraceCheckUtils]: 1: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-08 03:55:44,831 INFO L290 TraceCheckUtils]: 2: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-08 03:55:44,831 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {55194#true} {55195#false} #122#return; {55195#false} is VALID [2022-04-08 03:55:44,831 INFO L272 TraceCheckUtils]: 0: Hoare triple {55194#true} call ULTIMATE.init(); {55313#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 03:55:44,832 INFO L290 TraceCheckUtils]: 1: Hoare triple {55313#(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(9, 2); {55194#true} is VALID [2022-04-08 03:55:44,832 INFO L290 TraceCheckUtils]: 2: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-08 03:55:44,832 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {55194#true} {55194#true} #138#return; {55194#true} is VALID [2022-04-08 03:55:44,832 INFO L272 TraceCheckUtils]: 4: Hoare triple {55194#true} call #t~ret8 := main(#in~argc, #in~argv.base, #in~argv.offset); {55194#true} is VALID [2022-04-08 03:55:44,832 INFO L290 TraceCheckUtils]: 5: Hoare triple {55194#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;havoc ~n~0;havoc ~l~0;havoc ~r~0;havoc ~i~0;havoc ~j~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {55194#true} is VALID [2022-04-08 03:55:44,832 INFO L290 TraceCheckUtils]: 6: Hoare triple {55194#true} assume !!(1 <= ~n~0 && ~n~0 <= 1000000);~l~0 := 1 + (if ~n~0 < 0 && 0 != ~n~0 % 2 then 1 + ~n~0 / 2 else ~n~0 / 2);~r~0 := ~n~0; {55194#true} is VALID [2022-04-08 03:55:44,832 INFO L290 TraceCheckUtils]: 7: Hoare triple {55194#true} assume ~l~0 > 1;#t~post2 := ~l~0;~l~0 := #t~post2 - 1;havoc #t~post2; {55194#true} is VALID [2022-04-08 03:55:44,832 INFO L290 TraceCheckUtils]: 8: Hoare triple {55194#true} assume !!(~r~0 > 1);~i~0 := ~l~0;~j~0 := 2 * ~l~0; {55199#(<= main_~j~0 (* main_~l~0 2))} is VALID [2022-04-08 03:55:44,833 INFO L290 TraceCheckUtils]: 9: Hoare triple {55199#(<= main_~j~0 (* main_~l~0 2))} assume !!(~j~0 <= ~r~0); {55199#(<= main_~j~0 (* main_~l~0 2))} is VALID [2022-04-08 03:55:44,833 INFO L290 TraceCheckUtils]: 10: Hoare triple {55199#(<= main_~j~0 (* main_~l~0 2))} assume !(~j~0 < ~r~0); {55200#(<= main_~r~0 (* main_~l~0 2))} is VALID [2022-04-08 03:55:44,833 INFO L272 TraceCheckUtils]: 11: Hoare triple {55200#(<= main_~r~0 (* main_~l~0 2))} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {55194#true} is VALID [2022-04-08 03:55:44,833 INFO L290 TraceCheckUtils]: 12: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-08 03:55:44,834 INFO L290 TraceCheckUtils]: 13: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-08 03:55:44,834 INFO L290 TraceCheckUtils]: 14: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-08 03:55:44,834 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {55194#true} {55200#(<= main_~r~0 (* main_~l~0 2))} #118#return; {55200#(<= main_~r~0 (* main_~l~0 2))} is VALID [2022-04-08 03:55:44,834 INFO L272 TraceCheckUtils]: 16: Hoare triple {55200#(<= main_~r~0 (* main_~l~0 2))} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {55194#true} is VALID [2022-04-08 03:55:44,834 INFO L290 TraceCheckUtils]: 17: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-08 03:55:44,834 INFO L290 TraceCheckUtils]: 18: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-08 03:55:44,834 INFO L290 TraceCheckUtils]: 19: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-08 03:55:44,835 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {55194#true} {55200#(<= main_~r~0 (* main_~l~0 2))} #120#return; {55200#(<= main_~r~0 (* main_~l~0 2))} is VALID [2022-04-08 03:55:44,835 INFO L290 TraceCheckUtils]: 21: Hoare triple {55200#(<= main_~r~0 (* main_~l~0 2))} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {55200#(<= main_~r~0 (* main_~l~0 2))} is VALID [2022-04-08 03:55:44,836 INFO L290 TraceCheckUtils]: 22: Hoare triple {55200#(<= main_~r~0 (* main_~l~0 2))} assume 0 != #t~nondet5;havoc #t~nondet5; {55200#(<= main_~r~0 (* main_~l~0 2))} is VALID [2022-04-08 03:55:44,836 INFO L290 TraceCheckUtils]: 23: Hoare triple {55200#(<= main_~r~0 (* main_~l~0 2))} assume ~l~0 > 1; {55209#(<= (+ main_~r~0 4) (* main_~l~0 4))} is VALID [2022-04-08 03:55:44,836 INFO L272 TraceCheckUtils]: 24: Hoare triple {55209#(<= (+ main_~r~0 4) (* main_~l~0 4))} call __VERIFIER_assert((if 1 <= ~l~0 then 1 else 0)); {55194#true} is VALID [2022-04-08 03:55:44,836 INFO L290 TraceCheckUtils]: 25: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-08 03:55:44,836 INFO L290 TraceCheckUtils]: 26: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-08 03:55:44,836 INFO L290 TraceCheckUtils]: 27: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-08 03:55:44,837 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {55194#true} {55209#(<= (+ main_~r~0 4) (* main_~l~0 4))} #130#return; {55209#(<= (+ main_~r~0 4) (* main_~l~0 4))} is VALID [2022-04-08 03:55:44,837 INFO L272 TraceCheckUtils]: 29: Hoare triple {55209#(<= (+ main_~r~0 4) (* main_~l~0 4))} call __VERIFIER_assert((if ~l~0 <= ~n~0 then 1 else 0)); {55194#true} is VALID [2022-04-08 03:55:44,837 INFO L290 TraceCheckUtils]: 30: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-08 03:55:44,837 INFO L290 TraceCheckUtils]: 31: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-08 03:55:44,837 INFO L290 TraceCheckUtils]: 32: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-08 03:55:44,838 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {55194#true} {55209#(<= (+ main_~r~0 4) (* main_~l~0 4))} #132#return; {55209#(<= (+ main_~r~0 4) (* main_~l~0 4))} is VALID [2022-04-08 03:55:44,838 INFO L290 TraceCheckUtils]: 34: Hoare triple {55209#(<= (+ main_~r~0 4) (* main_~l~0 4))} #t~post6 := ~l~0;~l~0 := #t~post6 - 1;havoc #t~post6; {55218#(<= main_~r~0 (* main_~l~0 4))} is VALID [2022-04-08 03:55:44,838 INFO L290 TraceCheckUtils]: 35: Hoare triple {55218#(<= main_~r~0 (* main_~l~0 4))} assume !!(~r~0 > 1);~i~0 := ~l~0;~j~0 := 2 * ~l~0; {55219#(<= main_~r~0 (* main_~j~0 2))} is VALID [2022-04-08 03:55:44,839 INFO L290 TraceCheckUtils]: 36: Hoare triple {55219#(<= main_~r~0 (* main_~j~0 2))} assume !!(~j~0 <= ~r~0); {55219#(<= main_~r~0 (* main_~j~0 2))} is VALID [2022-04-08 03:55:44,839 INFO L290 TraceCheckUtils]: 37: Hoare triple {55219#(<= main_~r~0 (* main_~j~0 2))} assume ~j~0 < ~r~0; {55219#(<= main_~r~0 (* main_~j~0 2))} is VALID [2022-04-08 03:55:44,839 INFO L272 TraceCheckUtils]: 38: Hoare triple {55219#(<= main_~r~0 (* main_~j~0 2))} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {55194#true} is VALID [2022-04-08 03:55:44,839 INFO L290 TraceCheckUtils]: 39: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-08 03:55:44,839 INFO L290 TraceCheckUtils]: 40: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-08 03:55:44,840 INFO L290 TraceCheckUtils]: 41: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-08 03:55:44,840 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {55194#true} {55219#(<= main_~r~0 (* main_~j~0 2))} #110#return; {55219#(<= main_~r~0 (* main_~j~0 2))} is VALID [2022-04-08 03:55:44,840 INFO L272 TraceCheckUtils]: 43: Hoare triple {55219#(<= main_~r~0 (* main_~j~0 2))} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {55194#true} is VALID [2022-04-08 03:55:44,840 INFO L290 TraceCheckUtils]: 44: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-08 03:55:44,840 INFO L290 TraceCheckUtils]: 45: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-08 03:55:44,840 INFO L290 TraceCheckUtils]: 46: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-08 03:55:44,841 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {55194#true} {55219#(<= main_~r~0 (* main_~j~0 2))} #112#return; {55219#(<= main_~r~0 (* main_~j~0 2))} is VALID [2022-04-08 03:55:44,841 INFO L272 TraceCheckUtils]: 48: Hoare triple {55219#(<= main_~r~0 (* main_~j~0 2))} call __VERIFIER_assert((if 1 <= 1 + ~j~0 then 1 else 0)); {55194#true} is VALID [2022-04-08 03:55:44,841 INFO L290 TraceCheckUtils]: 49: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-08 03:55:44,841 INFO L290 TraceCheckUtils]: 50: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-08 03:55:44,841 INFO L290 TraceCheckUtils]: 51: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-08 03:55:44,842 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {55194#true} {55219#(<= main_~r~0 (* main_~j~0 2))} #114#return; {55219#(<= main_~r~0 (* main_~j~0 2))} is VALID [2022-04-08 03:55:44,842 INFO L272 TraceCheckUtils]: 53: Hoare triple {55219#(<= main_~r~0 (* main_~j~0 2))} call __VERIFIER_assert((if 1 + ~j~0 <= ~n~0 then 1 else 0)); {55194#true} is VALID [2022-04-08 03:55:44,842 INFO L290 TraceCheckUtils]: 54: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-08 03:55:44,842 INFO L290 TraceCheckUtils]: 55: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-08 03:55:44,842 INFO L290 TraceCheckUtils]: 56: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-08 03:55:44,842 INFO L284 TraceCheckUtils]: 57: Hoare quadruple {55194#true} {55219#(<= main_~r~0 (* main_~j~0 2))} #116#return; {55219#(<= main_~r~0 (* main_~j~0 2))} is VALID [2022-04-08 03:55:44,843 INFO L290 TraceCheckUtils]: 58: Hoare triple {55219#(<= main_~r~0 (* main_~j~0 2))} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {55219#(<= main_~r~0 (* main_~j~0 2))} is VALID [2022-04-08 03:55:44,843 INFO L290 TraceCheckUtils]: 59: Hoare triple {55219#(<= main_~r~0 (* main_~j~0 2))} assume !(0 != #t~nondet4);havoc #t~nondet4; {55219#(<= main_~r~0 (* main_~j~0 2))} is VALID [2022-04-08 03:55:44,843 INFO L272 TraceCheckUtils]: 60: Hoare triple {55219#(<= main_~r~0 (* main_~j~0 2))} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {55194#true} is VALID [2022-04-08 03:55:44,843 INFO L290 TraceCheckUtils]: 61: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-08 03:55:44,843 INFO L290 TraceCheckUtils]: 62: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-08 03:55:44,844 INFO L290 TraceCheckUtils]: 63: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-08 03:55:44,844 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {55194#true} {55219#(<= main_~r~0 (* main_~j~0 2))} #118#return; {55219#(<= main_~r~0 (* main_~j~0 2))} is VALID [2022-04-08 03:55:44,844 INFO L272 TraceCheckUtils]: 65: Hoare triple {55219#(<= main_~r~0 (* main_~j~0 2))} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {55194#true} is VALID [2022-04-08 03:55:44,844 INFO L290 TraceCheckUtils]: 66: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-08 03:55:44,844 INFO L290 TraceCheckUtils]: 67: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-08 03:55:44,844 INFO L290 TraceCheckUtils]: 68: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-08 03:55:44,845 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {55194#true} {55219#(<= main_~r~0 (* main_~j~0 2))} #120#return; {55219#(<= main_~r~0 (* main_~j~0 2))} is VALID [2022-04-08 03:55:44,845 INFO L290 TraceCheckUtils]: 70: Hoare triple {55219#(<= main_~r~0 (* main_~j~0 2))} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {55219#(<= main_~r~0 (* main_~j~0 2))} is VALID [2022-04-08 03:55:44,845 INFO L290 TraceCheckUtils]: 71: Hoare triple {55219#(<= main_~r~0 (* main_~j~0 2))} assume !(0 != #t~nondet5);havoc #t~nondet5; {55219#(<= main_~r~0 (* main_~j~0 2))} is VALID [2022-04-08 03:55:44,845 INFO L272 TraceCheckUtils]: 72: Hoare triple {55219#(<= main_~r~0 (* main_~j~0 2))} call __VERIFIER_assert((if 1 <= ~i~0 then 1 else 0)); {55194#true} is VALID [2022-04-08 03:55:44,846 INFO L290 TraceCheckUtils]: 73: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-08 03:55:44,846 INFO L290 TraceCheckUtils]: 74: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-08 03:55:44,846 INFO L290 TraceCheckUtils]: 75: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-08 03:55:44,846 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {55194#true} {55219#(<= main_~r~0 (* main_~j~0 2))} #122#return; {55219#(<= main_~r~0 (* main_~j~0 2))} is VALID [2022-04-08 03:55:44,846 INFO L272 TraceCheckUtils]: 77: Hoare triple {55219#(<= main_~r~0 (* main_~j~0 2))} call __VERIFIER_assert((if ~i~0 <= ~n~0 then 1 else 0)); {55194#true} is VALID [2022-04-08 03:55:44,846 INFO L290 TraceCheckUtils]: 78: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-08 03:55:44,846 INFO L290 TraceCheckUtils]: 79: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-08 03:55:44,847 INFO L290 TraceCheckUtils]: 80: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-08 03:55:44,847 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {55194#true} {55219#(<= main_~r~0 (* main_~j~0 2))} #124#return; {55219#(<= main_~r~0 (* main_~j~0 2))} is VALID [2022-04-08 03:55:44,847 INFO L272 TraceCheckUtils]: 82: Hoare triple {55219#(<= main_~r~0 (* main_~j~0 2))} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {55194#true} is VALID [2022-04-08 03:55:44,847 INFO L290 TraceCheckUtils]: 83: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-08 03:55:44,847 INFO L290 TraceCheckUtils]: 84: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-08 03:55:44,847 INFO L290 TraceCheckUtils]: 85: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-08 03:55:44,848 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {55194#true} {55219#(<= main_~r~0 (* main_~j~0 2))} #126#return; {55219#(<= main_~r~0 (* main_~j~0 2))} is VALID [2022-04-08 03:55:44,848 INFO L272 TraceCheckUtils]: 87: Hoare triple {55219#(<= main_~r~0 (* main_~j~0 2))} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {55194#true} is VALID [2022-04-08 03:55:44,848 INFO L290 TraceCheckUtils]: 88: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-08 03:55:44,848 INFO L290 TraceCheckUtils]: 89: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-08 03:55:44,848 INFO L290 TraceCheckUtils]: 90: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-08 03:55:44,849 INFO L284 TraceCheckUtils]: 91: Hoare quadruple {55194#true} {55219#(<= main_~r~0 (* main_~j~0 2))} #128#return; {55219#(<= main_~r~0 (* main_~j~0 2))} is VALID [2022-04-08 03:55:44,849 INFO L290 TraceCheckUtils]: 92: Hoare triple {55219#(<= main_~r~0 (* main_~j~0 2))} ~i~0 := ~j~0;~j~0 := 2 * ~j~0; {55260#(<= main_~r~0 main_~j~0)} is VALID [2022-04-08 03:55:44,849 INFO L290 TraceCheckUtils]: 93: Hoare triple {55260#(<= main_~r~0 main_~j~0)} assume !!(~j~0 <= ~r~0); {55260#(<= main_~r~0 main_~j~0)} is VALID [2022-04-08 03:55:44,850 INFO L290 TraceCheckUtils]: 94: Hoare triple {55260#(<= main_~r~0 main_~j~0)} assume ~j~0 < ~r~0; {55195#false} is VALID [2022-04-08 03:55:44,850 INFO L272 TraceCheckUtils]: 95: Hoare triple {55195#false} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {55194#true} is VALID [2022-04-08 03:55:44,850 INFO L290 TraceCheckUtils]: 96: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-08 03:55:44,850 INFO L290 TraceCheckUtils]: 97: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-08 03:55:44,850 INFO L290 TraceCheckUtils]: 98: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-08 03:55:44,850 INFO L284 TraceCheckUtils]: 99: Hoare quadruple {55194#true} {55195#false} #110#return; {55195#false} is VALID [2022-04-08 03:55:44,850 INFO L272 TraceCheckUtils]: 100: Hoare triple {55195#false} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {55194#true} is VALID [2022-04-08 03:55:44,850 INFO L290 TraceCheckUtils]: 101: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-08 03:55:44,850 INFO L290 TraceCheckUtils]: 102: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-08 03:55:44,850 INFO L290 TraceCheckUtils]: 103: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-08 03:55:44,851 INFO L284 TraceCheckUtils]: 104: Hoare quadruple {55194#true} {55195#false} #112#return; {55195#false} is VALID [2022-04-08 03:55:44,851 INFO L272 TraceCheckUtils]: 105: Hoare triple {55195#false} call __VERIFIER_assert((if 1 <= 1 + ~j~0 then 1 else 0)); {55194#true} is VALID [2022-04-08 03:55:44,851 INFO L290 TraceCheckUtils]: 106: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-08 03:55:44,851 INFO L290 TraceCheckUtils]: 107: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-08 03:55:44,851 INFO L290 TraceCheckUtils]: 108: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-08 03:55:44,851 INFO L284 TraceCheckUtils]: 109: Hoare quadruple {55194#true} {55195#false} #114#return; {55195#false} is VALID [2022-04-08 03:55:44,851 INFO L272 TraceCheckUtils]: 110: Hoare triple {55195#false} call __VERIFIER_assert((if 1 + ~j~0 <= ~n~0 then 1 else 0)); {55194#true} is VALID [2022-04-08 03:55:44,851 INFO L290 TraceCheckUtils]: 111: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-08 03:55:44,851 INFO L290 TraceCheckUtils]: 112: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-08 03:55:44,851 INFO L290 TraceCheckUtils]: 113: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-08 03:55:44,851 INFO L284 TraceCheckUtils]: 114: Hoare quadruple {55194#true} {55195#false} #116#return; {55195#false} is VALID [2022-04-08 03:55:44,852 INFO L290 TraceCheckUtils]: 115: Hoare triple {55195#false} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {55195#false} is VALID [2022-04-08 03:55:44,852 INFO L290 TraceCheckUtils]: 116: Hoare triple {55195#false} assume !(0 != #t~nondet4);havoc #t~nondet4; {55195#false} is VALID [2022-04-08 03:55:44,852 INFO L272 TraceCheckUtils]: 117: Hoare triple {55195#false} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {55194#true} is VALID [2022-04-08 03:55:44,852 INFO L290 TraceCheckUtils]: 118: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-08 03:55:44,852 INFO L290 TraceCheckUtils]: 119: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-08 03:55:44,852 INFO L290 TraceCheckUtils]: 120: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-08 03:55:44,852 INFO L284 TraceCheckUtils]: 121: Hoare quadruple {55194#true} {55195#false} #118#return; {55195#false} is VALID [2022-04-08 03:55:44,852 INFO L272 TraceCheckUtils]: 122: Hoare triple {55195#false} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {55194#true} is VALID [2022-04-08 03:55:44,852 INFO L290 TraceCheckUtils]: 123: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-08 03:55:44,852 INFO L290 TraceCheckUtils]: 124: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-08 03:55:44,853 INFO L290 TraceCheckUtils]: 125: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-08 03:55:44,853 INFO L284 TraceCheckUtils]: 126: Hoare quadruple {55194#true} {55195#false} #120#return; {55195#false} is VALID [2022-04-08 03:55:44,853 INFO L290 TraceCheckUtils]: 127: Hoare triple {55195#false} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {55195#false} is VALID [2022-04-08 03:55:44,853 INFO L290 TraceCheckUtils]: 128: Hoare triple {55195#false} assume !(0 != #t~nondet5);havoc #t~nondet5; {55195#false} is VALID [2022-04-08 03:55:44,853 INFO L272 TraceCheckUtils]: 129: Hoare triple {55195#false} call __VERIFIER_assert((if 1 <= ~i~0 then 1 else 0)); {55194#true} is VALID [2022-04-08 03:55:44,853 INFO L290 TraceCheckUtils]: 130: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-08 03:55:44,853 INFO L290 TraceCheckUtils]: 131: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-08 03:55:44,853 INFO L290 TraceCheckUtils]: 132: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-08 03:55:44,853 INFO L284 TraceCheckUtils]: 133: Hoare quadruple {55194#true} {55195#false} #122#return; {55195#false} is VALID [2022-04-08 03:55:44,853 INFO L272 TraceCheckUtils]: 134: Hoare triple {55195#false} call __VERIFIER_assert((if ~i~0 <= ~n~0 then 1 else 0)); {55194#true} is VALID [2022-04-08 03:55:44,853 INFO L290 TraceCheckUtils]: 135: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-08 03:55:44,854 INFO L290 TraceCheckUtils]: 136: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-08 03:55:44,854 INFO L290 TraceCheckUtils]: 137: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-08 03:55:44,854 INFO L284 TraceCheckUtils]: 138: Hoare quadruple {55194#true} {55195#false} #124#return; {55195#false} is VALID [2022-04-08 03:55:44,854 INFO L272 TraceCheckUtils]: 139: Hoare triple {55195#false} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {55194#true} is VALID [2022-04-08 03:55:44,854 INFO L290 TraceCheckUtils]: 140: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-08 03:55:44,854 INFO L290 TraceCheckUtils]: 141: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-08 03:55:44,854 INFO L290 TraceCheckUtils]: 142: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-08 03:55:44,854 INFO L284 TraceCheckUtils]: 143: Hoare quadruple {55194#true} {55195#false} #126#return; {55195#false} is VALID [2022-04-08 03:55:44,854 INFO L272 TraceCheckUtils]: 144: Hoare triple {55195#false} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {55194#true} is VALID [2022-04-08 03:55:44,854 INFO L290 TraceCheckUtils]: 145: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-08 03:55:44,855 INFO L290 TraceCheckUtils]: 146: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-08 03:55:44,855 INFO L290 TraceCheckUtils]: 147: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-08 03:55:44,855 INFO L284 TraceCheckUtils]: 148: Hoare quadruple {55194#true} {55195#false} #128#return; {55195#false} is VALID [2022-04-08 03:55:44,855 INFO L290 TraceCheckUtils]: 149: Hoare triple {55195#false} ~i~0 := ~j~0;~j~0 := 2 * ~j~0; {55195#false} is VALID [2022-04-08 03:55:44,855 INFO L290 TraceCheckUtils]: 150: Hoare triple {55195#false} assume !!(~j~0 <= ~r~0); {55195#false} is VALID [2022-04-08 03:55:44,855 INFO L290 TraceCheckUtils]: 151: Hoare triple {55195#false} assume !(~j~0 < ~r~0); {55195#false} is VALID [2022-04-08 03:55:44,855 INFO L272 TraceCheckUtils]: 152: Hoare triple {55195#false} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {55194#true} is VALID [2022-04-08 03:55:44,855 INFO L290 TraceCheckUtils]: 153: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-08 03:55:44,855 INFO L290 TraceCheckUtils]: 154: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-08 03:55:44,855 INFO L290 TraceCheckUtils]: 155: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-08 03:55:44,855 INFO L284 TraceCheckUtils]: 156: Hoare quadruple {55194#true} {55195#false} #118#return; {55195#false} is VALID [2022-04-08 03:55:44,856 INFO L272 TraceCheckUtils]: 157: Hoare triple {55195#false} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {55194#true} is VALID [2022-04-08 03:55:44,856 INFO L290 TraceCheckUtils]: 158: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-08 03:55:44,856 INFO L290 TraceCheckUtils]: 159: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-08 03:55:44,856 INFO L290 TraceCheckUtils]: 160: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-08 03:55:44,856 INFO L284 TraceCheckUtils]: 161: Hoare quadruple {55194#true} {55195#false} #120#return; {55195#false} is VALID [2022-04-08 03:55:44,856 INFO L290 TraceCheckUtils]: 162: Hoare triple {55195#false} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {55195#false} is VALID [2022-04-08 03:55:44,856 INFO L290 TraceCheckUtils]: 163: Hoare triple {55195#false} assume !(0 != #t~nondet5);havoc #t~nondet5; {55195#false} is VALID [2022-04-08 03:55:44,856 INFO L272 TraceCheckUtils]: 164: Hoare triple {55195#false} call __VERIFIER_assert((if 1 <= ~i~0 then 1 else 0)); {55194#true} is VALID [2022-04-08 03:55:44,856 INFO L290 TraceCheckUtils]: 165: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-08 03:55:44,856 INFO L290 TraceCheckUtils]: 166: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-08 03:55:44,856 INFO L290 TraceCheckUtils]: 167: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-08 03:55:44,857 INFO L284 TraceCheckUtils]: 168: Hoare quadruple {55194#true} {55195#false} #122#return; {55195#false} is VALID [2022-04-08 03:55:44,857 INFO L272 TraceCheckUtils]: 169: Hoare triple {55195#false} call __VERIFIER_assert((if ~i~0 <= ~n~0 then 1 else 0)); {55195#false} is VALID [2022-04-08 03:55:44,857 INFO L290 TraceCheckUtils]: 170: Hoare triple {55195#false} ~cond := #in~cond; {55195#false} is VALID [2022-04-08 03:55:44,857 INFO L290 TraceCheckUtils]: 171: Hoare triple {55195#false} assume 0 == ~cond; {55195#false} is VALID [2022-04-08 03:55:44,857 INFO L290 TraceCheckUtils]: 172: Hoare triple {55195#false} assume !false; {55195#false} is VALID [2022-04-08 03:55:44,857 INFO L134 CoverageAnalysis]: Checked inductivity of 1510 backedges. 90 proven. 10 refuted. 0 times theorem prover too weak. 1410 trivial. 0 not checked. [2022-04-08 03:55:44,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 03:55:44,858 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [10631630] [2022-04-08 03:55:44,858 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [10631630] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 03:55:44,858 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2144099584] [2022-04-08 03:55:44,858 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 03:55:44,858 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 03:55:44,858 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 03:55:44,872 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 03:55:44,910 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 03:55:44,926 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-04-08 03:55:44,927 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 03:55:44,927 INFO L263 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-08 03:55:44,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:55:44,947 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 03:55:45,883 INFO L272 TraceCheckUtils]: 0: Hoare triple {55194#true} call ULTIMATE.init(); {55194#true} is VALID [2022-04-08 03:55:45,883 INFO L290 TraceCheckUtils]: 1: Hoare triple {55194#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(9, 2); {55194#true} is VALID [2022-04-08 03:55:45,883 INFO L290 TraceCheckUtils]: 2: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-08 03:55:45,883 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {55194#true} {55194#true} #138#return; {55194#true} is VALID [2022-04-08 03:55:45,884 INFO L272 TraceCheckUtils]: 4: Hoare triple {55194#true} call #t~ret8 := main(#in~argc, #in~argv.base, #in~argv.offset); {55194#true} is VALID [2022-04-08 03:55:45,884 INFO L290 TraceCheckUtils]: 5: Hoare triple {55194#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;havoc ~n~0;havoc ~l~0;havoc ~r~0;havoc ~i~0;havoc ~j~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {55194#true} is VALID [2022-04-08 03:55:45,884 INFO L290 TraceCheckUtils]: 6: Hoare triple {55194#true} assume !!(1 <= ~n~0 && ~n~0 <= 1000000);~l~0 := 1 + (if ~n~0 < 0 && 0 != ~n~0 % 2 then 1 + ~n~0 / 2 else ~n~0 / 2);~r~0 := ~n~0; {55335#(<= main_~r~0 main_~n~0)} is VALID [2022-04-08 03:55:45,884 INFO L290 TraceCheckUtils]: 7: Hoare triple {55335#(<= main_~r~0 main_~n~0)} assume ~l~0 > 1;#t~post2 := ~l~0;~l~0 := #t~post2 - 1;havoc #t~post2; {55335#(<= main_~r~0 main_~n~0)} is VALID [2022-04-08 03:55:45,884 INFO L290 TraceCheckUtils]: 8: Hoare triple {55335#(<= main_~r~0 main_~n~0)} assume !!(~r~0 > 1);~i~0 := ~l~0;~j~0 := 2 * ~l~0; {55335#(<= main_~r~0 main_~n~0)} is VALID [2022-04-08 03:55:45,885 INFO L290 TraceCheckUtils]: 9: Hoare triple {55335#(<= main_~r~0 main_~n~0)} assume !!(~j~0 <= ~r~0); {55335#(<= main_~r~0 main_~n~0)} is VALID [2022-04-08 03:55:45,885 INFO L290 TraceCheckUtils]: 10: Hoare triple {55335#(<= main_~r~0 main_~n~0)} assume !(~j~0 < ~r~0); {55335#(<= main_~r~0 main_~n~0)} is VALID [2022-04-08 03:55:45,885 INFO L272 TraceCheckUtils]: 11: Hoare triple {55335#(<= main_~r~0 main_~n~0)} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {55194#true} is VALID [2022-04-08 03:55:45,885 INFO L290 TraceCheckUtils]: 12: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-08 03:55:45,885 INFO L290 TraceCheckUtils]: 13: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-08 03:55:45,885 INFO L290 TraceCheckUtils]: 14: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-08 03:55:45,888 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {55194#true} {55335#(<= main_~r~0 main_~n~0)} #118#return; {55335#(<= main_~r~0 main_~n~0)} is VALID [2022-04-08 03:55:45,888 INFO L272 TraceCheckUtils]: 16: Hoare triple {55335#(<= main_~r~0 main_~n~0)} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {55194#true} is VALID [2022-04-08 03:55:45,888 INFO L290 TraceCheckUtils]: 17: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-08 03:55:45,889 INFO L290 TraceCheckUtils]: 18: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-08 03:55:45,889 INFO L290 TraceCheckUtils]: 19: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-08 03:55:45,889 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {55194#true} {55335#(<= main_~r~0 main_~n~0)} #120#return; {55335#(<= main_~r~0 main_~n~0)} is VALID [2022-04-08 03:55:45,889 INFO L290 TraceCheckUtils]: 21: Hoare triple {55335#(<= main_~r~0 main_~n~0)} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {55335#(<= main_~r~0 main_~n~0)} is VALID [2022-04-08 03:55:45,889 INFO L290 TraceCheckUtils]: 22: Hoare triple {55335#(<= main_~r~0 main_~n~0)} assume 0 != #t~nondet5;havoc #t~nondet5; {55335#(<= main_~r~0 main_~n~0)} is VALID [2022-04-08 03:55:45,890 INFO L290 TraceCheckUtils]: 23: Hoare triple {55335#(<= main_~r~0 main_~n~0)} assume ~l~0 > 1; {55335#(<= main_~r~0 main_~n~0)} is VALID [2022-04-08 03:55:45,890 INFO L272 TraceCheckUtils]: 24: Hoare triple {55335#(<= main_~r~0 main_~n~0)} call __VERIFIER_assert((if 1 <= ~l~0 then 1 else 0)); {55194#true} is VALID [2022-04-08 03:55:45,890 INFO L290 TraceCheckUtils]: 25: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-08 03:55:45,890 INFO L290 TraceCheckUtils]: 26: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-08 03:55:45,890 INFO L290 TraceCheckUtils]: 27: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-08 03:55:45,890 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {55194#true} {55335#(<= main_~r~0 main_~n~0)} #130#return; {55335#(<= main_~r~0 main_~n~0)} is VALID [2022-04-08 03:55:45,890 INFO L272 TraceCheckUtils]: 29: Hoare triple {55335#(<= main_~r~0 main_~n~0)} call __VERIFIER_assert((if ~l~0 <= ~n~0 then 1 else 0)); {55194#true} is VALID [2022-04-08 03:55:45,891 INFO L290 TraceCheckUtils]: 30: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-08 03:55:45,891 INFO L290 TraceCheckUtils]: 31: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-08 03:55:45,891 INFO L290 TraceCheckUtils]: 32: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-08 03:55:45,891 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {55194#true} {55335#(<= main_~r~0 main_~n~0)} #132#return; {55335#(<= main_~r~0 main_~n~0)} is VALID [2022-04-08 03:55:45,891 INFO L290 TraceCheckUtils]: 34: Hoare triple {55335#(<= main_~r~0 main_~n~0)} #t~post6 := ~l~0;~l~0 := #t~post6 - 1;havoc #t~post6; {55335#(<= main_~r~0 main_~n~0)} is VALID [2022-04-08 03:55:45,892 INFO L290 TraceCheckUtils]: 35: Hoare triple {55335#(<= main_~r~0 main_~n~0)} assume !!(~r~0 > 1);~i~0 := ~l~0;~j~0 := 2 * ~l~0; {55423#(and (< 1 main_~r~0) (<= main_~r~0 main_~n~0))} is VALID [2022-04-08 03:55:45,892 INFO L290 TraceCheckUtils]: 36: Hoare triple {55423#(and (< 1 main_~r~0) (<= main_~r~0 main_~n~0))} assume !!(~j~0 <= ~r~0); {55423#(and (< 1 main_~r~0) (<= main_~r~0 main_~n~0))} is VALID [2022-04-08 03:55:45,892 INFO L290 TraceCheckUtils]: 37: Hoare triple {55423#(and (< 1 main_~r~0) (<= main_~r~0 main_~n~0))} assume ~j~0 < ~r~0; {55423#(and (< 1 main_~r~0) (<= main_~r~0 main_~n~0))} is VALID [2022-04-08 03:55:45,892 INFO L272 TraceCheckUtils]: 38: Hoare triple {55423#(and (< 1 main_~r~0) (<= main_~r~0 main_~n~0))} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {55194#true} is VALID [2022-04-08 03:55:45,892 INFO L290 TraceCheckUtils]: 39: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-08 03:55:45,892 INFO L290 TraceCheckUtils]: 40: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-08 03:55:45,893 INFO L290 TraceCheckUtils]: 41: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-08 03:55:45,894 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {55194#true} {55423#(and (< 1 main_~r~0) (<= main_~r~0 main_~n~0))} #110#return; {55423#(and (< 1 main_~r~0) (<= main_~r~0 main_~n~0))} is VALID [2022-04-08 03:55:45,894 INFO L272 TraceCheckUtils]: 43: Hoare triple {55423#(and (< 1 main_~r~0) (<= main_~r~0 main_~n~0))} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {55194#true} is VALID [2022-04-08 03:55:45,894 INFO L290 TraceCheckUtils]: 44: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-08 03:55:45,894 INFO L290 TraceCheckUtils]: 45: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-08 03:55:45,894 INFO L290 TraceCheckUtils]: 46: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-08 03:55:45,895 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {55194#true} {55423#(and (< 1 main_~r~0) (<= main_~r~0 main_~n~0))} #112#return; {55423#(and (< 1 main_~r~0) (<= main_~r~0 main_~n~0))} is VALID [2022-04-08 03:55:45,895 INFO L272 TraceCheckUtils]: 48: Hoare triple {55423#(and (< 1 main_~r~0) (<= main_~r~0 main_~n~0))} call __VERIFIER_assert((if 1 <= 1 + ~j~0 then 1 else 0)); {55194#true} is VALID [2022-04-08 03:55:45,895 INFO L290 TraceCheckUtils]: 49: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-08 03:55:45,895 INFO L290 TraceCheckUtils]: 50: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-08 03:55:45,895 INFO L290 TraceCheckUtils]: 51: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-08 03:55:45,895 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {55194#true} {55423#(and (< 1 main_~r~0) (<= main_~r~0 main_~n~0))} #114#return; {55423#(and (< 1 main_~r~0) (<= main_~r~0 main_~n~0))} is VALID [2022-04-08 03:55:45,896 INFO L272 TraceCheckUtils]: 53: Hoare triple {55423#(and (< 1 main_~r~0) (<= main_~r~0 main_~n~0))} call __VERIFIER_assert((if 1 + ~j~0 <= ~n~0 then 1 else 0)); {55194#true} is VALID [2022-04-08 03:55:45,896 INFO L290 TraceCheckUtils]: 54: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-08 03:55:45,896 INFO L290 TraceCheckUtils]: 55: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-08 03:55:45,896 INFO L290 TraceCheckUtils]: 56: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-08 03:55:45,896 INFO L284 TraceCheckUtils]: 57: Hoare quadruple {55194#true} {55423#(and (< 1 main_~r~0) (<= main_~r~0 main_~n~0))} #116#return; {55423#(and (< 1 main_~r~0) (<= main_~r~0 main_~n~0))} is VALID [2022-04-08 03:55:45,896 INFO L290 TraceCheckUtils]: 58: Hoare triple {55423#(and (< 1 main_~r~0) (<= main_~r~0 main_~n~0))} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {55423#(and (< 1 main_~r~0) (<= main_~r~0 main_~n~0))} is VALID [2022-04-08 03:55:45,897 INFO L290 TraceCheckUtils]: 59: Hoare triple {55423#(and (< 1 main_~r~0) (<= main_~r~0 main_~n~0))} assume !(0 != #t~nondet4);havoc #t~nondet4; {55423#(and (< 1 main_~r~0) (<= main_~r~0 main_~n~0))} is VALID [2022-04-08 03:55:45,897 INFO L272 TraceCheckUtils]: 60: Hoare triple {55423#(and (< 1 main_~r~0) (<= main_~r~0 main_~n~0))} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {55194#true} is VALID [2022-04-08 03:55:45,897 INFO L290 TraceCheckUtils]: 61: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-08 03:55:45,897 INFO L290 TraceCheckUtils]: 62: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-08 03:55:45,897 INFO L290 TraceCheckUtils]: 63: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-08 03:55:45,897 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {55194#true} {55423#(and (< 1 main_~r~0) (<= main_~r~0 main_~n~0))} #118#return; {55423#(and (< 1 main_~r~0) (<= main_~r~0 main_~n~0))} is VALID [2022-04-08 03:55:45,897 INFO L272 TraceCheckUtils]: 65: Hoare triple {55423#(and (< 1 main_~r~0) (<= main_~r~0 main_~n~0))} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {55194#true} is VALID [2022-04-08 03:55:45,898 INFO L290 TraceCheckUtils]: 66: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-08 03:55:45,898 INFO L290 TraceCheckUtils]: 67: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-08 03:55:45,898 INFO L290 TraceCheckUtils]: 68: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-08 03:55:45,898 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {55194#true} {55423#(and (< 1 main_~r~0) (<= main_~r~0 main_~n~0))} #120#return; {55423#(and (< 1 main_~r~0) (<= main_~r~0 main_~n~0))} is VALID [2022-04-08 03:55:45,898 INFO L290 TraceCheckUtils]: 70: Hoare triple {55423#(and (< 1 main_~r~0) (<= main_~r~0 main_~n~0))} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {55423#(and (< 1 main_~r~0) (<= main_~r~0 main_~n~0))} is VALID [2022-04-08 03:55:45,899 INFO L290 TraceCheckUtils]: 71: Hoare triple {55423#(and (< 1 main_~r~0) (<= main_~r~0 main_~n~0))} assume !(0 != #t~nondet5);havoc #t~nondet5; {55423#(and (< 1 main_~r~0) (<= main_~r~0 main_~n~0))} is VALID [2022-04-08 03:55:45,899 INFO L272 TraceCheckUtils]: 72: Hoare triple {55423#(and (< 1 main_~r~0) (<= main_~r~0 main_~n~0))} call __VERIFIER_assert((if 1 <= ~i~0 then 1 else 0)); {55194#true} is VALID [2022-04-08 03:55:45,899 INFO L290 TraceCheckUtils]: 73: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-08 03:55:45,899 INFO L290 TraceCheckUtils]: 74: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-08 03:55:45,899 INFO L290 TraceCheckUtils]: 75: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-08 03:55:45,899 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {55194#true} {55423#(and (< 1 main_~r~0) (<= main_~r~0 main_~n~0))} #122#return; {55423#(and (< 1 main_~r~0) (<= main_~r~0 main_~n~0))} is VALID [2022-04-08 03:55:45,899 INFO L272 TraceCheckUtils]: 77: Hoare triple {55423#(and (< 1 main_~r~0) (<= main_~r~0 main_~n~0))} call __VERIFIER_assert((if ~i~0 <= ~n~0 then 1 else 0)); {55194#true} is VALID [2022-04-08 03:55:45,900 INFO L290 TraceCheckUtils]: 78: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-08 03:55:45,900 INFO L290 TraceCheckUtils]: 79: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-08 03:55:45,900 INFO L290 TraceCheckUtils]: 80: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-08 03:55:45,900 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {55194#true} {55423#(and (< 1 main_~r~0) (<= main_~r~0 main_~n~0))} #124#return; {55423#(and (< 1 main_~r~0) (<= main_~r~0 main_~n~0))} is VALID [2022-04-08 03:55:45,900 INFO L272 TraceCheckUtils]: 82: Hoare triple {55423#(and (< 1 main_~r~0) (<= main_~r~0 main_~n~0))} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {55194#true} is VALID [2022-04-08 03:55:45,900 INFO L290 TraceCheckUtils]: 83: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-08 03:55:45,900 INFO L290 TraceCheckUtils]: 84: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-08 03:55:45,900 INFO L290 TraceCheckUtils]: 85: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-08 03:55:45,901 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {55194#true} {55423#(and (< 1 main_~r~0) (<= main_~r~0 main_~n~0))} #126#return; {55423#(and (< 1 main_~r~0) (<= main_~r~0 main_~n~0))} is VALID [2022-04-08 03:55:45,901 INFO L272 TraceCheckUtils]: 87: Hoare triple {55423#(and (< 1 main_~r~0) (<= main_~r~0 main_~n~0))} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {55194#true} is VALID [2022-04-08 03:55:45,901 INFO L290 TraceCheckUtils]: 88: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-08 03:55:45,901 INFO L290 TraceCheckUtils]: 89: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-08 03:55:45,901 INFO L290 TraceCheckUtils]: 90: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-08 03:55:45,901 INFO L284 TraceCheckUtils]: 91: Hoare quadruple {55194#true} {55423#(and (< 1 main_~r~0) (<= main_~r~0 main_~n~0))} #128#return; {55423#(and (< 1 main_~r~0) (<= main_~r~0 main_~n~0))} is VALID [2022-04-08 03:55:45,902 INFO L290 TraceCheckUtils]: 92: Hoare triple {55423#(and (< 1 main_~r~0) (<= main_~r~0 main_~n~0))} ~i~0 := ~j~0;~j~0 := 2 * ~j~0; {55423#(and (< 1 main_~r~0) (<= main_~r~0 main_~n~0))} is VALID [2022-04-08 03:55:45,902 INFO L290 TraceCheckUtils]: 93: Hoare triple {55423#(and (< 1 main_~r~0) (<= main_~r~0 main_~n~0))} assume !!(~j~0 <= ~r~0); {55423#(and (< 1 main_~r~0) (<= main_~r~0 main_~n~0))} is VALID [2022-04-08 03:55:45,902 INFO L290 TraceCheckUtils]: 94: Hoare triple {55423#(and (< 1 main_~r~0) (<= main_~r~0 main_~n~0))} assume ~j~0 < ~r~0; {55423#(and (< 1 main_~r~0) (<= main_~r~0 main_~n~0))} is VALID [2022-04-08 03:55:45,902 INFO L272 TraceCheckUtils]: 95: Hoare triple {55423#(and (< 1 main_~r~0) (<= main_~r~0 main_~n~0))} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {55194#true} is VALID [2022-04-08 03:55:45,902 INFO L290 TraceCheckUtils]: 96: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-08 03:55:45,902 INFO L290 TraceCheckUtils]: 97: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-08 03:55:45,903 INFO L290 TraceCheckUtils]: 98: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-08 03:55:45,903 INFO L284 TraceCheckUtils]: 99: Hoare quadruple {55194#true} {55423#(and (< 1 main_~r~0) (<= main_~r~0 main_~n~0))} #110#return; {55423#(and (< 1 main_~r~0) (<= main_~r~0 main_~n~0))} is VALID [2022-04-08 03:55:45,903 INFO L272 TraceCheckUtils]: 100: Hoare triple {55423#(and (< 1 main_~r~0) (<= main_~r~0 main_~n~0))} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {55194#true} is VALID [2022-04-08 03:55:45,903 INFO L290 TraceCheckUtils]: 101: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-08 03:55:45,903 INFO L290 TraceCheckUtils]: 102: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-08 03:55:45,903 INFO L290 TraceCheckUtils]: 103: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-08 03:55:45,904 INFO L284 TraceCheckUtils]: 104: Hoare quadruple {55194#true} {55423#(and (< 1 main_~r~0) (<= main_~r~0 main_~n~0))} #112#return; {55423#(and (< 1 main_~r~0) (<= main_~r~0 main_~n~0))} is VALID [2022-04-08 03:55:45,904 INFO L272 TraceCheckUtils]: 105: Hoare triple {55423#(and (< 1 main_~r~0) (<= main_~r~0 main_~n~0))} call __VERIFIER_assert((if 1 <= 1 + ~j~0 then 1 else 0)); {55194#true} is VALID [2022-04-08 03:55:45,904 INFO L290 TraceCheckUtils]: 106: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-08 03:55:45,904 INFO L290 TraceCheckUtils]: 107: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-08 03:55:45,904 INFO L290 TraceCheckUtils]: 108: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-08 03:55:45,926 INFO L284 TraceCheckUtils]: 109: Hoare quadruple {55194#true} {55423#(and (< 1 main_~r~0) (<= main_~r~0 main_~n~0))} #114#return; {55423#(and (< 1 main_~r~0) (<= main_~r~0 main_~n~0))} is VALID [2022-04-08 03:55:45,926 INFO L272 TraceCheckUtils]: 110: Hoare triple {55423#(and (< 1 main_~r~0) (<= main_~r~0 main_~n~0))} call __VERIFIER_assert((if 1 + ~j~0 <= ~n~0 then 1 else 0)); {55194#true} is VALID [2022-04-08 03:55:45,926 INFO L290 TraceCheckUtils]: 111: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-08 03:55:45,927 INFO L290 TraceCheckUtils]: 112: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-08 03:55:45,927 INFO L290 TraceCheckUtils]: 113: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-08 03:55:45,927 INFO L284 TraceCheckUtils]: 114: Hoare quadruple {55194#true} {55423#(and (< 1 main_~r~0) (<= main_~r~0 main_~n~0))} #116#return; {55423#(and (< 1 main_~r~0) (<= main_~r~0 main_~n~0))} is VALID [2022-04-08 03:55:45,927 INFO L290 TraceCheckUtils]: 115: Hoare triple {55423#(and (< 1 main_~r~0) (<= main_~r~0 main_~n~0))} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {55423#(and (< 1 main_~r~0) (<= main_~r~0 main_~n~0))} is VALID [2022-04-08 03:55:45,928 INFO L290 TraceCheckUtils]: 116: Hoare triple {55423#(and (< 1 main_~r~0) (<= main_~r~0 main_~n~0))} assume !(0 != #t~nondet4);havoc #t~nondet4; {55423#(and (< 1 main_~r~0) (<= main_~r~0 main_~n~0))} is VALID [2022-04-08 03:55:45,928 INFO L272 TraceCheckUtils]: 117: Hoare triple {55423#(and (< 1 main_~r~0) (<= main_~r~0 main_~n~0))} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {55194#true} is VALID [2022-04-08 03:55:45,928 INFO L290 TraceCheckUtils]: 118: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-08 03:55:45,928 INFO L290 TraceCheckUtils]: 119: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-08 03:55:45,928 INFO L290 TraceCheckUtils]: 120: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-08 03:55:45,928 INFO L284 TraceCheckUtils]: 121: Hoare quadruple {55194#true} {55423#(and (< 1 main_~r~0) (<= main_~r~0 main_~n~0))} #118#return; {55423#(and (< 1 main_~r~0) (<= main_~r~0 main_~n~0))} is VALID [2022-04-08 03:55:45,928 INFO L272 TraceCheckUtils]: 122: Hoare triple {55423#(and (< 1 main_~r~0) (<= main_~r~0 main_~n~0))} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {55194#true} is VALID [2022-04-08 03:55:45,928 INFO L290 TraceCheckUtils]: 123: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-08 03:55:45,929 INFO L290 TraceCheckUtils]: 124: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-08 03:55:45,929 INFO L290 TraceCheckUtils]: 125: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-08 03:55:45,929 INFO L284 TraceCheckUtils]: 126: Hoare quadruple {55194#true} {55423#(and (< 1 main_~r~0) (<= main_~r~0 main_~n~0))} #120#return; {55423#(and (< 1 main_~r~0) (<= main_~r~0 main_~n~0))} is VALID [2022-04-08 03:55:45,929 INFO L290 TraceCheckUtils]: 127: Hoare triple {55423#(and (< 1 main_~r~0) (<= main_~r~0 main_~n~0))} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {55423#(and (< 1 main_~r~0) (<= main_~r~0 main_~n~0))} is VALID [2022-04-08 03:55:45,930 INFO L290 TraceCheckUtils]: 128: Hoare triple {55423#(and (< 1 main_~r~0) (<= main_~r~0 main_~n~0))} assume !(0 != #t~nondet5);havoc #t~nondet5; {55423#(and (< 1 main_~r~0) (<= main_~r~0 main_~n~0))} is VALID [2022-04-08 03:55:45,930 INFO L272 TraceCheckUtils]: 129: Hoare triple {55423#(and (< 1 main_~r~0) (<= main_~r~0 main_~n~0))} call __VERIFIER_assert((if 1 <= ~i~0 then 1 else 0)); {55194#true} is VALID [2022-04-08 03:55:45,930 INFO L290 TraceCheckUtils]: 130: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-08 03:55:45,930 INFO L290 TraceCheckUtils]: 131: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-08 03:55:45,930 INFO L290 TraceCheckUtils]: 132: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-08 03:55:45,930 INFO L284 TraceCheckUtils]: 133: Hoare quadruple {55194#true} {55423#(and (< 1 main_~r~0) (<= main_~r~0 main_~n~0))} #122#return; {55423#(and (< 1 main_~r~0) (<= main_~r~0 main_~n~0))} is VALID [2022-04-08 03:55:45,930 INFO L272 TraceCheckUtils]: 134: Hoare triple {55423#(and (< 1 main_~r~0) (<= main_~r~0 main_~n~0))} call __VERIFIER_assert((if ~i~0 <= ~n~0 then 1 else 0)); {55194#true} is VALID [2022-04-08 03:55:45,930 INFO L290 TraceCheckUtils]: 135: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-08 03:55:45,931 INFO L290 TraceCheckUtils]: 136: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-08 03:55:45,931 INFO L290 TraceCheckUtils]: 137: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-08 03:55:45,931 INFO L284 TraceCheckUtils]: 138: Hoare quadruple {55194#true} {55423#(and (< 1 main_~r~0) (<= main_~r~0 main_~n~0))} #124#return; {55423#(and (< 1 main_~r~0) (<= main_~r~0 main_~n~0))} is VALID [2022-04-08 03:55:45,931 INFO L272 TraceCheckUtils]: 139: Hoare triple {55423#(and (< 1 main_~r~0) (<= main_~r~0 main_~n~0))} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {55194#true} is VALID [2022-04-08 03:55:45,931 INFO L290 TraceCheckUtils]: 140: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-08 03:55:45,931 INFO L290 TraceCheckUtils]: 141: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-08 03:55:45,931 INFO L290 TraceCheckUtils]: 142: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-08 03:55:45,932 INFO L284 TraceCheckUtils]: 143: Hoare quadruple {55194#true} {55423#(and (< 1 main_~r~0) (<= main_~r~0 main_~n~0))} #126#return; {55423#(and (< 1 main_~r~0) (<= main_~r~0 main_~n~0))} is VALID [2022-04-08 03:55:45,932 INFO L272 TraceCheckUtils]: 144: Hoare triple {55423#(and (< 1 main_~r~0) (<= main_~r~0 main_~n~0))} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {55194#true} is VALID [2022-04-08 03:55:45,932 INFO L290 TraceCheckUtils]: 145: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-08 03:55:45,932 INFO L290 TraceCheckUtils]: 146: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-08 03:55:45,932 INFO L290 TraceCheckUtils]: 147: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-08 03:55:45,932 INFO L284 TraceCheckUtils]: 148: Hoare quadruple {55194#true} {55423#(and (< 1 main_~r~0) (<= main_~r~0 main_~n~0))} #128#return; {55423#(and (< 1 main_~r~0) (<= main_~r~0 main_~n~0))} is VALID [2022-04-08 03:55:45,933 INFO L290 TraceCheckUtils]: 149: Hoare triple {55423#(and (< 1 main_~r~0) (<= main_~r~0 main_~n~0))} ~i~0 := ~j~0;~j~0 := 2 * ~j~0; {55766#(and (< 1 main_~r~0) (<= main_~r~0 main_~n~0) (<= main_~i~0 (div main_~j~0 2)))} is VALID [2022-04-08 03:55:45,933 INFO L290 TraceCheckUtils]: 150: Hoare triple {55766#(and (< 1 main_~r~0) (<= main_~r~0 main_~n~0) (<= main_~i~0 (div main_~j~0 2)))} assume !!(~j~0 <= ~r~0); {55770#(and (<= main_~i~0 (div main_~n~0 2)) (< 1 main_~n~0))} is VALID [2022-04-08 03:55:45,934 INFO L290 TraceCheckUtils]: 151: Hoare triple {55770#(and (<= main_~i~0 (div main_~n~0 2)) (< 1 main_~n~0))} assume !(~j~0 < ~r~0); {55770#(and (<= main_~i~0 (div main_~n~0 2)) (< 1 main_~n~0))} is VALID [2022-04-08 03:55:45,934 INFO L272 TraceCheckUtils]: 152: Hoare triple {55770#(and (<= main_~i~0 (div main_~n~0 2)) (< 1 main_~n~0))} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {55194#true} is VALID [2022-04-08 03:55:45,934 INFO L290 TraceCheckUtils]: 153: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-08 03:55:45,934 INFO L290 TraceCheckUtils]: 154: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-08 03:55:45,934 INFO L290 TraceCheckUtils]: 155: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-08 03:55:45,934 INFO L284 TraceCheckUtils]: 156: Hoare quadruple {55194#true} {55770#(and (<= main_~i~0 (div main_~n~0 2)) (< 1 main_~n~0))} #118#return; {55770#(and (<= main_~i~0 (div main_~n~0 2)) (< 1 main_~n~0))} is VALID [2022-04-08 03:55:45,934 INFO L272 TraceCheckUtils]: 157: Hoare triple {55770#(and (<= main_~i~0 (div main_~n~0 2)) (< 1 main_~n~0))} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {55194#true} is VALID [2022-04-08 03:55:45,935 INFO L290 TraceCheckUtils]: 158: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-08 03:55:45,935 INFO L290 TraceCheckUtils]: 159: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-08 03:55:45,935 INFO L290 TraceCheckUtils]: 160: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-08 03:55:45,935 INFO L284 TraceCheckUtils]: 161: Hoare quadruple {55194#true} {55770#(and (<= main_~i~0 (div main_~n~0 2)) (< 1 main_~n~0))} #120#return; {55770#(and (<= main_~i~0 (div main_~n~0 2)) (< 1 main_~n~0))} is VALID [2022-04-08 03:55:45,935 INFO L290 TraceCheckUtils]: 162: Hoare triple {55770#(and (<= main_~i~0 (div main_~n~0 2)) (< 1 main_~n~0))} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {55770#(and (<= main_~i~0 (div main_~n~0 2)) (< 1 main_~n~0))} is VALID [2022-04-08 03:55:45,936 INFO L290 TraceCheckUtils]: 163: Hoare triple {55770#(and (<= main_~i~0 (div main_~n~0 2)) (< 1 main_~n~0))} assume !(0 != #t~nondet5);havoc #t~nondet5; {55770#(and (<= main_~i~0 (div main_~n~0 2)) (< 1 main_~n~0))} is VALID [2022-04-08 03:55:45,936 INFO L272 TraceCheckUtils]: 164: Hoare triple {55770#(and (<= main_~i~0 (div main_~n~0 2)) (< 1 main_~n~0))} call __VERIFIER_assert((if 1 <= ~i~0 then 1 else 0)); {55194#true} is VALID [2022-04-08 03:55:45,936 INFO L290 TraceCheckUtils]: 165: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-08 03:55:45,936 INFO L290 TraceCheckUtils]: 166: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-08 03:55:45,936 INFO L290 TraceCheckUtils]: 167: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-08 03:55:45,936 INFO L284 TraceCheckUtils]: 168: Hoare quadruple {55194#true} {55770#(and (<= main_~i~0 (div main_~n~0 2)) (< 1 main_~n~0))} #122#return; {55770#(and (<= main_~i~0 (div main_~n~0 2)) (< 1 main_~n~0))} is VALID [2022-04-08 03:55:45,937 INFO L272 TraceCheckUtils]: 169: Hoare triple {55770#(and (<= main_~i~0 (div main_~n~0 2)) (< 1 main_~n~0))} call __VERIFIER_assert((if ~i~0 <= ~n~0 then 1 else 0)); {55828#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 03:55:45,937 INFO L290 TraceCheckUtils]: 170: Hoare triple {55828#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {55832#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 03:55:45,937 INFO L290 TraceCheckUtils]: 171: Hoare triple {55832#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {55195#false} is VALID [2022-04-08 03:55:45,937 INFO L290 TraceCheckUtils]: 172: Hoare triple {55195#false} assume !false; {55195#false} is VALID [2022-04-08 03:55:45,938 INFO L134 CoverageAnalysis]: Checked inductivity of 1510 backedges. 69 proven. 19 refuted. 0 times theorem prover too weak. 1422 trivial. 0 not checked. [2022-04-08 03:55:45,938 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 03:55:46,629 INFO L290 TraceCheckUtils]: 172: Hoare triple {55195#false} assume !false; {55195#false} is VALID [2022-04-08 03:55:46,630 INFO L290 TraceCheckUtils]: 171: Hoare triple {55832#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {55195#false} is VALID [2022-04-08 03:55:46,630 INFO L290 TraceCheckUtils]: 170: Hoare triple {55828#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {55832#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 03:55:46,631 INFO L272 TraceCheckUtils]: 169: Hoare triple {55848#(<= main_~i~0 main_~n~0)} call __VERIFIER_assert((if ~i~0 <= ~n~0 then 1 else 0)); {55828#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 03:55:46,631 INFO L284 TraceCheckUtils]: 168: Hoare quadruple {55194#true} {55848#(<= main_~i~0 main_~n~0)} #122#return; {55848#(<= main_~i~0 main_~n~0)} is VALID [2022-04-08 03:55:46,631 INFO L290 TraceCheckUtils]: 167: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-08 03:55:46,631 INFO L290 TraceCheckUtils]: 166: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-08 03:55:46,632 INFO L290 TraceCheckUtils]: 165: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-08 03:55:46,632 INFO L272 TraceCheckUtils]: 164: Hoare triple {55848#(<= main_~i~0 main_~n~0)} call __VERIFIER_assert((if 1 <= ~i~0 then 1 else 0)); {55194#true} is VALID [2022-04-08 03:55:46,632 INFO L290 TraceCheckUtils]: 163: Hoare triple {55848#(<= main_~i~0 main_~n~0)} assume !(0 != #t~nondet5);havoc #t~nondet5; {55848#(<= main_~i~0 main_~n~0)} is VALID [2022-04-08 03:55:46,632 INFO L290 TraceCheckUtils]: 162: Hoare triple {55848#(<= main_~i~0 main_~n~0)} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {55848#(<= main_~i~0 main_~n~0)} is VALID [2022-04-08 03:55:46,633 INFO L284 TraceCheckUtils]: 161: Hoare quadruple {55194#true} {55848#(<= main_~i~0 main_~n~0)} #120#return; {55848#(<= main_~i~0 main_~n~0)} is VALID [2022-04-08 03:55:46,633 INFO L290 TraceCheckUtils]: 160: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-08 03:55:46,633 INFO L290 TraceCheckUtils]: 159: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-08 03:55:46,633 INFO L290 TraceCheckUtils]: 158: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-08 03:55:46,633 INFO L272 TraceCheckUtils]: 157: Hoare triple {55848#(<= main_~i~0 main_~n~0)} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {55194#true} is VALID [2022-04-08 03:55:46,634 INFO L284 TraceCheckUtils]: 156: Hoare quadruple {55194#true} {55848#(<= main_~i~0 main_~n~0)} #118#return; {55848#(<= main_~i~0 main_~n~0)} is VALID [2022-04-08 03:55:46,634 INFO L290 TraceCheckUtils]: 155: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-08 03:55:46,634 INFO L290 TraceCheckUtils]: 154: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-08 03:55:46,634 INFO L290 TraceCheckUtils]: 153: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-08 03:55:46,634 INFO L272 TraceCheckUtils]: 152: Hoare triple {55848#(<= main_~i~0 main_~n~0)} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {55194#true} is VALID [2022-04-08 03:55:46,634 INFO L290 TraceCheckUtils]: 151: Hoare triple {55848#(<= main_~i~0 main_~n~0)} assume !(~j~0 < ~r~0); {55848#(<= main_~i~0 main_~n~0)} is VALID [2022-04-08 03:55:46,635 INFO L290 TraceCheckUtils]: 150: Hoare triple {55906#(or (<= main_~i~0 main_~n~0) (not (<= main_~j~0 main_~r~0)))} assume !!(~j~0 <= ~r~0); {55848#(<= main_~i~0 main_~n~0)} is VALID [2022-04-08 03:55:46,635 INFO L290 TraceCheckUtils]: 149: Hoare triple {55910#(<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1))} ~i~0 := ~j~0;~j~0 := 2 * ~j~0; {55906#(or (<= main_~i~0 main_~n~0) (not (<= main_~j~0 main_~r~0)))} is VALID [2022-04-08 03:55:46,636 INFO L284 TraceCheckUtils]: 148: Hoare quadruple {55194#true} {55910#(<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1))} #128#return; {55910#(<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1))} is VALID [2022-04-08 03:55:46,636 INFO L290 TraceCheckUtils]: 147: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-08 03:55:46,636 INFO L290 TraceCheckUtils]: 146: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-08 03:55:46,636 INFO L290 TraceCheckUtils]: 145: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-08 03:55:46,636 INFO L272 TraceCheckUtils]: 144: Hoare triple {55910#(<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1))} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {55194#true} is VALID [2022-04-08 03:55:46,637 INFO L284 TraceCheckUtils]: 143: Hoare quadruple {55194#true} {55910#(<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1))} #126#return; {55910#(<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1))} is VALID [2022-04-08 03:55:46,637 INFO L290 TraceCheckUtils]: 142: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-08 03:55:46,637 INFO L290 TraceCheckUtils]: 141: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-08 03:55:46,637 INFO L290 TraceCheckUtils]: 140: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-08 03:55:46,637 INFO L272 TraceCheckUtils]: 139: Hoare triple {55910#(<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1))} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {55194#true} is VALID [2022-04-08 03:55:46,637 INFO L284 TraceCheckUtils]: 138: Hoare quadruple {55194#true} {55910#(<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1))} #124#return; {55910#(<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1))} is VALID [2022-04-08 03:55:46,638 INFO L290 TraceCheckUtils]: 137: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-08 03:55:46,638 INFO L290 TraceCheckUtils]: 136: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-08 03:55:46,638 INFO L290 TraceCheckUtils]: 135: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-08 03:55:46,638 INFO L272 TraceCheckUtils]: 134: Hoare triple {55910#(<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1))} call __VERIFIER_assert((if ~i~0 <= ~n~0 then 1 else 0)); {55194#true} is VALID [2022-04-08 03:55:46,638 INFO L284 TraceCheckUtils]: 133: Hoare quadruple {55194#true} {55910#(<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1))} #122#return; {55910#(<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1))} is VALID [2022-04-08 03:55:46,638 INFO L290 TraceCheckUtils]: 132: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-08 03:55:46,638 INFO L290 TraceCheckUtils]: 131: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-08 03:55:46,639 INFO L290 TraceCheckUtils]: 130: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-08 03:55:46,639 INFO L272 TraceCheckUtils]: 129: Hoare triple {55910#(<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1))} call __VERIFIER_assert((if 1 <= ~i~0 then 1 else 0)); {55194#true} is VALID [2022-04-08 03:55:46,639 INFO L290 TraceCheckUtils]: 128: Hoare triple {55910#(<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1))} assume !(0 != #t~nondet5);havoc #t~nondet5; {55910#(<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1))} is VALID [2022-04-08 03:55:46,639 INFO L290 TraceCheckUtils]: 127: Hoare triple {55910#(<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1))} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {55910#(<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1))} is VALID [2022-04-08 03:55:46,640 INFO L284 TraceCheckUtils]: 126: Hoare quadruple {55194#true} {55910#(<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1))} #120#return; {55910#(<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1))} is VALID [2022-04-08 03:55:46,640 INFO L290 TraceCheckUtils]: 125: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-08 03:55:46,640 INFO L290 TraceCheckUtils]: 124: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-08 03:55:46,640 INFO L290 TraceCheckUtils]: 123: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-08 03:55:46,640 INFO L272 TraceCheckUtils]: 122: Hoare triple {55910#(<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1))} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {55194#true} is VALID [2022-04-08 03:55:46,641 INFO L284 TraceCheckUtils]: 121: Hoare quadruple {55194#true} {55910#(<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1))} #118#return; {55910#(<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1))} is VALID [2022-04-08 03:55:46,641 INFO L290 TraceCheckUtils]: 120: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-08 03:55:46,641 INFO L290 TraceCheckUtils]: 119: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-08 03:55:46,641 INFO L290 TraceCheckUtils]: 118: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-08 03:55:46,641 INFO L272 TraceCheckUtils]: 117: Hoare triple {55910#(<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1))} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {55194#true} is VALID [2022-04-08 03:55:46,641 INFO L290 TraceCheckUtils]: 116: Hoare triple {55910#(<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1))} assume !(0 != #t~nondet4);havoc #t~nondet4; {55910#(<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1))} is VALID [2022-04-08 03:55:46,642 INFO L290 TraceCheckUtils]: 115: Hoare triple {55910#(<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1))} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {55910#(<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1))} is VALID [2022-04-08 03:55:46,642 INFO L284 TraceCheckUtils]: 114: Hoare quadruple {55194#true} {55910#(<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1))} #116#return; {55910#(<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1))} is VALID [2022-04-08 03:55:46,642 INFO L290 TraceCheckUtils]: 113: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-08 03:55:46,642 INFO L290 TraceCheckUtils]: 112: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-08 03:55:46,642 INFO L290 TraceCheckUtils]: 111: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-08 03:55:46,642 INFO L272 TraceCheckUtils]: 110: Hoare triple {55910#(<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1))} call __VERIFIER_assert((if 1 + ~j~0 <= ~n~0 then 1 else 0)); {55194#true} is VALID [2022-04-08 03:55:46,643 INFO L284 TraceCheckUtils]: 109: Hoare quadruple {55194#true} {55910#(<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1))} #114#return; {55910#(<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1))} is VALID [2022-04-08 03:55:46,643 INFO L290 TraceCheckUtils]: 108: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-08 03:55:46,643 INFO L290 TraceCheckUtils]: 107: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-08 03:55:46,643 INFO L290 TraceCheckUtils]: 106: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-08 03:55:46,643 INFO L272 TraceCheckUtils]: 105: Hoare triple {55910#(<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1))} call __VERIFIER_assert((if 1 <= 1 + ~j~0 then 1 else 0)); {55194#true} is VALID [2022-04-08 03:55:46,644 INFO L284 TraceCheckUtils]: 104: Hoare quadruple {55194#true} {55910#(<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1))} #112#return; {55910#(<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1))} is VALID [2022-04-08 03:55:46,644 INFO L290 TraceCheckUtils]: 103: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-08 03:55:46,644 INFO L290 TraceCheckUtils]: 102: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-08 03:55:46,644 INFO L290 TraceCheckUtils]: 101: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-08 03:55:46,644 INFO L272 TraceCheckUtils]: 100: Hoare triple {55910#(<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1))} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {55194#true} is VALID [2022-04-08 03:55:46,645 INFO L284 TraceCheckUtils]: 99: Hoare quadruple {55194#true} {55910#(<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1))} #110#return; {55910#(<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1))} is VALID [2022-04-08 03:55:46,645 INFO L290 TraceCheckUtils]: 98: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-08 03:55:46,645 INFO L290 TraceCheckUtils]: 97: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-08 03:55:46,645 INFO L290 TraceCheckUtils]: 96: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-08 03:55:46,645 INFO L272 TraceCheckUtils]: 95: Hoare triple {55910#(<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1))} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {55194#true} is VALID [2022-04-08 03:55:46,645 INFO L290 TraceCheckUtils]: 94: Hoare triple {55910#(<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1))} assume ~j~0 < ~r~0; {55910#(<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1))} is VALID [2022-04-08 03:55:46,646 INFO L290 TraceCheckUtils]: 93: Hoare triple {55910#(<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1))} assume !!(~j~0 <= ~r~0); {55910#(<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1))} is VALID [2022-04-08 03:55:46,646 INFO L290 TraceCheckUtils]: 92: Hoare triple {55910#(<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1))} ~i~0 := ~j~0;~j~0 := 2 * ~j~0; {55910#(<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1))} is VALID [2022-04-08 03:55:46,646 INFO L284 TraceCheckUtils]: 91: Hoare quadruple {55194#true} {55910#(<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1))} #128#return; {55910#(<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1))} is VALID [2022-04-08 03:55:46,646 INFO L290 TraceCheckUtils]: 90: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-08 03:55:46,647 INFO L290 TraceCheckUtils]: 89: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-08 03:55:46,647 INFO L290 TraceCheckUtils]: 88: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-08 03:55:46,647 INFO L272 TraceCheckUtils]: 87: Hoare triple {55910#(<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1))} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {55194#true} is VALID [2022-04-08 03:55:46,647 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {55194#true} {55910#(<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1))} #126#return; {55910#(<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1))} is VALID [2022-04-08 03:55:46,647 INFO L290 TraceCheckUtils]: 85: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-08 03:55:46,647 INFO L290 TraceCheckUtils]: 84: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-08 03:55:46,648 INFO L290 TraceCheckUtils]: 83: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-08 03:55:46,648 INFO L272 TraceCheckUtils]: 82: Hoare triple {55910#(<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1))} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {55194#true} is VALID [2022-04-08 03:55:46,648 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {55194#true} {55910#(<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1))} #124#return; {55910#(<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1))} is VALID [2022-04-08 03:55:46,648 INFO L290 TraceCheckUtils]: 80: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-08 03:55:46,648 INFO L290 TraceCheckUtils]: 79: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-08 03:55:46,648 INFO L290 TraceCheckUtils]: 78: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-08 03:55:46,648 INFO L272 TraceCheckUtils]: 77: Hoare triple {55910#(<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1))} call __VERIFIER_assert((if ~i~0 <= ~n~0 then 1 else 0)); {55194#true} is VALID [2022-04-08 03:55:46,649 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {55194#true} {55910#(<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1))} #122#return; {55910#(<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1))} is VALID [2022-04-08 03:55:46,649 INFO L290 TraceCheckUtils]: 75: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-08 03:55:46,649 INFO L290 TraceCheckUtils]: 74: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-08 03:55:46,649 INFO L290 TraceCheckUtils]: 73: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-08 03:55:46,649 INFO L272 TraceCheckUtils]: 72: Hoare triple {55910#(<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1))} call __VERIFIER_assert((if 1 <= ~i~0 then 1 else 0)); {55194#true} is VALID [2022-04-08 03:55:46,650 INFO L290 TraceCheckUtils]: 71: Hoare triple {55910#(<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1))} assume !(0 != #t~nondet5);havoc #t~nondet5; {55910#(<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1))} is VALID [2022-04-08 03:55:46,650 INFO L290 TraceCheckUtils]: 70: Hoare triple {55910#(<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1))} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {55910#(<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1))} is VALID [2022-04-08 03:55:46,650 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {55194#true} {55910#(<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1))} #120#return; {55910#(<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1))} is VALID [2022-04-08 03:55:46,650 INFO L290 TraceCheckUtils]: 68: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-08 03:55:46,651 INFO L290 TraceCheckUtils]: 67: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-08 03:55:46,651 INFO L290 TraceCheckUtils]: 66: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-08 03:55:46,651 INFO L272 TraceCheckUtils]: 65: Hoare triple {55910#(<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1))} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {55194#true} is VALID [2022-04-08 03:55:46,651 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {55194#true} {55910#(<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1))} #118#return; {55910#(<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1))} is VALID [2022-04-08 03:55:46,651 INFO L290 TraceCheckUtils]: 63: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-08 03:55:46,651 INFO L290 TraceCheckUtils]: 62: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-08 03:55:46,651 INFO L290 TraceCheckUtils]: 61: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-08 03:55:46,652 INFO L272 TraceCheckUtils]: 60: Hoare triple {55910#(<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1))} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {55194#true} is VALID [2022-04-08 03:55:46,652 INFO L290 TraceCheckUtils]: 59: Hoare triple {55910#(<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1))} assume !(0 != #t~nondet4);havoc #t~nondet4; {55910#(<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1))} is VALID [2022-04-08 03:55:46,652 INFO L290 TraceCheckUtils]: 58: Hoare triple {55910#(<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1))} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {55910#(<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1))} is VALID [2022-04-08 03:55:46,653 INFO L284 TraceCheckUtils]: 57: Hoare quadruple {55194#true} {55910#(<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1))} #116#return; {55910#(<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1))} is VALID [2022-04-08 03:55:46,653 INFO L290 TraceCheckUtils]: 56: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-08 03:55:46,653 INFO L290 TraceCheckUtils]: 55: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-08 03:55:46,653 INFO L290 TraceCheckUtils]: 54: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-08 03:55:46,653 INFO L272 TraceCheckUtils]: 53: Hoare triple {55910#(<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1))} call __VERIFIER_assert((if 1 + ~j~0 <= ~n~0 then 1 else 0)); {55194#true} is VALID [2022-04-08 03:55:46,654 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {55194#true} {55910#(<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1))} #114#return; {55910#(<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1))} is VALID [2022-04-08 03:55:46,654 INFO L290 TraceCheckUtils]: 51: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-08 03:55:46,654 INFO L290 TraceCheckUtils]: 50: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-08 03:55:46,654 INFO L290 TraceCheckUtils]: 49: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-08 03:55:46,654 INFO L272 TraceCheckUtils]: 48: Hoare triple {55910#(<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1))} call __VERIFIER_assert((if 1 <= 1 + ~j~0 then 1 else 0)); {55194#true} is VALID [2022-04-08 03:55:46,655 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {55194#true} {55910#(<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1))} #112#return; {55910#(<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1))} is VALID [2022-04-08 03:55:46,655 INFO L290 TraceCheckUtils]: 46: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-08 03:55:46,655 INFO L290 TraceCheckUtils]: 45: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-08 03:55:46,655 INFO L290 TraceCheckUtils]: 44: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-08 03:55:46,655 INFO L272 TraceCheckUtils]: 43: Hoare triple {55910#(<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1))} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {55194#true} is VALID [2022-04-08 03:55:46,655 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {55194#true} {55910#(<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1))} #110#return; {55910#(<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1))} is VALID [2022-04-08 03:55:46,656 INFO L290 TraceCheckUtils]: 41: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-08 03:55:46,656 INFO L290 TraceCheckUtils]: 40: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-08 03:55:46,656 INFO L290 TraceCheckUtils]: 39: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-08 03:55:46,656 INFO L272 TraceCheckUtils]: 38: Hoare triple {55910#(<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1))} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {55194#true} is VALID [2022-04-08 03:55:46,656 INFO L290 TraceCheckUtils]: 37: Hoare triple {55910#(<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1))} assume ~j~0 < ~r~0; {55910#(<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1))} is VALID [2022-04-08 03:55:46,657 INFO L290 TraceCheckUtils]: 36: Hoare triple {55910#(<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1))} assume !!(~j~0 <= ~r~0); {55910#(<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1))} is VALID [2022-04-08 03:55:46,657 INFO L290 TraceCheckUtils]: 35: Hoare triple {56253#(or (not (< 1 main_~r~0)) (<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1)))} assume !!(~r~0 > 1);~i~0 := ~l~0;~j~0 := 2 * ~l~0; {55910#(<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1))} is VALID [2022-04-08 03:55:46,657 INFO L290 TraceCheckUtils]: 34: Hoare triple {56253#(or (not (< 1 main_~r~0)) (<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1)))} #t~post6 := ~l~0;~l~0 := #t~post6 - 1;havoc #t~post6; {56253#(or (not (< 1 main_~r~0)) (<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1)))} is VALID [2022-04-08 03:55:46,658 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {55194#true} {56253#(or (not (< 1 main_~r~0)) (<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1)))} #132#return; {56253#(or (not (< 1 main_~r~0)) (<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1)))} is VALID [2022-04-08 03:55:46,658 INFO L290 TraceCheckUtils]: 32: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-08 03:55:46,658 INFO L290 TraceCheckUtils]: 31: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-08 03:55:46,658 INFO L290 TraceCheckUtils]: 30: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-08 03:55:46,658 INFO L272 TraceCheckUtils]: 29: Hoare triple {56253#(or (not (< 1 main_~r~0)) (<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1)))} call __VERIFIER_assert((if ~l~0 <= ~n~0 then 1 else 0)); {55194#true} is VALID [2022-04-08 03:55:46,659 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {55194#true} {56253#(or (not (< 1 main_~r~0)) (<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1)))} #130#return; {56253#(or (not (< 1 main_~r~0)) (<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1)))} is VALID [2022-04-08 03:55:46,659 INFO L290 TraceCheckUtils]: 27: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-08 03:55:46,659 INFO L290 TraceCheckUtils]: 26: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-08 03:55:46,659 INFO L290 TraceCheckUtils]: 25: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-08 03:55:46,659 INFO L272 TraceCheckUtils]: 24: Hoare triple {56253#(or (not (< 1 main_~r~0)) (<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1)))} call __VERIFIER_assert((if 1 <= ~l~0 then 1 else 0)); {55194#true} is VALID [2022-04-08 03:55:46,660 INFO L290 TraceCheckUtils]: 23: Hoare triple {56253#(or (not (< 1 main_~r~0)) (<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1)))} assume ~l~0 > 1; {56253#(or (not (< 1 main_~r~0)) (<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1)))} is VALID [2022-04-08 03:55:46,660 INFO L290 TraceCheckUtils]: 22: Hoare triple {56253#(or (not (< 1 main_~r~0)) (<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1)))} assume 0 != #t~nondet5;havoc #t~nondet5; {56253#(or (not (< 1 main_~r~0)) (<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1)))} is VALID [2022-04-08 03:55:46,660 INFO L290 TraceCheckUtils]: 21: Hoare triple {56253#(or (not (< 1 main_~r~0)) (<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1)))} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {56253#(or (not (< 1 main_~r~0)) (<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1)))} is VALID [2022-04-08 03:55:46,661 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {55194#true} {56253#(or (not (< 1 main_~r~0)) (<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1)))} #120#return; {56253#(or (not (< 1 main_~r~0)) (<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1)))} is VALID [2022-04-08 03:55:46,661 INFO L290 TraceCheckUtils]: 19: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-08 03:55:46,661 INFO L290 TraceCheckUtils]: 18: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-08 03:55:46,661 INFO L290 TraceCheckUtils]: 17: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-08 03:55:46,661 INFO L272 TraceCheckUtils]: 16: Hoare triple {56253#(or (not (< 1 main_~r~0)) (<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1)))} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {55194#true} is VALID [2022-04-08 03:55:46,661 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {55194#true} {56253#(or (not (< 1 main_~r~0)) (<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1)))} #118#return; {56253#(or (not (< 1 main_~r~0)) (<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1)))} is VALID [2022-04-08 03:55:46,662 INFO L290 TraceCheckUtils]: 14: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-08 03:55:46,662 INFO L290 TraceCheckUtils]: 13: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-08 03:55:46,662 INFO L290 TraceCheckUtils]: 12: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-08 03:55:46,662 INFO L272 TraceCheckUtils]: 11: Hoare triple {56253#(or (not (< 1 main_~r~0)) (<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1)))} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {55194#true} is VALID [2022-04-08 03:55:46,662 INFO L290 TraceCheckUtils]: 10: Hoare triple {56253#(or (not (< 1 main_~r~0)) (<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1)))} assume !(~j~0 < ~r~0); {56253#(or (not (< 1 main_~r~0)) (<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1)))} is VALID [2022-04-08 03:55:46,662 INFO L290 TraceCheckUtils]: 9: Hoare triple {56253#(or (not (< 1 main_~r~0)) (<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1)))} assume !!(~j~0 <= ~r~0); {56253#(or (not (< 1 main_~r~0)) (<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1)))} is VALID [2022-04-08 03:55:46,663 INFO L290 TraceCheckUtils]: 8: Hoare triple {56253#(or (not (< 1 main_~r~0)) (<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1)))} assume !!(~r~0 > 1);~i~0 := ~l~0;~j~0 := 2 * ~l~0; {56253#(or (not (< 1 main_~r~0)) (<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1)))} is VALID [2022-04-08 03:55:46,663 INFO L290 TraceCheckUtils]: 7: Hoare triple {56253#(or (not (< 1 main_~r~0)) (<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1)))} assume ~l~0 > 1;#t~post2 := ~l~0;~l~0 := #t~post2 - 1;havoc #t~post2; {56253#(or (not (< 1 main_~r~0)) (<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1)))} is VALID [2022-04-08 03:55:46,664 INFO L290 TraceCheckUtils]: 6: Hoare triple {55194#true} assume !!(1 <= ~n~0 && ~n~0 <= 1000000);~l~0 := 1 + (if ~n~0 < 0 && 0 != ~n~0 % 2 then 1 + ~n~0 / 2 else ~n~0 / 2);~r~0 := ~n~0; {56253#(or (not (< 1 main_~r~0)) (<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1)))} is VALID [2022-04-08 03:55:46,664 INFO L290 TraceCheckUtils]: 5: Hoare triple {55194#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;havoc ~n~0;havoc ~l~0;havoc ~r~0;havoc ~i~0;havoc ~j~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {55194#true} is VALID [2022-04-08 03:55:46,664 INFO L272 TraceCheckUtils]: 4: Hoare triple {55194#true} call #t~ret8 := main(#in~argc, #in~argv.base, #in~argv.offset); {55194#true} is VALID [2022-04-08 03:55:46,664 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {55194#true} {55194#true} #138#return; {55194#true} is VALID [2022-04-08 03:55:46,664 INFO L290 TraceCheckUtils]: 2: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-08 03:55:46,664 INFO L290 TraceCheckUtils]: 1: Hoare triple {55194#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(9, 2); {55194#true} is VALID [2022-04-08 03:55:46,664 INFO L272 TraceCheckUtils]: 0: Hoare triple {55194#true} call ULTIMATE.init(); {55194#true} is VALID [2022-04-08 03:55:46,665 INFO L134 CoverageAnalysis]: Checked inductivity of 1510 backedges. 66 proven. 22 refuted. 0 times theorem prover too weak. 1422 trivial. 0 not checked. [2022-04-08 03:55:46,665 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2144099584] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 03:55:46,665 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 03:55:46,666 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 19 [2022-04-08 03:55:46,666 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 03:55:46,666 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1397392961] [2022-04-08 03:55:46,666 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1397392961] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 03:55:46,666 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 03:55:46,666 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-08 03:55:46,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [354940748] [2022-04-08 03:55:46,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 03:55:46,667 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.888888888888889) internal successors, (35), 8 states have internal predecessors, (35), 5 states have call successors, (27), 3 states have call predecessors, (27), 1 states have return successors, (25), 5 states have call predecessors, (25), 5 states have call successors, (25) Word has length 173 [2022-04-08 03:55:46,667 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 03:55:46,667 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 3.888888888888889) internal successors, (35), 8 states have internal predecessors, (35), 5 states have call successors, (27), 3 states have call predecessors, (27), 1 states have return successors, (25), 5 states have call predecessors, (25), 5 states have call successors, (25) [2022-04-08 03:55:46,728 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 87 edges. 87 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:55:46,728 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-08 03:55:46,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 03:55:46,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-08 03:55:46,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=293, Unknown=0, NotChecked=0, Total=342 [2022-04-08 03:55:46,729 INFO L87 Difference]: Start difference. First operand 211 states and 276 transitions. Second operand has 9 states, 9 states have (on average 3.888888888888889) internal successors, (35), 8 states have internal predecessors, (35), 5 states have call successors, (27), 3 states have call predecessors, (27), 1 states have return successors, (25), 5 states have call predecessors, (25), 5 states have call successors, (25) [2022-04-08 03:55:49,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:55:49,202 INFO L93 Difference]: Finished difference Result 318 states and 407 transitions. [2022-04-08 03:55:49,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-08 03:55:49,202 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.888888888888889) internal successors, (35), 8 states have internal predecessors, (35), 5 states have call successors, (27), 3 states have call predecessors, (27), 1 states have return successors, (25), 5 states have call predecessors, (25), 5 states have call successors, (25) Word has length 173 [2022-04-08 03:55:49,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 03:55:49,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 3.888888888888889) internal successors, (35), 8 states have internal predecessors, (35), 5 states have call successors, (27), 3 states have call predecessors, (27), 1 states have return successors, (25), 5 states have call predecessors, (25), 5 states have call successors, (25) [2022-04-08 03:55:49,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 173 transitions. [2022-04-08 03:55:49,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 3.888888888888889) internal successors, (35), 8 states have internal predecessors, (35), 5 states have call successors, (27), 3 states have call predecessors, (27), 1 states have return successors, (25), 5 states have call predecessors, (25), 5 states have call successors, (25) [2022-04-08 03:55:49,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 173 transitions. [2022-04-08 03:55:49,206 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 173 transitions. [2022-04-08 03:55:49,375 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 173 edges. 173 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:55:49,376 INFO L225 Difference]: With dead ends: 318 [2022-04-08 03:55:49,376 INFO L226 Difference]: Without dead ends: 0 [2022-04-08 03:55:49,377 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 420 GetRequests, 392 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=141, Invalid=671, Unknown=0, NotChecked=0, Total=812 [2022-04-08 03:55:49,377 INFO L913 BasicCegarLoop]: 33 mSDtfsCounter, 86 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 388 mSolverCounterSat, 187 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 575 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 187 IncrementalHoareTripleChecker+Valid, 388 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-04-08 03:55:49,377 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [86 Valid, 60 Invalid, 575 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [187 Valid, 388 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-08 03:55:49,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-08 03:55:49,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-08 03:55:49,378 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 03:55:49,378 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 03:55:49,378 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 03:55:49,378 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 03:55:49,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:55:49,378 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-08 03:55:49,378 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-08 03:55:49,378 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:55:49,379 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:55:49,379 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 03:55:49,379 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 03:55:49,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:55:49,379 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-08 03:55:49,379 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-08 03:55:49,379 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:55:49,379 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:55:49,379 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 03:55:49,379 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 03:55:49,379 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 03:55:49,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-08 03:55:49,380 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 173 [2022-04-08 03:55:49,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 03:55:49,380 INFO L478 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-08 03:55:49,380 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.888888888888889) internal successors, (35), 8 states have internal predecessors, (35), 5 states have call successors, (27), 3 states have call predecessors, (27), 1 states have return successors, (25), 5 states have call predecessors, (25), 5 states have call successors, (25) [2022-04-08 03:55:49,380 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2022-04-08 03:55:49,380 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 03:55:49,380 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-08 03:55:49,380 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:55:49,382 INFO L788 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-08 03:55:49,405 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 03:55:49,591 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,SelfDestructingSolverStorable25 [2022-04-08 03:55:49,593 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-08 03:57:18,951 WARN L232 SmtUtils]: Spent 1.49m on a formula simplification. DAG size of input: 395 DAG size of output: 395 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or)