/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-fb4f59a-m [2022-04-28 03:11:07,175 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-28 03:11:07,177 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-28 03:11:07,227 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-28 03:11:07,228 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-28 03:11:07,228 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-28 03:11:07,229 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-28 03:11:07,230 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-28 03:11:07,231 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-28 03:11:07,232 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-28 03:11:07,232 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-28 03:11:07,233 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-28 03:11:07,233 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-28 03:11:07,233 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-28 03:11:07,234 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-28 03:11:07,235 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-28 03:11:07,236 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-28 03:11:07,237 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-28 03:11:07,238 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-28 03:11:07,239 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-28 03:11:07,240 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-28 03:11:07,242 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-28 03:11:07,243 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-28 03:11:07,244 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-28 03:11:07,244 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-28 03:11:07,246 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-28 03:11:07,246 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-28 03:11:07,246 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-28 03:11:07,247 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-28 03:11:07,247 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-28 03:11:07,247 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-28 03:11:07,247 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-28 03:11:07,248 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-28 03:11:07,248 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-28 03:11:07,249 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-28 03:11:07,249 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-28 03:11:07,249 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-28 03:11:07,250 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-28 03:11:07,250 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-28 03:11:07,250 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-28 03:11:07,250 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-28 03:11:07,253 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-28 03:11:07,254 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-04-28 03:11:07,259 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-28 03:11:07,259 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-28 03:11:07,260 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-28 03:11:07,260 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-28 03:11:07,260 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-28 03:11:07,260 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-28 03:11:07,260 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-28 03:11:07,260 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-28 03:11:07,260 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-28 03:11:07,260 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-28 03:11:07,260 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-28 03:11:07,260 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-28 03:11:07,260 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-28 03:11:07,260 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-28 03:11:07,261 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-28 03:11:07,261 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-28 03:11:07,261 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-28 03:11:07,261 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-28 03:11:07,261 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 03:11:07,261 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-28 03:11:07,261 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-28 03:11:07,261 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-28 03:11:07,261 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-28 03:11:07,261 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-28 03:11:07,261 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-28 03:11:07,262 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-28 03:11:07,468 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-28 03:11:07,485 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-28 03:11:07,486 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-28 03:11:07,487 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-28 03:11:07,488 INFO L275 PluginConnector]: CDTParser initialized [2022-04-28 03:11:07,488 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-28 03:11:07,534 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/59b8fda49/44a00bac04264656ac1031ecea7ea2d4/FLAGe6b1302e1 [2022-04-28 03:11:07,857 INFO L306 CDTParser]: Found 1 translation units. [2022-04-28 03:11:07,857 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/heapsort.i [2022-04-28 03:11:07,861 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/59b8fda49/44a00bac04264656ac1031ecea7ea2d4/FLAGe6b1302e1 [2022-04-28 03:11:07,869 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/59b8fda49/44a00bac04264656ac1031ecea7ea2d4 [2022-04-28 03:11:07,871 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-28 03:11:07,871 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-28 03:11:07,872 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-28 03:11:07,872 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-28 03:11:07,874 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-28 03:11:07,875 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 03:11:07" (1/1) ... [2022-04-28 03:11:07,876 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@a05e308 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:11:07, skipping insertion in model container [2022-04-28 03:11:07,876 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 03:11:07" (1/1) ... [2022-04-28 03:11:07,880 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-28 03:11:07,892 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-28 03:11:08,049 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-28 03:11:08,078 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 03:11:08,086 INFO L203 MainTranslator]: Completed pre-run [2022-04-28 03:11:08,098 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-28 03:11:08,115 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 03:11:08,130 INFO L208 MainTranslator]: Completed translation [2022-04-28 03:11:08,130 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:11:08 WrapperNode [2022-04-28 03:11:08,130 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-28 03:11:08,131 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-28 03:11:08,132 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-28 03:11:08,132 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-28 03:11:08,139 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:11:08" (1/1) ... [2022-04-28 03:11:08,139 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:11:08" (1/1) ... [2022-04-28 03:11:08,149 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:11:08" (1/1) ... [2022-04-28 03:11:08,150 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:11:08" (1/1) ... [2022-04-28 03:11:08,160 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:11:08" (1/1) ... [2022-04-28 03:11:08,163 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:11:08" (1/1) ... [2022-04-28 03:11:08,164 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:11:08" (1/1) ... [2022-04-28 03:11:08,165 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-28 03:11:08,168 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-28 03:11:08,168 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-28 03:11:08,168 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-28 03:11:08,169 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:11:08" (1/1) ... [2022-04-28 03:11:08,174 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 03:11:08,180 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:11:08,189 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-28 03:11:08,206 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-28 03:11:08,228 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-28 03:11:08,228 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-28 03:11:08,228 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-28 03:11:08,228 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-28 03:11:08,228 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-28 03:11:08,228 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-28 03:11:08,229 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-28 03:11:08,229 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-28 03:11:08,229 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2022-04-28 03:11:08,229 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2022-04-28 03:11:08,229 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-28 03:11:08,230 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-28 03:11:08,230 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-28 03:11:08,230 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-28 03:11:08,230 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-28 03:11:08,230 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-28 03:11:08,230 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-28 03:11:08,231 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-28 03:11:08,231 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-28 03:11:08,231 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-28 03:11:08,231 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-28 03:11:08,231 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-28 03:11:08,297 INFO L234 CfgBuilder]: Building ICFG [2022-04-28 03:11:08,298 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-28 03:11:08,540 INFO L275 CfgBuilder]: Performing block encoding [2022-04-28 03:11:08,544 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-28 03:11:08,545 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-04-28 03:11:08,546 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 03:11:08 BoogieIcfgContainer [2022-04-28 03:11:08,546 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-28 03:11:08,547 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-28 03:11:08,547 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-28 03:11:08,551 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-28 03:11:08,552 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.04 03:11:07" (1/3) ... [2022-04-28 03:11:08,552 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@db768b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 03:11:08, skipping insertion in model container [2022-04-28 03:11:08,552 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:11:08" (2/3) ... [2022-04-28 03:11:08,552 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@db768b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 03:11:08, skipping insertion in model container [2022-04-28 03:11:08,552 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 03:11:08" (3/3) ... [2022-04-28 03:11:08,553 INFO L111 eAbstractionObserver]: Analyzing ICFG heapsort.i [2022-04-28 03:11:08,562 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-28 03:11:08,562 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-28 03:11:08,592 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-28 03:11:08,596 INFO L357 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, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@51ffa6e, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@72b1e1b4 [2022-04-28 03:11:08,597 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-28 03:11:08,601 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-28 03:11:08,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-28 03:11:08,605 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:11:08,606 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:11:08,606 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:11:08,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:11:08,609 INFO L85 PathProgramCache]: Analyzing trace with hash -250128701, now seen corresponding path program 1 times [2022-04-28 03:11:08,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:11:08,614 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [728177558] [2022-04-28 03:11:08,620 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 03:11:08,620 INFO L85 PathProgramCache]: Analyzing trace with hash -250128701, now seen corresponding path program 2 times [2022-04-28 03:11:08,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:11:08,622 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [915148156] [2022-04-28 03:11:08,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:11:08,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:11:08,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:11:08,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:11:08,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:11:08,847 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-28 03:11:08,848 INFO L290 TraceCheckUtils]: 1: Hoare triple {47#true} assume true; {47#true} is VALID [2022-04-28 03:11:08,848 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {47#true} {47#true} #138#return; {47#true} is VALID [2022-04-28 03:11:08,850 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-28 03:11:08,850 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-28 03:11:08,850 INFO L290 TraceCheckUtils]: 2: Hoare triple {47#true} assume true; {47#true} is VALID [2022-04-28 03:11:08,850 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {47#true} {47#true} #138#return; {47#true} is VALID [2022-04-28 03:11:08,851 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-28 03:11:08,851 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-28 03:11:08,851 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-28 03:11:08,851 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-28 03:11:08,852 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-28 03:11:08,853 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-28 03:11:08,853 INFO L290 TraceCheckUtils]: 10: Hoare triple {52#(<= 1 main_~r~0)} assume !(~l~0 > 1); {52#(<= 1 main_~r~0)} is VALID [2022-04-28 03:11:08,854 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-28 03:11:08,856 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-28 03:11:08,856 INFO L290 TraceCheckUtils]: 13: Hoare triple {54#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {48#false} is VALID [2022-04-28 03:11:08,856 INFO L290 TraceCheckUtils]: 14: Hoare triple {48#false} assume !false; {48#false} is VALID [2022-04-28 03:11:08,857 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-28 03:11:08,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:11:08,857 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [915148156] [2022-04-28 03:11:08,858 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [915148156] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:11:08,858 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:11:08,858 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 03:11:08,860 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:11:08,861 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [728177558] [2022-04-28 03:11:08,861 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [728177558] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:11:08,861 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:11:08,861 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 03:11:08,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [550392857] [2022-04-28 03:11:08,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:11:08,865 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-28 03:11:08,866 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:11:08,869 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-28 03:11:08,884 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-28 03:11:08,885 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 03:11:08,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:11:08,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 03:11:08,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-28 03:11:08,904 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-28 03:11:09,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:11:09,498 INFO L93 Difference]: Finished difference Result 88 states and 148 transitions. [2022-04-28 03:11:09,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-28 03:11:09,499 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-28 03:11:09,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:11:09,501 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-28 03:11:09,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 148 transitions. [2022-04-28 03:11:09,521 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-28 03:11:09,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 148 transitions. [2022-04-28 03:11:09,528 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 148 transitions. [2022-04-28 03:11:09,703 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-28 03:11:09,712 INFO L225 Difference]: With dead ends: 88 [2022-04-28 03:11:09,713 INFO L226 Difference]: Without dead ends: 44 [2022-04-28 03:11:09,716 INFO L412 NwaCegarLoop]: 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-28 03:11:09,718 INFO L413 NwaCegarLoop]: 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-28 03:11:09,719 INFO L414 NwaCegarLoop]: 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-28 03:11:09,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-04-28 03:11:09,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 43. [2022-04-28 03:11:09,763 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:11:09,763 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-28 03:11:09,765 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-28 03:11:09,765 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-28 03:11:09,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:11:09,770 INFO L93 Difference]: Finished difference Result 44 states and 62 transitions. [2022-04-28 03:11:09,770 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 62 transitions. [2022-04-28 03:11:09,771 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:11:09,771 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:11:09,772 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-28 03:11:09,773 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-28 03:11:09,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:11:09,777 INFO L93 Difference]: Finished difference Result 44 states and 62 transitions. [2022-04-28 03:11:09,777 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 62 transitions. [2022-04-28 03:11:09,783 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:11:09,783 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:11:09,783 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:11:09,784 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:11:09,785 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-28 03:11:09,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 61 transitions. [2022-04-28 03:11:09,793 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 61 transitions. Word has length 15 [2022-04-28 03:11:09,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:11:09,797 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 61 transitions. [2022-04-28 03:11:09,797 INFO L496 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-28 03:11:09,797 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 43 states and 61 transitions. [2022-04-28 03:11:09,857 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-28 03:11:09,857 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 61 transitions. [2022-04-28 03:11:09,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-28 03:11:09,857 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:11:09,857 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:11:09,858 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-28 03:11:09,858 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:11:09,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:11:09,858 INFO L85 PathProgramCache]: Analyzing trace with hash -254865470, now seen corresponding path program 1 times [2022-04-28 03:11:09,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:11:09,859 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1032535770] [2022-04-28 03:11:09,859 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 03:11:09,859 INFO L85 PathProgramCache]: Analyzing trace with hash -254865470, now seen corresponding path program 2 times [2022-04-28 03:11:09,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:11:09,860 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1849824758] [2022-04-28 03:11:09,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:11:09,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:11:09,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:11:09,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:11:09,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:11:09,915 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-28 03:11:09,916 INFO L290 TraceCheckUtils]: 1: Hoare triple {417#true} assume true; {417#true} is VALID [2022-04-28 03:11:09,916 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {417#true} {417#true} #138#return; {417#true} is VALID [2022-04-28 03:11:09,916 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-28 03:11:09,917 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-28 03:11:09,917 INFO L290 TraceCheckUtils]: 2: Hoare triple {417#true} assume true; {417#true} is VALID [2022-04-28 03:11:09,917 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {417#true} {417#true} #138#return; {417#true} is VALID [2022-04-28 03:11:09,917 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-28 03:11:09,917 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-28 03:11:09,917 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-28 03:11:09,917 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-28 03:11:09,918 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-28 03:11:09,918 INFO L290 TraceCheckUtils]: 9: Hoare triple {417#true} assume !(~j~0 <= ~r~0); {417#true} is VALID [2022-04-28 03:11:09,918 INFO L290 TraceCheckUtils]: 10: Hoare triple {417#true} assume ~l~0 > 1; {422#(<= 1 main_~l~0)} is VALID [2022-04-28 03:11:09,919 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-28 03:11:09,919 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-28 03:11:09,920 INFO L290 TraceCheckUtils]: 13: Hoare triple {424#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {418#false} is VALID [2022-04-28 03:11:09,920 INFO L290 TraceCheckUtils]: 14: Hoare triple {418#false} assume !false; {418#false} is VALID [2022-04-28 03:11:09,920 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-28 03:11:09,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:11:09,920 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1849824758] [2022-04-28 03:11:09,920 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1849824758] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:11:09,920 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:11:09,921 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 03:11:09,921 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:11:09,921 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1032535770] [2022-04-28 03:11:09,921 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1032535770] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:11:09,921 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:11:09,921 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 03:11:09,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1828660964] [2022-04-28 03:11:09,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:11:09,922 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-28 03:11:09,922 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:11:09,923 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-28 03:11:09,931 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-28 03:11:09,932 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 03:11:09,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:11:09,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 03:11:09,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-28 03:11:09,932 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-28 03:11:10,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:11:10,537 INFO L93 Difference]: Finished difference Result 71 states and 105 transitions. [2022-04-28 03:11:10,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-28 03:11:10,537 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-28 03:11:10,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:11:10,537 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-28 03:11:10,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 102 transitions. [2022-04-28 03:11:10,540 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-28 03:11:10,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 102 transitions. [2022-04-28 03:11:10,542 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 102 transitions. [2022-04-28 03:11:10,648 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-28 03:11:10,651 INFO L225 Difference]: With dead ends: 71 [2022-04-28 03:11:10,651 INFO L226 Difference]: Without dead ends: 69 [2022-04-28 03:11:10,651 INFO L412 NwaCegarLoop]: 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-28 03:11:10,652 INFO L413 NwaCegarLoop]: 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-28 03:11:10,652 INFO L414 NwaCegarLoop]: 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-28 03:11:10,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2022-04-28 03:11:10,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 47. [2022-04-28 03:11:10,683 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:11:10,683 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-28 03:11:10,683 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-28 03:11:10,684 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-28 03:11:10,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:11:10,693 INFO L93 Difference]: Finished difference Result 69 states and 103 transitions. [2022-04-28 03:11:10,693 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 103 transitions. [2022-04-28 03:11:10,695 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:11:10,695 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:11:10,695 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-28 03:11:10,696 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-28 03:11:10,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:11:10,705 INFO L93 Difference]: Finished difference Result 69 states and 103 transitions. [2022-04-28 03:11:10,705 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 103 transitions. [2022-04-28 03:11:10,706 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:11:10,706 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:11:10,706 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:11:10,706 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:11:10,707 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-28 03:11:10,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 64 transitions. [2022-04-28 03:11:10,709 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 64 transitions. Word has length 15 [2022-04-28 03:11:10,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:11:10,709 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 64 transitions. [2022-04-28 03:11:10,709 INFO L496 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-28 03:11:10,709 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 47 states and 64 transitions. [2022-04-28 03:11:10,768 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-28 03:11:10,768 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 64 transitions. [2022-04-28 03:11:10,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-28 03:11:10,769 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:11:10,769 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:11:10,769 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-28 03:11:10,769 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:11:10,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:11:10,769 INFO L85 PathProgramCache]: Analyzing trace with hash -216435080, now seen corresponding path program 1 times [2022-04-28 03:11:10,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:11:10,770 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [328701516] [2022-04-28 03:11:10,770 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 03:11:10,770 INFO L85 PathProgramCache]: Analyzing trace with hash -216435080, now seen corresponding path program 2 times [2022-04-28 03:11:10,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:11:10,770 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1097038607] [2022-04-28 03:11:10,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:11:10,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:11:10,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:11:10,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:11:10,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:11:10,848 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-28 03:11:10,848 INFO L290 TraceCheckUtils]: 1: Hoare triple {811#true} assume true; {811#true} is VALID [2022-04-28 03:11:10,848 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {811#true} {811#true} #138#return; {811#true} is VALID [2022-04-28 03:11:10,849 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-28 03:11:10,849 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-28 03:11:10,849 INFO L290 TraceCheckUtils]: 2: Hoare triple {811#true} assume true; {811#true} is VALID [2022-04-28 03:11:10,849 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {811#true} {811#true} #138#return; {811#true} is VALID [2022-04-28 03:11:10,849 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-28 03:11:10,849 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-28 03:11:10,849 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-28 03:11:10,850 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-28 03:11:10,850 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-28 03:11:10,850 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-28 03:11:10,851 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-28 03:11:10,851 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-28 03:11:10,852 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-28 03:11:10,852 INFO L290 TraceCheckUtils]: 13: Hoare triple {819#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {812#false} is VALID [2022-04-28 03:11:10,852 INFO L290 TraceCheckUtils]: 14: Hoare triple {812#false} assume !false; {812#false} is VALID [2022-04-28 03:11:10,852 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-28 03:11:10,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:11:10,853 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1097038607] [2022-04-28 03:11:10,853 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1097038607] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:11:10,853 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:11:10,853 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 03:11:10,853 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:11:10,853 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [328701516] [2022-04-28 03:11:10,853 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [328701516] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:11:10,853 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:11:10,853 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 03:11:10,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164846765] [2022-04-28 03:11:10,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:11:10,854 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-28 03:11:10,854 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:11:10,854 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-28 03:11:10,862 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-28 03:11:10,863 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-28 03:11:10,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:11:10,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-28 03:11:10,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-04-28 03:11:10,863 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-28 03:11:11,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:11:11,723 INFO L93 Difference]: Finished difference Result 80 states and 115 transitions. [2022-04-28 03:11:11,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-28 03:11:11,724 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-28 03:11:11,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:11:11,724 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-28 03:11:11,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 109 transitions. [2022-04-28 03:11:11,726 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-28 03:11:11,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 109 transitions. [2022-04-28 03:11:11,728 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 109 transitions. [2022-04-28 03:11:11,818 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-28 03:11:11,820 INFO L225 Difference]: With dead ends: 80 [2022-04-28 03:11:11,820 INFO L226 Difference]: Without dead ends: 78 [2022-04-28 03:11:11,820 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 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-28 03:11:11,821 INFO L413 NwaCegarLoop]: 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-28 03:11:11,821 INFO L414 NwaCegarLoop]: 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-28 03:11:11,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2022-04-28 03:11:11,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 68. [2022-04-28 03:11:11,891 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:11:11,892 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-28 03:11:11,892 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-28 03:11:11,892 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-28 03:11:11,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:11:11,895 INFO L93 Difference]: Finished difference Result 78 states and 113 transitions. [2022-04-28 03:11:11,895 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 113 transitions. [2022-04-28 03:11:11,896 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:11:11,896 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:11:11,896 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-28 03:11:11,897 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-28 03:11:11,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:11:11,899 INFO L93 Difference]: Finished difference Result 78 states and 113 transitions. [2022-04-28 03:11:11,899 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 113 transitions. [2022-04-28 03:11:11,900 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:11:11,900 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:11:11,900 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:11:11,900 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:11:11,900 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-28 03:11:11,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 98 transitions. [2022-04-28 03:11:11,903 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 98 transitions. Word has length 15 [2022-04-28 03:11:11,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:11:11,903 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 98 transitions. [2022-04-28 03:11:11,903 INFO L496 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-28 03:11:11,903 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 68 states and 98 transitions. [2022-04-28 03:11:11,996 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-28 03:11:11,996 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 98 transitions. [2022-04-28 03:11:11,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-28 03:11:11,997 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:11:11,997 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:11:11,997 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-28 03:11:11,997 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:11:11,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:11:11,998 INFO L85 PathProgramCache]: Analyzing trace with hash -228679181, now seen corresponding path program 1 times [2022-04-28 03:11:11,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:11:11,998 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1397897879] [2022-04-28 03:11:11,998 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 03:11:11,998 INFO L85 PathProgramCache]: Analyzing trace with hash -228679181, now seen corresponding path program 2 times [2022-04-28 03:11:11,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:11:11,998 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [536151525] [2022-04-28 03:11:11,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:11:11,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:11:12,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:11:12,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:11:12,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:11:12,045 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-28 03:11:12,045 INFO L290 TraceCheckUtils]: 1: Hoare triple {1287#true} assume true; {1287#true} is VALID [2022-04-28 03:11:12,045 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1287#true} {1287#true} #138#return; {1287#true} is VALID [2022-04-28 03:11:12,046 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-28 03:11:12,046 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-28 03:11:12,046 INFO L290 TraceCheckUtils]: 2: Hoare triple {1287#true} assume true; {1287#true} is VALID [2022-04-28 03:11:12,046 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1287#true} {1287#true} #138#return; {1287#true} is VALID [2022-04-28 03:11:12,046 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-28 03:11:12,046 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-28 03:11:12,046 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-28 03:11:12,047 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-28 03:11:12,047 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-28 03:11:12,048 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-28 03:11:12,048 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-28 03:11:12,048 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-28 03:11:12,049 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-28 03:11:12,049 INFO L290 TraceCheckUtils]: 13: Hoare triple {1295#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {1288#false} is VALID [2022-04-28 03:11:12,049 INFO L290 TraceCheckUtils]: 14: Hoare triple {1288#false} assume !false; {1288#false} is VALID [2022-04-28 03:11:12,049 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-28 03:11:12,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:11:12,050 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [536151525] [2022-04-28 03:11:12,050 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [536151525] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:11:12,050 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:11:12,050 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 03:11:12,050 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:11:12,050 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1397897879] [2022-04-28 03:11:12,050 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1397897879] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:11:12,050 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:11:12,050 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 03:11:12,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971831846] [2022-04-28 03:11:12,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:11:12,051 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-28 03:11:12,051 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:11:12,051 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-28 03:11:12,059 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-28 03:11:12,059 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-28 03:11:12,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:11:12,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-28 03:11:12,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-04-28 03:11:12,060 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-28 03:11:12,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:11:12,899 INFO L93 Difference]: Finished difference Result 122 states and 183 transitions. [2022-04-28 03:11:12,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-28 03:11:12,900 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-28 03:11:12,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:11:12,900 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-28 03:11:12,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 109 transitions. [2022-04-28 03:11:12,902 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-28 03:11:12,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 109 transitions. [2022-04-28 03:11:12,903 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 109 transitions. [2022-04-28 03:11:13,002 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-28 03:11:13,005 INFO L225 Difference]: With dead ends: 122 [2022-04-28 03:11:13,005 INFO L226 Difference]: Without dead ends: 120 [2022-04-28 03:11:13,005 INFO L412 NwaCegarLoop]: 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-28 03:11:13,006 INFO L413 NwaCegarLoop]: 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-28 03:11:13,006 INFO L414 NwaCegarLoop]: 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-28 03:11:13,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2022-04-28 03:11:13,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 94. [2022-04-28 03:11:13,106 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:11:13,106 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-28 03:11:13,107 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-28 03:11:13,107 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-28 03:11:13,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:11:13,112 INFO L93 Difference]: Finished difference Result 120 states and 181 transitions. [2022-04-28 03:11:13,112 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 181 transitions. [2022-04-28 03:11:13,112 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:11:13,112 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:11:13,113 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-28 03:11:13,113 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-28 03:11:13,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:11:13,118 INFO L93 Difference]: Finished difference Result 120 states and 181 transitions. [2022-04-28 03:11:13,118 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 181 transitions. [2022-04-28 03:11:13,118 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:11:13,119 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:11:13,119 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:11:13,119 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:11:13,119 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-28 03:11:13,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 140 transitions. [2022-04-28 03:11:13,122 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 140 transitions. Word has length 15 [2022-04-28 03:11:13,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:11:13,123 INFO L495 AbstractCegarLoop]: Abstraction has 94 states and 140 transitions. [2022-04-28 03:11:13,123 INFO L496 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-28 03:11:13,123 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 94 states and 140 transitions. [2022-04-28 03:11:13,246 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-28 03:11:13,246 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 140 transitions. [2022-04-28 03:11:13,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-28 03:11:13,247 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:11:13,247 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:11:13,247 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-28 03:11:13,247 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:11:13,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:11:13,247 INFO L85 PathProgramCache]: Analyzing trace with hash 1266022048, now seen corresponding path program 1 times [2022-04-28 03:11:13,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:11:13,248 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1515812453] [2022-04-28 03:11:13,248 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 03:11:13,248 INFO L85 PathProgramCache]: Analyzing trace with hash 1266022048, now seen corresponding path program 2 times [2022-04-28 03:11:13,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:11:13,248 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1583933582] [2022-04-28 03:11:13,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:11:13,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:11:13,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:11:13,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:11:13,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:11:13,304 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-28 03:11:13,304 INFO L290 TraceCheckUtils]: 1: Hoare triple {1984#true} assume true; {1984#true} is VALID [2022-04-28 03:11:13,304 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1984#true} {1984#true} #138#return; {1984#true} is VALID [2022-04-28 03:11:13,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-28 03:11:13,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:11:13,310 INFO L290 TraceCheckUtils]: 0: Hoare triple {1984#true} ~cond := #in~cond; {1984#true} is VALID [2022-04-28 03:11:13,310 INFO L290 TraceCheckUtils]: 1: Hoare triple {1984#true} assume !(0 == ~cond); {1984#true} is VALID [2022-04-28 03:11:13,310 INFO L290 TraceCheckUtils]: 2: Hoare triple {1984#true} assume true; {1984#true} is VALID [2022-04-28 03:11:13,311 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-28 03:11:13,312 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-28 03:11:13,312 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-28 03:11:13,313 INFO L290 TraceCheckUtils]: 2: Hoare triple {1984#true} assume true; {1984#true} is VALID [2022-04-28 03:11:13,313 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1984#true} {1984#true} #138#return; {1984#true} is VALID [2022-04-28 03:11:13,313 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-28 03:11:13,313 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-28 03:11:13,315 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-28 03:11:13,316 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-28 03:11:13,316 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-28 03:11:13,316 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-28 03:11:13,316 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-28 03:11:13,317 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-28 03:11:13,317 INFO L290 TraceCheckUtils]: 12: Hoare triple {1984#true} ~cond := #in~cond; {1984#true} is VALID [2022-04-28 03:11:13,317 INFO L290 TraceCheckUtils]: 13: Hoare triple {1984#true} assume !(0 == ~cond); {1984#true} is VALID [2022-04-28 03:11:13,317 INFO L290 TraceCheckUtils]: 14: Hoare triple {1984#true} assume true; {1984#true} is VALID [2022-04-28 03:11:13,317 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-28 03:11:13,318 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-28 03:11:13,318 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-28 03:11:13,319 INFO L290 TraceCheckUtils]: 18: Hoare triple {1995#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {1985#false} is VALID [2022-04-28 03:11:13,319 INFO L290 TraceCheckUtils]: 19: Hoare triple {1985#false} assume !false; {1985#false} is VALID [2022-04-28 03:11:13,319 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-28 03:11:13,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:11:13,319 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1583933582] [2022-04-28 03:11:13,319 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1583933582] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:11:13,319 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:11:13,319 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 03:11:13,320 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:11:13,320 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1515812453] [2022-04-28 03:11:13,320 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1515812453] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:11:13,320 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:11:13,320 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 03:11:13,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764558893] [2022-04-28 03:11:13,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:11:13,320 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-28 03:11:13,321 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:11:13,321 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-28 03:11:13,331 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-28 03:11:13,331 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 03:11:13,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:11:13,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 03:11:13,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-28 03:11:13,332 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-28 03:11:13,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:11:13,869 INFO L93 Difference]: Finished difference Result 100 states and 145 transitions. [2022-04-28 03:11:13,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-28 03:11:13,869 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-28 03:11:13,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:11:13,870 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-28 03:11:13,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 63 transitions. [2022-04-28 03:11:13,871 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-28 03:11:13,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 63 transitions. [2022-04-28 03:11:13,872 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 63 transitions. [2022-04-28 03:11:13,922 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-28 03:11:13,924 INFO L225 Difference]: With dead ends: 100 [2022-04-28 03:11:13,924 INFO L226 Difference]: Without dead ends: 98 [2022-04-28 03:11:13,925 INFO L412 NwaCegarLoop]: 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-28 03:11:13,925 INFO L413 NwaCegarLoop]: 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-28 03:11:13,926 INFO L414 NwaCegarLoop]: 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-28 03:11:13,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2022-04-28 03:11:14,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2022-04-28 03:11:14,073 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:11:14,073 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-28 03:11:14,073 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-28 03:11:14,074 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-28 03:11:14,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:11:14,077 INFO L93 Difference]: Finished difference Result 98 states and 143 transitions. [2022-04-28 03:11:14,077 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 143 transitions. [2022-04-28 03:11:14,077 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:11:14,077 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:11:14,078 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-28 03:11:14,078 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-28 03:11:14,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:11:14,081 INFO L93 Difference]: Finished difference Result 98 states and 143 transitions. [2022-04-28 03:11:14,081 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 143 transitions. [2022-04-28 03:11:14,081 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:11:14,081 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:11:14,081 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:11:14,081 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:11:14,082 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-28 03:11:14,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 143 transitions. [2022-04-28 03:11:14,084 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 143 transitions. Word has length 20 [2022-04-28 03:11:14,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:11:14,085 INFO L495 AbstractCegarLoop]: Abstraction has 98 states and 143 transitions. [2022-04-28 03:11:14,085 INFO L496 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-28 03:11:14,085 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 98 states and 143 transitions. [2022-04-28 03:11:14,211 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-28 03:11:14,212 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 143 transitions. [2022-04-28 03:11:14,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-28 03:11:14,212 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:11:14,212 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:11:14,212 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-04-28 03:11:14,212 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:11:14,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:11:14,213 INFO L85 PathProgramCache]: Analyzing trace with hash 884659585, now seen corresponding path program 1 times [2022-04-28 03:11:14,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:11:14,213 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [947408083] [2022-04-28 03:11:14,213 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 03:11:14,213 INFO L85 PathProgramCache]: Analyzing trace with hash 884659585, now seen corresponding path program 2 times [2022-04-28 03:11:14,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:11:14,213 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1727935213] [2022-04-28 03:11:14,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:11:14,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:11:14,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:11:14,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:11:14,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:11:14,285 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-28 03:11:14,285 INFO L290 TraceCheckUtils]: 1: Hoare triple {2599#true} assume true; {2599#true} is VALID [2022-04-28 03:11:14,286 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2599#true} {2599#true} #138#return; {2599#true} is VALID [2022-04-28 03:11:14,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-28 03:11:14,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:11:14,289 INFO L290 TraceCheckUtils]: 0: Hoare triple {2599#true} ~cond := #in~cond; {2599#true} is VALID [2022-04-28 03:11:14,289 INFO L290 TraceCheckUtils]: 1: Hoare triple {2599#true} assume !(0 == ~cond); {2599#true} is VALID [2022-04-28 03:11:14,289 INFO L290 TraceCheckUtils]: 2: Hoare triple {2599#true} assume true; {2599#true} is VALID [2022-04-28 03:11:14,289 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-28 03:11:14,290 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-28 03:11:14,290 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-28 03:11:14,290 INFO L290 TraceCheckUtils]: 2: Hoare triple {2599#true} assume true; {2599#true} is VALID [2022-04-28 03:11:14,290 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2599#true} {2599#true} #138#return; {2599#true} is VALID [2022-04-28 03:11:14,290 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-28 03:11:14,290 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-28 03:11:14,291 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-28 03:11:14,292 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-28 03:11:14,292 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-28 03:11:14,292 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-28 03:11:14,293 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-28 03:11:14,293 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-28 03:11:14,293 INFO L290 TraceCheckUtils]: 12: Hoare triple {2599#true} ~cond := #in~cond; {2599#true} is VALID [2022-04-28 03:11:14,293 INFO L290 TraceCheckUtils]: 13: Hoare triple {2599#true} assume !(0 == ~cond); {2599#true} is VALID [2022-04-28 03:11:14,293 INFO L290 TraceCheckUtils]: 14: Hoare triple {2599#true} assume true; {2599#true} is VALID [2022-04-28 03:11:14,293 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-28 03:11:14,294 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-28 03:11:14,294 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-28 03:11:14,295 INFO L290 TraceCheckUtils]: 18: Hoare triple {2612#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {2600#false} is VALID [2022-04-28 03:11:14,295 INFO L290 TraceCheckUtils]: 19: Hoare triple {2600#false} assume !false; {2600#false} is VALID [2022-04-28 03:11:14,295 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-28 03:11:14,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:11:14,295 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1727935213] [2022-04-28 03:11:14,295 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1727935213] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:11:14,295 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:11:14,295 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 03:11:14,295 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:11:14,295 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [947408083] [2022-04-28 03:11:14,296 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [947408083] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:11:14,296 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:11:14,296 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 03:11:14,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [732243082] [2022-04-28 03:11:14,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:11:14,296 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-28 03:11:14,296 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:11:14,296 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-28 03:11:14,306 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-28 03:11:14,306 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-28 03:11:14,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:11:14,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-28 03:11:14,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-04-28 03:11:14,307 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-28 03:11:15,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:11:15,460 INFO L93 Difference]: Finished difference Result 131 states and 194 transitions. [2022-04-28 03:11:15,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-28 03:11:15,460 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-28 03:11:15,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:11:15,460 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-28 03:11:15,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 108 transitions. [2022-04-28 03:11:15,462 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-28 03:11:15,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 108 transitions. [2022-04-28 03:11:15,464 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 108 transitions. [2022-04-28 03:11:15,556 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-28 03:11:15,559 INFO L225 Difference]: With dead ends: 131 [2022-04-28 03:11:15,559 INFO L226 Difference]: Without dead ends: 129 [2022-04-28 03:11:15,559 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2022-04-28 03:11:15,560 INFO L413 NwaCegarLoop]: 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-28 03:11:15,560 INFO L414 NwaCegarLoop]: 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-28 03:11:15,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2022-04-28 03:11:15,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 126. [2022-04-28 03:11:15,864 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:11:15,864 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-28 03:11:15,865 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-28 03:11:15,865 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-28 03:11:15,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:11:15,869 INFO L93 Difference]: Finished difference Result 129 states and 192 transitions. [2022-04-28 03:11:15,869 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 192 transitions. [2022-04-28 03:11:15,869 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:11:15,869 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:11:15,870 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-28 03:11:15,870 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-28 03:11:15,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:11:15,874 INFO L93 Difference]: Finished difference Result 129 states and 192 transitions. [2022-04-28 03:11:15,874 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 192 transitions. [2022-04-28 03:11:15,874 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:11:15,874 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:11:15,874 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:11:15,874 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:11:15,875 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-28 03:11:15,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 189 transitions. [2022-04-28 03:11:15,879 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 189 transitions. Word has length 20 [2022-04-28 03:11:15,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:11:15,879 INFO L495 AbstractCegarLoop]: Abstraction has 126 states and 189 transitions. [2022-04-28 03:11:15,879 INFO L496 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-28 03:11:15,880 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 126 states and 189 transitions. [2022-04-28 03:11:16,062 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-28 03:11:16,062 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 189 transitions. [2022-04-28 03:11:16,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-28 03:11:16,062 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:11:16,062 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:11:16,062 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-04-28 03:11:16,063 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:11:16,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:11:16,063 INFO L85 PathProgramCache]: Analyzing trace with hash 1424204299, now seen corresponding path program 1 times [2022-04-28 03:11:16,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:11:16,063 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [15621470] [2022-04-28 03:11:16,063 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 03:11:16,063 INFO L85 PathProgramCache]: Analyzing trace with hash 1424204299, now seen corresponding path program 2 times [2022-04-28 03:11:16,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:11:16,064 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336847990] [2022-04-28 03:11:16,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:11:16,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:11:16,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:11:16,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:11:16,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:11:16,144 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-28 03:11:16,144 INFO L290 TraceCheckUtils]: 1: Hoare triple {3400#true} assume true; {3400#true} is VALID [2022-04-28 03:11:16,144 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3400#true} {3400#true} #138#return; {3400#true} is VALID [2022-04-28 03:11:16,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-28 03:11:16,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:11:16,148 INFO L290 TraceCheckUtils]: 0: Hoare triple {3400#true} ~cond := #in~cond; {3400#true} is VALID [2022-04-28 03:11:16,148 INFO L290 TraceCheckUtils]: 1: Hoare triple {3400#true} assume !(0 == ~cond); {3400#true} is VALID [2022-04-28 03:11:16,148 INFO L290 TraceCheckUtils]: 2: Hoare triple {3400#true} assume true; {3400#true} is VALID [2022-04-28 03:11:16,149 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-28 03:11:16,149 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-28 03:11:16,149 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-28 03:11:16,149 INFO L290 TraceCheckUtils]: 2: Hoare triple {3400#true} assume true; {3400#true} is VALID [2022-04-28 03:11:16,149 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3400#true} {3400#true} #138#return; {3400#true} is VALID [2022-04-28 03:11:16,150 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-28 03:11:16,150 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-28 03:11:16,150 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-28 03:11:16,150 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-28 03:11:16,151 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-28 03:11:16,151 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-28 03:11:16,152 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-28 03:11:16,152 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-28 03:11:16,152 INFO L290 TraceCheckUtils]: 12: Hoare triple {3400#true} ~cond := #in~cond; {3400#true} is VALID [2022-04-28 03:11:16,152 INFO L290 TraceCheckUtils]: 13: Hoare triple {3400#true} assume !(0 == ~cond); {3400#true} is VALID [2022-04-28 03:11:16,152 INFO L290 TraceCheckUtils]: 14: Hoare triple {3400#true} assume true; {3400#true} is VALID [2022-04-28 03:11:16,153 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-28 03:11:16,153 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-28 03:11:16,154 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-28 03:11:16,154 INFO L290 TraceCheckUtils]: 18: Hoare triple {3412#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {3401#false} is VALID [2022-04-28 03:11:16,154 INFO L290 TraceCheckUtils]: 19: Hoare triple {3401#false} assume !false; {3401#false} is VALID [2022-04-28 03:11:16,154 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-28 03:11:16,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:11:16,154 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [336847990] [2022-04-28 03:11:16,154 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [336847990] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:11:16,154 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:11:16,154 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 03:11:16,155 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:11:16,155 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [15621470] [2022-04-28 03:11:16,155 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [15621470] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:11:16,155 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:11:16,155 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 03:11:16,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1734032086] [2022-04-28 03:11:16,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:11:16,155 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-28 03:11:16,155 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:11:16,156 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-28 03:11:16,168 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-28 03:11:16,168 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-28 03:11:16,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:11:16,168 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-28 03:11:16,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-04-28 03:11:16,169 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-28 03:11:17,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:11:17,238 INFO L93 Difference]: Finished difference Result 188 states and 291 transitions. [2022-04-28 03:11:17,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-28 03:11:17,239 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-28 03:11:17,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:11:17,239 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-28 03:11:17,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 92 transitions. [2022-04-28 03:11:17,240 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-28 03:11:17,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 92 transitions. [2022-04-28 03:11:17,242 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 92 transitions. [2022-04-28 03:11:17,325 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-28 03:11:17,329 INFO L225 Difference]: With dead ends: 188 [2022-04-28 03:11:17,329 INFO L226 Difference]: Without dead ends: 186 [2022-04-28 03:11:17,329 INFO L412 NwaCegarLoop]: 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-28 03:11:17,330 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 54 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 256 mSolverCounterSat, 95 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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.3s IncrementalHoareTripleChecker+Time [2022-04-28 03:11:17,330 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 65 Invalid, 351 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [95 Valid, 256 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-28 03:11:17,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2022-04-28 03:11:17,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 162. [2022-04-28 03:11:17,722 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:11:17,723 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-28 03:11:17,723 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-28 03:11:17,724 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-28 03:11:17,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:11:17,730 INFO L93 Difference]: Finished difference Result 186 states and 289 transitions. [2022-04-28 03:11:17,730 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 289 transitions. [2022-04-28 03:11:17,730 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:11:17,730 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:11:17,731 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-28 03:11:17,731 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-28 03:11:17,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:11:17,737 INFO L93 Difference]: Finished difference Result 186 states and 289 transitions. [2022-04-28 03:11:17,737 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 289 transitions. [2022-04-28 03:11:17,738 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:11:17,738 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:11:17,738 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:11:17,738 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:11:17,738 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-28 03:11:17,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 252 transitions. [2022-04-28 03:11:17,746 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 252 transitions. Word has length 20 [2022-04-28 03:11:17,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:11:17,747 INFO L495 AbstractCegarLoop]: Abstraction has 162 states and 252 transitions. [2022-04-28 03:11:17,747 INFO L496 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-28 03:11:17,747 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 162 states and 252 transitions. [2022-04-28 03:11:17,997 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-28 03:11:17,998 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 252 transitions. [2022-04-28 03:11:17,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-28 03:11:17,998 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:11:17,998 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:11:17,998 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-04-28 03:11:17,998 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:11:17,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:11:17,999 INFO L85 PathProgramCache]: Analyzing trace with hash 297853571, now seen corresponding path program 1 times [2022-04-28 03:11:17,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:11:17,999 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1260995155] [2022-04-28 03:11:17,999 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 03:11:17,999 INFO L85 PathProgramCache]: Analyzing trace with hash 297853571, now seen corresponding path program 2 times [2022-04-28 03:11:17,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:11:17,999 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1471942143] [2022-04-28 03:11:18,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:11:18,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:11:18,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:11:18,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:11:18,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:11:18,050 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-28 03:11:18,050 INFO L290 TraceCheckUtils]: 1: Hoare triple {4498#true} assume true; {4498#true} is VALID [2022-04-28 03:11:18,050 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4498#true} {4498#true} #138#return; {4498#true} is VALID [2022-04-28 03:11:18,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-28 03:11:18,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:11:18,052 INFO L290 TraceCheckUtils]: 0: Hoare triple {4498#true} ~cond := #in~cond; {4498#true} is VALID [2022-04-28 03:11:18,052 INFO L290 TraceCheckUtils]: 1: Hoare triple {4498#true} assume !(0 == ~cond); {4498#true} is VALID [2022-04-28 03:11:18,053 INFO L290 TraceCheckUtils]: 2: Hoare triple {4498#true} assume true; {4498#true} is VALID [2022-04-28 03:11:18,053 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4498#true} {4499#false} #130#return; {4499#false} is VALID [2022-04-28 03:11:18,053 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-28 03:11:18,053 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-28 03:11:18,053 INFO L290 TraceCheckUtils]: 2: Hoare triple {4498#true} assume true; {4498#true} is VALID [2022-04-28 03:11:18,053 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4498#true} {4498#true} #138#return; {4498#true} is VALID [2022-04-28 03:11:18,054 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-28 03:11:18,054 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-28 03:11:18,054 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-28 03:11:18,054 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-28 03:11:18,054 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-28 03:11:18,055 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-28 03:11:18,055 INFO L290 TraceCheckUtils]: 10: Hoare triple {4503#(<= main_~l~0 1)} assume ~l~0 > 1; {4499#false} is VALID [2022-04-28 03:11:18,055 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-28 03:11:18,055 INFO L290 TraceCheckUtils]: 12: Hoare triple {4498#true} ~cond := #in~cond; {4498#true} is VALID [2022-04-28 03:11:18,055 INFO L290 TraceCheckUtils]: 13: Hoare triple {4498#true} assume !(0 == ~cond); {4498#true} is VALID [2022-04-28 03:11:18,055 INFO L290 TraceCheckUtils]: 14: Hoare triple {4498#true} assume true; {4498#true} is VALID [2022-04-28 03:11:18,055 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {4498#true} {4499#false} #130#return; {4499#false} is VALID [2022-04-28 03:11:18,056 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-28 03:11:18,056 INFO L290 TraceCheckUtils]: 17: Hoare triple {4499#false} ~cond := #in~cond; {4499#false} is VALID [2022-04-28 03:11:18,056 INFO L290 TraceCheckUtils]: 18: Hoare triple {4499#false} assume 0 == ~cond; {4499#false} is VALID [2022-04-28 03:11:18,056 INFO L290 TraceCheckUtils]: 19: Hoare triple {4499#false} assume !false; {4499#false} is VALID [2022-04-28 03:11:18,056 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-28 03:11:18,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:11:18,056 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1471942143] [2022-04-28 03:11:18,056 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1471942143] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:11:18,056 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:11:18,056 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 03:11:18,057 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:11:18,057 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1260995155] [2022-04-28 03:11:18,057 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1260995155] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:11:18,057 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:11:18,057 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 03:11:18,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1345583622] [2022-04-28 03:11:18,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:11:18,057 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-28 03:11:18,057 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:11:18,057 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-28 03:11:18,067 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-28 03:11:18,067 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 03:11:18,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:11:18,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 03:11:18,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 03:11:18,068 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-28 03:11:18,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:11:18,977 INFO L93 Difference]: Finished difference Result 329 states and 524 transitions. [2022-04-28 03:11:18,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 03:11:18,977 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-28 03:11:18,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:11:18,977 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-28 03:11:18,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 141 transitions. [2022-04-28 03:11:18,979 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-28 03:11:18,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 141 transitions. [2022-04-28 03:11:18,981 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 141 transitions. [2022-04-28 03:11:19,092 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-28 03:11:19,097 INFO L225 Difference]: With dead ends: 329 [2022-04-28 03:11:19,097 INFO L226 Difference]: Without dead ends: 239 [2022-04-28 03:11:19,101 INFO L412 NwaCegarLoop]: 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-28 03:11:19,101 INFO L413 NwaCegarLoop]: 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-28 03:11:19,102 INFO L414 NwaCegarLoop]: 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-28 03:11:19,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2022-04-28 03:11:19,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 209. [2022-04-28 03:11:19,659 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:11:19,659 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-28 03:11:19,660 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-28 03:11:19,660 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-28 03:11:19,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:11:19,669 INFO L93 Difference]: Finished difference Result 239 states and 389 transitions. [2022-04-28 03:11:19,669 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 389 transitions. [2022-04-28 03:11:19,670 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:11:19,670 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:11:19,671 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-28 03:11:19,672 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-28 03:11:19,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:11:19,681 INFO L93 Difference]: Finished difference Result 239 states and 389 transitions. [2022-04-28 03:11:19,681 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 389 transitions. [2022-04-28 03:11:19,682 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:11:19,682 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:11:19,682 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:11:19,682 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:11:19,682 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-28 03:11:19,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 336 transitions. [2022-04-28 03:11:19,690 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 336 transitions. Word has length 20 [2022-04-28 03:11:19,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:11:19,690 INFO L495 AbstractCegarLoop]: Abstraction has 209 states and 336 transitions. [2022-04-28 03:11:19,691 INFO L496 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-28 03:11:19,691 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 209 states and 336 transitions. [2022-04-28 03:11:20,051 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-28 03:11:20,051 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 336 transitions. [2022-04-28 03:11:20,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-28 03:11:20,052 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:11:20,052 INFO L195 NwaCegarLoop]: 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-28 03:11:20,052 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-04-28 03:11:20,052 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:11:20,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:11:20,053 INFO L85 PathProgramCache]: Analyzing trace with hash 288094237, now seen corresponding path program 1 times [2022-04-28 03:11:20,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:11:20,053 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1900874466] [2022-04-28 03:11:20,053 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 03:11:20,053 INFO L85 PathProgramCache]: Analyzing trace with hash 288094237, now seen corresponding path program 2 times [2022-04-28 03:11:20,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:11:20,053 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [358365182] [2022-04-28 03:11:20,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:11:20,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:11:20,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:11:20,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:11:20,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:11:20,096 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-28 03:11:20,096 INFO L290 TraceCheckUtils]: 1: Hoare triple {6067#true} assume true; {6067#true} is VALID [2022-04-28 03:11:20,096 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {6067#true} {6067#true} #138#return; {6067#true} is VALID [2022-04-28 03:11:20,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-28 03:11:20,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:11:20,099 INFO L290 TraceCheckUtils]: 0: Hoare triple {6067#true} ~cond := #in~cond; {6067#true} is VALID [2022-04-28 03:11:20,099 INFO L290 TraceCheckUtils]: 1: Hoare triple {6067#true} assume !(0 == ~cond); {6067#true} is VALID [2022-04-28 03:11:20,099 INFO L290 TraceCheckUtils]: 2: Hoare triple {6067#true} assume true; {6067#true} is VALID [2022-04-28 03:11:20,099 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6067#true} {6073#(<= 1 main_~i~0)} #118#return; {6073#(<= 1 main_~i~0)} is VALID [2022-04-28 03:11:20,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-04-28 03:11:20,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:11:20,102 INFO L290 TraceCheckUtils]: 0: Hoare triple {6067#true} ~cond := #in~cond; {6067#true} is VALID [2022-04-28 03:11:20,102 INFO L290 TraceCheckUtils]: 1: Hoare triple {6067#true} assume !(0 == ~cond); {6067#true} is VALID [2022-04-28 03:11:20,102 INFO L290 TraceCheckUtils]: 2: Hoare triple {6067#true} assume true; {6067#true} is VALID [2022-04-28 03:11:20,103 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6067#true} {6073#(<= 1 main_~i~0)} #120#return; {6073#(<= 1 main_~i~0)} is VALID [2022-04-28 03:11:20,107 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-28 03:11:20,107 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-28 03:11:20,108 INFO L290 TraceCheckUtils]: 2: Hoare triple {6067#true} assume true; {6067#true} is VALID [2022-04-28 03:11:20,108 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6067#true} {6067#true} #138#return; {6067#true} is VALID [2022-04-28 03:11:20,108 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-28 03:11:20,108 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-28 03:11:20,108 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-28 03:11:20,108 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-28 03:11:20,109 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-28 03:11:20,109 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-28 03:11:20,109 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-28 03:11:20,109 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-28 03:11:20,109 INFO L290 TraceCheckUtils]: 12: Hoare triple {6067#true} ~cond := #in~cond; {6067#true} is VALID [2022-04-28 03:11:20,110 INFO L290 TraceCheckUtils]: 13: Hoare triple {6067#true} assume !(0 == ~cond); {6067#true} is VALID [2022-04-28 03:11:20,110 INFO L290 TraceCheckUtils]: 14: Hoare triple {6067#true} assume true; {6067#true} is VALID [2022-04-28 03:11:20,110 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {6067#true} {6073#(<= 1 main_~i~0)} #118#return; {6073#(<= 1 main_~i~0)} is VALID [2022-04-28 03:11:20,110 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-28 03:11:20,110 INFO L290 TraceCheckUtils]: 17: Hoare triple {6067#true} ~cond := #in~cond; {6067#true} is VALID [2022-04-28 03:11:20,110 INFO L290 TraceCheckUtils]: 18: Hoare triple {6067#true} assume !(0 == ~cond); {6067#true} is VALID [2022-04-28 03:11:20,110 INFO L290 TraceCheckUtils]: 19: Hoare triple {6067#true} assume true; {6067#true} is VALID [2022-04-28 03:11:20,111 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {6067#true} {6073#(<= 1 main_~i~0)} #120#return; {6073#(<= 1 main_~i~0)} is VALID [2022-04-28 03:11:20,111 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-28 03:11:20,111 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-28 03:11:20,112 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-28 03:11:20,112 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-28 03:11:20,112 INFO L290 TraceCheckUtils]: 25: Hoare triple {6083#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {6068#false} is VALID [2022-04-28 03:11:20,113 INFO L290 TraceCheckUtils]: 26: Hoare triple {6068#false} assume !false; {6068#false} is VALID [2022-04-28 03:11:20,113 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-28 03:11:20,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:11:20,113 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [358365182] [2022-04-28 03:11:20,113 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [358365182] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:11:20,113 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:11:20,113 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 03:11:20,113 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:11:20,113 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1900874466] [2022-04-28 03:11:20,113 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1900874466] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:11:20,113 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:11:20,114 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 03:11:20,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [413111897] [2022-04-28 03:11:20,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:11:20,114 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-28 03:11:20,114 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:11:20,114 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-28 03:11:20,127 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-28 03:11:20,127 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-28 03:11:20,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:11:20,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-28 03:11:20,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-04-28 03:11:20,128 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-28 03:11:21,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:11:21,750 INFO L93 Difference]: Finished difference Result 275 states and 448 transitions. [2022-04-28 03:11:21,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-28 03:11:21,750 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-28 03:11:21,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:11:21,750 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-28 03:11:21,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 147 transitions. [2022-04-28 03:11:21,752 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-28 03:11:21,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 147 transitions. [2022-04-28 03:11:21,753 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 147 transitions. [2022-04-28 03:11:21,868 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-28 03:11:21,876 INFO L225 Difference]: With dead ends: 275 [2022-04-28 03:11:21,876 INFO L226 Difference]: Without dead ends: 273 [2022-04-28 03:11:21,876 INFO L412 NwaCegarLoop]: 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-28 03:11:21,876 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 81 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 339 mSolverCounterSat, 106 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s 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.4s IncrementalHoareTripleChecker+Time [2022-04-28 03:11:21,877 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 61 Invalid, 445 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [106 Valid, 339 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-28 03:11:21,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2022-04-28 03:11:22,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 249. [2022-04-28 03:11:22,585 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:11:22,585 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-28 03:11:22,586 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-28 03:11:22,587 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-28 03:11:22,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:11:22,596 INFO L93 Difference]: Finished difference Result 273 states and 446 transitions. [2022-04-28 03:11:22,596 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 446 transitions. [2022-04-28 03:11:22,597 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:11:22,597 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:11:22,597 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-28 03:11:22,598 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-28 03:11:22,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:11:22,606 INFO L93 Difference]: Finished difference Result 273 states and 446 transitions. [2022-04-28 03:11:22,606 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 446 transitions. [2022-04-28 03:11:22,607 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:11:22,608 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:11:22,608 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:11:22,608 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:11:22,608 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-28 03:11:22,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 405 transitions. [2022-04-28 03:11:22,616 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 405 transitions. Word has length 27 [2022-04-28 03:11:22,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:11:22,617 INFO L495 AbstractCegarLoop]: Abstraction has 249 states and 405 transitions. [2022-04-28 03:11:22,617 INFO L496 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-28 03:11:22,618 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 249 states and 405 transitions. [2022-04-28 03:11:23,060 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-28 03:11:23,060 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 405 transitions. [2022-04-28 03:11:23,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-28 03:11:23,061 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:11:23,061 INFO L195 NwaCegarLoop]: 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-28 03:11:23,061 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-04-28 03:11:23,061 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:11:23,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:11:23,062 INFO L85 PathProgramCache]: Analyzing trace with hash -870562259, now seen corresponding path program 1 times [2022-04-28 03:11:23,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:11:23,062 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2014506452] [2022-04-28 03:11:23,062 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 03:11:23,062 INFO L85 PathProgramCache]: Analyzing trace with hash -870562259, now seen corresponding path program 2 times [2022-04-28 03:11:23,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:11:23,062 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [199154690] [2022-04-28 03:11:23,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:11:23,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:11:23,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:11:23,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:11:23,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:11:23,102 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-28 03:11:23,102 INFO L290 TraceCheckUtils]: 1: Hoare triple {7694#true} assume true; {7694#true} is VALID [2022-04-28 03:11:23,102 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7694#true} {7694#true} #138#return; {7694#true} is VALID [2022-04-28 03:11:23,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-28 03:11:23,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:11:23,104 INFO L290 TraceCheckUtils]: 0: Hoare triple {7694#true} ~cond := #in~cond; {7694#true} is VALID [2022-04-28 03:11:23,105 INFO L290 TraceCheckUtils]: 1: Hoare triple {7694#true} assume !(0 == ~cond); {7694#true} is VALID [2022-04-28 03:11:23,105 INFO L290 TraceCheckUtils]: 2: Hoare triple {7694#true} assume true; {7694#true} is VALID [2022-04-28 03:11:23,105 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7694#true} {7695#false} #130#return; {7695#false} is VALID [2022-04-28 03:11:23,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-04-28 03:11:23,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:11:23,115 INFO L290 TraceCheckUtils]: 0: Hoare triple {7694#true} ~cond := #in~cond; {7694#true} is VALID [2022-04-28 03:11:23,115 INFO L290 TraceCheckUtils]: 1: Hoare triple {7694#true} assume !(0 == ~cond); {7694#true} is VALID [2022-04-28 03:11:23,115 INFO L290 TraceCheckUtils]: 2: Hoare triple {7694#true} assume true; {7694#true} is VALID [2022-04-28 03:11:23,116 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7694#true} {7695#false} #132#return; {7695#false} is VALID [2022-04-28 03:11:23,117 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-28 03:11:23,117 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-28 03:11:23,117 INFO L290 TraceCheckUtils]: 2: Hoare triple {7694#true} assume true; {7694#true} is VALID [2022-04-28 03:11:23,117 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7694#true} {7694#true} #138#return; {7694#true} is VALID [2022-04-28 03:11:23,117 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-28 03:11:23,117 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-28 03:11:23,118 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-28 03:11:23,119 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-28 03:11:23,119 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-28 03:11:23,119 INFO L290 TraceCheckUtils]: 9: Hoare triple {7701#(<= main_~j~0 main_~r~0)} assume !(~j~0 <= ~r~0); {7695#false} is VALID [2022-04-28 03:11:23,119 INFO L290 TraceCheckUtils]: 10: Hoare triple {7695#false} assume ~l~0 > 1; {7695#false} is VALID [2022-04-28 03:11:23,119 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-28 03:11:23,120 INFO L290 TraceCheckUtils]: 12: Hoare triple {7694#true} ~cond := #in~cond; {7694#true} is VALID [2022-04-28 03:11:23,120 INFO L290 TraceCheckUtils]: 13: Hoare triple {7694#true} assume !(0 == ~cond); {7694#true} is VALID [2022-04-28 03:11:23,120 INFO L290 TraceCheckUtils]: 14: Hoare triple {7694#true} assume true; {7694#true} is VALID [2022-04-28 03:11:23,120 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {7694#true} {7695#false} #130#return; {7695#false} is VALID [2022-04-28 03:11:23,120 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-28 03:11:23,120 INFO L290 TraceCheckUtils]: 17: Hoare triple {7694#true} ~cond := #in~cond; {7694#true} is VALID [2022-04-28 03:11:23,120 INFO L290 TraceCheckUtils]: 18: Hoare triple {7694#true} assume !(0 == ~cond); {7694#true} is VALID [2022-04-28 03:11:23,120 INFO L290 TraceCheckUtils]: 19: Hoare triple {7694#true} assume true; {7694#true} is VALID [2022-04-28 03:11:23,120 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {7694#true} {7695#false} #132#return; {7695#false} is VALID [2022-04-28 03:11:23,120 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-28 03:11:23,121 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-28 03:11:23,121 INFO L290 TraceCheckUtils]: 23: Hoare triple {7695#false} assume !!(~j~0 <= ~r~0); {7695#false} is VALID [2022-04-28 03:11:23,121 INFO L290 TraceCheckUtils]: 24: Hoare triple {7695#false} assume ~j~0 < ~r~0; {7695#false} is VALID [2022-04-28 03:11:23,121 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-28 03:11:23,121 INFO L290 TraceCheckUtils]: 26: Hoare triple {7695#false} ~cond := #in~cond; {7695#false} is VALID [2022-04-28 03:11:23,121 INFO L290 TraceCheckUtils]: 27: Hoare triple {7695#false} assume 0 == ~cond; {7695#false} is VALID [2022-04-28 03:11:23,121 INFO L290 TraceCheckUtils]: 28: Hoare triple {7695#false} assume !false; {7695#false} is VALID [2022-04-28 03:11:23,121 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-28 03:11:23,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:11:23,121 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [199154690] [2022-04-28 03:11:23,122 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [199154690] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:11:23,122 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:11:23,122 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 03:11:23,122 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:11:23,122 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2014506452] [2022-04-28 03:11:23,122 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2014506452] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:11:23,122 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:11:23,122 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 03:11:23,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1037929422] [2022-04-28 03:11:23,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:11:23,122 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-28 03:11:23,123 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:11:23,123 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-28 03:11:23,152 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-28 03:11:23,152 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 03:11:23,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:11:23,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 03:11:23,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-04-28 03:11:23,153 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-28 03:11:25,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:11:25,410 INFO L93 Difference]: Finished difference Result 593 states and 971 transitions. [2022-04-28 03:11:25,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-28 03:11:25,410 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-28 03:11:25,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:11:25,410 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-28 03:11:25,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 258 transitions. [2022-04-28 03:11:25,413 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-28 03:11:25,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 258 transitions. [2022-04-28 03:11:25,417 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 258 transitions. [2022-04-28 03:11:25,619 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-28 03:11:25,631 INFO L225 Difference]: With dead ends: 593 [2022-04-28 03:11:25,631 INFO L226 Difference]: Without dead ends: 396 [2022-04-28 03:11:25,632 INFO L412 NwaCegarLoop]: 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-28 03:11:25,632 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 95 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 263 mSolverCounterSat, 213 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s 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.5s IncrementalHoareTripleChecker+Time [2022-04-28 03:11:25,633 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 60 Invalid, 476 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [213 Valid, 263 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-28 03:11:25,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 396 states. [2022-04-28 03:11:26,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 396 to 250. [2022-04-28 03:11:26,462 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:11:26,462 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-28 03:11:26,463 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-28 03:11:26,463 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-28 03:11:26,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:11:26,477 INFO L93 Difference]: Finished difference Result 396 states and 653 transitions. [2022-04-28 03:11:26,477 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 653 transitions. [2022-04-28 03:11:26,479 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:11:26,479 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:11:26,480 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-28 03:11:26,480 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-28 03:11:26,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:11:26,494 INFO L93 Difference]: Finished difference Result 396 states and 653 transitions. [2022-04-28 03:11:26,494 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 653 transitions. [2022-04-28 03:11:26,496 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:11:26,496 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:11:26,496 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:11:26,496 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:11:26,497 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-28 03:11:26,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 405 transitions. [2022-04-28 03:11:26,505 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 405 transitions. Word has length 29 [2022-04-28 03:11:26,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:11:26,505 INFO L495 AbstractCegarLoop]: Abstraction has 250 states and 405 transitions. [2022-04-28 03:11:26,505 INFO L496 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-28 03:11:26,505 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 250 states and 405 transitions. [2022-04-28 03:11:26,983 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-28 03:11:26,983 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 405 transitions. [2022-04-28 03:11:26,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-28 03:11:26,983 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:11:26,983 INFO L195 NwaCegarLoop]: 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-28 03:11:26,984 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-04-28 03:11:26,984 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:11:26,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:11:26,984 INFO L85 PathProgramCache]: Analyzing trace with hash -1319777776, now seen corresponding path program 1 times [2022-04-28 03:11:26,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:11:26,984 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1967105355] [2022-04-28 03:11:26,984 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 03:11:26,985 INFO L85 PathProgramCache]: Analyzing trace with hash -1319777776, now seen corresponding path program 2 times [2022-04-28 03:11:26,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:11:26,985 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [208302812] [2022-04-28 03:11:26,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:11:26,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:11:26,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:11:27,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:11:27,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:11:27,043 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-28 03:11:27,043 INFO L290 TraceCheckUtils]: 1: Hoare triple {10201#true} assume true; {10201#true} is VALID [2022-04-28 03:11:27,043 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {10201#true} {10201#true} #138#return; {10201#true} is VALID [2022-04-28 03:11:27,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-28 03:11:27,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:11:27,048 INFO L290 TraceCheckUtils]: 0: Hoare triple {10201#true} ~cond := #in~cond; {10201#true} is VALID [2022-04-28 03:11:27,048 INFO L290 TraceCheckUtils]: 1: Hoare triple {10201#true} assume !(0 == ~cond); {10201#true} is VALID [2022-04-28 03:11:27,048 INFO L290 TraceCheckUtils]: 2: Hoare triple {10201#true} assume true; {10201#true} is VALID [2022-04-28 03:11:27,048 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-28 03:11:27,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-04-28 03:11:27,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:11:27,052 INFO L290 TraceCheckUtils]: 0: Hoare triple {10201#true} ~cond := #in~cond; {10201#true} is VALID [2022-04-28 03:11:27,052 INFO L290 TraceCheckUtils]: 1: Hoare triple {10201#true} assume !(0 == ~cond); {10201#true} is VALID [2022-04-28 03:11:27,053 INFO L290 TraceCheckUtils]: 2: Hoare triple {10201#true} assume true; {10201#true} is VALID [2022-04-28 03:11:27,053 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-28 03:11:27,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-04-28 03:11:27,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:11:27,056 INFO L290 TraceCheckUtils]: 0: Hoare triple {10201#true} ~cond := #in~cond; {10201#true} is VALID [2022-04-28 03:11:27,056 INFO L290 TraceCheckUtils]: 1: Hoare triple {10201#true} assume !(0 == ~cond); {10201#true} is VALID [2022-04-28 03:11:27,056 INFO L290 TraceCheckUtils]: 2: Hoare triple {10201#true} assume true; {10201#true} is VALID [2022-04-28 03:11:27,057 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-28 03:11:27,057 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-28 03:11:27,057 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-28 03:11:27,057 INFO L290 TraceCheckUtils]: 2: Hoare triple {10201#true} assume true; {10201#true} is VALID [2022-04-28 03:11:27,057 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10201#true} {10201#true} #138#return; {10201#true} is VALID [2022-04-28 03:11:27,057 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-28 03:11:27,057 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-28 03:11:27,058 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-28 03:11:27,058 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-28 03:11:27,058 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-28 03:11:27,059 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-28 03:11:27,059 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-28 03:11:27,059 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-28 03:11:27,059 INFO L290 TraceCheckUtils]: 12: Hoare triple {10201#true} ~cond := #in~cond; {10201#true} is VALID [2022-04-28 03:11:27,060 INFO L290 TraceCheckUtils]: 13: Hoare triple {10201#true} assume !(0 == ~cond); {10201#true} is VALID [2022-04-28 03:11:27,060 INFO L290 TraceCheckUtils]: 14: Hoare triple {10201#true} assume true; {10201#true} is VALID [2022-04-28 03:11:27,060 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-28 03:11:27,060 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-28 03:11:27,060 INFO L290 TraceCheckUtils]: 17: Hoare triple {10201#true} ~cond := #in~cond; {10201#true} is VALID [2022-04-28 03:11:27,060 INFO L290 TraceCheckUtils]: 18: Hoare triple {10201#true} assume !(0 == ~cond); {10201#true} is VALID [2022-04-28 03:11:27,060 INFO L290 TraceCheckUtils]: 19: Hoare triple {10201#true} assume true; {10201#true} is VALID [2022-04-28 03:11:27,061 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-28 03:11:27,061 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-28 03:11:27,061 INFO L290 TraceCheckUtils]: 22: Hoare triple {10201#true} ~cond := #in~cond; {10201#true} is VALID [2022-04-28 03:11:27,061 INFO L290 TraceCheckUtils]: 23: Hoare triple {10201#true} assume !(0 == ~cond); {10201#true} is VALID [2022-04-28 03:11:27,061 INFO L290 TraceCheckUtils]: 24: Hoare triple {10201#true} assume true; {10201#true} is VALID [2022-04-28 03:11:27,062 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-28 03:11:27,062 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-28 03:11:27,062 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-28 03:11:27,063 INFO L290 TraceCheckUtils]: 28: Hoare triple {10221#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {10202#false} is VALID [2022-04-28 03:11:27,063 INFO L290 TraceCheckUtils]: 29: Hoare triple {10202#false} assume !false; {10202#false} is VALID [2022-04-28 03:11:27,063 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-28 03:11:27,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:11:27,063 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [208302812] [2022-04-28 03:11:27,063 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [208302812] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:11:27,063 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:11:27,063 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 03:11:27,063 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:11:27,064 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1967105355] [2022-04-28 03:11:27,064 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1967105355] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:11:27,064 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:11:27,064 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 03:11:27,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1310072496] [2022-04-28 03:11:27,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:11:27,064 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-28 03:11:27,064 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:11:27,064 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-28 03:11:27,077 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-28 03:11:27,077 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-28 03:11:27,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:11:27,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-28 03:11:27,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-04-28 03:11:27,078 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-28 03:11:28,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:11:28,930 INFO L93 Difference]: Finished difference Result 324 states and 521 transitions. [2022-04-28 03:11:28,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-28 03:11:28,930 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-28 03:11:28,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:11:28,931 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-28 03:11:28,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 92 transitions. [2022-04-28 03:11:28,932 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-28 03:11:28,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 92 transitions. [2022-04-28 03:11:28,933 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 92 transitions. [2022-04-28 03:11:29,023 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-28 03:11:29,030 INFO L225 Difference]: With dead ends: 324 [2022-04-28 03:11:29,031 INFO L226 Difference]: Without dead ends: 322 [2022-04-28 03:11:29,031 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2022-04-28 03:11:29,031 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 46 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 288 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s 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.4s IncrementalHoareTripleChecker+Time [2022-04-28 03:11:29,032 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 75 Invalid, 374 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 288 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-28 03:11:29,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2022-04-28 03:11:30,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 300. [2022-04-28 03:11:30,110 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:11:30,111 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-28 03:11:30,111 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-28 03:11:30,112 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-28 03:11:30,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:11:30,121 INFO L93 Difference]: Finished difference Result 322 states and 519 transitions. [2022-04-28 03:11:30,121 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 519 transitions. [2022-04-28 03:11:30,122 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:11:30,122 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:11:30,123 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-28 03:11:30,123 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-28 03:11:30,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:11:30,132 INFO L93 Difference]: Finished difference Result 322 states and 519 transitions. [2022-04-28 03:11:30,132 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 519 transitions. [2022-04-28 03:11:30,134 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:11:30,134 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:11:30,134 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:11:30,134 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:11:30,134 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-28 03:11:30,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 489 transitions. [2022-04-28 03:11:30,144 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 489 transitions. Word has length 30 [2022-04-28 03:11:30,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:11:30,144 INFO L495 AbstractCegarLoop]: Abstraction has 300 states and 489 transitions. [2022-04-28 03:11:30,144 INFO L496 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-28 03:11:30,144 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 300 states and 489 transitions. [2022-04-28 03:11:31,029 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-28 03:11:31,029 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 489 transitions. [2022-04-28 03:11:31,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-28 03:11:31,030 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:11:31,030 INFO L195 NwaCegarLoop]: 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-28 03:11:31,030 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-04-28 03:11:31,030 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:11:31,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:11:31,030 INFO L85 PathProgramCache]: Analyzing trace with hash 1828949766, now seen corresponding path program 1 times [2022-04-28 03:11:31,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:11:31,030 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1804313712] [2022-04-28 03:11:31,031 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 03:11:31,031 INFO L85 PathProgramCache]: Analyzing trace with hash 1828949766, now seen corresponding path program 2 times [2022-04-28 03:11:31,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:11:31,031 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [507661501] [2022-04-28 03:11:31,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:11:31,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:11:31,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:11:31,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:11:31,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:11:31,086 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-28 03:11:31,086 INFO L290 TraceCheckUtils]: 1: Hoare triple {12128#true} assume true; {12128#true} is VALID [2022-04-28 03:11:31,087 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {12128#true} {12128#true} #138#return; {12128#true} is VALID [2022-04-28 03:11:31,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-28 03:11:31,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:11:31,094 INFO L290 TraceCheckUtils]: 0: Hoare triple {12128#true} ~cond := #in~cond; {12128#true} is VALID [2022-04-28 03:11:31,096 INFO L290 TraceCheckUtils]: 1: Hoare triple {12128#true} assume !(0 == ~cond); {12128#true} is VALID [2022-04-28 03:11:31,096 INFO L290 TraceCheckUtils]: 2: Hoare triple {12128#true} assume true; {12128#true} is VALID [2022-04-28 03:11:31,097 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-28 03:11:31,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-04-28 03:11:31,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:11:31,102 INFO L290 TraceCheckUtils]: 0: Hoare triple {12128#true} ~cond := #in~cond; {12128#true} is VALID [2022-04-28 03:11:31,102 INFO L290 TraceCheckUtils]: 1: Hoare triple {12128#true} assume !(0 == ~cond); {12128#true} is VALID [2022-04-28 03:11:31,102 INFO L290 TraceCheckUtils]: 2: Hoare triple {12128#true} assume true; {12128#true} is VALID [2022-04-28 03:11:31,103 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-28 03:11:31,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-04-28 03:11:31,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:11:31,109 INFO L290 TraceCheckUtils]: 0: Hoare triple {12128#true} ~cond := #in~cond; {12128#true} is VALID [2022-04-28 03:11:31,109 INFO L290 TraceCheckUtils]: 1: Hoare triple {12128#true} assume !(0 == ~cond); {12128#true} is VALID [2022-04-28 03:11:31,109 INFO L290 TraceCheckUtils]: 2: Hoare triple {12128#true} assume true; {12128#true} is VALID [2022-04-28 03:11:31,109 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-28 03:11:31,110 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-28 03:11:31,110 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-28 03:11:31,110 INFO L290 TraceCheckUtils]: 2: Hoare triple {12128#true} assume true; {12128#true} is VALID [2022-04-28 03:11:31,110 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12128#true} {12128#true} #138#return; {12128#true} is VALID [2022-04-28 03:11:31,110 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-28 03:11:31,110 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-28 03:11:31,111 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-28 03:11:31,111 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-28 03:11:31,112 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-28 03:11:31,112 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-28 03:11:31,112 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-28 03:11:31,112 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-28 03:11:31,112 INFO L290 TraceCheckUtils]: 12: Hoare triple {12128#true} ~cond := #in~cond; {12128#true} is VALID [2022-04-28 03:11:31,112 INFO L290 TraceCheckUtils]: 13: Hoare triple {12128#true} assume !(0 == ~cond); {12128#true} is VALID [2022-04-28 03:11:31,112 INFO L290 TraceCheckUtils]: 14: Hoare triple {12128#true} assume true; {12128#true} is VALID [2022-04-28 03:11:31,113 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-28 03:11:31,113 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-28 03:11:31,113 INFO L290 TraceCheckUtils]: 17: Hoare triple {12128#true} ~cond := #in~cond; {12128#true} is VALID [2022-04-28 03:11:31,113 INFO L290 TraceCheckUtils]: 18: Hoare triple {12128#true} assume !(0 == ~cond); {12128#true} is VALID [2022-04-28 03:11:31,113 INFO L290 TraceCheckUtils]: 19: Hoare triple {12128#true} assume true; {12128#true} is VALID [2022-04-28 03:11:31,114 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-28 03:11:31,114 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-28 03:11:31,114 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-28 03:11:31,114 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-28 03:11:31,114 INFO L290 TraceCheckUtils]: 24: Hoare triple {12128#true} ~cond := #in~cond; {12128#true} is VALID [2022-04-28 03:11:31,114 INFO L290 TraceCheckUtils]: 25: Hoare triple {12128#true} assume !(0 == ~cond); {12128#true} is VALID [2022-04-28 03:11:31,114 INFO L290 TraceCheckUtils]: 26: Hoare triple {12128#true} assume true; {12128#true} is VALID [2022-04-28 03:11:31,115 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-28 03:11:31,115 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-28 03:11:31,116 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-28 03:11:31,116 INFO L290 TraceCheckUtils]: 30: Hoare triple {12149#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {12129#false} is VALID [2022-04-28 03:11:31,116 INFO L290 TraceCheckUtils]: 31: Hoare triple {12129#false} assume !false; {12129#false} is VALID [2022-04-28 03:11:31,116 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-28 03:11:31,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:11:31,116 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [507661501] [2022-04-28 03:11:31,116 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [507661501] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:11:31,116 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:11:31,117 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 03:11:31,117 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:11:31,117 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1804313712] [2022-04-28 03:11:31,117 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1804313712] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:11:31,117 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:11:31,117 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 03:11:31,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [506326278] [2022-04-28 03:11:31,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:11:31,117 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-28 03:11:31,117 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:11:31,118 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-28 03:11:31,132 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-28 03:11:31,132 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-28 03:11:31,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:11:31,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-28 03:11:31,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-04-28 03:11:31,133 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-28 03:11:34,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:11:34,179 INFO L93 Difference]: Finished difference Result 470 states and 788 transitions. [2022-04-28 03:11:34,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-28 03:11:34,180 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-28 03:11:34,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:11:34,180 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-28 03:11:34,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 145 transitions. [2022-04-28 03:11:34,182 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-28 03:11:34,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 145 transitions. [2022-04-28 03:11:34,183 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 145 transitions. [2022-04-28 03:11:34,306 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-28 03:11:34,317 INFO L225 Difference]: With dead ends: 470 [2022-04-28 03:11:34,317 INFO L226 Difference]: Without dead ends: 468 [2022-04-28 03:11:34,318 INFO L412 NwaCegarLoop]: 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-28 03:11:34,318 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 98 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 402 mSolverCounterSat, 155 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s 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.5s IncrementalHoareTripleChecker+Time [2022-04-28 03:11:34,318 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 77 Invalid, 557 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [155 Valid, 402 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-28 03:11:34,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 468 states. [2022-04-28 03:11:36,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 468 to 422. [2022-04-28 03:11:36,099 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:11:36,099 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-28 03:11:36,100 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-28 03:11:36,100 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-28 03:11:36,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:11:36,118 INFO L93 Difference]: Finished difference Result 468 states and 786 transitions. [2022-04-28 03:11:36,118 INFO L276 IsEmpty]: Start isEmpty. Operand 468 states and 786 transitions. [2022-04-28 03:11:36,120 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:11:36,120 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:11:36,121 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-28 03:11:36,121 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-28 03:11:36,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:11:36,139 INFO L93 Difference]: Finished difference Result 468 states and 786 transitions. [2022-04-28 03:11:36,139 INFO L276 IsEmpty]: Start isEmpty. Operand 468 states and 786 transitions. [2022-04-28 03:11:36,141 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:11:36,141 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:11:36,141 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:11:36,141 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:11:36,142 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-28 03:11:36,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 422 states and 708 transitions. [2022-04-28 03:11:36,158 INFO L78 Accepts]: Start accepts. Automaton has 422 states and 708 transitions. Word has length 32 [2022-04-28 03:11:36,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:11:36,158 INFO L495 AbstractCegarLoop]: Abstraction has 422 states and 708 transitions. [2022-04-28 03:11:36,158 INFO L496 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-28 03:11:36,158 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 422 states and 708 transitions. [2022-04-28 03:11:37,088 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-28 03:11:37,088 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 708 transitions. [2022-04-28 03:11:37,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-28 03:11:37,089 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:11:37,089 INFO L195 NwaCegarLoop]: 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-28 03:11:37,089 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-04-28 03:11:37,089 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:11:37,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:11:37,089 INFO L85 PathProgramCache]: Analyzing trace with hash 1969498376, now seen corresponding path program 1 times [2022-04-28 03:11:37,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:11:37,089 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [430924131] [2022-04-28 03:11:37,090 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 03:11:37,090 INFO L85 PathProgramCache]: Analyzing trace with hash 1969498376, now seen corresponding path program 2 times [2022-04-28 03:11:37,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:11:37,090 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1392455] [2022-04-28 03:11:37,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:11:37,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:11:37,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:11:37,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:11:37,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:11:37,158 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-28 03:11:37,158 INFO L290 TraceCheckUtils]: 1: Hoare triple {14885#true} assume true; {14885#true} is VALID [2022-04-28 03:11:37,158 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {14885#true} {14885#true} #138#return; {14885#true} is VALID [2022-04-28 03:11:37,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-28 03:11:37,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:11:37,160 INFO L290 TraceCheckUtils]: 0: Hoare triple {14885#true} ~cond := #in~cond; {14885#true} is VALID [2022-04-28 03:11:37,161 INFO L290 TraceCheckUtils]: 1: Hoare triple {14885#true} assume !(0 == ~cond); {14885#true} is VALID [2022-04-28 03:11:37,161 INFO L290 TraceCheckUtils]: 2: Hoare triple {14885#true} assume true; {14885#true} is VALID [2022-04-28 03:11:37,161 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-28 03:11:37,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-04-28 03:11:37,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:11:37,164 INFO L290 TraceCheckUtils]: 0: Hoare triple {14885#true} ~cond := #in~cond; {14885#true} is VALID [2022-04-28 03:11:37,164 INFO L290 TraceCheckUtils]: 1: Hoare triple {14885#true} assume !(0 == ~cond); {14885#true} is VALID [2022-04-28 03:11:37,164 INFO L290 TraceCheckUtils]: 2: Hoare triple {14885#true} assume true; {14885#true} is VALID [2022-04-28 03:11:37,164 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-28 03:11:37,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-04-28 03:11:37,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:11:37,170 INFO L290 TraceCheckUtils]: 0: Hoare triple {14885#true} ~cond := #in~cond; {14885#true} is VALID [2022-04-28 03:11:37,170 INFO L290 TraceCheckUtils]: 1: Hoare triple {14885#true} assume !(0 == ~cond); {14885#true} is VALID [2022-04-28 03:11:37,170 INFO L290 TraceCheckUtils]: 2: Hoare triple {14885#true} assume true; {14885#true} is VALID [2022-04-28 03:11:37,171 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-28 03:11:37,171 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-28 03:11:37,171 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-28 03:11:37,171 INFO L290 TraceCheckUtils]: 2: Hoare triple {14885#true} assume true; {14885#true} is VALID [2022-04-28 03:11:37,171 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14885#true} {14885#true} #138#return; {14885#true} is VALID [2022-04-28 03:11:37,172 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-28 03:11:37,172 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-28 03:11:37,172 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-28 03:11:37,172 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-28 03:11:37,173 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-28 03:11:37,173 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-28 03:11:37,173 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-28 03:11:37,173 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-28 03:11:37,173 INFO L290 TraceCheckUtils]: 12: Hoare triple {14885#true} ~cond := #in~cond; {14885#true} is VALID [2022-04-28 03:11:37,173 INFO L290 TraceCheckUtils]: 13: Hoare triple {14885#true} assume !(0 == ~cond); {14885#true} is VALID [2022-04-28 03:11:37,174 INFO L290 TraceCheckUtils]: 14: Hoare triple {14885#true} assume true; {14885#true} is VALID [2022-04-28 03:11:37,174 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-28 03:11:37,174 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-28 03:11:37,174 INFO L290 TraceCheckUtils]: 17: Hoare triple {14885#true} ~cond := #in~cond; {14885#true} is VALID [2022-04-28 03:11:37,174 INFO L290 TraceCheckUtils]: 18: Hoare triple {14885#true} assume !(0 == ~cond); {14885#true} is VALID [2022-04-28 03:11:37,174 INFO L290 TraceCheckUtils]: 19: Hoare triple {14885#true} assume true; {14885#true} is VALID [2022-04-28 03:11:37,175 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-28 03:11:37,175 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-28 03:11:37,175 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-28 03:11:37,175 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-28 03:11:37,175 INFO L290 TraceCheckUtils]: 24: Hoare triple {14885#true} ~cond := #in~cond; {14885#true} is VALID [2022-04-28 03:11:37,175 INFO L290 TraceCheckUtils]: 25: Hoare triple {14885#true} assume !(0 == ~cond); {14885#true} is VALID [2022-04-28 03:11:37,175 INFO L290 TraceCheckUtils]: 26: Hoare triple {14885#true} assume true; {14885#true} is VALID [2022-04-28 03:11:37,176 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-28 03:11:37,176 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-28 03:11:37,176 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-28 03:11:37,177 INFO L290 TraceCheckUtils]: 30: Hoare triple {14906#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {14886#false} is VALID [2022-04-28 03:11:37,177 INFO L290 TraceCheckUtils]: 31: Hoare triple {14886#false} assume !false; {14886#false} is VALID [2022-04-28 03:11:37,177 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-28 03:11:37,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:11:37,177 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1392455] [2022-04-28 03:11:37,177 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1392455] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:11:37,177 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:11:37,177 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 03:11:37,178 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:11:37,178 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [430924131] [2022-04-28 03:11:37,178 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [430924131] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:11:37,178 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:11:37,178 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 03:11:37,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [963773874] [2022-04-28 03:11:37,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:11:37,178 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-28 03:11:37,178 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:11:37,178 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-28 03:11:37,193 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-28 03:11:37,193 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-28 03:11:37,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:11:37,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-28 03:11:37,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-04-28 03:11:37,193 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-28 03:11:40,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:11:40,412 INFO L93 Difference]: Finished difference Result 489 states and 817 transitions. [2022-04-28 03:11:40,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-28 03:11:40,412 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-28 03:11:40,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:11:40,412 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-28 03:11:40,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 107 transitions. [2022-04-28 03:11:40,413 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-28 03:11:40,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 107 transitions. [2022-04-28 03:11:40,414 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 107 transitions. [2022-04-28 03:11:40,510 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-28 03:11:40,522 INFO L225 Difference]: With dead ends: 489 [2022-04-28 03:11:40,522 INFO L226 Difference]: Without dead ends: 487 [2022-04-28 03:11:40,523 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2022-04-28 03:11:40,523 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 109 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 272 mSolverCounterSat, 138 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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.3s IncrementalHoareTripleChecker+Time [2022-04-28 03:11:40,523 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 66 Invalid, 410 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [138 Valid, 272 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-28 03:11:40,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 487 states. [2022-04-28 03:11:42,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 487 to 429. [2022-04-28 03:11:42,584 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:11:42,585 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-28 03:11:42,585 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-28 03:11:42,585 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-28 03:11:42,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:11:42,603 INFO L93 Difference]: Finished difference Result 487 states and 815 transitions. [2022-04-28 03:11:42,603 INFO L276 IsEmpty]: Start isEmpty. Operand 487 states and 815 transitions. [2022-04-28 03:11:42,605 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:11:42,605 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:11:42,606 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-28 03:11:42,606 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-28 03:11:42,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:11:42,625 INFO L93 Difference]: Finished difference Result 487 states and 815 transitions. [2022-04-28 03:11:42,625 INFO L276 IsEmpty]: Start isEmpty. Operand 487 states and 815 transitions. [2022-04-28 03:11:42,626 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:11:42,626 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:11:42,626 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:11:42,626 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:11:42,627 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-28 03:11:42,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 429 states to 429 states and 717 transitions. [2022-04-28 03:11:42,643 INFO L78 Accepts]: Start accepts. Automaton has 429 states and 717 transitions. Word has length 32 [2022-04-28 03:11:42,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:11:42,644 INFO L495 AbstractCegarLoop]: Abstraction has 429 states and 717 transitions. [2022-04-28 03:11:42,644 INFO L496 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-28 03:11:42,644 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 429 states and 717 transitions. [2022-04-28 03:11:43,766 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-28 03:11:43,766 INFO L276 IsEmpty]: Start isEmpty. Operand 429 states and 717 transitions. [2022-04-28 03:11:43,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-04-28 03:11:43,767 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:11:43,767 INFO L195 NwaCegarLoop]: 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-28 03:11:43,767 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-04-28 03:11:43,767 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:11:43,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:11:43,768 INFO L85 PathProgramCache]: Analyzing trace with hash 154781133, now seen corresponding path program 1 times [2022-04-28 03:11:43,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:11:43,768 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1020581414] [2022-04-28 03:11:43,768 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 03:11:43,768 INFO L85 PathProgramCache]: Analyzing trace with hash 154781133, now seen corresponding path program 2 times [2022-04-28 03:11:43,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:11:43,768 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1999653463] [2022-04-28 03:11:43,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:11:43,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:11:43,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:11:43,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:11:43,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:11:43,831 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-28 03:11:43,831 INFO L290 TraceCheckUtils]: 1: Hoare triple {17730#true} assume true; {17730#true} is VALID [2022-04-28 03:11:43,831 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {17730#true} {17730#true} #138#return; {17730#true} is VALID [2022-04-28 03:11:43,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-28 03:11:43,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:11:43,836 INFO L290 TraceCheckUtils]: 0: Hoare triple {17730#true} ~cond := #in~cond; {17730#true} is VALID [2022-04-28 03:11:43,836 INFO L290 TraceCheckUtils]: 1: Hoare triple {17730#true} assume !(0 == ~cond); {17730#true} is VALID [2022-04-28 03:11:43,836 INFO L290 TraceCheckUtils]: 2: Hoare triple {17730#true} assume true; {17730#true} is VALID [2022-04-28 03:11:43,836 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-28 03:11:43,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-04-28 03:11:43,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:11:43,839 INFO L290 TraceCheckUtils]: 0: Hoare triple {17730#true} ~cond := #in~cond; {17730#true} is VALID [2022-04-28 03:11:43,839 INFO L290 TraceCheckUtils]: 1: Hoare triple {17730#true} assume !(0 == ~cond); {17730#true} is VALID [2022-04-28 03:11:43,839 INFO L290 TraceCheckUtils]: 2: Hoare triple {17730#true} assume true; {17730#true} is VALID [2022-04-28 03:11:43,839 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-28 03:11:43,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-04-28 03:11:43,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:11:43,841 INFO L290 TraceCheckUtils]: 0: Hoare triple {17730#true} ~cond := #in~cond; {17730#true} is VALID [2022-04-28 03:11:43,841 INFO L290 TraceCheckUtils]: 1: Hoare triple {17730#true} assume !(0 == ~cond); {17730#true} is VALID [2022-04-28 03:11:43,842 INFO L290 TraceCheckUtils]: 2: Hoare triple {17730#true} assume true; {17730#true} is VALID [2022-04-28 03:11:43,842 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-28 03:11:43,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-04-28 03:11:43,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:11:43,844 INFO L290 TraceCheckUtils]: 0: Hoare triple {17730#true} ~cond := #in~cond; {17730#true} is VALID [2022-04-28 03:11:43,844 INFO L290 TraceCheckUtils]: 1: Hoare triple {17730#true} assume !(0 == ~cond); {17730#true} is VALID [2022-04-28 03:11:43,844 INFO L290 TraceCheckUtils]: 2: Hoare triple {17730#true} assume true; {17730#true} is VALID [2022-04-28 03:11:43,844 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-28 03:11:43,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-04-28 03:11:43,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:11:43,849 INFO L290 TraceCheckUtils]: 0: Hoare triple {17730#true} ~cond := #in~cond; {17730#true} is VALID [2022-04-28 03:11:43,849 INFO L290 TraceCheckUtils]: 1: Hoare triple {17730#true} assume !(0 == ~cond); {17730#true} is VALID [2022-04-28 03:11:43,850 INFO L290 TraceCheckUtils]: 2: Hoare triple {17730#true} assume true; {17730#true} is VALID [2022-04-28 03:11:43,850 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-28 03:11:43,850 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-28 03:11:43,850 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-28 03:11:43,850 INFO L290 TraceCheckUtils]: 2: Hoare triple {17730#true} assume true; {17730#true} is VALID [2022-04-28 03:11:43,851 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17730#true} {17730#true} #138#return; {17730#true} is VALID [2022-04-28 03:11:43,851 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-28 03:11:43,851 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-28 03:11:43,851 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-28 03:11:43,851 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-28 03:11:43,852 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-28 03:11:43,852 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-28 03:11:43,852 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-28 03:11:43,852 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-28 03:11:43,853 INFO L290 TraceCheckUtils]: 12: Hoare triple {17730#true} ~cond := #in~cond; {17730#true} is VALID [2022-04-28 03:11:43,853 INFO L290 TraceCheckUtils]: 13: Hoare triple {17730#true} assume !(0 == ~cond); {17730#true} is VALID [2022-04-28 03:11:43,853 INFO L290 TraceCheckUtils]: 14: Hoare triple {17730#true} assume true; {17730#true} is VALID [2022-04-28 03:11:43,853 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-28 03:11:43,853 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-28 03:11:43,853 INFO L290 TraceCheckUtils]: 17: Hoare triple {17730#true} ~cond := #in~cond; {17730#true} is VALID [2022-04-28 03:11:43,853 INFO L290 TraceCheckUtils]: 18: Hoare triple {17730#true} assume !(0 == ~cond); {17730#true} is VALID [2022-04-28 03:11:43,853 INFO L290 TraceCheckUtils]: 19: Hoare triple {17730#true} assume true; {17730#true} is VALID [2022-04-28 03:11:43,854 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-28 03:11:43,854 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-28 03:11:43,854 INFO L290 TraceCheckUtils]: 22: Hoare triple {17730#true} ~cond := #in~cond; {17730#true} is VALID [2022-04-28 03:11:43,854 INFO L290 TraceCheckUtils]: 23: Hoare triple {17730#true} assume !(0 == ~cond); {17730#true} is VALID [2022-04-28 03:11:43,854 INFO L290 TraceCheckUtils]: 24: Hoare triple {17730#true} assume true; {17730#true} is VALID [2022-04-28 03:11:43,854 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-28 03:11:43,854 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-28 03:11:43,854 INFO L290 TraceCheckUtils]: 27: Hoare triple {17730#true} ~cond := #in~cond; {17730#true} is VALID [2022-04-28 03:11:43,855 INFO L290 TraceCheckUtils]: 28: Hoare triple {17730#true} assume !(0 == ~cond); {17730#true} is VALID [2022-04-28 03:11:43,855 INFO L290 TraceCheckUtils]: 29: Hoare triple {17730#true} assume true; {17730#true} is VALID [2022-04-28 03:11:43,855 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-28 03:11:43,855 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-28 03:11:43,856 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-28 03:11:43,856 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-28 03:11:43,856 INFO L290 TraceCheckUtils]: 34: Hoare triple {17730#true} ~cond := #in~cond; {17730#true} is VALID [2022-04-28 03:11:43,856 INFO L290 TraceCheckUtils]: 35: Hoare triple {17730#true} assume !(0 == ~cond); {17730#true} is VALID [2022-04-28 03:11:43,856 INFO L290 TraceCheckUtils]: 36: Hoare triple {17730#true} assume true; {17730#true} is VALID [2022-04-28 03:11:43,856 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-28 03:11:43,857 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-28 03:11:43,857 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-28 03:11:43,857 INFO L290 TraceCheckUtils]: 40: Hoare triple {17759#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {17731#false} is VALID [2022-04-28 03:11:43,857 INFO L290 TraceCheckUtils]: 41: Hoare triple {17731#false} assume !false; {17731#false} is VALID [2022-04-28 03:11:43,857 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-28 03:11:43,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:11:43,858 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1999653463] [2022-04-28 03:11:43,858 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1999653463] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:11:43,858 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:11:43,858 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 03:11:43,858 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:11:43,858 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1020581414] [2022-04-28 03:11:43,858 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1020581414] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:11:43,858 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:11:43,858 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 03:11:43,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1973573190] [2022-04-28 03:11:43,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:11:43,859 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-28 03:11:43,859 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:11:43,859 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-28 03:11:43,874 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-28 03:11:43,874 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-28 03:11:43,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:11:43,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-28 03:11:43,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-04-28 03:11:43,876 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-28 03:11:47,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:11:47,117 INFO L93 Difference]: Finished difference Result 484 states and 791 transitions. [2022-04-28 03:11:47,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-28 03:11:47,117 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-28 03:11:47,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:11:47,118 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-28 03:11:47,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 105 transitions. [2022-04-28 03:11:47,119 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-28 03:11:47,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 105 transitions. [2022-04-28 03:11:47,119 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 105 transitions. [2022-04-28 03:11:47,203 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-28 03:11:47,214 INFO L225 Difference]: With dead ends: 484 [2022-04-28 03:11:47,214 INFO L226 Difference]: Without dead ends: 482 [2022-04-28 03:11:47,215 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2022-04-28 03:11:47,215 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 56 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 373 mSolverCounterSat, 112 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s 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.4s IncrementalHoareTripleChecker+Time [2022-04-28 03:11:47,215 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 82 Invalid, 485 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [112 Valid, 373 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-28 03:11:47,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 482 states. [2022-04-28 03:11:49,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 482 to 433. [2022-04-28 03:11:49,429 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:11:49,430 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-28 03:11:49,430 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-28 03:11:49,430 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-28 03:11:49,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:11:49,445 INFO L93 Difference]: Finished difference Result 482 states and 789 transitions. [2022-04-28 03:11:49,445 INFO L276 IsEmpty]: Start isEmpty. Operand 482 states and 789 transitions. [2022-04-28 03:11:49,447 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:11:49,447 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:11:49,447 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-28 03:11:49,448 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-28 03:11:49,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:11:49,463 INFO L93 Difference]: Finished difference Result 482 states and 789 transitions. [2022-04-28 03:11:49,463 INFO L276 IsEmpty]: Start isEmpty. Operand 482 states and 789 transitions. [2022-04-28 03:11:49,464 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:11:49,464 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:11:49,464 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:11:49,464 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:11:49,465 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-28 03:11:49,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 433 states to 433 states and 720 transitions. [2022-04-28 03:11:49,480 INFO L78 Accepts]: Start accepts. Automaton has 433 states and 720 transitions. Word has length 42 [2022-04-28 03:11:49,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:11:49,480 INFO L495 AbstractCegarLoop]: Abstraction has 433 states and 720 transitions. [2022-04-28 03:11:49,480 INFO L496 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-28 03:11:49,480 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 433 states and 720 transitions. [2022-04-28 03:11:50,421 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-28 03:11:50,421 INFO L276 IsEmpty]: Start isEmpty. Operand 433 states and 720 transitions. [2022-04-28 03:11:50,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-04-28 03:11:50,422 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:11:50,422 INFO L195 NwaCegarLoop]: 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-28 03:11:50,422 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-04-28 03:11:50,422 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:11:50,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:11:50,423 INFO L85 PathProgramCache]: Analyzing trace with hash -756625364, now seen corresponding path program 1 times [2022-04-28 03:11:50,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:11:50,423 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1498417177] [2022-04-28 03:11:50,423 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 03:11:50,423 INFO L85 PathProgramCache]: Analyzing trace with hash -756625364, now seen corresponding path program 2 times [2022-04-28 03:11:50,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:11:50,423 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [629152846] [2022-04-28 03:11:50,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:11:50,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:11:50,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:11:50,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:11:50,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:11:50,491 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-28 03:11:50,492 INFO L290 TraceCheckUtils]: 1: Hoare triple {20574#true} assume true; {20574#true} is VALID [2022-04-28 03:11:50,492 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {20574#true} {20574#true} #138#return; {20574#true} is VALID [2022-04-28 03:11:50,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-28 03:11:50,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:11:50,497 INFO L290 TraceCheckUtils]: 0: Hoare triple {20574#true} ~cond := #in~cond; {20574#true} is VALID [2022-04-28 03:11:50,497 INFO L290 TraceCheckUtils]: 1: Hoare triple {20574#true} assume !(0 == ~cond); {20574#true} is VALID [2022-04-28 03:11:50,497 INFO L290 TraceCheckUtils]: 2: Hoare triple {20574#true} assume true; {20574#true} is VALID [2022-04-28 03:11:50,497 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20574#true} {20574#true} #118#return; {20574#true} is VALID [2022-04-28 03:11:50,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-04-28 03:11:50,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:11:50,500 INFO L290 TraceCheckUtils]: 0: Hoare triple {20574#true} ~cond := #in~cond; {20574#true} is VALID [2022-04-28 03:11:50,500 INFO L290 TraceCheckUtils]: 1: Hoare triple {20574#true} assume !(0 == ~cond); {20574#true} is VALID [2022-04-28 03:11:50,500 INFO L290 TraceCheckUtils]: 2: Hoare triple {20574#true} assume true; {20574#true} is VALID [2022-04-28 03:11:50,500 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20574#true} {20574#true} #120#return; {20574#true} is VALID [2022-04-28 03:11:50,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-04-28 03:11:50,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:11:50,503 INFO L290 TraceCheckUtils]: 0: Hoare triple {20574#true} ~cond := #in~cond; {20574#true} is VALID [2022-04-28 03:11:50,503 INFO L290 TraceCheckUtils]: 1: Hoare triple {20574#true} assume !(0 == ~cond); {20574#true} is VALID [2022-04-28 03:11:50,503 INFO L290 TraceCheckUtils]: 2: Hoare triple {20574#true} assume true; {20574#true} is VALID [2022-04-28 03:11:50,503 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20574#true} {20587#(<= 2 main_~l~0)} #130#return; {20587#(<= 2 main_~l~0)} is VALID [2022-04-28 03:11:50,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-04-28 03:11:50,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:11:50,505 INFO L290 TraceCheckUtils]: 0: Hoare triple {20574#true} ~cond := #in~cond; {20574#true} is VALID [2022-04-28 03:11:50,506 INFO L290 TraceCheckUtils]: 1: Hoare triple {20574#true} assume !(0 == ~cond); {20574#true} is VALID [2022-04-28 03:11:50,506 INFO L290 TraceCheckUtils]: 2: Hoare triple {20574#true} assume true; {20574#true} is VALID [2022-04-28 03:11:50,506 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20574#true} {20587#(<= 2 main_~l~0)} #132#return; {20587#(<= 2 main_~l~0)} is VALID [2022-04-28 03:11:50,506 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-28 03:11:50,506 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-28 03:11:50,507 INFO L290 TraceCheckUtils]: 2: Hoare triple {20574#true} assume true; {20574#true} is VALID [2022-04-28 03:11:50,507 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20574#true} {20574#true} #138#return; {20574#true} is VALID [2022-04-28 03:11:50,507 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-28 03:11:50,507 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-28 03:11:50,507 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-28 03:11:50,507 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-28 03:11:50,507 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-28 03:11:50,507 INFO L290 TraceCheckUtils]: 9: Hoare triple {20574#true} assume !!(~j~0 <= ~r~0); {20574#true} is VALID [2022-04-28 03:11:50,507 INFO L290 TraceCheckUtils]: 10: Hoare triple {20574#true} assume !(~j~0 < ~r~0); {20574#true} is VALID [2022-04-28 03:11:50,507 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-28 03:11:50,507 INFO L290 TraceCheckUtils]: 12: Hoare triple {20574#true} ~cond := #in~cond; {20574#true} is VALID [2022-04-28 03:11:50,507 INFO L290 TraceCheckUtils]: 13: Hoare triple {20574#true} assume !(0 == ~cond); {20574#true} is VALID [2022-04-28 03:11:50,507 INFO L290 TraceCheckUtils]: 14: Hoare triple {20574#true} assume true; {20574#true} is VALID [2022-04-28 03:11:50,507 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {20574#true} {20574#true} #118#return; {20574#true} is VALID [2022-04-28 03:11:50,508 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-28 03:11:50,508 INFO L290 TraceCheckUtils]: 17: Hoare triple {20574#true} ~cond := #in~cond; {20574#true} is VALID [2022-04-28 03:11:50,508 INFO L290 TraceCheckUtils]: 18: Hoare triple {20574#true} assume !(0 == ~cond); {20574#true} is VALID [2022-04-28 03:11:50,509 INFO L290 TraceCheckUtils]: 19: Hoare triple {20574#true} assume true; {20574#true} is VALID [2022-04-28 03:11:50,509 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {20574#true} {20574#true} #120#return; {20574#true} is VALID [2022-04-28 03:11:50,509 INFO L290 TraceCheckUtils]: 21: Hoare triple {20574#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {20574#true} is VALID [2022-04-28 03:11:50,509 INFO L290 TraceCheckUtils]: 22: Hoare triple {20574#true} assume 0 != #t~nondet5;havoc #t~nondet5; {20574#true} is VALID [2022-04-28 03:11:50,509 INFO L290 TraceCheckUtils]: 23: Hoare triple {20574#true} assume ~l~0 > 1; {20587#(<= 2 main_~l~0)} is VALID [2022-04-28 03:11:50,510 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-28 03:11:50,510 INFO L290 TraceCheckUtils]: 25: Hoare triple {20574#true} ~cond := #in~cond; {20574#true} is VALID [2022-04-28 03:11:50,510 INFO L290 TraceCheckUtils]: 26: Hoare triple {20574#true} assume !(0 == ~cond); {20574#true} is VALID [2022-04-28 03:11:50,510 INFO L290 TraceCheckUtils]: 27: Hoare triple {20574#true} assume true; {20574#true} is VALID [2022-04-28 03:11:50,510 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {20574#true} {20587#(<= 2 main_~l~0)} #130#return; {20587#(<= 2 main_~l~0)} is VALID [2022-04-28 03:11:50,510 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-28 03:11:50,510 INFO L290 TraceCheckUtils]: 30: Hoare triple {20574#true} ~cond := #in~cond; {20574#true} is VALID [2022-04-28 03:11:50,511 INFO L290 TraceCheckUtils]: 31: Hoare triple {20574#true} assume !(0 == ~cond); {20574#true} is VALID [2022-04-28 03:11:50,511 INFO L290 TraceCheckUtils]: 32: Hoare triple {20574#true} assume true; {20574#true} is VALID [2022-04-28 03:11:50,511 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {20574#true} {20587#(<= 2 main_~l~0)} #132#return; {20587#(<= 2 main_~l~0)} is VALID [2022-04-28 03:11:50,512 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-28 03:11:50,512 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-28 03:11:50,514 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-28 03:11:50,514 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-28 03:11:50,514 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-28 03:11:50,515 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-28 03:11:50,515 INFO L290 TraceCheckUtils]: 40: Hoare triple {20599#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {20575#false} is VALID [2022-04-28 03:11:50,515 INFO L290 TraceCheckUtils]: 41: Hoare triple {20575#false} assume !false; {20575#false} is VALID [2022-04-28 03:11:50,515 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-28 03:11:50,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:11:50,516 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [629152846] [2022-04-28 03:11:50,516 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [629152846] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:11:50,516 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:11:50,516 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 03:11:50,516 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:11:50,516 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1498417177] [2022-04-28 03:11:50,516 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1498417177] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:11:50,516 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:11:50,516 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 03:11:50,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1606976861] [2022-04-28 03:11:50,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:11:50,516 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-28 03:11:50,517 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:11:50,517 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-28 03:11:50,535 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-28 03:11:50,535 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-28 03:11:50,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:11:50,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-28 03:11:50,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-04-28 03:11:50,536 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-28 03:11:53,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:11:53,172 INFO L93 Difference]: Finished difference Result 440 states and 726 transitions. [2022-04-28 03:11:53,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-28 03:11:53,172 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-28 03:11:53,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:11:53,172 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-28 03:11:53,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 64 transitions. [2022-04-28 03:11:53,173 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-28 03:11:53,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 64 transitions. [2022-04-28 03:11:53,174 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 64 transitions. [2022-04-28 03:11:53,237 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-28 03:11:53,253 INFO L225 Difference]: With dead ends: 440 [2022-04-28 03:11:53,253 INFO L226 Difference]: Without dead ends: 438 [2022-04-28 03:11:53,254 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2022-04-28 03:11:53,256 INFO L413 NwaCegarLoop]: 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-28 03:11:53,256 INFO L414 NwaCegarLoop]: 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-28 03:11:53,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 438 states. [2022-04-28 03:11:55,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 438 to 437. [2022-04-28 03:11:55,393 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:11:55,394 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-28 03:11:55,394 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-28 03:11:55,395 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-28 03:11:55,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:11:55,408 INFO L93 Difference]: Finished difference Result 438 states and 724 transitions. [2022-04-28 03:11:55,408 INFO L276 IsEmpty]: Start isEmpty. Operand 438 states and 724 transitions. [2022-04-28 03:11:55,409 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:11:55,409 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:11:55,410 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-28 03:11:55,410 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-28 03:11:55,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:11:55,423 INFO L93 Difference]: Finished difference Result 438 states and 724 transitions. [2022-04-28 03:11:55,423 INFO L276 IsEmpty]: Start isEmpty. Operand 438 states and 724 transitions. [2022-04-28 03:11:55,424 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:11:55,424 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:11:55,424 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:11:55,424 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:11:55,425 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-28 03:11:55,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 437 states to 437 states and 723 transitions. [2022-04-28 03:11:55,439 INFO L78 Accepts]: Start accepts. Automaton has 437 states and 723 transitions. Word has length 42 [2022-04-28 03:11:55,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:11:55,439 INFO L495 AbstractCegarLoop]: Abstraction has 437 states and 723 transitions. [2022-04-28 03:11:55,440 INFO L496 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-28 03:11:55,440 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 437 states and 723 transitions. [2022-04-28 03:11:56,387 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-28 03:11:56,388 INFO L276 IsEmpty]: Start isEmpty. Operand 437 states and 723 transitions. [2022-04-28 03:11:56,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-04-28 03:11:56,388 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:11:56,388 INFO L195 NwaCegarLoop]: 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-28 03:11:56,388 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-04-28 03:11:56,389 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:11:56,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:11:56,389 INFO L85 PathProgramCache]: Analyzing trace with hash 202086614, now seen corresponding path program 1 times [2022-04-28 03:11:56,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:11:56,389 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1108438864] [2022-04-28 03:11:56,389 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 03:11:56,389 INFO L85 PathProgramCache]: Analyzing trace with hash 202086614, now seen corresponding path program 2 times [2022-04-28 03:11:56,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:11:56,390 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642240166] [2022-04-28 03:11:56,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:11:56,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:11:56,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:11:56,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:11:56,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:11:56,457 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-28 03:11:56,457 INFO L290 TraceCheckUtils]: 1: Hoare triple {23248#true} assume true; {23248#true} is VALID [2022-04-28 03:11:56,457 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {23248#true} {23248#true} #138#return; {23248#true} is VALID [2022-04-28 03:11:56,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-28 03:11:56,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:11:56,459 INFO L290 TraceCheckUtils]: 0: Hoare triple {23248#true} ~cond := #in~cond; {23248#true} is VALID [2022-04-28 03:11:56,459 INFO L290 TraceCheckUtils]: 1: Hoare triple {23248#true} assume !(0 == ~cond); {23248#true} is VALID [2022-04-28 03:11:56,459 INFO L290 TraceCheckUtils]: 2: Hoare triple {23248#true} assume true; {23248#true} is VALID [2022-04-28 03:11:56,459 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23248#true} {23248#true} #118#return; {23248#true} is VALID [2022-04-28 03:11:56,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-04-28 03:11:56,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:11:56,461 INFO L290 TraceCheckUtils]: 0: Hoare triple {23248#true} ~cond := #in~cond; {23248#true} is VALID [2022-04-28 03:11:56,461 INFO L290 TraceCheckUtils]: 1: Hoare triple {23248#true} assume !(0 == ~cond); {23248#true} is VALID [2022-04-28 03:11:56,461 INFO L290 TraceCheckUtils]: 2: Hoare triple {23248#true} assume true; {23248#true} is VALID [2022-04-28 03:11:56,461 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23248#true} {23248#true} #120#return; {23248#true} is VALID [2022-04-28 03:11:56,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-04-28 03:11:56,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:11:56,465 INFO L290 TraceCheckUtils]: 0: Hoare triple {23248#true} ~cond := #in~cond; {23248#true} is VALID [2022-04-28 03:11:56,465 INFO L290 TraceCheckUtils]: 1: Hoare triple {23248#true} assume !(0 == ~cond); {23248#true} is VALID [2022-04-28 03:11:56,465 INFO L290 TraceCheckUtils]: 2: Hoare triple {23248#true} assume true; {23248#true} is VALID [2022-04-28 03:11:56,466 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23248#true} {23261#(<= 2 main_~l~0)} #130#return; {23261#(<= 2 main_~l~0)} is VALID [2022-04-28 03:11:56,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-04-28 03:11:56,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:11:56,469 INFO L290 TraceCheckUtils]: 0: Hoare triple {23248#true} ~cond := #in~cond; {23248#true} is VALID [2022-04-28 03:11:56,469 INFO L290 TraceCheckUtils]: 1: Hoare triple {23248#true} assume !(0 == ~cond); {23248#true} is VALID [2022-04-28 03:11:56,470 INFO L290 TraceCheckUtils]: 2: Hoare triple {23248#true} assume true; {23248#true} is VALID [2022-04-28 03:11:56,470 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23248#true} {23261#(<= 2 main_~l~0)} #132#return; {23261#(<= 2 main_~l~0)} is VALID [2022-04-28 03:11:56,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-04-28 03:11:56,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:11:56,473 INFO L290 TraceCheckUtils]: 0: Hoare triple {23248#true} ~cond := #in~cond; {23248#true} is VALID [2022-04-28 03:11:56,474 INFO L290 TraceCheckUtils]: 1: Hoare triple {23248#true} assume !(0 == ~cond); {23248#true} is VALID [2022-04-28 03:11:56,474 INFO L290 TraceCheckUtils]: 2: Hoare triple {23248#true} assume true; {23248#true} is VALID [2022-04-28 03:11:56,474 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23248#true} {23271#(<= 1 main_~i~0)} #118#return; {23271#(<= 1 main_~i~0)} is VALID [2022-04-28 03:11:56,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-04-28 03:11:56,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:11:56,478 INFO L290 TraceCheckUtils]: 0: Hoare triple {23248#true} ~cond := #in~cond; {23248#true} is VALID [2022-04-28 03:11:56,478 INFO L290 TraceCheckUtils]: 1: Hoare triple {23248#true} assume !(0 == ~cond); {23248#true} is VALID [2022-04-28 03:11:56,478 INFO L290 TraceCheckUtils]: 2: Hoare triple {23248#true} assume true; {23248#true} is VALID [2022-04-28 03:11:56,479 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23248#true} {23271#(<= 1 main_~i~0)} #120#return; {23271#(<= 1 main_~i~0)} is VALID [2022-04-28 03:11:56,479 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-28 03:11:56,479 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-28 03:11:56,479 INFO L290 TraceCheckUtils]: 2: Hoare triple {23248#true} assume true; {23248#true} is VALID [2022-04-28 03:11:56,479 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23248#true} {23248#true} #138#return; {23248#true} is VALID [2022-04-28 03:11:56,479 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-28 03:11:56,480 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-28 03:11:56,480 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-28 03:11:56,480 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-28 03:11:56,480 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-28 03:11:56,480 INFO L290 TraceCheckUtils]: 9: Hoare triple {23248#true} assume !!(~j~0 <= ~r~0); {23248#true} is VALID [2022-04-28 03:11:56,480 INFO L290 TraceCheckUtils]: 10: Hoare triple {23248#true} assume !(~j~0 < ~r~0); {23248#true} is VALID [2022-04-28 03:11:56,480 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-28 03:11:56,480 INFO L290 TraceCheckUtils]: 12: Hoare triple {23248#true} ~cond := #in~cond; {23248#true} is VALID [2022-04-28 03:11:56,480 INFO L290 TraceCheckUtils]: 13: Hoare triple {23248#true} assume !(0 == ~cond); {23248#true} is VALID [2022-04-28 03:11:56,480 INFO L290 TraceCheckUtils]: 14: Hoare triple {23248#true} assume true; {23248#true} is VALID [2022-04-28 03:11:56,480 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {23248#true} {23248#true} #118#return; {23248#true} is VALID [2022-04-28 03:11:56,480 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-28 03:11:56,480 INFO L290 TraceCheckUtils]: 17: Hoare triple {23248#true} ~cond := #in~cond; {23248#true} is VALID [2022-04-28 03:11:56,480 INFO L290 TraceCheckUtils]: 18: Hoare triple {23248#true} assume !(0 == ~cond); {23248#true} is VALID [2022-04-28 03:11:56,481 INFO L290 TraceCheckUtils]: 19: Hoare triple {23248#true} assume true; {23248#true} is VALID [2022-04-28 03:11:56,481 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {23248#true} {23248#true} #120#return; {23248#true} is VALID [2022-04-28 03:11:56,481 INFO L290 TraceCheckUtils]: 21: Hoare triple {23248#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {23248#true} is VALID [2022-04-28 03:11:56,481 INFO L290 TraceCheckUtils]: 22: Hoare triple {23248#true} assume 0 != #t~nondet5;havoc #t~nondet5; {23248#true} is VALID [2022-04-28 03:11:56,481 INFO L290 TraceCheckUtils]: 23: Hoare triple {23248#true} assume ~l~0 > 1; {23261#(<= 2 main_~l~0)} is VALID [2022-04-28 03:11:56,481 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-28 03:11:56,481 INFO L290 TraceCheckUtils]: 25: Hoare triple {23248#true} ~cond := #in~cond; {23248#true} is VALID [2022-04-28 03:11:56,481 INFO L290 TraceCheckUtils]: 26: Hoare triple {23248#true} assume !(0 == ~cond); {23248#true} is VALID [2022-04-28 03:11:56,481 INFO L290 TraceCheckUtils]: 27: Hoare triple {23248#true} assume true; {23248#true} is VALID [2022-04-28 03:11:56,482 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {23248#true} {23261#(<= 2 main_~l~0)} #130#return; {23261#(<= 2 main_~l~0)} is VALID [2022-04-28 03:11:56,482 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-28 03:11:56,482 INFO L290 TraceCheckUtils]: 30: Hoare triple {23248#true} ~cond := #in~cond; {23248#true} is VALID [2022-04-28 03:11:56,482 INFO L290 TraceCheckUtils]: 31: Hoare triple {23248#true} assume !(0 == ~cond); {23248#true} is VALID [2022-04-28 03:11:56,482 INFO L290 TraceCheckUtils]: 32: Hoare triple {23248#true} assume true; {23248#true} is VALID [2022-04-28 03:11:56,482 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {23248#true} {23261#(<= 2 main_~l~0)} #132#return; {23261#(<= 2 main_~l~0)} is VALID [2022-04-28 03:11:56,483 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-28 03:11:56,483 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-28 03:11:56,483 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-28 03:11:56,484 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-28 03:11:56,484 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-28 03:11:56,484 INFO L290 TraceCheckUtils]: 39: Hoare triple {23248#true} ~cond := #in~cond; {23248#true} is VALID [2022-04-28 03:11:56,484 INFO L290 TraceCheckUtils]: 40: Hoare triple {23248#true} assume !(0 == ~cond); {23248#true} is VALID [2022-04-28 03:11:56,484 INFO L290 TraceCheckUtils]: 41: Hoare triple {23248#true} assume true; {23248#true} is VALID [2022-04-28 03:11:56,484 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {23248#true} {23271#(<= 1 main_~i~0)} #118#return; {23271#(<= 1 main_~i~0)} is VALID [2022-04-28 03:11:56,484 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-28 03:11:56,484 INFO L290 TraceCheckUtils]: 44: Hoare triple {23248#true} ~cond := #in~cond; {23248#true} is VALID [2022-04-28 03:11:56,484 INFO L290 TraceCheckUtils]: 45: Hoare triple {23248#true} assume !(0 == ~cond); {23248#true} is VALID [2022-04-28 03:11:56,485 INFO L290 TraceCheckUtils]: 46: Hoare triple {23248#true} assume true; {23248#true} is VALID [2022-04-28 03:11:56,485 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {23248#true} {23271#(<= 1 main_~i~0)} #120#return; {23271#(<= 1 main_~i~0)} is VALID [2022-04-28 03:11:56,485 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-28 03:11:56,485 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-28 03:11:56,486 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-28 03:11:56,486 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-28 03:11:56,486 INFO L290 TraceCheckUtils]: 52: Hoare triple {23281#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {23249#false} is VALID [2022-04-28 03:11:56,486 INFO L290 TraceCheckUtils]: 53: Hoare triple {23249#false} assume !false; {23249#false} is VALID [2022-04-28 03:11:56,488 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-28 03:11:56,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:11:56,488 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1642240166] [2022-04-28 03:11:56,489 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1642240166] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:11:56,489 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:11:56,489 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 03:11:56,490 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:11:56,490 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1108438864] [2022-04-28 03:11:56,490 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1108438864] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:11:56,490 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:11:56,490 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 03:11:56,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [879748375] [2022-04-28 03:11:56,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:11:56,490 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-28 03:11:56,490 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:11:56,491 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-28 03:11:56,511 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-28 03:11:56,511 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-28 03:11:56,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:11:56,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-28 03:11:56,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-04-28 03:11:56,512 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-28 03:11:59,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:11:59,753 INFO L93 Difference]: Finished difference Result 501 states and 826 transitions. [2022-04-28 03:11:59,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-28 03:11:59,754 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-28 03:11:59,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:11:59,754 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-28 03:11:59,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 107 transitions. [2022-04-28 03:11:59,755 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-28 03:11:59,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 107 transitions. [2022-04-28 03:11:59,756 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 107 transitions. [2022-04-28 03:11:59,840 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-28 03:11:59,863 INFO L225 Difference]: With dead ends: 501 [2022-04-28 03:11:59,863 INFO L226 Difference]: Without dead ends: 499 [2022-04-28 03:11:59,863 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2022-04-28 03:11:59,863 INFO L413 NwaCegarLoop]: 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-28 03:11:59,864 INFO L414 NwaCegarLoop]: 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-28 03:11:59,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 499 states. [2022-04-28 03:12:02,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 499 to 441. [2022-04-28 03:12:02,015 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:12:02,016 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-28 03:12:02,017 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-28 03:12:02,017 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-28 03:12:02,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:12:02,032 INFO L93 Difference]: Finished difference Result 499 states and 824 transitions. [2022-04-28 03:12:02,032 INFO L276 IsEmpty]: Start isEmpty. Operand 499 states and 824 transitions. [2022-04-28 03:12:02,033 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:12:02,033 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:12:02,034 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-28 03:12:02,034 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-28 03:12:02,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:12:02,049 INFO L93 Difference]: Finished difference Result 499 states and 824 transitions. [2022-04-28 03:12:02,049 INFO L276 IsEmpty]: Start isEmpty. Operand 499 states and 824 transitions. [2022-04-28 03:12:02,050 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:12:02,050 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:12:02,051 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:12:02,051 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:12:02,051 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-28 03:12:02,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 441 states to 441 states and 726 transitions. [2022-04-28 03:12:02,066 INFO L78 Accepts]: Start accepts. Automaton has 441 states and 726 transitions. Word has length 54 [2022-04-28 03:12:02,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:12:02,066 INFO L495 AbstractCegarLoop]: Abstraction has 441 states and 726 transitions. [2022-04-28 03:12:02,066 INFO L496 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-28 03:12:02,066 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 441 states and 726 transitions. [2022-04-28 03:12:03,016 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-28 03:12:03,017 INFO L276 IsEmpty]: Start isEmpty. Operand 441 states and 726 transitions. [2022-04-28 03:12:03,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-04-28 03:12:03,017 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:12:03,017 INFO L195 NwaCegarLoop]: 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-28 03:12:03,017 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-04-28 03:12:03,018 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:12:03,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:12:03,018 INFO L85 PathProgramCache]: Analyzing trace with hash -667500302, now seen corresponding path program 1 times [2022-04-28 03:12:03,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:12:03,018 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1811249389] [2022-04-28 03:12:03,305 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 03:12:03,305 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because UNSUPPORTED_EIGENVALUES [2022-04-28 03:12:03,305 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 03:12:03,305 INFO L85 PathProgramCache]: Analyzing trace with hash -667500302, now seen corresponding path program 2 times [2022-04-28 03:12:03,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:12:03,305 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1307495881] [2022-04-28 03:12:03,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:12:03,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:12:03,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:12:03,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:12:03,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:12:03,355 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-28 03:12:03,355 INFO L290 TraceCheckUtils]: 1: Hoare triple {26184#true} assume true; {26184#true} is VALID [2022-04-28 03:12:03,355 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {26184#true} {26184#true} #138#return; {26184#true} is VALID [2022-04-28 03:12:03,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-28 03:12:03,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:12:03,358 INFO L290 TraceCheckUtils]: 0: Hoare triple {26184#true} ~cond := #in~cond; {26184#true} is VALID [2022-04-28 03:12:03,358 INFO L290 TraceCheckUtils]: 1: Hoare triple {26184#true} assume !(0 == ~cond); {26184#true} is VALID [2022-04-28 03:12:03,358 INFO L290 TraceCheckUtils]: 2: Hoare triple {26184#true} assume true; {26184#true} is VALID [2022-04-28 03:12:03,358 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26184#true} {26190#(<= 2 main_~j~0)} #118#return; {26190#(<= 2 main_~j~0)} is VALID [2022-04-28 03:12:03,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-04-28 03:12:03,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:12:03,360 INFO L290 TraceCheckUtils]: 0: Hoare triple {26184#true} ~cond := #in~cond; {26184#true} is VALID [2022-04-28 03:12:03,361 INFO L290 TraceCheckUtils]: 1: Hoare triple {26184#true} assume !(0 == ~cond); {26184#true} is VALID [2022-04-28 03:12:03,361 INFO L290 TraceCheckUtils]: 2: Hoare triple {26184#true} assume true; {26184#true} is VALID [2022-04-28 03:12:03,361 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26184#true} {26190#(<= 2 main_~j~0)} #120#return; {26190#(<= 2 main_~j~0)} is VALID [2022-04-28 03:12:03,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-04-28 03:12:03,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:12:03,363 INFO L290 TraceCheckUtils]: 0: Hoare triple {26184#true} ~cond := #in~cond; {26184#true} is VALID [2022-04-28 03:12:03,363 INFO L290 TraceCheckUtils]: 1: Hoare triple {26184#true} assume !(0 == ~cond); {26184#true} is VALID [2022-04-28 03:12:03,363 INFO L290 TraceCheckUtils]: 2: Hoare triple {26184#true} assume true; {26184#true} is VALID [2022-04-28 03:12:03,364 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26184#true} {26190#(<= 2 main_~j~0)} #122#return; {26190#(<= 2 main_~j~0)} is VALID [2022-04-28 03:12:03,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-04-28 03:12:03,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:12:03,366 INFO L290 TraceCheckUtils]: 0: Hoare triple {26184#true} ~cond := #in~cond; {26184#true} is VALID [2022-04-28 03:12:03,366 INFO L290 TraceCheckUtils]: 1: Hoare triple {26184#true} assume !(0 == ~cond); {26184#true} is VALID [2022-04-28 03:12:03,366 INFO L290 TraceCheckUtils]: 2: Hoare triple {26184#true} assume true; {26184#true} is VALID [2022-04-28 03:12:03,366 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26184#true} {26190#(<= 2 main_~j~0)} #124#return; {26190#(<= 2 main_~j~0)} is VALID [2022-04-28 03:12:03,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-04-28 03:12:03,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:12:03,368 INFO L290 TraceCheckUtils]: 0: Hoare triple {26184#true} ~cond := #in~cond; {26184#true} is VALID [2022-04-28 03:12:03,368 INFO L290 TraceCheckUtils]: 1: Hoare triple {26184#true} assume !(0 == ~cond); {26184#true} is VALID [2022-04-28 03:12:03,369 INFO L290 TraceCheckUtils]: 2: Hoare triple {26184#true} assume true; {26184#true} is VALID [2022-04-28 03:12:03,369 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26184#true} {26190#(<= 2 main_~j~0)} #126#return; {26190#(<= 2 main_~j~0)} is VALID [2022-04-28 03:12:03,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-04-28 03:12:03,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:12:03,372 INFO L290 TraceCheckUtils]: 0: Hoare triple {26184#true} ~cond := #in~cond; {26184#true} is VALID [2022-04-28 03:12:03,372 INFO L290 TraceCheckUtils]: 1: Hoare triple {26184#true} assume !(0 == ~cond); {26184#true} is VALID [2022-04-28 03:12:03,372 INFO L290 TraceCheckUtils]: 2: Hoare triple {26184#true} assume true; {26184#true} is VALID [2022-04-28 03:12:03,373 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26184#true} {26190#(<= 2 main_~j~0)} #128#return; {26190#(<= 2 main_~j~0)} is VALID [2022-04-28 03:12:03,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-04-28 03:12:03,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:12:03,375 INFO L290 TraceCheckUtils]: 0: Hoare triple {26184#true} ~cond := #in~cond; {26184#true} is VALID [2022-04-28 03:12:03,375 INFO L290 TraceCheckUtils]: 1: Hoare triple {26184#true} assume !(0 == ~cond); {26184#true} is VALID [2022-04-28 03:12:03,375 INFO L290 TraceCheckUtils]: 2: Hoare triple {26184#true} assume true; {26184#true} is VALID [2022-04-28 03:12:03,376 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26184#true} {26215#(<= 2 main_~i~0)} #118#return; {26215#(<= 2 main_~i~0)} is VALID [2022-04-28 03:12:03,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-04-28 03:12:03,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:12:03,378 INFO L290 TraceCheckUtils]: 0: Hoare triple {26184#true} ~cond := #in~cond; {26184#true} is VALID [2022-04-28 03:12:03,378 INFO L290 TraceCheckUtils]: 1: Hoare triple {26184#true} assume !(0 == ~cond); {26184#true} is VALID [2022-04-28 03:12:03,378 INFO L290 TraceCheckUtils]: 2: Hoare triple {26184#true} assume true; {26184#true} is VALID [2022-04-28 03:12:03,379 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26184#true} {26215#(<= 2 main_~i~0)} #120#return; {26215#(<= 2 main_~i~0)} is VALID [2022-04-28 03:12:03,379 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-28 03:12:03,379 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-28 03:12:03,379 INFO L290 TraceCheckUtils]: 2: Hoare triple {26184#true} assume true; {26184#true} is VALID [2022-04-28 03:12:03,380 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26184#true} {26184#true} #138#return; {26184#true} is VALID [2022-04-28 03:12:03,380 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-28 03:12:03,380 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-28 03:12:03,380 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-28 03:12:03,380 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-28 03:12:03,381 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-28 03:12:03,381 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-28 03:12:03,381 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-28 03:12:03,381 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-28 03:12:03,381 INFO L290 TraceCheckUtils]: 12: Hoare triple {26184#true} ~cond := #in~cond; {26184#true} is VALID [2022-04-28 03:12:03,381 INFO L290 TraceCheckUtils]: 13: Hoare triple {26184#true} assume !(0 == ~cond); {26184#true} is VALID [2022-04-28 03:12:03,381 INFO L290 TraceCheckUtils]: 14: Hoare triple {26184#true} assume true; {26184#true} is VALID [2022-04-28 03:12:03,382 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {26184#true} {26190#(<= 2 main_~j~0)} #118#return; {26190#(<= 2 main_~j~0)} is VALID [2022-04-28 03:12:03,382 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-28 03:12:03,382 INFO L290 TraceCheckUtils]: 17: Hoare triple {26184#true} ~cond := #in~cond; {26184#true} is VALID [2022-04-28 03:12:03,382 INFO L290 TraceCheckUtils]: 18: Hoare triple {26184#true} assume !(0 == ~cond); {26184#true} is VALID [2022-04-28 03:12:03,382 INFO L290 TraceCheckUtils]: 19: Hoare triple {26184#true} assume true; {26184#true} is VALID [2022-04-28 03:12:03,382 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {26184#true} {26190#(<= 2 main_~j~0)} #120#return; {26190#(<= 2 main_~j~0)} is VALID [2022-04-28 03:12:03,383 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-28 03:12:03,383 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-28 03:12:03,383 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-28 03:12:03,383 INFO L290 TraceCheckUtils]: 24: Hoare triple {26184#true} ~cond := #in~cond; {26184#true} is VALID [2022-04-28 03:12:03,383 INFO L290 TraceCheckUtils]: 25: Hoare triple {26184#true} assume !(0 == ~cond); {26184#true} is VALID [2022-04-28 03:12:03,383 INFO L290 TraceCheckUtils]: 26: Hoare triple {26184#true} assume true; {26184#true} is VALID [2022-04-28 03:12:03,383 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {26184#true} {26190#(<= 2 main_~j~0)} #122#return; {26190#(<= 2 main_~j~0)} is VALID [2022-04-28 03:12:03,384 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-28 03:12:03,384 INFO L290 TraceCheckUtils]: 29: Hoare triple {26184#true} ~cond := #in~cond; {26184#true} is VALID [2022-04-28 03:12:03,384 INFO L290 TraceCheckUtils]: 30: Hoare triple {26184#true} assume !(0 == ~cond); {26184#true} is VALID [2022-04-28 03:12:03,384 INFO L290 TraceCheckUtils]: 31: Hoare triple {26184#true} assume true; {26184#true} is VALID [2022-04-28 03:12:03,384 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {26184#true} {26190#(<= 2 main_~j~0)} #124#return; {26190#(<= 2 main_~j~0)} is VALID [2022-04-28 03:12:03,384 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-28 03:12:03,384 INFO L290 TraceCheckUtils]: 34: Hoare triple {26184#true} ~cond := #in~cond; {26184#true} is VALID [2022-04-28 03:12:03,384 INFO L290 TraceCheckUtils]: 35: Hoare triple {26184#true} assume !(0 == ~cond); {26184#true} is VALID [2022-04-28 03:12:03,384 INFO L290 TraceCheckUtils]: 36: Hoare triple {26184#true} assume true; {26184#true} is VALID [2022-04-28 03:12:03,385 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {26184#true} {26190#(<= 2 main_~j~0)} #126#return; {26190#(<= 2 main_~j~0)} is VALID [2022-04-28 03:12:03,385 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-28 03:12:03,385 INFO L290 TraceCheckUtils]: 39: Hoare triple {26184#true} ~cond := #in~cond; {26184#true} is VALID [2022-04-28 03:12:03,385 INFO L290 TraceCheckUtils]: 40: Hoare triple {26184#true} assume !(0 == ~cond); {26184#true} is VALID [2022-04-28 03:12:03,385 INFO L290 TraceCheckUtils]: 41: Hoare triple {26184#true} assume true; {26184#true} is VALID [2022-04-28 03:12:03,385 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {26184#true} {26190#(<= 2 main_~j~0)} #128#return; {26190#(<= 2 main_~j~0)} is VALID [2022-04-28 03:12:03,386 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-28 03:12:03,386 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-28 03:12:03,386 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-28 03:12:03,386 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-28 03:12:03,386 INFO L290 TraceCheckUtils]: 47: Hoare triple {26184#true} ~cond := #in~cond; {26184#true} is VALID [2022-04-28 03:12:03,386 INFO L290 TraceCheckUtils]: 48: Hoare triple {26184#true} assume !(0 == ~cond); {26184#true} is VALID [2022-04-28 03:12:03,386 INFO L290 TraceCheckUtils]: 49: Hoare triple {26184#true} assume true; {26184#true} is VALID [2022-04-28 03:12:03,387 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {26184#true} {26215#(<= 2 main_~i~0)} #118#return; {26215#(<= 2 main_~i~0)} is VALID [2022-04-28 03:12:03,387 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-28 03:12:03,387 INFO L290 TraceCheckUtils]: 52: Hoare triple {26184#true} ~cond := #in~cond; {26184#true} is VALID [2022-04-28 03:12:03,387 INFO L290 TraceCheckUtils]: 53: Hoare triple {26184#true} assume !(0 == ~cond); {26184#true} is VALID [2022-04-28 03:12:03,387 INFO L290 TraceCheckUtils]: 54: Hoare triple {26184#true} assume true; {26184#true} is VALID [2022-04-28 03:12:03,387 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {26184#true} {26215#(<= 2 main_~i~0)} #120#return; {26215#(<= 2 main_~i~0)} is VALID [2022-04-28 03:12:03,388 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-28 03:12:03,388 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-28 03:12:03,389 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-28 03:12:03,389 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-28 03:12:03,389 INFO L290 TraceCheckUtils]: 60: Hoare triple {26225#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {26185#false} is VALID [2022-04-28 03:12:03,389 INFO L290 TraceCheckUtils]: 61: Hoare triple {26185#false} assume !false; {26185#false} is VALID [2022-04-28 03:12:03,389 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-28 03:12:03,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:12:03,390 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1307495881] [2022-04-28 03:12:03,390 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1307495881] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:12:03,390 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [545054586] [2022-04-28 03:12:03,390 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 03:12:03,390 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:12:03,390 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:12:03,391 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-28 03:12:03,392 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-28 03:12:03,442 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 03:12:03,442 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 03:12:03,451 INFO L263 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-28 03:12:03,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:12:03,465 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:12:03,998 INFO L272 TraceCheckUtils]: 0: Hoare triple {26184#true} call ULTIMATE.init(); {26184#true} is VALID [2022-04-28 03:12:03,998 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-28 03:12:03,998 INFO L290 TraceCheckUtils]: 2: Hoare triple {26184#true} assume true; {26184#true} is VALID [2022-04-28 03:12:03,998 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26184#true} {26184#true} #138#return; {26184#true} is VALID [2022-04-28 03:12:03,998 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-28 03:12:03,998 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-28 03:12:03,999 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-28 03:12:03,999 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-28 03:12:04,000 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-28 03:12:04,000 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-28 03:12:04,000 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-28 03:12:04,000 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-28 03:12:04,000 INFO L290 TraceCheckUtils]: 12: Hoare triple {26184#true} ~cond := #in~cond; {26184#true} is VALID [2022-04-28 03:12:04,001 INFO L290 TraceCheckUtils]: 13: Hoare triple {26184#true} assume !(0 == ~cond); {26184#true} is VALID [2022-04-28 03:12:04,001 INFO L290 TraceCheckUtils]: 14: Hoare triple {26184#true} assume true; {26184#true} is VALID [2022-04-28 03:12:04,001 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-28 03:12:04,001 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-28 03:12:04,001 INFO L290 TraceCheckUtils]: 17: Hoare triple {26184#true} ~cond := #in~cond; {26184#true} is VALID [2022-04-28 03:12:04,001 INFO L290 TraceCheckUtils]: 18: Hoare triple {26184#true} assume !(0 == ~cond); {26184#true} is VALID [2022-04-28 03:12:04,001 INFO L290 TraceCheckUtils]: 19: Hoare triple {26184#true} assume true; {26184#true} is VALID [2022-04-28 03:12:04,002 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-28 03:12:04,002 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-28 03:12:04,003 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-28 03:12:04,003 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-28 03:12:04,003 INFO L290 TraceCheckUtils]: 24: Hoare triple {26184#true} ~cond := #in~cond; {26184#true} is VALID [2022-04-28 03:12:04,003 INFO L290 TraceCheckUtils]: 25: Hoare triple {26184#true} assume !(0 == ~cond); {26184#true} is VALID [2022-04-28 03:12:04,003 INFO L290 TraceCheckUtils]: 26: Hoare triple {26184#true} assume true; {26184#true} is VALID [2022-04-28 03:12:04,004 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-28 03:12:04,004 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-28 03:12:04,004 INFO L290 TraceCheckUtils]: 29: Hoare triple {26184#true} ~cond := #in~cond; {26184#true} is VALID [2022-04-28 03:12:04,004 INFO L290 TraceCheckUtils]: 30: Hoare triple {26184#true} assume !(0 == ~cond); {26184#true} is VALID [2022-04-28 03:12:04,004 INFO L290 TraceCheckUtils]: 31: Hoare triple {26184#true} assume true; {26184#true} is VALID [2022-04-28 03:12:04,005 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-28 03:12:04,005 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-28 03:12:04,005 INFO L290 TraceCheckUtils]: 34: Hoare triple {26184#true} ~cond := #in~cond; {26184#true} is VALID [2022-04-28 03:12:04,005 INFO L290 TraceCheckUtils]: 35: Hoare triple {26184#true} assume !(0 == ~cond); {26184#true} is VALID [2022-04-28 03:12:04,005 INFO L290 TraceCheckUtils]: 36: Hoare triple {26184#true} assume true; {26184#true} is VALID [2022-04-28 03:12:04,005 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-28 03:12:04,005 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-28 03:12:04,006 INFO L290 TraceCheckUtils]: 39: Hoare triple {26184#true} ~cond := #in~cond; {26184#true} is VALID [2022-04-28 03:12:04,006 INFO L290 TraceCheckUtils]: 40: Hoare triple {26184#true} assume !(0 == ~cond); {26184#true} is VALID [2022-04-28 03:12:04,006 INFO L290 TraceCheckUtils]: 41: Hoare triple {26184#true} assume true; {26184#true} is VALID [2022-04-28 03:12:04,006 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-28 03:12:04,007 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-28 03:12:04,007 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-28 03:12:04,007 INFO L290 TraceCheckUtils]: 45: Hoare triple {26185#false} assume !(~j~0 < ~r~0); {26185#false} is VALID [2022-04-28 03:12:04,007 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-28 03:12:04,008 INFO L290 TraceCheckUtils]: 47: Hoare triple {26185#false} ~cond := #in~cond; {26185#false} is VALID [2022-04-28 03:12:04,008 INFO L290 TraceCheckUtils]: 48: Hoare triple {26185#false} assume !(0 == ~cond); {26185#false} is VALID [2022-04-28 03:12:04,008 INFO L290 TraceCheckUtils]: 49: Hoare triple {26185#false} assume true; {26185#false} is VALID [2022-04-28 03:12:04,008 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {26185#false} {26185#false} #118#return; {26185#false} is VALID [2022-04-28 03:12:04,008 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-28 03:12:04,008 INFO L290 TraceCheckUtils]: 52: Hoare triple {26185#false} ~cond := #in~cond; {26185#false} is VALID [2022-04-28 03:12:04,008 INFO L290 TraceCheckUtils]: 53: Hoare triple {26185#false} assume !(0 == ~cond); {26185#false} is VALID [2022-04-28 03:12:04,008 INFO L290 TraceCheckUtils]: 54: Hoare triple {26185#false} assume true; {26185#false} is VALID [2022-04-28 03:12:04,008 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {26185#false} {26185#false} #120#return; {26185#false} is VALID [2022-04-28 03:12:04,008 INFO L290 TraceCheckUtils]: 56: Hoare triple {26185#false} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {26185#false} is VALID [2022-04-28 03:12:04,008 INFO L290 TraceCheckUtils]: 57: Hoare triple {26185#false} assume !(0 != #t~nondet5);havoc #t~nondet5; {26185#false} is VALID [2022-04-28 03:12:04,008 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-28 03:12:04,009 INFO L290 TraceCheckUtils]: 59: Hoare triple {26185#false} ~cond := #in~cond; {26185#false} is VALID [2022-04-28 03:12:04,009 INFO L290 TraceCheckUtils]: 60: Hoare triple {26185#false} assume 0 == ~cond; {26185#false} is VALID [2022-04-28 03:12:04,009 INFO L290 TraceCheckUtils]: 61: Hoare triple {26185#false} assume !false; {26185#false} is VALID [2022-04-28 03:12:04,009 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-28 03:12:04,009 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 03:12:04,009 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [545054586] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:12:04,009 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-28 03:12:04,009 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 11 [2022-04-28 03:12:04,010 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:12:04,010 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1811249389] [2022-04-28 03:12:04,010 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1811249389] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:12:04,010 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:12:04,010 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 03:12:04,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2054693237] [2022-04-28 03:12:04,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:12:04,011 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-28 03:12:04,011 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:12:04,011 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-28 03:12:04,044 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-28 03:12:04,044 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 03:12:04,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:12:04,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 03:12:04,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2022-04-28 03:12:04,045 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-28 03:12:06,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:12:06,706 INFO L93 Difference]: Finished difference Result 843 states and 1374 transitions. [2022-04-28 03:12:06,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 03:12:06,706 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-28 03:12:06,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:12:06,707 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-28 03:12:06,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 152 transitions. [2022-04-28 03:12:06,708 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-28 03:12:06,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 152 transitions. [2022-04-28 03:12:06,709 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 152 transitions. [2022-04-28 03:12:06,808 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-28 03:12:06,819 INFO L225 Difference]: With dead ends: 843 [2022-04-28 03:12:06,819 INFO L226 Difference]: Without dead ends: 437 [2022-04-28 03:12:06,820 INFO L412 NwaCegarLoop]: 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-28 03:12:06,821 INFO L413 NwaCegarLoop]: 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-28 03:12:06,821 INFO L414 NwaCegarLoop]: 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-28 03:12:06,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 437 states. [2022-04-28 03:12:08,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 437 to 401. [2022-04-28 03:12:08,890 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:12:08,891 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-28 03:12:08,892 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-28 03:12:08,892 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-28 03:12:08,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:12:08,904 INFO L93 Difference]: Finished difference Result 437 states and 700 transitions. [2022-04-28 03:12:08,904 INFO L276 IsEmpty]: Start isEmpty. Operand 437 states and 700 transitions. [2022-04-28 03:12:08,905 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:12:08,905 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:12:08,906 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-28 03:12:08,906 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-28 03:12:08,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:12:08,917 INFO L93 Difference]: Finished difference Result 437 states and 700 transitions. [2022-04-28 03:12:08,917 INFO L276 IsEmpty]: Start isEmpty. Operand 437 states and 700 transitions. [2022-04-28 03:12:08,919 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:12:08,919 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:12:08,919 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:12:08,919 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:12:08,919 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-28 03:12:08,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 401 states and 644 transitions. [2022-04-28 03:12:08,931 INFO L78 Accepts]: Start accepts. Automaton has 401 states and 644 transitions. Word has length 62 [2022-04-28 03:12:08,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:12:08,931 INFO L495 AbstractCegarLoop]: Abstraction has 401 states and 644 transitions. [2022-04-28 03:12:08,931 INFO L496 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-28 03:12:08,932 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 401 states and 644 transitions. [2022-04-28 03:12:09,804 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-28 03:12:09,804 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 644 transitions. [2022-04-28 03:12:09,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-04-28 03:12:09,805 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:12:09,805 INFO L195 NwaCegarLoop]: 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-28 03:12:09,821 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-28 03:12:10,005 WARN L477 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-28 03:12:10,006 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:12:10,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:12:10,006 INFO L85 PathProgramCache]: Analyzing trace with hash 1858540084, now seen corresponding path program 1 times [2022-04-28 03:12:10,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:12:10,006 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1244500150] [2022-04-28 03:12:10,400 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 03:12:10,400 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because UNSUPPORTED_EIGENVALUES [2022-04-28 03:12:10,400 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 03:12:10,400 INFO L85 PathProgramCache]: Analyzing trace with hash 1858540084, now seen corresponding path program 2 times [2022-04-28 03:12:10,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:12:10,401 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464070593] [2022-04-28 03:12:10,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:12:10,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:12:10,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:12:10,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:12:10,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:12:10,493 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-28 03:12:10,493 INFO L290 TraceCheckUtils]: 1: Hoare triple {29777#true} assume true; {29777#true} is VALID [2022-04-28 03:12:10,493 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {29777#true} {29777#true} #138#return; {29777#true} is VALID [2022-04-28 03:12:10,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-28 03:12:10,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:12:10,495 INFO L290 TraceCheckUtils]: 0: Hoare triple {29777#true} ~cond := #in~cond; {29777#true} is VALID [2022-04-28 03:12:10,495 INFO L290 TraceCheckUtils]: 1: Hoare triple {29777#true} assume !(0 == ~cond); {29777#true} is VALID [2022-04-28 03:12:10,495 INFO L290 TraceCheckUtils]: 2: Hoare triple {29777#true} assume true; {29777#true} is VALID [2022-04-28 03:12:10,496 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29777#true} {29783#(<= 2 main_~j~0)} #110#return; {29783#(<= 2 main_~j~0)} is VALID [2022-04-28 03:12:10,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-04-28 03:12:10,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:12:10,499 INFO L290 TraceCheckUtils]: 0: Hoare triple {29777#true} ~cond := #in~cond; {29777#true} is VALID [2022-04-28 03:12:10,499 INFO L290 TraceCheckUtils]: 1: Hoare triple {29777#true} assume !(0 == ~cond); {29777#true} is VALID [2022-04-28 03:12:10,499 INFO L290 TraceCheckUtils]: 2: Hoare triple {29777#true} assume true; {29777#true} is VALID [2022-04-28 03:12:10,500 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29777#true} {29783#(<= 2 main_~j~0)} #112#return; {29783#(<= 2 main_~j~0)} is VALID [2022-04-28 03:12:10,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-04-28 03:12:10,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:12:10,511 INFO L290 TraceCheckUtils]: 0: Hoare triple {29777#true} ~cond := #in~cond; {29777#true} is VALID [2022-04-28 03:12:10,511 INFO L290 TraceCheckUtils]: 1: Hoare triple {29777#true} assume !(0 == ~cond); {29777#true} is VALID [2022-04-28 03:12:10,511 INFO L290 TraceCheckUtils]: 2: Hoare triple {29777#true} assume true; {29777#true} is VALID [2022-04-28 03:12:10,512 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29777#true} {29783#(<= 2 main_~j~0)} #114#return; {29783#(<= 2 main_~j~0)} is VALID [2022-04-28 03:12:10,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-04-28 03:12:10,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:12:10,515 INFO L290 TraceCheckUtils]: 0: Hoare triple {29777#true} ~cond := #in~cond; {29777#true} is VALID [2022-04-28 03:12:10,515 INFO L290 TraceCheckUtils]: 1: Hoare triple {29777#true} assume !(0 == ~cond); {29777#true} is VALID [2022-04-28 03:12:10,515 INFO L290 TraceCheckUtils]: 2: Hoare triple {29777#true} assume true; {29777#true} is VALID [2022-04-28 03:12:10,516 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29777#true} {29783#(<= 2 main_~j~0)} #116#return; {29783#(<= 2 main_~j~0)} is VALID [2022-04-28 03:12:10,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-04-28 03:12:10,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:12:10,519 INFO L290 TraceCheckUtils]: 0: Hoare triple {29777#true} ~cond := #in~cond; {29777#true} is VALID [2022-04-28 03:12:10,519 INFO L290 TraceCheckUtils]: 1: Hoare triple {29777#true} assume !(0 == ~cond); {29777#true} is VALID [2022-04-28 03:12:10,519 INFO L290 TraceCheckUtils]: 2: Hoare triple {29777#true} assume true; {29777#true} is VALID [2022-04-28 03:12:10,520 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29777#true} {29800#(<= 3 main_~j~0)} #118#return; {29800#(<= 3 main_~j~0)} is VALID [2022-04-28 03:12:10,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-04-28 03:12:10,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:12:10,523 INFO L290 TraceCheckUtils]: 0: Hoare triple {29777#true} ~cond := #in~cond; {29777#true} is VALID [2022-04-28 03:12:10,524 INFO L290 TraceCheckUtils]: 1: Hoare triple {29777#true} assume !(0 == ~cond); {29777#true} is VALID [2022-04-28 03:12:10,524 INFO L290 TraceCheckUtils]: 2: Hoare triple {29777#true} assume true; {29777#true} is VALID [2022-04-28 03:12:10,524 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29777#true} {29800#(<= 3 main_~j~0)} #120#return; {29800#(<= 3 main_~j~0)} is VALID [2022-04-28 03:12:10,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-04-28 03:12:10,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:12:10,526 INFO L290 TraceCheckUtils]: 0: Hoare triple {29777#true} ~cond := #in~cond; {29777#true} is VALID [2022-04-28 03:12:10,527 INFO L290 TraceCheckUtils]: 1: Hoare triple {29777#true} assume !(0 == ~cond); {29777#true} is VALID [2022-04-28 03:12:10,527 INFO L290 TraceCheckUtils]: 2: Hoare triple {29777#true} assume true; {29777#true} is VALID [2022-04-28 03:12:10,527 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29777#true} {29800#(<= 3 main_~j~0)} #122#return; {29800#(<= 3 main_~j~0)} is VALID [2022-04-28 03:12:10,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-04-28 03:12:10,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:12:10,531 INFO L290 TraceCheckUtils]: 0: Hoare triple {29777#true} ~cond := #in~cond; {29777#true} is VALID [2022-04-28 03:12:10,531 INFO L290 TraceCheckUtils]: 1: Hoare triple {29777#true} assume !(0 == ~cond); {29777#true} is VALID [2022-04-28 03:12:10,531 INFO L290 TraceCheckUtils]: 2: Hoare triple {29777#true} assume true; {29777#true} is VALID [2022-04-28 03:12:10,531 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29777#true} {29800#(<= 3 main_~j~0)} #124#return; {29800#(<= 3 main_~j~0)} is VALID [2022-04-28 03:12:10,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-04-28 03:12:10,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:12:10,534 INFO L290 TraceCheckUtils]: 0: Hoare triple {29777#true} ~cond := #in~cond; {29777#true} is VALID [2022-04-28 03:12:10,534 INFO L290 TraceCheckUtils]: 1: Hoare triple {29777#true} assume !(0 == ~cond); {29777#true} is VALID [2022-04-28 03:12:10,534 INFO L290 TraceCheckUtils]: 2: Hoare triple {29777#true} assume true; {29777#true} is VALID [2022-04-28 03:12:10,535 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29777#true} {29800#(<= 3 main_~j~0)} #126#return; {29800#(<= 3 main_~j~0)} is VALID [2022-04-28 03:12:10,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-04-28 03:12:10,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:12:10,542 INFO L290 TraceCheckUtils]: 0: Hoare triple {29777#true} ~cond := #in~cond; {29777#true} is VALID [2022-04-28 03:12:10,542 INFO L290 TraceCheckUtils]: 1: Hoare triple {29777#true} assume !(0 == ~cond); {29777#true} is VALID [2022-04-28 03:12:10,542 INFO L290 TraceCheckUtils]: 2: Hoare triple {29777#true} assume true; {29777#true} is VALID [2022-04-28 03:12:10,542 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29777#true} {29800#(<= 3 main_~j~0)} #128#return; {29800#(<= 3 main_~j~0)} is VALID [2022-04-28 03:12:10,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-04-28 03:12:10,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:12:10,545 INFO L290 TraceCheckUtils]: 0: Hoare triple {29777#true} ~cond := #in~cond; {29777#true} is VALID [2022-04-28 03:12:10,545 INFO L290 TraceCheckUtils]: 1: Hoare triple {29777#true} assume !(0 == ~cond); {29777#true} is VALID [2022-04-28 03:12:10,545 INFO L290 TraceCheckUtils]: 2: Hoare triple {29777#true} assume true; {29777#true} is VALID [2022-04-28 03:12:10,545 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29777#true} {29825#(<= 3 main_~i~0)} #118#return; {29825#(<= 3 main_~i~0)} is VALID [2022-04-28 03:12:10,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-04-28 03:12:10,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:12:10,547 INFO L290 TraceCheckUtils]: 0: Hoare triple {29777#true} ~cond := #in~cond; {29777#true} is VALID [2022-04-28 03:12:10,548 INFO L290 TraceCheckUtils]: 1: Hoare triple {29777#true} assume !(0 == ~cond); {29777#true} is VALID [2022-04-28 03:12:10,548 INFO L290 TraceCheckUtils]: 2: Hoare triple {29777#true} assume true; {29777#true} is VALID [2022-04-28 03:12:10,548 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29777#true} {29825#(<= 3 main_~i~0)} #120#return; {29825#(<= 3 main_~i~0)} is VALID [2022-04-28 03:12:10,548 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-28 03:12:10,549 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-28 03:12:10,549 INFO L290 TraceCheckUtils]: 2: Hoare triple {29777#true} assume true; {29777#true} is VALID [2022-04-28 03:12:10,549 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29777#true} {29777#true} #138#return; {29777#true} is VALID [2022-04-28 03:12:10,549 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-28 03:12:10,549 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-28 03:12:10,549 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-28 03:12:10,549 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-28 03:12:10,550 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-28 03:12:10,550 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-28 03:12:10,550 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-28 03:12:10,550 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-28 03:12:10,550 INFO L290 TraceCheckUtils]: 12: Hoare triple {29777#true} ~cond := #in~cond; {29777#true} is VALID [2022-04-28 03:12:10,550 INFO L290 TraceCheckUtils]: 13: Hoare triple {29777#true} assume !(0 == ~cond); {29777#true} is VALID [2022-04-28 03:12:10,551 INFO L290 TraceCheckUtils]: 14: Hoare triple {29777#true} assume true; {29777#true} is VALID [2022-04-28 03:12:10,551 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {29777#true} {29783#(<= 2 main_~j~0)} #110#return; {29783#(<= 2 main_~j~0)} is VALID [2022-04-28 03:12:10,551 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-28 03:12:10,551 INFO L290 TraceCheckUtils]: 17: Hoare triple {29777#true} ~cond := #in~cond; {29777#true} is VALID [2022-04-28 03:12:10,551 INFO L290 TraceCheckUtils]: 18: Hoare triple {29777#true} assume !(0 == ~cond); {29777#true} is VALID [2022-04-28 03:12:10,551 INFO L290 TraceCheckUtils]: 19: Hoare triple {29777#true} assume true; {29777#true} is VALID [2022-04-28 03:12:10,551 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {29777#true} {29783#(<= 2 main_~j~0)} #112#return; {29783#(<= 2 main_~j~0)} is VALID [2022-04-28 03:12:10,552 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-28 03:12:10,552 INFO L290 TraceCheckUtils]: 22: Hoare triple {29777#true} ~cond := #in~cond; {29777#true} is VALID [2022-04-28 03:12:10,552 INFO L290 TraceCheckUtils]: 23: Hoare triple {29777#true} assume !(0 == ~cond); {29777#true} is VALID [2022-04-28 03:12:10,552 INFO L290 TraceCheckUtils]: 24: Hoare triple {29777#true} assume true; {29777#true} is VALID [2022-04-28 03:12:10,552 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {29777#true} {29783#(<= 2 main_~j~0)} #114#return; {29783#(<= 2 main_~j~0)} is VALID [2022-04-28 03:12:10,552 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-28 03:12:10,552 INFO L290 TraceCheckUtils]: 27: Hoare triple {29777#true} ~cond := #in~cond; {29777#true} is VALID [2022-04-28 03:12:10,552 INFO L290 TraceCheckUtils]: 28: Hoare triple {29777#true} assume !(0 == ~cond); {29777#true} is VALID [2022-04-28 03:12:10,552 INFO L290 TraceCheckUtils]: 29: Hoare triple {29777#true} assume true; {29777#true} is VALID [2022-04-28 03:12:10,553 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {29777#true} {29783#(<= 2 main_~j~0)} #116#return; {29783#(<= 2 main_~j~0)} is VALID [2022-04-28 03:12:10,553 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-28 03:12:10,553 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-28 03:12:10,553 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-28 03:12:10,554 INFO L290 TraceCheckUtils]: 34: Hoare triple {29777#true} ~cond := #in~cond; {29777#true} is VALID [2022-04-28 03:12:10,554 INFO L290 TraceCheckUtils]: 35: Hoare triple {29777#true} assume !(0 == ~cond); {29777#true} is VALID [2022-04-28 03:12:10,554 INFO L290 TraceCheckUtils]: 36: Hoare triple {29777#true} assume true; {29777#true} is VALID [2022-04-28 03:12:10,554 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {29777#true} {29800#(<= 3 main_~j~0)} #118#return; {29800#(<= 3 main_~j~0)} is VALID [2022-04-28 03:12:10,554 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-28 03:12:10,554 INFO L290 TraceCheckUtils]: 39: Hoare triple {29777#true} ~cond := #in~cond; {29777#true} is VALID [2022-04-28 03:12:10,554 INFO L290 TraceCheckUtils]: 40: Hoare triple {29777#true} assume !(0 == ~cond); {29777#true} is VALID [2022-04-28 03:12:10,554 INFO L290 TraceCheckUtils]: 41: Hoare triple {29777#true} assume true; {29777#true} is VALID [2022-04-28 03:12:10,555 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {29777#true} {29800#(<= 3 main_~j~0)} #120#return; {29800#(<= 3 main_~j~0)} is VALID [2022-04-28 03:12:10,555 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-28 03:12:10,555 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-28 03:12:10,555 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-28 03:12:10,555 INFO L290 TraceCheckUtils]: 46: Hoare triple {29777#true} ~cond := #in~cond; {29777#true} is VALID [2022-04-28 03:12:10,555 INFO L290 TraceCheckUtils]: 47: Hoare triple {29777#true} assume !(0 == ~cond); {29777#true} is VALID [2022-04-28 03:12:10,555 INFO L290 TraceCheckUtils]: 48: Hoare triple {29777#true} assume true; {29777#true} is VALID [2022-04-28 03:12:10,556 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {29777#true} {29800#(<= 3 main_~j~0)} #122#return; {29800#(<= 3 main_~j~0)} is VALID [2022-04-28 03:12:10,556 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-28 03:12:10,558 INFO L290 TraceCheckUtils]: 51: Hoare triple {29777#true} ~cond := #in~cond; {29777#true} is VALID [2022-04-28 03:12:10,558 INFO L290 TraceCheckUtils]: 52: Hoare triple {29777#true} assume !(0 == ~cond); {29777#true} is VALID [2022-04-28 03:12:10,558 INFO L290 TraceCheckUtils]: 53: Hoare triple {29777#true} assume true; {29777#true} is VALID [2022-04-28 03:12:10,559 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {29777#true} {29800#(<= 3 main_~j~0)} #124#return; {29800#(<= 3 main_~j~0)} is VALID [2022-04-28 03:12:10,559 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-28 03:12:10,559 INFO L290 TraceCheckUtils]: 56: Hoare triple {29777#true} ~cond := #in~cond; {29777#true} is VALID [2022-04-28 03:12:10,559 INFO L290 TraceCheckUtils]: 57: Hoare triple {29777#true} assume !(0 == ~cond); {29777#true} is VALID [2022-04-28 03:12:10,559 INFO L290 TraceCheckUtils]: 58: Hoare triple {29777#true} assume true; {29777#true} is VALID [2022-04-28 03:12:10,559 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {29777#true} {29800#(<= 3 main_~j~0)} #126#return; {29800#(<= 3 main_~j~0)} is VALID [2022-04-28 03:12:10,560 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-28 03:12:10,560 INFO L290 TraceCheckUtils]: 61: Hoare triple {29777#true} ~cond := #in~cond; {29777#true} is VALID [2022-04-28 03:12:10,560 INFO L290 TraceCheckUtils]: 62: Hoare triple {29777#true} assume !(0 == ~cond); {29777#true} is VALID [2022-04-28 03:12:10,560 INFO L290 TraceCheckUtils]: 63: Hoare triple {29777#true} assume true; {29777#true} is VALID [2022-04-28 03:12:10,560 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {29777#true} {29800#(<= 3 main_~j~0)} #128#return; {29800#(<= 3 main_~j~0)} is VALID [2022-04-28 03:12:10,561 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-28 03:12:10,561 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-28 03:12:10,561 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-28 03:12:10,561 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-28 03:12:10,561 INFO L290 TraceCheckUtils]: 69: Hoare triple {29777#true} ~cond := #in~cond; {29777#true} is VALID [2022-04-28 03:12:10,561 INFO L290 TraceCheckUtils]: 70: Hoare triple {29777#true} assume !(0 == ~cond); {29777#true} is VALID [2022-04-28 03:12:10,561 INFO L290 TraceCheckUtils]: 71: Hoare triple {29777#true} assume true; {29777#true} is VALID [2022-04-28 03:12:10,562 INFO L284 TraceCheckUtils]: 72: Hoare quadruple {29777#true} {29825#(<= 3 main_~i~0)} #118#return; {29825#(<= 3 main_~i~0)} is VALID [2022-04-28 03:12:10,562 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-28 03:12:10,562 INFO L290 TraceCheckUtils]: 74: Hoare triple {29777#true} ~cond := #in~cond; {29777#true} is VALID [2022-04-28 03:12:10,562 INFO L290 TraceCheckUtils]: 75: Hoare triple {29777#true} assume !(0 == ~cond); {29777#true} is VALID [2022-04-28 03:12:10,562 INFO L290 TraceCheckUtils]: 76: Hoare triple {29777#true} assume true; {29777#true} is VALID [2022-04-28 03:12:10,563 INFO L284 TraceCheckUtils]: 77: Hoare quadruple {29777#true} {29825#(<= 3 main_~i~0)} #120#return; {29825#(<= 3 main_~i~0)} is VALID [2022-04-28 03:12:10,563 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-28 03:12:10,563 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-28 03:12:10,563 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-28 03:12:10,564 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-28 03:12:10,564 INFO L290 TraceCheckUtils]: 82: Hoare triple {29835#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {29778#false} is VALID [2022-04-28 03:12:10,564 INFO L290 TraceCheckUtils]: 83: Hoare triple {29778#false} assume !false; {29778#false} is VALID [2022-04-28 03:12:10,564 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-28 03:12:10,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:12:10,565 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [464070593] [2022-04-28 03:12:10,565 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [464070593] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:12:10,565 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [993179746] [2022-04-28 03:12:10,565 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 03:12:10,565 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:12:10,565 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:12:10,566 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-28 03:12:10,567 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-28 03:12:10,617 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 03:12:10,617 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 03:12:10,618 INFO L263 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-28 03:12:10,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:12:10,630 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:12:13,781 INFO L272 TraceCheckUtils]: 0: Hoare triple {29777#true} call ULTIMATE.init(); {29777#true} is VALID [2022-04-28 03:12:13,782 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-28 03:12:13,782 INFO L290 TraceCheckUtils]: 2: Hoare triple {29777#true} assume true; {29777#true} is VALID [2022-04-28 03:12:13,782 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29777#true} {29777#true} #138#return; {29777#true} is VALID [2022-04-28 03:12:13,782 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-28 03:12:13,782 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-28 03:12:13,783 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-28 03:12:13,783 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-28 03:12:13,784 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-28 03:12:13,784 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-28 03:12:13,785 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-28 03:12:13,785 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-28 03:12:13,786 INFO L290 TraceCheckUtils]: 12: Hoare triple {29777#true} ~cond := #in~cond; {29777#true} is VALID [2022-04-28 03:12:13,786 INFO L290 TraceCheckUtils]: 13: Hoare triple {29777#true} assume !(0 == ~cond); {29777#true} is VALID [2022-04-28 03:12:13,786 INFO L290 TraceCheckUtils]: 14: Hoare triple {29777#true} assume true; {29777#true} is VALID [2022-04-28 03:12:13,786 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-28 03:12:13,786 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-28 03:12:13,786 INFO L290 TraceCheckUtils]: 17: Hoare triple {29777#true} ~cond := #in~cond; {29777#true} is VALID [2022-04-28 03:12:13,786 INFO L290 TraceCheckUtils]: 18: Hoare triple {29777#true} assume !(0 == ~cond); {29777#true} is VALID [2022-04-28 03:12:13,787 INFO L290 TraceCheckUtils]: 19: Hoare triple {29777#true} assume true; {29777#true} is VALID [2022-04-28 03:12:13,795 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-28 03:12:13,796 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-28 03:12:13,796 INFO L290 TraceCheckUtils]: 22: Hoare triple {29777#true} ~cond := #in~cond; {29777#true} is VALID [2022-04-28 03:12:13,796 INFO L290 TraceCheckUtils]: 23: Hoare triple {29777#true} assume !(0 == ~cond); {29777#true} is VALID [2022-04-28 03:12:13,796 INFO L290 TraceCheckUtils]: 24: Hoare triple {29777#true} assume true; {29777#true} is VALID [2022-04-28 03:12:13,796 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-28 03:12:13,797 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-28 03:12:13,797 INFO L290 TraceCheckUtils]: 27: Hoare triple {29777#true} ~cond := #in~cond; {29777#true} is VALID [2022-04-28 03:12:13,797 INFO L290 TraceCheckUtils]: 28: Hoare triple {29777#true} assume !(0 == ~cond); {29777#true} is VALID [2022-04-28 03:12:13,797 INFO L290 TraceCheckUtils]: 29: Hoare triple {29777#true} assume true; {29777#true} is VALID [2022-04-28 03:12:13,797 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-28 03:12:13,798 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-28 03:12:13,799 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-28 03:12:13,799 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-28 03:12:13,799 INFO L290 TraceCheckUtils]: 34: Hoare triple {29777#true} ~cond := #in~cond; {29777#true} is VALID [2022-04-28 03:12:13,799 INFO L290 TraceCheckUtils]: 35: Hoare triple {29777#true} assume !(0 == ~cond); {29777#true} is VALID [2022-04-28 03:12:13,799 INFO L290 TraceCheckUtils]: 36: Hoare triple {29777#true} assume true; {29777#true} is VALID [2022-04-28 03:12:13,800 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-28 03:12:13,800 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-28 03:12:13,800 INFO L290 TraceCheckUtils]: 39: Hoare triple {29777#true} ~cond := #in~cond; {29777#true} is VALID [2022-04-28 03:12:13,800 INFO L290 TraceCheckUtils]: 40: Hoare triple {29777#true} assume !(0 == ~cond); {29777#true} is VALID [2022-04-28 03:12:13,800 INFO L290 TraceCheckUtils]: 41: Hoare triple {29777#true} assume true; {29777#true} is VALID [2022-04-28 03:12:13,801 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-28 03:12:13,801 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-28 03:12:13,801 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-28 03:12:13,801 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-28 03:12:13,802 INFO L290 TraceCheckUtils]: 46: Hoare triple {29777#true} ~cond := #in~cond; {29777#true} is VALID [2022-04-28 03:12:13,802 INFO L290 TraceCheckUtils]: 47: Hoare triple {29777#true} assume !(0 == ~cond); {29777#true} is VALID [2022-04-28 03:12:13,802 INFO L290 TraceCheckUtils]: 48: Hoare triple {29777#true} assume true; {29777#true} is VALID [2022-04-28 03:12:13,802 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-28 03:12:13,802 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-28 03:12:13,802 INFO L290 TraceCheckUtils]: 51: Hoare triple {29777#true} ~cond := #in~cond; {29777#true} is VALID [2022-04-28 03:12:13,802 INFO L290 TraceCheckUtils]: 52: Hoare triple {29777#true} assume !(0 == ~cond); {29777#true} is VALID [2022-04-28 03:12:13,802 INFO L290 TraceCheckUtils]: 53: Hoare triple {29777#true} assume true; {29777#true} is VALID [2022-04-28 03:12:13,803 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-28 03:12:13,803 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-28 03:12:13,803 INFO L290 TraceCheckUtils]: 56: Hoare triple {29777#true} ~cond := #in~cond; {29777#true} is VALID [2022-04-28 03:12:13,803 INFO L290 TraceCheckUtils]: 57: Hoare triple {29777#true} assume !(0 == ~cond); {29777#true} is VALID [2022-04-28 03:12:13,803 INFO L290 TraceCheckUtils]: 58: Hoare triple {29777#true} assume true; {29777#true} is VALID [2022-04-28 03:12:13,804 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-28 03:12:13,804 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-28 03:12:13,804 INFO L290 TraceCheckUtils]: 61: Hoare triple {29777#true} ~cond := #in~cond; {29777#true} is VALID [2022-04-28 03:12:13,804 INFO L290 TraceCheckUtils]: 62: Hoare triple {29777#true} assume !(0 == ~cond); {29777#true} is VALID [2022-04-28 03:12:13,804 INFO L290 TraceCheckUtils]: 63: Hoare triple {29777#true} assume true; {29777#true} is VALID [2022-04-28 03:12:13,805 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-28 03:12:13,805 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-28 03:12:13,806 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-28 03:12:13,806 INFO L290 TraceCheckUtils]: 67: Hoare triple {29778#false} assume !(~j~0 < ~r~0); {29778#false} is VALID [2022-04-28 03:12:13,806 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-28 03:12:13,806 INFO L290 TraceCheckUtils]: 69: Hoare triple {29778#false} ~cond := #in~cond; {29778#false} is VALID [2022-04-28 03:12:13,806 INFO L290 TraceCheckUtils]: 70: Hoare triple {29778#false} assume !(0 == ~cond); {29778#false} is VALID [2022-04-28 03:12:13,806 INFO L290 TraceCheckUtils]: 71: Hoare triple {29778#false} assume true; {29778#false} is VALID [2022-04-28 03:12:13,806 INFO L284 TraceCheckUtils]: 72: Hoare quadruple {29778#false} {29778#false} #118#return; {29778#false} is VALID [2022-04-28 03:12:13,806 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-28 03:12:13,806 INFO L290 TraceCheckUtils]: 74: Hoare triple {29778#false} ~cond := #in~cond; {29778#false} is VALID [2022-04-28 03:12:13,806 INFO L290 TraceCheckUtils]: 75: Hoare triple {29778#false} assume !(0 == ~cond); {29778#false} is VALID [2022-04-28 03:12:13,807 INFO L290 TraceCheckUtils]: 76: Hoare triple {29778#false} assume true; {29778#false} is VALID [2022-04-28 03:12:13,807 INFO L284 TraceCheckUtils]: 77: Hoare quadruple {29778#false} {29778#false} #120#return; {29778#false} is VALID [2022-04-28 03:12:13,807 INFO L290 TraceCheckUtils]: 78: Hoare triple {29778#false} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {29778#false} is VALID [2022-04-28 03:12:13,807 INFO L290 TraceCheckUtils]: 79: Hoare triple {29778#false} assume !(0 != #t~nondet5);havoc #t~nondet5; {29778#false} is VALID [2022-04-28 03:12:13,807 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-28 03:12:13,807 INFO L290 TraceCheckUtils]: 81: Hoare triple {29778#false} ~cond := #in~cond; {29778#false} is VALID [2022-04-28 03:12:13,807 INFO L290 TraceCheckUtils]: 82: Hoare triple {29778#false} assume 0 == ~cond; {29778#false} is VALID [2022-04-28 03:12:13,807 INFO L290 TraceCheckUtils]: 83: Hoare triple {29778#false} assume !false; {29778#false} is VALID [2022-04-28 03:12:13,807 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-28 03:12:13,808 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 03:12:13,808 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [993179746] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:12:13,808 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-28 03:12:13,808 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [9] total 14 [2022-04-28 03:12:13,808 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:12:13,808 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1244500150] [2022-04-28 03:12:13,808 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1244500150] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:12:13,808 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:12:13,808 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 03:12:13,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1513860838] [2022-04-28 03:12:13,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:12:13,809 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-28 03:12:13,809 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:12:13,809 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-28 03:12:13,847 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-28 03:12:13,847 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-28 03:12:13,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:12:13,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-28 03:12:13,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2022-04-28 03:12:13,848 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-28 03:12:16,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:12:16,718 INFO L93 Difference]: Finished difference Result 714 states and 1123 transitions. [2022-04-28 03:12:16,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-28 03:12:16,719 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-28 03:12:16,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:12:16,719 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-28 03:12:16,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 224 transitions. [2022-04-28 03:12:16,721 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-28 03:12:16,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 224 transitions. [2022-04-28 03:12:16,723 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 224 transitions. [2022-04-28 03:12:16,887 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-28 03:12:16,900 INFO L225 Difference]: With dead ends: 714 [2022-04-28 03:12:16,901 INFO L226 Difference]: Without dead ends: 329 [2022-04-28 03:12:16,902 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=87, Invalid=255, Unknown=0, NotChecked=0, Total=342 [2022-04-28 03:12:16,902 INFO L413 NwaCegarLoop]: 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-28 03:12:16,903 INFO L414 NwaCegarLoop]: 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-28 03:12:16,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2022-04-28 03:12:18,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 295. [2022-04-28 03:12:18,464 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:12:18,464 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-28 03:12:18,464 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-28 03:12:18,465 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-28 03:12:18,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:12:18,471 INFO L93 Difference]: Finished difference Result 329 states and 504 transitions. [2022-04-28 03:12:18,471 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 504 transitions. [2022-04-28 03:12:18,472 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:12:18,472 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:12:18,472 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-28 03:12:18,473 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-28 03:12:18,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:12:18,479 INFO L93 Difference]: Finished difference Result 329 states and 504 transitions. [2022-04-28 03:12:18,479 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 504 transitions. [2022-04-28 03:12:18,480 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:12:18,480 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:12:18,480 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:12:18,480 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:12:18,480 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-28 03:12:18,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 454 transitions. [2022-04-28 03:12:18,487 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 454 transitions. Word has length 84 [2022-04-28 03:12:18,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:12:18,487 INFO L495 AbstractCegarLoop]: Abstraction has 295 states and 454 transitions. [2022-04-28 03:12:18,488 INFO L496 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-28 03:12:18,488 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 295 states and 454 transitions. [2022-04-28 03:12:19,171 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-28 03:12:19,171 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 454 transitions. [2022-04-28 03:12:19,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-04-28 03:12:19,172 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:12:19,172 INFO L195 NwaCegarLoop]: 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-28 03:12:19,190 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-28 03:12:19,372 WARN L477 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-28 03:12:19,373 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:12:19,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:12:19,373 INFO L85 PathProgramCache]: Analyzing trace with hash -898087182, now seen corresponding path program 1 times [2022-04-28 03:12:19,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:12:19,373 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1952753806] [2022-04-28 03:12:19,689 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 03:12:19,689 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because UNSUPPORTED_EIGENVALUES [2022-04-28 03:12:19,689 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 03:12:19,690 INFO L85 PathProgramCache]: Analyzing trace with hash -898087182, now seen corresponding path program 2 times [2022-04-28 03:12:19,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:12:19,690 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [957252385] [2022-04-28 03:12:19,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:12:19,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:12:19,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:12:19,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:12:19,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:12:19,742 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-28 03:12:19,742 INFO L290 TraceCheckUtils]: 1: Hoare triple {32779#true} assume true; {32779#true} is VALID [2022-04-28 03:12:19,742 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {32779#true} {32779#true} #138#return; {32779#true} is VALID [2022-04-28 03:12:19,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-28 03:12:19,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:12:19,746 INFO L290 TraceCheckUtils]: 0: Hoare triple {32779#true} ~cond := #in~cond; {32779#true} is VALID [2022-04-28 03:12:19,746 INFO L290 TraceCheckUtils]: 1: Hoare triple {32779#true} assume !(0 == ~cond); {32779#true} is VALID [2022-04-28 03:12:19,746 INFO L290 TraceCheckUtils]: 2: Hoare triple {32779#true} assume true; {32779#true} is VALID [2022-04-28 03:12:19,746 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32779#true} {32785#(<= 2 main_~j~0)} #110#return; {32785#(<= 2 main_~j~0)} is VALID [2022-04-28 03:12:19,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-04-28 03:12:19,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:12:19,748 INFO L290 TraceCheckUtils]: 0: Hoare triple {32779#true} ~cond := #in~cond; {32779#true} is VALID [2022-04-28 03:12:19,748 INFO L290 TraceCheckUtils]: 1: Hoare triple {32779#true} assume !(0 == ~cond); {32779#true} is VALID [2022-04-28 03:12:19,748 INFO L290 TraceCheckUtils]: 2: Hoare triple {32779#true} assume true; {32779#true} is VALID [2022-04-28 03:12:19,749 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32779#true} {32785#(<= 2 main_~j~0)} #112#return; {32785#(<= 2 main_~j~0)} is VALID [2022-04-28 03:12:19,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-04-28 03:12:19,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:12:19,751 INFO L290 TraceCheckUtils]: 0: Hoare triple {32779#true} ~cond := #in~cond; {32779#true} is VALID [2022-04-28 03:12:19,751 INFO L290 TraceCheckUtils]: 1: Hoare triple {32779#true} assume !(0 == ~cond); {32779#true} is VALID [2022-04-28 03:12:19,752 INFO L290 TraceCheckUtils]: 2: Hoare triple {32779#true} assume true; {32779#true} is VALID [2022-04-28 03:12:19,752 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32779#true} {32785#(<= 2 main_~j~0)} #114#return; {32785#(<= 2 main_~j~0)} is VALID [2022-04-28 03:12:19,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-04-28 03:12:19,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:12:19,754 INFO L290 TraceCheckUtils]: 0: Hoare triple {32779#true} ~cond := #in~cond; {32779#true} is VALID [2022-04-28 03:12:19,754 INFO L290 TraceCheckUtils]: 1: Hoare triple {32779#true} assume !(0 == ~cond); {32779#true} is VALID [2022-04-28 03:12:19,754 INFO L290 TraceCheckUtils]: 2: Hoare triple {32779#true} assume true; {32779#true} is VALID [2022-04-28 03:12:19,754 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32779#true} {32785#(<= 2 main_~j~0)} #116#return; {32785#(<= 2 main_~j~0)} is VALID [2022-04-28 03:12:19,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-04-28 03:12:19,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:12:19,756 INFO L290 TraceCheckUtils]: 0: Hoare triple {32779#true} ~cond := #in~cond; {32779#true} is VALID [2022-04-28 03:12:19,756 INFO L290 TraceCheckUtils]: 1: Hoare triple {32779#true} assume !(0 == ~cond); {32779#true} is VALID [2022-04-28 03:12:19,756 INFO L290 TraceCheckUtils]: 2: Hoare triple {32779#true} assume true; {32779#true} is VALID [2022-04-28 03:12:19,757 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32779#true} {32785#(<= 2 main_~j~0)} #118#return; {32785#(<= 2 main_~j~0)} is VALID [2022-04-28 03:12:19,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-04-28 03:12:19,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:12:19,759 INFO L290 TraceCheckUtils]: 0: Hoare triple {32779#true} ~cond := #in~cond; {32779#true} is VALID [2022-04-28 03:12:19,759 INFO L290 TraceCheckUtils]: 1: Hoare triple {32779#true} assume !(0 == ~cond); {32779#true} is VALID [2022-04-28 03:12:19,759 INFO L290 TraceCheckUtils]: 2: Hoare triple {32779#true} assume true; {32779#true} is VALID [2022-04-28 03:12:19,759 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32779#true} {32785#(<= 2 main_~j~0)} #120#return; {32785#(<= 2 main_~j~0)} is VALID [2022-04-28 03:12:19,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-04-28 03:12:19,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:12:19,761 INFO L290 TraceCheckUtils]: 0: Hoare triple {32779#true} ~cond := #in~cond; {32779#true} is VALID [2022-04-28 03:12:19,761 INFO L290 TraceCheckUtils]: 1: Hoare triple {32779#true} assume !(0 == ~cond); {32779#true} is VALID [2022-04-28 03:12:19,761 INFO L290 TraceCheckUtils]: 2: Hoare triple {32779#true} assume true; {32779#true} is VALID [2022-04-28 03:12:19,762 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32779#true} {32785#(<= 2 main_~j~0)} #122#return; {32785#(<= 2 main_~j~0)} is VALID [2022-04-28 03:12:19,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-04-28 03:12:19,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:12:19,764 INFO L290 TraceCheckUtils]: 0: Hoare triple {32779#true} ~cond := #in~cond; {32779#true} is VALID [2022-04-28 03:12:19,764 INFO L290 TraceCheckUtils]: 1: Hoare triple {32779#true} assume !(0 == ~cond); {32779#true} is VALID [2022-04-28 03:12:19,764 INFO L290 TraceCheckUtils]: 2: Hoare triple {32779#true} assume true; {32779#true} is VALID [2022-04-28 03:12:19,764 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32779#true} {32785#(<= 2 main_~j~0)} #124#return; {32785#(<= 2 main_~j~0)} is VALID [2022-04-28 03:12:19,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-04-28 03:12:19,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:12:19,766 INFO L290 TraceCheckUtils]: 0: Hoare triple {32779#true} ~cond := #in~cond; {32779#true} is VALID [2022-04-28 03:12:19,766 INFO L290 TraceCheckUtils]: 1: Hoare triple {32779#true} assume !(0 == ~cond); {32779#true} is VALID [2022-04-28 03:12:19,766 INFO L290 TraceCheckUtils]: 2: Hoare triple {32779#true} assume true; {32779#true} is VALID [2022-04-28 03:12:19,767 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32779#true} {32785#(<= 2 main_~j~0)} #126#return; {32785#(<= 2 main_~j~0)} is VALID [2022-04-28 03:12:19,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-04-28 03:12:19,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:12:19,769 INFO L290 TraceCheckUtils]: 0: Hoare triple {32779#true} ~cond := #in~cond; {32779#true} is VALID [2022-04-28 03:12:19,769 INFO L290 TraceCheckUtils]: 1: Hoare triple {32779#true} assume !(0 == ~cond); {32779#true} is VALID [2022-04-28 03:12:19,769 INFO L290 TraceCheckUtils]: 2: Hoare triple {32779#true} assume true; {32779#true} is VALID [2022-04-28 03:12:19,769 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32779#true} {32785#(<= 2 main_~j~0)} #128#return; {32785#(<= 2 main_~j~0)} is VALID [2022-04-28 03:12:19,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-04-28 03:12:19,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:12:19,771 INFO L290 TraceCheckUtils]: 0: Hoare triple {32779#true} ~cond := #in~cond; {32779#true} is VALID [2022-04-28 03:12:19,771 INFO L290 TraceCheckUtils]: 1: Hoare triple {32779#true} assume !(0 == ~cond); {32779#true} is VALID [2022-04-28 03:12:19,772 INFO L290 TraceCheckUtils]: 2: Hoare triple {32779#true} assume true; {32779#true} is VALID [2022-04-28 03:12:19,772 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32779#true} {32826#(<= 2 main_~i~0)} #118#return; {32826#(<= 2 main_~i~0)} is VALID [2022-04-28 03:12:19,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-04-28 03:12:19,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:12:19,774 INFO L290 TraceCheckUtils]: 0: Hoare triple {32779#true} ~cond := #in~cond; {32779#true} is VALID [2022-04-28 03:12:19,774 INFO L290 TraceCheckUtils]: 1: Hoare triple {32779#true} assume !(0 == ~cond); {32779#true} is VALID [2022-04-28 03:12:19,774 INFO L290 TraceCheckUtils]: 2: Hoare triple {32779#true} assume true; {32779#true} is VALID [2022-04-28 03:12:19,774 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32779#true} {32826#(<= 2 main_~i~0)} #120#return; {32826#(<= 2 main_~i~0)} is VALID [2022-04-28 03:12:19,775 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-28 03:12:19,775 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-28 03:12:19,775 INFO L290 TraceCheckUtils]: 2: Hoare triple {32779#true} assume true; {32779#true} is VALID [2022-04-28 03:12:19,775 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32779#true} {32779#true} #138#return; {32779#true} is VALID [2022-04-28 03:12:19,775 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-28 03:12:19,775 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-28 03:12:19,775 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-28 03:12:19,776 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-28 03:12:19,776 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-28 03:12:19,776 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-28 03:12:19,777 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-28 03:12:19,777 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-28 03:12:19,777 INFO L290 TraceCheckUtils]: 12: Hoare triple {32779#true} ~cond := #in~cond; {32779#true} is VALID [2022-04-28 03:12:19,777 INFO L290 TraceCheckUtils]: 13: Hoare triple {32779#true} assume !(0 == ~cond); {32779#true} is VALID [2022-04-28 03:12:19,777 INFO L290 TraceCheckUtils]: 14: Hoare triple {32779#true} assume true; {32779#true} is VALID [2022-04-28 03:12:19,777 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {32779#true} {32785#(<= 2 main_~j~0)} #110#return; {32785#(<= 2 main_~j~0)} is VALID [2022-04-28 03:12:19,777 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-28 03:12:19,777 INFO L290 TraceCheckUtils]: 17: Hoare triple {32779#true} ~cond := #in~cond; {32779#true} is VALID [2022-04-28 03:12:19,777 INFO L290 TraceCheckUtils]: 18: Hoare triple {32779#true} assume !(0 == ~cond); {32779#true} is VALID [2022-04-28 03:12:19,777 INFO L290 TraceCheckUtils]: 19: Hoare triple {32779#true} assume true; {32779#true} is VALID [2022-04-28 03:12:19,778 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {32779#true} {32785#(<= 2 main_~j~0)} #112#return; {32785#(<= 2 main_~j~0)} is VALID [2022-04-28 03:12:19,778 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-28 03:12:19,778 INFO L290 TraceCheckUtils]: 22: Hoare triple {32779#true} ~cond := #in~cond; {32779#true} is VALID [2022-04-28 03:12:19,778 INFO L290 TraceCheckUtils]: 23: Hoare triple {32779#true} assume !(0 == ~cond); {32779#true} is VALID [2022-04-28 03:12:19,778 INFO L290 TraceCheckUtils]: 24: Hoare triple {32779#true} assume true; {32779#true} is VALID [2022-04-28 03:12:19,778 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {32779#true} {32785#(<= 2 main_~j~0)} #114#return; {32785#(<= 2 main_~j~0)} is VALID [2022-04-28 03:12:19,778 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-28 03:12:19,779 INFO L290 TraceCheckUtils]: 27: Hoare triple {32779#true} ~cond := #in~cond; {32779#true} is VALID [2022-04-28 03:12:19,779 INFO L290 TraceCheckUtils]: 28: Hoare triple {32779#true} assume !(0 == ~cond); {32779#true} is VALID [2022-04-28 03:12:19,779 INFO L290 TraceCheckUtils]: 29: Hoare triple {32779#true} assume true; {32779#true} is VALID [2022-04-28 03:12:19,779 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {32779#true} {32785#(<= 2 main_~j~0)} #116#return; {32785#(<= 2 main_~j~0)} is VALID [2022-04-28 03:12:19,779 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-28 03:12:19,780 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-28 03:12:19,780 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-28 03:12:19,780 INFO L290 TraceCheckUtils]: 34: Hoare triple {32779#true} ~cond := #in~cond; {32779#true} is VALID [2022-04-28 03:12:19,780 INFO L290 TraceCheckUtils]: 35: Hoare triple {32779#true} assume !(0 == ~cond); {32779#true} is VALID [2022-04-28 03:12:19,780 INFO L290 TraceCheckUtils]: 36: Hoare triple {32779#true} assume true; {32779#true} is VALID [2022-04-28 03:12:19,780 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {32779#true} {32785#(<= 2 main_~j~0)} #118#return; {32785#(<= 2 main_~j~0)} is VALID [2022-04-28 03:12:19,780 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-28 03:12:19,780 INFO L290 TraceCheckUtils]: 39: Hoare triple {32779#true} ~cond := #in~cond; {32779#true} is VALID [2022-04-28 03:12:19,780 INFO L290 TraceCheckUtils]: 40: Hoare triple {32779#true} assume !(0 == ~cond); {32779#true} is VALID [2022-04-28 03:12:19,781 INFO L290 TraceCheckUtils]: 41: Hoare triple {32779#true} assume true; {32779#true} is VALID [2022-04-28 03:12:19,781 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {32779#true} {32785#(<= 2 main_~j~0)} #120#return; {32785#(<= 2 main_~j~0)} is VALID [2022-04-28 03:12:19,781 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-28 03:12:19,781 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-28 03:12:19,781 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-28 03:12:19,781 INFO L290 TraceCheckUtils]: 46: Hoare triple {32779#true} ~cond := #in~cond; {32779#true} is VALID [2022-04-28 03:12:19,782 INFO L290 TraceCheckUtils]: 47: Hoare triple {32779#true} assume !(0 == ~cond); {32779#true} is VALID [2022-04-28 03:12:19,782 INFO L290 TraceCheckUtils]: 48: Hoare triple {32779#true} assume true; {32779#true} is VALID [2022-04-28 03:12:19,782 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {32779#true} {32785#(<= 2 main_~j~0)} #122#return; {32785#(<= 2 main_~j~0)} is VALID [2022-04-28 03:12:19,782 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-28 03:12:19,782 INFO L290 TraceCheckUtils]: 51: Hoare triple {32779#true} ~cond := #in~cond; {32779#true} is VALID [2022-04-28 03:12:19,782 INFO L290 TraceCheckUtils]: 52: Hoare triple {32779#true} assume !(0 == ~cond); {32779#true} is VALID [2022-04-28 03:12:19,782 INFO L290 TraceCheckUtils]: 53: Hoare triple {32779#true} assume true; {32779#true} is VALID [2022-04-28 03:12:19,783 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {32779#true} {32785#(<= 2 main_~j~0)} #124#return; {32785#(<= 2 main_~j~0)} is VALID [2022-04-28 03:12:19,783 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-28 03:12:19,783 INFO L290 TraceCheckUtils]: 56: Hoare triple {32779#true} ~cond := #in~cond; {32779#true} is VALID [2022-04-28 03:12:19,783 INFO L290 TraceCheckUtils]: 57: Hoare triple {32779#true} assume !(0 == ~cond); {32779#true} is VALID [2022-04-28 03:12:19,783 INFO L290 TraceCheckUtils]: 58: Hoare triple {32779#true} assume true; {32779#true} is VALID [2022-04-28 03:12:19,783 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {32779#true} {32785#(<= 2 main_~j~0)} #126#return; {32785#(<= 2 main_~j~0)} is VALID [2022-04-28 03:12:19,783 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-28 03:12:19,783 INFO L290 TraceCheckUtils]: 61: Hoare triple {32779#true} ~cond := #in~cond; {32779#true} is VALID [2022-04-28 03:12:19,783 INFO L290 TraceCheckUtils]: 62: Hoare triple {32779#true} assume !(0 == ~cond); {32779#true} is VALID [2022-04-28 03:12:19,784 INFO L290 TraceCheckUtils]: 63: Hoare triple {32779#true} assume true; {32779#true} is VALID [2022-04-28 03:12:19,784 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {32779#true} {32785#(<= 2 main_~j~0)} #128#return; {32785#(<= 2 main_~j~0)} is VALID [2022-04-28 03:12:19,784 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-28 03:12:19,784 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-28 03:12:19,785 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-28 03:12:19,785 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-28 03:12:19,785 INFO L290 TraceCheckUtils]: 69: Hoare triple {32779#true} ~cond := #in~cond; {32779#true} is VALID [2022-04-28 03:12:19,785 INFO L290 TraceCheckUtils]: 70: Hoare triple {32779#true} assume !(0 == ~cond); {32779#true} is VALID [2022-04-28 03:12:19,785 INFO L290 TraceCheckUtils]: 71: Hoare triple {32779#true} assume true; {32779#true} is VALID [2022-04-28 03:12:19,785 INFO L284 TraceCheckUtils]: 72: Hoare quadruple {32779#true} {32826#(<= 2 main_~i~0)} #118#return; {32826#(<= 2 main_~i~0)} is VALID [2022-04-28 03:12:19,785 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-28 03:12:19,785 INFO L290 TraceCheckUtils]: 74: Hoare triple {32779#true} ~cond := #in~cond; {32779#true} is VALID [2022-04-28 03:12:19,785 INFO L290 TraceCheckUtils]: 75: Hoare triple {32779#true} assume !(0 == ~cond); {32779#true} is VALID [2022-04-28 03:12:19,786 INFO L290 TraceCheckUtils]: 76: Hoare triple {32779#true} assume true; {32779#true} is VALID [2022-04-28 03:12:19,786 INFO L284 TraceCheckUtils]: 77: Hoare quadruple {32779#true} {32826#(<= 2 main_~i~0)} #120#return; {32826#(<= 2 main_~i~0)} is VALID [2022-04-28 03:12:19,786 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-28 03:12:19,786 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-28 03:12:19,787 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-28 03:12:19,787 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-28 03:12:19,787 INFO L290 TraceCheckUtils]: 82: Hoare triple {32836#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {32780#false} is VALID [2022-04-28 03:12:19,787 INFO L290 TraceCheckUtils]: 83: Hoare triple {32780#false} assume !false; {32780#false} is VALID [2022-04-28 03:12:19,788 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-28 03:12:19,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:12:19,788 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [957252385] [2022-04-28 03:12:19,788 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [957252385] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:12:19,788 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2065672911] [2022-04-28 03:12:19,788 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 03:12:19,788 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:12:19,788 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:12:19,789 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-28 03:12:19,790 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-28 03:12:19,835 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 03:12:19,835 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 03:12:19,836 INFO L263 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-28 03:12:19,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:12:19,854 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:12:24,290 INFO L272 TraceCheckUtils]: 0: Hoare triple {32779#true} call ULTIMATE.init(); {32779#true} is VALID [2022-04-28 03:12:24,290 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-28 03:12:24,290 INFO L290 TraceCheckUtils]: 2: Hoare triple {32779#true} assume true; {32779#true} is VALID [2022-04-28 03:12:24,290 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32779#true} {32779#true} #138#return; {32779#true} is VALID [2022-04-28 03:12:24,290 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-28 03:12:24,290 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-28 03:12:24,291 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-28 03:12:24,292 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-28 03:12:24,292 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-28 03:12:24,293 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-28 03:12:24,293 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-28 03:12:24,293 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-28 03:12:24,293 INFO L290 TraceCheckUtils]: 12: Hoare triple {32779#true} ~cond := #in~cond; {32779#true} is VALID [2022-04-28 03:12:24,293 INFO L290 TraceCheckUtils]: 13: Hoare triple {32779#true} assume !(0 == ~cond); {32779#true} is VALID [2022-04-28 03:12:24,293 INFO L290 TraceCheckUtils]: 14: Hoare triple {32779#true} assume true; {32779#true} is VALID [2022-04-28 03:12:24,294 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-28 03:12:24,294 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-28 03:12:24,294 INFO L290 TraceCheckUtils]: 17: Hoare triple {32779#true} ~cond := #in~cond; {32779#true} is VALID [2022-04-28 03:12:24,294 INFO L290 TraceCheckUtils]: 18: Hoare triple {32779#true} assume !(0 == ~cond); {32779#true} is VALID [2022-04-28 03:12:24,294 INFO L290 TraceCheckUtils]: 19: Hoare triple {32779#true} assume true; {32779#true} is VALID [2022-04-28 03:12:24,294 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-28 03:12:24,295 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-28 03:12:24,295 INFO L290 TraceCheckUtils]: 22: Hoare triple {32779#true} ~cond := #in~cond; {32779#true} is VALID [2022-04-28 03:12:24,295 INFO L290 TraceCheckUtils]: 23: Hoare triple {32779#true} assume !(0 == ~cond); {32779#true} is VALID [2022-04-28 03:12:24,295 INFO L290 TraceCheckUtils]: 24: Hoare triple {32779#true} assume true; {32779#true} is VALID [2022-04-28 03:12:24,295 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-28 03:12:24,295 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-28 03:12:24,295 INFO L290 TraceCheckUtils]: 27: Hoare triple {32779#true} ~cond := #in~cond; {32779#true} is VALID [2022-04-28 03:12:24,295 INFO L290 TraceCheckUtils]: 28: Hoare triple {32779#true} assume !(0 == ~cond); {32779#true} is VALID [2022-04-28 03:12:24,296 INFO L290 TraceCheckUtils]: 29: Hoare triple {32779#true} assume true; {32779#true} is VALID [2022-04-28 03:12:24,296 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-28 03:12:24,296 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-28 03:12:24,297 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-28 03:12:24,297 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-28 03:12:24,297 INFO L290 TraceCheckUtils]: 34: Hoare triple {32779#true} ~cond := #in~cond; {32779#true} is VALID [2022-04-28 03:12:24,297 INFO L290 TraceCheckUtils]: 35: Hoare triple {32779#true} assume !(0 == ~cond); {32779#true} is VALID [2022-04-28 03:12:24,297 INFO L290 TraceCheckUtils]: 36: Hoare triple {32779#true} assume true; {32779#true} is VALID [2022-04-28 03:12:24,297 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-28 03:12:24,297 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-28 03:12:24,298 INFO L290 TraceCheckUtils]: 39: Hoare triple {32779#true} ~cond := #in~cond; {32779#true} is VALID [2022-04-28 03:12:24,298 INFO L290 TraceCheckUtils]: 40: Hoare triple {32779#true} assume !(0 == ~cond); {32779#true} is VALID [2022-04-28 03:12:24,298 INFO L290 TraceCheckUtils]: 41: Hoare triple {32779#true} assume true; {32779#true} is VALID [2022-04-28 03:12:24,298 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-28 03:12:24,298 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-28 03:12:24,299 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-28 03:12:24,299 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-28 03:12:24,299 INFO L290 TraceCheckUtils]: 46: Hoare triple {32779#true} ~cond := #in~cond; {32779#true} is VALID [2022-04-28 03:12:24,299 INFO L290 TraceCheckUtils]: 47: Hoare triple {32779#true} assume !(0 == ~cond); {32779#true} is VALID [2022-04-28 03:12:24,299 INFO L290 TraceCheckUtils]: 48: Hoare triple {32779#true} assume true; {32779#true} is VALID [2022-04-28 03:12:24,299 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-28 03:12:24,300 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-28 03:12:24,300 INFO L290 TraceCheckUtils]: 51: Hoare triple {32779#true} ~cond := #in~cond; {32779#true} is VALID [2022-04-28 03:12:24,300 INFO L290 TraceCheckUtils]: 52: Hoare triple {32779#true} assume !(0 == ~cond); {32779#true} is VALID [2022-04-28 03:12:24,300 INFO L290 TraceCheckUtils]: 53: Hoare triple {32779#true} assume true; {32779#true} is VALID [2022-04-28 03:12:24,300 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-28 03:12:24,300 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-28 03:12:24,300 INFO L290 TraceCheckUtils]: 56: Hoare triple {32779#true} ~cond := #in~cond; {32779#true} is VALID [2022-04-28 03:12:24,300 INFO L290 TraceCheckUtils]: 57: Hoare triple {32779#true} assume !(0 == ~cond); {32779#true} is VALID [2022-04-28 03:12:24,301 INFO L290 TraceCheckUtils]: 58: Hoare triple {32779#true} assume true; {32779#true} is VALID [2022-04-28 03:12:24,301 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-28 03:12:24,301 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-28 03:12:24,301 INFO L290 TraceCheckUtils]: 61: Hoare triple {32779#true} ~cond := #in~cond; {32779#true} is VALID [2022-04-28 03:12:24,301 INFO L290 TraceCheckUtils]: 62: Hoare triple {32779#true} assume !(0 == ~cond); {32779#true} is VALID [2022-04-28 03:12:24,301 INFO L290 TraceCheckUtils]: 63: Hoare triple {32779#true} assume true; {32779#true} is VALID [2022-04-28 03:12:24,302 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-28 03:12:24,302 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-28 03:12:24,303 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-28 03:12:24,303 INFO L290 TraceCheckUtils]: 67: Hoare triple {32780#false} assume !(~j~0 < ~r~0); {32780#false} is VALID [2022-04-28 03:12:24,303 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-28 03:12:24,303 INFO L290 TraceCheckUtils]: 69: Hoare triple {32780#false} ~cond := #in~cond; {32780#false} is VALID [2022-04-28 03:12:24,303 INFO L290 TraceCheckUtils]: 70: Hoare triple {32780#false} assume !(0 == ~cond); {32780#false} is VALID [2022-04-28 03:12:24,303 INFO L290 TraceCheckUtils]: 71: Hoare triple {32780#false} assume true; {32780#false} is VALID [2022-04-28 03:12:24,303 INFO L284 TraceCheckUtils]: 72: Hoare quadruple {32780#false} {32780#false} #118#return; {32780#false} is VALID [2022-04-28 03:12:24,303 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-28 03:12:24,303 INFO L290 TraceCheckUtils]: 74: Hoare triple {32780#false} ~cond := #in~cond; {32780#false} is VALID [2022-04-28 03:12:24,303 INFO L290 TraceCheckUtils]: 75: Hoare triple {32780#false} assume !(0 == ~cond); {32780#false} is VALID [2022-04-28 03:12:24,304 INFO L290 TraceCheckUtils]: 76: Hoare triple {32780#false} assume true; {32780#false} is VALID [2022-04-28 03:12:24,304 INFO L284 TraceCheckUtils]: 77: Hoare quadruple {32780#false} {32780#false} #120#return; {32780#false} is VALID [2022-04-28 03:12:24,304 INFO L290 TraceCheckUtils]: 78: Hoare triple {32780#false} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {32780#false} is VALID [2022-04-28 03:12:24,304 INFO L290 TraceCheckUtils]: 79: Hoare triple {32780#false} assume !(0 != #t~nondet5);havoc #t~nondet5; {32780#false} is VALID [2022-04-28 03:12:24,304 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-28 03:12:24,304 INFO L290 TraceCheckUtils]: 81: Hoare triple {32780#false} ~cond := #in~cond; {32780#false} is VALID [2022-04-28 03:12:24,304 INFO L290 TraceCheckUtils]: 82: Hoare triple {32780#false} assume 0 == ~cond; {32780#false} is VALID [2022-04-28 03:12:24,304 INFO L290 TraceCheckUtils]: 83: Hoare triple {32780#false} assume !false; {32780#false} is VALID [2022-04-28 03:12:24,304 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-28 03:12:24,305 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 03:12:24,305 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2065672911] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:12:24,305 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-28 03:12:24,305 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 12 [2022-04-28 03:12:24,305 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:12:24,305 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1952753806] [2022-04-28 03:12:24,305 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1952753806] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:12:24,305 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:12:24,305 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 03:12:24,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [149080813] [2022-04-28 03:12:24,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:12:24,306 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-28 03:12:24,306 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:12:24,306 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-28 03:12:24,344 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-28 03:12:24,344 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 03:12:24,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:12:24,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 03:12:24,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2022-04-28 03:12:24,345 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-28 03:12:26,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:12:26,488 INFO L93 Difference]: Finished difference Result 549 states and 838 transitions. [2022-04-28 03:12:26,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-28 03:12:26,488 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-28 03:12:26,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:12:26,489 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-28 03:12:26,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 168 transitions. [2022-04-28 03:12:26,490 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-28 03:12:26,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 168 transitions. [2022-04-28 03:12:26,491 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 168 transitions. [2022-04-28 03:12:26,634 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-28 03:12:26,639 INFO L225 Difference]: With dead ends: 549 [2022-04-28 03:12:26,639 INFO L226 Difference]: Without dead ends: 249 [2022-04-28 03:12:26,640 INFO L412 NwaCegarLoop]: 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-28 03:12:26,640 INFO L413 NwaCegarLoop]: 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-28 03:12:26,640 INFO L414 NwaCegarLoop]: 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-28 03:12:26,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2022-04-28 03:12:27,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 238. [2022-04-28 03:12:27,820 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:12:27,821 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-28 03:12:27,821 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-28 03:12:27,821 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-28 03:12:27,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:12:27,826 INFO L93 Difference]: Finished difference Result 249 states and 369 transitions. [2022-04-28 03:12:27,826 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 369 transitions. [2022-04-28 03:12:27,826 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:12:27,826 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:12:27,827 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-28 03:12:27,827 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-28 03:12:27,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:12:27,832 INFO L93 Difference]: Finished difference Result 249 states and 369 transitions. [2022-04-28 03:12:27,832 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 369 transitions. [2022-04-28 03:12:27,832 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:12:27,832 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:12:27,832 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:12:27,832 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:12:27,833 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-28 03:12:27,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 354 transitions. [2022-04-28 03:12:27,837 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 354 transitions. Word has length 84 [2022-04-28 03:12:27,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:12:27,838 INFO L495 AbstractCegarLoop]: Abstraction has 238 states and 354 transitions. [2022-04-28 03:12:27,838 INFO L496 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-28 03:12:27,838 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 238 states and 354 transitions. [2022-04-28 03:12:28,313 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-28 03:12:28,313 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 354 transitions. [2022-04-28 03:12:28,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2022-04-28 03:12:28,314 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:12:28,314 INFO L195 NwaCegarLoop]: 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-28 03:12:28,330 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-28 03:12:28,515 WARN L477 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-28 03:12:28,515 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:12:28,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:12:28,516 INFO L85 PathProgramCache]: Analyzing trace with hash -560912485, now seen corresponding path program 1 times [2022-04-28 03:12:28,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:12:28,516 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [643674091] [2022-04-28 03:12:28,516 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 03:12:28,516 INFO L85 PathProgramCache]: Analyzing trace with hash -560912485, now seen corresponding path program 2 times [2022-04-28 03:12:28,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:12:28,517 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [262732942] [2022-04-28 03:12:28,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:12:28,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:12:28,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:12:28,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:12:28,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:12:28,589 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-28 03:12:28,589 INFO L290 TraceCheckUtils]: 1: Hoare triple {35169#true} assume true; {35169#true} is VALID [2022-04-28 03:12:28,589 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {35169#true} {35169#true} #138#return; {35169#true} is VALID [2022-04-28 03:12:28,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-28 03:12:28,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:12:28,591 INFO L290 TraceCheckUtils]: 0: Hoare triple {35169#true} ~cond := #in~cond; {35169#true} is VALID [2022-04-28 03:12:28,591 INFO L290 TraceCheckUtils]: 1: Hoare triple {35169#true} assume !(0 == ~cond); {35169#true} is VALID [2022-04-28 03:12:28,591 INFO L290 TraceCheckUtils]: 2: Hoare triple {35169#true} assume true; {35169#true} is VALID [2022-04-28 03:12:28,591 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35169#true} {35169#true} #118#return; {35169#true} is VALID [2022-04-28 03:12:28,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-04-28 03:12:28,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:12:28,593 INFO L290 TraceCheckUtils]: 0: Hoare triple {35169#true} ~cond := #in~cond; {35169#true} is VALID [2022-04-28 03:12:28,593 INFO L290 TraceCheckUtils]: 1: Hoare triple {35169#true} assume !(0 == ~cond); {35169#true} is VALID [2022-04-28 03:12:28,593 INFO L290 TraceCheckUtils]: 2: Hoare triple {35169#true} assume true; {35169#true} is VALID [2022-04-28 03:12:28,593 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35169#true} {35169#true} #120#return; {35169#true} is VALID [2022-04-28 03:12:28,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-04-28 03:12:28,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:12:28,595 INFO L290 TraceCheckUtils]: 0: Hoare triple {35169#true} ~cond := #in~cond; {35169#true} is VALID [2022-04-28 03:12:28,595 INFO L290 TraceCheckUtils]: 1: Hoare triple {35169#true} assume !(0 == ~cond); {35169#true} is VALID [2022-04-28 03:12:28,595 INFO L290 TraceCheckUtils]: 2: Hoare triple {35169#true} assume true; {35169#true} is VALID [2022-04-28 03:12:28,596 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35169#true} {35182#(<= 2 main_~l~0)} #130#return; {35182#(<= 2 main_~l~0)} is VALID [2022-04-28 03:12:28,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-04-28 03:12:28,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:12:28,598 INFO L290 TraceCheckUtils]: 0: Hoare triple {35169#true} ~cond := #in~cond; {35169#true} is VALID [2022-04-28 03:12:28,598 INFO L290 TraceCheckUtils]: 1: Hoare triple {35169#true} assume !(0 == ~cond); {35169#true} is VALID [2022-04-28 03:12:28,598 INFO L290 TraceCheckUtils]: 2: Hoare triple {35169#true} assume true; {35169#true} is VALID [2022-04-28 03:12:28,599 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35169#true} {35182#(<= 2 main_~l~0)} #132#return; {35182#(<= 2 main_~l~0)} is VALID [2022-04-28 03:12:28,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-04-28 03:12:28,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:12:28,601 INFO L290 TraceCheckUtils]: 0: Hoare triple {35169#true} ~cond := #in~cond; {35169#true} is VALID [2022-04-28 03:12:28,601 INFO L290 TraceCheckUtils]: 1: Hoare triple {35169#true} assume !(0 == ~cond); {35169#true} is VALID [2022-04-28 03:12:28,601 INFO L290 TraceCheckUtils]: 2: Hoare triple {35169#true} assume true; {35169#true} is VALID [2022-04-28 03:12:28,602 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35169#true} {35192#(<= 2 main_~j~0)} #110#return; {35192#(<= 2 main_~j~0)} is VALID [2022-04-28 03:12:28,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-04-28 03:12:28,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:12:28,604 INFO L290 TraceCheckUtils]: 0: Hoare triple {35169#true} ~cond := #in~cond; {35169#true} is VALID [2022-04-28 03:12:28,604 INFO L290 TraceCheckUtils]: 1: Hoare triple {35169#true} assume !(0 == ~cond); {35169#true} is VALID [2022-04-28 03:12:28,604 INFO L290 TraceCheckUtils]: 2: Hoare triple {35169#true} assume true; {35169#true} is VALID [2022-04-28 03:12:28,604 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35169#true} {35192#(<= 2 main_~j~0)} #112#return; {35192#(<= 2 main_~j~0)} is VALID [2022-04-28 03:12:28,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-04-28 03:12:28,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:12:28,606 INFO L290 TraceCheckUtils]: 0: Hoare triple {35169#true} ~cond := #in~cond; {35169#true} is VALID [2022-04-28 03:12:28,606 INFO L290 TraceCheckUtils]: 1: Hoare triple {35169#true} assume !(0 == ~cond); {35169#true} is VALID [2022-04-28 03:12:28,606 INFO L290 TraceCheckUtils]: 2: Hoare triple {35169#true} assume true; {35169#true} is VALID [2022-04-28 03:12:28,606 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35169#true} {35192#(<= 2 main_~j~0)} #114#return; {35192#(<= 2 main_~j~0)} is VALID [2022-04-28 03:12:28,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-04-28 03:12:28,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:12:28,608 INFO L290 TraceCheckUtils]: 0: Hoare triple {35169#true} ~cond := #in~cond; {35169#true} is VALID [2022-04-28 03:12:28,608 INFO L290 TraceCheckUtils]: 1: Hoare triple {35169#true} assume !(0 == ~cond); {35169#true} is VALID [2022-04-28 03:12:28,608 INFO L290 TraceCheckUtils]: 2: Hoare triple {35169#true} assume true; {35169#true} is VALID [2022-04-28 03:12:28,609 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35169#true} {35192#(<= 2 main_~j~0)} #116#return; {35192#(<= 2 main_~j~0)} is VALID [2022-04-28 03:12:28,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-04-28 03:12:28,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:12:28,611 INFO L290 TraceCheckUtils]: 0: Hoare triple {35169#true} ~cond := #in~cond; {35169#true} is VALID [2022-04-28 03:12:28,611 INFO L290 TraceCheckUtils]: 1: Hoare triple {35169#true} assume !(0 == ~cond); {35169#true} is VALID [2022-04-28 03:12:28,611 INFO L290 TraceCheckUtils]: 2: Hoare triple {35169#true} assume true; {35169#true} is VALID [2022-04-28 03:12:28,611 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35169#true} {35209#(<= 3 main_~j~0)} #118#return; {35209#(<= 3 main_~j~0)} is VALID [2022-04-28 03:12:28,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-04-28 03:12:28,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:12:28,614 INFO L290 TraceCheckUtils]: 0: Hoare triple {35169#true} ~cond := #in~cond; {35169#true} is VALID [2022-04-28 03:12:28,614 INFO L290 TraceCheckUtils]: 1: Hoare triple {35169#true} assume !(0 == ~cond); {35169#true} is VALID [2022-04-28 03:12:28,614 INFO L290 TraceCheckUtils]: 2: Hoare triple {35169#true} assume true; {35169#true} is VALID [2022-04-28 03:12:28,614 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35169#true} {35209#(<= 3 main_~j~0)} #120#return; {35209#(<= 3 main_~j~0)} is VALID [2022-04-28 03:12:28,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-04-28 03:12:28,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:12:28,616 INFO L290 TraceCheckUtils]: 0: Hoare triple {35169#true} ~cond := #in~cond; {35169#true} is VALID [2022-04-28 03:12:28,616 INFO L290 TraceCheckUtils]: 1: Hoare triple {35169#true} assume !(0 == ~cond); {35169#true} is VALID [2022-04-28 03:12:28,616 INFO L290 TraceCheckUtils]: 2: Hoare triple {35169#true} assume true; {35169#true} is VALID [2022-04-28 03:12:28,616 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35169#true} {35209#(<= 3 main_~j~0)} #122#return; {35209#(<= 3 main_~j~0)} is VALID [2022-04-28 03:12:28,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-04-28 03:12:28,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:12:28,619 INFO L290 TraceCheckUtils]: 0: Hoare triple {35169#true} ~cond := #in~cond; {35169#true} is VALID [2022-04-28 03:12:28,619 INFO L290 TraceCheckUtils]: 1: Hoare triple {35169#true} assume !(0 == ~cond); {35169#true} is VALID [2022-04-28 03:12:28,619 INFO L290 TraceCheckUtils]: 2: Hoare triple {35169#true} assume true; {35169#true} is VALID [2022-04-28 03:12:28,619 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35169#true} {35209#(<= 3 main_~j~0)} #124#return; {35209#(<= 3 main_~j~0)} is VALID [2022-04-28 03:12:28,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-04-28 03:12:28,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:12:28,624 INFO L290 TraceCheckUtils]: 0: Hoare triple {35169#true} ~cond := #in~cond; {35169#true} is VALID [2022-04-28 03:12:28,624 INFO L290 TraceCheckUtils]: 1: Hoare triple {35169#true} assume !(0 == ~cond); {35169#true} is VALID [2022-04-28 03:12:28,624 INFO L290 TraceCheckUtils]: 2: Hoare triple {35169#true} assume true; {35169#true} is VALID [2022-04-28 03:12:28,624 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35169#true} {35209#(<= 3 main_~j~0)} #126#return; {35209#(<= 3 main_~j~0)} is VALID [2022-04-28 03:12:28,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-04-28 03:12:28,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:12:28,626 INFO L290 TraceCheckUtils]: 0: Hoare triple {35169#true} ~cond := #in~cond; {35169#true} is VALID [2022-04-28 03:12:28,627 INFO L290 TraceCheckUtils]: 1: Hoare triple {35169#true} assume !(0 == ~cond); {35169#true} is VALID [2022-04-28 03:12:28,627 INFO L290 TraceCheckUtils]: 2: Hoare triple {35169#true} assume true; {35169#true} is VALID [2022-04-28 03:12:28,627 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35169#true} {35209#(<= 3 main_~j~0)} #128#return; {35209#(<= 3 main_~j~0)} is VALID [2022-04-28 03:12:28,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-04-28 03:12:28,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:12:28,629 INFO L290 TraceCheckUtils]: 0: Hoare triple {35169#true} ~cond := #in~cond; {35169#true} is VALID [2022-04-28 03:12:28,629 INFO L290 TraceCheckUtils]: 1: Hoare triple {35169#true} assume !(0 == ~cond); {35169#true} is VALID [2022-04-28 03:12:28,629 INFO L290 TraceCheckUtils]: 2: Hoare triple {35169#true} assume true; {35169#true} is VALID [2022-04-28 03:12:28,629 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35169#true} {35234#(<= 3 main_~i~0)} #118#return; {35234#(<= 3 main_~i~0)} is VALID [2022-04-28 03:12:28,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-04-28 03:12:28,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:12:28,631 INFO L290 TraceCheckUtils]: 0: Hoare triple {35169#true} ~cond := #in~cond; {35169#true} is VALID [2022-04-28 03:12:28,631 INFO L290 TraceCheckUtils]: 1: Hoare triple {35169#true} assume !(0 == ~cond); {35169#true} is VALID [2022-04-28 03:12:28,631 INFO L290 TraceCheckUtils]: 2: Hoare triple {35169#true} assume true; {35169#true} is VALID [2022-04-28 03:12:28,632 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35169#true} {35234#(<= 3 main_~i~0)} #120#return; {35234#(<= 3 main_~i~0)} is VALID [2022-04-28 03:12:28,634 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-28 03:12:28,634 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-28 03:12:28,634 INFO L290 TraceCheckUtils]: 2: Hoare triple {35169#true} assume true; {35169#true} is VALID [2022-04-28 03:12:28,635 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35169#true} {35169#true} #138#return; {35169#true} is VALID [2022-04-28 03:12:28,635 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-28 03:12:28,635 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-28 03:12:28,635 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-28 03:12:28,635 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-28 03:12:28,635 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-28 03:12:28,635 INFO L290 TraceCheckUtils]: 9: Hoare triple {35169#true} assume !!(~j~0 <= ~r~0); {35169#true} is VALID [2022-04-28 03:12:28,635 INFO L290 TraceCheckUtils]: 10: Hoare triple {35169#true} assume !(~j~0 < ~r~0); {35169#true} is VALID [2022-04-28 03:12:28,635 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-28 03:12:28,635 INFO L290 TraceCheckUtils]: 12: Hoare triple {35169#true} ~cond := #in~cond; {35169#true} is VALID [2022-04-28 03:12:28,635 INFO L290 TraceCheckUtils]: 13: Hoare triple {35169#true} assume !(0 == ~cond); {35169#true} is VALID [2022-04-28 03:12:28,635 INFO L290 TraceCheckUtils]: 14: Hoare triple {35169#true} assume true; {35169#true} is VALID [2022-04-28 03:12:28,635 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {35169#true} {35169#true} #118#return; {35169#true} is VALID [2022-04-28 03:12:28,635 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-28 03:12:28,636 INFO L290 TraceCheckUtils]: 17: Hoare triple {35169#true} ~cond := #in~cond; {35169#true} is VALID [2022-04-28 03:12:28,636 INFO L290 TraceCheckUtils]: 18: Hoare triple {35169#true} assume !(0 == ~cond); {35169#true} is VALID [2022-04-28 03:12:28,636 INFO L290 TraceCheckUtils]: 19: Hoare triple {35169#true} assume true; {35169#true} is VALID [2022-04-28 03:12:28,636 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {35169#true} {35169#true} #120#return; {35169#true} is VALID [2022-04-28 03:12:28,636 INFO L290 TraceCheckUtils]: 21: Hoare triple {35169#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {35169#true} is VALID [2022-04-28 03:12:28,636 INFO L290 TraceCheckUtils]: 22: Hoare triple {35169#true} assume 0 != #t~nondet5;havoc #t~nondet5; {35169#true} is VALID [2022-04-28 03:12:28,636 INFO L290 TraceCheckUtils]: 23: Hoare triple {35169#true} assume ~l~0 > 1; {35182#(<= 2 main_~l~0)} is VALID [2022-04-28 03:12:28,636 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-28 03:12:28,636 INFO L290 TraceCheckUtils]: 25: Hoare triple {35169#true} ~cond := #in~cond; {35169#true} is VALID [2022-04-28 03:12:28,636 INFO L290 TraceCheckUtils]: 26: Hoare triple {35169#true} assume !(0 == ~cond); {35169#true} is VALID [2022-04-28 03:12:28,637 INFO L290 TraceCheckUtils]: 27: Hoare triple {35169#true} assume true; {35169#true} is VALID [2022-04-28 03:12:28,637 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {35169#true} {35182#(<= 2 main_~l~0)} #130#return; {35182#(<= 2 main_~l~0)} is VALID [2022-04-28 03:12:28,637 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-28 03:12:28,637 INFO L290 TraceCheckUtils]: 30: Hoare triple {35169#true} ~cond := #in~cond; {35169#true} is VALID [2022-04-28 03:12:28,637 INFO L290 TraceCheckUtils]: 31: Hoare triple {35169#true} assume !(0 == ~cond); {35169#true} is VALID [2022-04-28 03:12:28,637 INFO L290 TraceCheckUtils]: 32: Hoare triple {35169#true} assume true; {35169#true} is VALID [2022-04-28 03:12:28,638 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {35169#true} {35182#(<= 2 main_~l~0)} #132#return; {35182#(<= 2 main_~l~0)} is VALID [2022-04-28 03:12:28,638 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-28 03:12:28,638 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-28 03:12:28,639 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-28 03:12:28,639 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-28 03:12:28,639 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-28 03:12:28,639 INFO L290 TraceCheckUtils]: 39: Hoare triple {35169#true} ~cond := #in~cond; {35169#true} is VALID [2022-04-28 03:12:28,639 INFO L290 TraceCheckUtils]: 40: Hoare triple {35169#true} assume !(0 == ~cond); {35169#true} is VALID [2022-04-28 03:12:28,639 INFO L290 TraceCheckUtils]: 41: Hoare triple {35169#true} assume true; {35169#true} is VALID [2022-04-28 03:12:28,639 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {35169#true} {35192#(<= 2 main_~j~0)} #110#return; {35192#(<= 2 main_~j~0)} is VALID [2022-04-28 03:12:28,640 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-28 03:12:28,640 INFO L290 TraceCheckUtils]: 44: Hoare triple {35169#true} ~cond := #in~cond; {35169#true} is VALID [2022-04-28 03:12:28,640 INFO L290 TraceCheckUtils]: 45: Hoare triple {35169#true} assume !(0 == ~cond); {35169#true} is VALID [2022-04-28 03:12:28,640 INFO L290 TraceCheckUtils]: 46: Hoare triple {35169#true} assume true; {35169#true} is VALID [2022-04-28 03:12:28,640 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {35169#true} {35192#(<= 2 main_~j~0)} #112#return; {35192#(<= 2 main_~j~0)} is VALID [2022-04-28 03:12:28,640 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-28 03:12:28,640 INFO L290 TraceCheckUtils]: 49: Hoare triple {35169#true} ~cond := #in~cond; {35169#true} is VALID [2022-04-28 03:12:28,640 INFO L290 TraceCheckUtils]: 50: Hoare triple {35169#true} assume !(0 == ~cond); {35169#true} is VALID [2022-04-28 03:12:28,640 INFO L290 TraceCheckUtils]: 51: Hoare triple {35169#true} assume true; {35169#true} is VALID [2022-04-28 03:12:28,641 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {35169#true} {35192#(<= 2 main_~j~0)} #114#return; {35192#(<= 2 main_~j~0)} is VALID [2022-04-28 03:12:28,641 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-28 03:12:28,641 INFO L290 TraceCheckUtils]: 54: Hoare triple {35169#true} ~cond := #in~cond; {35169#true} is VALID [2022-04-28 03:12:28,641 INFO L290 TraceCheckUtils]: 55: Hoare triple {35169#true} assume !(0 == ~cond); {35169#true} is VALID [2022-04-28 03:12:28,641 INFO L290 TraceCheckUtils]: 56: Hoare triple {35169#true} assume true; {35169#true} is VALID [2022-04-28 03:12:28,641 INFO L284 TraceCheckUtils]: 57: Hoare quadruple {35169#true} {35192#(<= 2 main_~j~0)} #116#return; {35192#(<= 2 main_~j~0)} is VALID [2022-04-28 03:12:28,642 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-28 03:12:28,642 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-28 03:12:28,642 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-28 03:12:28,642 INFO L290 TraceCheckUtils]: 61: Hoare triple {35169#true} ~cond := #in~cond; {35169#true} is VALID [2022-04-28 03:12:28,642 INFO L290 TraceCheckUtils]: 62: Hoare triple {35169#true} assume !(0 == ~cond); {35169#true} is VALID [2022-04-28 03:12:28,642 INFO L290 TraceCheckUtils]: 63: Hoare triple {35169#true} assume true; {35169#true} is VALID [2022-04-28 03:12:28,643 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {35169#true} {35209#(<= 3 main_~j~0)} #118#return; {35209#(<= 3 main_~j~0)} is VALID [2022-04-28 03:12:28,643 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-28 03:12:28,643 INFO L290 TraceCheckUtils]: 66: Hoare triple {35169#true} ~cond := #in~cond; {35169#true} is VALID [2022-04-28 03:12:28,643 INFO L290 TraceCheckUtils]: 67: Hoare triple {35169#true} assume !(0 == ~cond); {35169#true} is VALID [2022-04-28 03:12:28,643 INFO L290 TraceCheckUtils]: 68: Hoare triple {35169#true} assume true; {35169#true} is VALID [2022-04-28 03:12:28,643 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {35169#true} {35209#(<= 3 main_~j~0)} #120#return; {35209#(<= 3 main_~j~0)} is VALID [2022-04-28 03:12:28,644 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-28 03:12:28,644 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-28 03:12:28,644 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-28 03:12:28,644 INFO L290 TraceCheckUtils]: 73: Hoare triple {35169#true} ~cond := #in~cond; {35169#true} is VALID [2022-04-28 03:12:28,644 INFO L290 TraceCheckUtils]: 74: Hoare triple {35169#true} assume !(0 == ~cond); {35169#true} is VALID [2022-04-28 03:12:28,644 INFO L290 TraceCheckUtils]: 75: Hoare triple {35169#true} assume true; {35169#true} is VALID [2022-04-28 03:12:28,645 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {35169#true} {35209#(<= 3 main_~j~0)} #122#return; {35209#(<= 3 main_~j~0)} is VALID [2022-04-28 03:12:28,645 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-28 03:12:28,645 INFO L290 TraceCheckUtils]: 78: Hoare triple {35169#true} ~cond := #in~cond; {35169#true} is VALID [2022-04-28 03:12:28,645 INFO L290 TraceCheckUtils]: 79: Hoare triple {35169#true} assume !(0 == ~cond); {35169#true} is VALID [2022-04-28 03:12:28,645 INFO L290 TraceCheckUtils]: 80: Hoare triple {35169#true} assume true; {35169#true} is VALID [2022-04-28 03:12:28,646 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {35169#true} {35209#(<= 3 main_~j~0)} #124#return; {35209#(<= 3 main_~j~0)} is VALID [2022-04-28 03:12:28,646 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-28 03:12:28,646 INFO L290 TraceCheckUtils]: 83: Hoare triple {35169#true} ~cond := #in~cond; {35169#true} is VALID [2022-04-28 03:12:28,646 INFO L290 TraceCheckUtils]: 84: Hoare triple {35169#true} assume !(0 == ~cond); {35169#true} is VALID [2022-04-28 03:12:28,646 INFO L290 TraceCheckUtils]: 85: Hoare triple {35169#true} assume true; {35169#true} is VALID [2022-04-28 03:12:28,646 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {35169#true} {35209#(<= 3 main_~j~0)} #126#return; {35209#(<= 3 main_~j~0)} is VALID [2022-04-28 03:12:28,646 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-28 03:12:28,646 INFO L290 TraceCheckUtils]: 88: Hoare triple {35169#true} ~cond := #in~cond; {35169#true} is VALID [2022-04-28 03:12:28,646 INFO L290 TraceCheckUtils]: 89: Hoare triple {35169#true} assume !(0 == ~cond); {35169#true} is VALID [2022-04-28 03:12:28,646 INFO L290 TraceCheckUtils]: 90: Hoare triple {35169#true} assume true; {35169#true} is VALID [2022-04-28 03:12:28,647 INFO L284 TraceCheckUtils]: 91: Hoare quadruple {35169#true} {35209#(<= 3 main_~j~0)} #128#return; {35209#(<= 3 main_~j~0)} is VALID [2022-04-28 03:12:28,647 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-28 03:12:28,647 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-28 03:12:28,648 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-28 03:12:28,648 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-28 03:12:28,648 INFO L290 TraceCheckUtils]: 96: Hoare triple {35169#true} ~cond := #in~cond; {35169#true} is VALID [2022-04-28 03:12:28,655 INFO L290 TraceCheckUtils]: 97: Hoare triple {35169#true} assume !(0 == ~cond); {35169#true} is VALID [2022-04-28 03:12:28,655 INFO L290 TraceCheckUtils]: 98: Hoare triple {35169#true} assume true; {35169#true} is VALID [2022-04-28 03:12:28,655 INFO L284 TraceCheckUtils]: 99: Hoare quadruple {35169#true} {35234#(<= 3 main_~i~0)} #118#return; {35234#(<= 3 main_~i~0)} is VALID [2022-04-28 03:12:28,655 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-28 03:12:28,656 INFO L290 TraceCheckUtils]: 101: Hoare triple {35169#true} ~cond := #in~cond; {35169#true} is VALID [2022-04-28 03:12:28,656 INFO L290 TraceCheckUtils]: 102: Hoare triple {35169#true} assume !(0 == ~cond); {35169#true} is VALID [2022-04-28 03:12:28,656 INFO L290 TraceCheckUtils]: 103: Hoare triple {35169#true} assume true; {35169#true} is VALID [2022-04-28 03:12:28,656 INFO L284 TraceCheckUtils]: 104: Hoare quadruple {35169#true} {35234#(<= 3 main_~i~0)} #120#return; {35234#(<= 3 main_~i~0)} is VALID [2022-04-28 03:12:28,656 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-28 03:12:28,656 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-28 03:12:28,657 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-28 03:12:28,657 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-28 03:12:28,657 INFO L290 TraceCheckUtils]: 109: Hoare triple {35244#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {35170#false} is VALID [2022-04-28 03:12:28,658 INFO L290 TraceCheckUtils]: 110: Hoare triple {35170#false} assume !false; {35170#false} is VALID [2022-04-28 03:12:28,658 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-28 03:12:28,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:12:28,658 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [262732942] [2022-04-28 03:12:28,658 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [262732942] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:12:28,658 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [511353209] [2022-04-28 03:12:28,658 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 03:12:28,658 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:12:28,658 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:12:28,660 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-28 03:12:28,661 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-28 03:12:28,713 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 03:12:28,714 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 03:12:28,714 INFO L263 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-28 03:12:28,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:12:28,737 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:12:33,362 INFO L272 TraceCheckUtils]: 0: Hoare triple {35169#true} call ULTIMATE.init(); {35169#true} is VALID [2022-04-28 03:12:33,362 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-28 03:12:33,362 INFO L290 TraceCheckUtils]: 2: Hoare triple {35169#true} assume true; {35169#true} is VALID [2022-04-28 03:12:33,362 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35169#true} {35169#true} #138#return; {35169#true} is VALID [2022-04-28 03:12:33,362 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-28 03:12:33,362 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-28 03:12:33,362 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-28 03:12:33,362 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-28 03:12:33,363 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-28 03:12:33,363 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-28 03:12:33,364 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-28 03:12:33,364 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-28 03:12:33,364 INFO L290 TraceCheckUtils]: 12: Hoare triple {35169#true} ~cond := #in~cond; {35169#true} is VALID [2022-04-28 03:12:33,364 INFO L290 TraceCheckUtils]: 13: Hoare triple {35169#true} assume !(0 == ~cond); {35169#true} is VALID [2022-04-28 03:12:33,364 INFO L290 TraceCheckUtils]: 14: Hoare triple {35169#true} assume true; {35169#true} is VALID [2022-04-28 03:12:33,364 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-28 03:12:33,364 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-28 03:12:33,365 INFO L290 TraceCheckUtils]: 17: Hoare triple {35169#true} ~cond := #in~cond; {35169#true} is VALID [2022-04-28 03:12:33,365 INFO L290 TraceCheckUtils]: 18: Hoare triple {35169#true} assume !(0 == ~cond); {35169#true} is VALID [2022-04-28 03:12:33,365 INFO L290 TraceCheckUtils]: 19: Hoare triple {35169#true} assume true; {35169#true} is VALID [2022-04-28 03:12:33,365 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-28 03:12:33,365 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-28 03:12:33,366 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-28 03:12:33,366 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-28 03:12:33,366 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-28 03:12:33,366 INFO L290 TraceCheckUtils]: 25: Hoare triple {35169#true} ~cond := #in~cond; {35169#true} is VALID [2022-04-28 03:12:33,366 INFO L290 TraceCheckUtils]: 26: Hoare triple {35169#true} assume !(0 == ~cond); {35169#true} is VALID [2022-04-28 03:12:33,366 INFO L290 TraceCheckUtils]: 27: Hoare triple {35169#true} assume true; {35169#true} is VALID [2022-04-28 03:12:33,367 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-28 03:12:33,367 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-28 03:12:33,367 INFO L290 TraceCheckUtils]: 30: Hoare triple {35169#true} ~cond := #in~cond; {35169#true} is VALID [2022-04-28 03:12:33,367 INFO L290 TraceCheckUtils]: 31: Hoare triple {35169#true} assume !(0 == ~cond); {35169#true} is VALID [2022-04-28 03:12:33,367 INFO L290 TraceCheckUtils]: 32: Hoare triple {35169#true} assume true; {35169#true} is VALID [2022-04-28 03:12:33,367 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-28 03:12:33,368 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-28 03:12:33,369 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-28 03:12:33,369 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-28 03:12:33,369 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-28 03:12:33,369 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-28 03:12:33,369 INFO L290 TraceCheckUtils]: 39: Hoare triple {35169#true} ~cond := #in~cond; {35169#true} is VALID [2022-04-28 03:12:33,370 INFO L290 TraceCheckUtils]: 40: Hoare triple {35169#true} assume !(0 == ~cond); {35169#true} is VALID [2022-04-28 03:12:33,370 INFO L290 TraceCheckUtils]: 41: Hoare triple {35169#true} assume true; {35169#true} is VALID [2022-04-28 03:12:33,370 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-28 03:12:33,370 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-28 03:12:33,370 INFO L290 TraceCheckUtils]: 44: Hoare triple {35169#true} ~cond := #in~cond; {35169#true} is VALID [2022-04-28 03:12:33,370 INFO L290 TraceCheckUtils]: 45: Hoare triple {35169#true} assume !(0 == ~cond); {35169#true} is VALID [2022-04-28 03:12:33,370 INFO L290 TraceCheckUtils]: 46: Hoare triple {35169#true} assume true; {35169#true} is VALID [2022-04-28 03:12:33,371 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-28 03:12:33,371 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-28 03:12:33,371 INFO L290 TraceCheckUtils]: 49: Hoare triple {35169#true} ~cond := #in~cond; {35169#true} is VALID [2022-04-28 03:12:33,371 INFO L290 TraceCheckUtils]: 50: Hoare triple {35169#true} assume !(0 == ~cond); {35169#true} is VALID [2022-04-28 03:12:33,371 INFO L290 TraceCheckUtils]: 51: Hoare triple {35169#true} assume true; {35169#true} is VALID [2022-04-28 03:12:33,371 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-28 03:12:33,371 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-28 03:12:33,371 INFO L290 TraceCheckUtils]: 54: Hoare triple {35169#true} ~cond := #in~cond; {35169#true} is VALID [2022-04-28 03:12:33,372 INFO L290 TraceCheckUtils]: 55: Hoare triple {35169#true} assume !(0 == ~cond); {35169#true} is VALID [2022-04-28 03:12:33,372 INFO L290 TraceCheckUtils]: 56: Hoare triple {35169#true} assume true; {35169#true} is VALID [2022-04-28 03:12:33,372 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-28 03:12:33,372 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-28 03:12:33,373 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-28 03:12:33,373 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-28 03:12:33,373 INFO L290 TraceCheckUtils]: 61: Hoare triple {35169#true} ~cond := #in~cond; {35169#true} is VALID [2022-04-28 03:12:33,373 INFO L290 TraceCheckUtils]: 62: Hoare triple {35169#true} assume !(0 == ~cond); {35169#true} is VALID [2022-04-28 03:12:33,373 INFO L290 TraceCheckUtils]: 63: Hoare triple {35169#true} assume true; {35169#true} is VALID [2022-04-28 03:12:33,374 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-28 03:12:33,374 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-28 03:12:33,374 INFO L290 TraceCheckUtils]: 66: Hoare triple {35169#true} ~cond := #in~cond; {35169#true} is VALID [2022-04-28 03:12:33,374 INFO L290 TraceCheckUtils]: 67: Hoare triple {35169#true} assume !(0 == ~cond); {35169#true} is VALID [2022-04-28 03:12:33,374 INFO L290 TraceCheckUtils]: 68: Hoare triple {35169#true} assume true; {35169#true} is VALID [2022-04-28 03:12:33,374 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-28 03:12:33,375 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-28 03:12:33,375 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-28 03:12:33,375 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-28 03:12:33,375 INFO L290 TraceCheckUtils]: 73: Hoare triple {35169#true} ~cond := #in~cond; {35169#true} is VALID [2022-04-28 03:12:33,375 INFO L290 TraceCheckUtils]: 74: Hoare triple {35169#true} assume !(0 == ~cond); {35169#true} is VALID [2022-04-28 03:12:33,375 INFO L290 TraceCheckUtils]: 75: Hoare triple {35169#true} assume true; {35169#true} is VALID [2022-04-28 03:12:33,376 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-28 03:12:33,376 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-28 03:12:33,376 INFO L290 TraceCheckUtils]: 78: Hoare triple {35169#true} ~cond := #in~cond; {35169#true} is VALID [2022-04-28 03:12:33,376 INFO L290 TraceCheckUtils]: 79: Hoare triple {35169#true} assume !(0 == ~cond); {35169#true} is VALID [2022-04-28 03:12:33,376 INFO L290 TraceCheckUtils]: 80: Hoare triple {35169#true} assume true; {35169#true} is VALID [2022-04-28 03:12:33,377 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-28 03:12:33,377 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-28 03:12:33,377 INFO L290 TraceCheckUtils]: 83: Hoare triple {35169#true} ~cond := #in~cond; {35169#true} is VALID [2022-04-28 03:12:33,377 INFO L290 TraceCheckUtils]: 84: Hoare triple {35169#true} assume !(0 == ~cond); {35169#true} is VALID [2022-04-28 03:12:33,377 INFO L290 TraceCheckUtils]: 85: Hoare triple {35169#true} assume true; {35169#true} is VALID [2022-04-28 03:12:33,377 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-28 03:12:33,377 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-28 03:12:33,377 INFO L290 TraceCheckUtils]: 88: Hoare triple {35169#true} ~cond := #in~cond; {35169#true} is VALID [2022-04-28 03:12:33,378 INFO L290 TraceCheckUtils]: 89: Hoare triple {35169#true} assume !(0 == ~cond); {35169#true} is VALID [2022-04-28 03:12:33,378 INFO L290 TraceCheckUtils]: 90: Hoare triple {35169#true} assume true; {35169#true} is VALID [2022-04-28 03:12:33,378 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-28 03:12:33,379 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-28 03:12:33,379 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-28 03:12:33,379 INFO L290 TraceCheckUtils]: 94: Hoare triple {35170#false} assume !(~j~0 < ~r~0); {35170#false} is VALID [2022-04-28 03:12:33,379 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-28 03:12:33,379 INFO L290 TraceCheckUtils]: 96: Hoare triple {35170#false} ~cond := #in~cond; {35170#false} is VALID [2022-04-28 03:12:33,379 INFO L290 TraceCheckUtils]: 97: Hoare triple {35170#false} assume !(0 == ~cond); {35170#false} is VALID [2022-04-28 03:12:33,380 INFO L290 TraceCheckUtils]: 98: Hoare triple {35170#false} assume true; {35170#false} is VALID [2022-04-28 03:12:33,380 INFO L284 TraceCheckUtils]: 99: Hoare quadruple {35170#false} {35170#false} #118#return; {35170#false} is VALID [2022-04-28 03:12:33,380 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-28 03:12:33,380 INFO L290 TraceCheckUtils]: 101: Hoare triple {35170#false} ~cond := #in~cond; {35170#false} is VALID [2022-04-28 03:12:33,380 INFO L290 TraceCheckUtils]: 102: Hoare triple {35170#false} assume !(0 == ~cond); {35170#false} is VALID [2022-04-28 03:12:33,380 INFO L290 TraceCheckUtils]: 103: Hoare triple {35170#false} assume true; {35170#false} is VALID [2022-04-28 03:12:33,380 INFO L284 TraceCheckUtils]: 104: Hoare quadruple {35170#false} {35170#false} #120#return; {35170#false} is VALID [2022-04-28 03:12:33,380 INFO L290 TraceCheckUtils]: 105: Hoare triple {35170#false} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {35170#false} is VALID [2022-04-28 03:12:33,380 INFO L290 TraceCheckUtils]: 106: Hoare triple {35170#false} assume !(0 != #t~nondet5);havoc #t~nondet5; {35170#false} is VALID [2022-04-28 03:12:33,380 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-28 03:12:33,380 INFO L290 TraceCheckUtils]: 108: Hoare triple {35170#false} ~cond := #in~cond; {35170#false} is VALID [2022-04-28 03:12:33,380 INFO L290 TraceCheckUtils]: 109: Hoare triple {35170#false} assume 0 == ~cond; {35170#false} is VALID [2022-04-28 03:12:33,380 INFO L290 TraceCheckUtils]: 110: Hoare triple {35170#false} assume !false; {35170#false} is VALID [2022-04-28 03:12:33,381 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-28 03:12:33,381 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:12:34,176 INFO L290 TraceCheckUtils]: 110: Hoare triple {35170#false} assume !false; {35170#false} is VALID [2022-04-28 03:12:34,176 INFO L290 TraceCheckUtils]: 109: Hoare triple {35170#false} assume 0 == ~cond; {35170#false} is VALID [2022-04-28 03:12:34,176 INFO L290 TraceCheckUtils]: 108: Hoare triple {35170#false} ~cond := #in~cond; {35170#false} is VALID [2022-04-28 03:12:34,177 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-28 03:12:34,177 INFO L290 TraceCheckUtils]: 106: Hoare triple {35170#false} assume !(0 != #t~nondet5);havoc #t~nondet5; {35170#false} is VALID [2022-04-28 03:12:34,177 INFO L290 TraceCheckUtils]: 105: Hoare triple {35170#false} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {35170#false} is VALID [2022-04-28 03:12:34,177 INFO L284 TraceCheckUtils]: 104: Hoare quadruple {35169#true} {35170#false} #120#return; {35170#false} is VALID [2022-04-28 03:12:34,177 INFO L290 TraceCheckUtils]: 103: Hoare triple {35169#true} assume true; {35169#true} is VALID [2022-04-28 03:12:34,177 INFO L290 TraceCheckUtils]: 102: Hoare triple {35169#true} assume !(0 == ~cond); {35169#true} is VALID [2022-04-28 03:12:34,177 INFO L290 TraceCheckUtils]: 101: Hoare triple {35169#true} ~cond := #in~cond; {35169#true} is VALID [2022-04-28 03:12:34,177 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-28 03:12:34,177 INFO L284 TraceCheckUtils]: 99: Hoare quadruple {35169#true} {35170#false} #118#return; {35170#false} is VALID [2022-04-28 03:12:34,177 INFO L290 TraceCheckUtils]: 98: Hoare triple {35169#true} assume true; {35169#true} is VALID [2022-04-28 03:12:34,177 INFO L290 TraceCheckUtils]: 97: Hoare triple {35169#true} assume !(0 == ~cond); {35169#true} is VALID [2022-04-28 03:12:34,177 INFO L290 TraceCheckUtils]: 96: Hoare triple {35169#true} ~cond := #in~cond; {35169#true} is VALID [2022-04-28 03:12:34,177 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-28 03:12:34,177 INFO L290 TraceCheckUtils]: 94: Hoare triple {35170#false} assume !(~j~0 < ~r~0); {35170#false} is VALID [2022-04-28 03:12:34,178 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-28 03:12:34,178 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-28 03:12:34,179 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-28 03:12:34,179 INFO L290 TraceCheckUtils]: 90: Hoare triple {35169#true} assume true; {35169#true} is VALID [2022-04-28 03:12:34,179 INFO L290 TraceCheckUtils]: 89: Hoare triple {35169#true} assume !(0 == ~cond); {35169#true} is VALID [2022-04-28 03:12:34,179 INFO L290 TraceCheckUtils]: 88: Hoare triple {35169#true} ~cond := #in~cond; {35169#true} is VALID [2022-04-28 03:12:34,179 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-28 03:12:34,180 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-28 03:12:34,180 INFO L290 TraceCheckUtils]: 85: Hoare triple {35169#true} assume true; {35169#true} is VALID [2022-04-28 03:12:34,180 INFO L290 TraceCheckUtils]: 84: Hoare triple {35169#true} assume !(0 == ~cond); {35169#true} is VALID [2022-04-28 03:12:34,180 INFO L290 TraceCheckUtils]: 83: Hoare triple {35169#true} ~cond := #in~cond; {35169#true} is VALID [2022-04-28 03:12:34,180 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-28 03:12:34,181 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-28 03:12:34,181 INFO L290 TraceCheckUtils]: 80: Hoare triple {35169#true} assume true; {35169#true} is VALID [2022-04-28 03:12:34,181 INFO L290 TraceCheckUtils]: 79: Hoare triple {35169#true} assume !(0 == ~cond); {35169#true} is VALID [2022-04-28 03:12:34,181 INFO L290 TraceCheckUtils]: 78: Hoare triple {35169#true} ~cond := #in~cond; {35169#true} is VALID [2022-04-28 03:12:34,181 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-28 03:12:34,182 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-28 03:12:34,182 INFO L290 TraceCheckUtils]: 75: Hoare triple {35169#true} assume true; {35169#true} is VALID [2022-04-28 03:12:34,182 INFO L290 TraceCheckUtils]: 74: Hoare triple {35169#true} assume !(0 == ~cond); {35169#true} is VALID [2022-04-28 03:12:34,182 INFO L290 TraceCheckUtils]: 73: Hoare triple {35169#true} ~cond := #in~cond; {35169#true} is VALID [2022-04-28 03:12:34,182 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-28 03:12:34,182 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-28 03:12:34,183 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-28 03:12:34,183 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-28 03:12:34,183 INFO L290 TraceCheckUtils]: 68: Hoare triple {35169#true} assume true; {35169#true} is VALID [2022-04-28 03:12:34,183 INFO L290 TraceCheckUtils]: 67: Hoare triple {35169#true} assume !(0 == ~cond); {35169#true} is VALID [2022-04-28 03:12:34,184 INFO L290 TraceCheckUtils]: 66: Hoare triple {35169#true} ~cond := #in~cond; {35169#true} is VALID [2022-04-28 03:12:34,184 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-28 03:12:34,184 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-28 03:12:34,184 INFO L290 TraceCheckUtils]: 63: Hoare triple {35169#true} assume true; {35169#true} is VALID [2022-04-28 03:12:34,184 INFO L290 TraceCheckUtils]: 62: Hoare triple {35169#true} assume !(0 == ~cond); {35169#true} is VALID [2022-04-28 03:12:34,184 INFO L290 TraceCheckUtils]: 61: Hoare triple {35169#true} ~cond := #in~cond; {35169#true} is VALID [2022-04-28 03:12:34,184 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-28 03:12:34,185 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-28 03:12:34,185 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-28 03:12:34,186 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-28 03:12:34,186 INFO L290 TraceCheckUtils]: 56: Hoare triple {35169#true} assume true; {35169#true} is VALID [2022-04-28 03:12:34,186 INFO L290 TraceCheckUtils]: 55: Hoare triple {35169#true} assume !(0 == ~cond); {35169#true} is VALID [2022-04-28 03:12:34,186 INFO L290 TraceCheckUtils]: 54: Hoare triple {35169#true} ~cond := #in~cond; {35169#true} is VALID [2022-04-28 03:12:34,186 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-28 03:12:34,187 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-28 03:12:34,187 INFO L290 TraceCheckUtils]: 51: Hoare triple {35169#true} assume true; {35169#true} is VALID [2022-04-28 03:12:34,187 INFO L290 TraceCheckUtils]: 50: Hoare triple {35169#true} assume !(0 == ~cond); {35169#true} is VALID [2022-04-28 03:12:34,187 INFO L290 TraceCheckUtils]: 49: Hoare triple {35169#true} ~cond := #in~cond; {35169#true} is VALID [2022-04-28 03:12:34,187 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-28 03:12:34,187 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-28 03:12:34,187 INFO L290 TraceCheckUtils]: 46: Hoare triple {35169#true} assume true; {35169#true} is VALID [2022-04-28 03:12:34,187 INFO L290 TraceCheckUtils]: 45: Hoare triple {35169#true} assume !(0 == ~cond); {35169#true} is VALID [2022-04-28 03:12:34,188 INFO L290 TraceCheckUtils]: 44: Hoare triple {35169#true} ~cond := #in~cond; {35169#true} is VALID [2022-04-28 03:12:34,188 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-28 03:12:34,188 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-28 03:12:34,188 INFO L290 TraceCheckUtils]: 41: Hoare triple {35169#true} assume true; {35169#true} is VALID [2022-04-28 03:12:34,188 INFO L290 TraceCheckUtils]: 40: Hoare triple {35169#true} assume !(0 == ~cond); {35169#true} is VALID [2022-04-28 03:12:34,188 INFO L290 TraceCheckUtils]: 39: Hoare triple {35169#true} ~cond := #in~cond; {35169#true} is VALID [2022-04-28 03:12:34,188 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-28 03:12:34,189 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-28 03:12:34,189 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-28 03:12:34,190 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-28 03:12:34,190 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-28 03:12:34,191 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-28 03:12:34,191 INFO L290 TraceCheckUtils]: 32: Hoare triple {35169#true} assume true; {35169#true} is VALID [2022-04-28 03:12:34,191 INFO L290 TraceCheckUtils]: 31: Hoare triple {35169#true} assume !(0 == ~cond); {35169#true} is VALID [2022-04-28 03:12:34,191 INFO L290 TraceCheckUtils]: 30: Hoare triple {35169#true} ~cond := #in~cond; {35169#true} is VALID [2022-04-28 03:12:34,191 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-28 03:12:34,191 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-28 03:12:34,192 INFO L290 TraceCheckUtils]: 27: Hoare triple {35169#true} assume true; {35169#true} is VALID [2022-04-28 03:12:34,192 INFO L290 TraceCheckUtils]: 26: Hoare triple {35169#true} assume !(0 == ~cond); {35169#true} is VALID [2022-04-28 03:12:34,192 INFO L290 TraceCheckUtils]: 25: Hoare triple {35169#true} ~cond := #in~cond; {35169#true} is VALID [2022-04-28 03:12:34,192 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-28 03:12:34,192 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-28 03:12:34,193 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-28 03:12:34,193 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-28 03:12:34,194 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-28 03:12:34,194 INFO L290 TraceCheckUtils]: 19: Hoare triple {35169#true} assume true; {35169#true} is VALID [2022-04-28 03:12:34,194 INFO L290 TraceCheckUtils]: 18: Hoare triple {35169#true} assume !(0 == ~cond); {35169#true} is VALID [2022-04-28 03:12:34,194 INFO L290 TraceCheckUtils]: 17: Hoare triple {35169#true} ~cond := #in~cond; {35169#true} is VALID [2022-04-28 03:12:34,194 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-28 03:12:34,194 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-28 03:12:34,194 INFO L290 TraceCheckUtils]: 14: Hoare triple {35169#true} assume true; {35169#true} is VALID [2022-04-28 03:12:34,194 INFO L290 TraceCheckUtils]: 13: Hoare triple {35169#true} assume !(0 == ~cond); {35169#true} is VALID [2022-04-28 03:12:34,195 INFO L290 TraceCheckUtils]: 12: Hoare triple {35169#true} ~cond := #in~cond; {35169#true} is VALID [2022-04-28 03:12:34,195 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-28 03:12:34,195 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-28 03:12:34,196 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-28 03:12:34,196 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-28 03:12:34,196 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-28 03:12:34,196 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-28 03:12:34,196 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-28 03:12:34,196 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-28 03:12:34,197 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35169#true} {35169#true} #138#return; {35169#true} is VALID [2022-04-28 03:12:34,197 INFO L290 TraceCheckUtils]: 2: Hoare triple {35169#true} assume true; {35169#true} is VALID [2022-04-28 03:12:34,197 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-28 03:12:34,197 INFO L272 TraceCheckUtils]: 0: Hoare triple {35169#true} call ULTIMATE.init(); {35169#true} is VALID [2022-04-28 03:12:34,197 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-28 03:12:34,197 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [511353209] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:12:34,197 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:12:34,197 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 24 [2022-04-28 03:12:34,198 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:12:34,199 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [643674091] [2022-04-28 03:12:34,199 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [643674091] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:12:34,199 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:12:34,199 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-28 03:12:34,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [881419773] [2022-04-28 03:12:34,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:12:34,200 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-28 03:12:34,200 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:12:34,200 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-28 03:12:34,245 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-28 03:12:34,245 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-28 03:12:34,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:12:34,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-28 03:12:34,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=477, Unknown=0, NotChecked=0, Total=552 [2022-04-28 03:12:34,246 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-28 03:12:37,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:12:37,722 INFO L93 Difference]: Finished difference Result 350 states and 539 transitions. [2022-04-28 03:12:37,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-28 03:12:37,722 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-28 03:12:37,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:12:37,722 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-28 03:12:37,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 151 transitions. [2022-04-28 03:12:37,724 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-28 03:12:37,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 151 transitions. [2022-04-28 03:12:37,725 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 151 transitions. [2022-04-28 03:12:37,848 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-28 03:12:37,855 INFO L225 Difference]: With dead ends: 350 [2022-04-28 03:12:37,855 INFO L226 Difference]: Without dead ends: 348 [2022-04-28 03:12:37,856 INFO L412 NwaCegarLoop]: 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-28 03:12:37,856 INFO L413 NwaCegarLoop]: 69 mSDtfsCounter, 69 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 709 mSolverCounterSat, 169 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s 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.7s IncrementalHoareTripleChecker+Time [2022-04-28 03:12:37,856 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 101 Invalid, 878 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [169 Valid, 709 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-04-28 03:12:37,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348 states. [2022-04-28 03:12:39,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348 to 294. [2022-04-28 03:12:39,397 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:12:39,397 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-28 03:12:39,397 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-28 03:12:39,398 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-28 03:12:39,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:12:39,405 INFO L93 Difference]: Finished difference Result 348 states and 537 transitions. [2022-04-28 03:12:39,405 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 537 transitions. [2022-04-28 03:12:39,406 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:12:39,406 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:12:39,406 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-28 03:12:39,406 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-28 03:12:39,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:12:39,414 INFO L93 Difference]: Finished difference Result 348 states and 537 transitions. [2022-04-28 03:12:39,414 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 537 transitions. [2022-04-28 03:12:39,414 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:12:39,415 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:12:39,415 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:12:39,415 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:12:39,415 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-28 03:12:39,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 451 transitions. [2022-04-28 03:12:39,422 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 451 transitions. Word has length 111 [2022-04-28 03:12:39,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:12:39,422 INFO L495 AbstractCegarLoop]: Abstraction has 294 states and 451 transitions. [2022-04-28 03:12:39,422 INFO L496 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-28 03:12:39,422 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 294 states and 451 transitions. [2022-04-28 03:12:40,045 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-28 03:12:40,045 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 451 transitions. [2022-04-28 03:12:40,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2022-04-28 03:12:40,046 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:12:40,046 INFO L195 NwaCegarLoop]: 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-28 03:12:40,062 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-04-28 03:12:40,246 WARN L477 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-28 03:12:40,247 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:12:40,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:12:40,247 INFO L85 PathProgramCache]: Analyzing trace with hash 977427545, now seen corresponding path program 1 times [2022-04-28 03:12:40,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:12:40,247 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1987360429] [2022-04-28 03:12:40,248 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 03:12:40,248 INFO L85 PathProgramCache]: Analyzing trace with hash 977427545, now seen corresponding path program 2 times [2022-04-28 03:12:40,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:12:40,248 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192856318] [2022-04-28 03:12:40,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:12:40,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:12:40,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:12:40,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:12:40,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:12:40,314 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-28 03:12:40,315 INFO L290 TraceCheckUtils]: 1: Hoare triple {37933#true} assume true; {37933#true} is VALID [2022-04-28 03:12:40,315 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {37933#true} {37933#true} #138#return; {37933#true} is VALID [2022-04-28 03:12:40,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-28 03:12:40,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:12:40,323 INFO L290 TraceCheckUtils]: 0: Hoare triple {37933#true} ~cond := #in~cond; {37933#true} is VALID [2022-04-28 03:12:40,323 INFO L290 TraceCheckUtils]: 1: Hoare triple {37933#true} assume !(0 == ~cond); {37933#true} is VALID [2022-04-28 03:12:40,323 INFO L290 TraceCheckUtils]: 2: Hoare triple {37933#true} assume true; {37933#true} is VALID [2022-04-28 03:12:40,323 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {37933#true} {37933#true} #118#return; {37933#true} is VALID [2022-04-28 03:12:40,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-04-28 03:12:40,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:12:40,325 INFO L290 TraceCheckUtils]: 0: Hoare triple {37933#true} ~cond := #in~cond; {37933#true} is VALID [2022-04-28 03:12:40,325 INFO L290 TraceCheckUtils]: 1: Hoare triple {37933#true} assume !(0 == ~cond); {37933#true} is VALID [2022-04-28 03:12:40,325 INFO L290 TraceCheckUtils]: 2: Hoare triple {37933#true} assume true; {37933#true} is VALID [2022-04-28 03:12:40,325 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {37933#true} {37933#true} #120#return; {37933#true} is VALID [2022-04-28 03:12:40,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-04-28 03:12:40,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:12:40,329 INFO L290 TraceCheckUtils]: 0: Hoare triple {37933#true} ~cond := #in~cond; {37933#true} is VALID [2022-04-28 03:12:40,329 INFO L290 TraceCheckUtils]: 1: Hoare triple {37933#true} assume !(0 == ~cond); {37933#true} is VALID [2022-04-28 03:12:40,329 INFO L290 TraceCheckUtils]: 2: Hoare triple {37933#true} assume true; {37933#true} is VALID [2022-04-28 03:12:40,330 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {37933#true} {37946#(<= 2 main_~l~0)} #130#return; {37946#(<= 2 main_~l~0)} is VALID [2022-04-28 03:12:40,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-04-28 03:12:40,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:12:40,332 INFO L290 TraceCheckUtils]: 0: Hoare triple {37933#true} ~cond := #in~cond; {37933#true} is VALID [2022-04-28 03:12:40,332 INFO L290 TraceCheckUtils]: 1: Hoare triple {37933#true} assume !(0 == ~cond); {37933#true} is VALID [2022-04-28 03:12:40,332 INFO L290 TraceCheckUtils]: 2: Hoare triple {37933#true} assume true; {37933#true} is VALID [2022-04-28 03:12:40,332 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {37933#true} {37946#(<= 2 main_~l~0)} #132#return; {37946#(<= 2 main_~l~0)} is VALID [2022-04-28 03:12:40,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-04-28 03:12:40,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:12:40,334 INFO L290 TraceCheckUtils]: 0: Hoare triple {37933#true} ~cond := #in~cond; {37933#true} is VALID [2022-04-28 03:12:40,334 INFO L290 TraceCheckUtils]: 1: Hoare triple {37933#true} assume !(0 == ~cond); {37933#true} is VALID [2022-04-28 03:12:40,334 INFO L290 TraceCheckUtils]: 2: Hoare triple {37933#true} assume true; {37933#true} is VALID [2022-04-28 03:12:40,335 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {37933#true} {37956#(<= 2 main_~j~0)} #110#return; {37956#(<= 2 main_~j~0)} is VALID [2022-04-28 03:12:40,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-04-28 03:12:40,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:12:40,339 INFO L290 TraceCheckUtils]: 0: Hoare triple {37933#true} ~cond := #in~cond; {37933#true} is VALID [2022-04-28 03:12:40,339 INFO L290 TraceCheckUtils]: 1: Hoare triple {37933#true} assume !(0 == ~cond); {37933#true} is VALID [2022-04-28 03:12:40,339 INFO L290 TraceCheckUtils]: 2: Hoare triple {37933#true} assume true; {37933#true} is VALID [2022-04-28 03:12:40,339 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {37933#true} {37956#(<= 2 main_~j~0)} #112#return; {37956#(<= 2 main_~j~0)} is VALID [2022-04-28 03:12:40,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-04-28 03:12:40,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:12:40,342 INFO L290 TraceCheckUtils]: 0: Hoare triple {37933#true} ~cond := #in~cond; {37933#true} is VALID [2022-04-28 03:12:40,342 INFO L290 TraceCheckUtils]: 1: Hoare triple {37933#true} assume !(0 == ~cond); {37933#true} is VALID [2022-04-28 03:12:40,342 INFO L290 TraceCheckUtils]: 2: Hoare triple {37933#true} assume true; {37933#true} is VALID [2022-04-28 03:12:40,342 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {37933#true} {37956#(<= 2 main_~j~0)} #114#return; {37956#(<= 2 main_~j~0)} is VALID [2022-04-28 03:12:40,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-04-28 03:12:40,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:12:40,344 INFO L290 TraceCheckUtils]: 0: Hoare triple {37933#true} ~cond := #in~cond; {37933#true} is VALID [2022-04-28 03:12:40,344 INFO L290 TraceCheckUtils]: 1: Hoare triple {37933#true} assume !(0 == ~cond); {37933#true} is VALID [2022-04-28 03:12:40,345 INFO L290 TraceCheckUtils]: 2: Hoare triple {37933#true} assume true; {37933#true} is VALID [2022-04-28 03:12:40,345 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {37933#true} {37956#(<= 2 main_~j~0)} #116#return; {37956#(<= 2 main_~j~0)} is VALID [2022-04-28 03:12:40,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-04-28 03:12:40,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:12:40,347 INFO L290 TraceCheckUtils]: 0: Hoare triple {37933#true} ~cond := #in~cond; {37933#true} is VALID [2022-04-28 03:12:40,347 INFO L290 TraceCheckUtils]: 1: Hoare triple {37933#true} assume !(0 == ~cond); {37933#true} is VALID [2022-04-28 03:12:40,347 INFO L290 TraceCheckUtils]: 2: Hoare triple {37933#true} assume true; {37933#true} is VALID [2022-04-28 03:12:40,347 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {37933#true} {37956#(<= 2 main_~j~0)} #118#return; {37956#(<= 2 main_~j~0)} is VALID [2022-04-28 03:12:40,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-04-28 03:12:40,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:12:40,349 INFO L290 TraceCheckUtils]: 0: Hoare triple {37933#true} ~cond := #in~cond; {37933#true} is VALID [2022-04-28 03:12:40,349 INFO L290 TraceCheckUtils]: 1: Hoare triple {37933#true} assume !(0 == ~cond); {37933#true} is VALID [2022-04-28 03:12:40,349 INFO L290 TraceCheckUtils]: 2: Hoare triple {37933#true} assume true; {37933#true} is VALID [2022-04-28 03:12:40,349 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {37933#true} {37956#(<= 2 main_~j~0)} #120#return; {37956#(<= 2 main_~j~0)} is VALID [2022-04-28 03:12:40,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-04-28 03:12:40,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:12:40,351 INFO L290 TraceCheckUtils]: 0: Hoare triple {37933#true} ~cond := #in~cond; {37933#true} is VALID [2022-04-28 03:12:40,351 INFO L290 TraceCheckUtils]: 1: Hoare triple {37933#true} assume !(0 == ~cond); {37933#true} is VALID [2022-04-28 03:12:40,352 INFO L290 TraceCheckUtils]: 2: Hoare triple {37933#true} assume true; {37933#true} is VALID [2022-04-28 03:12:40,352 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {37933#true} {37956#(<= 2 main_~j~0)} #122#return; {37956#(<= 2 main_~j~0)} is VALID [2022-04-28 03:12:40,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-04-28 03:12:40,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:12:40,354 INFO L290 TraceCheckUtils]: 0: Hoare triple {37933#true} ~cond := #in~cond; {37933#true} is VALID [2022-04-28 03:12:40,354 INFO L290 TraceCheckUtils]: 1: Hoare triple {37933#true} assume !(0 == ~cond); {37933#true} is VALID [2022-04-28 03:12:40,354 INFO L290 TraceCheckUtils]: 2: Hoare triple {37933#true} assume true; {37933#true} is VALID [2022-04-28 03:12:40,354 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {37933#true} {37956#(<= 2 main_~j~0)} #124#return; {37956#(<= 2 main_~j~0)} is VALID [2022-04-28 03:12:40,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-04-28 03:12:40,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:12:40,356 INFO L290 TraceCheckUtils]: 0: Hoare triple {37933#true} ~cond := #in~cond; {37933#true} is VALID [2022-04-28 03:12:40,356 INFO L290 TraceCheckUtils]: 1: Hoare triple {37933#true} assume !(0 == ~cond); {37933#true} is VALID [2022-04-28 03:12:40,356 INFO L290 TraceCheckUtils]: 2: Hoare triple {37933#true} assume true; {37933#true} is VALID [2022-04-28 03:12:40,356 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {37933#true} {37956#(<= 2 main_~j~0)} #126#return; {37956#(<= 2 main_~j~0)} is VALID [2022-04-28 03:12:40,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-04-28 03:12:40,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:12:40,358 INFO L290 TraceCheckUtils]: 0: Hoare triple {37933#true} ~cond := #in~cond; {37933#true} is VALID [2022-04-28 03:12:40,359 INFO L290 TraceCheckUtils]: 1: Hoare triple {37933#true} assume !(0 == ~cond); {37933#true} is VALID [2022-04-28 03:12:40,359 INFO L290 TraceCheckUtils]: 2: Hoare triple {37933#true} assume true; {37933#true} is VALID [2022-04-28 03:12:40,359 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {37933#true} {37956#(<= 2 main_~j~0)} #128#return; {37956#(<= 2 main_~j~0)} is VALID [2022-04-28 03:12:40,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-04-28 03:12:40,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:12:40,361 INFO L290 TraceCheckUtils]: 0: Hoare triple {37933#true} ~cond := #in~cond; {37933#true} is VALID [2022-04-28 03:12:40,361 INFO L290 TraceCheckUtils]: 1: Hoare triple {37933#true} assume !(0 == ~cond); {37933#true} is VALID [2022-04-28 03:12:40,361 INFO L290 TraceCheckUtils]: 2: Hoare triple {37933#true} assume true; {37933#true} is VALID [2022-04-28 03:12:40,362 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {37933#true} {37997#(<= 2 main_~i~0)} #118#return; {37997#(<= 2 main_~i~0)} is VALID [2022-04-28 03:12:40,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-04-28 03:12:40,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:12:40,364 INFO L290 TraceCheckUtils]: 0: Hoare triple {37933#true} ~cond := #in~cond; {37933#true} is VALID [2022-04-28 03:12:40,364 INFO L290 TraceCheckUtils]: 1: Hoare triple {37933#true} assume !(0 == ~cond); {37933#true} is VALID [2022-04-28 03:12:40,364 INFO L290 TraceCheckUtils]: 2: Hoare triple {37933#true} assume true; {37933#true} is VALID [2022-04-28 03:12:40,365 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {37933#true} {37997#(<= 2 main_~i~0)} #120#return; {37997#(<= 2 main_~i~0)} is VALID [2022-04-28 03:12:40,365 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-28 03:12:40,365 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-28 03:12:40,365 INFO L290 TraceCheckUtils]: 2: Hoare triple {37933#true} assume true; {37933#true} is VALID [2022-04-28 03:12:40,365 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {37933#true} {37933#true} #138#return; {37933#true} is VALID [2022-04-28 03:12:40,365 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-28 03:12:40,365 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-28 03:12:40,365 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-28 03:12:40,366 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-28 03:12:40,366 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-28 03:12:40,366 INFO L290 TraceCheckUtils]: 9: Hoare triple {37933#true} assume !!(~j~0 <= ~r~0); {37933#true} is VALID [2022-04-28 03:12:40,366 INFO L290 TraceCheckUtils]: 10: Hoare triple {37933#true} assume !(~j~0 < ~r~0); {37933#true} is VALID [2022-04-28 03:12:40,366 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-28 03:12:40,366 INFO L290 TraceCheckUtils]: 12: Hoare triple {37933#true} ~cond := #in~cond; {37933#true} is VALID [2022-04-28 03:12:40,366 INFO L290 TraceCheckUtils]: 13: Hoare triple {37933#true} assume !(0 == ~cond); {37933#true} is VALID [2022-04-28 03:12:40,366 INFO L290 TraceCheckUtils]: 14: Hoare triple {37933#true} assume true; {37933#true} is VALID [2022-04-28 03:12:40,366 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {37933#true} {37933#true} #118#return; {37933#true} is VALID [2022-04-28 03:12:40,366 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-28 03:12:40,366 INFO L290 TraceCheckUtils]: 17: Hoare triple {37933#true} ~cond := #in~cond; {37933#true} is VALID [2022-04-28 03:12:40,366 INFO L290 TraceCheckUtils]: 18: Hoare triple {37933#true} assume !(0 == ~cond); {37933#true} is VALID [2022-04-28 03:12:40,366 INFO L290 TraceCheckUtils]: 19: Hoare triple {37933#true} assume true; {37933#true} is VALID [2022-04-28 03:12:40,366 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {37933#true} {37933#true} #120#return; {37933#true} is VALID [2022-04-28 03:12:40,366 INFO L290 TraceCheckUtils]: 21: Hoare triple {37933#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {37933#true} is VALID [2022-04-28 03:12:40,367 INFO L290 TraceCheckUtils]: 22: Hoare triple {37933#true} assume 0 != #t~nondet5;havoc #t~nondet5; {37933#true} is VALID [2022-04-28 03:12:40,367 INFO L290 TraceCheckUtils]: 23: Hoare triple {37933#true} assume ~l~0 > 1; {37946#(<= 2 main_~l~0)} is VALID [2022-04-28 03:12:40,367 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-28 03:12:40,367 INFO L290 TraceCheckUtils]: 25: Hoare triple {37933#true} ~cond := #in~cond; {37933#true} is VALID [2022-04-28 03:12:40,367 INFO L290 TraceCheckUtils]: 26: Hoare triple {37933#true} assume !(0 == ~cond); {37933#true} is VALID [2022-04-28 03:12:40,367 INFO L290 TraceCheckUtils]: 27: Hoare triple {37933#true} assume true; {37933#true} is VALID [2022-04-28 03:12:40,368 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {37933#true} {37946#(<= 2 main_~l~0)} #130#return; {37946#(<= 2 main_~l~0)} is VALID [2022-04-28 03:12:40,368 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-28 03:12:40,368 INFO L290 TraceCheckUtils]: 30: Hoare triple {37933#true} ~cond := #in~cond; {37933#true} is VALID [2022-04-28 03:12:40,368 INFO L290 TraceCheckUtils]: 31: Hoare triple {37933#true} assume !(0 == ~cond); {37933#true} is VALID [2022-04-28 03:12:40,368 INFO L290 TraceCheckUtils]: 32: Hoare triple {37933#true} assume true; {37933#true} is VALID [2022-04-28 03:12:40,368 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {37933#true} {37946#(<= 2 main_~l~0)} #132#return; {37946#(<= 2 main_~l~0)} is VALID [2022-04-28 03:12:40,368 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-28 03:12:40,369 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-28 03:12:40,369 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-28 03:12:40,369 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-28 03:12:40,369 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-28 03:12:40,370 INFO L290 TraceCheckUtils]: 39: Hoare triple {37933#true} ~cond := #in~cond; {37933#true} is VALID [2022-04-28 03:12:40,370 INFO L290 TraceCheckUtils]: 40: Hoare triple {37933#true} assume !(0 == ~cond); {37933#true} is VALID [2022-04-28 03:12:40,370 INFO L290 TraceCheckUtils]: 41: Hoare triple {37933#true} assume true; {37933#true} is VALID [2022-04-28 03:12:40,370 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {37933#true} {37956#(<= 2 main_~j~0)} #110#return; {37956#(<= 2 main_~j~0)} is VALID [2022-04-28 03:12:40,370 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-28 03:12:40,370 INFO L290 TraceCheckUtils]: 44: Hoare triple {37933#true} ~cond := #in~cond; {37933#true} is VALID [2022-04-28 03:12:40,370 INFO L290 TraceCheckUtils]: 45: Hoare triple {37933#true} assume !(0 == ~cond); {37933#true} is VALID [2022-04-28 03:12:40,370 INFO L290 TraceCheckUtils]: 46: Hoare triple {37933#true} assume true; {37933#true} is VALID [2022-04-28 03:12:40,371 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {37933#true} {37956#(<= 2 main_~j~0)} #112#return; {37956#(<= 2 main_~j~0)} is VALID [2022-04-28 03:12:40,371 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-28 03:12:40,371 INFO L290 TraceCheckUtils]: 49: Hoare triple {37933#true} ~cond := #in~cond; {37933#true} is VALID [2022-04-28 03:12:40,371 INFO L290 TraceCheckUtils]: 50: Hoare triple {37933#true} assume !(0 == ~cond); {37933#true} is VALID [2022-04-28 03:12:40,371 INFO L290 TraceCheckUtils]: 51: Hoare triple {37933#true} assume true; {37933#true} is VALID [2022-04-28 03:12:40,371 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {37933#true} {37956#(<= 2 main_~j~0)} #114#return; {37956#(<= 2 main_~j~0)} is VALID [2022-04-28 03:12:40,371 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-28 03:12:40,371 INFO L290 TraceCheckUtils]: 54: Hoare triple {37933#true} ~cond := #in~cond; {37933#true} is VALID [2022-04-28 03:12:40,371 INFO L290 TraceCheckUtils]: 55: Hoare triple {37933#true} assume !(0 == ~cond); {37933#true} is VALID [2022-04-28 03:12:40,371 INFO L290 TraceCheckUtils]: 56: Hoare triple {37933#true} assume true; {37933#true} is VALID [2022-04-28 03:12:40,372 INFO L284 TraceCheckUtils]: 57: Hoare quadruple {37933#true} {37956#(<= 2 main_~j~0)} #116#return; {37956#(<= 2 main_~j~0)} is VALID [2022-04-28 03:12:40,372 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-28 03:12:40,372 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-28 03:12:40,372 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-28 03:12:40,372 INFO L290 TraceCheckUtils]: 61: Hoare triple {37933#true} ~cond := #in~cond; {37933#true} is VALID [2022-04-28 03:12:40,372 INFO L290 TraceCheckUtils]: 62: Hoare triple {37933#true} assume !(0 == ~cond); {37933#true} is VALID [2022-04-28 03:12:40,373 INFO L290 TraceCheckUtils]: 63: Hoare triple {37933#true} assume true; {37933#true} is VALID [2022-04-28 03:12:40,373 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {37933#true} {37956#(<= 2 main_~j~0)} #118#return; {37956#(<= 2 main_~j~0)} is VALID [2022-04-28 03:12:40,373 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-28 03:12:40,373 INFO L290 TraceCheckUtils]: 66: Hoare triple {37933#true} ~cond := #in~cond; {37933#true} is VALID [2022-04-28 03:12:40,373 INFO L290 TraceCheckUtils]: 67: Hoare triple {37933#true} assume !(0 == ~cond); {37933#true} is VALID [2022-04-28 03:12:40,373 INFO L290 TraceCheckUtils]: 68: Hoare triple {37933#true} assume true; {37933#true} is VALID [2022-04-28 03:12:40,373 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {37933#true} {37956#(<= 2 main_~j~0)} #120#return; {37956#(<= 2 main_~j~0)} is VALID [2022-04-28 03:12:40,374 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-28 03:12:40,374 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-28 03:12:40,374 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-28 03:12:40,374 INFO L290 TraceCheckUtils]: 73: Hoare triple {37933#true} ~cond := #in~cond; {37933#true} is VALID [2022-04-28 03:12:40,374 INFO L290 TraceCheckUtils]: 74: Hoare triple {37933#true} assume !(0 == ~cond); {37933#true} is VALID [2022-04-28 03:12:40,374 INFO L290 TraceCheckUtils]: 75: Hoare triple {37933#true} assume true; {37933#true} is VALID [2022-04-28 03:12:40,374 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {37933#true} {37956#(<= 2 main_~j~0)} #122#return; {37956#(<= 2 main_~j~0)} is VALID [2022-04-28 03:12:40,375 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-28 03:12:40,375 INFO L290 TraceCheckUtils]: 78: Hoare triple {37933#true} ~cond := #in~cond; {37933#true} is VALID [2022-04-28 03:12:40,375 INFO L290 TraceCheckUtils]: 79: Hoare triple {37933#true} assume !(0 == ~cond); {37933#true} is VALID [2022-04-28 03:12:40,375 INFO L290 TraceCheckUtils]: 80: Hoare triple {37933#true} assume true; {37933#true} is VALID [2022-04-28 03:12:40,375 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {37933#true} {37956#(<= 2 main_~j~0)} #124#return; {37956#(<= 2 main_~j~0)} is VALID [2022-04-28 03:12:40,375 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-28 03:12:40,375 INFO L290 TraceCheckUtils]: 83: Hoare triple {37933#true} ~cond := #in~cond; {37933#true} is VALID [2022-04-28 03:12:40,375 INFO L290 TraceCheckUtils]: 84: Hoare triple {37933#true} assume !(0 == ~cond); {37933#true} is VALID [2022-04-28 03:12:40,375 INFO L290 TraceCheckUtils]: 85: Hoare triple {37933#true} assume true; {37933#true} is VALID [2022-04-28 03:12:40,376 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {37933#true} {37956#(<= 2 main_~j~0)} #126#return; {37956#(<= 2 main_~j~0)} is VALID [2022-04-28 03:12:40,376 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-28 03:12:40,376 INFO L290 TraceCheckUtils]: 88: Hoare triple {37933#true} ~cond := #in~cond; {37933#true} is VALID [2022-04-28 03:12:40,376 INFO L290 TraceCheckUtils]: 89: Hoare triple {37933#true} assume !(0 == ~cond); {37933#true} is VALID [2022-04-28 03:12:40,376 INFO L290 TraceCheckUtils]: 90: Hoare triple {37933#true} assume true; {37933#true} is VALID [2022-04-28 03:12:40,376 INFO L284 TraceCheckUtils]: 91: Hoare quadruple {37933#true} {37956#(<= 2 main_~j~0)} #128#return; {37956#(<= 2 main_~j~0)} is VALID [2022-04-28 03:12:40,377 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-28 03:12:40,377 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-28 03:12:40,377 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-28 03:12:40,377 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-28 03:12:40,377 INFO L290 TraceCheckUtils]: 96: Hoare triple {37933#true} ~cond := #in~cond; {37933#true} is VALID [2022-04-28 03:12:40,377 INFO L290 TraceCheckUtils]: 97: Hoare triple {37933#true} assume !(0 == ~cond); {37933#true} is VALID [2022-04-28 03:12:40,377 INFO L290 TraceCheckUtils]: 98: Hoare triple {37933#true} assume true; {37933#true} is VALID [2022-04-28 03:12:40,378 INFO L284 TraceCheckUtils]: 99: Hoare quadruple {37933#true} {37997#(<= 2 main_~i~0)} #118#return; {37997#(<= 2 main_~i~0)} is VALID [2022-04-28 03:12:40,378 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-28 03:12:40,378 INFO L290 TraceCheckUtils]: 101: Hoare triple {37933#true} ~cond := #in~cond; {37933#true} is VALID [2022-04-28 03:12:40,378 INFO L290 TraceCheckUtils]: 102: Hoare triple {37933#true} assume !(0 == ~cond); {37933#true} is VALID [2022-04-28 03:12:40,378 INFO L290 TraceCheckUtils]: 103: Hoare triple {37933#true} assume true; {37933#true} is VALID [2022-04-28 03:12:40,378 INFO L284 TraceCheckUtils]: 104: Hoare quadruple {37933#true} {37997#(<= 2 main_~i~0)} #120#return; {37997#(<= 2 main_~i~0)} is VALID [2022-04-28 03:12:40,379 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-28 03:12:40,379 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-28 03:12:40,379 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-28 03:12:40,380 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-28 03:12:40,380 INFO L290 TraceCheckUtils]: 109: Hoare triple {38007#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {37934#false} is VALID [2022-04-28 03:12:40,380 INFO L290 TraceCheckUtils]: 110: Hoare triple {37934#false} assume !false; {37934#false} is VALID [2022-04-28 03:12:40,380 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-28 03:12:40,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:12:40,380 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [192856318] [2022-04-28 03:12:40,381 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [192856318] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:12:40,381 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1644624094] [2022-04-28 03:12:40,381 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 03:12:40,381 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:12:40,381 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:12:40,382 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-28 03:12:40,383 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-28 03:12:40,437 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 03:12:40,438 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 03:12:40,438 INFO L263 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-28 03:12:40,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:12:40,453 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:12:42,912 INFO L272 TraceCheckUtils]: 0: Hoare triple {37933#true} call ULTIMATE.init(); {37933#true} is VALID [2022-04-28 03:12:42,913 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-28 03:12:42,913 INFO L290 TraceCheckUtils]: 2: Hoare triple {37933#true} assume true; {37933#true} is VALID [2022-04-28 03:12:42,913 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {37933#true} {37933#true} #138#return; {37933#true} is VALID [2022-04-28 03:12:42,913 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-28 03:12:42,913 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-28 03:12:42,913 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-28 03:12:42,913 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-28 03:12:42,914 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-28 03:12:42,914 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-28 03:12:42,914 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-28 03:12:42,914 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-28 03:12:42,914 INFO L290 TraceCheckUtils]: 12: Hoare triple {37933#true} ~cond := #in~cond; {37933#true} is VALID [2022-04-28 03:12:42,915 INFO L290 TraceCheckUtils]: 13: Hoare triple {37933#true} assume !(0 == ~cond); {37933#true} is VALID [2022-04-28 03:12:42,915 INFO L290 TraceCheckUtils]: 14: Hoare triple {37933#true} assume true; {37933#true} is VALID [2022-04-28 03:12:42,915 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-28 03:12:42,915 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-28 03:12:42,915 INFO L290 TraceCheckUtils]: 17: Hoare triple {37933#true} ~cond := #in~cond; {37933#true} is VALID [2022-04-28 03:12:42,915 INFO L290 TraceCheckUtils]: 18: Hoare triple {37933#true} assume !(0 == ~cond); {37933#true} is VALID [2022-04-28 03:12:42,915 INFO L290 TraceCheckUtils]: 19: Hoare triple {37933#true} assume true; {37933#true} is VALID [2022-04-28 03:12:42,916 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-28 03:12:42,916 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-28 03:12:42,916 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-28 03:12:42,917 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-28 03:12:42,917 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-28 03:12:42,917 INFO L290 TraceCheckUtils]: 25: Hoare triple {37933#true} ~cond := #in~cond; {37933#true} is VALID [2022-04-28 03:12:42,917 INFO L290 TraceCheckUtils]: 26: Hoare triple {37933#true} assume !(0 == ~cond); {37933#true} is VALID [2022-04-28 03:12:42,917 INFO L290 TraceCheckUtils]: 27: Hoare triple {37933#true} assume true; {37933#true} is VALID [2022-04-28 03:12:42,917 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-28 03:12:42,917 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-28 03:12:42,917 INFO L290 TraceCheckUtils]: 30: Hoare triple {37933#true} ~cond := #in~cond; {37933#true} is VALID [2022-04-28 03:12:42,918 INFO L290 TraceCheckUtils]: 31: Hoare triple {37933#true} assume !(0 == ~cond); {37933#true} is VALID [2022-04-28 03:12:42,918 INFO L290 TraceCheckUtils]: 32: Hoare triple {37933#true} assume true; {37933#true} is VALID [2022-04-28 03:12:42,918 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-28 03:12:42,918 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-28 03:12:42,919 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-28 03:12:42,919 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-28 03:12:42,920 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-28 03:12:42,920 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-28 03:12:42,920 INFO L290 TraceCheckUtils]: 39: Hoare triple {37933#true} ~cond := #in~cond; {37933#true} is VALID [2022-04-28 03:12:42,920 INFO L290 TraceCheckUtils]: 40: Hoare triple {37933#true} assume !(0 == ~cond); {37933#true} is VALID [2022-04-28 03:12:42,920 INFO L290 TraceCheckUtils]: 41: Hoare triple {37933#true} assume true; {37933#true} is VALID [2022-04-28 03:12:42,920 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-28 03:12:42,920 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-28 03:12:42,921 INFO L290 TraceCheckUtils]: 44: Hoare triple {37933#true} ~cond := #in~cond; {37933#true} is VALID [2022-04-28 03:12:42,921 INFO L290 TraceCheckUtils]: 45: Hoare triple {37933#true} assume !(0 == ~cond); {37933#true} is VALID [2022-04-28 03:12:42,921 INFO L290 TraceCheckUtils]: 46: Hoare triple {37933#true} assume true; {37933#true} is VALID [2022-04-28 03:12:42,921 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-28 03:12:42,921 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-28 03:12:42,921 INFO L290 TraceCheckUtils]: 49: Hoare triple {37933#true} ~cond := #in~cond; {37933#true} is VALID [2022-04-28 03:12:42,921 INFO L290 TraceCheckUtils]: 50: Hoare triple {37933#true} assume !(0 == ~cond); {37933#true} is VALID [2022-04-28 03:12:42,921 INFO L290 TraceCheckUtils]: 51: Hoare triple {37933#true} assume true; {37933#true} is VALID [2022-04-28 03:12:42,922 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-28 03:12:42,922 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-28 03:12:42,922 INFO L290 TraceCheckUtils]: 54: Hoare triple {37933#true} ~cond := #in~cond; {37933#true} is VALID [2022-04-28 03:12:42,922 INFO L290 TraceCheckUtils]: 55: Hoare triple {37933#true} assume !(0 == ~cond); {37933#true} is VALID [2022-04-28 03:12:42,922 INFO L290 TraceCheckUtils]: 56: Hoare triple {37933#true} assume true; {37933#true} is VALID [2022-04-28 03:12:42,922 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-28 03:12:42,923 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-28 03:12:42,923 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-28 03:12:42,923 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-28 03:12:42,923 INFO L290 TraceCheckUtils]: 61: Hoare triple {37933#true} ~cond := #in~cond; {37933#true} is VALID [2022-04-28 03:12:42,923 INFO L290 TraceCheckUtils]: 62: Hoare triple {37933#true} assume !(0 == ~cond); {37933#true} is VALID [2022-04-28 03:12:42,923 INFO L290 TraceCheckUtils]: 63: Hoare triple {37933#true} assume true; {37933#true} is VALID [2022-04-28 03:12:42,924 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-28 03:12:42,924 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-28 03:12:42,924 INFO L290 TraceCheckUtils]: 66: Hoare triple {37933#true} ~cond := #in~cond; {37933#true} is VALID [2022-04-28 03:12:42,924 INFO L290 TraceCheckUtils]: 67: Hoare triple {37933#true} assume !(0 == ~cond); {37933#true} is VALID [2022-04-28 03:12:42,924 INFO L290 TraceCheckUtils]: 68: Hoare triple {37933#true} assume true; {37933#true} is VALID [2022-04-28 03:12:42,924 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-28 03:12:42,925 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-28 03:12:42,925 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-28 03:12:42,925 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-28 03:12:42,925 INFO L290 TraceCheckUtils]: 73: Hoare triple {37933#true} ~cond := #in~cond; {37933#true} is VALID [2022-04-28 03:12:42,925 INFO L290 TraceCheckUtils]: 74: Hoare triple {37933#true} assume !(0 == ~cond); {37933#true} is VALID [2022-04-28 03:12:42,925 INFO L290 TraceCheckUtils]: 75: Hoare triple {37933#true} assume true; {37933#true} is VALID [2022-04-28 03:12:42,926 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-28 03:12:42,926 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-28 03:12:42,926 INFO L290 TraceCheckUtils]: 78: Hoare triple {37933#true} ~cond := #in~cond; {37933#true} is VALID [2022-04-28 03:12:42,926 INFO L290 TraceCheckUtils]: 79: Hoare triple {37933#true} assume !(0 == ~cond); {37933#true} is VALID [2022-04-28 03:12:42,926 INFO L290 TraceCheckUtils]: 80: Hoare triple {37933#true} assume true; {37933#true} is VALID [2022-04-28 03:12:42,927 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-28 03:12:42,927 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-28 03:12:42,927 INFO L290 TraceCheckUtils]: 83: Hoare triple {37933#true} ~cond := #in~cond; {37933#true} is VALID [2022-04-28 03:12:42,927 INFO L290 TraceCheckUtils]: 84: Hoare triple {37933#true} assume !(0 == ~cond); {37933#true} is VALID [2022-04-28 03:12:42,927 INFO L290 TraceCheckUtils]: 85: Hoare triple {37933#true} assume true; {37933#true} is VALID [2022-04-28 03:12:42,927 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-28 03:12:42,927 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-28 03:12:42,927 INFO L290 TraceCheckUtils]: 88: Hoare triple {37933#true} ~cond := #in~cond; {37933#true} is VALID [2022-04-28 03:12:42,927 INFO L290 TraceCheckUtils]: 89: Hoare triple {37933#true} assume !(0 == ~cond); {37933#true} is VALID [2022-04-28 03:12:42,928 INFO L290 TraceCheckUtils]: 90: Hoare triple {37933#true} assume true; {37933#true} is VALID [2022-04-28 03:12:42,928 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-28 03:12:42,929 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-28 03:12:42,929 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-28 03:12:42,929 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-28 03:12:42,930 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-28 03:12:42,930 INFO L290 TraceCheckUtils]: 96: Hoare triple {37933#true} ~cond := #in~cond; {37933#true} is VALID [2022-04-28 03:12:42,930 INFO L290 TraceCheckUtils]: 97: Hoare triple {37933#true} assume !(0 == ~cond); {37933#true} is VALID [2022-04-28 03:12:42,930 INFO L290 TraceCheckUtils]: 98: Hoare triple {37933#true} assume true; {37933#true} is VALID [2022-04-28 03:12:42,930 INFO L284 TraceCheckUtils]: 99: Hoare quadruple {37933#true} {37997#(<= 2 main_~i~0)} #118#return; {37997#(<= 2 main_~i~0)} is VALID [2022-04-28 03:12:42,930 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-28 03:12:42,930 INFO L290 TraceCheckUtils]: 101: Hoare triple {37933#true} ~cond := #in~cond; {37933#true} is VALID [2022-04-28 03:12:42,930 INFO L290 TraceCheckUtils]: 102: Hoare triple {37933#true} assume !(0 == ~cond); {37933#true} is VALID [2022-04-28 03:12:42,930 INFO L290 TraceCheckUtils]: 103: Hoare triple {37933#true} assume true; {37933#true} is VALID [2022-04-28 03:12:42,931 INFO L284 TraceCheckUtils]: 104: Hoare quadruple {37933#true} {37997#(<= 2 main_~i~0)} #120#return; {37997#(<= 2 main_~i~0)} is VALID [2022-04-28 03:12:42,931 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-28 03:12:42,932 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-28 03:12:42,932 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-28 03:12:42,932 INFO L290 TraceCheckUtils]: 108: Hoare triple {38338#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {38342#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:12:42,933 INFO L290 TraceCheckUtils]: 109: Hoare triple {38342#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {37934#false} is VALID [2022-04-28 03:12:42,933 INFO L290 TraceCheckUtils]: 110: Hoare triple {37934#false} assume !false; {37934#false} is VALID [2022-04-28 03:12:42,933 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-28 03:12:42,933 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:12:44,023 INFO L290 TraceCheckUtils]: 110: Hoare triple {37934#false} assume !false; {37934#false} is VALID [2022-04-28 03:12:44,023 INFO L290 TraceCheckUtils]: 109: Hoare triple {38342#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {37934#false} is VALID [2022-04-28 03:12:44,024 INFO L290 TraceCheckUtils]: 108: Hoare triple {38338#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {38342#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:12:44,024 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-28 03:12:44,024 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-28 03:12:44,025 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-28 03:12:44,025 INFO L284 TraceCheckUtils]: 104: Hoare quadruple {37933#true} {38358#(<= 1 main_~i~0)} #120#return; {38358#(<= 1 main_~i~0)} is VALID [2022-04-28 03:12:44,025 INFO L290 TraceCheckUtils]: 103: Hoare triple {37933#true} assume true; {37933#true} is VALID [2022-04-28 03:12:44,025 INFO L290 TraceCheckUtils]: 102: Hoare triple {37933#true} assume !(0 == ~cond); {37933#true} is VALID [2022-04-28 03:12:44,025 INFO L290 TraceCheckUtils]: 101: Hoare triple {37933#true} ~cond := #in~cond; {37933#true} is VALID [2022-04-28 03:12:44,025 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-28 03:12:44,026 INFO L284 TraceCheckUtils]: 99: Hoare quadruple {37933#true} {38358#(<= 1 main_~i~0)} #118#return; {38358#(<= 1 main_~i~0)} is VALID [2022-04-28 03:12:44,026 INFO L290 TraceCheckUtils]: 98: Hoare triple {37933#true} assume true; {37933#true} is VALID [2022-04-28 03:12:44,026 INFO L290 TraceCheckUtils]: 97: Hoare triple {37933#true} assume !(0 == ~cond); {37933#true} is VALID [2022-04-28 03:12:44,026 INFO L290 TraceCheckUtils]: 96: Hoare triple {37933#true} ~cond := #in~cond; {37933#true} is VALID [2022-04-28 03:12:44,026 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-28 03:12:44,026 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-28 03:12:44,027 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-28 03:12:44,027 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-28 03:12:44,028 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-28 03:12:44,028 INFO L290 TraceCheckUtils]: 90: Hoare triple {37933#true} assume true; {37933#true} is VALID [2022-04-28 03:12:44,028 INFO L290 TraceCheckUtils]: 89: Hoare triple {37933#true} assume !(0 == ~cond); {37933#true} is VALID [2022-04-28 03:12:44,028 INFO L290 TraceCheckUtils]: 88: Hoare triple {37933#true} ~cond := #in~cond; {37933#true} is VALID [2022-04-28 03:12:44,028 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-28 03:12:44,028 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-28 03:12:44,028 INFO L290 TraceCheckUtils]: 85: Hoare triple {37933#true} assume true; {37933#true} is VALID [2022-04-28 03:12:44,028 INFO L290 TraceCheckUtils]: 84: Hoare triple {37933#true} assume !(0 == ~cond); {37933#true} is VALID [2022-04-28 03:12:44,029 INFO L290 TraceCheckUtils]: 83: Hoare triple {37933#true} ~cond := #in~cond; {37933#true} is VALID [2022-04-28 03:12:44,029 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-28 03:12:44,029 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-28 03:12:44,029 INFO L290 TraceCheckUtils]: 80: Hoare triple {37933#true} assume true; {37933#true} is VALID [2022-04-28 03:12:44,029 INFO L290 TraceCheckUtils]: 79: Hoare triple {37933#true} assume !(0 == ~cond); {37933#true} is VALID [2022-04-28 03:12:44,029 INFO L290 TraceCheckUtils]: 78: Hoare triple {37933#true} ~cond := #in~cond; {37933#true} is VALID [2022-04-28 03:12:44,029 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-28 03:12:44,030 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-28 03:12:44,030 INFO L290 TraceCheckUtils]: 75: Hoare triple {37933#true} assume true; {37933#true} is VALID [2022-04-28 03:12:44,030 INFO L290 TraceCheckUtils]: 74: Hoare triple {37933#true} assume !(0 == ~cond); {37933#true} is VALID [2022-04-28 03:12:44,030 INFO L290 TraceCheckUtils]: 73: Hoare triple {37933#true} ~cond := #in~cond; {37933#true} is VALID [2022-04-28 03:12:44,030 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-28 03:12:44,030 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-28 03:12:44,031 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-28 03:12:44,031 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-28 03:12:44,031 INFO L290 TraceCheckUtils]: 68: Hoare triple {37933#true} assume true; {37933#true} is VALID [2022-04-28 03:12:44,031 INFO L290 TraceCheckUtils]: 67: Hoare triple {37933#true} assume !(0 == ~cond); {37933#true} is VALID [2022-04-28 03:12:44,031 INFO L290 TraceCheckUtils]: 66: Hoare triple {37933#true} ~cond := #in~cond; {37933#true} is VALID [2022-04-28 03:12:44,031 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-28 03:12:44,032 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-28 03:12:44,032 INFO L290 TraceCheckUtils]: 63: Hoare triple {37933#true} assume true; {37933#true} is VALID [2022-04-28 03:12:44,032 INFO L290 TraceCheckUtils]: 62: Hoare triple {37933#true} assume !(0 == ~cond); {37933#true} is VALID [2022-04-28 03:12:44,032 INFO L290 TraceCheckUtils]: 61: Hoare triple {37933#true} ~cond := #in~cond; {37933#true} is VALID [2022-04-28 03:12:44,032 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-28 03:12:44,045 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-28 03:12:44,045 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-28 03:12:44,049 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-28 03:12:44,050 INFO L290 TraceCheckUtils]: 56: Hoare triple {37933#true} assume true; {37933#true} is VALID [2022-04-28 03:12:44,050 INFO L290 TraceCheckUtils]: 55: Hoare triple {37933#true} assume !(0 == ~cond); {37933#true} is VALID [2022-04-28 03:12:44,050 INFO L290 TraceCheckUtils]: 54: Hoare triple {37933#true} ~cond := #in~cond; {37933#true} is VALID [2022-04-28 03:12:44,050 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-28 03:12:44,050 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-28 03:12:44,050 INFO L290 TraceCheckUtils]: 51: Hoare triple {37933#true} assume true; {37933#true} is VALID [2022-04-28 03:12:44,050 INFO L290 TraceCheckUtils]: 50: Hoare triple {37933#true} assume !(0 == ~cond); {37933#true} is VALID [2022-04-28 03:12:44,050 INFO L290 TraceCheckUtils]: 49: Hoare triple {37933#true} ~cond := #in~cond; {37933#true} is VALID [2022-04-28 03:12:44,050 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-28 03:12:44,051 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-28 03:12:44,051 INFO L290 TraceCheckUtils]: 46: Hoare triple {37933#true} assume true; {37933#true} is VALID [2022-04-28 03:12:44,051 INFO L290 TraceCheckUtils]: 45: Hoare triple {37933#true} assume !(0 == ~cond); {37933#true} is VALID [2022-04-28 03:12:44,051 INFO L290 TraceCheckUtils]: 44: Hoare triple {37933#true} ~cond := #in~cond; {37933#true} is VALID [2022-04-28 03:12:44,051 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-28 03:12:44,052 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-28 03:12:44,052 INFO L290 TraceCheckUtils]: 41: Hoare triple {37933#true} assume true; {37933#true} is VALID [2022-04-28 03:12:44,052 INFO L290 TraceCheckUtils]: 40: Hoare triple {37933#true} assume !(0 == ~cond); {37933#true} is VALID [2022-04-28 03:12:44,052 INFO L290 TraceCheckUtils]: 39: Hoare triple {37933#true} ~cond := #in~cond; {37933#true} is VALID [2022-04-28 03:12:44,052 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-28 03:12:44,052 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-28 03:12:44,053 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-28 03:12:44,053 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-28 03:12:44,054 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-28 03:12:44,054 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-28 03:12:44,054 INFO L290 TraceCheckUtils]: 32: Hoare triple {37933#true} assume true; {37933#true} is VALID [2022-04-28 03:12:44,054 INFO L290 TraceCheckUtils]: 31: Hoare triple {37933#true} assume !(0 == ~cond); {37933#true} is VALID [2022-04-28 03:12:44,054 INFO L290 TraceCheckUtils]: 30: Hoare triple {37933#true} ~cond := #in~cond; {37933#true} is VALID [2022-04-28 03:12:44,054 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-28 03:12:44,055 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-28 03:12:44,055 INFO L290 TraceCheckUtils]: 27: Hoare triple {37933#true} assume true; {37933#true} is VALID [2022-04-28 03:12:44,055 INFO L290 TraceCheckUtils]: 26: Hoare triple {37933#true} assume !(0 == ~cond); {37933#true} is VALID [2022-04-28 03:12:44,055 INFO L290 TraceCheckUtils]: 25: Hoare triple {37933#true} ~cond := #in~cond; {37933#true} is VALID [2022-04-28 03:12:44,055 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-28 03:12:44,055 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-28 03:12:44,056 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-28 03:12:44,056 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-28 03:12:44,056 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-28 03:12:44,057 INFO L290 TraceCheckUtils]: 19: Hoare triple {37933#true} assume true; {37933#true} is VALID [2022-04-28 03:12:44,057 INFO L290 TraceCheckUtils]: 18: Hoare triple {37933#true} assume !(0 == ~cond); {37933#true} is VALID [2022-04-28 03:12:44,057 INFO L290 TraceCheckUtils]: 17: Hoare triple {37933#true} ~cond := #in~cond; {37933#true} is VALID [2022-04-28 03:12:44,057 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-28 03:12:44,057 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-28 03:12:44,058 INFO L290 TraceCheckUtils]: 14: Hoare triple {37933#true} assume true; {37933#true} is VALID [2022-04-28 03:12:44,058 INFO L290 TraceCheckUtils]: 13: Hoare triple {37933#true} assume !(0 == ~cond); {37933#true} is VALID [2022-04-28 03:12:44,058 INFO L290 TraceCheckUtils]: 12: Hoare triple {37933#true} ~cond := #in~cond; {37933#true} is VALID [2022-04-28 03:12:44,058 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-28 03:12:44,058 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-28 03:12:44,059 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-28 03:12:44,059 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-28 03:12:44,059 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-28 03:12:44,059 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-28 03:12:44,060 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-28 03:12:44,060 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-28 03:12:44,060 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {37933#true} {37933#true} #138#return; {37933#true} is VALID [2022-04-28 03:12:44,060 INFO L290 TraceCheckUtils]: 2: Hoare triple {37933#true} assume true; {37933#true} is VALID [2022-04-28 03:12:44,060 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-28 03:12:44,060 INFO L272 TraceCheckUtils]: 0: Hoare triple {37933#true} call ULTIMATE.init(); {37933#true} is VALID [2022-04-28 03:12:44,060 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-28 03:12:44,060 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1644624094] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:12:44,061 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:12:44,061 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 10] total 22 [2022-04-28 03:12:44,061 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:12:44,061 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1987360429] [2022-04-28 03:12:44,061 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1987360429] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:12:44,061 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:12:44,061 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-28 03:12:44,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [106239741] [2022-04-28 03:12:44,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:12:44,062 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-28 03:12:44,062 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:12:44,062 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-28 03:12:44,111 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-28 03:12:44,111 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-28 03:12:44,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:12:44,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-28 03:12:44,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=403, Unknown=0, NotChecked=0, Total=462 [2022-04-28 03:12:44,112 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-28 03:12:46,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:12:46,789 INFO L93 Difference]: Finished difference Result 323 states and 492 transitions. [2022-04-28 03:12:46,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-28 03:12:46,789 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-28 03:12:46,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:12:46,790 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-28 03:12:46,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 107 transitions. [2022-04-28 03:12:46,791 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-28 03:12:46,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 107 transitions. [2022-04-28 03:12:46,792 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 107 transitions. [2022-04-28 03:12: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-28 03:12:46,882 INFO L225 Difference]: With dead ends: 323 [2022-04-28 03:12:46,882 INFO L226 Difference]: Without dead ends: 321 [2022-04-28 03:12:46,882 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 273 GetRequests, 244 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=123, Invalid=747, Unknown=0, NotChecked=0, Total=870 [2022-04-28 03:12:46,883 INFO L413 NwaCegarLoop]: 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-28 03:12:46,883 INFO L414 NwaCegarLoop]: 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-28 03:12:46,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2022-04-28 03:12:48,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 242. [2022-04-28 03:12:48,124 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:12:48,125 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-28 03:12:48,131 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-28 03:12:48,131 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-28 03:12:48,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:12:48,138 INFO L93 Difference]: Finished difference Result 321 states and 490 transitions. [2022-04-28 03:12:48,138 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 490 transitions. [2022-04-28 03:12:48,138 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:12:48,138 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:12:48,139 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-28 03:12:48,139 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-28 03:12:48,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:12:48,145 INFO L93 Difference]: Finished difference Result 321 states and 490 transitions. [2022-04-28 03:12:48,145 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 490 transitions. [2022-04-28 03:12:48,146 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:12:48,146 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:12:48,146 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:12:48,146 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:12:48,146 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-28 03:12:48,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 357 transitions. [2022-04-28 03:12:48,151 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 357 transitions. Word has length 111 [2022-04-28 03:12:48,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:12:48,151 INFO L495 AbstractCegarLoop]: Abstraction has 242 states and 357 transitions. [2022-04-28 03:12:48,151 INFO L496 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-28 03:12:48,152 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 242 states and 357 transitions. [2022-04-28 03:12:48,683 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-28 03:12:48,683 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 357 transitions. [2022-04-28 03:12:48,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2022-04-28 03:12:48,684 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:12:48,684 INFO L195 NwaCegarLoop]: 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-28 03:12:48,700 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-28 03:12:48,885 WARN L477 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-28 03:12:48,885 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:12:48,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:12:48,885 INFO L85 PathProgramCache]: Analyzing trace with hash 1099325000, now seen corresponding path program 3 times [2022-04-28 03:12:48,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:12:48,885 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1336372379] [2022-04-28 03:12:48,886 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 03:12:48,886 INFO L85 PathProgramCache]: Analyzing trace with hash 1099325000, now seen corresponding path program 4 times [2022-04-28 03:12:48,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:12:48,886 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [77724506] [2022-04-28 03:12:48,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:12:48,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:12:48,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:12:48,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:12:48,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:12:48,973 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-28 03:12:48,973 INFO L290 TraceCheckUtils]: 1: Hoare triple {40477#true} assume true; {40477#true} is VALID [2022-04-28 03:12:48,973 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {40477#true} {40477#true} #138#return; {40477#true} is VALID [2022-04-28 03:12:48,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-28 03:12:48,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:12:48,977 INFO L290 TraceCheckUtils]: 0: Hoare triple {40477#true} ~cond := #in~cond; {40477#true} is VALID [2022-04-28 03:12:48,978 INFO L290 TraceCheckUtils]: 1: Hoare triple {40477#true} assume !(0 == ~cond); {40477#true} is VALID [2022-04-28 03:12:48,978 INFO L290 TraceCheckUtils]: 2: Hoare triple {40477#true} assume true; {40477#true} is VALID [2022-04-28 03:12:48,978 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-28 03:12:48,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-04-28 03:12:48,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:12:48,980 INFO L290 TraceCheckUtils]: 0: Hoare triple {40477#true} ~cond := #in~cond; {40477#true} is VALID [2022-04-28 03:12:48,980 INFO L290 TraceCheckUtils]: 1: Hoare triple {40477#true} assume !(0 == ~cond); {40477#true} is VALID [2022-04-28 03:12:48,981 INFO L290 TraceCheckUtils]: 2: Hoare triple {40477#true} assume true; {40477#true} is VALID [2022-04-28 03:12:48,981 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-28 03:12:48,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-04-28 03:12:48,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:12:48,983 INFO L290 TraceCheckUtils]: 0: Hoare triple {40477#true} ~cond := #in~cond; {40477#true} is VALID [2022-04-28 03:12:48,983 INFO L290 TraceCheckUtils]: 1: Hoare triple {40477#true} assume !(0 == ~cond); {40477#true} is VALID [2022-04-28 03:12:48,983 INFO L290 TraceCheckUtils]: 2: Hoare triple {40477#true} assume true; {40477#true} is VALID [2022-04-28 03:12:48,984 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-28 03:12:48,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-04-28 03:12:48,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:12:48,986 INFO L290 TraceCheckUtils]: 0: Hoare triple {40477#true} ~cond := #in~cond; {40477#true} is VALID [2022-04-28 03:12:48,986 INFO L290 TraceCheckUtils]: 1: Hoare triple {40477#true} assume !(0 == ~cond); {40477#true} is VALID [2022-04-28 03:12:48,986 INFO L290 TraceCheckUtils]: 2: Hoare triple {40477#true} assume true; {40477#true} is VALID [2022-04-28 03:12:48,986 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-28 03:12:48,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-04-28 03:12:48,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:12:48,989 INFO L290 TraceCheckUtils]: 0: Hoare triple {40477#true} ~cond := #in~cond; {40477#true} is VALID [2022-04-28 03:12:48,989 INFO L290 TraceCheckUtils]: 1: Hoare triple {40477#true} assume !(0 == ~cond); {40477#true} is VALID [2022-04-28 03:12:48,989 INFO L290 TraceCheckUtils]: 2: Hoare triple {40477#true} assume true; {40477#true} is VALID [2022-04-28 03:12:48,989 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-28 03:12:48,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-04-28 03:12:48,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:12:48,991 INFO L290 TraceCheckUtils]: 0: Hoare triple {40477#true} ~cond := #in~cond; {40477#true} is VALID [2022-04-28 03:12:48,992 INFO L290 TraceCheckUtils]: 1: Hoare triple {40477#true} assume !(0 == ~cond); {40477#true} is VALID [2022-04-28 03:12:48,992 INFO L290 TraceCheckUtils]: 2: Hoare triple {40477#true} assume true; {40477#true} is VALID [2022-04-28 03:12:48,992 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-28 03:12:48,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-04-28 03:12:48,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:12:48,997 INFO L290 TraceCheckUtils]: 0: Hoare triple {40477#true} ~cond := #in~cond; {40477#true} is VALID [2022-04-28 03:12:48,997 INFO L290 TraceCheckUtils]: 1: Hoare triple {40477#true} assume !(0 == ~cond); {40477#true} is VALID [2022-04-28 03:12:48,997 INFO L290 TraceCheckUtils]: 2: Hoare triple {40477#true} assume true; {40477#true} is VALID [2022-04-28 03:12:48,998 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-28 03:12:48,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-04-28 03:12:48,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:12:49,000 INFO L290 TraceCheckUtils]: 0: Hoare triple {40477#true} ~cond := #in~cond; {40477#true} is VALID [2022-04-28 03:12:49,000 INFO L290 TraceCheckUtils]: 1: Hoare triple {40477#true} assume !(0 == ~cond); {40477#true} is VALID [2022-04-28 03:12:49,000 INFO L290 TraceCheckUtils]: 2: Hoare triple {40477#true} assume true; {40477#true} is VALID [2022-04-28 03:12:49,000 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-28 03:12:49,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-04-28 03:12:49,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:12:49,002 INFO L290 TraceCheckUtils]: 0: Hoare triple {40477#true} ~cond := #in~cond; {40477#true} is VALID [2022-04-28 03:12:49,002 INFO L290 TraceCheckUtils]: 1: Hoare triple {40477#true} assume !(0 == ~cond); {40477#true} is VALID [2022-04-28 03:12:49,002 INFO L290 TraceCheckUtils]: 2: Hoare triple {40477#true} assume true; {40477#true} is VALID [2022-04-28 03:12:49,003 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-28 03:12:49,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-04-28 03:12:49,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:12:49,005 INFO L290 TraceCheckUtils]: 0: Hoare triple {40477#true} ~cond := #in~cond; {40477#true} is VALID [2022-04-28 03:12:49,005 INFO L290 TraceCheckUtils]: 1: Hoare triple {40477#true} assume !(0 == ~cond); {40477#true} is VALID [2022-04-28 03:12:49,005 INFO L290 TraceCheckUtils]: 2: Hoare triple {40477#true} assume true; {40477#true} is VALID [2022-04-28 03:12:49,005 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-28 03:12:49,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-04-28 03:12:49,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:12:49,007 INFO L290 TraceCheckUtils]: 0: Hoare triple {40477#true} ~cond := #in~cond; {40477#true} is VALID [2022-04-28 03:12:49,007 INFO L290 TraceCheckUtils]: 1: Hoare triple {40477#true} assume !(0 == ~cond); {40477#true} is VALID [2022-04-28 03:12:49,007 INFO L290 TraceCheckUtils]: 2: Hoare triple {40477#true} assume true; {40477#true} is VALID [2022-04-28 03:12:49,008 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-28 03:12:49,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-04-28 03:12:49,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:12:49,010 INFO L290 TraceCheckUtils]: 0: Hoare triple {40477#true} ~cond := #in~cond; {40477#true} is VALID [2022-04-28 03:12:49,010 INFO L290 TraceCheckUtils]: 1: Hoare triple {40477#true} assume !(0 == ~cond); {40477#true} is VALID [2022-04-28 03:12:49,010 INFO L290 TraceCheckUtils]: 2: Hoare triple {40477#true} assume true; {40477#true} is VALID [2022-04-28 03:12:49,010 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-28 03:12:49,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-04-28 03:12:49,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:12:49,012 INFO L290 TraceCheckUtils]: 0: Hoare triple {40477#true} ~cond := #in~cond; {40477#true} is VALID [2022-04-28 03:12:49,012 INFO L290 TraceCheckUtils]: 1: Hoare triple {40477#true} assume !(0 == ~cond); {40477#true} is VALID [2022-04-28 03:12:49,012 INFO L290 TraceCheckUtils]: 2: Hoare triple {40477#true} assume true; {40477#true} is VALID [2022-04-28 03:12:49,012 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-28 03:12:49,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-04-28 03:12:49,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:12:49,014 INFO L290 TraceCheckUtils]: 0: Hoare triple {40477#true} ~cond := #in~cond; {40477#true} is VALID [2022-04-28 03:12:49,014 INFO L290 TraceCheckUtils]: 1: Hoare triple {40477#true} assume !(0 == ~cond); {40477#true} is VALID [2022-04-28 03:12:49,015 INFO L290 TraceCheckUtils]: 2: Hoare triple {40477#true} assume true; {40477#true} is VALID [2022-04-28 03:12:49,015 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-28 03:12:49,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-04-28 03:12:49,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:12:49,017 INFO L290 TraceCheckUtils]: 0: Hoare triple {40477#true} ~cond := #in~cond; {40477#true} is VALID [2022-04-28 03:12:49,017 INFO L290 TraceCheckUtils]: 1: Hoare triple {40477#true} assume !(0 == ~cond); {40477#true} is VALID [2022-04-28 03:12:49,017 INFO L290 TraceCheckUtils]: 2: Hoare triple {40477#true} assume true; {40477#true} is VALID [2022-04-28 03:12:49,017 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {40477#true} {40478#false} #118#return; {40478#false} is VALID [2022-04-28 03:12:49,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-04-28 03:12:49,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:12:49,019 INFO L290 TraceCheckUtils]: 0: Hoare triple {40477#true} ~cond := #in~cond; {40477#true} is VALID [2022-04-28 03:12:49,019 INFO L290 TraceCheckUtils]: 1: Hoare triple {40477#true} assume !(0 == ~cond); {40477#true} is VALID [2022-04-28 03:12:49,019 INFO L290 TraceCheckUtils]: 2: Hoare triple {40477#true} assume true; {40477#true} is VALID [2022-04-28 03:12:49,019 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {40477#true} {40478#false} #120#return; {40478#false} is VALID [2022-04-28 03:12:49,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-04-28 03:12:49,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:12:49,021 INFO L290 TraceCheckUtils]: 0: Hoare triple {40477#true} ~cond := #in~cond; {40477#true} is VALID [2022-04-28 03:12:49,021 INFO L290 TraceCheckUtils]: 1: Hoare triple {40477#true} assume !(0 == ~cond); {40477#true} is VALID [2022-04-28 03:12:49,021 INFO L290 TraceCheckUtils]: 2: Hoare triple {40477#true} assume true; {40477#true} is VALID [2022-04-28 03:12:49,021 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {40477#true} {40478#false} #122#return; {40478#false} is VALID [2022-04-28 03:12:49,022 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-28 03:12:49,022 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-28 03:12:49,022 INFO L290 TraceCheckUtils]: 2: Hoare triple {40477#true} assume true; {40477#true} is VALID [2022-04-28 03:12:49,022 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {40477#true} {40477#true} #138#return; {40477#true} is VALID [2022-04-28 03:12:49,022 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-28 03:12:49,022 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-28 03:12:49,022 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-28 03:12:49,022 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-28 03:12:49,022 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-28 03:12:49,023 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-28 03:12:49,023 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-28 03:12:49,023 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-28 03:12:49,023 INFO L290 TraceCheckUtils]: 12: Hoare triple {40477#true} ~cond := #in~cond; {40477#true} is VALID [2022-04-28 03:12:49,023 INFO L290 TraceCheckUtils]: 13: Hoare triple {40477#true} assume !(0 == ~cond); {40477#true} is VALID [2022-04-28 03:12:49,023 INFO L290 TraceCheckUtils]: 14: Hoare triple {40477#true} assume true; {40477#true} is VALID [2022-04-28 03:12:49,024 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-28 03:12:49,024 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-28 03:12:49,024 INFO L290 TraceCheckUtils]: 17: Hoare triple {40477#true} ~cond := #in~cond; {40477#true} is VALID [2022-04-28 03:12:49,024 INFO L290 TraceCheckUtils]: 18: Hoare triple {40477#true} assume !(0 == ~cond); {40477#true} is VALID [2022-04-28 03:12:49,024 INFO L290 TraceCheckUtils]: 19: Hoare triple {40477#true} assume true; {40477#true} is VALID [2022-04-28 03:12:49,025 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-28 03:12:49,025 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-28 03:12:49,025 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-28 03:12:49,025 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-28 03:12:49,026 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-28 03:12:49,026 INFO L290 TraceCheckUtils]: 25: Hoare triple {40477#true} ~cond := #in~cond; {40477#true} is VALID [2022-04-28 03:12:49,026 INFO L290 TraceCheckUtils]: 26: Hoare triple {40477#true} assume !(0 == ~cond); {40477#true} is VALID [2022-04-28 03:12:49,026 INFO L290 TraceCheckUtils]: 27: Hoare triple {40477#true} assume true; {40477#true} is VALID [2022-04-28 03:12:49,026 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-28 03:12:49,026 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-28 03:12:49,026 INFO L290 TraceCheckUtils]: 30: Hoare triple {40477#true} ~cond := #in~cond; {40477#true} is VALID [2022-04-28 03:12:49,026 INFO L290 TraceCheckUtils]: 31: Hoare triple {40477#true} assume !(0 == ~cond); {40477#true} is VALID [2022-04-28 03:12:49,026 INFO L290 TraceCheckUtils]: 32: Hoare triple {40477#true} assume true; {40477#true} is VALID [2022-04-28 03:12:49,027 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-28 03:12:49,027 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-28 03:12:49,028 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-28 03:12:49,028 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-28 03:12:49,028 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-28 03:12:49,028 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-28 03:12:49,028 INFO L290 TraceCheckUtils]: 39: Hoare triple {40477#true} ~cond := #in~cond; {40477#true} is VALID [2022-04-28 03:12:49,028 INFO L290 TraceCheckUtils]: 40: Hoare triple {40477#true} assume !(0 == ~cond); {40477#true} is VALID [2022-04-28 03:12:49,028 INFO L290 TraceCheckUtils]: 41: Hoare triple {40477#true} assume true; {40477#true} is VALID [2022-04-28 03:12:49,030 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-28 03:12:49,030 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-28 03:12:49,030 INFO L290 TraceCheckUtils]: 44: Hoare triple {40477#true} ~cond := #in~cond; {40477#true} is VALID [2022-04-28 03:12:49,030 INFO L290 TraceCheckUtils]: 45: Hoare triple {40477#true} assume !(0 == ~cond); {40477#true} is VALID [2022-04-28 03:12:49,030 INFO L290 TraceCheckUtils]: 46: Hoare triple {40477#true} assume true; {40477#true} is VALID [2022-04-28 03:12:49,030 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-28 03:12:49,030 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-28 03:12:49,031 INFO L290 TraceCheckUtils]: 49: Hoare triple {40477#true} ~cond := #in~cond; {40477#true} is VALID [2022-04-28 03:12:49,031 INFO L290 TraceCheckUtils]: 50: Hoare triple {40477#true} assume !(0 == ~cond); {40477#true} is VALID [2022-04-28 03:12:49,031 INFO L290 TraceCheckUtils]: 51: Hoare triple {40477#true} assume true; {40477#true} is VALID [2022-04-28 03:12:49,031 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-28 03:12:49,031 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-28 03:12:49,031 INFO L290 TraceCheckUtils]: 54: Hoare triple {40477#true} ~cond := #in~cond; {40477#true} is VALID [2022-04-28 03:12:49,031 INFO L290 TraceCheckUtils]: 55: Hoare triple {40477#true} assume !(0 == ~cond); {40477#true} is VALID [2022-04-28 03:12:49,031 INFO L290 TraceCheckUtils]: 56: Hoare triple {40477#true} assume true; {40477#true} is VALID [2022-04-28 03:12:49,032 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-28 03:12:49,032 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-28 03:12:49,032 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-28 03:12:49,033 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-28 03:12:49,033 INFO L290 TraceCheckUtils]: 61: Hoare triple {40477#true} ~cond := #in~cond; {40477#true} is VALID [2022-04-28 03:12:49,033 INFO L290 TraceCheckUtils]: 62: Hoare triple {40477#true} assume !(0 == ~cond); {40477#true} is VALID [2022-04-28 03:12:49,033 INFO L290 TraceCheckUtils]: 63: Hoare triple {40477#true} assume true; {40477#true} is VALID [2022-04-28 03:12:49,033 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-28 03:12:49,033 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-28 03:12:49,033 INFO L290 TraceCheckUtils]: 66: Hoare triple {40477#true} ~cond := #in~cond; {40477#true} is VALID [2022-04-28 03:12:49,033 INFO L290 TraceCheckUtils]: 67: Hoare triple {40477#true} assume !(0 == ~cond); {40477#true} is VALID [2022-04-28 03:12:49,033 INFO L290 TraceCheckUtils]: 68: Hoare triple {40477#true} assume true; {40477#true} is VALID [2022-04-28 03:12:49,034 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-28 03:12:49,034 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-28 03:12:49,034 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-28 03:12:49,034 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-28 03:12:49,034 INFO L290 TraceCheckUtils]: 73: Hoare triple {40477#true} ~cond := #in~cond; {40477#true} is VALID [2022-04-28 03:12:49,035 INFO L290 TraceCheckUtils]: 74: Hoare triple {40477#true} assume !(0 == ~cond); {40477#true} is VALID [2022-04-28 03:12:49,035 INFO L290 TraceCheckUtils]: 75: Hoare triple {40477#true} assume true; {40477#true} is VALID [2022-04-28 03:12:49,035 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-28 03:12:49,035 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-28 03:12:49,035 INFO L290 TraceCheckUtils]: 78: Hoare triple {40477#true} ~cond := #in~cond; {40477#true} is VALID [2022-04-28 03:12:49,035 INFO L290 TraceCheckUtils]: 79: Hoare triple {40477#true} assume !(0 == ~cond); {40477#true} is VALID [2022-04-28 03:12:49,035 INFO L290 TraceCheckUtils]: 80: Hoare triple {40477#true} assume true; {40477#true} is VALID [2022-04-28 03:12:49,036 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-28 03:12:49,036 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-28 03:12:49,036 INFO L290 TraceCheckUtils]: 83: Hoare triple {40477#true} ~cond := #in~cond; {40477#true} is VALID [2022-04-28 03:12:49,036 INFO L290 TraceCheckUtils]: 84: Hoare triple {40477#true} assume !(0 == ~cond); {40477#true} is VALID [2022-04-28 03:12:49,036 INFO L290 TraceCheckUtils]: 85: Hoare triple {40477#true} assume true; {40477#true} is VALID [2022-04-28 03:12:49,036 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-28 03:12:49,036 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-28 03:12:49,036 INFO L290 TraceCheckUtils]: 88: Hoare triple {40477#true} ~cond := #in~cond; {40477#true} is VALID [2022-04-28 03:12:49,036 INFO L290 TraceCheckUtils]: 89: Hoare triple {40477#true} assume !(0 == ~cond); {40477#true} is VALID [2022-04-28 03:12:49,036 INFO L290 TraceCheckUtils]: 90: Hoare triple {40477#true} assume true; {40477#true} is VALID [2022-04-28 03:12:49,037 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-28 03:12:49,037 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-28 03:12:49,038 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-28 03:12:49,038 INFO L290 TraceCheckUtils]: 94: Hoare triple {40478#false} assume !(~j~0 < ~r~0); {40478#false} is VALID [2022-04-28 03:12:49,038 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-28 03:12:49,038 INFO L290 TraceCheckUtils]: 96: Hoare triple {40477#true} ~cond := #in~cond; {40477#true} is VALID [2022-04-28 03:12:49,038 INFO L290 TraceCheckUtils]: 97: Hoare triple {40477#true} assume !(0 == ~cond); {40477#true} is VALID [2022-04-28 03:12:49,038 INFO L290 TraceCheckUtils]: 98: Hoare triple {40477#true} assume true; {40477#true} is VALID [2022-04-28 03:12:49,038 INFO L284 TraceCheckUtils]: 99: Hoare quadruple {40477#true} {40478#false} #118#return; {40478#false} is VALID [2022-04-28 03:12:49,038 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-28 03:12:49,038 INFO L290 TraceCheckUtils]: 101: Hoare triple {40477#true} ~cond := #in~cond; {40477#true} is VALID [2022-04-28 03:12:49,038 INFO L290 TraceCheckUtils]: 102: Hoare triple {40477#true} assume !(0 == ~cond); {40477#true} is VALID [2022-04-28 03:12:49,038 INFO L290 TraceCheckUtils]: 103: Hoare triple {40477#true} assume true; {40477#true} is VALID [2022-04-28 03:12:49,038 INFO L284 TraceCheckUtils]: 104: Hoare quadruple {40477#true} {40478#false} #120#return; {40478#false} is VALID [2022-04-28 03:12:49,038 INFO L290 TraceCheckUtils]: 105: Hoare triple {40478#false} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {40478#false} is VALID [2022-04-28 03:12:49,039 INFO L290 TraceCheckUtils]: 106: Hoare triple {40478#false} assume !(0 != #t~nondet5);havoc #t~nondet5; {40478#false} is VALID [2022-04-28 03:12:49,039 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-28 03:12:49,039 INFO L290 TraceCheckUtils]: 108: Hoare triple {40477#true} ~cond := #in~cond; {40477#true} is VALID [2022-04-28 03:12:49,039 INFO L290 TraceCheckUtils]: 109: Hoare triple {40477#true} assume !(0 == ~cond); {40477#true} is VALID [2022-04-28 03:12:49,039 INFO L290 TraceCheckUtils]: 110: Hoare triple {40477#true} assume true; {40477#true} is VALID [2022-04-28 03:12:49,039 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {40477#true} {40478#false} #122#return; {40478#false} is VALID [2022-04-28 03:12:49,039 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-28 03:12:49,039 INFO L290 TraceCheckUtils]: 113: Hoare triple {40478#false} ~cond := #in~cond; {40478#false} is VALID [2022-04-28 03:12:49,039 INFO L290 TraceCheckUtils]: 114: Hoare triple {40478#false} assume 0 == ~cond; {40478#false} is VALID [2022-04-28 03:12:49,039 INFO L290 TraceCheckUtils]: 115: Hoare triple {40478#false} assume !false; {40478#false} is VALID [2022-04-28 03:12:49,040 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-28 03:12:49,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:12:49,040 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [77724506] [2022-04-28 03:12:49,040 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [77724506] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:12:49,040 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [350441118] [2022-04-28 03:12:49,040 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 03:12:49,040 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:12:49,040 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:12:49,041 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-28 03:12:49,042 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-28 03:12:49,095 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 03:12:49,095 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 03:12:49,096 INFO L263 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-28 03:12:49,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:12:49,113 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:12:53,439 INFO L272 TraceCheckUtils]: 0: Hoare triple {40477#true} call ULTIMATE.init(); {40477#true} is VALID [2022-04-28 03:12:53,440 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-28 03:12:53,440 INFO L290 TraceCheckUtils]: 2: Hoare triple {40477#true} assume true; {40477#true} is VALID [2022-04-28 03:12:53,440 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {40477#true} {40477#true} #138#return; {40477#true} is VALID [2022-04-28 03:12:53,440 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-28 03:12:53,440 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-28 03:12:53,440 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-28 03:12:53,440 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-28 03:12:53,440 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-28 03:12:53,441 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-28 03:12:53,441 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-28 03:12:53,441 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-28 03:12:53,441 INFO L290 TraceCheckUtils]: 12: Hoare triple {40477#true} ~cond := #in~cond; {40477#true} is VALID [2022-04-28 03:12:53,441 INFO L290 TraceCheckUtils]: 13: Hoare triple {40477#true} assume !(0 == ~cond); {40477#true} is VALID [2022-04-28 03:12:53,442 INFO L290 TraceCheckUtils]: 14: Hoare triple {40477#true} assume true; {40477#true} is VALID [2022-04-28 03:12:53,442 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-28 03:12:53,442 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-28 03:12:53,442 INFO L290 TraceCheckUtils]: 17: Hoare triple {40477#true} ~cond := #in~cond; {40477#true} is VALID [2022-04-28 03:12:53,442 INFO L290 TraceCheckUtils]: 18: Hoare triple {40477#true} assume !(0 == ~cond); {40477#true} is VALID [2022-04-28 03:12:53,442 INFO L290 TraceCheckUtils]: 19: Hoare triple {40477#true} assume true; {40477#true} is VALID [2022-04-28 03:12:53,443 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-28 03:12:53,443 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-28 03:12:53,443 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-28 03:12:53,444 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-28 03:12:53,444 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-28 03:12:53,444 INFO L290 TraceCheckUtils]: 25: Hoare triple {40477#true} ~cond := #in~cond; {40477#true} is VALID [2022-04-28 03:12:53,444 INFO L290 TraceCheckUtils]: 26: Hoare triple {40477#true} assume !(0 == ~cond); {40477#true} is VALID [2022-04-28 03:12:53,444 INFO L290 TraceCheckUtils]: 27: Hoare triple {40477#true} assume true; {40477#true} is VALID [2022-04-28 03:12:53,444 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-28 03:12:53,444 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-28 03:12:53,444 INFO L290 TraceCheckUtils]: 30: Hoare triple {40477#true} ~cond := #in~cond; {40477#true} is VALID [2022-04-28 03:12:53,445 INFO L290 TraceCheckUtils]: 31: Hoare triple {40477#true} assume !(0 == ~cond); {40477#true} is VALID [2022-04-28 03:12:53,445 INFO L290 TraceCheckUtils]: 32: Hoare triple {40477#true} assume true; {40477#true} is VALID [2022-04-28 03:12:53,445 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-28 03:12:53,445 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-28 03:12:53,446 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-28 03:12:53,446 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-28 03:12:53,447 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-28 03:12:53,447 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-28 03:12:53,447 INFO L290 TraceCheckUtils]: 39: Hoare triple {40477#true} ~cond := #in~cond; {40477#true} is VALID [2022-04-28 03:12:53,447 INFO L290 TraceCheckUtils]: 40: Hoare triple {40477#true} assume !(0 == ~cond); {40477#true} is VALID [2022-04-28 03:12:53,447 INFO L290 TraceCheckUtils]: 41: Hoare triple {40477#true} assume true; {40477#true} is VALID [2022-04-28 03:12:53,448 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-28 03:12:53,448 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-28 03:12:53,448 INFO L290 TraceCheckUtils]: 44: Hoare triple {40477#true} ~cond := #in~cond; {40477#true} is VALID [2022-04-28 03:12:53,448 INFO L290 TraceCheckUtils]: 45: Hoare triple {40477#true} assume !(0 == ~cond); {40477#true} is VALID [2022-04-28 03:12:53,448 INFO L290 TraceCheckUtils]: 46: Hoare triple {40477#true} assume true; {40477#true} is VALID [2022-04-28 03:12:53,448 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-28 03:12:53,448 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-28 03:12:53,448 INFO L290 TraceCheckUtils]: 49: Hoare triple {40477#true} ~cond := #in~cond; {40477#true} is VALID [2022-04-28 03:12:53,448 INFO L290 TraceCheckUtils]: 50: Hoare triple {40477#true} assume !(0 == ~cond); {40477#true} is VALID [2022-04-28 03:12:53,449 INFO L290 TraceCheckUtils]: 51: Hoare triple {40477#true} assume true; {40477#true} is VALID [2022-04-28 03:12:53,449 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-28 03:12:53,449 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-28 03:12:53,449 INFO L290 TraceCheckUtils]: 54: Hoare triple {40477#true} ~cond := #in~cond; {40477#true} is VALID [2022-04-28 03:12:53,449 INFO L290 TraceCheckUtils]: 55: Hoare triple {40477#true} assume !(0 == ~cond); {40477#true} is VALID [2022-04-28 03:12:53,449 INFO L290 TraceCheckUtils]: 56: Hoare triple {40477#true} assume true; {40477#true} is VALID [2022-04-28 03:12:53,450 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-28 03:12:53,450 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-28 03:12:53,451 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-28 03:12:53,451 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-28 03:12:53,451 INFO L290 TraceCheckUtils]: 61: Hoare triple {40477#true} ~cond := #in~cond; {40477#true} is VALID [2022-04-28 03:12:53,451 INFO L290 TraceCheckUtils]: 62: Hoare triple {40477#true} assume !(0 == ~cond); {40477#true} is VALID [2022-04-28 03:12:53,451 INFO L290 TraceCheckUtils]: 63: Hoare triple {40477#true} assume true; {40477#true} is VALID [2022-04-28 03:12:53,451 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-28 03:12:53,451 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-28 03:12:53,451 INFO L290 TraceCheckUtils]: 66: Hoare triple {40477#true} ~cond := #in~cond; {40477#true} is VALID [2022-04-28 03:12:53,452 INFO L290 TraceCheckUtils]: 67: Hoare triple {40477#true} assume !(0 == ~cond); {40477#true} is VALID [2022-04-28 03:12:53,452 INFO L290 TraceCheckUtils]: 68: Hoare triple {40477#true} assume true; {40477#true} is VALID [2022-04-28 03:12:53,454 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-28 03:12:53,455 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-28 03:12:53,455 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-28 03:12:53,455 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-28 03:12:53,455 INFO L290 TraceCheckUtils]: 73: Hoare triple {40477#true} ~cond := #in~cond; {40477#true} is VALID [2022-04-28 03:12:53,456 INFO L290 TraceCheckUtils]: 74: Hoare triple {40477#true} assume !(0 == ~cond); {40477#true} is VALID [2022-04-28 03:12:53,456 INFO L290 TraceCheckUtils]: 75: Hoare triple {40477#true} assume true; {40477#true} is VALID [2022-04-28 03:12:53,456 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-28 03:12:53,456 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-28 03:12:53,456 INFO L290 TraceCheckUtils]: 78: Hoare triple {40477#true} ~cond := #in~cond; {40477#true} is VALID [2022-04-28 03:12:53,456 INFO L290 TraceCheckUtils]: 79: Hoare triple {40477#true} assume !(0 == ~cond); {40477#true} is VALID [2022-04-28 03:12:53,456 INFO L290 TraceCheckUtils]: 80: Hoare triple {40477#true} assume true; {40477#true} is VALID [2022-04-28 03:12:53,458 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-28 03:12:53,458 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-28 03:12:53,458 INFO L290 TraceCheckUtils]: 83: Hoare triple {40477#true} ~cond := #in~cond; {40477#true} is VALID [2022-04-28 03:12:53,458 INFO L290 TraceCheckUtils]: 84: Hoare triple {40477#true} assume !(0 == ~cond); {40477#true} is VALID [2022-04-28 03:12:53,458 INFO L290 TraceCheckUtils]: 85: Hoare triple {40477#true} assume true; {40477#true} is VALID [2022-04-28 03:12:53,458 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-28 03:12:53,458 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-28 03:12:53,458 INFO L290 TraceCheckUtils]: 88: Hoare triple {40477#true} ~cond := #in~cond; {40477#true} is VALID [2022-04-28 03:12:53,458 INFO L290 TraceCheckUtils]: 89: Hoare triple {40477#true} assume !(0 == ~cond); {40477#true} is VALID [2022-04-28 03:12:53,459 INFO L290 TraceCheckUtils]: 90: Hoare triple {40477#true} assume true; {40477#true} is VALID [2022-04-28 03:12:53,459 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-28 03:12:53,460 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-28 03:12:53,460 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-28 03:12:53,460 INFO L290 TraceCheckUtils]: 94: Hoare triple {40478#false} assume !(~j~0 < ~r~0); {40478#false} is VALID [2022-04-28 03:12:53,460 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-28 03:12:53,460 INFO L290 TraceCheckUtils]: 96: Hoare triple {40478#false} ~cond := #in~cond; {40478#false} is VALID [2022-04-28 03:12:53,461 INFO L290 TraceCheckUtils]: 97: Hoare triple {40478#false} assume !(0 == ~cond); {40478#false} is VALID [2022-04-28 03:12:53,461 INFO L290 TraceCheckUtils]: 98: Hoare triple {40478#false} assume true; {40478#false} is VALID [2022-04-28 03:12:53,461 INFO L284 TraceCheckUtils]: 99: Hoare quadruple {40478#false} {40478#false} #118#return; {40478#false} is VALID [2022-04-28 03:12:53,461 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-28 03:12:53,461 INFO L290 TraceCheckUtils]: 101: Hoare triple {40478#false} ~cond := #in~cond; {40478#false} is VALID [2022-04-28 03:12:53,461 INFO L290 TraceCheckUtils]: 102: Hoare triple {40478#false} assume !(0 == ~cond); {40478#false} is VALID [2022-04-28 03:12:53,461 INFO L290 TraceCheckUtils]: 103: Hoare triple {40478#false} assume true; {40478#false} is VALID [2022-04-28 03:12:53,461 INFO L284 TraceCheckUtils]: 104: Hoare quadruple {40478#false} {40478#false} #120#return; {40478#false} is VALID [2022-04-28 03:12:53,461 INFO L290 TraceCheckUtils]: 105: Hoare triple {40478#false} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {40478#false} is VALID [2022-04-28 03:12:53,461 INFO L290 TraceCheckUtils]: 106: Hoare triple {40478#false} assume !(0 != #t~nondet5);havoc #t~nondet5; {40478#false} is VALID [2022-04-28 03:12:53,461 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-28 03:12:53,461 INFO L290 TraceCheckUtils]: 108: Hoare triple {40478#false} ~cond := #in~cond; {40478#false} is VALID [2022-04-28 03:12:53,461 INFO L290 TraceCheckUtils]: 109: Hoare triple {40478#false} assume !(0 == ~cond); {40478#false} is VALID [2022-04-28 03:12:53,461 INFO L290 TraceCheckUtils]: 110: Hoare triple {40478#false} assume true; {40478#false} is VALID [2022-04-28 03:12:53,461 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {40478#false} {40478#false} #122#return; {40478#false} is VALID [2022-04-28 03:12:53,462 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-28 03:12:53,462 INFO L290 TraceCheckUtils]: 113: Hoare triple {40478#false} ~cond := #in~cond; {40478#false} is VALID [2022-04-28 03:12:53,462 INFO L290 TraceCheckUtils]: 114: Hoare triple {40478#false} assume 0 == ~cond; {40478#false} is VALID [2022-04-28 03:12:53,462 INFO L290 TraceCheckUtils]: 115: Hoare triple {40478#false} assume !false; {40478#false} is VALID [2022-04-28 03:12:53,462 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-28 03:12:53,462 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:12:54,177 INFO L290 TraceCheckUtils]: 115: Hoare triple {40478#false} assume !false; {40478#false} is VALID [2022-04-28 03:12:54,177 INFO L290 TraceCheckUtils]: 114: Hoare triple {40478#false} assume 0 == ~cond; {40478#false} is VALID [2022-04-28 03:12:54,177 INFO L290 TraceCheckUtils]: 113: Hoare triple {40478#false} ~cond := #in~cond; {40478#false} is VALID [2022-04-28 03:12:54,177 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-28 03:12:54,178 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {40477#true} {40478#false} #122#return; {40478#false} is VALID [2022-04-28 03:12:54,178 INFO L290 TraceCheckUtils]: 110: Hoare triple {40477#true} assume true; {40477#true} is VALID [2022-04-28 03:12:54,178 INFO L290 TraceCheckUtils]: 109: Hoare triple {40477#true} assume !(0 == ~cond); {40477#true} is VALID [2022-04-28 03:12:54,178 INFO L290 TraceCheckUtils]: 108: Hoare triple {40477#true} ~cond := #in~cond; {40477#true} is VALID [2022-04-28 03:12:54,178 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-28 03:12:54,178 INFO L290 TraceCheckUtils]: 106: Hoare triple {40478#false} assume !(0 != #t~nondet5);havoc #t~nondet5; {40478#false} is VALID [2022-04-28 03:12:54,178 INFO L290 TraceCheckUtils]: 105: Hoare triple {40478#false} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {40478#false} is VALID [2022-04-28 03:12:54,178 INFO L284 TraceCheckUtils]: 104: Hoare quadruple {40477#true} {40478#false} #120#return; {40478#false} is VALID [2022-04-28 03:12:54,178 INFO L290 TraceCheckUtils]: 103: Hoare triple {40477#true} assume true; {40477#true} is VALID [2022-04-28 03:12:54,178 INFO L290 TraceCheckUtils]: 102: Hoare triple {40477#true} assume !(0 == ~cond); {40477#true} is VALID [2022-04-28 03:12:54,178 INFO L290 TraceCheckUtils]: 101: Hoare triple {40477#true} ~cond := #in~cond; {40477#true} is VALID [2022-04-28 03:12:54,178 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-28 03:12:54,178 INFO L284 TraceCheckUtils]: 99: Hoare quadruple {40477#true} {40478#false} #118#return; {40478#false} is VALID [2022-04-28 03:12:54,178 INFO L290 TraceCheckUtils]: 98: Hoare triple {40477#true} assume true; {40477#true} is VALID [2022-04-28 03:12:54,179 INFO L290 TraceCheckUtils]: 97: Hoare triple {40477#true} assume !(0 == ~cond); {40477#true} is VALID [2022-04-28 03:12:54,179 INFO L290 TraceCheckUtils]: 96: Hoare triple {40477#true} ~cond := #in~cond; {40477#true} is VALID [2022-04-28 03:12:54,179 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-28 03:12:54,179 INFO L290 TraceCheckUtils]: 94: Hoare triple {40478#false} assume !(~j~0 < ~r~0); {40478#false} is VALID [2022-04-28 03:12:54,179 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-28 03:12:54,179 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-28 03:12:54,180 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-28 03:12:54,180 INFO L290 TraceCheckUtils]: 90: Hoare triple {40477#true} assume true; {40477#true} is VALID [2022-04-28 03:12:54,180 INFO L290 TraceCheckUtils]: 89: Hoare triple {40477#true} assume !(0 == ~cond); {40477#true} is VALID [2022-04-28 03:12:54,180 INFO L290 TraceCheckUtils]: 88: Hoare triple {40477#true} ~cond := #in~cond; {40477#true} is VALID [2022-04-28 03:12:54,180 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-28 03:12:54,181 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-28 03:12:54,181 INFO L290 TraceCheckUtils]: 85: Hoare triple {40477#true} assume true; {40477#true} is VALID [2022-04-28 03:12:54,181 INFO L290 TraceCheckUtils]: 84: Hoare triple {40477#true} assume !(0 == ~cond); {40477#true} is VALID [2022-04-28 03:12:54,181 INFO L290 TraceCheckUtils]: 83: Hoare triple {40477#true} ~cond := #in~cond; {40477#true} is VALID [2022-04-28 03:12:54,181 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-28 03:12:54,181 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-28 03:12:54,181 INFO L290 TraceCheckUtils]: 80: Hoare triple {40477#true} assume true; {40477#true} is VALID [2022-04-28 03:12:54,181 INFO L290 TraceCheckUtils]: 79: Hoare triple {40477#true} assume !(0 == ~cond); {40477#true} is VALID [2022-04-28 03:12:54,182 INFO L290 TraceCheckUtils]: 78: Hoare triple {40477#true} ~cond := #in~cond; {40477#true} is VALID [2022-04-28 03:12:54,182 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-28 03:12:54,182 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-28 03:12:54,182 INFO L290 TraceCheckUtils]: 75: Hoare triple {40477#true} assume true; {40477#true} is VALID [2022-04-28 03:12:54,182 INFO L290 TraceCheckUtils]: 74: Hoare triple {40477#true} assume !(0 == ~cond); {40477#true} is VALID [2022-04-28 03:12:54,182 INFO L290 TraceCheckUtils]: 73: Hoare triple {40477#true} ~cond := #in~cond; {40477#true} is VALID [2022-04-28 03:12:54,182 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-28 03:12:54,183 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-28 03:12:54,183 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-28 03:12:54,183 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-28 03:12:54,183 INFO L290 TraceCheckUtils]: 68: Hoare triple {40477#true} assume true; {40477#true} is VALID [2022-04-28 03:12:54,183 INFO L290 TraceCheckUtils]: 67: Hoare triple {40477#true} assume !(0 == ~cond); {40477#true} is VALID [2022-04-28 03:12:54,184 INFO L290 TraceCheckUtils]: 66: Hoare triple {40477#true} ~cond := #in~cond; {40477#true} is VALID [2022-04-28 03:12:54,184 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-28 03:12:54,184 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-28 03:12:54,184 INFO L290 TraceCheckUtils]: 63: Hoare triple {40477#true} assume true; {40477#true} is VALID [2022-04-28 03:12:54,184 INFO L290 TraceCheckUtils]: 62: Hoare triple {40477#true} assume !(0 == ~cond); {40477#true} is VALID [2022-04-28 03:12:54,184 INFO L290 TraceCheckUtils]: 61: Hoare triple {40477#true} ~cond := #in~cond; {40477#true} is VALID [2022-04-28 03:12:54,184 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-28 03:12:54,185 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-28 03:12:54,185 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-28 03:12:54,185 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-28 03:12:54,186 INFO L290 TraceCheckUtils]: 56: Hoare triple {40477#true} assume true; {40477#true} is VALID [2022-04-28 03:12:54,186 INFO L290 TraceCheckUtils]: 55: Hoare triple {40477#true} assume !(0 == ~cond); {40477#true} is VALID [2022-04-28 03:12:54,186 INFO L290 TraceCheckUtils]: 54: Hoare triple {40477#true} ~cond := #in~cond; {40477#true} is VALID [2022-04-28 03:12:54,186 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-28 03:12:54,186 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-28 03:12:54,186 INFO L290 TraceCheckUtils]: 51: Hoare triple {40477#true} assume true; {40477#true} is VALID [2022-04-28 03:12:54,186 INFO L290 TraceCheckUtils]: 50: Hoare triple {40477#true} assume !(0 == ~cond); {40477#true} is VALID [2022-04-28 03:12:54,186 INFO L290 TraceCheckUtils]: 49: Hoare triple {40477#true} ~cond := #in~cond; {40477#true} is VALID [2022-04-28 03:12:54,186 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-28 03:12:54,187 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-28 03:12:54,187 INFO L290 TraceCheckUtils]: 46: Hoare triple {40477#true} assume true; {40477#true} is VALID [2022-04-28 03:12:54,187 INFO L290 TraceCheckUtils]: 45: Hoare triple {40477#true} assume !(0 == ~cond); {40477#true} is VALID [2022-04-28 03:12:54,187 INFO L290 TraceCheckUtils]: 44: Hoare triple {40477#true} ~cond := #in~cond; {40477#true} is VALID [2022-04-28 03:12:54,187 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-28 03:12:54,188 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-28 03:12:54,188 INFO L290 TraceCheckUtils]: 41: Hoare triple {40477#true} assume true; {40477#true} is VALID [2022-04-28 03:12:54,188 INFO L290 TraceCheckUtils]: 40: Hoare triple {40477#true} assume !(0 == ~cond); {40477#true} is VALID [2022-04-28 03:12:54,188 INFO L290 TraceCheckUtils]: 39: Hoare triple {40477#true} ~cond := #in~cond; {40477#true} is VALID [2022-04-28 03:12:54,188 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-28 03:12:54,188 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-28 03:12:54,188 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-28 03:12:54,189 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-28 03:12:54,189 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-28 03:12:54,190 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-28 03:12:54,190 INFO L290 TraceCheckUtils]: 32: Hoare triple {40477#true} assume true; {40477#true} is VALID [2022-04-28 03:12:54,190 INFO L290 TraceCheckUtils]: 31: Hoare triple {40477#true} assume !(0 == ~cond); {40477#true} is VALID [2022-04-28 03:12:54,190 INFO L290 TraceCheckUtils]: 30: Hoare triple {40477#true} ~cond := #in~cond; {40477#true} is VALID [2022-04-28 03:12:54,190 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-28 03:12:54,191 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-28 03:12:54,191 INFO L290 TraceCheckUtils]: 27: Hoare triple {40477#true} assume true; {40477#true} is VALID [2022-04-28 03:12:54,191 INFO L290 TraceCheckUtils]: 26: Hoare triple {40477#true} assume !(0 == ~cond); {40477#true} is VALID [2022-04-28 03:12:54,191 INFO L290 TraceCheckUtils]: 25: Hoare triple {40477#true} ~cond := #in~cond; {40477#true} is VALID [2022-04-28 03:12:54,191 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-28 03:12:54,191 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-28 03:12:54,192 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-28 03:12:54,192 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-28 03:12:54,192 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-28 03:12:54,193 INFO L290 TraceCheckUtils]: 19: Hoare triple {40477#true} assume true; {40477#true} is VALID [2022-04-28 03:12:54,193 INFO L290 TraceCheckUtils]: 18: Hoare triple {40477#true} assume !(0 == ~cond); {40477#true} is VALID [2022-04-28 03:12:54,193 INFO L290 TraceCheckUtils]: 17: Hoare triple {40477#true} ~cond := #in~cond; {40477#true} is VALID [2022-04-28 03:12:54,193 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-28 03:12:54,193 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-28 03:12:54,193 INFO L290 TraceCheckUtils]: 14: Hoare triple {40477#true} assume true; {40477#true} is VALID [2022-04-28 03:12:54,193 INFO L290 TraceCheckUtils]: 13: Hoare triple {40477#true} assume !(0 == ~cond); {40477#true} is VALID [2022-04-28 03:12:54,193 INFO L290 TraceCheckUtils]: 12: Hoare triple {40477#true} ~cond := #in~cond; {40477#true} is VALID [2022-04-28 03:12:54,193 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-28 03:12:54,194 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-28 03:12:54,194 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-28 03:12:54,195 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-28 03:12:54,195 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-28 03:12:54,195 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-28 03:12:54,195 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-28 03:12:54,195 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-28 03:12:54,195 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {40477#true} {40477#true} #138#return; {40477#true} is VALID [2022-04-28 03:12:54,195 INFO L290 TraceCheckUtils]: 2: Hoare triple {40477#true} assume true; {40477#true} is VALID [2022-04-28 03:12:54,195 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-28 03:12:54,195 INFO L272 TraceCheckUtils]: 0: Hoare triple {40477#true} call ULTIMATE.init(); {40477#true} is VALID [2022-04-28 03:12:54,196 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-28 03:12:54,196 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [350441118] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:12:54,196 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:12:54,196 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 22 [2022-04-28 03:12:54,196 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:12:54,196 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1336372379] [2022-04-28 03:12:54,196 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1336372379] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:12:54,196 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:12:54,197 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-28 03:12:54,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1033288040] [2022-04-28 03:12:54,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:12:54,197 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-28 03:12:54,197 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:12:54,197 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-28 03:12:54,243 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-28 03:12:54,243 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-28 03:12:54,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:12:54,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-28 03:12:54,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=380, Unknown=0, NotChecked=0, Total=462 [2022-04-28 03:12:54,244 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-28 03:13:01,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:13:01,896 INFO L93 Difference]: Finished difference Result 756 states and 1173 transitions. [2022-04-28 03:13:01,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-04-28 03:13:01,896 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-28 03:13:01,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:13:01,897 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-28 03:13:01,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 472 transitions. [2022-04-28 03:13:01,909 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-28 03:13:01,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 472 transitions. [2022-04-28 03:13:01,916 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 24 states and 472 transitions. [2022-04-28 03:13:02,304 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-28 03:13:02,315 INFO L225 Difference]: With dead ends: 756 [2022-04-28 03:13:02,315 INFO L226 Difference]: Without dead ends: 452 [2022-04-28 03:13:02,316 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 299 GetRequests, 258 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 414 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=357, Invalid=1449, Unknown=0, NotChecked=0, Total=1806 [2022-04-28 03:13:02,316 INFO L413 NwaCegarLoop]: 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-28 03:13:02,316 INFO L414 NwaCegarLoop]: 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-28 03:13:02,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 452 states. [2022-04-28 03:13:04,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 452 to 364. [2022-04-28 03:13:04,568 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:13:04,568 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-28 03:13:04,575 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-28 03:13:04,575 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-28 03:13:04,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:13:04,587 INFO L93 Difference]: Finished difference Result 452 states and 699 transitions. [2022-04-28 03:13:04,587 INFO L276 IsEmpty]: Start isEmpty. Operand 452 states and 699 transitions. [2022-04-28 03:13:04,588 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:13:04,588 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:13:04,588 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-28 03:13:04,589 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-28 03:13:04,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:13:04,600 INFO L93 Difference]: Finished difference Result 452 states and 699 transitions. [2022-04-28 03:13:04,600 INFO L276 IsEmpty]: Start isEmpty. Operand 452 states and 699 transitions. [2022-04-28 03:13:04,601 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:13:04,601 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:13:04,601 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:13:04,601 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:13:04,602 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-28 03:13:04,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 569 transitions. [2022-04-28 03:13:04,612 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 569 transitions. Word has length 116 [2022-04-28 03:13:04,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:13:04,612 INFO L495 AbstractCegarLoop]: Abstraction has 364 states and 569 transitions. [2022-04-28 03:13:04,612 INFO L496 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-28 03:13:04,612 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 364 states and 569 transitions. [2022-04-28 03:13:05,508 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-28 03:13:05,508 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 569 transitions. [2022-04-28 03:13:05,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2022-04-28 03:13:05,509 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:13:05,510 INFO L195 NwaCegarLoop]: 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-28 03:13:05,525 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-28 03:13:05,725 WARN L477 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-28 03:13:05,725 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:13:05,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:13:05,726 INFO L85 PathProgramCache]: Analyzing trace with hash -1934725046, now seen corresponding path program 3 times [2022-04-28 03:13:05,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:13:05,726 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [967131959] [2022-04-28 03:13:05,726 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 03:13:05,726 INFO L85 PathProgramCache]: Analyzing trace with hash -1934725046, now seen corresponding path program 4 times [2022-04-28 03:13:05,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:13:05,726 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534278457] [2022-04-28 03:13:05,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:13:05,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:13:05,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:13:05,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:13:05,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:13:05,807 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-28 03:13:05,807 INFO L290 TraceCheckUtils]: 1: Hoare triple {44453#true} assume true; {44453#true} is VALID [2022-04-28 03:13:05,807 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {44453#true} {44453#true} #138#return; {44453#true} is VALID [2022-04-28 03:13:05,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-28 03:13:05,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:13:05,809 INFO L290 TraceCheckUtils]: 0: Hoare triple {44453#true} ~cond := #in~cond; {44453#true} is VALID [2022-04-28 03:13:05,809 INFO L290 TraceCheckUtils]: 1: Hoare triple {44453#true} assume !(0 == ~cond); {44453#true} is VALID [2022-04-28 03:13:05,809 INFO L290 TraceCheckUtils]: 2: Hoare triple {44453#true} assume true; {44453#true} is VALID [2022-04-28 03:13:05,809 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-28 03:13:05,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-04-28 03:13:05,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:13:05,811 INFO L290 TraceCheckUtils]: 0: Hoare triple {44453#true} ~cond := #in~cond; {44453#true} is VALID [2022-04-28 03:13:05,811 INFO L290 TraceCheckUtils]: 1: Hoare triple {44453#true} assume !(0 == ~cond); {44453#true} is VALID [2022-04-28 03:13:05,811 INFO L290 TraceCheckUtils]: 2: Hoare triple {44453#true} assume true; {44453#true} is VALID [2022-04-28 03:13:05,812 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-28 03:13:05,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-04-28 03:13:05,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:13:05,813 INFO L290 TraceCheckUtils]: 0: Hoare triple {44453#true} ~cond := #in~cond; {44453#true} is VALID [2022-04-28 03:13:05,813 INFO L290 TraceCheckUtils]: 1: Hoare triple {44453#true} assume !(0 == ~cond); {44453#true} is VALID [2022-04-28 03:13:05,813 INFO L290 TraceCheckUtils]: 2: Hoare triple {44453#true} assume true; {44453#true} is VALID [2022-04-28 03:13:05,814 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-28 03:13:05,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-04-28 03:13:05,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:13:05,815 INFO L290 TraceCheckUtils]: 0: Hoare triple {44453#true} ~cond := #in~cond; {44453#true} is VALID [2022-04-28 03:13:05,816 INFO L290 TraceCheckUtils]: 1: Hoare triple {44453#true} assume !(0 == ~cond); {44453#true} is VALID [2022-04-28 03:13:05,816 INFO L290 TraceCheckUtils]: 2: Hoare triple {44453#true} assume true; {44453#true} is VALID [2022-04-28 03:13:05,816 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-28 03:13:05,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-04-28 03:13:05,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:13:05,819 INFO L290 TraceCheckUtils]: 0: Hoare triple {44453#true} ~cond := #in~cond; {44453#true} is VALID [2022-04-28 03:13:05,819 INFO L290 TraceCheckUtils]: 1: Hoare triple {44453#true} assume !(0 == ~cond); {44453#true} is VALID [2022-04-28 03:13:05,819 INFO L290 TraceCheckUtils]: 2: Hoare triple {44453#true} assume true; {44453#true} is VALID [2022-04-28 03:13:05,819 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-28 03:13:05,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-04-28 03:13:05,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:13:05,821 INFO L290 TraceCheckUtils]: 0: Hoare triple {44453#true} ~cond := #in~cond; {44453#true} is VALID [2022-04-28 03:13:05,821 INFO L290 TraceCheckUtils]: 1: Hoare triple {44453#true} assume !(0 == ~cond); {44453#true} is VALID [2022-04-28 03:13:05,821 INFO L290 TraceCheckUtils]: 2: Hoare triple {44453#true} assume true; {44453#true} is VALID [2022-04-28 03:13:05,821 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-28 03:13:05,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-04-28 03:13:05,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:13:05,823 INFO L290 TraceCheckUtils]: 0: Hoare triple {44453#true} ~cond := #in~cond; {44453#true} is VALID [2022-04-28 03:13:05,823 INFO L290 TraceCheckUtils]: 1: Hoare triple {44453#true} assume !(0 == ~cond); {44453#true} is VALID [2022-04-28 03:13:05,823 INFO L290 TraceCheckUtils]: 2: Hoare triple {44453#true} assume true; {44453#true} is VALID [2022-04-28 03:13:05,824 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-28 03:13:05,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-04-28 03:13:05,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:13:05,827 INFO L290 TraceCheckUtils]: 0: Hoare triple {44453#true} ~cond := #in~cond; {44453#true} is VALID [2022-04-28 03:13:05,827 INFO L290 TraceCheckUtils]: 1: Hoare triple {44453#true} assume !(0 == ~cond); {44453#true} is VALID [2022-04-28 03:13:05,827 INFO L290 TraceCheckUtils]: 2: Hoare triple {44453#true} assume true; {44453#true} is VALID [2022-04-28 03:13:05,827 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-28 03:13:05,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-04-28 03:13:05,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:13:05,829 INFO L290 TraceCheckUtils]: 0: Hoare triple {44453#true} ~cond := #in~cond; {44453#true} is VALID [2022-04-28 03:13:05,829 INFO L290 TraceCheckUtils]: 1: Hoare triple {44453#true} assume !(0 == ~cond); {44453#true} is VALID [2022-04-28 03:13:05,829 INFO L290 TraceCheckUtils]: 2: Hoare triple {44453#true} assume true; {44453#true} is VALID [2022-04-28 03:13:05,829 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-28 03:13:05,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-04-28 03:13:05,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:13:05,831 INFO L290 TraceCheckUtils]: 0: Hoare triple {44453#true} ~cond := #in~cond; {44453#true} is VALID [2022-04-28 03:13:05,831 INFO L290 TraceCheckUtils]: 1: Hoare triple {44453#true} assume !(0 == ~cond); {44453#true} is VALID [2022-04-28 03:13:05,831 INFO L290 TraceCheckUtils]: 2: Hoare triple {44453#true} assume true; {44453#true} is VALID [2022-04-28 03:13:05,832 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-28 03:13:05,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-04-28 03:13:05,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:13:05,833 INFO L290 TraceCheckUtils]: 0: Hoare triple {44453#true} ~cond := #in~cond; {44453#true} is VALID [2022-04-28 03:13:05,833 INFO L290 TraceCheckUtils]: 1: Hoare triple {44453#true} assume !(0 == ~cond); {44453#true} is VALID [2022-04-28 03:13:05,833 INFO L290 TraceCheckUtils]: 2: Hoare triple {44453#true} assume true; {44453#true} is VALID [2022-04-28 03:13:05,834 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-28 03:13:05,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-04-28 03:13:05,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:13:05,836 INFO L290 TraceCheckUtils]: 0: Hoare triple {44453#true} ~cond := #in~cond; {44453#true} is VALID [2022-04-28 03:13:05,836 INFO L290 TraceCheckUtils]: 1: Hoare triple {44453#true} assume !(0 == ~cond); {44453#true} is VALID [2022-04-28 03:13:05,836 INFO L290 TraceCheckUtils]: 2: Hoare triple {44453#true} assume true; {44453#true} is VALID [2022-04-28 03:13:05,836 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-28 03:13:05,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-04-28 03:13:05,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:13:05,838 INFO L290 TraceCheckUtils]: 0: Hoare triple {44453#true} ~cond := #in~cond; {44453#true} is VALID [2022-04-28 03:13:05,838 INFO L290 TraceCheckUtils]: 1: Hoare triple {44453#true} assume !(0 == ~cond); {44453#true} is VALID [2022-04-28 03:13:05,838 INFO L290 TraceCheckUtils]: 2: Hoare triple {44453#true} assume true; {44453#true} is VALID [2022-04-28 03:13:05,838 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-28 03:13:05,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-04-28 03:13:05,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:13:05,840 INFO L290 TraceCheckUtils]: 0: Hoare triple {44453#true} ~cond := #in~cond; {44453#true} is VALID [2022-04-28 03:13:05,840 INFO L290 TraceCheckUtils]: 1: Hoare triple {44453#true} assume !(0 == ~cond); {44453#true} is VALID [2022-04-28 03:13:05,840 INFO L290 TraceCheckUtils]: 2: Hoare triple {44453#true} assume true; {44453#true} is VALID [2022-04-28 03:13:05,840 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-28 03:13:05,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-04-28 03:13:05,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:13:05,842 INFO L290 TraceCheckUtils]: 0: Hoare triple {44453#true} ~cond := #in~cond; {44453#true} is VALID [2022-04-28 03:13:05,842 INFO L290 TraceCheckUtils]: 1: Hoare triple {44453#true} assume !(0 == ~cond); {44453#true} is VALID [2022-04-28 03:13:05,842 INFO L290 TraceCheckUtils]: 2: Hoare triple {44453#true} assume true; {44453#true} is VALID [2022-04-28 03:13:05,843 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-28 03:13:05,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-04-28 03:13:05,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:13:05,844 INFO L290 TraceCheckUtils]: 0: Hoare triple {44453#true} ~cond := #in~cond; {44453#true} is VALID [2022-04-28 03:13:05,844 INFO L290 TraceCheckUtils]: 1: Hoare triple {44453#true} assume !(0 == ~cond); {44453#true} is VALID [2022-04-28 03:13:05,844 INFO L290 TraceCheckUtils]: 2: Hoare triple {44453#true} assume true; {44453#true} is VALID [2022-04-28 03:13:05,845 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-28 03:13:05,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-04-28 03:13:05,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:13:05,847 INFO L290 TraceCheckUtils]: 0: Hoare triple {44453#true} ~cond := #in~cond; {44453#true} is VALID [2022-04-28 03:13:05,847 INFO L290 TraceCheckUtils]: 1: Hoare triple {44453#true} assume !(0 == ~cond); {44453#true} is VALID [2022-04-28 03:13:05,847 INFO L290 TraceCheckUtils]: 2: Hoare triple {44453#true} assume true; {44453#true} is VALID [2022-04-28 03:13:05,847 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-28 03:13:05,847 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-28 03:13:05,847 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-28 03:13:05,848 INFO L290 TraceCheckUtils]: 2: Hoare triple {44453#true} assume true; {44453#true} is VALID [2022-04-28 03:13:05,848 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {44453#true} {44453#true} #138#return; {44453#true} is VALID [2022-04-28 03:13:05,848 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-28 03:13:05,848 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-28 03:13:05,848 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-28 03:13:05,848 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-28 03:13:05,849 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-28 03:13:05,849 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-28 03:13:05,850 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-28 03:13:05,850 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-28 03:13:05,850 INFO L290 TraceCheckUtils]: 12: Hoare triple {44453#true} ~cond := #in~cond; {44453#true} is VALID [2022-04-28 03:13:05,850 INFO L290 TraceCheckUtils]: 13: Hoare triple {44453#true} assume !(0 == ~cond); {44453#true} is VALID [2022-04-28 03:13:05,850 INFO L290 TraceCheckUtils]: 14: Hoare triple {44453#true} assume true; {44453#true} is VALID [2022-04-28 03:13:05,850 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-28 03:13:05,850 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-28 03:13:05,850 INFO L290 TraceCheckUtils]: 17: Hoare triple {44453#true} ~cond := #in~cond; {44453#true} is VALID [2022-04-28 03:13:05,850 INFO L290 TraceCheckUtils]: 18: Hoare triple {44453#true} assume !(0 == ~cond); {44453#true} is VALID [2022-04-28 03:13:05,851 INFO L290 TraceCheckUtils]: 19: Hoare triple {44453#true} assume true; {44453#true} is VALID [2022-04-28 03:13:05,851 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-28 03:13:05,851 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-28 03:13:05,851 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-28 03:13:05,852 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-28 03:13:05,852 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-28 03:13:05,852 INFO L290 TraceCheckUtils]: 25: Hoare triple {44453#true} ~cond := #in~cond; {44453#true} is VALID [2022-04-28 03:13:05,852 INFO L290 TraceCheckUtils]: 26: Hoare triple {44453#true} assume !(0 == ~cond); {44453#true} is VALID [2022-04-28 03:13:05,852 INFO L290 TraceCheckUtils]: 27: Hoare triple {44453#true} assume true; {44453#true} is VALID [2022-04-28 03:13:05,852 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-28 03:13:05,852 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-28 03:13:05,852 INFO L290 TraceCheckUtils]: 30: Hoare triple {44453#true} ~cond := #in~cond; {44453#true} is VALID [2022-04-28 03:13:05,853 INFO L290 TraceCheckUtils]: 31: Hoare triple {44453#true} assume !(0 == ~cond); {44453#true} is VALID [2022-04-28 03:13:05,853 INFO L290 TraceCheckUtils]: 32: Hoare triple {44453#true} assume true; {44453#true} is VALID [2022-04-28 03:13:05,853 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-28 03:13:05,853 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-28 03:13:05,854 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-28 03:13:05,854 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-28 03:13:05,854 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-28 03:13:05,854 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-28 03:13:05,854 INFO L290 TraceCheckUtils]: 39: Hoare triple {44453#true} ~cond := #in~cond; {44453#true} is VALID [2022-04-28 03:13:05,854 INFO L290 TraceCheckUtils]: 40: Hoare triple {44453#true} assume !(0 == ~cond); {44453#true} is VALID [2022-04-28 03:13:05,855 INFO L290 TraceCheckUtils]: 41: Hoare triple {44453#true} assume true; {44453#true} is VALID [2022-04-28 03:13:05,855 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-28 03:13:05,855 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-28 03:13:05,855 INFO L290 TraceCheckUtils]: 44: Hoare triple {44453#true} ~cond := #in~cond; {44453#true} is VALID [2022-04-28 03:13:05,855 INFO L290 TraceCheckUtils]: 45: Hoare triple {44453#true} assume !(0 == ~cond); {44453#true} is VALID [2022-04-28 03:13:05,855 INFO L290 TraceCheckUtils]: 46: Hoare triple {44453#true} assume true; {44453#true} is VALID [2022-04-28 03:13:05,855 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-28 03:13:05,856 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-28 03:13:05,856 INFO L290 TraceCheckUtils]: 49: Hoare triple {44453#true} ~cond := #in~cond; {44453#true} is VALID [2022-04-28 03:13:05,856 INFO L290 TraceCheckUtils]: 50: Hoare triple {44453#true} assume !(0 == ~cond); {44453#true} is VALID [2022-04-28 03:13:05,856 INFO L290 TraceCheckUtils]: 51: Hoare triple {44453#true} assume true; {44453#true} is VALID [2022-04-28 03:13:05,856 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-28 03:13:05,856 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-28 03:13:05,856 INFO L290 TraceCheckUtils]: 54: Hoare triple {44453#true} ~cond := #in~cond; {44453#true} is VALID [2022-04-28 03:13:05,856 INFO L290 TraceCheckUtils]: 55: Hoare triple {44453#true} assume !(0 == ~cond); {44453#true} is VALID [2022-04-28 03:13:05,856 INFO L290 TraceCheckUtils]: 56: Hoare triple {44453#true} assume true; {44453#true} is VALID [2022-04-28 03:13:05,857 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-28 03:13:05,857 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-28 03:13:05,857 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-28 03:13:05,857 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-28 03:13:05,857 INFO L290 TraceCheckUtils]: 61: Hoare triple {44453#true} ~cond := #in~cond; {44453#true} is VALID [2022-04-28 03:13:05,857 INFO L290 TraceCheckUtils]: 62: Hoare triple {44453#true} assume !(0 == ~cond); {44453#true} is VALID [2022-04-28 03:13:05,858 INFO L290 TraceCheckUtils]: 63: Hoare triple {44453#true} assume true; {44453#true} is VALID [2022-04-28 03:13:05,858 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-28 03:13:05,858 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-28 03:13:05,858 INFO L290 TraceCheckUtils]: 66: Hoare triple {44453#true} ~cond := #in~cond; {44453#true} is VALID [2022-04-28 03:13:05,858 INFO L290 TraceCheckUtils]: 67: Hoare triple {44453#true} assume !(0 == ~cond); {44453#true} is VALID [2022-04-28 03:13:05,858 INFO L290 TraceCheckUtils]: 68: Hoare triple {44453#true} assume true; {44453#true} is VALID [2022-04-28 03:13:05,858 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-28 03:13:05,859 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-28 03:13:05,859 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-28 03:13:05,859 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-28 03:13:05,859 INFO L290 TraceCheckUtils]: 73: Hoare triple {44453#true} ~cond := #in~cond; {44453#true} is VALID [2022-04-28 03:13:05,859 INFO L290 TraceCheckUtils]: 74: Hoare triple {44453#true} assume !(0 == ~cond); {44453#true} is VALID [2022-04-28 03:13:05,859 INFO L290 TraceCheckUtils]: 75: Hoare triple {44453#true} assume true; {44453#true} is VALID [2022-04-28 03:13:05,860 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-28 03:13:05,860 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-28 03:13:05,860 INFO L290 TraceCheckUtils]: 78: Hoare triple {44453#true} ~cond := #in~cond; {44453#true} is VALID [2022-04-28 03:13:05,860 INFO L290 TraceCheckUtils]: 79: Hoare triple {44453#true} assume !(0 == ~cond); {44453#true} is VALID [2022-04-28 03:13:05,860 INFO L290 TraceCheckUtils]: 80: Hoare triple {44453#true} assume true; {44453#true} is VALID [2022-04-28 03:13:05,860 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-28 03:13:05,860 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-28 03:13:05,860 INFO L290 TraceCheckUtils]: 83: Hoare triple {44453#true} ~cond := #in~cond; {44453#true} is VALID [2022-04-28 03:13:05,860 INFO L290 TraceCheckUtils]: 84: Hoare triple {44453#true} assume !(0 == ~cond); {44453#true} is VALID [2022-04-28 03:13:05,861 INFO L290 TraceCheckUtils]: 85: Hoare triple {44453#true} assume true; {44453#true} is VALID [2022-04-28 03:13:05,861 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-28 03:13:05,861 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-28 03:13:05,861 INFO L290 TraceCheckUtils]: 88: Hoare triple {44453#true} ~cond := #in~cond; {44453#true} is VALID [2022-04-28 03:13:05,861 INFO L290 TraceCheckUtils]: 89: Hoare triple {44453#true} assume !(0 == ~cond); {44453#true} is VALID [2022-04-28 03:13:05,861 INFO L290 TraceCheckUtils]: 90: Hoare triple {44453#true} assume true; {44453#true} is VALID [2022-04-28 03:13:05,861 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-28 03:13:05,862 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-28 03:13:05,862 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-28 03:13:05,862 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-28 03:13:05,862 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-28 03:13:05,862 INFO L290 TraceCheckUtils]: 96: Hoare triple {44453#true} ~cond := #in~cond; {44453#true} is VALID [2022-04-28 03:13:05,862 INFO L290 TraceCheckUtils]: 97: Hoare triple {44453#true} assume !(0 == ~cond); {44453#true} is VALID [2022-04-28 03:13:05,862 INFO L290 TraceCheckUtils]: 98: Hoare triple {44453#true} assume true; {44453#true} is VALID [2022-04-28 03:13:05,863 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-28 03:13:05,863 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-28 03:13:05,863 INFO L290 TraceCheckUtils]: 101: Hoare triple {44453#true} ~cond := #in~cond; {44453#true} is VALID [2022-04-28 03:13:05,863 INFO L290 TraceCheckUtils]: 102: Hoare triple {44453#true} assume !(0 == ~cond); {44453#true} is VALID [2022-04-28 03:13:05,863 INFO L290 TraceCheckUtils]: 103: Hoare triple {44453#true} assume true; {44453#true} is VALID [2022-04-28 03:13:05,863 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-28 03:13:05,864 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-28 03:13:05,864 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-28 03:13:05,864 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-28 03:13:05,864 INFO L290 TraceCheckUtils]: 108: Hoare triple {44453#true} ~cond := #in~cond; {44453#true} is VALID [2022-04-28 03:13:05,864 INFO L290 TraceCheckUtils]: 109: Hoare triple {44453#true} assume !(0 == ~cond); {44453#true} is VALID [2022-04-28 03:13:05,864 INFO L290 TraceCheckUtils]: 110: Hoare triple {44453#true} assume true; {44453#true} is VALID [2022-04-28 03:13:05,865 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-28 03:13:05,865 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-28 03:13:05,865 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-28 03:13:05,865 INFO L290 TraceCheckUtils]: 114: Hoare triple {44533#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {44454#false} is VALID [2022-04-28 03:13:05,866 INFO L290 TraceCheckUtils]: 115: Hoare triple {44454#false} assume !false; {44454#false} is VALID [2022-04-28 03:13:05,866 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-28 03:13:05,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:13:05,866 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [534278457] [2022-04-28 03:13:05,866 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [534278457] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:13:05,866 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [342319471] [2022-04-28 03:13:05,866 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 03:13:05,866 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:13:05,867 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:13:05,867 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-28 03:13:05,868 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-28 03:13:05,920 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 03:13:05,920 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 03:13:05,921 INFO L263 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-28 03:13:05,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:13:05,934 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:13:08,546 INFO L272 TraceCheckUtils]: 0: Hoare triple {44453#true} call ULTIMATE.init(); {44453#true} is VALID [2022-04-28 03:13:08,546 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-28 03:13:08,546 INFO L290 TraceCheckUtils]: 2: Hoare triple {44453#true} assume true; {44453#true} is VALID [2022-04-28 03:13:08,546 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {44453#true} {44453#true} #138#return; {44453#true} is VALID [2022-04-28 03:13:08,546 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-28 03:13:08,546 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-28 03:13:08,546 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-28 03:13:08,546 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-28 03:13:08,547 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-28 03:13:08,547 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-28 03:13:08,547 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-28 03:13:08,547 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-28 03:13:08,548 INFO L290 TraceCheckUtils]: 12: Hoare triple {44453#true} ~cond := #in~cond; {44453#true} is VALID [2022-04-28 03:13:08,548 INFO L290 TraceCheckUtils]: 13: Hoare triple {44453#true} assume !(0 == ~cond); {44453#true} is VALID [2022-04-28 03:13:08,548 INFO L290 TraceCheckUtils]: 14: Hoare triple {44453#true} assume true; {44453#true} is VALID [2022-04-28 03:13:08,548 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-28 03:13:08,548 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-28 03:13:08,548 INFO L290 TraceCheckUtils]: 17: Hoare triple {44453#true} ~cond := #in~cond; {44590#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:13:08,549 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-28 03:13:08,549 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-28 03:13:08,550 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-28 03:13:08,550 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-28 03:13:08,550 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-28 03:13:08,550 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-28 03:13:08,551 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-28 03:13:08,551 INFO L290 TraceCheckUtils]: 25: Hoare triple {44453#true} ~cond := #in~cond; {44453#true} is VALID [2022-04-28 03:13:08,551 INFO L290 TraceCheckUtils]: 26: Hoare triple {44453#true} assume !(0 == ~cond); {44453#true} is VALID [2022-04-28 03:13:08,551 INFO L290 TraceCheckUtils]: 27: Hoare triple {44453#true} assume true; {44453#true} is VALID [2022-04-28 03:13:08,551 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-28 03:13:08,551 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-28 03:13:08,551 INFO L290 TraceCheckUtils]: 30: Hoare triple {44453#true} ~cond := #in~cond; {44453#true} is VALID [2022-04-28 03:13:08,551 INFO L290 TraceCheckUtils]: 31: Hoare triple {44453#true} assume !(0 == ~cond); {44453#true} is VALID [2022-04-28 03:13:08,551 INFO L290 TraceCheckUtils]: 32: Hoare triple {44453#true} assume true; {44453#true} is VALID [2022-04-28 03:13:08,552 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-28 03:13:08,552 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-28 03:13:08,553 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-28 03:13:08,553 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-28 03:13:08,553 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-28 03:13:08,554 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-28 03:13:08,554 INFO L290 TraceCheckUtils]: 39: Hoare triple {44453#true} ~cond := #in~cond; {44453#true} is VALID [2022-04-28 03:13:08,554 INFO L290 TraceCheckUtils]: 40: Hoare triple {44453#true} assume !(0 == ~cond); {44453#true} is VALID [2022-04-28 03:13:08,554 INFO L290 TraceCheckUtils]: 41: Hoare triple {44453#true} assume true; {44453#true} is VALID [2022-04-28 03:13:08,554 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-28 03:13:08,554 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-28 03:13:08,554 INFO L290 TraceCheckUtils]: 44: Hoare triple {44453#true} ~cond := #in~cond; {44453#true} is VALID [2022-04-28 03:13:08,554 INFO L290 TraceCheckUtils]: 45: Hoare triple {44453#true} assume !(0 == ~cond); {44453#true} is VALID [2022-04-28 03:13:08,554 INFO L290 TraceCheckUtils]: 46: Hoare triple {44453#true} assume true; {44453#true} is VALID [2022-04-28 03:13:08,555 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-28 03:13:08,555 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-28 03:13:08,555 INFO L290 TraceCheckUtils]: 49: Hoare triple {44453#true} ~cond := #in~cond; {44453#true} is VALID [2022-04-28 03:13:08,555 INFO L290 TraceCheckUtils]: 50: Hoare triple {44453#true} assume !(0 == ~cond); {44453#true} is VALID [2022-04-28 03:13:08,555 INFO L290 TraceCheckUtils]: 51: Hoare triple {44453#true} assume true; {44453#true} is VALID [2022-04-28 03:13:08,555 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-28 03:13:08,556 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-28 03:13:08,556 INFO L290 TraceCheckUtils]: 54: Hoare triple {44453#true} ~cond := #in~cond; {44453#true} is VALID [2022-04-28 03:13:08,556 INFO L290 TraceCheckUtils]: 55: Hoare triple {44453#true} assume !(0 == ~cond); {44453#true} is VALID [2022-04-28 03:13:08,556 INFO L290 TraceCheckUtils]: 56: Hoare triple {44453#true} assume true; {44453#true} is VALID [2022-04-28 03:13:08,556 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-28 03:13:08,556 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-28 03:13:08,557 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-28 03:13:08,557 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-28 03:13:08,557 INFO L290 TraceCheckUtils]: 61: Hoare triple {44453#true} ~cond := #in~cond; {44453#true} is VALID [2022-04-28 03:13:08,557 INFO L290 TraceCheckUtils]: 62: Hoare triple {44453#true} assume !(0 == ~cond); {44453#true} is VALID [2022-04-28 03:13:08,557 INFO L290 TraceCheckUtils]: 63: Hoare triple {44453#true} assume true; {44453#true} is VALID [2022-04-28 03:13:08,557 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-28 03:13:08,557 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-28 03:13:08,558 INFO L290 TraceCheckUtils]: 66: Hoare triple {44453#true} ~cond := #in~cond; {44453#true} is VALID [2022-04-28 03:13:08,558 INFO L290 TraceCheckUtils]: 67: Hoare triple {44453#true} assume !(0 == ~cond); {44453#true} is VALID [2022-04-28 03:13:08,558 INFO L290 TraceCheckUtils]: 68: Hoare triple {44453#true} assume true; {44453#true} is VALID [2022-04-28 03:13:08,558 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-28 03:13:08,558 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-28 03:13:08,559 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-28 03:13:08,559 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-28 03:13:08,559 INFO L290 TraceCheckUtils]: 73: Hoare triple {44453#true} ~cond := #in~cond; {44453#true} is VALID [2022-04-28 03:13:08,559 INFO L290 TraceCheckUtils]: 74: Hoare triple {44453#true} assume !(0 == ~cond); {44453#true} is VALID [2022-04-28 03:13:08,559 INFO L290 TraceCheckUtils]: 75: Hoare triple {44453#true} assume true; {44453#true} is VALID [2022-04-28 03:13:08,559 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-28 03:13:08,559 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-28 03:13:08,560 INFO L290 TraceCheckUtils]: 78: Hoare triple {44453#true} ~cond := #in~cond; {44453#true} is VALID [2022-04-28 03:13:08,560 INFO L290 TraceCheckUtils]: 79: Hoare triple {44453#true} assume !(0 == ~cond); {44453#true} is VALID [2022-04-28 03:13:08,560 INFO L290 TraceCheckUtils]: 80: Hoare triple {44453#true} assume true; {44453#true} is VALID [2022-04-28 03:13:08,560 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-28 03:13:08,560 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-28 03:13:08,560 INFO L290 TraceCheckUtils]: 83: Hoare triple {44453#true} ~cond := #in~cond; {44453#true} is VALID [2022-04-28 03:13:08,560 INFO L290 TraceCheckUtils]: 84: Hoare triple {44453#true} assume !(0 == ~cond); {44453#true} is VALID [2022-04-28 03:13:08,560 INFO L290 TraceCheckUtils]: 85: Hoare triple {44453#true} assume true; {44453#true} is VALID [2022-04-28 03:13:08,561 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-28 03:13:08,561 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-28 03:13:08,561 INFO L290 TraceCheckUtils]: 88: Hoare triple {44453#true} ~cond := #in~cond; {44453#true} is VALID [2022-04-28 03:13:08,561 INFO L290 TraceCheckUtils]: 89: Hoare triple {44453#true} assume !(0 == ~cond); {44453#true} is VALID [2022-04-28 03:13:08,561 INFO L290 TraceCheckUtils]: 90: Hoare triple {44453#true} assume true; {44453#true} is VALID [2022-04-28 03:13:08,561 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-28 03:13:08,562 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-28 03:13:08,562 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-28 03:13:08,562 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-28 03:13:08,563 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-28 03:13:08,563 INFO L290 TraceCheckUtils]: 96: Hoare triple {44453#true} ~cond := #in~cond; {44453#true} is VALID [2022-04-28 03:13:08,563 INFO L290 TraceCheckUtils]: 97: Hoare triple {44453#true} assume !(0 == ~cond); {44453#true} is VALID [2022-04-28 03:13:08,563 INFO L290 TraceCheckUtils]: 98: Hoare triple {44453#true} assume true; {44453#true} is VALID [2022-04-28 03:13:08,563 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-28 03:13:08,563 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-28 03:13:08,563 INFO L290 TraceCheckUtils]: 101: Hoare triple {44453#true} ~cond := #in~cond; {44453#true} is VALID [2022-04-28 03:13:08,563 INFO L290 TraceCheckUtils]: 102: Hoare triple {44453#true} assume !(0 == ~cond); {44453#true} is VALID [2022-04-28 03:13:08,563 INFO L290 TraceCheckUtils]: 103: Hoare triple {44453#true} assume true; {44453#true} is VALID [2022-04-28 03:13:08,564 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-28 03:13:08,564 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-28 03:13:08,564 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-28 03:13:08,565 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-28 03:13:08,565 INFO L290 TraceCheckUtils]: 108: Hoare triple {44453#true} ~cond := #in~cond; {44453#true} is VALID [2022-04-28 03:13:08,565 INFO L290 TraceCheckUtils]: 109: Hoare triple {44453#true} assume !(0 == ~cond); {44453#true} is VALID [2022-04-28 03:13:08,565 INFO L290 TraceCheckUtils]: 110: Hoare triple {44453#true} assume true; {44453#true} is VALID [2022-04-28 03:13:08,565 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-28 03:13:08,566 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-28 03:13:08,566 INFO L290 TraceCheckUtils]: 113: Hoare triple {44878#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {44882#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:13:08,566 INFO L290 TraceCheckUtils]: 114: Hoare triple {44882#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {44454#false} is VALID [2022-04-28 03:13:08,566 INFO L290 TraceCheckUtils]: 115: Hoare triple {44454#false} assume !false; {44454#false} is VALID [2022-04-28 03:13:08,567 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-28 03:13:08,567 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:13:09,595 INFO L290 TraceCheckUtils]: 115: Hoare triple {44454#false} assume !false; {44454#false} is VALID [2022-04-28 03:13:09,595 INFO L290 TraceCheckUtils]: 114: Hoare triple {44882#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {44454#false} is VALID [2022-04-28 03:13:09,595 INFO L290 TraceCheckUtils]: 113: Hoare triple {44878#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {44882#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:13:09,596 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-28 03:13:09,596 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-28 03:13:09,596 INFO L290 TraceCheckUtils]: 110: Hoare triple {44453#true} assume true; {44453#true} is VALID [2022-04-28 03:13:09,596 INFO L290 TraceCheckUtils]: 109: Hoare triple {44453#true} assume !(0 == ~cond); {44453#true} is VALID [2022-04-28 03:13:09,596 INFO L290 TraceCheckUtils]: 108: Hoare triple {44453#true} ~cond := #in~cond; {44453#true} is VALID [2022-04-28 03:13:09,597 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-28 03:13:09,597 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-28 03:13:09,597 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-28 03:13:09,597 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-28 03:13:09,597 INFO L290 TraceCheckUtils]: 103: Hoare triple {44453#true} assume true; {44453#true} is VALID [2022-04-28 03:13:09,598 INFO L290 TraceCheckUtils]: 102: Hoare triple {44453#true} assume !(0 == ~cond); {44453#true} is VALID [2022-04-28 03:13:09,598 INFO L290 TraceCheckUtils]: 101: Hoare triple {44453#true} ~cond := #in~cond; {44453#true} is VALID [2022-04-28 03:13:09,598 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-28 03:13:09,598 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-28 03:13:09,598 INFO L290 TraceCheckUtils]: 98: Hoare triple {44453#true} assume true; {44453#true} is VALID [2022-04-28 03:13:09,598 INFO L290 TraceCheckUtils]: 97: Hoare triple {44453#true} assume !(0 == ~cond); {44453#true} is VALID [2022-04-28 03:13:09,598 INFO L290 TraceCheckUtils]: 96: Hoare triple {44453#true} ~cond := #in~cond; {44453#true} is VALID [2022-04-28 03:13:09,598 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-28 03:13:09,602 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-28 03:13:09,603 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-28 03:13:09,603 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-28 03:13:09,604 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-28 03:13:09,604 INFO L290 TraceCheckUtils]: 90: Hoare triple {44453#true} assume true; {44453#true} is VALID [2022-04-28 03:13:09,604 INFO L290 TraceCheckUtils]: 89: Hoare triple {44453#true} assume !(0 == ~cond); {44453#true} is VALID [2022-04-28 03:13:09,604 INFO L290 TraceCheckUtils]: 88: Hoare triple {44453#true} ~cond := #in~cond; {44453#true} is VALID [2022-04-28 03:13:09,604 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-28 03:13:09,605 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-28 03:13:09,605 INFO L290 TraceCheckUtils]: 85: Hoare triple {44453#true} assume true; {44453#true} is VALID [2022-04-28 03:13:09,605 INFO L290 TraceCheckUtils]: 84: Hoare triple {44453#true} assume !(0 == ~cond); {44453#true} is VALID [2022-04-28 03:13:09,605 INFO L290 TraceCheckUtils]: 83: Hoare triple {44453#true} ~cond := #in~cond; {44453#true} is VALID [2022-04-28 03:13:09,605 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-28 03:13:09,605 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-28 03:13:09,606 INFO L290 TraceCheckUtils]: 80: Hoare triple {44453#true} assume true; {44453#true} is VALID [2022-04-28 03:13:09,606 INFO L290 TraceCheckUtils]: 79: Hoare triple {44453#true} assume !(0 == ~cond); {44453#true} is VALID [2022-04-28 03:13:09,606 INFO L290 TraceCheckUtils]: 78: Hoare triple {44453#true} ~cond := #in~cond; {44453#true} is VALID [2022-04-28 03:13:09,606 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-28 03:13:09,608 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-28 03:13:09,608 INFO L290 TraceCheckUtils]: 75: Hoare triple {44453#true} assume true; {44453#true} is VALID [2022-04-28 03:13:09,608 INFO L290 TraceCheckUtils]: 74: Hoare triple {44453#true} assume !(0 == ~cond); {44453#true} is VALID [2022-04-28 03:13:09,608 INFO L290 TraceCheckUtils]: 73: Hoare triple {44453#true} ~cond := #in~cond; {44453#true} is VALID [2022-04-28 03:13:09,608 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-28 03:13:09,609 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-28 03:13:09,609 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-28 03:13:09,609 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-28 03:13:09,609 INFO L290 TraceCheckUtils]: 68: Hoare triple {44453#true} assume true; {44453#true} is VALID [2022-04-28 03:13:09,609 INFO L290 TraceCheckUtils]: 67: Hoare triple {44453#true} assume !(0 == ~cond); {44453#true} is VALID [2022-04-28 03:13:09,610 INFO L290 TraceCheckUtils]: 66: Hoare triple {44453#true} ~cond := #in~cond; {44453#true} is VALID [2022-04-28 03:13:09,610 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-28 03:13:09,616 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-28 03:13:09,616 INFO L290 TraceCheckUtils]: 63: Hoare triple {44453#true} assume true; {44453#true} is VALID [2022-04-28 03:13:09,617 INFO L290 TraceCheckUtils]: 62: Hoare triple {44453#true} assume !(0 == ~cond); {44453#true} is VALID [2022-04-28 03:13:09,617 INFO L290 TraceCheckUtils]: 61: Hoare triple {44453#true} ~cond := #in~cond; {44453#true} is VALID [2022-04-28 03:13:09,617 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-28 03:13:09,617 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-28 03:13:09,617 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-28 03:13:09,618 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-28 03:13:09,618 INFO L290 TraceCheckUtils]: 56: Hoare triple {44453#true} assume true; {44453#true} is VALID [2022-04-28 03:13:09,618 INFO L290 TraceCheckUtils]: 55: Hoare triple {44453#true} assume !(0 == ~cond); {44453#true} is VALID [2022-04-28 03:13:09,618 INFO L290 TraceCheckUtils]: 54: Hoare triple {44453#true} ~cond := #in~cond; {44453#true} is VALID [2022-04-28 03:13:09,618 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-28 03:13:09,618 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-28 03:13:09,618 INFO L290 TraceCheckUtils]: 51: Hoare triple {44453#true} assume true; {44453#true} is VALID [2022-04-28 03:13:09,618 INFO L290 TraceCheckUtils]: 50: Hoare triple {44453#true} assume !(0 == ~cond); {44453#true} is VALID [2022-04-28 03:13:09,618 INFO L290 TraceCheckUtils]: 49: Hoare triple {44453#true} ~cond := #in~cond; {44453#true} is VALID [2022-04-28 03:13:09,619 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-28 03:13:09,619 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-28 03:13:09,619 INFO L290 TraceCheckUtils]: 46: Hoare triple {44453#true} assume true; {44453#true} is VALID [2022-04-28 03:13:09,619 INFO L290 TraceCheckUtils]: 45: Hoare triple {44453#true} assume !(0 == ~cond); {44453#true} is VALID [2022-04-28 03:13:09,619 INFO L290 TraceCheckUtils]: 44: Hoare triple {44453#true} ~cond := #in~cond; {44453#true} is VALID [2022-04-28 03:13:09,619 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-28 03:13:09,620 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-28 03:13:09,620 INFO L290 TraceCheckUtils]: 41: Hoare triple {44453#true} assume true; {44453#true} is VALID [2022-04-28 03:13:09,620 INFO L290 TraceCheckUtils]: 40: Hoare triple {44453#true} assume !(0 == ~cond); {44453#true} is VALID [2022-04-28 03:13:09,620 INFO L290 TraceCheckUtils]: 39: Hoare triple {44453#true} ~cond := #in~cond; {44453#true} is VALID [2022-04-28 03:13:09,620 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-28 03:13:09,621 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-28 03:13:09,622 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-28 03:13:09,622 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-28 03:13:09,623 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-28 03:13:09,623 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-28 03:13:09,623 INFO L290 TraceCheckUtils]: 32: Hoare triple {44453#true} assume true; {44453#true} is VALID [2022-04-28 03:13:09,623 INFO L290 TraceCheckUtils]: 31: Hoare triple {44453#true} assume !(0 == ~cond); {44453#true} is VALID [2022-04-28 03:13:09,623 INFO L290 TraceCheckUtils]: 30: Hoare triple {44453#true} ~cond := #in~cond; {44453#true} is VALID [2022-04-28 03:13:09,623 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-28 03:13:09,624 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-28 03:13:09,624 INFO L290 TraceCheckUtils]: 27: Hoare triple {44453#true} assume true; {44453#true} is VALID [2022-04-28 03:13:09,624 INFO L290 TraceCheckUtils]: 26: Hoare triple {44453#true} assume !(0 == ~cond); {44453#true} is VALID [2022-04-28 03:13:09,624 INFO L290 TraceCheckUtils]: 25: Hoare triple {44453#true} ~cond := #in~cond; {44453#true} is VALID [2022-04-28 03:13:09,624 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-28 03:13:09,624 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-28 03:13:09,625 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-28 03:13:09,625 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-28 03:13:09,626 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-28 03:13:09,626 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-28 03:13:09,626 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-28 03:13:09,626 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-28 03:13:09,627 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-28 03:13:09,627 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-28 03:13:09,627 INFO L290 TraceCheckUtils]: 14: Hoare triple {44453#true} assume true; {44453#true} is VALID [2022-04-28 03:13:09,627 INFO L290 TraceCheckUtils]: 13: Hoare triple {44453#true} assume !(0 == ~cond); {44453#true} is VALID [2022-04-28 03:13:09,627 INFO L290 TraceCheckUtils]: 12: Hoare triple {44453#true} ~cond := #in~cond; {44453#true} is VALID [2022-04-28 03:13:09,627 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-28 03:13:09,631 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-28 03:13:09,631 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-28 03:13:09,632 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-28 03:13:09,632 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-28 03:13:09,632 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-28 03:13:09,632 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-28 03:13:09,632 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-28 03:13:09,632 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {44453#true} {44453#true} #138#return; {44453#true} is VALID [2022-04-28 03:13:09,632 INFO L290 TraceCheckUtils]: 2: Hoare triple {44453#true} assume true; {44453#true} is VALID [2022-04-28 03:13:09,632 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-28 03:13:09,632 INFO L272 TraceCheckUtils]: 0: Hoare triple {44453#true} call ULTIMATE.init(); {44453#true} is VALID [2022-04-28 03:13:09,633 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-28 03:13:09,633 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [342319471] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:13:09,633 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:13:09,633 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 22 [2022-04-28 03:13:09,633 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:13:09,633 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [967131959] [2022-04-28 03:13:09,633 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [967131959] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:13:09,633 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:13:09,633 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-28 03:13:09,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [217761431] [2022-04-28 03:13:09,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:13:09,634 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-28 03:13:09,634 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:13:09,634 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-28 03:13:09,701 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-28 03:13:09,701 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-28 03:13:09,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:13:09,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-28 03:13:09,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=406, Unknown=0, NotChecked=0, Total=462 [2022-04-28 03:13:09,702 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-28 03:13:17,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:13:17,028 INFO L93 Difference]: Finished difference Result 620 states and 983 transitions. [2022-04-28 03:13:17,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-28 03:13:17,029 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-28 03:13:17,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:13:17,029 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-28 03:13:17,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 245 transitions. [2022-04-28 03:13:17,032 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-28 03:13:17,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 245 transitions. [2022-04-28 03:13:17,034 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 245 transitions. [2022-04-28 03:13:17,261 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-28 03:13:17,286 INFO L225 Difference]: With dead ends: 620 [2022-04-28 03:13:17,286 INFO L226 Difference]: Without dead ends: 618 [2022-04-28 03:13:17,287 INFO L412 NwaCegarLoop]: 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-28 03:13:17,287 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 187 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 796 mSolverCounterSat, 450 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s 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.3s IncrementalHoareTripleChecker+Time [2022-04-28 03:13:17,287 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [187 Valid, 89 Invalid, 1246 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [450 Valid, 796 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-04-28 03:13:17,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 618 states. [2022-04-28 03:13:20,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 618 to 501. [2022-04-28 03:13:20,724 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:13:20,725 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-28 03:13:20,725 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-28 03:13:20,725 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-28 03:13:20,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:13:20,744 INFO L93 Difference]: Finished difference Result 618 states and 981 transitions. [2022-04-28 03:13:20,744 INFO L276 IsEmpty]: Start isEmpty. Operand 618 states and 981 transitions. [2022-04-28 03:13:20,746 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:13:20,746 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:13:20,747 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-28 03:13:20,747 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-28 03:13:20,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:13:20,766 INFO L93 Difference]: Finished difference Result 618 states and 981 transitions. [2022-04-28 03:13:20,766 INFO L276 IsEmpty]: Start isEmpty. Operand 618 states and 981 transitions. [2022-04-28 03:13:20,768 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:13:20,768 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:13:20,768 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:13:20,768 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:13:20,768 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-28 03:13:20,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 501 states to 501 states and 798 transitions. [2022-04-28 03:13:20,786 INFO L78 Accepts]: Start accepts. Automaton has 501 states and 798 transitions. Word has length 116 [2022-04-28 03:13:20,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:13:20,786 INFO L495 AbstractCegarLoop]: Abstraction has 501 states and 798 transitions. [2022-04-28 03:13:20,786 INFO L496 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-28 03:13:20,786 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 501 states and 798 transitions. [2022-04-28 03:13:22,142 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-28 03:13:22,142 INFO L276 IsEmpty]: Start isEmpty. Operand 501 states and 798 transitions. [2022-04-28 03:13:22,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2022-04-28 03:13:22,143 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:13:22,143 INFO L195 NwaCegarLoop]: 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-28 03:13:22,161 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-28 03:13:22,344 WARN L477 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-28 03:13:22,344 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:13:22,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:13:22,344 INFO L85 PathProgramCache]: Analyzing trace with hash -1563563510, now seen corresponding path program 5 times [2022-04-28 03:13:22,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:13:22,344 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1814918555] [2022-04-28 03:13:22,345 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 03:13:22,345 INFO L85 PathProgramCache]: Analyzing trace with hash -1563563510, now seen corresponding path program 6 times [2022-04-28 03:13:22,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:13:22,345 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [501675277] [2022-04-28 03:13:22,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:13:22,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:13:22,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:13:22,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:13:22,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:13:22,453 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-28 03:13:22,453 INFO L290 TraceCheckUtils]: 1: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-28 03:13:22,453 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {48744#true} {48744#true} #138#return; {48744#true} is VALID [2022-04-28 03:13:22,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-28 03:13:22,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:13:22,456 INFO L290 TraceCheckUtils]: 0: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-28 03:13:22,456 INFO L290 TraceCheckUtils]: 1: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-28 03:13:22,456 INFO L290 TraceCheckUtils]: 2: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-28 03:13:22,457 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-28 03:13:22,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-04-28 03:13:22,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:13:22,459 INFO L290 TraceCheckUtils]: 0: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-28 03:13:22,459 INFO L290 TraceCheckUtils]: 1: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-28 03:13:22,459 INFO L290 TraceCheckUtils]: 2: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-28 03:13:22,460 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-28 03:13:22,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-04-28 03:13:22,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:13:22,462 INFO L290 TraceCheckUtils]: 0: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-28 03:13:22,462 INFO L290 TraceCheckUtils]: 1: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-28 03:13:22,462 INFO L290 TraceCheckUtils]: 2: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-28 03:13:22,463 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-28 03:13:22,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-04-28 03:13:22,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:13:22,465 INFO L290 TraceCheckUtils]: 0: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-28 03:13:22,465 INFO L290 TraceCheckUtils]: 1: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-28 03:13:22,465 INFO L290 TraceCheckUtils]: 2: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-28 03:13:22,465 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-28 03:13:22,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-04-28 03:13:22,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:13:22,467 INFO L290 TraceCheckUtils]: 0: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-28 03:13:22,468 INFO L290 TraceCheckUtils]: 1: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-28 03:13:22,468 INFO L290 TraceCheckUtils]: 2: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-28 03:13:22,468 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-28 03:13:22,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-04-28 03:13:22,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:13:22,470 INFO L290 TraceCheckUtils]: 0: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-28 03:13:22,471 INFO L290 TraceCheckUtils]: 1: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-28 03:13:22,471 INFO L290 TraceCheckUtils]: 2: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-28 03:13:22,471 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-28 03:13:22,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-04-28 03:13:22,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:13:22,473 INFO L290 TraceCheckUtils]: 0: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-28 03:13:22,473 INFO L290 TraceCheckUtils]: 1: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-28 03:13:22,473 INFO L290 TraceCheckUtils]: 2: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-28 03:13:22,474 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-28 03:13:22,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-04-28 03:13:22,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:13:22,477 INFO L290 TraceCheckUtils]: 0: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-28 03:13:22,477 INFO L290 TraceCheckUtils]: 1: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-28 03:13:22,477 INFO L290 TraceCheckUtils]: 2: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-28 03:13:22,477 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-28 03:13:22,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-04-28 03:13:22,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:13:22,480 INFO L290 TraceCheckUtils]: 0: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-28 03:13:22,480 INFO L290 TraceCheckUtils]: 1: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-28 03:13:22,480 INFO L290 TraceCheckUtils]: 2: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-28 03:13:22,480 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-28 03:13:22,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-04-28 03:13:22,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:13:22,483 INFO L290 TraceCheckUtils]: 0: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-28 03:13:22,483 INFO L290 TraceCheckUtils]: 1: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-28 03:13:22,483 INFO L290 TraceCheckUtils]: 2: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-28 03:13:22,483 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-28 03:13:22,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-04-28 03:13:22,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:13:22,486 INFO L290 TraceCheckUtils]: 0: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-28 03:13:22,486 INFO L290 TraceCheckUtils]: 1: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-28 03:13:22,486 INFO L290 TraceCheckUtils]: 2: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-28 03:13:22,486 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-28 03:13:22,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-04-28 03:13:22,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:13:22,489 INFO L290 TraceCheckUtils]: 0: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-28 03:13:22,489 INFO L290 TraceCheckUtils]: 1: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-28 03:13:22,489 INFO L290 TraceCheckUtils]: 2: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-28 03:13:22,489 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-28 03:13:22,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-04-28 03:13:22,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:13:22,492 INFO L290 TraceCheckUtils]: 0: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-28 03:13:22,492 INFO L290 TraceCheckUtils]: 1: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-28 03:13:22,492 INFO L290 TraceCheckUtils]: 2: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-28 03:13:22,492 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-28 03:13:22,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-04-28 03:13:22,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:13:22,495 INFO L290 TraceCheckUtils]: 0: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-28 03:13:22,495 INFO L290 TraceCheckUtils]: 1: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-28 03:13:22,495 INFO L290 TraceCheckUtils]: 2: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-28 03:13:22,495 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-28 03:13:22,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-04-28 03:13:22,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:13:22,497 INFO L290 TraceCheckUtils]: 0: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-28 03:13:22,497 INFO L290 TraceCheckUtils]: 1: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-28 03:13:22,497 INFO L290 TraceCheckUtils]: 2: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-28 03:13:22,498 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-28 03:13:22,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-04-28 03:13:22,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:13:22,500 INFO L290 TraceCheckUtils]: 0: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-28 03:13:22,500 INFO L290 TraceCheckUtils]: 1: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-28 03:13:22,501 INFO L290 TraceCheckUtils]: 2: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-28 03:13:22,501 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-28 03:13:22,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-04-28 03:13:22,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:13:22,504 INFO L290 TraceCheckUtils]: 0: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-28 03:13:22,504 INFO L290 TraceCheckUtils]: 1: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-28 03:13:22,504 INFO L290 TraceCheckUtils]: 2: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-28 03:13:22,504 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-28 03:13:22,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-04-28 03:13:22,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:13:22,507 INFO L290 TraceCheckUtils]: 0: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-28 03:13:22,507 INFO L290 TraceCheckUtils]: 1: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-28 03:13:22,507 INFO L290 TraceCheckUtils]: 2: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-28 03:13:22,507 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-28 03:13:22,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-04-28 03:13:22,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:13:22,510 INFO L290 TraceCheckUtils]: 0: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-28 03:13:22,510 INFO L290 TraceCheckUtils]: 1: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-28 03:13:22,510 INFO L290 TraceCheckUtils]: 2: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-28 03:13:22,510 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-28 03:13:22,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-04-28 03:13:22,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:13:22,514 INFO L290 TraceCheckUtils]: 0: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-28 03:13:22,514 INFO L290 TraceCheckUtils]: 1: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-28 03:13:22,514 INFO L290 TraceCheckUtils]: 2: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-28 03:13:22,514 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-28 03:13:22,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-04-28 03:13:22,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:13:22,517 INFO L290 TraceCheckUtils]: 0: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-28 03:13:22,517 INFO L290 TraceCheckUtils]: 1: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-28 03:13:22,517 INFO L290 TraceCheckUtils]: 2: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-28 03:13:22,518 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-28 03:13:22,518 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-28 03:13:22,518 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-28 03:13:22,518 INFO L290 TraceCheckUtils]: 2: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-28 03:13:22,518 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {48744#true} {48744#true} #138#return; {48744#true} is VALID [2022-04-28 03:13:22,518 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-28 03:13:22,518 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-28 03:13:22,519 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-28 03:13:22,519 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-28 03:13:22,520 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-28 03:13:22,520 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-28 03:13:22,520 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-28 03:13:22,520 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-28 03:13:22,521 INFO L290 TraceCheckUtils]: 12: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-28 03:13:22,521 INFO L290 TraceCheckUtils]: 13: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-28 03:13:22,521 INFO L290 TraceCheckUtils]: 14: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-28 03:13:22,521 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-28 03:13:22,521 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-28 03:13:22,521 INFO L290 TraceCheckUtils]: 17: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-28 03:13:22,521 INFO L290 TraceCheckUtils]: 18: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-28 03:13:22,521 INFO L290 TraceCheckUtils]: 19: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-28 03:13:22,522 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-28 03:13:22,522 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-28 03:13:22,522 INFO L290 TraceCheckUtils]: 22: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-28 03:13:22,522 INFO L290 TraceCheckUtils]: 23: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-28 03:13:22,522 INFO L290 TraceCheckUtils]: 24: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-28 03:13:22,522 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-28 03:13:22,523 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-28 03:13:22,523 INFO L290 TraceCheckUtils]: 27: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-28 03:13:22,523 INFO L290 TraceCheckUtils]: 28: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-28 03:13:22,523 INFO L290 TraceCheckUtils]: 29: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-28 03:13:22,523 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-28 03:13:22,523 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-28 03:13:22,524 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-28 03:13:22,524 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-28 03:13:22,524 INFO L290 TraceCheckUtils]: 34: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-28 03:13:22,524 INFO L290 TraceCheckUtils]: 35: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-28 03:13:22,524 INFO L290 TraceCheckUtils]: 36: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-28 03:13:22,524 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-28 03:13:22,525 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-28 03:13:22,525 INFO L290 TraceCheckUtils]: 39: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-28 03:13:22,525 INFO L290 TraceCheckUtils]: 40: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-28 03:13:22,525 INFO L290 TraceCheckUtils]: 41: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-28 03:13:22,525 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-28 03:13:22,525 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-28 03:13:22,526 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-28 03:13:22,526 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-28 03:13:22,526 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-28 03:13:22,526 INFO L290 TraceCheckUtils]: 47: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-28 03:13:22,526 INFO L290 TraceCheckUtils]: 48: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-28 03:13:22,526 INFO L290 TraceCheckUtils]: 49: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-28 03:13:22,527 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-28 03:13:22,527 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-28 03:13:22,527 INFO L290 TraceCheckUtils]: 52: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-28 03:13:22,527 INFO L290 TraceCheckUtils]: 53: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-28 03:13:22,527 INFO L290 TraceCheckUtils]: 54: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-28 03:13:22,527 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-28 03:13:22,528 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-28 03:13:22,528 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-28 03:13:22,528 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-28 03:13:22,529 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-28 03:13:22,529 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-28 03:13:22,529 INFO L290 TraceCheckUtils]: 61: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-28 03:13:22,529 INFO L290 TraceCheckUtils]: 62: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-28 03:13:22,529 INFO L290 TraceCheckUtils]: 63: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-28 03:13:22,529 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-28 03:13:22,529 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-28 03:13:22,529 INFO L290 TraceCheckUtils]: 66: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-28 03:13:22,529 INFO L290 TraceCheckUtils]: 67: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-28 03:13:22,530 INFO L290 TraceCheckUtils]: 68: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-28 03:13:22,530 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-28 03:13:22,530 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-28 03:13:22,530 INFO L290 TraceCheckUtils]: 71: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-28 03:13:22,530 INFO L290 TraceCheckUtils]: 72: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-28 03:13:22,530 INFO L290 TraceCheckUtils]: 73: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-28 03:13:22,530 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-28 03:13:22,531 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-28 03:13:22,531 INFO L290 TraceCheckUtils]: 76: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-28 03:13:22,531 INFO L290 TraceCheckUtils]: 77: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-28 03:13:22,531 INFO L290 TraceCheckUtils]: 78: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-28 03:13:22,531 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-28 03:13:22,531 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-28 03:13:22,532 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-28 03:13:22,532 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-28 03:13:22,532 INFO L290 TraceCheckUtils]: 83: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-28 03:13:22,532 INFO L290 TraceCheckUtils]: 84: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-28 03:13:22,532 INFO L290 TraceCheckUtils]: 85: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-28 03:13:22,532 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-28 03:13:22,533 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-28 03:13:22,533 INFO L290 TraceCheckUtils]: 88: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-28 03:13:22,533 INFO L290 TraceCheckUtils]: 89: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-28 03:13:22,533 INFO L290 TraceCheckUtils]: 90: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-28 03:13:22,533 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-28 03:13:22,533 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-28 03:13:22,534 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-28 03:13:22,534 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-28 03:13:22,534 INFO L290 TraceCheckUtils]: 95: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-28 03:13:22,534 INFO L290 TraceCheckUtils]: 96: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-28 03:13:22,534 INFO L290 TraceCheckUtils]: 97: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-28 03:13:22,534 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-28 03:13:22,534 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-28 03:13:22,534 INFO L290 TraceCheckUtils]: 100: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-28 03:13:22,535 INFO L290 TraceCheckUtils]: 101: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-28 03:13:22,535 INFO L290 TraceCheckUtils]: 102: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-28 03:13:22,535 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-28 03:13:22,535 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-28 03:13:22,535 INFO L290 TraceCheckUtils]: 105: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-28 03:13:22,535 INFO L290 TraceCheckUtils]: 106: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-28 03:13:22,535 INFO L290 TraceCheckUtils]: 107: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-28 03:13:22,536 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-28 03:13:22,536 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-28 03:13:22,536 INFO L290 TraceCheckUtils]: 110: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-28 03:13:22,536 INFO L290 TraceCheckUtils]: 111: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-28 03:13:22,536 INFO L290 TraceCheckUtils]: 112: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-28 03:13:22,536 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-28 03:13:22,537 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-28 03:13:22,537 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-28 03:13:22,537 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-28 03:13:22,537 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-28 03:13:22,537 INFO L290 TraceCheckUtils]: 118: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-28 03:13:22,538 INFO L290 TraceCheckUtils]: 119: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-28 03:13:22,538 INFO L290 TraceCheckUtils]: 120: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-28 03:13:22,538 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-28 03:13:22,538 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-28 03:13:22,538 INFO L290 TraceCheckUtils]: 123: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-28 03:13:22,538 INFO L290 TraceCheckUtils]: 124: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-28 03:13:22,538 INFO L290 TraceCheckUtils]: 125: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-28 03:13:22,539 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-28 03:13:22,539 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-28 03:13:22,539 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-28 03:13:22,539 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-28 03:13:22,539 INFO L290 TraceCheckUtils]: 130: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-28 03:13:22,539 INFO L290 TraceCheckUtils]: 131: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-28 03:13:22,539 INFO L290 TraceCheckUtils]: 132: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-28 03:13:22,540 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-28 03:13:22,540 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-28 03:13:22,540 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-28 03:13:22,541 INFO L290 TraceCheckUtils]: 136: Hoare triple {48840#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {48745#false} is VALID [2022-04-28 03:13:22,541 INFO L290 TraceCheckUtils]: 137: Hoare triple {48745#false} assume !false; {48745#false} is VALID [2022-04-28 03:13:22,541 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-28 03:13:22,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:13:22,541 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [501675277] [2022-04-28 03:13:22,542 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [501675277] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:13:22,542 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1033085323] [2022-04-28 03:13:22,542 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 03:13:22,542 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:13:22,542 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:13:22,543 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-28 03:13:22,571 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-28 03:13:22,606 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-04-28 03:13:22,607 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 03:13:22,607 INFO L263 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-28 03:13:22,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:13:22,621 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:13:23,553 INFO L272 TraceCheckUtils]: 0: Hoare triple {48744#true} call ULTIMATE.init(); {48744#true} is VALID [2022-04-28 03:13:23,553 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-28 03:13:23,553 INFO L290 TraceCheckUtils]: 2: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-28 03:13:23,553 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {48744#true} {48744#true} #138#return; {48744#true} is VALID [2022-04-28 03:13:23,553 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-28 03:13:23,553 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-28 03:13:23,573 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-28 03:13:23,574 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-28 03:13:23,574 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-28 03:13:23,575 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-28 03:13:23,575 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-28 03:13:23,575 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-28 03:13:23,575 INFO L290 TraceCheckUtils]: 12: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-28 03:13:23,575 INFO L290 TraceCheckUtils]: 13: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-28 03:13:23,575 INFO L290 TraceCheckUtils]: 14: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-28 03:13:23,576 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-28 03:13:23,576 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-28 03:13:23,576 INFO L290 TraceCheckUtils]: 17: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-28 03:13:23,576 INFO L290 TraceCheckUtils]: 18: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-28 03:13:23,576 INFO L290 TraceCheckUtils]: 19: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-28 03:13:23,577 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-28 03:13:23,577 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-28 03:13:23,577 INFO L290 TraceCheckUtils]: 22: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-28 03:13:23,577 INFO L290 TraceCheckUtils]: 23: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-28 03:13:23,577 INFO L290 TraceCheckUtils]: 24: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-28 03:13:23,578 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-28 03:13:23,578 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-28 03:13:23,578 INFO L290 TraceCheckUtils]: 27: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-28 03:13:23,578 INFO L290 TraceCheckUtils]: 28: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-28 03:13:23,578 INFO L290 TraceCheckUtils]: 29: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-28 03:13:23,578 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-28 03:13:23,579 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-28 03:13:23,579 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-28 03:13:23,579 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-28 03:13:23,579 INFO L290 TraceCheckUtils]: 34: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-28 03:13:23,579 INFO L290 TraceCheckUtils]: 35: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-28 03:13:23,579 INFO L290 TraceCheckUtils]: 36: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-28 03:13:23,580 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-28 03:13:23,580 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-28 03:13:23,580 INFO L290 TraceCheckUtils]: 39: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-28 03:13:23,580 INFO L290 TraceCheckUtils]: 40: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-28 03:13:23,580 INFO L290 TraceCheckUtils]: 41: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-28 03:13:23,580 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-28 03:13:23,581 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-28 03:13:23,581 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-28 03:13:23,581 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-28 03:13:23,581 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-28 03:13:23,581 INFO L290 TraceCheckUtils]: 47: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-28 03:13:23,581 INFO L290 TraceCheckUtils]: 48: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-28 03:13:23,581 INFO L290 TraceCheckUtils]: 49: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-28 03:13:23,582 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-28 03:13:23,582 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-28 03:13:23,582 INFO L290 TraceCheckUtils]: 52: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-28 03:13:23,582 INFO L290 TraceCheckUtils]: 53: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-28 03:13:23,582 INFO L290 TraceCheckUtils]: 54: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-28 03:13:23,583 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-28 03:13:23,583 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-28 03:13:23,583 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-28 03:13:23,584 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-28 03:13:23,584 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-28 03:13:23,584 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-28 03:13:23,584 INFO L290 TraceCheckUtils]: 61: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-28 03:13:23,584 INFO L290 TraceCheckUtils]: 62: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-28 03:13:23,584 INFO L290 TraceCheckUtils]: 63: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-28 03:13:23,585 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-28 03:13:23,585 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-28 03:13:23,585 INFO L290 TraceCheckUtils]: 66: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-28 03:13:23,585 INFO L290 TraceCheckUtils]: 67: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-28 03:13:23,585 INFO L290 TraceCheckUtils]: 68: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-28 03:13:23,585 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-28 03:13:23,585 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-28 03:13:23,585 INFO L290 TraceCheckUtils]: 71: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-28 03:13:23,585 INFO L290 TraceCheckUtils]: 72: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-28 03:13:23,586 INFO L290 TraceCheckUtils]: 73: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-28 03:13:23,586 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-28 03:13:23,586 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-28 03:13:23,586 INFO L290 TraceCheckUtils]: 76: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-28 03:13:23,586 INFO L290 TraceCheckUtils]: 77: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-28 03:13:23,586 INFO L290 TraceCheckUtils]: 78: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-28 03:13:23,587 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-28 03:13:23,587 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-28 03:13:23,587 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-28 03:13:23,587 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-28 03:13:23,587 INFO L290 TraceCheckUtils]: 83: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-28 03:13:23,588 INFO L290 TraceCheckUtils]: 84: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-28 03:13:23,588 INFO L290 TraceCheckUtils]: 85: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-28 03:13:23,588 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-28 03:13:23,588 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-28 03:13:23,588 INFO L290 TraceCheckUtils]: 88: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-28 03:13:23,588 INFO L290 TraceCheckUtils]: 89: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-28 03:13:23,588 INFO L290 TraceCheckUtils]: 90: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-28 03:13:23,589 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-28 03:13:23,589 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-28 03:13:23,589 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-28 03:13:23,589 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-28 03:13:23,590 INFO L290 TraceCheckUtils]: 95: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-28 03:13:23,590 INFO L290 TraceCheckUtils]: 96: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-28 03:13:23,590 INFO L290 TraceCheckUtils]: 97: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-28 03:13:23,590 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-28 03:13:23,590 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-28 03:13:23,590 INFO L290 TraceCheckUtils]: 100: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-28 03:13:23,590 INFO L290 TraceCheckUtils]: 101: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-28 03:13:23,590 INFO L290 TraceCheckUtils]: 102: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-28 03:13:23,591 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-28 03:13:23,591 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-28 03:13:23,591 INFO L290 TraceCheckUtils]: 105: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-28 03:13:23,591 INFO L290 TraceCheckUtils]: 106: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-28 03:13:23,591 INFO L290 TraceCheckUtils]: 107: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-28 03:13:23,591 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-28 03:13:23,592 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-28 03:13:23,592 INFO L290 TraceCheckUtils]: 110: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-28 03:13:23,592 INFO L290 TraceCheckUtils]: 111: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-28 03:13:23,592 INFO L290 TraceCheckUtils]: 112: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-28 03:13:23,592 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-28 03:13:23,593 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-28 03:13:23,593 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-28 03:13:23,594 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-28 03:13:23,594 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-28 03:13:23,594 INFO L290 TraceCheckUtils]: 118: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-28 03:13:23,594 INFO L290 TraceCheckUtils]: 119: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-28 03:13:23,594 INFO L290 TraceCheckUtils]: 120: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-28 03:13:23,594 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-28 03:13:23,594 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-28 03:13:23,594 INFO L290 TraceCheckUtils]: 123: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-28 03:13:23,594 INFO L290 TraceCheckUtils]: 124: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-28 03:13:23,595 INFO L290 TraceCheckUtils]: 125: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-28 03:13:23,595 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-28 03:13:23,595 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-28 03:13:23,596 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-28 03:13:23,596 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-28 03:13:23,596 INFO L290 TraceCheckUtils]: 130: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-28 03:13:23,596 INFO L290 TraceCheckUtils]: 131: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-28 03:13:23,596 INFO L290 TraceCheckUtils]: 132: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-28 03:13:23,596 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-28 03:13:23,597 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-28 03:13:23,597 INFO L290 TraceCheckUtils]: 135: Hoare triple {49250#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {49254#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:13:23,597 INFO L290 TraceCheckUtils]: 136: Hoare triple {49254#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {48745#false} is VALID [2022-04-28 03:13:23,598 INFO L290 TraceCheckUtils]: 137: Hoare triple {48745#false} assume !false; {48745#false} is VALID [2022-04-28 03:13:23,598 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-28 03:13:23,598 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:13:24,231 INFO L290 TraceCheckUtils]: 137: Hoare triple {48745#false} assume !false; {48745#false} is VALID [2022-04-28 03:13:24,232 INFO L290 TraceCheckUtils]: 136: Hoare triple {49254#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {48745#false} is VALID [2022-04-28 03:13:24,232 INFO L290 TraceCheckUtils]: 135: Hoare triple {49250#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {49254#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:13:24,233 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-28 03:13:24,233 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-28 03:13:24,234 INFO L290 TraceCheckUtils]: 132: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-28 03:13:24,234 INFO L290 TraceCheckUtils]: 131: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-28 03:13:24,234 INFO L290 TraceCheckUtils]: 130: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-28 03:13:24,234 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-28 03:13:24,234 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-28 03:13:24,234 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-28 03:13:24,235 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-28 03:13:24,235 INFO L290 TraceCheckUtils]: 125: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-28 03:13:24,235 INFO L290 TraceCheckUtils]: 124: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-28 03:13:24,235 INFO L290 TraceCheckUtils]: 123: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-28 03:13:24,235 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-28 03:13:24,236 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-28 03:13:24,236 INFO L290 TraceCheckUtils]: 120: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-28 03:13:24,236 INFO L290 TraceCheckUtils]: 119: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-28 03:13:24,236 INFO L290 TraceCheckUtils]: 118: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-28 03:13:24,236 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-28 03:13:24,236 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-28 03:13:24,236 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-28 03:13:24,237 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-28 03:13:24,237 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-28 03:13:24,238 INFO L290 TraceCheckUtils]: 112: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-28 03:13:24,238 INFO L290 TraceCheckUtils]: 111: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-28 03:13:24,238 INFO L290 TraceCheckUtils]: 110: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-28 03:13:24,238 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-28 03:13:24,238 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-28 03:13:24,238 INFO L290 TraceCheckUtils]: 107: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-28 03:13:24,238 INFO L290 TraceCheckUtils]: 106: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-28 03:13:24,238 INFO L290 TraceCheckUtils]: 105: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-28 03:13:24,238 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-28 03:13:24,239 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-28 03:13:24,239 INFO L290 TraceCheckUtils]: 102: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-28 03:13:24,239 INFO L290 TraceCheckUtils]: 101: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-28 03:13:24,239 INFO L290 TraceCheckUtils]: 100: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-28 03:13:24,239 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-28 03:13:24,240 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-28 03:13:24,240 INFO L290 TraceCheckUtils]: 97: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-28 03:13:24,240 INFO L290 TraceCheckUtils]: 96: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-28 03:13:24,240 INFO L290 TraceCheckUtils]: 95: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-28 03:13:24,240 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-28 03:13:24,240 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-28 03:13:24,240 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-28 03:13:24,241 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-28 03:13:24,241 INFO L290 TraceCheckUtils]: 90: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-28 03:13:24,241 INFO L290 TraceCheckUtils]: 89: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-28 03:13:24,241 INFO L290 TraceCheckUtils]: 88: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-28 03:13:24,241 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-28 03:13:24,242 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-28 03:13:24,242 INFO L290 TraceCheckUtils]: 85: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-28 03:13:24,242 INFO L290 TraceCheckUtils]: 84: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-28 03:13:24,242 INFO L290 TraceCheckUtils]: 83: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-28 03:13:24,242 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-28 03:13:24,242 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-28 03:13:24,242 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-28 03:13:24,243 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-28 03:13:24,243 INFO L290 TraceCheckUtils]: 78: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-28 03:13:24,243 INFO L290 TraceCheckUtils]: 77: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-28 03:13:24,243 INFO L290 TraceCheckUtils]: 76: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-28 03:13:24,243 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-28 03:13:24,243 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-28 03:13:24,244 INFO L290 TraceCheckUtils]: 73: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-28 03:13:24,244 INFO L290 TraceCheckUtils]: 72: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-28 03:13:24,244 INFO L290 TraceCheckUtils]: 71: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-28 03:13:24,244 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-28 03:13:24,259 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-28 03:13:24,260 INFO L290 TraceCheckUtils]: 68: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-28 03:13:24,260 INFO L290 TraceCheckUtils]: 67: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-28 03:13:24,260 INFO L290 TraceCheckUtils]: 66: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-28 03:13:24,260 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-28 03:13:24,260 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-28 03:13:24,260 INFO L290 TraceCheckUtils]: 63: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-28 03:13:24,260 INFO L290 TraceCheckUtils]: 62: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-28 03:13:24,261 INFO L290 TraceCheckUtils]: 61: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-28 03:13:24,261 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-28 03:13:24,261 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-28 03:13:24,261 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-28 03:13:24,262 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-28 03:13:24,262 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-28 03:13:24,262 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-28 03:13:24,262 INFO L290 TraceCheckUtils]: 54: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-28 03:13:24,263 INFO L290 TraceCheckUtils]: 53: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-28 03:13:24,263 INFO L290 TraceCheckUtils]: 52: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-28 03:13:24,263 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-28 03:13:24,263 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-28 03:13:24,263 INFO L290 TraceCheckUtils]: 49: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-28 03:13:24,263 INFO L290 TraceCheckUtils]: 48: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-28 03:13:24,263 INFO L290 TraceCheckUtils]: 47: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-28 03:13:24,263 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-28 03:13:24,264 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-28 03:13:24,264 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-28 03:13:24,264 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-28 03:13:24,265 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-28 03:13:24,265 INFO L290 TraceCheckUtils]: 41: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-28 03:13:24,265 INFO L290 TraceCheckUtils]: 40: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-28 03:13:24,265 INFO L290 TraceCheckUtils]: 39: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-28 03:13:24,265 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-28 03:13:24,265 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-28 03:13:24,266 INFO L290 TraceCheckUtils]: 36: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-28 03:13:24,266 INFO L290 TraceCheckUtils]: 35: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-28 03:13:24,266 INFO L290 TraceCheckUtils]: 34: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-28 03:13:24,266 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-28 03:13:24,266 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-28 03:13:24,267 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-28 03:13:24,267 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-28 03:13:24,267 INFO L290 TraceCheckUtils]: 29: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-28 03:13:24,267 INFO L290 TraceCheckUtils]: 28: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-28 03:13:24,267 INFO L290 TraceCheckUtils]: 27: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-28 03:13:24,268 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-28 03:13:24,268 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-28 03:13:24,268 INFO L290 TraceCheckUtils]: 24: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-28 03:13:24,268 INFO L290 TraceCheckUtils]: 23: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-28 03:13:24,268 INFO L290 TraceCheckUtils]: 22: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-28 03:13:24,268 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-28 03:13:24,269 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-28 03:13:24,269 INFO L290 TraceCheckUtils]: 19: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-28 03:13:24,269 INFO L290 TraceCheckUtils]: 18: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-28 03:13:24,269 INFO L290 TraceCheckUtils]: 17: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-28 03:13:24,269 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-28 03:13:24,269 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-28 03:13:24,269 INFO L290 TraceCheckUtils]: 14: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-28 03:13:24,270 INFO L290 TraceCheckUtils]: 13: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-28 03:13:24,270 INFO L290 TraceCheckUtils]: 12: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-28 03:13:24,270 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-28 03:13:24,270 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-28 03:13:24,270 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-28 03:13:24,271 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-28 03:13:24,271 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-28 03:13:24,272 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-28 03:13:24,272 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-28 03:13:24,272 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-28 03:13:24,272 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {48744#true} {48744#true} #138#return; {48744#true} is VALID [2022-04-28 03:13:24,272 INFO L290 TraceCheckUtils]: 2: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-28 03:13:24,272 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-28 03:13:24,272 INFO L272 TraceCheckUtils]: 0: Hoare triple {48744#true} call ULTIMATE.init(); {48744#true} is VALID [2022-04-28 03:13:24,272 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-28 03:13:24,273 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1033085323] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:13:24,273 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:13:24,273 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 8] total 20 [2022-04-28 03:13:24,273 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:13:24,273 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1814918555] [2022-04-28 03:13:24,273 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1814918555] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:13:24,273 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:13:24,273 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-28 03:13:24,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [286717527] [2022-04-28 03:13:24,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:13:24,274 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-28 03:13:24,274 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:13:24,274 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-28 03:13:24,331 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-28 03:13:24,331 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-28 03:13:24,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:13:24,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-28 03:13:24,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=323, Unknown=0, NotChecked=0, Total=380 [2022-04-28 03:13:24,332 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-28 03:13:33,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:13:33,894 INFO L93 Difference]: Finished difference Result 770 states and 1246 transitions. [2022-04-28 03:13:33,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-04-28 03:13:33,895 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-28 03:13:33,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:13:33,895 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-28 03:13:33,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 240 transitions. [2022-04-28 03:13:33,898 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-28 03:13:33,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 240 transitions. [2022-04-28 03:13:33,900 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 240 transitions. [2022-04-28 03:13:34,132 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-28 03:13:34,139 INFO L225 Difference]: With dead ends: 770 [2022-04-28 03:13:34,139 INFO L226 Difference]: Without dead ends: 309 [2022-04-28 03:13:34,141 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 343 GetRequests, 311 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=194, Invalid=862, Unknown=0, NotChecked=0, Total=1056 [2022-04-28 03:13:34,141 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 132 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 980 mSolverCounterSat, 350 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s 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.3s IncrementalHoareTripleChecker+Time [2022-04-28 03:13:34,141 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 105 Invalid, 1330 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [350 Valid, 980 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-04-28 03:13:34,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2022-04-28 03:13:35,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 213. [2022-04-28 03:13:35,361 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:13:35,362 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-28 03:13:35,362 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-28 03:13:35,362 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-28 03:13:35,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:13:35,371 INFO L93 Difference]: Finished difference Result 309 states and 449 transitions. [2022-04-28 03:13:35,371 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 449 transitions. [2022-04-28 03:13:35,371 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:13:35,372 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:13:35,372 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-28 03:13:35,372 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-28 03:13:35,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:13:35,378 INFO L93 Difference]: Finished difference Result 309 states and 449 transitions. [2022-04-28 03:13:35,378 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 449 transitions. [2022-04-28 03:13:35,378 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:13:35,378 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:13:35,379 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:13:35,379 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:13:35,379 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-28 03:13:35,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 280 transitions. [2022-04-28 03:13:35,383 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 280 transitions. Word has length 138 [2022-04-28 03:13:35,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:13:35,383 INFO L495 AbstractCegarLoop]: Abstraction has 213 states and 280 transitions. [2022-04-28 03:13:35,383 INFO L496 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-28 03:13:35,383 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 213 states and 280 transitions. [2022-04-28 03:13:35,904 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-28 03:13:35,904 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 280 transitions. [2022-04-28 03:13:35,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2022-04-28 03:13:35,905 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:13:35,905 INFO L195 NwaCegarLoop]: 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-28 03:13:35,921 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-04-28 03:13:36,105 WARN L477 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-28 03:13:36,106 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:13:36,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:13:36,106 INFO L85 PathProgramCache]: Analyzing trace with hash -915763573, now seen corresponding path program 1 times [2022-04-28 03:13:36,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:13:36,106 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1979194843] [2022-04-28 03:13:36,107 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 03:13:36,107 INFO L85 PathProgramCache]: Analyzing trace with hash -915763573, now seen corresponding path program 2 times [2022-04-28 03:13:36,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:13:36,107 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [310197762] [2022-04-28 03:13:36,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:13:36,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:13:36,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:13:36,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:13:36,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:13:36,215 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-28 03:13:36,215 INFO L290 TraceCheckUtils]: 1: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-28 03:13:36,216 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {52289#true} {52289#true} #138#return; {52289#true} is VALID [2022-04-28 03:13:36,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-28 03:13:36,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:13:36,223 INFO L290 TraceCheckUtils]: 0: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-28 03:13:36,223 INFO L290 TraceCheckUtils]: 1: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-28 03:13:36,224 INFO L290 TraceCheckUtils]: 2: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-28 03:13:36,224 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-28 03:13:36,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-04-28 03:13:36,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:13:36,227 INFO L290 TraceCheckUtils]: 0: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-28 03:13:36,227 INFO L290 TraceCheckUtils]: 1: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-28 03:13:36,227 INFO L290 TraceCheckUtils]: 2: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-28 03:13:36,227 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-28 03:13:36,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-04-28 03:13:36,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:13:36,230 INFO L290 TraceCheckUtils]: 0: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-28 03:13:36,230 INFO L290 TraceCheckUtils]: 1: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-28 03:13:36,230 INFO L290 TraceCheckUtils]: 2: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-28 03:13:36,230 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-28 03:13:36,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-04-28 03:13:36,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:13:36,233 INFO L290 TraceCheckUtils]: 0: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-28 03:13:36,233 INFO L290 TraceCheckUtils]: 1: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-28 03:13:36,233 INFO L290 TraceCheckUtils]: 2: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-28 03:13:36,233 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-28 03:13:36,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-04-28 03:13:36,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:13:36,236 INFO L290 TraceCheckUtils]: 0: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-28 03:13:36,236 INFO L290 TraceCheckUtils]: 1: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-28 03:13:36,236 INFO L290 TraceCheckUtils]: 2: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-28 03:13:36,236 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-28 03:13:36,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-04-28 03:13:36,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:13:36,239 INFO L290 TraceCheckUtils]: 0: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-28 03:13:36,239 INFO L290 TraceCheckUtils]: 1: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-28 03:13:36,239 INFO L290 TraceCheckUtils]: 2: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-28 03:13:36,239 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-28 03:13:36,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-04-28 03:13:36,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:13:36,242 INFO L290 TraceCheckUtils]: 0: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-28 03:13:36,242 INFO L290 TraceCheckUtils]: 1: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-28 03:13:36,242 INFO L290 TraceCheckUtils]: 2: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-28 03:13:36,242 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-28 03:13:36,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-04-28 03:13:36,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:13:36,244 INFO L290 TraceCheckUtils]: 0: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-28 03:13:36,244 INFO L290 TraceCheckUtils]: 1: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-28 03:13:36,245 INFO L290 TraceCheckUtils]: 2: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-28 03:13:36,245 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-28 03:13:36,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-04-28 03:13:36,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:13:36,248 INFO L290 TraceCheckUtils]: 0: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-28 03:13:36,248 INFO L290 TraceCheckUtils]: 1: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-28 03:13:36,248 INFO L290 TraceCheckUtils]: 2: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-28 03:13:36,248 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-28 03:13:36,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-04-28 03:13:36,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:13:36,250 INFO L290 TraceCheckUtils]: 0: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-28 03:13:36,251 INFO L290 TraceCheckUtils]: 1: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-28 03:13:36,251 INFO L290 TraceCheckUtils]: 2: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-28 03:13:36,251 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-28 03:13:36,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-04-28 03:13:36,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:13:36,254 INFO L290 TraceCheckUtils]: 0: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-28 03:13:36,254 INFO L290 TraceCheckUtils]: 1: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-28 03:13:36,254 INFO L290 TraceCheckUtils]: 2: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-28 03:13:36,254 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-28 03:13:36,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-04-28 03:13:36,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:13:36,258 INFO L290 TraceCheckUtils]: 0: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-28 03:13:36,258 INFO L290 TraceCheckUtils]: 1: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-28 03:13:36,258 INFO L290 TraceCheckUtils]: 2: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-28 03:13:36,258 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-28 03:13:36,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-04-28 03:13:36,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:13:36,260 INFO L290 TraceCheckUtils]: 0: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-28 03:13:36,261 INFO L290 TraceCheckUtils]: 1: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-28 03:13:36,261 INFO L290 TraceCheckUtils]: 2: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-28 03:13:36,261 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-28 03:13:36,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-04-28 03:13:36,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:13:36,263 INFO L290 TraceCheckUtils]: 0: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-28 03:13:36,263 INFO L290 TraceCheckUtils]: 1: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-28 03:13:36,264 INFO L290 TraceCheckUtils]: 2: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-28 03:13:36,264 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-28 03:13:36,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-04-28 03:13:36,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:13:36,267 INFO L290 TraceCheckUtils]: 0: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-28 03:13:36,267 INFO L290 TraceCheckUtils]: 1: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-28 03:13:36,267 INFO L290 TraceCheckUtils]: 2: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-28 03:13:36,267 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-28 03:13:36,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-04-28 03:13:36,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:13:36,270 INFO L290 TraceCheckUtils]: 0: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-28 03:13:36,270 INFO L290 TraceCheckUtils]: 1: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-28 03:13:36,270 INFO L290 TraceCheckUtils]: 2: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-28 03:13:36,270 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-28 03:13:36,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-04-28 03:13:36,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:13:36,274 INFO L290 TraceCheckUtils]: 0: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-28 03:13:36,274 INFO L290 TraceCheckUtils]: 1: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-28 03:13:36,274 INFO L290 TraceCheckUtils]: 2: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-28 03:13:36,274 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-28 03:13:36,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-04-28 03:13:36,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:13:36,276 INFO L290 TraceCheckUtils]: 0: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-28 03:13:36,276 INFO L290 TraceCheckUtils]: 1: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-28 03:13:36,276 INFO L290 TraceCheckUtils]: 2: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-28 03:13:36,277 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-28 03:13:36,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-04-28 03:13:36,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:13:36,279 INFO L290 TraceCheckUtils]: 0: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-28 03:13:36,279 INFO L290 TraceCheckUtils]: 1: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-28 03:13:36,279 INFO L290 TraceCheckUtils]: 2: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-28 03:13:36,279 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-28 03:13:36,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-04-28 03:13:36,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:13:36,282 INFO L290 TraceCheckUtils]: 0: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-28 03:13:36,282 INFO L290 TraceCheckUtils]: 1: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-28 03:13:36,282 INFO L290 TraceCheckUtils]: 2: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-28 03:13:36,282 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-28 03:13:36,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-04-28 03:13:36,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:13:36,285 INFO L290 TraceCheckUtils]: 0: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-28 03:13:36,285 INFO L290 TraceCheckUtils]: 1: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-28 03:13:36,285 INFO L290 TraceCheckUtils]: 2: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-28 03:13:36,285 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-28 03:13:36,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2022-04-28 03:13:36,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:13:36,288 INFO L290 TraceCheckUtils]: 0: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-28 03:13:36,288 INFO L290 TraceCheckUtils]: 1: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-28 03:13:36,288 INFO L290 TraceCheckUtils]: 2: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-28 03:13:36,288 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-28 03:13:36,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2022-04-28 03:13:36,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:13:36,291 INFO L290 TraceCheckUtils]: 0: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-28 03:13:36,291 INFO L290 TraceCheckUtils]: 1: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-28 03:13:36,291 INFO L290 TraceCheckUtils]: 2: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-28 03:13:36,291 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-28 03:13:36,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2022-04-28 03:13:36,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:13:36,294 INFO L290 TraceCheckUtils]: 0: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-28 03:13:36,294 INFO L290 TraceCheckUtils]: 1: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-28 03:13:36,294 INFO L290 TraceCheckUtils]: 2: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-28 03:13:36,294 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-28 03:13:36,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2022-04-28 03:13:36,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:13:36,296 INFO L290 TraceCheckUtils]: 0: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-28 03:13:36,296 INFO L290 TraceCheckUtils]: 1: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-28 03:13:36,297 INFO L290 TraceCheckUtils]: 2: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-28 03:13:36,297 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {52289#true} {52290#false} #118#return; {52290#false} is VALID [2022-04-28 03:13:36,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2022-04-28 03:13:36,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:13:36,299 INFO L290 TraceCheckUtils]: 0: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-28 03:13:36,299 INFO L290 TraceCheckUtils]: 1: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-28 03:13:36,299 INFO L290 TraceCheckUtils]: 2: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-28 03:13:36,299 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {52289#true} {52290#false} #120#return; {52290#false} is VALID [2022-04-28 03:13:36,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2022-04-28 03:13:36,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:13:36,302 INFO L290 TraceCheckUtils]: 0: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-28 03:13:36,302 INFO L290 TraceCheckUtils]: 1: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-28 03:13:36,302 INFO L290 TraceCheckUtils]: 2: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-28 03:13:36,302 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {52289#true} {52290#false} #122#return; {52290#false} is VALID [2022-04-28 03:13:36,302 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-28 03:13:36,303 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-28 03:13:36,303 INFO L290 TraceCheckUtils]: 2: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-28 03:13:36,303 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {52289#true} {52289#true} #138#return; {52289#true} is VALID [2022-04-28 03:13:36,303 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-28 03:13:36,303 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-28 03:13:36,303 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-28 03:13:36,303 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-28 03:13:36,303 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-28 03:13:36,304 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-28 03:13:36,304 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-28 03:13:36,304 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-28 03:13:36,304 INFO L290 TraceCheckUtils]: 12: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-28 03:13:36,304 INFO L290 TraceCheckUtils]: 13: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-28 03:13:36,304 INFO L290 TraceCheckUtils]: 14: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-28 03:13:36,305 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-28 03:13:36,305 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-28 03:13:36,305 INFO L290 TraceCheckUtils]: 17: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-28 03:13:36,305 INFO L290 TraceCheckUtils]: 18: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-28 03:13:36,305 INFO L290 TraceCheckUtils]: 19: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-28 03:13:36,305 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-28 03:13:36,306 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-28 03:13:36,306 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-28 03:13:36,306 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-28 03:13:36,306 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-28 03:13:36,306 INFO L290 TraceCheckUtils]: 25: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-28 03:13:36,306 INFO L290 TraceCheckUtils]: 26: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-28 03:13:36,306 INFO L290 TraceCheckUtils]: 27: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-28 03:13:36,307 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-28 03:13:36,307 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-28 03:13:36,307 INFO L290 TraceCheckUtils]: 30: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-28 03:13:36,307 INFO L290 TraceCheckUtils]: 31: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-28 03:13:36,307 INFO L290 TraceCheckUtils]: 32: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-28 03:13:36,307 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-28 03:13:36,308 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-28 03:13:36,308 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-28 03:13:36,308 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-28 03:13:36,309 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-28 03:13:36,309 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-28 03:13:36,309 INFO L290 TraceCheckUtils]: 39: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-28 03:13:36,309 INFO L290 TraceCheckUtils]: 40: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-28 03:13:36,309 INFO L290 TraceCheckUtils]: 41: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-28 03:13:36,309 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-28 03:13:36,309 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-28 03:13:36,309 INFO L290 TraceCheckUtils]: 44: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-28 03:13:36,310 INFO L290 TraceCheckUtils]: 45: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-28 03:13:36,310 INFO L290 TraceCheckUtils]: 46: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-28 03:13:36,310 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-28 03:13:36,310 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-28 03:13:36,310 INFO L290 TraceCheckUtils]: 49: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-28 03:13:36,310 INFO L290 TraceCheckUtils]: 50: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-28 03:13:36,310 INFO L290 TraceCheckUtils]: 51: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-28 03:13:36,311 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-28 03:13:36,311 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-28 03:13:36,311 INFO L290 TraceCheckUtils]: 54: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-28 03:13:36,311 INFO L290 TraceCheckUtils]: 55: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-28 03:13:36,311 INFO L290 TraceCheckUtils]: 56: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-28 03:13:36,311 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-28 03:13:36,311 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-28 03:13:36,312 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-28 03:13:36,312 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-28 03:13:36,312 INFO L290 TraceCheckUtils]: 61: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-28 03:13:36,312 INFO L290 TraceCheckUtils]: 62: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-28 03:13:36,312 INFO L290 TraceCheckUtils]: 63: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-28 03:13:36,312 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-28 03:13:36,312 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-28 03:13:36,312 INFO L290 TraceCheckUtils]: 66: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-28 03:13:36,312 INFO L290 TraceCheckUtils]: 67: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-28 03:13:36,313 INFO L290 TraceCheckUtils]: 68: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-28 03:13:36,313 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-28 03:13:36,313 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-28 03:13:36,313 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-28 03:13:36,313 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-28 03:13:36,313 INFO L290 TraceCheckUtils]: 73: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-28 03:13:36,314 INFO L290 TraceCheckUtils]: 74: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-28 03:13:36,314 INFO L290 TraceCheckUtils]: 75: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-28 03:13:36,314 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-28 03:13:36,314 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-28 03:13:36,314 INFO L290 TraceCheckUtils]: 78: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-28 03:13:36,314 INFO L290 TraceCheckUtils]: 79: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-28 03:13:36,314 INFO L290 TraceCheckUtils]: 80: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-28 03:13:36,315 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-28 03:13:36,315 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-28 03:13:36,315 INFO L290 TraceCheckUtils]: 83: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-28 03:13:36,315 INFO L290 TraceCheckUtils]: 84: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-28 03:13:36,315 INFO L290 TraceCheckUtils]: 85: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-28 03:13:36,315 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-28 03:13:36,315 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-28 03:13:36,315 INFO L290 TraceCheckUtils]: 88: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-28 03:13:36,315 INFO L290 TraceCheckUtils]: 89: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-28 03:13:36,315 INFO L290 TraceCheckUtils]: 90: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-28 03:13:36,316 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-28 03:13:36,316 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-28 03:13:36,317 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-28 03:13:36,317 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-28 03:13:36,317 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-28 03:13:36,317 INFO L290 TraceCheckUtils]: 96: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-28 03:13:36,317 INFO L290 TraceCheckUtils]: 97: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-28 03:13:36,317 INFO L290 TraceCheckUtils]: 98: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-28 03:13:36,317 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-28 03:13:36,318 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-28 03:13:36,318 INFO L290 TraceCheckUtils]: 101: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-28 03:13:36,318 INFO L290 TraceCheckUtils]: 102: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-28 03:13:36,318 INFO L290 TraceCheckUtils]: 103: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-28 03:13:36,318 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-28 03:13:36,318 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-28 03:13:36,318 INFO L290 TraceCheckUtils]: 106: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-28 03:13:36,318 INFO L290 TraceCheckUtils]: 107: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-28 03:13:36,318 INFO L290 TraceCheckUtils]: 108: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-28 03:13:36,319 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-28 03:13:36,319 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-28 03:13:36,319 INFO L290 TraceCheckUtils]: 111: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-28 03:13:36,319 INFO L290 TraceCheckUtils]: 112: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-28 03:13:36,319 INFO L290 TraceCheckUtils]: 113: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-28 03:13:36,319 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-28 03:13:36,320 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-28 03:13:36,320 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-28 03:13:36,320 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-28 03:13:36,320 INFO L290 TraceCheckUtils]: 118: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-28 03:13:36,320 INFO L290 TraceCheckUtils]: 119: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-28 03:13:36,320 INFO L290 TraceCheckUtils]: 120: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-28 03:13:36,321 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-28 03:13:36,321 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-28 03:13:36,321 INFO L290 TraceCheckUtils]: 123: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-28 03:13:36,321 INFO L290 TraceCheckUtils]: 124: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-28 03:13:36,321 INFO L290 TraceCheckUtils]: 125: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-28 03:13:36,321 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-28 03:13:36,322 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-28 03:13:36,322 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-28 03:13:36,322 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-28 03:13:36,322 INFO L290 TraceCheckUtils]: 130: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-28 03:13:36,322 INFO L290 TraceCheckUtils]: 131: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-28 03:13:36,322 INFO L290 TraceCheckUtils]: 132: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-28 03:13:36,322 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-28 03:13:36,323 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-28 03:13:36,323 INFO L290 TraceCheckUtils]: 135: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-28 03:13:36,323 INFO L290 TraceCheckUtils]: 136: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-28 03:13:36,323 INFO L290 TraceCheckUtils]: 137: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-28 03:13:36,323 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-28 03:13:36,323 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-28 03:13:36,323 INFO L290 TraceCheckUtils]: 140: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-28 03:13:36,323 INFO L290 TraceCheckUtils]: 141: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-28 03:13:36,323 INFO L290 TraceCheckUtils]: 142: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-28 03:13:36,324 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-28 03:13:36,324 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-28 03:13:36,324 INFO L290 TraceCheckUtils]: 145: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-28 03:13:36,324 INFO L290 TraceCheckUtils]: 146: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-28 03:13:36,324 INFO L290 TraceCheckUtils]: 147: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-28 03:13:36,324 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-28 03:13:36,325 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-28 03:13:36,325 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-28 03:13:36,325 INFO L290 TraceCheckUtils]: 151: Hoare triple {52290#false} assume !(~j~0 < ~r~0); {52290#false} is VALID [2022-04-28 03:13:36,325 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-28 03:13:36,325 INFO L290 TraceCheckUtils]: 153: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-28 03:13:36,325 INFO L290 TraceCheckUtils]: 154: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-28 03:13:36,325 INFO L290 TraceCheckUtils]: 155: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-28 03:13:36,325 INFO L284 TraceCheckUtils]: 156: Hoare quadruple {52289#true} {52290#false} #118#return; {52290#false} is VALID [2022-04-28 03:13:36,326 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-28 03:13:36,326 INFO L290 TraceCheckUtils]: 158: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-28 03:13:36,326 INFO L290 TraceCheckUtils]: 159: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-28 03:13:36,326 INFO L290 TraceCheckUtils]: 160: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-28 03:13:36,326 INFO L284 TraceCheckUtils]: 161: Hoare quadruple {52289#true} {52290#false} #120#return; {52290#false} is VALID [2022-04-28 03:13:36,326 INFO L290 TraceCheckUtils]: 162: Hoare triple {52290#false} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {52290#false} is VALID [2022-04-28 03:13:36,326 INFO L290 TraceCheckUtils]: 163: Hoare triple {52290#false} assume !(0 != #t~nondet5);havoc #t~nondet5; {52290#false} is VALID [2022-04-28 03:13:36,326 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-28 03:13:36,326 INFO L290 TraceCheckUtils]: 165: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-28 03:13:36,326 INFO L290 TraceCheckUtils]: 166: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-28 03:13:36,326 INFO L290 TraceCheckUtils]: 167: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-28 03:13:36,326 INFO L284 TraceCheckUtils]: 168: Hoare quadruple {52289#true} {52290#false} #122#return; {52290#false} is VALID [2022-04-28 03:13:36,326 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-28 03:13:36,326 INFO L290 TraceCheckUtils]: 170: Hoare triple {52290#false} ~cond := #in~cond; {52290#false} is VALID [2022-04-28 03:13:36,326 INFO L290 TraceCheckUtils]: 171: Hoare triple {52290#false} assume 0 == ~cond; {52290#false} is VALID [2022-04-28 03:13:36,327 INFO L290 TraceCheckUtils]: 172: Hoare triple {52290#false} assume !false; {52290#false} is VALID [2022-04-28 03:13:36,327 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-28 03:13:36,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:13:36,328 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [310197762] [2022-04-28 03:13:36,328 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [310197762] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:13:36,328 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [79186673] [2022-04-28 03:13:36,328 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 03:13:36,328 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:13:36,328 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:13:36,329 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-28 03:13:36,330 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-28 03:13:36,408 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 03:13:36,408 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 03:13:36,409 INFO L263 TraceCheckSpWp]: Trace formula consists of 364 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-28 03:13:36,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:13:36,428 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:13:40,758 INFO L272 TraceCheckUtils]: 0: Hoare triple {52289#true} call ULTIMATE.init(); {52289#true} is VALID [2022-04-28 03:13:40,758 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-28 03:13:40,758 INFO L290 TraceCheckUtils]: 2: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-28 03:13:40,758 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {52289#true} {52289#true} #138#return; {52289#true} is VALID [2022-04-28 03:13:40,758 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-28 03:13:40,758 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-28 03:13:40,758 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-28 03:13:40,758 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-28 03:13:40,759 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-28 03:13:40,759 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-28 03:13:40,760 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-28 03:13:40,760 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-28 03:13:40,760 INFO L290 TraceCheckUtils]: 12: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-28 03:13:40,760 INFO L290 TraceCheckUtils]: 13: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-28 03:13:40,760 INFO L290 TraceCheckUtils]: 14: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-28 03:13:40,760 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-28 03:13:40,760 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-28 03:13:40,760 INFO L290 TraceCheckUtils]: 17: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-28 03:13:40,760 INFO L290 TraceCheckUtils]: 18: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-28 03:13:40,761 INFO L290 TraceCheckUtils]: 19: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-28 03:13:40,761 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-28 03:13:40,761 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-28 03:13:40,762 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-28 03:13:40,762 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-28 03:13:40,762 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-28 03:13:40,762 INFO L290 TraceCheckUtils]: 25: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-28 03:13:40,762 INFO L290 TraceCheckUtils]: 26: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-28 03:13:40,762 INFO L290 TraceCheckUtils]: 27: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-28 03:13:40,763 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-28 03:13:40,763 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-28 03:13:40,763 INFO L290 TraceCheckUtils]: 30: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-28 03:13:40,763 INFO L290 TraceCheckUtils]: 31: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-28 03:13:40,763 INFO L290 TraceCheckUtils]: 32: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-28 03:13:40,763 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-28 03:13:40,764 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-28 03:13:40,764 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-28 03:13:40,765 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-28 03:13:40,765 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-28 03:13:40,765 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-28 03:13:40,765 INFO L290 TraceCheckUtils]: 39: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-28 03:13:40,765 INFO L290 TraceCheckUtils]: 40: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-28 03:13:40,766 INFO L290 TraceCheckUtils]: 41: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-28 03:13:40,766 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-28 03:13:40,766 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-28 03:13:40,766 INFO L290 TraceCheckUtils]: 44: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-28 03:13:40,766 INFO L290 TraceCheckUtils]: 45: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-28 03:13:40,766 INFO L290 TraceCheckUtils]: 46: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-28 03:13:40,767 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-28 03:13:40,767 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-28 03:13:40,767 INFO L290 TraceCheckUtils]: 49: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-28 03:13:40,767 INFO L290 TraceCheckUtils]: 50: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-28 03:13:40,767 INFO L290 TraceCheckUtils]: 51: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-28 03:13:40,767 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-28 03:13:40,767 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-28 03:13:40,767 INFO L290 TraceCheckUtils]: 54: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-28 03:13:40,767 INFO L290 TraceCheckUtils]: 55: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-28 03:13:40,780 INFO L290 TraceCheckUtils]: 56: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-28 03:13:40,780 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-28 03:13:40,781 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-28 03:13:40,781 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-28 03:13:40,781 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-28 03:13:40,781 INFO L290 TraceCheckUtils]: 61: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-28 03:13:40,781 INFO L290 TraceCheckUtils]: 62: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-28 03:13:40,781 INFO L290 TraceCheckUtils]: 63: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-28 03:13:40,782 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-28 03:13:40,782 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-28 03:13:40,782 INFO L290 TraceCheckUtils]: 66: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-28 03:13:40,782 INFO L290 TraceCheckUtils]: 67: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-28 03:13:40,782 INFO L290 TraceCheckUtils]: 68: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-28 03:13:40,783 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-28 03:13:40,784 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-28 03:13:40,784 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-28 03:13:40,784 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-28 03:13:40,784 INFO L290 TraceCheckUtils]: 73: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-28 03:13:40,784 INFO L290 TraceCheckUtils]: 74: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-28 03:13:40,785 INFO L290 TraceCheckUtils]: 75: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-28 03:13:40,787 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-28 03:13:40,788 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-28 03:13:40,788 INFO L290 TraceCheckUtils]: 78: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-28 03:13:40,788 INFO L290 TraceCheckUtils]: 79: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-28 03:13:40,788 INFO L290 TraceCheckUtils]: 80: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-28 03:13:40,788 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-28 03:13:40,788 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-28 03:13:40,788 INFO L290 TraceCheckUtils]: 83: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-28 03:13:40,788 INFO L290 TraceCheckUtils]: 84: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-28 03:13:40,789 INFO L290 TraceCheckUtils]: 85: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-28 03:13:40,789 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-28 03:13:40,789 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-28 03:13:40,789 INFO L290 TraceCheckUtils]: 88: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-28 03:13:40,789 INFO L290 TraceCheckUtils]: 89: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-28 03:13:40,789 INFO L290 TraceCheckUtils]: 90: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-28 03:13:40,790 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-28 03:13:40,790 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-28 03:13:40,791 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-28 03:13:40,791 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-28 03:13:40,791 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-28 03:13:40,791 INFO L290 TraceCheckUtils]: 96: Hoare triple {52290#false} ~cond := #in~cond; {52290#false} is VALID [2022-04-28 03:13:40,792 INFO L290 TraceCheckUtils]: 97: Hoare triple {52290#false} assume !(0 == ~cond); {52290#false} is VALID [2022-04-28 03:13:40,792 INFO L290 TraceCheckUtils]: 98: Hoare triple {52290#false} assume true; {52290#false} is VALID [2022-04-28 03:13:40,792 INFO L284 TraceCheckUtils]: 99: Hoare quadruple {52290#false} {52290#false} #110#return; {52290#false} is VALID [2022-04-28 03:13:40,792 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-28 03:13:40,792 INFO L290 TraceCheckUtils]: 101: Hoare triple {52290#false} ~cond := #in~cond; {52290#false} is VALID [2022-04-28 03:13:40,792 INFO L290 TraceCheckUtils]: 102: Hoare triple {52290#false} assume !(0 == ~cond); {52290#false} is VALID [2022-04-28 03:13:40,792 INFO L290 TraceCheckUtils]: 103: Hoare triple {52290#false} assume true; {52290#false} is VALID [2022-04-28 03:13:40,792 INFO L284 TraceCheckUtils]: 104: Hoare quadruple {52290#false} {52290#false} #112#return; {52290#false} is VALID [2022-04-28 03:13:40,792 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-28 03:13:40,792 INFO L290 TraceCheckUtils]: 106: Hoare triple {52290#false} ~cond := #in~cond; {52290#false} is VALID [2022-04-28 03:13:40,792 INFO L290 TraceCheckUtils]: 107: Hoare triple {52290#false} assume !(0 == ~cond); {52290#false} is VALID [2022-04-28 03:13:40,792 INFO L290 TraceCheckUtils]: 108: Hoare triple {52290#false} assume true; {52290#false} is VALID [2022-04-28 03:13:40,792 INFO L284 TraceCheckUtils]: 109: Hoare quadruple {52290#false} {52290#false} #114#return; {52290#false} is VALID [2022-04-28 03:13:40,792 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-28 03:13:40,793 INFO L290 TraceCheckUtils]: 111: Hoare triple {52290#false} ~cond := #in~cond; {52290#false} is VALID [2022-04-28 03:13:40,793 INFO L290 TraceCheckUtils]: 112: Hoare triple {52290#false} assume !(0 == ~cond); {52290#false} is VALID [2022-04-28 03:13:40,793 INFO L290 TraceCheckUtils]: 113: Hoare triple {52290#false} assume true; {52290#false} is VALID [2022-04-28 03:13:40,793 INFO L284 TraceCheckUtils]: 114: Hoare quadruple {52290#false} {52290#false} #116#return; {52290#false} is VALID [2022-04-28 03:13:40,793 INFO L290 TraceCheckUtils]: 115: Hoare triple {52290#false} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {52290#false} is VALID [2022-04-28 03:13:40,793 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-28 03:13:40,793 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-28 03:13:40,793 INFO L290 TraceCheckUtils]: 118: Hoare triple {52290#false} ~cond := #in~cond; {52290#false} is VALID [2022-04-28 03:13:40,793 INFO L290 TraceCheckUtils]: 119: Hoare triple {52290#false} assume !(0 == ~cond); {52290#false} is VALID [2022-04-28 03:13:40,793 INFO L290 TraceCheckUtils]: 120: Hoare triple {52290#false} assume true; {52290#false} is VALID [2022-04-28 03:13:40,793 INFO L284 TraceCheckUtils]: 121: Hoare quadruple {52290#false} {52290#false} #118#return; {52290#false} is VALID [2022-04-28 03:13:40,793 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-28 03:13:40,793 INFO L290 TraceCheckUtils]: 123: Hoare triple {52290#false} ~cond := #in~cond; {52290#false} is VALID [2022-04-28 03:13:40,793 INFO L290 TraceCheckUtils]: 124: Hoare triple {52290#false} assume !(0 == ~cond); {52290#false} is VALID [2022-04-28 03:13:40,793 INFO L290 TraceCheckUtils]: 125: Hoare triple {52290#false} assume true; {52290#false} is VALID [2022-04-28 03:13:40,794 INFO L284 TraceCheckUtils]: 126: Hoare quadruple {52290#false} {52290#false} #120#return; {52290#false} is VALID [2022-04-28 03:13:40,794 INFO L290 TraceCheckUtils]: 127: Hoare triple {52290#false} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {52290#false} is VALID [2022-04-28 03:13:40,794 INFO L290 TraceCheckUtils]: 128: Hoare triple {52290#false} assume !(0 != #t~nondet5);havoc #t~nondet5; {52290#false} is VALID [2022-04-28 03:13:40,794 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-28 03:13:40,794 INFO L290 TraceCheckUtils]: 130: Hoare triple {52290#false} ~cond := #in~cond; {52290#false} is VALID [2022-04-28 03:13:40,794 INFO L290 TraceCheckUtils]: 131: Hoare triple {52290#false} assume !(0 == ~cond); {52290#false} is VALID [2022-04-28 03:13:40,794 INFO L290 TraceCheckUtils]: 132: Hoare triple {52290#false} assume true; {52290#false} is VALID [2022-04-28 03:13:40,794 INFO L284 TraceCheckUtils]: 133: Hoare quadruple {52290#false} {52290#false} #122#return; {52290#false} is VALID [2022-04-28 03:13:40,794 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-28 03:13:40,794 INFO L290 TraceCheckUtils]: 135: Hoare triple {52290#false} ~cond := #in~cond; {52290#false} is VALID [2022-04-28 03:13:40,794 INFO L290 TraceCheckUtils]: 136: Hoare triple {52290#false} assume !(0 == ~cond); {52290#false} is VALID [2022-04-28 03:13:40,794 INFO L290 TraceCheckUtils]: 137: Hoare triple {52290#false} assume true; {52290#false} is VALID [2022-04-28 03:13:40,794 INFO L284 TraceCheckUtils]: 138: Hoare quadruple {52290#false} {52290#false} #124#return; {52290#false} is VALID [2022-04-28 03:13:40,794 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-28 03:13:40,794 INFO L290 TraceCheckUtils]: 140: Hoare triple {52290#false} ~cond := #in~cond; {52290#false} is VALID [2022-04-28 03:13:40,795 INFO L290 TraceCheckUtils]: 141: Hoare triple {52290#false} assume !(0 == ~cond); {52290#false} is VALID [2022-04-28 03:13:40,795 INFO L290 TraceCheckUtils]: 142: Hoare triple {52290#false} assume true; {52290#false} is VALID [2022-04-28 03:13:40,795 INFO L284 TraceCheckUtils]: 143: Hoare quadruple {52290#false} {52290#false} #126#return; {52290#false} is VALID [2022-04-28 03:13:40,795 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-28 03:13:40,795 INFO L290 TraceCheckUtils]: 145: Hoare triple {52290#false} ~cond := #in~cond; {52290#false} is VALID [2022-04-28 03:13:40,795 INFO L290 TraceCheckUtils]: 146: Hoare triple {52290#false} assume !(0 == ~cond); {52290#false} is VALID [2022-04-28 03:13:40,795 INFO L290 TraceCheckUtils]: 147: Hoare triple {52290#false} assume true; {52290#false} is VALID [2022-04-28 03:13:40,795 INFO L284 TraceCheckUtils]: 148: Hoare quadruple {52290#false} {52290#false} #128#return; {52290#false} is VALID [2022-04-28 03:13:40,795 INFO L290 TraceCheckUtils]: 149: Hoare triple {52290#false} ~i~0 := ~j~0;~j~0 := 2 * ~j~0; {52290#false} is VALID [2022-04-28 03:13:40,795 INFO L290 TraceCheckUtils]: 150: Hoare triple {52290#false} assume !!(~j~0 <= ~r~0); {52290#false} is VALID [2022-04-28 03:13:40,795 INFO L290 TraceCheckUtils]: 151: Hoare triple {52290#false} assume !(~j~0 < ~r~0); {52290#false} is VALID [2022-04-28 03:13:40,795 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-28 03:13:40,795 INFO L290 TraceCheckUtils]: 153: Hoare triple {52290#false} ~cond := #in~cond; {52290#false} is VALID [2022-04-28 03:13:40,795 INFO L290 TraceCheckUtils]: 154: Hoare triple {52290#false} assume !(0 == ~cond); {52290#false} is VALID [2022-04-28 03:13:40,796 INFO L290 TraceCheckUtils]: 155: Hoare triple {52290#false} assume true; {52290#false} is VALID [2022-04-28 03:13:40,796 INFO L284 TraceCheckUtils]: 156: Hoare quadruple {52290#false} {52290#false} #118#return; {52290#false} is VALID [2022-04-28 03:13:40,796 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-28 03:13:40,796 INFO L290 TraceCheckUtils]: 158: Hoare triple {52290#false} ~cond := #in~cond; {52290#false} is VALID [2022-04-28 03:13:40,796 INFO L290 TraceCheckUtils]: 159: Hoare triple {52290#false} assume !(0 == ~cond); {52290#false} is VALID [2022-04-28 03:13:40,796 INFO L290 TraceCheckUtils]: 160: Hoare triple {52290#false} assume true; {52290#false} is VALID [2022-04-28 03:13:40,796 INFO L284 TraceCheckUtils]: 161: Hoare quadruple {52290#false} {52290#false} #120#return; {52290#false} is VALID [2022-04-28 03:13:40,796 INFO L290 TraceCheckUtils]: 162: Hoare triple {52290#false} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {52290#false} is VALID [2022-04-28 03:13:40,796 INFO L290 TraceCheckUtils]: 163: Hoare triple {52290#false} assume !(0 != #t~nondet5);havoc #t~nondet5; {52290#false} is VALID [2022-04-28 03:13:40,796 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-28 03:13:40,796 INFO L290 TraceCheckUtils]: 165: Hoare triple {52290#false} ~cond := #in~cond; {52290#false} is VALID [2022-04-28 03:13:40,796 INFO L290 TraceCheckUtils]: 166: Hoare triple {52290#false} assume !(0 == ~cond); {52290#false} is VALID [2022-04-28 03:13:40,796 INFO L290 TraceCheckUtils]: 167: Hoare triple {52290#false} assume true; {52290#false} is VALID [2022-04-28 03:13:40,796 INFO L284 TraceCheckUtils]: 168: Hoare quadruple {52290#false} {52290#false} #122#return; {52290#false} is VALID [2022-04-28 03:13:40,796 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-28 03:13:40,797 INFO L290 TraceCheckUtils]: 170: Hoare triple {52290#false} ~cond := #in~cond; {52290#false} is VALID [2022-04-28 03:13:40,797 INFO L290 TraceCheckUtils]: 171: Hoare triple {52290#false} assume 0 == ~cond; {52290#false} is VALID [2022-04-28 03:13:40,797 INFO L290 TraceCheckUtils]: 172: Hoare triple {52290#false} assume !false; {52290#false} is VALID [2022-04-28 03:13:40,799 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-28 03:13:40,800 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:13:41,726 INFO L290 TraceCheckUtils]: 172: Hoare triple {52290#false} assume !false; {52290#false} is VALID [2022-04-28 03:13:41,726 INFO L290 TraceCheckUtils]: 171: Hoare triple {52290#false} assume 0 == ~cond; {52290#false} is VALID [2022-04-28 03:13:41,726 INFO L290 TraceCheckUtils]: 170: Hoare triple {52290#false} ~cond := #in~cond; {52290#false} is VALID [2022-04-28 03:13:41,726 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-28 03:13:41,726 INFO L284 TraceCheckUtils]: 168: Hoare quadruple {52289#true} {52290#false} #122#return; {52290#false} is VALID [2022-04-28 03:13:41,726 INFO L290 TraceCheckUtils]: 167: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-28 03:13:41,726 INFO L290 TraceCheckUtils]: 166: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-28 03:13:41,726 INFO L290 TraceCheckUtils]: 165: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-28 03:13:41,726 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-28 03:13:41,726 INFO L290 TraceCheckUtils]: 163: Hoare triple {52290#false} assume !(0 != #t~nondet5);havoc #t~nondet5; {52290#false} is VALID [2022-04-28 03:13:41,726 INFO L290 TraceCheckUtils]: 162: Hoare triple {52290#false} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {52290#false} is VALID [2022-04-28 03:13:41,726 INFO L284 TraceCheckUtils]: 161: Hoare quadruple {52289#true} {52290#false} #120#return; {52290#false} is VALID [2022-04-28 03:13:41,727 INFO L290 TraceCheckUtils]: 160: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-28 03:13:41,727 INFO L290 TraceCheckUtils]: 159: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-28 03:13:41,727 INFO L290 TraceCheckUtils]: 158: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-28 03:13:41,727 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-28 03:13:41,727 INFO L284 TraceCheckUtils]: 156: Hoare quadruple {52289#true} {52290#false} #118#return; {52290#false} is VALID [2022-04-28 03:13:41,727 INFO L290 TraceCheckUtils]: 155: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-28 03:13:41,727 INFO L290 TraceCheckUtils]: 154: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-28 03:13:41,727 INFO L290 TraceCheckUtils]: 153: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-28 03:13:41,727 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-28 03:13:41,727 INFO L290 TraceCheckUtils]: 151: Hoare triple {52290#false} assume !(~j~0 < ~r~0); {52290#false} is VALID [2022-04-28 03:13:41,727 INFO L290 TraceCheckUtils]: 150: Hoare triple {52290#false} assume !!(~j~0 <= ~r~0); {52290#false} is VALID [2022-04-28 03:13:41,727 INFO L290 TraceCheckUtils]: 149: Hoare triple {52290#false} ~i~0 := ~j~0;~j~0 := 2 * ~j~0; {52290#false} is VALID [2022-04-28 03:13:41,727 INFO L284 TraceCheckUtils]: 148: Hoare quadruple {52289#true} {52290#false} #128#return; {52290#false} is VALID [2022-04-28 03:13:41,727 INFO L290 TraceCheckUtils]: 147: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-28 03:13:41,728 INFO L290 TraceCheckUtils]: 146: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-28 03:13:41,728 INFO L290 TraceCheckUtils]: 145: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-28 03:13:41,728 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-28 03:13:41,728 INFO L284 TraceCheckUtils]: 143: Hoare quadruple {52289#true} {52290#false} #126#return; {52290#false} is VALID [2022-04-28 03:13:41,728 INFO L290 TraceCheckUtils]: 142: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-28 03:13:41,728 INFO L290 TraceCheckUtils]: 141: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-28 03:13:41,728 INFO L290 TraceCheckUtils]: 140: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-28 03:13:41,728 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-28 03:13:41,728 INFO L284 TraceCheckUtils]: 138: Hoare quadruple {52289#true} {52290#false} #124#return; {52290#false} is VALID [2022-04-28 03:13:41,728 INFO L290 TraceCheckUtils]: 137: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-28 03:13:41,728 INFO L290 TraceCheckUtils]: 136: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-28 03:13:41,728 INFO L290 TraceCheckUtils]: 135: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-28 03:13:41,728 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-28 03:13:41,728 INFO L284 TraceCheckUtils]: 133: Hoare quadruple {52289#true} {52290#false} #122#return; {52290#false} is VALID [2022-04-28 03:13:41,728 INFO L290 TraceCheckUtils]: 132: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-28 03:13:41,729 INFO L290 TraceCheckUtils]: 131: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-28 03:13:41,729 INFO L290 TraceCheckUtils]: 130: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-28 03:13:41,729 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-28 03:13:41,729 INFO L290 TraceCheckUtils]: 128: Hoare triple {52290#false} assume !(0 != #t~nondet5);havoc #t~nondet5; {52290#false} is VALID [2022-04-28 03:13:41,729 INFO L290 TraceCheckUtils]: 127: Hoare triple {52290#false} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {52290#false} is VALID [2022-04-28 03:13:41,729 INFO L284 TraceCheckUtils]: 126: Hoare quadruple {52289#true} {52290#false} #120#return; {52290#false} is VALID [2022-04-28 03:13:41,729 INFO L290 TraceCheckUtils]: 125: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-28 03:13:41,729 INFO L290 TraceCheckUtils]: 124: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-28 03:13:41,729 INFO L290 TraceCheckUtils]: 123: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-28 03:13:41,729 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-28 03:13:41,729 INFO L284 TraceCheckUtils]: 121: Hoare quadruple {52289#true} {52290#false} #118#return; {52290#false} is VALID [2022-04-28 03:13:41,729 INFO L290 TraceCheckUtils]: 120: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-28 03:13:41,729 INFO L290 TraceCheckUtils]: 119: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-28 03:13:41,729 INFO L290 TraceCheckUtils]: 118: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-28 03:13:41,730 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-28 03:13:41,730 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-28 03:13:41,730 INFO L290 TraceCheckUtils]: 115: Hoare triple {52290#false} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {52290#false} is VALID [2022-04-28 03:13:41,730 INFO L284 TraceCheckUtils]: 114: Hoare quadruple {52289#true} {52290#false} #116#return; {52290#false} is VALID [2022-04-28 03:13:41,730 INFO L290 TraceCheckUtils]: 113: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-28 03:13:41,730 INFO L290 TraceCheckUtils]: 112: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-28 03:13:41,730 INFO L290 TraceCheckUtils]: 111: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-28 03:13:41,730 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-28 03:13:41,730 INFO L284 TraceCheckUtils]: 109: Hoare quadruple {52289#true} {52290#false} #114#return; {52290#false} is VALID [2022-04-28 03:13:41,730 INFO L290 TraceCheckUtils]: 108: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-28 03:13:41,730 INFO L290 TraceCheckUtils]: 107: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-28 03:13:41,730 INFO L290 TraceCheckUtils]: 106: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-28 03:13:41,730 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-28 03:13:41,730 INFO L284 TraceCheckUtils]: 104: Hoare quadruple {52289#true} {52290#false} #112#return; {52290#false} is VALID [2022-04-28 03:13:41,730 INFO L290 TraceCheckUtils]: 103: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-28 03:13:41,731 INFO L290 TraceCheckUtils]: 102: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-28 03:13:41,731 INFO L290 TraceCheckUtils]: 101: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-28 03:13:41,731 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-28 03:13:41,731 INFO L284 TraceCheckUtils]: 99: Hoare quadruple {52289#true} {52290#false} #110#return; {52290#false} is VALID [2022-04-28 03:13:41,731 INFO L290 TraceCheckUtils]: 98: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-28 03:13:41,731 INFO L290 TraceCheckUtils]: 97: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-28 03:13:41,731 INFO L290 TraceCheckUtils]: 96: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-28 03:13:41,731 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-28 03:13:41,731 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-28 03:13:41,732 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-28 03:13:41,732 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-28 03:13:41,732 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-28 03:13:41,733 INFO L290 TraceCheckUtils]: 90: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-28 03:13:41,733 INFO L290 TraceCheckUtils]: 89: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-28 03:13:41,733 INFO L290 TraceCheckUtils]: 88: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-28 03:13:41,733 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-28 03:13:41,733 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-28 03:13:41,733 INFO L290 TraceCheckUtils]: 85: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-28 03:13:41,733 INFO L290 TraceCheckUtils]: 84: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-28 03:13:41,733 INFO L290 TraceCheckUtils]: 83: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-28 03:13:41,733 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-28 03:13:41,734 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-28 03:13:41,734 INFO L290 TraceCheckUtils]: 80: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-28 03:13:41,734 INFO L290 TraceCheckUtils]: 79: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-28 03:13:41,734 INFO L290 TraceCheckUtils]: 78: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-28 03:13:41,734 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-28 03:13:41,735 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-28 03:13:41,735 INFO L290 TraceCheckUtils]: 75: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-28 03:13:41,735 INFO L290 TraceCheckUtils]: 74: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-28 03:13:41,735 INFO L290 TraceCheckUtils]: 73: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-28 03:13:41,735 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-28 03:13:41,735 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-28 03:13:41,735 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-28 03:13:41,736 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-28 03:13:41,736 INFO L290 TraceCheckUtils]: 68: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-28 03:13:41,736 INFO L290 TraceCheckUtils]: 67: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-28 03:13:41,736 INFO L290 TraceCheckUtils]: 66: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-28 03:13:41,736 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-28 03:13:41,737 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-28 03:13:41,737 INFO L290 TraceCheckUtils]: 63: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-28 03:13:41,737 INFO L290 TraceCheckUtils]: 62: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-28 03:13:41,737 INFO L290 TraceCheckUtils]: 61: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-28 03:13:41,737 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-28 03:13:41,737 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-28 03:13:41,737 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-28 03:13:41,738 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-28 03:13:41,738 INFO L290 TraceCheckUtils]: 56: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-28 03:13:41,738 INFO L290 TraceCheckUtils]: 55: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-28 03:13:41,738 INFO L290 TraceCheckUtils]: 54: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-28 03:13:41,738 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-28 03:13:41,738 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-28 03:13:41,739 INFO L290 TraceCheckUtils]: 51: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-28 03:13:41,739 INFO L290 TraceCheckUtils]: 50: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-28 03:13:41,739 INFO L290 TraceCheckUtils]: 49: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-28 03:13:41,739 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-28 03:13:41,739 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-28 03:13:41,739 INFO L290 TraceCheckUtils]: 46: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-28 03:13:41,739 INFO L290 TraceCheckUtils]: 45: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-28 03:13:41,739 INFO L290 TraceCheckUtils]: 44: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-28 03:13:41,739 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-28 03:13:41,740 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-28 03:13:41,740 INFO L290 TraceCheckUtils]: 41: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-28 03:13:41,740 INFO L290 TraceCheckUtils]: 40: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-28 03:13:41,740 INFO L290 TraceCheckUtils]: 39: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-28 03:13:41,740 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-28 03:13:41,740 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-28 03:13:41,741 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-28 03:13:41,741 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-28 03:13:41,742 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-28 03:13:41,742 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-28 03:13:41,742 INFO L290 TraceCheckUtils]: 32: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-28 03:13:41,742 INFO L290 TraceCheckUtils]: 31: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-28 03:13:41,742 INFO L290 TraceCheckUtils]: 30: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-28 03:13:41,742 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-28 03:13:41,743 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-28 03:13:41,743 INFO L290 TraceCheckUtils]: 27: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-28 03:13:41,743 INFO L290 TraceCheckUtils]: 26: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-28 03:13:41,743 INFO L290 TraceCheckUtils]: 25: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-28 03:13:41,743 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-28 03:13:41,743 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-28 03:13:41,744 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-28 03:13:41,744 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-28 03:13:41,745 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-28 03:13:41,745 INFO L290 TraceCheckUtils]: 19: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-28 03:13:41,745 INFO L290 TraceCheckUtils]: 18: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-28 03:13:41,745 INFO L290 TraceCheckUtils]: 17: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-28 03:13:41,745 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-28 03:13:41,745 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-28 03:13:41,745 INFO L290 TraceCheckUtils]: 14: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-28 03:13:41,745 INFO L290 TraceCheckUtils]: 13: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-28 03:13:41,746 INFO L290 TraceCheckUtils]: 12: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-28 03:13:41,746 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-28 03:13:41,746 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-28 03:13:41,747 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-28 03:13:41,747 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-28 03:13:41,747 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-28 03:13:41,747 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-28 03:13:41,747 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-28 03:13:41,747 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-28 03:13:41,747 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {52289#true} {52289#true} #138#return; {52289#true} is VALID [2022-04-28 03:13:41,748 INFO L290 TraceCheckUtils]: 2: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-28 03:13:41,748 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-28 03:13:41,748 INFO L272 TraceCheckUtils]: 0: Hoare triple {52289#true} call ULTIMATE.init(); {52289#true} is VALID [2022-04-28 03:13:41,748 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-28 03:13:41,748 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [79186673] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:13:41,748 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:13:41,749 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 8] total 21 [2022-04-28 03:13:41,749 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:13:41,749 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1979194843] [2022-04-28 03:13:41,749 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1979194843] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:13:41,749 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:13:41,749 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-28 03:13:41,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [916438887] [2022-04-28 03:13:41,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:13:41,750 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-28 03:13:41,750 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:13:41,750 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-28 03:13:41,832 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-28 03:13:41,832 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-28 03:13:41,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:13:41,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-28 03:13:41,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=356, Unknown=0, NotChecked=0, Total=420 [2022-04-28 03:13:41,833 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-28 03:13:45,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:13:45,864 INFO L93 Difference]: Finished difference Result 399 states and 535 transitions. [2022-04-28 03:13:45,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-28 03:13:45,864 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-28 03:13:45,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:13:45,865 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-28 03:13:45,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 223 transitions. [2022-04-28 03:13:45,867 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-28 03:13:45,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 223 transitions. [2022-04-28 03:13:45,869 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 223 transitions. [2022-04-28 03:13:46,055 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-28 03:13:46,058 INFO L225 Difference]: With dead ends: 399 [2022-04-28 03:13:46,058 INFO L226 Difference]: Without dead ends: 246 [2022-04-28 03:13:46,059 INFO L412 NwaCegarLoop]: 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-28 03:13:46,059 INFO L413 NwaCegarLoop]: 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-28 03:13:46,060 INFO L414 NwaCegarLoop]: 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-28 03:13:46,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2022-04-28 03:13:47,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 211. [2022-04-28 03:13:47,372 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:13:47,373 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-28 03:13:47,381 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-28 03:13:47,381 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-28 03:13:47,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:13:47,385 INFO L93 Difference]: Finished difference Result 246 states and 325 transitions. [2022-04-28 03:13:47,385 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 325 transitions. [2022-04-28 03:13:47,389 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:13:47,389 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:13:47,389 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-28 03:13:47,389 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-28 03:13:47,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:13:47,393 INFO L93 Difference]: Finished difference Result 246 states and 325 transitions. [2022-04-28 03:13:47,393 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 325 transitions. [2022-04-28 03:13:47,394 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:13:47,394 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:13:47,394 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:13:47,394 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:13:47,394 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-28 03:13:47,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 276 transitions. [2022-04-28 03:13:47,397 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 276 transitions. Word has length 173 [2022-04-28 03:13:47,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:13:47,398 INFO L495 AbstractCegarLoop]: Abstraction has 211 states and 276 transitions. [2022-04-28 03:13:47,398 INFO L496 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-28 03:13:47,398 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 211 states and 276 transitions. [2022-04-28 03:13:47,930 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-28 03:13:47,930 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 276 transitions. [2022-04-28 03:13:47,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2022-04-28 03:13:47,931 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:13:47,931 INFO L195 NwaCegarLoop]: 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-28 03:13:47,947 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-28 03:13:48,131 WARN L477 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-28 03:13:48,132 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:13:48,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:13:48,132 INFO L85 PathProgramCache]: Analyzing trace with hash 345153677, now seen corresponding path program 5 times [2022-04-28 03:13:48,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:13:48,132 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1167243519] [2022-04-28 03:13:48,132 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 03:13:48,132 INFO L85 PathProgramCache]: Analyzing trace with hash 345153677, now seen corresponding path program 6 times [2022-04-28 03:13:48,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:13:48,133 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [404265583] [2022-04-28 03:13:48,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:13:48,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:13:48,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:13:48,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:13:48,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:13:48,204 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-28 03:13:48,204 INFO L290 TraceCheckUtils]: 1: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-28 03:13:48,204 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {55194#true} {55194#true} #138#return; {55194#true} is VALID [2022-04-28 03:13:48,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-28 03:13:48,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:13:48,207 INFO L290 TraceCheckUtils]: 0: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-28 03:13:48,207 INFO L290 TraceCheckUtils]: 1: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-28 03:13:48,207 INFO L290 TraceCheckUtils]: 2: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-28 03:13:48,207 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-28 03:13:48,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-04-28 03:13:48,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:13:48,209 INFO L290 TraceCheckUtils]: 0: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-28 03:13:48,209 INFO L290 TraceCheckUtils]: 1: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-28 03:13:48,209 INFO L290 TraceCheckUtils]: 2: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-28 03:13:48,210 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-28 03:13:48,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-04-28 03:13:48,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:13:48,213 INFO L290 TraceCheckUtils]: 0: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-28 03:13:48,213 INFO L290 TraceCheckUtils]: 1: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-28 03:13:48,213 INFO L290 TraceCheckUtils]: 2: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-28 03:13:48,213 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-28 03:13:48,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-04-28 03:13:48,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:13:48,215 INFO L290 TraceCheckUtils]: 0: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-28 03:13:48,215 INFO L290 TraceCheckUtils]: 1: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-28 03:13:48,215 INFO L290 TraceCheckUtils]: 2: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-28 03:13:48,215 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-28 03:13:48,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-04-28 03:13:48,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:13:48,218 INFO L290 TraceCheckUtils]: 0: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-28 03:13:48,218 INFO L290 TraceCheckUtils]: 1: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-28 03:13:48,219 INFO L290 TraceCheckUtils]: 2: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-28 03:13:48,219 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-28 03:13:48,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-04-28 03:13:48,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:13:48,221 INFO L290 TraceCheckUtils]: 0: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-28 03:13:48,221 INFO L290 TraceCheckUtils]: 1: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-28 03:13:48,221 INFO L290 TraceCheckUtils]: 2: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-28 03:13:48,222 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-28 03:13:48,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-04-28 03:13:48,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:13:48,224 INFO L290 TraceCheckUtils]: 0: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-28 03:13:48,224 INFO L290 TraceCheckUtils]: 1: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-28 03:13:48,224 INFO L290 TraceCheckUtils]: 2: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-28 03:13:48,224 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-28 03:13:48,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-04-28 03:13:48,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:13:48,232 INFO L290 TraceCheckUtils]: 0: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-28 03:13:48,232 INFO L290 TraceCheckUtils]: 1: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-28 03:13:48,232 INFO L290 TraceCheckUtils]: 2: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-28 03:13:48,233 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-28 03:13:48,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-04-28 03:13:48,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:13:48,235 INFO L290 TraceCheckUtils]: 0: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-28 03:13:48,235 INFO L290 TraceCheckUtils]: 1: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-28 03:13:48,235 INFO L290 TraceCheckUtils]: 2: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-28 03:13:48,236 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-28 03:13:48,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-04-28 03:13:48,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:13:48,238 INFO L290 TraceCheckUtils]: 0: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-28 03:13:48,238 INFO L290 TraceCheckUtils]: 1: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-28 03:13:48,238 INFO L290 TraceCheckUtils]: 2: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-28 03:13:48,238 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-28 03:13:48,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-04-28 03:13:48,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:13:48,241 INFO L290 TraceCheckUtils]: 0: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-28 03:13:48,241 INFO L290 TraceCheckUtils]: 1: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-28 03:13:48,241 INFO L290 TraceCheckUtils]: 2: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-28 03:13:48,242 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-28 03:13:48,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-04-28 03:13:48,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:13:48,244 INFO L290 TraceCheckUtils]: 0: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-28 03:13:48,244 INFO L290 TraceCheckUtils]: 1: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-28 03:13:48,244 INFO L290 TraceCheckUtils]: 2: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-28 03:13:48,245 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-28 03:13:48,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-04-28 03:13:48,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:13:48,247 INFO L290 TraceCheckUtils]: 0: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-28 03:13:48,247 INFO L290 TraceCheckUtils]: 1: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-28 03:13:48,247 INFO L290 TraceCheckUtils]: 2: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-28 03:13:48,247 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-28 03:13:48,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-04-28 03:13:48,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:13:48,251 INFO L290 TraceCheckUtils]: 0: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-28 03:13:48,251 INFO L290 TraceCheckUtils]: 1: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-28 03:13:48,251 INFO L290 TraceCheckUtils]: 2: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-28 03:13:48,252 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-28 03:13:48,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-04-28 03:13:48,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:13:48,254 INFO L290 TraceCheckUtils]: 0: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-28 03:13:48,254 INFO L290 TraceCheckUtils]: 1: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-28 03:13:48,254 INFO L290 TraceCheckUtils]: 2: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-28 03:13:48,254 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {55194#true} {55195#false} #110#return; {55195#false} is VALID [2022-04-28 03:13:48,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-04-28 03:13:48,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:13:48,256 INFO L290 TraceCheckUtils]: 0: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-28 03:13:48,257 INFO L290 TraceCheckUtils]: 1: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-28 03:13:48,257 INFO L290 TraceCheckUtils]: 2: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-28 03:13:48,257 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {55194#true} {55195#false} #112#return; {55195#false} is VALID [2022-04-28 03:13:48,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-04-28 03:13:48,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:13:48,260 INFO L290 TraceCheckUtils]: 0: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-28 03:13:48,260 INFO L290 TraceCheckUtils]: 1: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-28 03:13:48,260 INFO L290 TraceCheckUtils]: 2: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-28 03:13:48,260 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {55194#true} {55195#false} #114#return; {55195#false} is VALID [2022-04-28 03:13:48,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-04-28 03:13:48,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:13:48,262 INFO L290 TraceCheckUtils]: 0: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-28 03:13:48,262 INFO L290 TraceCheckUtils]: 1: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-28 03:13:48,262 INFO L290 TraceCheckUtils]: 2: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-28 03:13:48,263 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {55194#true} {55195#false} #116#return; {55195#false} is VALID [2022-04-28 03:13:48,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-04-28 03:13:48,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:13:48,264 INFO L290 TraceCheckUtils]: 0: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-28 03:13:48,264 INFO L290 TraceCheckUtils]: 1: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-28 03:13:48,265 INFO L290 TraceCheckUtils]: 2: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-28 03:13:48,265 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {55194#true} {55195#false} #118#return; {55195#false} is VALID [2022-04-28 03:13:48,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-04-28 03:13:48,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:13:48,266 INFO L290 TraceCheckUtils]: 0: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-28 03:13:48,266 INFO L290 TraceCheckUtils]: 1: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-28 03:13:48,267 INFO L290 TraceCheckUtils]: 2: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-28 03:13:48,267 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {55194#true} {55195#false} #120#return; {55195#false} is VALID [2022-04-28 03:13:48,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-04-28 03:13:48,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:13:48,268 INFO L290 TraceCheckUtils]: 0: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-28 03:13:48,268 INFO L290 TraceCheckUtils]: 1: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-28 03:13:48,269 INFO L290 TraceCheckUtils]: 2: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-28 03:13:48,269 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {55194#true} {55195#false} #122#return; {55195#false} is VALID [2022-04-28 03:13:48,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2022-04-28 03:13:48,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:13:48,271 INFO L290 TraceCheckUtils]: 0: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-28 03:13:48,271 INFO L290 TraceCheckUtils]: 1: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-28 03:13:48,271 INFO L290 TraceCheckUtils]: 2: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-28 03:13:48,271 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {55194#true} {55195#false} #124#return; {55195#false} is VALID [2022-04-28 03:13:48,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2022-04-28 03:13:48,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:13:48,274 INFO L290 TraceCheckUtils]: 0: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-28 03:13:48,274 INFO L290 TraceCheckUtils]: 1: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-28 03:13:48,274 INFO L290 TraceCheckUtils]: 2: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-28 03:13:48,274 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {55194#true} {55195#false} #126#return; {55195#false} is VALID [2022-04-28 03:13:48,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2022-04-28 03:13:48,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:13:48,276 INFO L290 TraceCheckUtils]: 0: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-28 03:13:48,276 INFO L290 TraceCheckUtils]: 1: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-28 03:13:48,276 INFO L290 TraceCheckUtils]: 2: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-28 03:13:48,276 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {55194#true} {55195#false} #128#return; {55195#false} is VALID [2022-04-28 03:13:48,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2022-04-28 03:13:48,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:13:48,277 INFO L290 TraceCheckUtils]: 0: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-28 03:13:48,277 INFO L290 TraceCheckUtils]: 1: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-28 03:13:48,278 INFO L290 TraceCheckUtils]: 2: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-28 03:13:48,278 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {55194#true} {55195#false} #118#return; {55195#false} is VALID [2022-04-28 03:13:48,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2022-04-28 03:13:48,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:13:48,287 INFO L290 TraceCheckUtils]: 0: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-28 03:13:48,287 INFO L290 TraceCheckUtils]: 1: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-28 03:13:48,288 INFO L290 TraceCheckUtils]: 2: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-28 03:13:48,288 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {55194#true} {55195#false} #120#return; {55195#false} is VALID [2022-04-28 03:13:48,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2022-04-28 03:13:48,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:13:48,289 INFO L290 TraceCheckUtils]: 0: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-28 03:13:48,290 INFO L290 TraceCheckUtils]: 1: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-28 03:13:48,290 INFO L290 TraceCheckUtils]: 2: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-28 03:13:48,290 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {55194#true} {55195#false} #122#return; {55195#false} is VALID [2022-04-28 03:13:48,290 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-28 03:13:48,290 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-28 03:13:48,290 INFO L290 TraceCheckUtils]: 2: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-28 03:13:48,290 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {55194#true} {55194#true} #138#return; {55194#true} is VALID [2022-04-28 03:13:48,290 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-28 03:13:48,290 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-28 03:13:48,291 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-28 03:13:48,291 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-28 03:13:48,291 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-28 03:13:48,291 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-28 03:13:48,292 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-28 03:13:48,292 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-28 03:13:48,292 INFO L290 TraceCheckUtils]: 12: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-28 03:13:48,292 INFO L290 TraceCheckUtils]: 13: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-28 03:13:48,292 INFO L290 TraceCheckUtils]: 14: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-28 03:13:48,292 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-28 03:13:48,292 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-28 03:13:48,292 INFO L290 TraceCheckUtils]: 17: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-28 03:13:48,292 INFO L290 TraceCheckUtils]: 18: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-28 03:13:48,293 INFO L290 TraceCheckUtils]: 19: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-28 03:13:48,293 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-28 03:13:48,293 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-28 03:13:48,293 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-28 03:13:48,294 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-28 03:13:48,294 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-28 03:13:48,294 INFO L290 TraceCheckUtils]: 25: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-28 03:13:48,294 INFO L290 TraceCheckUtils]: 26: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-28 03:13:48,294 INFO L290 TraceCheckUtils]: 27: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-28 03:13:48,294 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-28 03:13:48,294 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-28 03:13:48,295 INFO L290 TraceCheckUtils]: 30: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-28 03:13:48,295 INFO L290 TraceCheckUtils]: 31: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-28 03:13:48,295 INFO L290 TraceCheckUtils]: 32: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-28 03:13:48,295 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-28 03:13:48,295 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-28 03:13:48,296 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-28 03:13:48,296 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-28 03:13:48,296 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-28 03:13:48,296 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-28 03:13:48,297 INFO L290 TraceCheckUtils]: 39: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-28 03:13:48,297 INFO L290 TraceCheckUtils]: 40: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-28 03:13:48,297 INFO L290 TraceCheckUtils]: 41: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-28 03:13:48,297 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-28 03:13:48,297 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-28 03:13:48,297 INFO L290 TraceCheckUtils]: 44: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-28 03:13:48,297 INFO L290 TraceCheckUtils]: 45: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-28 03:13:48,297 INFO L290 TraceCheckUtils]: 46: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-28 03:13:48,298 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-28 03:13:48,298 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-28 03:13:48,298 INFO L290 TraceCheckUtils]: 49: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-28 03:13:48,298 INFO L290 TraceCheckUtils]: 50: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-28 03:13:48,298 INFO L290 TraceCheckUtils]: 51: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-28 03:13:48,298 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-28 03:13:48,298 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-28 03:13:48,298 INFO L290 TraceCheckUtils]: 54: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-28 03:13:48,298 INFO L290 TraceCheckUtils]: 55: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-28 03:13:48,298 INFO L290 TraceCheckUtils]: 56: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-28 03:13:48,299 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-28 03:13:48,299 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-28 03:13:48,299 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-28 03:13:48,299 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-28 03:13:48,300 INFO L290 TraceCheckUtils]: 61: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-28 03:13:48,300 INFO L290 TraceCheckUtils]: 62: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-28 03:13:48,300 INFO L290 TraceCheckUtils]: 63: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-28 03:13:48,300 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-28 03:13:48,300 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-28 03:13:48,300 INFO L290 TraceCheckUtils]: 66: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-28 03:13:48,300 INFO L290 TraceCheckUtils]: 67: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-28 03:13:48,300 INFO L290 TraceCheckUtils]: 68: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-28 03:13:48,301 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-28 03:13:48,301 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-28 03:13:48,301 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-28 03:13:48,301 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-28 03:13:48,301 INFO L290 TraceCheckUtils]: 73: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-28 03:13:48,301 INFO L290 TraceCheckUtils]: 74: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-28 03:13:48,301 INFO L290 TraceCheckUtils]: 75: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-28 03:13:48,302 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-28 03:13:48,302 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-28 03:13:48,302 INFO L290 TraceCheckUtils]: 78: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-28 03:13:48,302 INFO L290 TraceCheckUtils]: 79: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-28 03:13:48,302 INFO L290 TraceCheckUtils]: 80: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-28 03:13:48,302 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-28 03:13:48,302 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-28 03:13:48,303 INFO L290 TraceCheckUtils]: 83: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-28 03:13:48,303 INFO L290 TraceCheckUtils]: 84: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-28 03:13:48,303 INFO L290 TraceCheckUtils]: 85: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-28 03:13:48,303 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-28 03:13:48,303 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-28 03:13:48,303 INFO L290 TraceCheckUtils]: 88: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-28 03:13:48,303 INFO L290 TraceCheckUtils]: 89: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-28 03:13:48,303 INFO L290 TraceCheckUtils]: 90: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-28 03:13:48,304 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-28 03:13:48,304 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-28 03:13:48,304 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-28 03:13:48,305 INFO L290 TraceCheckUtils]: 94: Hoare triple {55260#(<= main_~r~0 main_~j~0)} assume ~j~0 < ~r~0; {55195#false} is VALID [2022-04-28 03:13:48,305 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-28 03:13:48,305 INFO L290 TraceCheckUtils]: 96: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-28 03:13:48,305 INFO L290 TraceCheckUtils]: 97: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-28 03:13:48,305 INFO L290 TraceCheckUtils]: 98: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-28 03:13:48,305 INFO L284 TraceCheckUtils]: 99: Hoare quadruple {55194#true} {55195#false} #110#return; {55195#false} is VALID [2022-04-28 03:13:48,305 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-28 03:13:48,305 INFO L290 TraceCheckUtils]: 101: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-28 03:13:48,305 INFO L290 TraceCheckUtils]: 102: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-28 03:13:48,305 INFO L290 TraceCheckUtils]: 103: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-28 03:13:48,305 INFO L284 TraceCheckUtils]: 104: Hoare quadruple {55194#true} {55195#false} #112#return; {55195#false} is VALID [2022-04-28 03:13:48,305 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-28 03:13:48,305 INFO L290 TraceCheckUtils]: 106: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-28 03:13:48,305 INFO L290 TraceCheckUtils]: 107: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-28 03:13:48,305 INFO L290 TraceCheckUtils]: 108: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-28 03:13:48,306 INFO L284 TraceCheckUtils]: 109: Hoare quadruple {55194#true} {55195#false} #114#return; {55195#false} is VALID [2022-04-28 03:13:48,306 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-28 03:13:48,306 INFO L290 TraceCheckUtils]: 111: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-28 03:13:48,306 INFO L290 TraceCheckUtils]: 112: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-28 03:13:48,306 INFO L290 TraceCheckUtils]: 113: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-28 03:13:48,306 INFO L284 TraceCheckUtils]: 114: Hoare quadruple {55194#true} {55195#false} #116#return; {55195#false} is VALID [2022-04-28 03:13:48,306 INFO L290 TraceCheckUtils]: 115: Hoare triple {55195#false} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {55195#false} is VALID [2022-04-28 03:13:48,306 INFO L290 TraceCheckUtils]: 116: Hoare triple {55195#false} assume !(0 != #t~nondet4);havoc #t~nondet4; {55195#false} is VALID [2022-04-28 03:13:48,306 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-28 03:13:48,306 INFO L290 TraceCheckUtils]: 118: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-28 03:13:48,306 INFO L290 TraceCheckUtils]: 119: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-28 03:13:48,306 INFO L290 TraceCheckUtils]: 120: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-28 03:13:48,306 INFO L284 TraceCheckUtils]: 121: Hoare quadruple {55194#true} {55195#false} #118#return; {55195#false} is VALID [2022-04-28 03:13:48,306 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-28 03:13:48,306 INFO L290 TraceCheckUtils]: 123: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-28 03:13:48,307 INFO L290 TraceCheckUtils]: 124: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-28 03:13:48,307 INFO L290 TraceCheckUtils]: 125: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-28 03:13:48,307 INFO L284 TraceCheckUtils]: 126: Hoare quadruple {55194#true} {55195#false} #120#return; {55195#false} is VALID [2022-04-28 03:13:48,307 INFO L290 TraceCheckUtils]: 127: Hoare triple {55195#false} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {55195#false} is VALID [2022-04-28 03:13:48,307 INFO L290 TraceCheckUtils]: 128: Hoare triple {55195#false} assume !(0 != #t~nondet5);havoc #t~nondet5; {55195#false} is VALID [2022-04-28 03:13:48,307 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-28 03:13:48,307 INFO L290 TraceCheckUtils]: 130: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-28 03:13:48,307 INFO L290 TraceCheckUtils]: 131: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-28 03:13:48,307 INFO L290 TraceCheckUtils]: 132: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-28 03:13:48,307 INFO L284 TraceCheckUtils]: 133: Hoare quadruple {55194#true} {55195#false} #122#return; {55195#false} is VALID [2022-04-28 03:13:48,307 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-28 03:13:48,307 INFO L290 TraceCheckUtils]: 135: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-28 03:13:48,307 INFO L290 TraceCheckUtils]: 136: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-28 03:13:48,307 INFO L290 TraceCheckUtils]: 137: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-28 03:13:48,308 INFO L284 TraceCheckUtils]: 138: Hoare quadruple {55194#true} {55195#false} #124#return; {55195#false} is VALID [2022-04-28 03:13:48,308 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-28 03:13:48,308 INFO L290 TraceCheckUtils]: 140: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-28 03:13:48,308 INFO L290 TraceCheckUtils]: 141: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-28 03:13:48,308 INFO L290 TraceCheckUtils]: 142: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-28 03:13:48,308 INFO L284 TraceCheckUtils]: 143: Hoare quadruple {55194#true} {55195#false} #126#return; {55195#false} is VALID [2022-04-28 03:13:48,308 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-28 03:13:48,308 INFO L290 TraceCheckUtils]: 145: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-28 03:13:48,308 INFO L290 TraceCheckUtils]: 146: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-28 03:13:48,308 INFO L290 TraceCheckUtils]: 147: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-28 03:13:48,308 INFO L284 TraceCheckUtils]: 148: Hoare quadruple {55194#true} {55195#false} #128#return; {55195#false} is VALID [2022-04-28 03:13:48,308 INFO L290 TraceCheckUtils]: 149: Hoare triple {55195#false} ~i~0 := ~j~0;~j~0 := 2 * ~j~0; {55195#false} is VALID [2022-04-28 03:13:48,308 INFO L290 TraceCheckUtils]: 150: Hoare triple {55195#false} assume !!(~j~0 <= ~r~0); {55195#false} is VALID [2022-04-28 03:13:48,308 INFO L290 TraceCheckUtils]: 151: Hoare triple {55195#false} assume !(~j~0 < ~r~0); {55195#false} is VALID [2022-04-28 03:13:48,308 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-28 03:13:48,309 INFO L290 TraceCheckUtils]: 153: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-28 03:13:48,309 INFO L290 TraceCheckUtils]: 154: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-28 03:13:48,309 INFO L290 TraceCheckUtils]: 155: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-28 03:13:48,309 INFO L284 TraceCheckUtils]: 156: Hoare quadruple {55194#true} {55195#false} #118#return; {55195#false} is VALID [2022-04-28 03:13:48,309 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-28 03:13:48,309 INFO L290 TraceCheckUtils]: 158: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-28 03:13:48,309 INFO L290 TraceCheckUtils]: 159: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-28 03:13:48,309 INFO L290 TraceCheckUtils]: 160: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-28 03:13:48,309 INFO L284 TraceCheckUtils]: 161: Hoare quadruple {55194#true} {55195#false} #120#return; {55195#false} is VALID [2022-04-28 03:13:48,309 INFO L290 TraceCheckUtils]: 162: Hoare triple {55195#false} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {55195#false} is VALID [2022-04-28 03:13:48,309 INFO L290 TraceCheckUtils]: 163: Hoare triple {55195#false} assume !(0 != #t~nondet5);havoc #t~nondet5; {55195#false} is VALID [2022-04-28 03:13:48,309 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-28 03:13:48,309 INFO L290 TraceCheckUtils]: 165: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-28 03:13:48,309 INFO L290 TraceCheckUtils]: 166: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-28 03:13:48,309 INFO L290 TraceCheckUtils]: 167: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-28 03:13:48,310 INFO L284 TraceCheckUtils]: 168: Hoare quadruple {55194#true} {55195#false} #122#return; {55195#false} is VALID [2022-04-28 03:13:48,310 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-28 03:13:48,310 INFO L290 TraceCheckUtils]: 170: Hoare triple {55195#false} ~cond := #in~cond; {55195#false} is VALID [2022-04-28 03:13:48,310 INFO L290 TraceCheckUtils]: 171: Hoare triple {55195#false} assume 0 == ~cond; {55195#false} is VALID [2022-04-28 03:13:48,310 INFO L290 TraceCheckUtils]: 172: Hoare triple {55195#false} assume !false; {55195#false} is VALID [2022-04-28 03:13:48,310 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-28 03:13:48,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:13:48,311 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [404265583] [2022-04-28 03:13:48,311 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [404265583] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:13:48,311 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1947308777] [2022-04-28 03:13:48,311 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 03:13:48,311 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:13:48,311 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:13:48,312 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-28 03:13:48,314 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-28 03:13:48,378 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-04-28 03:13:48,379 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 03:13:48,379 INFO L263 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-28 03:13:48,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:13:48,394 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:13:49,508 INFO L272 TraceCheckUtils]: 0: Hoare triple {55194#true} call ULTIMATE.init(); {55194#true} is VALID [2022-04-28 03:13:49,509 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-28 03:13:49,509 INFO L290 TraceCheckUtils]: 2: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-28 03:13:49,509 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {55194#true} {55194#true} #138#return; {55194#true} is VALID [2022-04-28 03:13:49,509 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-28 03:13:49,509 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-28 03:13:49,509 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-28 03:13:49,509 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-28 03:13:49,510 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-28 03:13:49,510 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-28 03:13:49,510 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-28 03:13:49,510 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-28 03:13:49,510 INFO L290 TraceCheckUtils]: 12: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-28 03:13:49,511 INFO L290 TraceCheckUtils]: 13: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-28 03:13:49,511 INFO L290 TraceCheckUtils]: 14: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-28 03:13:49,511 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-28 03:13:49,511 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-28 03:13:49,511 INFO L290 TraceCheckUtils]: 17: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-28 03:13:49,511 INFO L290 TraceCheckUtils]: 18: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-28 03:13:49,511 INFO L290 TraceCheckUtils]: 19: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-28 03:13:49,512 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-28 03:13:49,512 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-28 03:13:49,512 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-28 03:13:49,512 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-28 03:13:49,513 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-28 03:13:49,513 INFO L290 TraceCheckUtils]: 25: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-28 03:13:49,513 INFO L290 TraceCheckUtils]: 26: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-28 03:13:49,513 INFO L290 TraceCheckUtils]: 27: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-28 03:13:49,513 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-28 03:13:49,513 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-28 03:13:49,513 INFO L290 TraceCheckUtils]: 30: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-28 03:13:49,513 INFO L290 TraceCheckUtils]: 31: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-28 03:13:49,513 INFO L290 TraceCheckUtils]: 32: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-28 03:13:49,514 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-28 03:13:49,514 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-28 03:13:49,514 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-28 03:13:49,515 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-28 03:13:49,515 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-28 03:13:49,515 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-28 03:13:49,515 INFO L290 TraceCheckUtils]: 39: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-28 03:13:49,515 INFO L290 TraceCheckUtils]: 40: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-28 03:13:49,515 INFO L290 TraceCheckUtils]: 41: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-28 03:13:49,516 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-28 03:13:49,516 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-28 03:13:49,516 INFO L290 TraceCheckUtils]: 44: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-28 03:13:49,516 INFO L290 TraceCheckUtils]: 45: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-28 03:13:49,516 INFO L290 TraceCheckUtils]: 46: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-28 03:13:49,516 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-28 03:13:49,517 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-28 03:13:49,517 INFO L290 TraceCheckUtils]: 49: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-28 03:13:49,517 INFO L290 TraceCheckUtils]: 50: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-28 03:13:49,517 INFO L290 TraceCheckUtils]: 51: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-28 03:13:49,517 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-28 03:13:49,517 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-28 03:13:49,517 INFO L290 TraceCheckUtils]: 54: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-28 03:13:49,517 INFO L290 TraceCheckUtils]: 55: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-28 03:13:49,517 INFO L290 TraceCheckUtils]: 56: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-28 03:13:49,518 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-28 03:13:49,518 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-28 03:13:49,519 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-28 03:13:49,519 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-28 03:13:49,519 INFO L290 TraceCheckUtils]: 61: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-28 03:13:49,519 INFO L290 TraceCheckUtils]: 62: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-28 03:13:49,519 INFO L290 TraceCheckUtils]: 63: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-28 03:13:49,528 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-28 03:13:49,529 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-28 03:13:49,529 INFO L290 TraceCheckUtils]: 66: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-28 03:13:49,529 INFO L290 TraceCheckUtils]: 67: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-28 03:13:49,529 INFO L290 TraceCheckUtils]: 68: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-28 03:13:49,529 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-28 03:13:49,530 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-28 03:13:49,530 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-28 03:13:49,530 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-28 03:13:49,530 INFO L290 TraceCheckUtils]: 73: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-28 03:13:49,530 INFO L290 TraceCheckUtils]: 74: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-28 03:13:49,530 INFO L290 TraceCheckUtils]: 75: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-28 03:13:49,531 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-28 03:13:49,531 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-28 03:13:49,531 INFO L290 TraceCheckUtils]: 78: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-28 03:13:49,531 INFO L290 TraceCheckUtils]: 79: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-28 03:13:49,531 INFO L290 TraceCheckUtils]: 80: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-28 03:13:49,531 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-28 03:13:49,532 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-28 03:13:49,532 INFO L290 TraceCheckUtils]: 83: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-28 03:13:49,532 INFO L290 TraceCheckUtils]: 84: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-28 03:13:49,532 INFO L290 TraceCheckUtils]: 85: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-28 03:13:49,532 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-28 03:13:49,532 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-28 03:13:49,532 INFO L290 TraceCheckUtils]: 88: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-28 03:13:49,532 INFO L290 TraceCheckUtils]: 89: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-28 03:13:49,532 INFO L290 TraceCheckUtils]: 90: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-28 03:13:49,539 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-28 03:13:49,540 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-28 03:13:49,540 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-28 03:13:49,540 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-28 03:13:49,540 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-28 03:13:49,541 INFO L290 TraceCheckUtils]: 96: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-28 03:13:49,541 INFO L290 TraceCheckUtils]: 97: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-28 03:13:49,541 INFO L290 TraceCheckUtils]: 98: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-28 03:13:49,541 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-28 03:13:49,541 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-28 03:13:49,541 INFO L290 TraceCheckUtils]: 101: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-28 03:13:49,541 INFO L290 TraceCheckUtils]: 102: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-28 03:13:49,541 INFO L290 TraceCheckUtils]: 103: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-28 03:13:49,542 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-28 03:13:49,542 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-28 03:13:49,542 INFO L290 TraceCheckUtils]: 106: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-28 03:13:49,542 INFO L290 TraceCheckUtils]: 107: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-28 03:13:49,542 INFO L290 TraceCheckUtils]: 108: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-28 03:13:49,542 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-28 03:13:49,542 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-28 03:13:49,543 INFO L290 TraceCheckUtils]: 111: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-28 03:13:49,543 INFO L290 TraceCheckUtils]: 112: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-28 03:13:49,543 INFO L290 TraceCheckUtils]: 113: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-28 03:13:49,543 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-28 03:13:49,543 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-28 03:13:49,544 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-28 03:13:49,544 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-28 03:13:49,544 INFO L290 TraceCheckUtils]: 118: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-28 03:13:49,544 INFO L290 TraceCheckUtils]: 119: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-28 03:13:49,544 INFO L290 TraceCheckUtils]: 120: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-28 03:13:49,544 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-28 03:13:49,544 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-28 03:13:49,544 INFO L290 TraceCheckUtils]: 123: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-28 03:13:49,545 INFO L290 TraceCheckUtils]: 124: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-28 03:13:49,545 INFO L290 TraceCheckUtils]: 125: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-28 03:13:49,545 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-28 03:13:49,545 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-28 03:13:49,546 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-28 03:13:49,546 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-28 03:13:49,546 INFO L290 TraceCheckUtils]: 130: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-28 03:13:49,546 INFO L290 TraceCheckUtils]: 131: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-28 03:13:49,546 INFO L290 TraceCheckUtils]: 132: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-28 03:13:49,546 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-28 03:13:49,546 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-28 03:13:49,546 INFO L290 TraceCheckUtils]: 135: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-28 03:13:49,546 INFO L290 TraceCheckUtils]: 136: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-28 03:13:49,547 INFO L290 TraceCheckUtils]: 137: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-28 03:13:49,547 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-28 03:13:49,547 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-28 03:13:49,547 INFO L290 TraceCheckUtils]: 140: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-28 03:13:49,547 INFO L290 TraceCheckUtils]: 141: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-28 03:13:49,547 INFO L290 TraceCheckUtils]: 142: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-28 03:13:49,548 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-28 03:13:49,548 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-28 03:13:49,548 INFO L290 TraceCheckUtils]: 145: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-28 03:13:49,548 INFO L290 TraceCheckUtils]: 146: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-28 03:13:49,548 INFO L290 TraceCheckUtils]: 147: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-28 03:13:49,548 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-28 03:13:49,549 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-28 03:13:49,549 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-28 03:13:49,550 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-28 03:13:49,550 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-28 03:13:49,550 INFO L290 TraceCheckUtils]: 153: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-28 03:13:49,550 INFO L290 TraceCheckUtils]: 154: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-28 03:13:49,550 INFO L290 TraceCheckUtils]: 155: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-28 03:13:49,550 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-28 03:13:49,550 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-28 03:13:49,550 INFO L290 TraceCheckUtils]: 158: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-28 03:13:49,550 INFO L290 TraceCheckUtils]: 159: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-28 03:13:49,550 INFO L290 TraceCheckUtils]: 160: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-28 03:13:49,551 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-28 03:13:49,551 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-28 03:13:49,551 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-28 03:13:49,552 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-28 03:13:49,552 INFO L290 TraceCheckUtils]: 165: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-28 03:13:49,552 INFO L290 TraceCheckUtils]: 166: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-28 03:13:49,552 INFO L290 TraceCheckUtils]: 167: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-28 03:13:49,552 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-28 03:13:49,553 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-28 03:13:49,553 INFO L290 TraceCheckUtils]: 170: Hoare triple {55828#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {55832#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:13:49,553 INFO L290 TraceCheckUtils]: 171: Hoare triple {55832#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {55195#false} is VALID [2022-04-28 03:13:49,553 INFO L290 TraceCheckUtils]: 172: Hoare triple {55195#false} assume !false; {55195#false} is VALID [2022-04-28 03:13:49,554 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-28 03:13:49,554 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:13:50,344 INFO L290 TraceCheckUtils]: 172: Hoare triple {55195#false} assume !false; {55195#false} is VALID [2022-04-28 03:13:50,345 INFO L290 TraceCheckUtils]: 171: Hoare triple {55832#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {55195#false} is VALID [2022-04-28 03:13:50,345 INFO L290 TraceCheckUtils]: 170: Hoare triple {55828#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {55832#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:13:50,346 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-28 03:13:50,346 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-28 03:13:50,346 INFO L290 TraceCheckUtils]: 167: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-28 03:13:50,346 INFO L290 TraceCheckUtils]: 166: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-28 03:13:50,346 INFO L290 TraceCheckUtils]: 165: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-28 03:13:50,346 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-28 03:13:50,347 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-28 03:13:50,347 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-28 03:13:50,347 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-28 03:13:50,347 INFO L290 TraceCheckUtils]: 160: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-28 03:13:50,347 INFO L290 TraceCheckUtils]: 159: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-28 03:13:50,347 INFO L290 TraceCheckUtils]: 158: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-28 03:13:50,348 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-28 03:13:50,348 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-28 03:13:50,348 INFO L290 TraceCheckUtils]: 155: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-28 03:13:50,348 INFO L290 TraceCheckUtils]: 154: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-28 03:13:50,348 INFO L290 TraceCheckUtils]: 153: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-28 03:13:50,348 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-28 03:13:50,357 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-28 03:13:50,357 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-28 03:13:50,358 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-28 03:13:50,358 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-28 03:13:50,358 INFO L290 TraceCheckUtils]: 147: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-28 03:13:50,358 INFO L290 TraceCheckUtils]: 146: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-28 03:13:50,358 INFO L290 TraceCheckUtils]: 145: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-28 03:13:50,358 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-28 03:13:50,359 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-28 03:13:50,359 INFO L290 TraceCheckUtils]: 142: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-28 03:13:50,359 INFO L290 TraceCheckUtils]: 141: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-28 03:13:50,359 INFO L290 TraceCheckUtils]: 140: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-28 03:13:50,359 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-28 03:13:50,359 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-28 03:13:50,360 INFO L290 TraceCheckUtils]: 137: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-28 03:13:50,360 INFO L290 TraceCheckUtils]: 136: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-28 03:13:50,360 INFO L290 TraceCheckUtils]: 135: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-28 03:13:50,360 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-28 03:13:50,360 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-28 03:13:50,360 INFO L290 TraceCheckUtils]: 132: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-28 03:13:50,360 INFO L290 TraceCheckUtils]: 131: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-28 03:13:50,360 INFO L290 TraceCheckUtils]: 130: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-28 03:13:50,360 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-28 03:13:50,361 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-28 03:13:50,361 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-28 03:13:50,361 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-28 03:13:50,361 INFO L290 TraceCheckUtils]: 125: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-28 03:13:50,362 INFO L290 TraceCheckUtils]: 124: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-28 03:13:50,362 INFO L290 TraceCheckUtils]: 123: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-28 03:13:50,362 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-28 03:13:50,362 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-28 03:13:50,362 INFO L290 TraceCheckUtils]: 120: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-28 03:13:50,362 INFO L290 TraceCheckUtils]: 119: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-28 03:13:50,362 INFO L290 TraceCheckUtils]: 118: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-28 03:13:50,362 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-28 03:13:50,363 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-28 03:13:50,363 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-28 03:13:50,363 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-28 03:13:50,363 INFO L290 TraceCheckUtils]: 113: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-28 03:13:50,363 INFO L290 TraceCheckUtils]: 112: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-28 03:13:50,363 INFO L290 TraceCheckUtils]: 111: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-28 03:13:50,364 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-28 03:13:50,364 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-28 03:13:50,364 INFO L290 TraceCheckUtils]: 108: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-28 03:13:50,364 INFO L290 TraceCheckUtils]: 107: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-28 03:13:50,364 INFO L290 TraceCheckUtils]: 106: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-28 03:13:50,364 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-28 03:13:50,365 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-28 03:13:50,365 INFO L290 TraceCheckUtils]: 103: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-28 03:13:50,365 INFO L290 TraceCheckUtils]: 102: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-28 03:13:50,365 INFO L290 TraceCheckUtils]: 101: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-28 03:13:50,365 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-28 03:13:50,365 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-28 03:13:50,365 INFO L290 TraceCheckUtils]: 98: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-28 03:13:50,365 INFO L290 TraceCheckUtils]: 97: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-28 03:13:50,366 INFO L290 TraceCheckUtils]: 96: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-28 03:13:50,366 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-28 03:13:50,366 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-28 03:13:50,366 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-28 03:13:50,366 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-28 03:13:50,367 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-28 03:13:50,367 INFO L290 TraceCheckUtils]: 90: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-28 03:13:50,367 INFO L290 TraceCheckUtils]: 89: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-28 03:13:50,367 INFO L290 TraceCheckUtils]: 88: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-28 03:13:50,367 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-28 03:13:50,367 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-28 03:13:50,368 INFO L290 TraceCheckUtils]: 85: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-28 03:13:50,368 INFO L290 TraceCheckUtils]: 84: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-28 03:13:50,368 INFO L290 TraceCheckUtils]: 83: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-28 03:13:50,368 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-28 03:13:50,368 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-28 03:13:50,368 INFO L290 TraceCheckUtils]: 80: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-28 03:13:50,368 INFO L290 TraceCheckUtils]: 79: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-28 03:13:50,368 INFO L290 TraceCheckUtils]: 78: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-28 03:13:50,368 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-28 03:13:50,369 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-28 03:13:50,369 INFO L290 TraceCheckUtils]: 75: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-28 03:13:50,369 INFO L290 TraceCheckUtils]: 74: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-28 03:13:50,369 INFO L290 TraceCheckUtils]: 73: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-28 03:13:50,369 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-28 03:13:50,369 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-28 03:13:50,370 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-28 03:13:50,370 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-28 03:13:50,370 INFO L290 TraceCheckUtils]: 68: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-28 03:13:50,370 INFO L290 TraceCheckUtils]: 67: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-28 03:13:50,370 INFO L290 TraceCheckUtils]: 66: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-28 03:13:50,370 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-28 03:13:50,371 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-28 03:13:50,371 INFO L290 TraceCheckUtils]: 63: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-28 03:13:50,371 INFO L290 TraceCheckUtils]: 62: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-28 03:13:50,371 INFO L290 TraceCheckUtils]: 61: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-28 03:13:50,371 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-28 03:13:50,371 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-28 03:13:50,371 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-28 03:13:50,372 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-28 03:13:50,372 INFO L290 TraceCheckUtils]: 56: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-28 03:13:50,372 INFO L290 TraceCheckUtils]: 55: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-28 03:13:50,372 INFO L290 TraceCheckUtils]: 54: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-28 03:13:50,372 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-28 03:13:50,383 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-28 03:13:50,383 INFO L290 TraceCheckUtils]: 51: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-28 03:13:50,383 INFO L290 TraceCheckUtils]: 50: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-28 03:13:50,383 INFO L290 TraceCheckUtils]: 49: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-28 03:13:50,383 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-28 03:13:50,384 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-28 03:13:50,384 INFO L290 TraceCheckUtils]: 46: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-28 03:13:50,384 INFO L290 TraceCheckUtils]: 45: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-28 03:13:50,384 INFO L290 TraceCheckUtils]: 44: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-28 03:13:50,384 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-28 03:13:50,384 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-28 03:13:50,384 INFO L290 TraceCheckUtils]: 41: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-28 03:13:50,385 INFO L290 TraceCheckUtils]: 40: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-28 03:13:50,385 INFO L290 TraceCheckUtils]: 39: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-28 03:13:50,385 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-28 03:13:50,385 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-28 03:13:50,385 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-28 03:13:50,386 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-28 03:13:50,386 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-28 03:13:50,386 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-28 03:13:50,386 INFO L290 TraceCheckUtils]: 32: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-28 03:13:50,386 INFO L290 TraceCheckUtils]: 31: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-28 03:13:50,386 INFO L290 TraceCheckUtils]: 30: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-28 03:13:50,387 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-28 03:13:50,387 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-28 03:13:50,387 INFO L290 TraceCheckUtils]: 27: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-28 03:13:50,387 INFO L290 TraceCheckUtils]: 26: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-28 03:13:50,387 INFO L290 TraceCheckUtils]: 25: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-28 03:13:50,387 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-28 03:13:50,387 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-28 03:13:50,388 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-28 03:13:50,388 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-28 03:13:50,388 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-28 03:13:50,388 INFO L290 TraceCheckUtils]: 19: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-28 03:13:50,389 INFO L290 TraceCheckUtils]: 18: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-28 03:13:50,389 INFO L290 TraceCheckUtils]: 17: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-28 03:13:50,389 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-28 03:13:50,389 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-28 03:13:50,389 INFO L290 TraceCheckUtils]: 14: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-28 03:13:50,389 INFO L290 TraceCheckUtils]: 13: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-28 03:13:50,389 INFO L290 TraceCheckUtils]: 12: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-28 03:13:50,389 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-28 03:13:50,390 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-28 03:13:50,390 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-28 03:13:50,390 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-28 03:13:50,390 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-28 03:13:50,391 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-28 03:13:50,391 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-28 03:13:50,391 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-28 03:13:50,391 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {55194#true} {55194#true} #138#return; {55194#true} is VALID [2022-04-28 03:13:50,391 INFO L290 TraceCheckUtils]: 2: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-28 03:13:50,392 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-28 03:13:50,392 INFO L272 TraceCheckUtils]: 0: Hoare triple {55194#true} call ULTIMATE.init(); {55194#true} is VALID [2022-04-28 03:13:50,392 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-28 03:13:50,392 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1947308777] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:13:50,392 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:13:50,393 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 19 [2022-04-28 03:13:50,393 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:13:50,393 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1167243519] [2022-04-28 03:13:50,393 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1167243519] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:13:50,393 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:13:50,393 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-28 03:13:50,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1847641178] [2022-04-28 03:13:50,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:13:50,394 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-28 03:13:50,394 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:13:50,394 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-28 03:13:50,463 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-28 03:13:50,464 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-28 03:13:50,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:13:50,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-28 03:13:50,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=293, Unknown=0, NotChecked=0, Total=342 [2022-04-28 03:13:50,468 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-28 03:13:52,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:13:52,679 INFO L93 Difference]: Finished difference Result 318 states and 407 transitions. [2022-04-28 03:13:52,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-28 03:13:52,679 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-28 03:13:52,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:13:52,679 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-28 03:13:52,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 173 transitions. [2022-04-28 03:13:52,681 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-28 03:13:52,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 173 transitions. [2022-04-28 03:13:52,683 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 173 transitions. [2022-04-28 03:13:52,817 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-28 03:13:52,818 INFO L225 Difference]: With dead ends: 318 [2022-04-28 03:13:52,818 INFO L226 Difference]: Without dead ends: 0 [2022-04-28 03:13:52,819 INFO L412 NwaCegarLoop]: 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-28 03:13:52,819 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 86 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 388 mSolverCounterSat, 187 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s 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.5s IncrementalHoareTripleChecker+Time [2022-04-28 03:13:52,820 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 60 Invalid, 575 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [187 Valid, 388 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-28 03:13:52,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-28 03:13:52,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-28 03:13:52,820 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:13:52,820 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-28 03:13:52,820 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-28 03:13:52,820 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-28 03:13:52,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:13:52,821 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-28 03:13:52,821 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 03:13:52,821 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:13:52,821 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:13:52,821 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-28 03:13:52,821 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-28 03:13:52,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:13:52,821 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-28 03:13:52,821 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 03:13:52,821 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:13:52,821 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:13:52,821 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:13:52,821 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:13:52,821 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-28 03:13:52,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-28 03:13:52,821 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 173 [2022-04-28 03:13:52,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:13:52,822 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-28 03:13:52,822 INFO L496 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-28 03:13:52,822 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2022-04-28 03:13:52,822 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-28 03:13:52,822 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 03:13:52,822 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:13:52,824 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-28 03:13:52,851 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-28 03:13:53,051 WARN L477 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-28 03:13:53,053 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-28 03:15:28,488 WARN L232 SmtUtils]: Spent 1.59m 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)