/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf -i ../../../trunk/examples/svcomp/nla-digbench-scaling/prod4br-ll_unwindbound100.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-28 13:58:03,417 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-28 13:58:03,418 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-28 13:58:03,442 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-28 13:58:03,442 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-28 13:58:03,443 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-28 13:58:03,444 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-28 13:58:03,446 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-28 13:58:03,447 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-28 13:58:03,448 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-28 13:58:03,449 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-28 13:58:03,450 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-28 13:58:03,450 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-28 13:58:03,451 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-28 13:58:03,452 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-28 13:58:03,453 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-28 13:58:03,453 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-28 13:58:03,454 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-28 13:58:03,455 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-28 13:58:03,457 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-28 13:58:03,458 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-28 13:58:03,459 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-28 13:58:03,460 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-28 13:58:03,460 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-28 13:58:03,461 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-28 13:58:03,463 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-28 13:58:03,464 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-28 13:58:03,464 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-28 13:58:03,464 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-28 13:58:03,465 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-28 13:58:03,465 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-28 13:58:03,466 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-28 13:58:03,466 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-28 13:58:03,467 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-28 13:58:03,467 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-28 13:58:03,468 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-28 13:58:03,468 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-28 13:58:03,469 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-28 13:58:03,469 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-28 13:58:03,469 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-28 13:58:03,470 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-28 13:58:03,471 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-28 13:58:03,471 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-04-28 13:58:03,478 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-28 13:58:03,478 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-28 13:58:03,479 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-28 13:58:03,479 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-28 13:58:03,480 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-28 13:58:03,480 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-28 13:58:03,480 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-28 13:58:03,480 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-28 13:58:03,480 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-28 13:58:03,480 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-28 13:58:03,480 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-28 13:58:03,481 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-28 13:58:03,481 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-28 13:58:03,481 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-28 13:58:03,481 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-28 13:58:03,481 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 13:58:03,481 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-28 13:58:03,481 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-28 13:58:03,481 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-28 13:58:03,482 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-28 13:58:03,482 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-28 13:58:03,482 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-28 13:58:03,482 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 13:58:03,679 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-28 13:58:03,698 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-28 13:58:03,701 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-28 13:58:03,702 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-28 13:58:03,703 INFO L275 PluginConnector]: CDTParser initialized [2022-04-28 13:58:03,704 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/prod4br-ll_unwindbound100.c [2022-04-28 13:58:03,753 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1181f1902/cfc8e54a7d614acdb0112b63c0f91751/FLAG99c157dfe [2022-04-28 13:58:04,100 INFO L306 CDTParser]: Found 1 translation units. [2022-04-28 13:58:04,100 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/prod4br-ll_unwindbound100.c [2022-04-28 13:58:04,106 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1181f1902/cfc8e54a7d614acdb0112b63c0f91751/FLAG99c157dfe [2022-04-28 13:58:04,114 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1181f1902/cfc8e54a7d614acdb0112b63c0f91751 [2022-04-28 13:58:04,115 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-28 13:58:04,116 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-28 13:58:04,118 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-28 13:58:04,118 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-28 13:58:04,120 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-28 13:58:04,121 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 01:58:04" (1/1) ... [2022-04-28 13:58:04,122 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@380605d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 01:58:04, skipping insertion in model container [2022-04-28 13:58:04,122 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 01:58:04" (1/1) ... [2022-04-28 13:58:04,137 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-28 13:58:04,148 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-28 13:58:04,277 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/prod4br-ll_unwindbound100.c[524,537] [2022-04-28 13:58:04,293 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 13:58:04,299 INFO L203 MainTranslator]: Completed pre-run [2022-04-28 13:58:04,311 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/prod4br-ll_unwindbound100.c[524,537] [2022-04-28 13:58:04,322 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 13:58:04,333 INFO L208 MainTranslator]: Completed translation [2022-04-28 13:58:04,333 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 01:58:04 WrapperNode [2022-04-28 13:58:04,333 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-28 13:58:04,334 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-28 13:58:04,334 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-28 13:58:04,334 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-28 13:58:04,342 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 01:58:04" (1/1) ... [2022-04-28 13:58:04,343 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 01:58:04" (1/1) ... [2022-04-28 13:58:04,347 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 01:58:04" (1/1) ... [2022-04-28 13:58:04,348 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 01:58:04" (1/1) ... [2022-04-28 13:58:04,354 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 01:58:04" (1/1) ... [2022-04-28 13:58:04,357 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 01:58:04" (1/1) ... [2022-04-28 13:58:04,358 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 01:58:04" (1/1) ... [2022-04-28 13:58:04,360 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-28 13:58:04,361 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-28 13:58:04,361 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-28 13:58:04,361 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-28 13:58:04,363 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 01:58:04" (1/1) ... [2022-04-28 13:58:04,374 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 13:58:04,383 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 13:58:04,394 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 13:58:04,407 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 13:58:04,422 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-28 13:58:04,423 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-28 13:58:04,423 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-28 13:58:04,423 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-28 13:58:04,423 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-28 13:58:04,423 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-28 13:58:04,423 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-28 13:58:04,423 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-28 13:58:04,423 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-28 13:58:04,423 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-28 13:58:04,424 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-28 13:58:04,424 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-28 13:58:04,424 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-28 13:58:04,424 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-28 13:58:04,424 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-28 13:58:04,424 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-28 13:58:04,424 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-28 13:58:04,424 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-28 13:58:04,424 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-28 13:58:04,425 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-28 13:58:04,472 INFO L234 CfgBuilder]: Building ICFG [2022-04-28 13:58:04,474 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-28 13:58:04,625 INFO L275 CfgBuilder]: Performing block encoding [2022-04-28 13:58:04,631 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-28 13:58:04,631 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-28 13:58:04,632 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 01:58:04 BoogieIcfgContainer [2022-04-28 13:58:04,633 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-28 13:58:04,648 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-28 13:58:04,648 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-28 13:58:04,654 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-28 13:58:04,654 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.04 01:58:04" (1/3) ... [2022-04-28 13:58:04,654 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49fd79e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 01:58:04, skipping insertion in model container [2022-04-28 13:58:04,654 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 01:58:04" (2/3) ... [2022-04-28 13:58:04,655 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49fd79e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 01:58:04, skipping insertion in model container [2022-04-28 13:58:04,655 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 01:58:04" (3/3) ... [2022-04-28 13:58:04,656 INFO L111 eAbstractionObserver]: Analyzing ICFG prod4br-ll_unwindbound100.c [2022-04-28 13:58:04,673 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-28 13:58:04,674 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-28 13:58:04,723 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-28 13:58:04,732 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@13dcbd8e, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@55d5d54b [2022-04-28 13:58:04,733 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-28 13:58:04,750 INFO L276 IsEmpty]: Start isEmpty. Operand has 32 states, 20 states have (on average 1.45) internal successors, (29), 21 states have internal predecessors, (29), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-28 13:58:04,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-28 13:58:04,756 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 13:58:04,756 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 13:58:04,757 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 13:58:04,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 13:58:04,761 INFO L85 PathProgramCache]: Analyzing trace with hash 1717894843, now seen corresponding path program 1 times [2022-04-28 13:58:04,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 13:58:04,772 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1589860336] [2022-04-28 13:58:04,785 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 13:58:04,785 INFO L85 PathProgramCache]: Analyzing trace with hash 1717894843, now seen corresponding path program 2 times [2022-04-28 13:58:04,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 13:58:04,789 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1926985047] [2022-04-28 13:58:04,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 13:58:04,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 13:58:04,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 13:58:04,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 13:58:04,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 13:58:04,972 INFO L290 TraceCheckUtils]: 0: Hoare triple {44#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {35#true} is VALID [2022-04-28 13:58:04,972 INFO L290 TraceCheckUtils]: 1: Hoare triple {35#true} assume true; {35#true} is VALID [2022-04-28 13:58:04,972 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {35#true} {35#true} #77#return; {35#true} is VALID [2022-04-28 13:58:04,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-28 13:58:04,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 13:58:04,981 INFO L290 TraceCheckUtils]: 0: Hoare triple {35#true} ~cond := #in~cond; {35#true} is VALID [2022-04-28 13:58:04,981 INFO L290 TraceCheckUtils]: 1: Hoare triple {35#true} assume 0 == ~cond;assume false; {36#false} is VALID [2022-04-28 13:58:04,982 INFO L290 TraceCheckUtils]: 2: Hoare triple {36#false} assume true; {36#false} is VALID [2022-04-28 13:58:04,982 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {36#false} {35#true} #69#return; {36#false} is VALID [2022-04-28 13:58:04,983 INFO L272 TraceCheckUtils]: 0: Hoare triple {35#true} call ULTIMATE.init(); {44#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 13:58:04,983 INFO L290 TraceCheckUtils]: 1: Hoare triple {44#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {35#true} is VALID [2022-04-28 13:58:04,983 INFO L290 TraceCheckUtils]: 2: Hoare triple {35#true} assume true; {35#true} is VALID [2022-04-28 13:58:04,984 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35#true} {35#true} #77#return; {35#true} is VALID [2022-04-28 13:58:04,984 INFO L272 TraceCheckUtils]: 4: Hoare triple {35#true} call #t~ret7 := main(); {35#true} is VALID [2022-04-28 13:58:04,984 INFO L290 TraceCheckUtils]: 5: Hoare triple {35#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {35#true} is VALID [2022-04-28 13:58:04,984 INFO L272 TraceCheckUtils]: 6: Hoare triple {35#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {35#true} is VALID [2022-04-28 13:58:04,985 INFO L290 TraceCheckUtils]: 7: Hoare triple {35#true} ~cond := #in~cond; {35#true} is VALID [2022-04-28 13:58:04,985 INFO L290 TraceCheckUtils]: 8: Hoare triple {35#true} assume 0 == ~cond;assume false; {36#false} is VALID [2022-04-28 13:58:04,986 INFO L290 TraceCheckUtils]: 9: Hoare triple {36#false} assume true; {36#false} is VALID [2022-04-28 13:58:04,986 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {36#false} {35#true} #69#return; {36#false} is VALID [2022-04-28 13:58:04,986 INFO L290 TraceCheckUtils]: 11: Hoare triple {36#false} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {36#false} is VALID [2022-04-28 13:58:04,986 INFO L290 TraceCheckUtils]: 12: Hoare triple {36#false} assume !true; {36#false} is VALID [2022-04-28 13:58:04,986 INFO L272 TraceCheckUtils]: 13: Hoare triple {36#false} call __VERIFIER_assert((if ~q~0 == ~x~0 * ~y~0 then 1 else 0)); {36#false} is VALID [2022-04-28 13:58:04,987 INFO L290 TraceCheckUtils]: 14: Hoare triple {36#false} ~cond := #in~cond; {36#false} is VALID [2022-04-28 13:58:04,987 INFO L290 TraceCheckUtils]: 15: Hoare triple {36#false} assume 0 == ~cond; {36#false} is VALID [2022-04-28 13:58:04,987 INFO L290 TraceCheckUtils]: 16: Hoare triple {36#false} assume !false; {36#false} is VALID [2022-04-28 13:58:04,988 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 13:58:04,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 13:58:04,988 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1926985047] [2022-04-28 13:58:04,989 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1926985047] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 13:58:04,989 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 13:58:04,989 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 13:58:04,992 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 13:58:04,992 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1589860336] [2022-04-28 13:58:04,993 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1589860336] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 13:58:04,993 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 13:58:04,993 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 13:58:04,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1572712518] [2022-04-28 13:58:04,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 13:58:04,998 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2022-04-28 13:58:04,999 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 13:58:05,002 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 13:58:05,029 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 13:58:05,029 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-28 13:58:05,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 13:58:05,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-28 13:58:05,047 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-28 13:58:05,049 INFO L87 Difference]: Start difference. First operand has 32 states, 20 states have (on average 1.45) internal successors, (29), 21 states have internal predecessors, (29), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 13:58:05,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 13:58:05,233 INFO L93 Difference]: Finished difference Result 56 states and 77 transitions. [2022-04-28 13:58:05,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-28 13:58:05,234 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2022-04-28 13:58:05,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 13:58:05,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 13:58:05,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 77 transitions. [2022-04-28 13:58:05,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 13:58:05,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 77 transitions. [2022-04-28 13:58:05,250 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 77 transitions. [2022-04-28 13:58:05,345 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 13:58:05,357 INFO L225 Difference]: With dead ends: 56 [2022-04-28 13:58:05,357 INFO L226 Difference]: Without dead ends: 28 [2022-04-28 13:58:05,361 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-28 13:58:05,367 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 10 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 13:58:05,369 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 40 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 13:58:05,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-04-28 13:58:05,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2022-04-28 13:58:05,405 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 13:58:05,406 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand has 27 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 18 states have internal predecessors, (23), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-28 13:58:05,408 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand has 27 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 18 states have internal predecessors, (23), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-28 13:58:05,409 INFO L87 Difference]: Start difference. First operand 28 states. Second operand has 27 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 18 states have internal predecessors, (23), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-28 13:58:05,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 13:58:05,417 INFO L93 Difference]: Finished difference Result 28 states and 34 transitions. [2022-04-28 13:58:05,417 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 34 transitions. [2022-04-28 13:58:05,417 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 13:58:05,418 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 13:58:05,418 INFO L74 IsIncluded]: Start isIncluded. First operand has 27 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 18 states have internal predecessors, (23), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 28 states. [2022-04-28 13:58:05,419 INFO L87 Difference]: Start difference. First operand has 27 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 18 states have internal predecessors, (23), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 28 states. [2022-04-28 13:58:05,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 13:58:05,432 INFO L93 Difference]: Finished difference Result 28 states and 34 transitions. [2022-04-28 13:58:05,433 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 34 transitions. [2022-04-28 13:58:05,434 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 13:58:05,435 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 13:58:05,435 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 13:58:05,435 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 13:58:05,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 18 states have internal predecessors, (23), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-28 13:58:05,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 33 transitions. [2022-04-28 13:58:05,439 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 33 transitions. Word has length 17 [2022-04-28 13:58:05,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 13:58:05,439 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 33 transitions. [2022-04-28 13:58:05,440 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 13:58:05,440 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 27 states and 33 transitions. [2022-04-28 13:58:05,478 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 13:58:05,479 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 33 transitions. [2022-04-28 13:58:05,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-28 13:58:05,480 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 13:58:05,480 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 13:58:05,480 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-28 13:58:05,480 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 13:58:05,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 13:58:05,482 INFO L85 PathProgramCache]: Analyzing trace with hash 444281082, now seen corresponding path program 1 times [2022-04-28 13:58:05,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 13:58:05,483 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1355047804] [2022-04-28 13:58:05,486 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 13:58:05,486 INFO L85 PathProgramCache]: Analyzing trace with hash 444281082, now seen corresponding path program 2 times [2022-04-28 13:58:05,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 13:58:05,490 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462298227] [2022-04-28 13:58:05,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 13:58:05,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 13:58:05,521 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 13:58:05,522 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1663007836] [2022-04-28 13:58:05,522 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 13:58:05,522 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 13:58:05,522 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 13:58:05,524 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 13:58:05,558 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 13:58:05,587 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-28 13:58:05,587 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 13:58:05,589 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-28 13:58:05,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 13:58:05,606 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 13:58:05,779 INFO L272 TraceCheckUtils]: 0: Hoare triple {269#true} call ULTIMATE.init(); {269#true} is VALID [2022-04-28 13:58:05,780 INFO L290 TraceCheckUtils]: 1: Hoare triple {269#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(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {277#(<= ~counter~0 0)} is VALID [2022-04-28 13:58:05,780 INFO L290 TraceCheckUtils]: 2: Hoare triple {277#(<= ~counter~0 0)} assume true; {277#(<= ~counter~0 0)} is VALID [2022-04-28 13:58:05,781 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {277#(<= ~counter~0 0)} {269#true} #77#return; {277#(<= ~counter~0 0)} is VALID [2022-04-28 13:58:05,782 INFO L272 TraceCheckUtils]: 4: Hoare triple {277#(<= ~counter~0 0)} call #t~ret7 := main(); {277#(<= ~counter~0 0)} is VALID [2022-04-28 13:58:05,782 INFO L290 TraceCheckUtils]: 5: Hoare triple {277#(<= ~counter~0 0)} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {277#(<= ~counter~0 0)} is VALID [2022-04-28 13:58:05,784 INFO L272 TraceCheckUtils]: 6: Hoare triple {277#(<= ~counter~0 0)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {277#(<= ~counter~0 0)} is VALID [2022-04-28 13:58:05,784 INFO L290 TraceCheckUtils]: 7: Hoare triple {277#(<= ~counter~0 0)} ~cond := #in~cond; {277#(<= ~counter~0 0)} is VALID [2022-04-28 13:58:05,785 INFO L290 TraceCheckUtils]: 8: Hoare triple {277#(<= ~counter~0 0)} assume !(0 == ~cond); {277#(<= ~counter~0 0)} is VALID [2022-04-28 13:58:05,785 INFO L290 TraceCheckUtils]: 9: Hoare triple {277#(<= ~counter~0 0)} assume true; {277#(<= ~counter~0 0)} is VALID [2022-04-28 13:58:05,786 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {277#(<= ~counter~0 0)} {277#(<= ~counter~0 0)} #69#return; {277#(<= ~counter~0 0)} is VALID [2022-04-28 13:58:05,786 INFO L290 TraceCheckUtils]: 11: Hoare triple {277#(<= ~counter~0 0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {277#(<= ~counter~0 0)} is VALID [2022-04-28 13:58:05,787 INFO L290 TraceCheckUtils]: 12: Hoare triple {277#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {311#(<= |main_#t~post6| 0)} is VALID [2022-04-28 13:58:05,787 INFO L290 TraceCheckUtils]: 13: Hoare triple {311#(<= |main_#t~post6| 0)} assume !(#t~post6 < 100);havoc #t~post6; {270#false} is VALID [2022-04-28 13:58:05,788 INFO L272 TraceCheckUtils]: 14: Hoare triple {270#false} call __VERIFIER_assert((if ~q~0 == ~x~0 * ~y~0 then 1 else 0)); {270#false} is VALID [2022-04-28 13:58:05,788 INFO L290 TraceCheckUtils]: 15: Hoare triple {270#false} ~cond := #in~cond; {270#false} is VALID [2022-04-28 13:58:05,789 INFO L290 TraceCheckUtils]: 16: Hoare triple {270#false} assume 0 == ~cond; {270#false} is VALID [2022-04-28 13:58:05,789 INFO L290 TraceCheckUtils]: 17: Hoare triple {270#false} assume !false; {270#false} is VALID [2022-04-28 13:58:05,790 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 13:58:05,790 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 13:58:05,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 13:58:05,790 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [462298227] [2022-04-28 13:58:05,791 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 13:58:05,791 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1663007836] [2022-04-28 13:58:05,792 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1663007836] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 13:58:05,792 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 13:58:05,792 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 13:58:05,793 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 13:58:05,793 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1355047804] [2022-04-28 13:58:05,793 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1355047804] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 13:58:05,794 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 13:58:05,794 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 13:58:05,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1433350446] [2022-04-28 13:58:05,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 13:58:05,795 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 18 [2022-04-28 13:58:05,795 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 13:58:05,795 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 13:58:05,828 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 13:58:05,829 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 13:58:05,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 13:58:05,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 13:58:05,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 13:58:05,830 INFO L87 Difference]: Start difference. First operand 27 states and 33 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 13:58:05,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 13:58:05,905 INFO L93 Difference]: Finished difference Result 37 states and 44 transitions. [2022-04-28 13:58:05,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 13:58:05,905 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 18 [2022-04-28 13:58:05,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 13:58:05,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 13:58:05,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 44 transitions. [2022-04-28 13:58:05,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 13:58:05,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 44 transitions. [2022-04-28 13:58:05,917 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 44 transitions. [2022-04-28 13:58:05,954 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 13:58:05,956 INFO L225 Difference]: With dead ends: 37 [2022-04-28 13:58:05,956 INFO L226 Difference]: Without dead ends: 29 [2022-04-28 13:58:05,956 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 13:58:05,958 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 0 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 13:58:05,962 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 81 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 13:58:05,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-04-28 13:58:05,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2022-04-28 13:58:05,981 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 13:58:05,981 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand has 29 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 20 states have internal predecessors, (25), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-28 13:58:05,983 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand has 29 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 20 states have internal predecessors, (25), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-28 13:58:05,983 INFO L87 Difference]: Start difference. First operand 29 states. Second operand has 29 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 20 states have internal predecessors, (25), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-28 13:58:05,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 13:58:05,986 INFO L93 Difference]: Finished difference Result 29 states and 35 transitions. [2022-04-28 13:58:05,987 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 35 transitions. [2022-04-28 13:58:05,988 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 13:58:05,988 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 13:58:05,989 INFO L74 IsIncluded]: Start isIncluded. First operand has 29 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 20 states have internal predecessors, (25), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 29 states. [2022-04-28 13:58:05,990 INFO L87 Difference]: Start difference. First operand has 29 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 20 states have internal predecessors, (25), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 29 states. [2022-04-28 13:58:05,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 13:58:05,993 INFO L93 Difference]: Finished difference Result 29 states and 35 transitions. [2022-04-28 13:58:05,993 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 35 transitions. [2022-04-28 13:58:05,994 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 13:58:05,994 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 13:58:05,994 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 13:58:05,994 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 13:58:05,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 20 states have internal predecessors, (25), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-28 13:58:06,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 35 transitions. [2022-04-28 13:58:06,002 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 35 transitions. Word has length 18 [2022-04-28 13:58:06,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 13:58:06,003 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 35 transitions. [2022-04-28 13:58:06,003 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 13:58:06,003 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 29 states and 35 transitions. [2022-04-28 13:58:06,035 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 13:58:06,035 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 35 transitions. [2022-04-28 13:58:06,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-28 13:58:06,038 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 13:58:06,039 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 13:58:06,067 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 13:58:06,255 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 13:58:06,256 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 13:58:06,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 13:58:06,256 INFO L85 PathProgramCache]: Analyzing trace with hash 446068542, now seen corresponding path program 1 times [2022-04-28 13:58:06,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 13:58:06,256 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1827803320] [2022-04-28 13:58:06,257 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 13:58:06,257 INFO L85 PathProgramCache]: Analyzing trace with hash 446068542, now seen corresponding path program 2 times [2022-04-28 13:58:06,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 13:58:06,257 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1467116727] [2022-04-28 13:58:06,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 13:58:06,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 13:58:06,282 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 13:58:06,282 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [404691949] [2022-04-28 13:58:06,283 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 13:58:06,283 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 13:58:06,283 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 13:58:06,288 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 13:58:06,313 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 13:58:06,339 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-28 13:58:06,339 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 13:58:06,340 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 15 conjunts are in the unsatisfiable core [2022-04-28 13:58:06,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 13:58:06,348 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 13:58:06,474 INFO L272 TraceCheckUtils]: 0: Hoare triple {516#true} call ULTIMATE.init(); {516#true} is VALID [2022-04-28 13:58:06,475 INFO L290 TraceCheckUtils]: 1: Hoare triple {516#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(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {516#true} is VALID [2022-04-28 13:58:06,475 INFO L290 TraceCheckUtils]: 2: Hoare triple {516#true} assume true; {516#true} is VALID [2022-04-28 13:58:06,475 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {516#true} {516#true} #77#return; {516#true} is VALID [2022-04-28 13:58:06,475 INFO L272 TraceCheckUtils]: 4: Hoare triple {516#true} call #t~ret7 := main(); {516#true} is VALID [2022-04-28 13:58:06,475 INFO L290 TraceCheckUtils]: 5: Hoare triple {516#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {516#true} is VALID [2022-04-28 13:58:06,475 INFO L272 TraceCheckUtils]: 6: Hoare triple {516#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {516#true} is VALID [2022-04-28 13:58:06,476 INFO L290 TraceCheckUtils]: 7: Hoare triple {516#true} ~cond := #in~cond; {516#true} is VALID [2022-04-28 13:58:06,476 INFO L290 TraceCheckUtils]: 8: Hoare triple {516#true} assume !(0 == ~cond); {516#true} is VALID [2022-04-28 13:58:06,476 INFO L290 TraceCheckUtils]: 9: Hoare triple {516#true} assume true; {516#true} is VALID [2022-04-28 13:58:06,476 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {516#true} {516#true} #69#return; {516#true} is VALID [2022-04-28 13:58:06,477 INFO L290 TraceCheckUtils]: 11: Hoare triple {516#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {554#(and (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 13:58:06,477 INFO L290 TraceCheckUtils]: 12: Hoare triple {554#(and (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {554#(and (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 13:58:06,478 INFO L290 TraceCheckUtils]: 13: Hoare triple {554#(and (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !!(#t~post6 < 100);havoc #t~post6; {554#(and (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 13:58:06,479 INFO L272 TraceCheckUtils]: 14: Hoare triple {554#(and (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {564#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 13:58:06,479 INFO L290 TraceCheckUtils]: 15: Hoare triple {564#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {568#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 13:58:06,480 INFO L290 TraceCheckUtils]: 16: Hoare triple {568#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {517#false} is VALID [2022-04-28 13:58:06,480 INFO L290 TraceCheckUtils]: 17: Hoare triple {517#false} assume !false; {517#false} is VALID [2022-04-28 13:58:06,480 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 13:58:06,480 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 13:58:06,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 13:58:06,481 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1467116727] [2022-04-28 13:58:06,481 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 13:58:06,481 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [404691949] [2022-04-28 13:58:06,481 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [404691949] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 13:58:06,481 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 13:58:06,481 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 13:58:06,481 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 13:58:06,481 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1827803320] [2022-04-28 13:58:06,481 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1827803320] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 13:58:06,482 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 13:58:06,482 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 13:58:06,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [36835292] [2022-04-28 13:58:06,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 13:58:06,482 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 18 [2022-04-28 13:58:06,482 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 13:58:06,483 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 13:58:06,498 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 13:58:06,498 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 13:58:06,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 13:58:06,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 13:58:06,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 13:58:06,499 INFO L87 Difference]: Start difference. First operand 29 states and 35 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 13:58:06,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 13:58:06,679 INFO L93 Difference]: Finished difference Result 42 states and 53 transitions. [2022-04-28 13:58:06,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 13:58:06,680 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 18 [2022-04-28 13:58:06,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 13:58:06,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 13:58:06,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 53 transitions. [2022-04-28 13:58:06,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 13:58:06,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 53 transitions. [2022-04-28 13:58:06,684 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 53 transitions. [2022-04-28 13:58:06,738 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 13:58:06,740 INFO L225 Difference]: With dead ends: 42 [2022-04-28 13:58:06,740 INFO L226 Difference]: Without dead ends: 40 [2022-04-28 13:58:06,740 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-28 13:58:06,741 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 9 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 13:58:06,742 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 83 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 13:58:06,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-04-28 13:58:06,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 34. [2022-04-28 13:58:06,762 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 13:58:06,763 INFO L82 GeneralOperation]: Start isEquivalent. First operand 40 states. Second operand has 34 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 24 states have internal predecessors, (28), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-28 13:58:06,763 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand has 34 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 24 states have internal predecessors, (28), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-28 13:58:06,764 INFO L87 Difference]: Start difference. First operand 40 states. Second operand has 34 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 24 states have internal predecessors, (28), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-28 13:58:06,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 13:58:06,770 INFO L93 Difference]: Finished difference Result 40 states and 51 transitions. [2022-04-28 13:58:06,770 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 51 transitions. [2022-04-28 13:58:06,770 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 13:58:06,770 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 13:58:06,772 INFO L74 IsIncluded]: Start isIncluded. First operand has 34 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 24 states have internal predecessors, (28), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) Second operand 40 states. [2022-04-28 13:58:06,772 INFO L87 Difference]: Start difference. First operand has 34 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 24 states have internal predecessors, (28), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) Second operand 40 states. [2022-04-28 13:58:06,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 13:58:06,778 INFO L93 Difference]: Finished difference Result 40 states and 51 transitions. [2022-04-28 13:58:06,778 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 51 transitions. [2022-04-28 13:58:06,778 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 13:58:06,779 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 13:58:06,779 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 13:58:06,779 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 13:58:06,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 24 states have internal predecessors, (28), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-28 13:58:06,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 40 transitions. [2022-04-28 13:58:06,780 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 40 transitions. Word has length 18 [2022-04-28 13:58:06,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 13:58:06,781 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 40 transitions. [2022-04-28 13:58:06,781 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 13:58:06,781 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 34 states and 40 transitions. [2022-04-28 13:58:06,832 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 13:58:06,833 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 40 transitions. [2022-04-28 13:58:06,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-28 13:58:06,837 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 13:58:06,837 INFO L195 NwaCegarLoop]: trace histogram [2, 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 13:58:06,862 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-04-28 13:58:07,060 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,SelfDestructingSolverStorable2 [2022-04-28 13:58:07,061 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 13:58:07,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 13:58:07,061 INFO L85 PathProgramCache]: Analyzing trace with hash -1308579644, now seen corresponding path program 1 times [2022-04-28 13:58:07,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 13:58:07,061 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [908419087] [2022-04-28 13:58:07,061 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 13:58:07,062 INFO L85 PathProgramCache]: Analyzing trace with hash -1308579644, now seen corresponding path program 2 times [2022-04-28 13:58:07,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 13:58:07,062 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017849084] [2022-04-28 13:58:07,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 13:58:07,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 13:58:07,079 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 13:58:07,079 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [13070430] [2022-04-28 13:58:07,079 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 13:58:07,080 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 13:58:07,080 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 13:58:07,081 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 13:58:07,084 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 13:58:07,124 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 13:58:07,124 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 13:58:07,125 INFO L263 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 15 conjunts are in the unsatisfiable core [2022-04-28 13:58:07,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 13:58:07,140 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 13:58:17,644 INFO L272 TraceCheckUtils]: 0: Hoare triple {808#true} call ULTIMATE.init(); {808#true} is VALID [2022-04-28 13:58:17,644 INFO L290 TraceCheckUtils]: 1: Hoare triple {808#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(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {808#true} is VALID [2022-04-28 13:58:17,645 INFO L290 TraceCheckUtils]: 2: Hoare triple {808#true} assume true; {808#true} is VALID [2022-04-28 13:58:17,645 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {808#true} {808#true} #77#return; {808#true} is VALID [2022-04-28 13:58:17,645 INFO L272 TraceCheckUtils]: 4: Hoare triple {808#true} call #t~ret7 := main(); {808#true} is VALID [2022-04-28 13:58:17,645 INFO L290 TraceCheckUtils]: 5: Hoare triple {808#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {808#true} is VALID [2022-04-28 13:58:17,645 INFO L272 TraceCheckUtils]: 6: Hoare triple {808#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {808#true} is VALID [2022-04-28 13:58:17,646 INFO L290 TraceCheckUtils]: 7: Hoare triple {808#true} ~cond := #in~cond; {834#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-28 13:58:17,647 INFO L290 TraceCheckUtils]: 8: Hoare triple {834#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {838#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 13:58:17,647 INFO L290 TraceCheckUtils]: 9: Hoare triple {838#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {838#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 13:58:17,650 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {838#(not (= |assume_abort_if_not_#in~cond| 0))} {808#true} #69#return; {845#(<= 1 main_~y~0)} is VALID [2022-04-28 13:58:17,650 INFO L290 TraceCheckUtils]: 11: Hoare triple {845#(<= 1 main_~y~0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {849#(and (<= main_~y~0 main_~b~0) (<= 1 main_~y~0))} is VALID [2022-04-28 13:58:17,651 INFO L290 TraceCheckUtils]: 12: Hoare triple {849#(and (<= main_~y~0 main_~b~0) (<= 1 main_~y~0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {849#(and (<= main_~y~0 main_~b~0) (<= 1 main_~y~0))} is VALID [2022-04-28 13:58:17,652 INFO L290 TraceCheckUtils]: 13: Hoare triple {849#(and (<= main_~y~0 main_~b~0) (<= 1 main_~y~0))} assume !!(#t~post6 < 100);havoc #t~post6; {849#(and (<= main_~y~0 main_~b~0) (<= 1 main_~y~0))} is VALID [2022-04-28 13:58:17,652 INFO L272 TraceCheckUtils]: 14: Hoare triple {849#(and (<= main_~y~0 main_~b~0) (<= 1 main_~y~0))} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {808#true} is VALID [2022-04-28 13:58:17,655 INFO L290 TraceCheckUtils]: 15: Hoare triple {808#true} ~cond := #in~cond; {862#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 13:58:17,656 INFO L290 TraceCheckUtils]: 16: Hoare triple {862#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {866#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 13:58:17,656 INFO L290 TraceCheckUtils]: 17: Hoare triple {866#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {866#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 13:58:19,659 WARN L284 TraceCheckUtils]: 18: Hoare quadruple {866#(not (= |__VERIFIER_assert_#in~cond| 0))} {849#(and (<= main_~y~0 main_~b~0) (<= 1 main_~y~0))} #71#return; {873#(and (or (and (= (mod (+ (* main_~y~0 main_~x~0) (* (- 1) main_~q~0)) (* main_~b~0 main_~a~0)) 0) (not (= main_~a~0 0))) (= (+ (* main_~y~0 main_~x~0) (* (- 1) main_~q~0)) 0)) (<= main_~y~0 main_~b~0) (<= 1 main_~y~0))} is UNKNOWN [2022-04-28 13:58:19,660 INFO L290 TraceCheckUtils]: 19: Hoare triple {873#(and (or (and (= (mod (+ (* main_~y~0 main_~x~0) (* (- 1) main_~q~0)) (* main_~b~0 main_~a~0)) 0) (not (= main_~a~0 0))) (= (+ (* main_~y~0 main_~x~0) (* (- 1) main_~q~0)) 0)) (<= main_~y~0 main_~b~0) (<= 1 main_~y~0))} assume !(0 != ~a~0 && 0 != ~b~0); {877#(and (= main_~q~0 (* main_~y~0 main_~x~0)) (<= 1 main_~y~0))} is VALID [2022-04-28 13:58:19,661 INFO L272 TraceCheckUtils]: 20: Hoare triple {877#(and (= main_~q~0 (* main_~y~0 main_~x~0)) (<= 1 main_~y~0))} call __VERIFIER_assert((if ~q~0 == ~x~0 * ~y~0 then 1 else 0)); {881#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 13:58:19,662 INFO L290 TraceCheckUtils]: 21: Hoare triple {881#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {885#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 13:58:19,662 INFO L290 TraceCheckUtils]: 22: Hoare triple {885#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {809#false} is VALID [2022-04-28 13:58:19,662 INFO L290 TraceCheckUtils]: 23: Hoare triple {809#false} assume !false; {809#false} is VALID [2022-04-28 13:58:19,662 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 13:58:19,663 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 13:58:55,659 INFO L290 TraceCheckUtils]: 23: Hoare triple {809#false} assume !false; {809#false} is VALID [2022-04-28 13:58:55,660 INFO L290 TraceCheckUtils]: 22: Hoare triple {885#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {809#false} is VALID [2022-04-28 13:58:55,660 INFO L290 TraceCheckUtils]: 21: Hoare triple {881#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {885#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 13:58:55,661 INFO L272 TraceCheckUtils]: 20: Hoare triple {901#(= main_~q~0 (* main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~q~0 == ~x~0 * ~y~0 then 1 else 0)); {881#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 13:58:55,662 INFO L290 TraceCheckUtils]: 19: Hoare triple {905#(or (= main_~q~0 (* main_~y~0 main_~x~0)) (and (not (= main_~b~0 0)) (not (= main_~a~0 0))))} assume !(0 != ~a~0 && 0 != ~b~0); {901#(= main_~q~0 (* main_~y~0 main_~x~0))} is VALID [2022-04-28 13:58:55,664 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {866#(not (= |__VERIFIER_assert_#in~cond| 0))} {808#true} #71#return; {905#(or (= main_~q~0 (* main_~y~0 main_~x~0)) (and (not (= main_~b~0 0)) (not (= main_~a~0 0))))} is VALID [2022-04-28 13:58:55,664 INFO L290 TraceCheckUtils]: 17: Hoare triple {866#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {866#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 13:58:55,665 INFO L290 TraceCheckUtils]: 16: Hoare triple {918#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {866#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 13:58:55,665 INFO L290 TraceCheckUtils]: 15: Hoare triple {808#true} ~cond := #in~cond; {918#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 13:58:55,666 INFO L272 TraceCheckUtils]: 14: Hoare triple {808#true} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {808#true} is VALID [2022-04-28 13:58:55,666 INFO L290 TraceCheckUtils]: 13: Hoare triple {808#true} assume !!(#t~post6 < 100);havoc #t~post6; {808#true} is VALID [2022-04-28 13:58:55,666 INFO L290 TraceCheckUtils]: 12: Hoare triple {808#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {808#true} is VALID [2022-04-28 13:58:55,666 INFO L290 TraceCheckUtils]: 11: Hoare triple {808#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {808#true} is VALID [2022-04-28 13:58:55,666 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {808#true} {808#true} #69#return; {808#true} is VALID [2022-04-28 13:58:55,666 INFO L290 TraceCheckUtils]: 9: Hoare triple {808#true} assume true; {808#true} is VALID [2022-04-28 13:58:55,666 INFO L290 TraceCheckUtils]: 8: Hoare triple {808#true} assume !(0 == ~cond); {808#true} is VALID [2022-04-28 13:58:55,667 INFO L290 TraceCheckUtils]: 7: Hoare triple {808#true} ~cond := #in~cond; {808#true} is VALID [2022-04-28 13:58:55,667 INFO L272 TraceCheckUtils]: 6: Hoare triple {808#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {808#true} is VALID [2022-04-28 13:58:55,667 INFO L290 TraceCheckUtils]: 5: Hoare triple {808#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {808#true} is VALID [2022-04-28 13:58:55,667 INFO L272 TraceCheckUtils]: 4: Hoare triple {808#true} call #t~ret7 := main(); {808#true} is VALID [2022-04-28 13:58:55,667 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {808#true} {808#true} #77#return; {808#true} is VALID [2022-04-28 13:58:55,667 INFO L290 TraceCheckUtils]: 2: Hoare triple {808#true} assume true; {808#true} is VALID [2022-04-28 13:58:55,668 INFO L290 TraceCheckUtils]: 1: Hoare triple {808#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(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {808#true} is VALID [2022-04-28 13:58:55,668 INFO L272 TraceCheckUtils]: 0: Hoare triple {808#true} call ULTIMATE.init(); {808#true} is VALID [2022-04-28 13:58:55,668 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 13:58:55,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 13:58:55,668 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1017849084] [2022-04-28 13:58:55,668 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 13:58:55,668 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [13070430] [2022-04-28 13:58:55,669 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [13070430] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 13:58:55,669 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 13:58:55,669 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8] total 15 [2022-04-28 13:58:55,669 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 13:58:55,669 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [908419087] [2022-04-28 13:58:55,669 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [908419087] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 13:58:55,669 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 13:58:55,669 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-28 13:58:55,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2064277973] [2022-04-28 13:58:55,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 13:58:55,670 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 9 states have internal predecessors, (16), 3 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 24 [2022-04-28 13:58:55,670 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 13:58:55,670 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 9 states have internal predecessors, (16), 3 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 13:58:57,692 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 23 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 13:58:57,692 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-28 13:58:57,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 13:58:57,693 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-28 13:58:57,693 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2022-04-28 13:58:57,693 INFO L87 Difference]: Start difference. First operand 34 states and 40 transitions. Second operand has 12 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 9 states have internal predecessors, (16), 3 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 13:59:04,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 13:59:04,397 INFO L93 Difference]: Finished difference Result 50 states and 63 transitions. [2022-04-28 13:59:04,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-28 13:59:04,398 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 9 states have internal predecessors, (16), 3 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 24 [2022-04-28 13:59:04,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 13:59:04,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 9 states have internal predecessors, (16), 3 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 13:59:04,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 60 transitions. [2022-04-28 13:59:04,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 9 states have internal predecessors, (16), 3 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 13:59:04,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 60 transitions. [2022-04-28 13:59:04,402 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 60 transitions. [2022-04-28 13:59:06,459 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 59 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 13:59:06,461 INFO L225 Difference]: With dead ends: 50 [2022-04-28 13:59:06,461 INFO L226 Difference]: Without dead ends: 48 [2022-04-28 13:59:06,462 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=64, Invalid=278, Unknown=0, NotChecked=0, Total=342 [2022-04-28 13:59:06,463 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 36 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 204 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2022-04-28 13:59:06,463 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 130 Invalid, 221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 204 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2022-04-28 13:59:06,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2022-04-28 13:59:06,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 45. [2022-04-28 13:59:06,503 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 13:59:06,504 INFO L82 GeneralOperation]: Start isEquivalent. First operand 48 states. Second operand has 45 states, 30 states have (on average 1.3333333333333333) internal successors, (40), 33 states have internal predecessors, (40), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (7), 5 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 13:59:06,504 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand has 45 states, 30 states have (on average 1.3333333333333333) internal successors, (40), 33 states have internal predecessors, (40), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (7), 5 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 13:59:06,504 INFO L87 Difference]: Start difference. First operand 48 states. Second operand has 45 states, 30 states have (on average 1.3333333333333333) internal successors, (40), 33 states have internal predecessors, (40), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (7), 5 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 13:59:06,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 13:59:06,506 INFO L93 Difference]: Finished difference Result 48 states and 61 transitions. [2022-04-28 13:59:06,506 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 61 transitions. [2022-04-28 13:59:06,507 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 13:59:06,507 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 13:59:06,507 INFO L74 IsIncluded]: Start isIncluded. First operand has 45 states, 30 states have (on average 1.3333333333333333) internal successors, (40), 33 states have internal predecessors, (40), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (7), 5 states have call predecessors, (7), 7 states have call successors, (7) Second operand 48 states. [2022-04-28 13:59:06,507 INFO L87 Difference]: Start difference. First operand has 45 states, 30 states have (on average 1.3333333333333333) internal successors, (40), 33 states have internal predecessors, (40), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (7), 5 states have call predecessors, (7), 7 states have call successors, (7) Second operand 48 states. [2022-04-28 13:59:06,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 13:59:06,510 INFO L93 Difference]: Finished difference Result 48 states and 61 transitions. [2022-04-28 13:59:06,510 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 61 transitions. [2022-04-28 13:59:06,510 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 13:59:06,510 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 13:59:06,510 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 13:59:06,510 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 13:59:06,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 30 states have (on average 1.3333333333333333) internal successors, (40), 33 states have internal predecessors, (40), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (7), 5 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 13:59:06,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 56 transitions. [2022-04-28 13:59:06,512 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 56 transitions. Word has length 24 [2022-04-28 13:59:06,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 13:59:06,512 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 56 transitions. [2022-04-28 13:59:06,512 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 9 states have internal predecessors, (16), 3 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 13:59:06,513 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 45 states and 56 transitions. [2022-04-28 13:59:08,568 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 55 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 13:59:08,568 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 56 transitions. [2022-04-28 13:59:08,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-28 13:59:08,568 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 13:59:08,569 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-04-28 13:59:08,585 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 13:59:08,769 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 13:59:08,769 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 13:59:08,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 13:59:08,770 INFO L85 PathProgramCache]: Analyzing trace with hash 1797927234, now seen corresponding path program 1 times [2022-04-28 13:59:08,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 13:59:08,770 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1745290026] [2022-04-28 13:59:14,861 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 13:59:14,861 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 13:59:14,862 INFO L85 PathProgramCache]: Analyzing trace with hash 1797927234, now seen corresponding path program 2 times [2022-04-28 13:59:14,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 13:59:14,862 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240860088] [2022-04-28 13:59:14,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 13:59:14,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 13:59:14,875 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 13:59:14,876 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1394734855] [2022-04-28 13:59:14,876 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 13:59:14,876 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 13:59:14,876 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 13:59:14,879 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 13:59:14,884 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 13:59:14,925 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 13:59:14,925 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 13:59:14,925 INFO L263 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-28 13:59:14,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 13:59:14,935 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 13:59:15,084 INFO L272 TraceCheckUtils]: 0: Hoare triple {1260#true} call ULTIMATE.init(); {1260#true} is VALID [2022-04-28 13:59:15,084 INFO L290 TraceCheckUtils]: 1: Hoare triple {1260#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(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1268#(<= ~counter~0 0)} is VALID [2022-04-28 13:59:15,085 INFO L290 TraceCheckUtils]: 2: Hoare triple {1268#(<= ~counter~0 0)} assume true; {1268#(<= ~counter~0 0)} is VALID [2022-04-28 13:59:15,085 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1268#(<= ~counter~0 0)} {1260#true} #77#return; {1268#(<= ~counter~0 0)} is VALID [2022-04-28 13:59:15,087 INFO L272 TraceCheckUtils]: 4: Hoare triple {1268#(<= ~counter~0 0)} call #t~ret7 := main(); {1268#(<= ~counter~0 0)} is VALID [2022-04-28 13:59:15,087 INFO L290 TraceCheckUtils]: 5: Hoare triple {1268#(<= ~counter~0 0)} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {1268#(<= ~counter~0 0)} is VALID [2022-04-28 13:59:15,088 INFO L272 TraceCheckUtils]: 6: Hoare triple {1268#(<= ~counter~0 0)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {1268#(<= ~counter~0 0)} is VALID [2022-04-28 13:59:15,089 INFO L290 TraceCheckUtils]: 7: Hoare triple {1268#(<= ~counter~0 0)} ~cond := #in~cond; {1268#(<= ~counter~0 0)} is VALID [2022-04-28 13:59:15,089 INFO L290 TraceCheckUtils]: 8: Hoare triple {1268#(<= ~counter~0 0)} assume !(0 == ~cond); {1268#(<= ~counter~0 0)} is VALID [2022-04-28 13:59:15,101 INFO L290 TraceCheckUtils]: 9: Hoare triple {1268#(<= ~counter~0 0)} assume true; {1268#(<= ~counter~0 0)} is VALID [2022-04-28 13:59:15,102 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1268#(<= ~counter~0 0)} {1268#(<= ~counter~0 0)} #69#return; {1268#(<= ~counter~0 0)} is VALID [2022-04-28 13:59:15,102 INFO L290 TraceCheckUtils]: 11: Hoare triple {1268#(<= ~counter~0 0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {1268#(<= ~counter~0 0)} is VALID [2022-04-28 13:59:15,103 INFO L290 TraceCheckUtils]: 12: Hoare triple {1268#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1302#(<= ~counter~0 1)} is VALID [2022-04-28 13:59:15,103 INFO L290 TraceCheckUtils]: 13: Hoare triple {1302#(<= ~counter~0 1)} assume !!(#t~post6 < 100);havoc #t~post6; {1302#(<= ~counter~0 1)} is VALID [2022-04-28 13:59:15,104 INFO L272 TraceCheckUtils]: 14: Hoare triple {1302#(<= ~counter~0 1)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {1302#(<= ~counter~0 1)} is VALID [2022-04-28 13:59:15,104 INFO L290 TraceCheckUtils]: 15: Hoare triple {1302#(<= ~counter~0 1)} ~cond := #in~cond; {1302#(<= ~counter~0 1)} is VALID [2022-04-28 13:59:15,105 INFO L290 TraceCheckUtils]: 16: Hoare triple {1302#(<= ~counter~0 1)} assume !(0 == ~cond); {1302#(<= ~counter~0 1)} is VALID [2022-04-28 13:59:15,105 INFO L290 TraceCheckUtils]: 17: Hoare triple {1302#(<= ~counter~0 1)} assume true; {1302#(<= ~counter~0 1)} is VALID [2022-04-28 13:59:15,106 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {1302#(<= ~counter~0 1)} {1302#(<= ~counter~0 1)} #71#return; {1302#(<= ~counter~0 1)} is VALID [2022-04-28 13:59:15,106 INFO L290 TraceCheckUtils]: 19: Hoare triple {1302#(<= ~counter~0 1)} assume !!(0 != ~a~0 && 0 != ~b~0); {1302#(<= ~counter~0 1)} is VALID [2022-04-28 13:59:15,107 INFO L290 TraceCheckUtils]: 20: Hoare triple {1302#(<= ~counter~0 1)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {1302#(<= ~counter~0 1)} is VALID [2022-04-28 13:59:15,107 INFO L290 TraceCheckUtils]: 21: Hoare triple {1302#(<= ~counter~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1330#(<= |main_#t~post6| 1)} is VALID [2022-04-28 13:59:15,108 INFO L290 TraceCheckUtils]: 22: Hoare triple {1330#(<= |main_#t~post6| 1)} assume !(#t~post6 < 100);havoc #t~post6; {1261#false} is VALID [2022-04-28 13:59:15,108 INFO L272 TraceCheckUtils]: 23: Hoare triple {1261#false} call __VERIFIER_assert((if ~q~0 == ~x~0 * ~y~0 then 1 else 0)); {1261#false} is VALID [2022-04-28 13:59:15,108 INFO L290 TraceCheckUtils]: 24: Hoare triple {1261#false} ~cond := #in~cond; {1261#false} is VALID [2022-04-28 13:59:15,108 INFO L290 TraceCheckUtils]: 25: Hoare triple {1261#false} assume 0 == ~cond; {1261#false} is VALID [2022-04-28 13:59:15,108 INFO L290 TraceCheckUtils]: 26: Hoare triple {1261#false} assume !false; {1261#false} is VALID [2022-04-28 13:59:15,108 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 13:59:15,108 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 13:59:15,245 INFO L290 TraceCheckUtils]: 26: Hoare triple {1261#false} assume !false; {1261#false} is VALID [2022-04-28 13:59:15,246 INFO L290 TraceCheckUtils]: 25: Hoare triple {1261#false} assume 0 == ~cond; {1261#false} is VALID [2022-04-28 13:59:15,246 INFO L290 TraceCheckUtils]: 24: Hoare triple {1261#false} ~cond := #in~cond; {1261#false} is VALID [2022-04-28 13:59:15,246 INFO L272 TraceCheckUtils]: 23: Hoare triple {1261#false} call __VERIFIER_assert((if ~q~0 == ~x~0 * ~y~0 then 1 else 0)); {1261#false} is VALID [2022-04-28 13:59:15,246 INFO L290 TraceCheckUtils]: 22: Hoare triple {1358#(< |main_#t~post6| 100)} assume !(#t~post6 < 100);havoc #t~post6; {1261#false} is VALID [2022-04-28 13:59:15,246 INFO L290 TraceCheckUtils]: 21: Hoare triple {1362#(< ~counter~0 100)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1358#(< |main_#t~post6| 100)} is VALID [2022-04-28 13:59:15,247 INFO L290 TraceCheckUtils]: 20: Hoare triple {1362#(< ~counter~0 100)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {1362#(< ~counter~0 100)} is VALID [2022-04-28 13:59:15,247 INFO L290 TraceCheckUtils]: 19: Hoare triple {1362#(< ~counter~0 100)} assume !!(0 != ~a~0 && 0 != ~b~0); {1362#(< ~counter~0 100)} is VALID [2022-04-28 13:59:15,248 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {1260#true} {1362#(< ~counter~0 100)} #71#return; {1362#(< ~counter~0 100)} is VALID [2022-04-28 13:59:15,248 INFO L290 TraceCheckUtils]: 17: Hoare triple {1260#true} assume true; {1260#true} is VALID [2022-04-28 13:59:15,248 INFO L290 TraceCheckUtils]: 16: Hoare triple {1260#true} assume !(0 == ~cond); {1260#true} is VALID [2022-04-28 13:59:15,248 INFO L290 TraceCheckUtils]: 15: Hoare triple {1260#true} ~cond := #in~cond; {1260#true} is VALID [2022-04-28 13:59:15,248 INFO L272 TraceCheckUtils]: 14: Hoare triple {1362#(< ~counter~0 100)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {1260#true} is VALID [2022-04-28 13:59:15,248 INFO L290 TraceCheckUtils]: 13: Hoare triple {1362#(< ~counter~0 100)} assume !!(#t~post6 < 100);havoc #t~post6; {1362#(< ~counter~0 100)} is VALID [2022-04-28 13:59:15,249 INFO L290 TraceCheckUtils]: 12: Hoare triple {1390#(< ~counter~0 99)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1362#(< ~counter~0 100)} is VALID [2022-04-28 13:59:15,249 INFO L290 TraceCheckUtils]: 11: Hoare triple {1390#(< ~counter~0 99)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {1390#(< ~counter~0 99)} is VALID [2022-04-28 13:59:15,250 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1260#true} {1390#(< ~counter~0 99)} #69#return; {1390#(< ~counter~0 99)} is VALID [2022-04-28 13:59:15,250 INFO L290 TraceCheckUtils]: 9: Hoare triple {1260#true} assume true; {1260#true} is VALID [2022-04-28 13:59:15,250 INFO L290 TraceCheckUtils]: 8: Hoare triple {1260#true} assume !(0 == ~cond); {1260#true} is VALID [2022-04-28 13:59:15,250 INFO L290 TraceCheckUtils]: 7: Hoare triple {1260#true} ~cond := #in~cond; {1260#true} is VALID [2022-04-28 13:59:15,250 INFO L272 TraceCheckUtils]: 6: Hoare triple {1390#(< ~counter~0 99)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {1260#true} is VALID [2022-04-28 13:59:15,250 INFO L290 TraceCheckUtils]: 5: Hoare triple {1390#(< ~counter~0 99)} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {1390#(< ~counter~0 99)} is VALID [2022-04-28 13:59:15,251 INFO L272 TraceCheckUtils]: 4: Hoare triple {1390#(< ~counter~0 99)} call #t~ret7 := main(); {1390#(< ~counter~0 99)} is VALID [2022-04-28 13:59:15,251 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1390#(< ~counter~0 99)} {1260#true} #77#return; {1390#(< ~counter~0 99)} is VALID [2022-04-28 13:59:15,255 INFO L290 TraceCheckUtils]: 2: Hoare triple {1390#(< ~counter~0 99)} assume true; {1390#(< ~counter~0 99)} is VALID [2022-04-28 13:59:15,256 INFO L290 TraceCheckUtils]: 1: Hoare triple {1260#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(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1390#(< ~counter~0 99)} is VALID [2022-04-28 13:59:15,256 INFO L272 TraceCheckUtils]: 0: Hoare triple {1260#true} call ULTIMATE.init(); {1260#true} is VALID [2022-04-28 13:59:15,256 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 13:59:15,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 13:59:15,256 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [240860088] [2022-04-28 13:59:15,257 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 13:59:15,257 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1394734855] [2022-04-28 13:59:15,257 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1394734855] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 13:59:15,257 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 13:59:15,257 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2022-04-28 13:59:15,257 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 13:59:15,257 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1745290026] [2022-04-28 13:59:15,257 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1745290026] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 13:59:15,257 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 13:59:15,258 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 13:59:15,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1076895995] [2022-04-28 13:59:15,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 13:59:15,258 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 4 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Word has length 27 [2022-04-28 13:59:15,258 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 13:59:15,259 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 4 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 13:59:15,285 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 13:59:15,285 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 13:59:15,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 13:59:15,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 13:59:15,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-04-28 13:59:15,286 INFO L87 Difference]: Start difference. First operand 45 states and 56 transitions. Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 4 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 13:59:15,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 13:59:15,458 INFO L93 Difference]: Finished difference Result 73 states and 89 transitions. [2022-04-28 13:59:15,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-28 13:59:15,459 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 4 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Word has length 27 [2022-04-28 13:59:15,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 13:59:15,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 4 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 13:59:15,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 64 transitions. [2022-04-28 13:59:15,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 4 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 13:59:15,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 64 transitions. [2022-04-28 13:59:15,462 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 64 transitions. [2022-04-28 13:59:15,518 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 13:59:15,519 INFO L225 Difference]: With dead ends: 73 [2022-04-28 13:59:15,520 INFO L226 Difference]: Without dead ends: 63 [2022-04-28 13:59:15,520 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-04-28 13:59:15,521 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 17 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 13:59:15,521 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 108 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 13:59:15,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-04-28 13:59:15,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 61. [2022-04-28 13:59:15,587 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 13:59:15,587 INFO L82 GeneralOperation]: Start isEquivalent. First operand 63 states. Second operand has 61 states, 43 states have (on average 1.3255813953488371) internal successors, (57), 45 states have internal predecessors, (57), 11 states have call successors, (11), 8 states have call predecessors, (11), 6 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 13:59:15,587 INFO L74 IsIncluded]: Start isIncluded. First operand 63 states. Second operand has 61 states, 43 states have (on average 1.3255813953488371) internal successors, (57), 45 states have internal predecessors, (57), 11 states have call successors, (11), 8 states have call predecessors, (11), 6 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 13:59:15,588 INFO L87 Difference]: Start difference. First operand 63 states. Second operand has 61 states, 43 states have (on average 1.3255813953488371) internal successors, (57), 45 states have internal predecessors, (57), 11 states have call successors, (11), 8 states have call predecessors, (11), 6 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 13:59:15,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 13:59:15,590 INFO L93 Difference]: Finished difference Result 63 states and 77 transitions. [2022-04-28 13:59:15,590 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 77 transitions. [2022-04-28 13:59:15,590 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 13:59:15,591 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 13:59:15,591 INFO L74 IsIncluded]: Start isIncluded. First operand has 61 states, 43 states have (on average 1.3255813953488371) internal successors, (57), 45 states have internal predecessors, (57), 11 states have call successors, (11), 8 states have call predecessors, (11), 6 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) Second operand 63 states. [2022-04-28 13:59:15,591 INFO L87 Difference]: Start difference. First operand has 61 states, 43 states have (on average 1.3255813953488371) internal successors, (57), 45 states have internal predecessors, (57), 11 states have call successors, (11), 8 states have call predecessors, (11), 6 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) Second operand 63 states. [2022-04-28 13:59:15,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 13:59:15,593 INFO L93 Difference]: Finished difference Result 63 states and 77 transitions. [2022-04-28 13:59:15,593 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 77 transitions. [2022-04-28 13:59:15,594 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 13:59:15,594 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 13:59:15,594 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 13:59:15,594 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 13:59:15,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 43 states have (on average 1.3255813953488371) internal successors, (57), 45 states have internal predecessors, (57), 11 states have call successors, (11), 8 states have call predecessors, (11), 6 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 13:59:15,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 76 transitions. [2022-04-28 13:59:15,596 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 76 transitions. Word has length 27 [2022-04-28 13:59:15,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 13:59:15,597 INFO L495 AbstractCegarLoop]: Abstraction has 61 states and 76 transitions. [2022-04-28 13:59:15,597 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 4 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 13:59:15,597 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 61 states and 76 transitions. [2022-04-28 13:59:17,678 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 75 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 13:59:17,679 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 76 transitions. [2022-04-28 13:59:17,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-28 13:59:17,679 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 13:59:17,679 INFO L195 NwaCegarLoop]: trace histogram [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 13:59:17,703 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-04-28 13:59:17,880 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 13:59:17,880 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 13:59:17,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 13:59:17,880 INFO L85 PathProgramCache]: Analyzing trace with hash 1799714694, now seen corresponding path program 1 times [2022-04-28 13:59:17,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 13:59:17,880 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [671954396] [2022-04-28 13:59:23,946 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 13:59:23,946 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 13:59:23,947 INFO L85 PathProgramCache]: Analyzing trace with hash 1799714694, now seen corresponding path program 2 times [2022-04-28 13:59:23,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 13:59:23,947 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1702418904] [2022-04-28 13:59:23,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 13:59:23,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 13:59:23,959 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 13:59:23,959 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [26996671] [2022-04-28 13:59:23,959 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 13:59:23,959 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 13:59:23,959 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 13:59:23,976 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 13:59:24,015 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 13:59:24,027 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 13:59:24,027 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 13:59:24,028 INFO L263 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 28 conjunts are in the unsatisfiable core [2022-04-28 13:59:24,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 13:59:24,045 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 13:59:24,502 INFO L272 TraceCheckUtils]: 0: Hoare triple {1825#true} call ULTIMATE.init(); {1825#true} is VALID [2022-04-28 13:59:24,503 INFO L290 TraceCheckUtils]: 1: Hoare triple {1825#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(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1825#true} is VALID [2022-04-28 13:59:24,503 INFO L290 TraceCheckUtils]: 2: Hoare triple {1825#true} assume true; {1825#true} is VALID [2022-04-28 13:59:24,503 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1825#true} {1825#true} #77#return; {1825#true} is VALID [2022-04-28 13:59:24,503 INFO L272 TraceCheckUtils]: 4: Hoare triple {1825#true} call #t~ret7 := main(); {1825#true} is VALID [2022-04-28 13:59:24,503 INFO L290 TraceCheckUtils]: 5: Hoare triple {1825#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {1825#true} is VALID [2022-04-28 13:59:24,504 INFO L272 TraceCheckUtils]: 6: Hoare triple {1825#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {1825#true} is VALID [2022-04-28 13:59:24,504 INFO L290 TraceCheckUtils]: 7: Hoare triple {1825#true} ~cond := #in~cond; {1825#true} is VALID [2022-04-28 13:59:24,504 INFO L290 TraceCheckUtils]: 8: Hoare triple {1825#true} assume !(0 == ~cond); {1825#true} is VALID [2022-04-28 13:59:24,505 INFO L290 TraceCheckUtils]: 9: Hoare triple {1825#true} assume true; {1825#true} is VALID [2022-04-28 13:59:24,505 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1825#true} {1825#true} #69#return; {1825#true} is VALID [2022-04-28 13:59:24,505 INFO L290 TraceCheckUtils]: 11: Hoare triple {1825#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {1863#(and (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 13:59:24,506 INFO L290 TraceCheckUtils]: 12: Hoare triple {1863#(and (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1863#(and (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 13:59:24,506 INFO L290 TraceCheckUtils]: 13: Hoare triple {1863#(and (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !!(#t~post6 < 100);havoc #t~post6; {1863#(and (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 13:59:24,506 INFO L272 TraceCheckUtils]: 14: Hoare triple {1863#(and (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {1825#true} is VALID [2022-04-28 13:59:24,507 INFO L290 TraceCheckUtils]: 15: Hoare triple {1825#true} ~cond := #in~cond; {1876#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 13:59:24,507 INFO L290 TraceCheckUtils]: 16: Hoare triple {1876#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {1880#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 13:59:24,507 INFO L290 TraceCheckUtils]: 17: Hoare triple {1880#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {1880#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 13:59:24,508 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {1880#(not (= |__VERIFIER_assert_#in~cond| 0))} {1863#(and (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #71#return; {1887#(and (= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0)) (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 13:59:24,509 INFO L290 TraceCheckUtils]: 19: Hoare triple {1887#(and (= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0)) (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !!(0 != ~a~0 && 0 != ~b~0); {1887#(and (= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0)) (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 13:59:24,510 INFO L290 TraceCheckUtils]: 20: Hoare triple {1887#(and (= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0)) (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {1894#(and (= (+ main_~q~0 (* main_~y~0 main_~x~0 1)) (* main_~y~0 main_~x~0)) (= (div main_~y~0 2) main_~b~0) (= (mod main_~y~0 2) 0) (= main_~p~0 4) (= (div main_~x~0 2) main_~a~0) (= (mod main_~x~0 2) 0))} is VALID [2022-04-28 13:59:24,511 INFO L290 TraceCheckUtils]: 21: Hoare triple {1894#(and (= (+ main_~q~0 (* main_~y~0 main_~x~0 1)) (* main_~y~0 main_~x~0)) (= (div main_~y~0 2) main_~b~0) (= (mod main_~y~0 2) 0) (= main_~p~0 4) (= (div main_~x~0 2) main_~a~0) (= (mod main_~x~0 2) 0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1894#(and (= (+ main_~q~0 (* main_~y~0 main_~x~0 1)) (* main_~y~0 main_~x~0)) (= (div main_~y~0 2) main_~b~0) (= (mod main_~y~0 2) 0) (= main_~p~0 4) (= (div main_~x~0 2) main_~a~0) (= (mod main_~x~0 2) 0))} is VALID [2022-04-28 13:59:24,511 INFO L290 TraceCheckUtils]: 22: Hoare triple {1894#(and (= (+ main_~q~0 (* main_~y~0 main_~x~0 1)) (* main_~y~0 main_~x~0)) (= (div main_~y~0 2) main_~b~0) (= (mod main_~y~0 2) 0) (= main_~p~0 4) (= (div main_~x~0 2) main_~a~0) (= (mod main_~x~0 2) 0))} assume !!(#t~post6 < 100);havoc #t~post6; {1894#(and (= (+ main_~q~0 (* main_~y~0 main_~x~0 1)) (* main_~y~0 main_~x~0)) (= (div main_~y~0 2) main_~b~0) (= (mod main_~y~0 2) 0) (= main_~p~0 4) (= (div main_~x~0 2) main_~a~0) (= (mod main_~x~0 2) 0))} is VALID [2022-04-28 13:59:24,515 INFO L272 TraceCheckUtils]: 23: Hoare triple {1894#(and (= (+ main_~q~0 (* main_~y~0 main_~x~0 1)) (* main_~y~0 main_~x~0)) (= (div main_~y~0 2) main_~b~0) (= (mod main_~y~0 2) 0) (= main_~p~0 4) (= (div main_~x~0 2) main_~a~0) (= (mod main_~x~0 2) 0))} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {1904#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 13:59:24,516 INFO L290 TraceCheckUtils]: 24: Hoare triple {1904#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1908#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 13:59:24,517 INFO L290 TraceCheckUtils]: 25: Hoare triple {1908#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1826#false} is VALID [2022-04-28 13:59:24,517 INFO L290 TraceCheckUtils]: 26: Hoare triple {1826#false} assume !false; {1826#false} is VALID [2022-04-28 13:59:24,517 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 13:59:24,517 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 14:00:17,817 INFO L290 TraceCheckUtils]: 26: Hoare triple {1826#false} assume !false; {1826#false} is VALID [2022-04-28 14:00:17,818 INFO L290 TraceCheckUtils]: 25: Hoare triple {1908#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1826#false} is VALID [2022-04-28 14:00:17,818 INFO L290 TraceCheckUtils]: 24: Hoare triple {1904#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1908#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 14:00:17,819 INFO L272 TraceCheckUtils]: 23: Hoare triple {1924#(= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {1904#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 14:00:17,820 INFO L290 TraceCheckUtils]: 22: Hoare triple {1924#(= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))} assume !!(#t~post6 < 100);havoc #t~post6; {1924#(= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))} is VALID [2022-04-28 14:00:17,820 INFO L290 TraceCheckUtils]: 21: Hoare triple {1924#(= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1924#(= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))} is VALID [2022-04-28 14:00:17,827 INFO L290 TraceCheckUtils]: 20: Hoare triple {1934#(or (not (= (mod main_~b~0 2) 0)) (= (+ (* (div main_~b~0 2) (* main_~p~0 4) (div main_~a~0 2)) main_~q~0) (* main_~y~0 main_~x~0)) (not (= (mod main_~a~0 2) 0)))} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {1924#(= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))} is VALID [2022-04-28 14:00:17,827 INFO L290 TraceCheckUtils]: 19: Hoare triple {1934#(or (not (= (mod main_~b~0 2) 0)) (= (+ (* (div main_~b~0 2) (* main_~p~0 4) (div main_~a~0 2)) main_~q~0) (* main_~y~0 main_~x~0)) (not (= (mod main_~a~0 2) 0)))} assume !!(0 != ~a~0 && 0 != ~b~0); {1934#(or (not (= (mod main_~b~0 2) 0)) (= (+ (* (div main_~b~0 2) (* main_~p~0 4) (div main_~a~0 2)) main_~q~0) (* main_~y~0 main_~x~0)) (not (= (mod main_~a~0 2) 0)))} is VALID [2022-04-28 14:00:17,834 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {1880#(not (= |__VERIFIER_assert_#in~cond| 0))} {1825#true} #71#return; {1934#(or (not (= (mod main_~b~0 2) 0)) (= (+ (* (div main_~b~0 2) (* main_~p~0 4) (div main_~a~0 2)) main_~q~0) (* main_~y~0 main_~x~0)) (not (= (mod main_~a~0 2) 0)))} is VALID [2022-04-28 14:00:17,834 INFO L290 TraceCheckUtils]: 17: Hoare triple {1880#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {1880#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 14:00:17,834 INFO L290 TraceCheckUtils]: 16: Hoare triple {1950#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {1880#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 14:00:17,835 INFO L290 TraceCheckUtils]: 15: Hoare triple {1825#true} ~cond := #in~cond; {1950#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 14:00:17,835 INFO L272 TraceCheckUtils]: 14: Hoare triple {1825#true} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {1825#true} is VALID [2022-04-28 14:00:17,835 INFO L290 TraceCheckUtils]: 13: Hoare triple {1825#true} assume !!(#t~post6 < 100);havoc #t~post6; {1825#true} is VALID [2022-04-28 14:00:17,835 INFO L290 TraceCheckUtils]: 12: Hoare triple {1825#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1825#true} is VALID [2022-04-28 14:00:17,835 INFO L290 TraceCheckUtils]: 11: Hoare triple {1825#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {1825#true} is VALID [2022-04-28 14:00:17,836 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1825#true} {1825#true} #69#return; {1825#true} is VALID [2022-04-28 14:00:17,836 INFO L290 TraceCheckUtils]: 9: Hoare triple {1825#true} assume true; {1825#true} is VALID [2022-04-28 14:00:17,836 INFO L290 TraceCheckUtils]: 8: Hoare triple {1825#true} assume !(0 == ~cond); {1825#true} is VALID [2022-04-28 14:00:17,836 INFO L290 TraceCheckUtils]: 7: Hoare triple {1825#true} ~cond := #in~cond; {1825#true} is VALID [2022-04-28 14:00:17,836 INFO L272 TraceCheckUtils]: 6: Hoare triple {1825#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {1825#true} is VALID [2022-04-28 14:00:17,836 INFO L290 TraceCheckUtils]: 5: Hoare triple {1825#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {1825#true} is VALID [2022-04-28 14:00:17,836 INFO L272 TraceCheckUtils]: 4: Hoare triple {1825#true} call #t~ret7 := main(); {1825#true} is VALID [2022-04-28 14:00:17,836 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1825#true} {1825#true} #77#return; {1825#true} is VALID [2022-04-28 14:00:17,837 INFO L290 TraceCheckUtils]: 2: Hoare triple {1825#true} assume true; {1825#true} is VALID [2022-04-28 14:00:17,837 INFO L290 TraceCheckUtils]: 1: Hoare triple {1825#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(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1825#true} is VALID [2022-04-28 14:00:17,837 INFO L272 TraceCheckUtils]: 0: Hoare triple {1825#true} call ULTIMATE.init(); {1825#true} is VALID [2022-04-28 14:00:17,837 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 14:00:17,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:00:17,837 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1702418904] [2022-04-28 14:00:17,837 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 14:00:17,837 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [26996671] [2022-04-28 14:00:17,838 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [26996671] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 14:00:17,838 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 14:00:17,838 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 12 [2022-04-28 14:00:17,838 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:00:17,838 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [671954396] [2022-04-28 14:00:17,838 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [671954396] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:00:17,838 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:00:17,838 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-28 14:00:17,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1678879585] [2022-04-28 14:00:17,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:00:17,839 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 8 states have internal predecessors, (19), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 27 [2022-04-28 14:00:17,839 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:00:17,839 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 8 states have internal predecessors, (19), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 14:00:17,869 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:00:17,869 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-28 14:00:17,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:00:17,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-28 14:00:17,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2022-04-28 14:00:17,870 INFO L87 Difference]: Start difference. First operand 61 states and 76 transitions. Second operand has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 8 states have internal predecessors, (19), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 14:00:18,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:00:18,519 INFO L93 Difference]: Finished difference Result 76 states and 96 transitions. [2022-04-28 14:00:18,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-28 14:00:18,520 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 8 states have internal predecessors, (19), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 27 [2022-04-28 14:00:18,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:00:18,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 8 states have internal predecessors, (19), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 14:00:18,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 68 transitions. [2022-04-28 14:00:18,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 8 states have internal predecessors, (19), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 14:00:18,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 68 transitions. [2022-04-28 14:00:18,523 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 68 transitions. [2022-04-28 14:00:18,606 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 14:00:18,609 INFO L225 Difference]: With dead ends: 76 [2022-04-28 14:00:18,609 INFO L226 Difference]: Without dead ends: 74 [2022-04-28 14:00:18,609 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2022-04-28 14:00:18,610 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 24 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 197 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-28 14:00:18,610 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 126 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 197 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-28 14:00:18,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2022-04-28 14:00:18,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 68. [2022-04-28 14:00:18,697 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:00:18,697 INFO L82 GeneralOperation]: Start isEquivalent. First operand 74 states. Second operand has 68 states, 48 states have (on average 1.2916666666666667) internal successors, (62), 51 states have internal predecessors, (62), 12 states have call successors, (12), 9 states have call predecessors, (12), 7 states have return successors, (9), 7 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-28 14:00:18,697 INFO L74 IsIncluded]: Start isIncluded. First operand 74 states. Second operand has 68 states, 48 states have (on average 1.2916666666666667) internal successors, (62), 51 states have internal predecessors, (62), 12 states have call successors, (12), 9 states have call predecessors, (12), 7 states have return successors, (9), 7 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-28 14:00:18,698 INFO L87 Difference]: Start difference. First operand 74 states. Second operand has 68 states, 48 states have (on average 1.2916666666666667) internal successors, (62), 51 states have internal predecessors, (62), 12 states have call successors, (12), 9 states have call predecessors, (12), 7 states have return successors, (9), 7 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-28 14:00:18,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:00:18,700 INFO L93 Difference]: Finished difference Result 74 states and 94 transitions. [2022-04-28 14:00:18,700 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 94 transitions. [2022-04-28 14:00:18,701 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:00:18,701 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:00:18,701 INFO L74 IsIncluded]: Start isIncluded. First operand has 68 states, 48 states have (on average 1.2916666666666667) internal successors, (62), 51 states have internal predecessors, (62), 12 states have call successors, (12), 9 states have call predecessors, (12), 7 states have return successors, (9), 7 states have call predecessors, (9), 9 states have call successors, (9) Second operand 74 states. [2022-04-28 14:00:18,701 INFO L87 Difference]: Start difference. First operand has 68 states, 48 states have (on average 1.2916666666666667) internal successors, (62), 51 states have internal predecessors, (62), 12 states have call successors, (12), 9 states have call predecessors, (12), 7 states have return successors, (9), 7 states have call predecessors, (9), 9 states have call successors, (9) Second operand 74 states. [2022-04-28 14:00:18,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:00:18,704 INFO L93 Difference]: Finished difference Result 74 states and 94 transitions. [2022-04-28 14:00:18,704 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 94 transitions. [2022-04-28 14:00:18,704 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:00:18,704 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:00:18,704 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:00:18,704 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:00:18,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 48 states have (on average 1.2916666666666667) internal successors, (62), 51 states have internal predecessors, (62), 12 states have call successors, (12), 9 states have call predecessors, (12), 7 states have return successors, (9), 7 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-28 14:00:18,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 83 transitions. [2022-04-28 14:00:18,707 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 83 transitions. Word has length 27 [2022-04-28 14:00:18,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:00:18,707 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 83 transitions. [2022-04-28 14:00:18,707 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 8 states have internal predecessors, (19), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 14:00:18,707 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 68 states and 83 transitions. [2022-04-28 14:00:20,835 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 83 edges. 82 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 14:00:20,836 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 83 transitions. [2022-04-28 14:00:20,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-28 14:00:20,836 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:00:20,836 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, 1, 1] [2022-04-28 14:00:20,852 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 14:00:21,037 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 14:00:21,037 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:00:21,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:00:21,037 INFO L85 PathProgramCache]: Analyzing trace with hash -1613968938, now seen corresponding path program 1 times [2022-04-28 14:00:21,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:00:21,037 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1917528701] [2022-04-28 14:00:21,038 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 14:00:21,038 INFO L85 PathProgramCache]: Analyzing trace with hash -1613968938, now seen corresponding path program 2 times [2022-04-28 14:00:21,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:00:21,038 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1639773922] [2022-04-28 14:00:21,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:00:21,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:00:21,056 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 14:00:21,056 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1761618884] [2022-04-28 14:00:21,056 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 14:00:21,056 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 14:00:21,057 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 14:00:21,060 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 14:00:21,083 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 14:00:21,106 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 14:00:21,107 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 14:00:21,107 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-28 14:00:21,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:00:21,118 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 14:00:21,266 INFO L272 TraceCheckUtils]: 0: Hoare triple {2438#true} call ULTIMATE.init(); {2438#true} is VALID [2022-04-28 14:00:21,266 INFO L290 TraceCheckUtils]: 1: Hoare triple {2438#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(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {2438#true} is VALID [2022-04-28 14:00:21,266 INFO L290 TraceCheckUtils]: 2: Hoare triple {2438#true} assume true; {2438#true} is VALID [2022-04-28 14:00:21,267 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2438#true} {2438#true} #77#return; {2438#true} is VALID [2022-04-28 14:00:21,267 INFO L272 TraceCheckUtils]: 4: Hoare triple {2438#true} call #t~ret7 := main(); {2438#true} is VALID [2022-04-28 14:00:21,267 INFO L290 TraceCheckUtils]: 5: Hoare triple {2438#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {2438#true} is VALID [2022-04-28 14:00:21,267 INFO L272 TraceCheckUtils]: 6: Hoare triple {2438#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {2438#true} is VALID [2022-04-28 14:00:21,267 INFO L290 TraceCheckUtils]: 7: Hoare triple {2438#true} ~cond := #in~cond; {2464#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-28 14:00:21,268 INFO L290 TraceCheckUtils]: 8: Hoare triple {2464#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {2468#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 14:00:21,268 INFO L290 TraceCheckUtils]: 9: Hoare triple {2468#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {2468#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 14:00:21,269 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2468#(not (= |assume_abort_if_not_#in~cond| 0))} {2438#true} #69#return; {2475#(<= 1 main_~y~0)} is VALID [2022-04-28 14:00:21,269 INFO L290 TraceCheckUtils]: 11: Hoare triple {2475#(<= 1 main_~y~0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {2479#(<= 1 main_~b~0)} is VALID [2022-04-28 14:00:21,270 INFO L290 TraceCheckUtils]: 12: Hoare triple {2479#(<= 1 main_~b~0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2479#(<= 1 main_~b~0)} is VALID [2022-04-28 14:00:21,270 INFO L290 TraceCheckUtils]: 13: Hoare triple {2479#(<= 1 main_~b~0)} assume !!(#t~post6 < 100);havoc #t~post6; {2479#(<= 1 main_~b~0)} is VALID [2022-04-28 14:00:21,270 INFO L272 TraceCheckUtils]: 14: Hoare triple {2479#(<= 1 main_~b~0)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {2438#true} is VALID [2022-04-28 14:00:21,270 INFO L290 TraceCheckUtils]: 15: Hoare triple {2438#true} ~cond := #in~cond; {2438#true} is VALID [2022-04-28 14:00:21,270 INFO L290 TraceCheckUtils]: 16: Hoare triple {2438#true} assume !(0 == ~cond); {2438#true} is VALID [2022-04-28 14:00:21,270 INFO L290 TraceCheckUtils]: 17: Hoare triple {2438#true} assume true; {2438#true} is VALID [2022-04-28 14:00:21,271 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {2438#true} {2479#(<= 1 main_~b~0)} #71#return; {2479#(<= 1 main_~b~0)} is VALID [2022-04-28 14:00:21,271 INFO L290 TraceCheckUtils]: 19: Hoare triple {2479#(<= 1 main_~b~0)} assume !(0 != ~a~0 && 0 != ~b~0); {2504#(and (= main_~a~0 0) (<= 1 main_~b~0))} is VALID [2022-04-28 14:00:21,272 INFO L272 TraceCheckUtils]: 20: Hoare triple {2504#(and (= main_~a~0 0) (<= 1 main_~b~0))} call __VERIFIER_assert((if ~q~0 == ~x~0 * ~y~0 then 1 else 0)); {2438#true} is VALID [2022-04-28 14:00:21,272 INFO L290 TraceCheckUtils]: 21: Hoare triple {2438#true} ~cond := #in~cond; {2438#true} is VALID [2022-04-28 14:00:21,272 INFO L290 TraceCheckUtils]: 22: Hoare triple {2438#true} assume !(0 == ~cond); {2438#true} is VALID [2022-04-28 14:00:21,272 INFO L290 TraceCheckUtils]: 23: Hoare triple {2438#true} assume true; {2438#true} is VALID [2022-04-28 14:00:21,280 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {2438#true} {2504#(and (= main_~a~0 0) (<= 1 main_~b~0))} #73#return; {2504#(and (= main_~a~0 0) (<= 1 main_~b~0))} is VALID [2022-04-28 14:00:21,281 INFO L272 TraceCheckUtils]: 25: Hoare triple {2504#(and (= main_~a~0 0) (<= 1 main_~b~0))} call __VERIFIER_assert((if 0 == ~a~0 * ~b~0 then 1 else 0)); {2523#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 14:00:21,282 INFO L290 TraceCheckUtils]: 26: Hoare triple {2523#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2527#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 14:00:21,285 INFO L290 TraceCheckUtils]: 27: Hoare triple {2527#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2439#false} is VALID [2022-04-28 14:00:21,286 INFO L290 TraceCheckUtils]: 28: Hoare triple {2439#false} assume !false; {2439#false} is VALID [2022-04-28 14:00:21,286 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 14:00:21,286 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 14:00:21,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:00:21,286 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1639773922] [2022-04-28 14:00:21,286 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 14:00:21,286 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1761618884] [2022-04-28 14:00:21,287 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1761618884] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:00:21,287 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:00:21,287 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-28 14:00:21,287 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:00:21,287 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1917528701] [2022-04-28 14:00:21,287 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1917528701] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:00:21,287 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:00:21,287 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-28 14:00:21,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1215330934] [2022-04-28 14:00:21,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:00:21,288 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 29 [2022-04-28 14:00:21,288 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:00:21,288 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-28 14:00:21,312 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 14:00:21,312 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-28 14:00:21,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:00:21,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-28 14:00:21,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-04-28 14:00:21,314 INFO L87 Difference]: Start difference. First operand 68 states and 83 transitions. Second operand has 9 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-28 14:00:21,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:00:21,748 INFO L93 Difference]: Finished difference Result 85 states and 107 transitions. [2022-04-28 14:00:21,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-28 14:00:21,748 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 29 [2022-04-28 14:00:21,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:00:21,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-28 14:00:21,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 57 transitions. [2022-04-28 14:00:21,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-28 14:00:21,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 57 transitions. [2022-04-28 14:00:21,751 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 57 transitions. [2022-04-28 14:00:21,799 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:00:21,801 INFO L225 Difference]: With dead ends: 85 [2022-04-28 14:00:21,801 INFO L226 Difference]: Without dead ends: 65 [2022-04-28 14:00:21,801 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2022-04-28 14:00:21,802 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 33 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 14:00:21,802 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 157 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 14:00:21,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-04-28 14:00:21,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 62. [2022-04-28 14:00:21,874 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:00:21,874 INFO L82 GeneralOperation]: Start isEquivalent. First operand 65 states. Second operand has 62 states, 45 states have (on average 1.3555555555555556) internal successors, (61), 48 states have internal predecessors, (61), 11 states have call successors, (11), 6 states have call predecessors, (11), 5 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 14:00:21,874 INFO L74 IsIncluded]: Start isIncluded. First operand 65 states. Second operand has 62 states, 45 states have (on average 1.3555555555555556) internal successors, (61), 48 states have internal predecessors, (61), 11 states have call successors, (11), 6 states have call predecessors, (11), 5 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 14:00:21,875 INFO L87 Difference]: Start difference. First operand 65 states. Second operand has 62 states, 45 states have (on average 1.3555555555555556) internal successors, (61), 48 states have internal predecessors, (61), 11 states have call successors, (11), 6 states have call predecessors, (11), 5 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 14:00:21,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:00:21,877 INFO L93 Difference]: Finished difference Result 65 states and 85 transitions. [2022-04-28 14:00:21,877 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 85 transitions. [2022-04-28 14:00:21,877 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:00:21,877 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:00:21,878 INFO L74 IsIncluded]: Start isIncluded. First operand has 62 states, 45 states have (on average 1.3555555555555556) internal successors, (61), 48 states have internal predecessors, (61), 11 states have call successors, (11), 6 states have call predecessors, (11), 5 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) Second operand 65 states. [2022-04-28 14:00:21,878 INFO L87 Difference]: Start difference. First operand has 62 states, 45 states have (on average 1.3555555555555556) internal successors, (61), 48 states have internal predecessors, (61), 11 states have call successors, (11), 6 states have call predecessors, (11), 5 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) Second operand 65 states. [2022-04-28 14:00:21,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:00:21,880 INFO L93 Difference]: Finished difference Result 65 states and 85 transitions. [2022-04-28 14:00:21,880 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 85 transitions. [2022-04-28 14:00:21,880 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:00:21,880 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:00:21,880 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:00:21,880 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:00:21,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 45 states have (on average 1.3555555555555556) internal successors, (61), 48 states have internal predecessors, (61), 11 states have call successors, (11), 6 states have call predecessors, (11), 5 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 14:00:21,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 80 transitions. [2022-04-28 14:00:21,883 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 80 transitions. Word has length 29 [2022-04-28 14:00:21,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:00:21,883 INFO L495 AbstractCegarLoop]: Abstraction has 62 states and 80 transitions. [2022-04-28 14:00:21,883 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-28 14:00:21,883 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 62 states and 80 transitions. [2022-04-28 14:00:23,965 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 79 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 14:00:23,965 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 80 transitions. [2022-04-28 14:00:23,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-28 14:00:23,966 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:00:23,966 INFO L195 NwaCegarLoop]: trace histogram [2, 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 14:00:23,983 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-04-28 14:00:24,171 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 14:00:24,171 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:00:24,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:00:24,172 INFO L85 PathProgramCache]: Analyzing trace with hash -1357155568, now seen corresponding path program 1 times [2022-04-28 14:00:24,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:00:24,172 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [503353389] [2022-04-28 14:00:29,037 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 14:00:29,037 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 14:00:29,037 INFO L85 PathProgramCache]: Analyzing trace with hash -1357155568, now seen corresponding path program 2 times [2022-04-28 14:00:29,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:00:29,037 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1445591459] [2022-04-28 14:00:29,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:00:29,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:00:29,049 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 14:00:29,049 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [781445130] [2022-04-28 14:00:29,049 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 14:00:29,050 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 14:00:29,050 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 14:00:29,056 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 14:00:29,072 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 14:00:29,112 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 14:00:29,112 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 14:00:29,113 INFO L263 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 24 conjunts are in the unsatisfiable core [2022-04-28 14:00:29,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:00:29,123 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 14:00:29,388 INFO L272 TraceCheckUtils]: 0: Hoare triple {2965#true} call ULTIMATE.init(); {2965#true} is VALID [2022-04-28 14:00:29,389 INFO L290 TraceCheckUtils]: 1: Hoare triple {2965#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(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {2965#true} is VALID [2022-04-28 14:00:29,389 INFO L290 TraceCheckUtils]: 2: Hoare triple {2965#true} assume true; {2965#true} is VALID [2022-04-28 14:00:29,389 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2965#true} {2965#true} #77#return; {2965#true} is VALID [2022-04-28 14:00:29,389 INFO L272 TraceCheckUtils]: 4: Hoare triple {2965#true} call #t~ret7 := main(); {2965#true} is VALID [2022-04-28 14:00:29,389 INFO L290 TraceCheckUtils]: 5: Hoare triple {2965#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {2965#true} is VALID [2022-04-28 14:00:29,389 INFO L272 TraceCheckUtils]: 6: Hoare triple {2965#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {2965#true} is VALID [2022-04-28 14:00:29,389 INFO L290 TraceCheckUtils]: 7: Hoare triple {2965#true} ~cond := #in~cond; {2965#true} is VALID [2022-04-28 14:00:29,389 INFO L290 TraceCheckUtils]: 8: Hoare triple {2965#true} assume !(0 == ~cond); {2965#true} is VALID [2022-04-28 14:00:29,390 INFO L290 TraceCheckUtils]: 9: Hoare triple {2965#true} assume true; {2965#true} is VALID [2022-04-28 14:00:29,390 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2965#true} {2965#true} #69#return; {2965#true} is VALID [2022-04-28 14:00:29,393 INFO L290 TraceCheckUtils]: 11: Hoare triple {2965#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {3003#(and (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 14:00:29,394 INFO L290 TraceCheckUtils]: 12: Hoare triple {3003#(and (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3003#(and (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 14:00:29,394 INFO L290 TraceCheckUtils]: 13: Hoare triple {3003#(and (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !!(#t~post6 < 100);havoc #t~post6; {3003#(and (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 14:00:29,394 INFO L272 TraceCheckUtils]: 14: Hoare triple {3003#(and (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {2965#true} is VALID [2022-04-28 14:00:29,394 INFO L290 TraceCheckUtils]: 15: Hoare triple {2965#true} ~cond := #in~cond; {3016#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 14:00:29,395 INFO L290 TraceCheckUtils]: 16: Hoare triple {3016#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {3020#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 14:00:29,395 INFO L290 TraceCheckUtils]: 17: Hoare triple {3020#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {3020#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 14:00:29,396 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {3020#(not (= |__VERIFIER_assert_#in~cond| 0))} {3003#(and (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #71#return; {3003#(and (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 14:00:29,396 INFO L290 TraceCheckUtils]: 19: Hoare triple {3003#(and (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !!(0 != ~a~0 && 0 != ~b~0); {3003#(and (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 14:00:29,397 INFO L290 TraceCheckUtils]: 20: Hoare triple {3003#(and (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !(0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2)); {3003#(and (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 14:00:29,403 INFO L290 TraceCheckUtils]: 21: Hoare triple {3003#(and (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume 1 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := ~a~0 - 1;~q~0 := ~q~0 + ~b~0 * ~p~0; {3036#(and (= main_~b~0 main_~y~0) (= (+ main_~a~0 1) main_~x~0) (= 0 (+ main_~q~0 (* (- 1) main_~b~0 main_~p~0))) (= main_~p~0 1))} is VALID [2022-04-28 14:00:29,403 INFO L290 TraceCheckUtils]: 22: Hoare triple {3036#(and (= main_~b~0 main_~y~0) (= (+ main_~a~0 1) main_~x~0) (= 0 (+ main_~q~0 (* (- 1) main_~b~0 main_~p~0))) (= main_~p~0 1))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3036#(and (= main_~b~0 main_~y~0) (= (+ main_~a~0 1) main_~x~0) (= 0 (+ main_~q~0 (* (- 1) main_~b~0 main_~p~0))) (= main_~p~0 1))} is VALID [2022-04-28 14:00:29,404 INFO L290 TraceCheckUtils]: 23: Hoare triple {3036#(and (= main_~b~0 main_~y~0) (= (+ main_~a~0 1) main_~x~0) (= 0 (+ main_~q~0 (* (- 1) main_~b~0 main_~p~0))) (= main_~p~0 1))} assume !!(#t~post6 < 100);havoc #t~post6; {3036#(and (= main_~b~0 main_~y~0) (= (+ main_~a~0 1) main_~x~0) (= 0 (+ main_~q~0 (* (- 1) main_~b~0 main_~p~0))) (= main_~p~0 1))} is VALID [2022-04-28 14:00:29,406 INFO L272 TraceCheckUtils]: 24: Hoare triple {3036#(and (= main_~b~0 main_~y~0) (= (+ main_~a~0 1) main_~x~0) (= 0 (+ main_~q~0 (* (- 1) main_~b~0 main_~p~0))) (= main_~p~0 1))} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {3046#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 14:00:29,406 INFO L290 TraceCheckUtils]: 25: Hoare triple {3046#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3050#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 14:00:29,406 INFO L290 TraceCheckUtils]: 26: Hoare triple {3050#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2966#false} is VALID [2022-04-28 14:00:29,407 INFO L290 TraceCheckUtils]: 27: Hoare triple {2966#false} assume !false; {2966#false} is VALID [2022-04-28 14:00:29,407 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 14:00:29,407 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 14:00:50,722 INFO L290 TraceCheckUtils]: 27: Hoare triple {2966#false} assume !false; {2966#false} is VALID [2022-04-28 14:00:50,723 INFO L290 TraceCheckUtils]: 26: Hoare triple {3050#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2966#false} is VALID [2022-04-28 14:00:50,723 INFO L290 TraceCheckUtils]: 25: Hoare triple {3046#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3050#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 14:00:50,724 INFO L272 TraceCheckUtils]: 24: Hoare triple {3066#(= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {3046#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 14:00:50,725 INFO L290 TraceCheckUtils]: 23: Hoare triple {3066#(= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))} assume !!(#t~post6 < 100);havoc #t~post6; {3066#(= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))} is VALID [2022-04-28 14:00:50,725 INFO L290 TraceCheckUtils]: 22: Hoare triple {3066#(= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3066#(= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))} is VALID [2022-04-28 14:00:50,735 INFO L290 TraceCheckUtils]: 21: Hoare triple {3066#(= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))} assume 1 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := ~a~0 - 1;~q~0 := ~q~0 + ~b~0 * ~p~0; {3066#(= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))} is VALID [2022-04-28 14:00:50,736 INFO L290 TraceCheckUtils]: 20: Hoare triple {3066#(= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))} assume !(0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2)); {3066#(= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))} is VALID [2022-04-28 14:00:50,736 INFO L290 TraceCheckUtils]: 19: Hoare triple {3066#(= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))} assume !!(0 != ~a~0 && 0 != ~b~0); {3066#(= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))} is VALID [2022-04-28 14:00:50,737 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {3020#(not (= |__VERIFIER_assert_#in~cond| 0))} {2965#true} #71#return; {3066#(= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))} is VALID [2022-04-28 14:00:50,738 INFO L290 TraceCheckUtils]: 17: Hoare triple {3020#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {3020#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 14:00:50,738 INFO L290 TraceCheckUtils]: 16: Hoare triple {3094#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {3020#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 14:00:50,738 INFO L290 TraceCheckUtils]: 15: Hoare triple {2965#true} ~cond := #in~cond; {3094#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 14:00:50,739 INFO L272 TraceCheckUtils]: 14: Hoare triple {2965#true} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {2965#true} is VALID [2022-04-28 14:00:50,739 INFO L290 TraceCheckUtils]: 13: Hoare triple {2965#true} assume !!(#t~post6 < 100);havoc #t~post6; {2965#true} is VALID [2022-04-28 14:00:50,739 INFO L290 TraceCheckUtils]: 12: Hoare triple {2965#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2965#true} is VALID [2022-04-28 14:00:50,739 INFO L290 TraceCheckUtils]: 11: Hoare triple {2965#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {2965#true} is VALID [2022-04-28 14:00:50,739 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2965#true} {2965#true} #69#return; {2965#true} is VALID [2022-04-28 14:00:50,739 INFO L290 TraceCheckUtils]: 9: Hoare triple {2965#true} assume true; {2965#true} is VALID [2022-04-28 14:00:50,739 INFO L290 TraceCheckUtils]: 8: Hoare triple {2965#true} assume !(0 == ~cond); {2965#true} is VALID [2022-04-28 14:00:50,739 INFO L290 TraceCheckUtils]: 7: Hoare triple {2965#true} ~cond := #in~cond; {2965#true} is VALID [2022-04-28 14:00:50,739 INFO L272 TraceCheckUtils]: 6: Hoare triple {2965#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {2965#true} is VALID [2022-04-28 14:00:50,740 INFO L290 TraceCheckUtils]: 5: Hoare triple {2965#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {2965#true} is VALID [2022-04-28 14:00:50,740 INFO L272 TraceCheckUtils]: 4: Hoare triple {2965#true} call #t~ret7 := main(); {2965#true} is VALID [2022-04-28 14:00:50,740 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2965#true} {2965#true} #77#return; {2965#true} is VALID [2022-04-28 14:00:50,740 INFO L290 TraceCheckUtils]: 2: Hoare triple {2965#true} assume true; {2965#true} is VALID [2022-04-28 14:00:50,740 INFO L290 TraceCheckUtils]: 1: Hoare triple {2965#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(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {2965#true} is VALID [2022-04-28 14:00:50,740 INFO L272 TraceCheckUtils]: 0: Hoare triple {2965#true} call ULTIMATE.init(); {2965#true} is VALID [2022-04-28 14:00:50,740 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 14:00:50,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:00:50,741 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1445591459] [2022-04-28 14:00:50,741 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 14:00:50,741 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [781445130] [2022-04-28 14:00:50,741 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [781445130] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 14:00:50,741 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 14:00:50,741 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 10 [2022-04-28 14:00:50,741 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:00:50,741 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [503353389] [2022-04-28 14:00:50,741 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [503353389] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:00:50,742 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:00:50,742 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 14:00:50,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2029136348] [2022-04-28 14:00:50,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:00:50,742 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 28 [2022-04-28 14:00:50,742 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:00:50,742 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 14:00:50,770 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:00:50,771 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-28 14:00:50,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:00:50,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-28 14:00:50,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-04-28 14:00:50,772 INFO L87 Difference]: Start difference. First operand 62 states and 80 transitions. Second operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 14:00:51,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:00:51,282 INFO L93 Difference]: Finished difference Result 73 states and 94 transitions. [2022-04-28 14:00:51,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-28 14:00:51,282 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 28 [2022-04-28 14:00:51,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:00:51,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 14:00:51,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 60 transitions. [2022-04-28 14:00:51,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 14:00:51,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 60 transitions. [2022-04-28 14:00:51,285 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 60 transitions. [2022-04-28 14:00:51,343 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:00:51,344 INFO L225 Difference]: With dead ends: 73 [2022-04-28 14:00:51,344 INFO L226 Difference]: Without dead ends: 71 [2022-04-28 14:00:51,345 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 45 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2022-04-28 14:00:51,345 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 16 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 14:00:51,345 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 114 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 14:00:51,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2022-04-28 14:00:51,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 67. [2022-04-28 14:00:51,422 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:00:51,422 INFO L82 GeneralOperation]: Start isEquivalent. First operand 71 states. Second operand has 67 states, 48 states have (on average 1.3333333333333333) internal successors, (64), 52 states have internal predecessors, (64), 12 states have call successors, (12), 7 states have call predecessors, (12), 6 states have return successors, (9), 7 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-28 14:00:51,423 INFO L74 IsIncluded]: Start isIncluded. First operand 71 states. Second operand has 67 states, 48 states have (on average 1.3333333333333333) internal successors, (64), 52 states have internal predecessors, (64), 12 states have call successors, (12), 7 states have call predecessors, (12), 6 states have return successors, (9), 7 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-28 14:00:51,423 INFO L87 Difference]: Start difference. First operand 71 states. Second operand has 67 states, 48 states have (on average 1.3333333333333333) internal successors, (64), 52 states have internal predecessors, (64), 12 states have call successors, (12), 7 states have call predecessors, (12), 6 states have return successors, (9), 7 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-28 14:00:51,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:00:51,425 INFO L93 Difference]: Finished difference Result 71 states and 92 transitions. [2022-04-28 14:00:51,425 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 92 transitions. [2022-04-28 14:00:51,425 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:00:51,425 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:00:51,426 INFO L74 IsIncluded]: Start isIncluded. First operand has 67 states, 48 states have (on average 1.3333333333333333) internal successors, (64), 52 states have internal predecessors, (64), 12 states have call successors, (12), 7 states have call predecessors, (12), 6 states have return successors, (9), 7 states have call predecessors, (9), 9 states have call successors, (9) Second operand 71 states. [2022-04-28 14:00:51,426 INFO L87 Difference]: Start difference. First operand has 67 states, 48 states have (on average 1.3333333333333333) internal successors, (64), 52 states have internal predecessors, (64), 12 states have call successors, (12), 7 states have call predecessors, (12), 6 states have return successors, (9), 7 states have call predecessors, (9), 9 states have call successors, (9) Second operand 71 states. [2022-04-28 14:00:51,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:00:51,428 INFO L93 Difference]: Finished difference Result 71 states and 92 transitions. [2022-04-28 14:00:51,428 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 92 transitions. [2022-04-28 14:00:51,428 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:00:51,428 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:00:51,428 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:00:51,428 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:00:51,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 48 states have (on average 1.3333333333333333) internal successors, (64), 52 states have internal predecessors, (64), 12 states have call successors, (12), 7 states have call predecessors, (12), 6 states have return successors, (9), 7 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-28 14:00:51,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 85 transitions. [2022-04-28 14:00:51,431 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 85 transitions. Word has length 28 [2022-04-28 14:00:51,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:00:51,431 INFO L495 AbstractCegarLoop]: Abstraction has 67 states and 85 transitions. [2022-04-28 14:00:51,431 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 14:00:51,431 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 67 states and 85 transitions. [2022-04-28 14:00:53,537 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 85 edges. 84 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 14:00:53,537 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 85 transitions. [2022-04-28 14:00:53,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-28 14:00:53,538 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:00:53,538 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-04-28 14:00:53,556 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 14:00:53,738 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 14:00:53,739 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:00:53,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:00:53,739 INFO L85 PathProgramCache]: Analyzing trace with hash -293334773, now seen corresponding path program 1 times [2022-04-28 14:00:53,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:00:53,739 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1748775401] [2022-04-28 14:00:59,799 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 14:00:59,799 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 14:00:59,799 INFO L85 PathProgramCache]: Analyzing trace with hash -293334773, now seen corresponding path program 2 times [2022-04-28 14:00:59,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:00:59,799 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [207687881] [2022-04-28 14:00:59,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:00:59,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:00:59,814 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 14:00:59,814 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [581272866] [2022-04-28 14:00:59,814 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 14:00:59,815 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 14:00:59,815 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 14:00:59,816 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 14:00:59,817 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 14:00:59,860 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 14:00:59,861 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 14:00:59,861 INFO L263 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 26 conjunts are in the unsatisfiable core [2022-04-28 14:00:59,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:00:59,879 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 14:01:00,202 INFO L272 TraceCheckUtils]: 0: Hoare triple {3568#true} call ULTIMATE.init(); {3568#true} is VALID [2022-04-28 14:01:00,203 INFO L290 TraceCheckUtils]: 1: Hoare triple {3568#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(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {3568#true} is VALID [2022-04-28 14:01:00,203 INFO L290 TraceCheckUtils]: 2: Hoare triple {3568#true} assume true; {3568#true} is VALID [2022-04-28 14:01:00,203 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3568#true} {3568#true} #77#return; {3568#true} is VALID [2022-04-28 14:01:00,203 INFO L272 TraceCheckUtils]: 4: Hoare triple {3568#true} call #t~ret7 := main(); {3568#true} is VALID [2022-04-28 14:01:00,203 INFO L290 TraceCheckUtils]: 5: Hoare triple {3568#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {3568#true} is VALID [2022-04-28 14:01:00,203 INFO L272 TraceCheckUtils]: 6: Hoare triple {3568#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {3568#true} is VALID [2022-04-28 14:01:00,203 INFO L290 TraceCheckUtils]: 7: Hoare triple {3568#true} ~cond := #in~cond; {3568#true} is VALID [2022-04-28 14:01:00,203 INFO L290 TraceCheckUtils]: 8: Hoare triple {3568#true} assume !(0 == ~cond); {3568#true} is VALID [2022-04-28 14:01:00,203 INFO L290 TraceCheckUtils]: 9: Hoare triple {3568#true} assume true; {3568#true} is VALID [2022-04-28 14:01:00,203 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3568#true} {3568#true} #69#return; {3568#true} is VALID [2022-04-28 14:01:00,204 INFO L290 TraceCheckUtils]: 11: Hoare triple {3568#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {3606#(and (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 14:01:00,205 INFO L290 TraceCheckUtils]: 12: Hoare triple {3606#(and (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3606#(and (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 14:01:00,205 INFO L290 TraceCheckUtils]: 13: Hoare triple {3606#(and (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !!(#t~post6 < 100);havoc #t~post6; {3606#(and (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 14:01:00,205 INFO L272 TraceCheckUtils]: 14: Hoare triple {3606#(and (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {3568#true} is VALID [2022-04-28 14:01:00,205 INFO L290 TraceCheckUtils]: 15: Hoare triple {3568#true} ~cond := #in~cond; {3619#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 14:01:00,206 INFO L290 TraceCheckUtils]: 16: Hoare triple {3619#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {3623#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 14:01:00,206 INFO L290 TraceCheckUtils]: 17: Hoare triple {3623#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {3623#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 14:01:00,207 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {3623#(not (= |__VERIFIER_assert_#in~cond| 0))} {3606#(and (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #71#return; {3606#(and (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 14:01:00,208 INFO L290 TraceCheckUtils]: 19: Hoare triple {3606#(and (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !!(0 != ~a~0 && 0 != ~b~0); {3606#(and (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 14:01:00,208 INFO L290 TraceCheckUtils]: 20: Hoare triple {3606#(and (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !(0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2)); {3606#(and (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 14:01:00,209 INFO L290 TraceCheckUtils]: 21: Hoare triple {3606#(and (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !(1 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2)); {3606#(and (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 14:01:00,210 INFO L290 TraceCheckUtils]: 22: Hoare triple {3606#(and (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 1 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~b~0 := ~b~0 - 1;~q~0 := ~q~0 + ~a~0 * ~p~0; {3642#(and (= main_~b~0 (+ (- 1) main_~y~0)) (= (mod main_~a~0 2) 0) (= main_~a~0 main_~x~0) (= (+ main_~q~0 (* (- 1) main_~a~0 main_~p~0)) 0) (= main_~p~0 1))} is VALID [2022-04-28 14:01:00,210 INFO L290 TraceCheckUtils]: 23: Hoare triple {3642#(and (= main_~b~0 (+ (- 1) main_~y~0)) (= (mod main_~a~0 2) 0) (= main_~a~0 main_~x~0) (= (+ main_~q~0 (* (- 1) main_~a~0 main_~p~0)) 0) (= main_~p~0 1))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3642#(and (= main_~b~0 (+ (- 1) main_~y~0)) (= (mod main_~a~0 2) 0) (= main_~a~0 main_~x~0) (= (+ main_~q~0 (* (- 1) main_~a~0 main_~p~0)) 0) (= main_~p~0 1))} is VALID [2022-04-28 14:01:00,211 INFO L290 TraceCheckUtils]: 24: Hoare triple {3642#(and (= main_~b~0 (+ (- 1) main_~y~0)) (= (mod main_~a~0 2) 0) (= main_~a~0 main_~x~0) (= (+ main_~q~0 (* (- 1) main_~a~0 main_~p~0)) 0) (= main_~p~0 1))} assume !!(#t~post6 < 100);havoc #t~post6; {3642#(and (= main_~b~0 (+ (- 1) main_~y~0)) (= (mod main_~a~0 2) 0) (= main_~a~0 main_~x~0) (= (+ main_~q~0 (* (- 1) main_~a~0 main_~p~0)) 0) (= main_~p~0 1))} is VALID [2022-04-28 14:01:00,213 INFO L272 TraceCheckUtils]: 25: Hoare triple {3642#(and (= main_~b~0 (+ (- 1) main_~y~0)) (= (mod main_~a~0 2) 0) (= main_~a~0 main_~x~0) (= (+ main_~q~0 (* (- 1) main_~a~0 main_~p~0)) 0) (= main_~p~0 1))} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {3652#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 14:01:00,213 INFO L290 TraceCheckUtils]: 26: Hoare triple {3652#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3656#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 14:01:00,214 INFO L290 TraceCheckUtils]: 27: Hoare triple {3656#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3569#false} is VALID [2022-04-28 14:01:00,214 INFO L290 TraceCheckUtils]: 28: Hoare triple {3569#false} assume !false; {3569#false} is VALID [2022-04-28 14:01:00,214 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 14:01:00,214 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 14:01:12,738 INFO L290 TraceCheckUtils]: 28: Hoare triple {3569#false} assume !false; {3569#false} is VALID [2022-04-28 14:01:12,739 INFO L290 TraceCheckUtils]: 27: Hoare triple {3656#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3569#false} is VALID [2022-04-28 14:01:12,739 INFO L290 TraceCheckUtils]: 26: Hoare triple {3652#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3656#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 14:01:12,740 INFO L272 TraceCheckUtils]: 25: Hoare triple {3672#(= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {3652#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 14:01:12,740 INFO L290 TraceCheckUtils]: 24: Hoare triple {3672#(= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))} assume !!(#t~post6 < 100);havoc #t~post6; {3672#(= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))} is VALID [2022-04-28 14:01:12,741 INFO L290 TraceCheckUtils]: 23: Hoare triple {3672#(= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3672#(= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))} is VALID [2022-04-28 14:01:12,752 INFO L290 TraceCheckUtils]: 22: Hoare triple {3682#(or (not (= (mod main_~a~0 2) 0)) (= (* main_~y~0 main_~x~0) (+ (* main_~a~0 main_~p~0) main_~q~0 (* main_~a~0 main_~p~0 (+ (- 1) main_~b~0)))))} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 1 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~b~0 := ~b~0 - 1;~q~0 := ~q~0 + ~a~0 * ~p~0; {3672#(= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))} is VALID [2022-04-28 14:01:12,753 INFO L290 TraceCheckUtils]: 21: Hoare triple {3682#(or (not (= (mod main_~a~0 2) 0)) (= (* main_~y~0 main_~x~0) (+ (* main_~a~0 main_~p~0) main_~q~0 (* main_~a~0 main_~p~0 (+ (- 1) main_~b~0)))))} assume !(1 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2)); {3682#(or (not (= (mod main_~a~0 2) 0)) (= (* main_~y~0 main_~x~0) (+ (* main_~a~0 main_~p~0) main_~q~0 (* main_~a~0 main_~p~0 (+ (- 1) main_~b~0)))))} is VALID [2022-04-28 14:01:12,753 INFO L290 TraceCheckUtils]: 20: Hoare triple {3682#(or (not (= (mod main_~a~0 2) 0)) (= (* main_~y~0 main_~x~0) (+ (* main_~a~0 main_~p~0) main_~q~0 (* main_~a~0 main_~p~0 (+ (- 1) main_~b~0)))))} assume !(0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2)); {3682#(or (not (= (mod main_~a~0 2) 0)) (= (* main_~y~0 main_~x~0) (+ (* main_~a~0 main_~p~0) main_~q~0 (* main_~a~0 main_~p~0 (+ (- 1) main_~b~0)))))} is VALID [2022-04-28 14:01:12,754 INFO L290 TraceCheckUtils]: 19: Hoare triple {3682#(or (not (= (mod main_~a~0 2) 0)) (= (* main_~y~0 main_~x~0) (+ (* main_~a~0 main_~p~0) main_~q~0 (* main_~a~0 main_~p~0 (+ (- 1) main_~b~0)))))} assume !!(0 != ~a~0 && 0 != ~b~0); {3682#(or (not (= (mod main_~a~0 2) 0)) (= (* main_~y~0 main_~x~0) (+ (* main_~a~0 main_~p~0) main_~q~0 (* main_~a~0 main_~p~0 (+ (- 1) main_~b~0)))))} is VALID [2022-04-28 14:01:12,754 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {3623#(not (= |__VERIFIER_assert_#in~cond| 0))} {3568#true} #71#return; {3682#(or (not (= (mod main_~a~0 2) 0)) (= (* main_~y~0 main_~x~0) (+ (* main_~a~0 main_~p~0) main_~q~0 (* main_~a~0 main_~p~0 (+ (- 1) main_~b~0)))))} is VALID [2022-04-28 14:01:12,755 INFO L290 TraceCheckUtils]: 17: Hoare triple {3623#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {3623#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 14:01:12,762 INFO L290 TraceCheckUtils]: 16: Hoare triple {3704#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {3623#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 14:01:12,763 INFO L290 TraceCheckUtils]: 15: Hoare triple {3568#true} ~cond := #in~cond; {3704#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 14:01:12,763 INFO L272 TraceCheckUtils]: 14: Hoare triple {3568#true} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {3568#true} is VALID [2022-04-28 14:01:12,763 INFO L290 TraceCheckUtils]: 13: Hoare triple {3568#true} assume !!(#t~post6 < 100);havoc #t~post6; {3568#true} is VALID [2022-04-28 14:01:12,763 INFO L290 TraceCheckUtils]: 12: Hoare triple {3568#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3568#true} is VALID [2022-04-28 14:01:12,763 INFO L290 TraceCheckUtils]: 11: Hoare triple {3568#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {3568#true} is VALID [2022-04-28 14:01:12,763 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3568#true} {3568#true} #69#return; {3568#true} is VALID [2022-04-28 14:01:12,763 INFO L290 TraceCheckUtils]: 9: Hoare triple {3568#true} assume true; {3568#true} is VALID [2022-04-28 14:01:12,763 INFO L290 TraceCheckUtils]: 8: Hoare triple {3568#true} assume !(0 == ~cond); {3568#true} is VALID [2022-04-28 14:01:12,763 INFO L290 TraceCheckUtils]: 7: Hoare triple {3568#true} ~cond := #in~cond; {3568#true} is VALID [2022-04-28 14:01:12,763 INFO L272 TraceCheckUtils]: 6: Hoare triple {3568#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {3568#true} is VALID [2022-04-28 14:01:12,764 INFO L290 TraceCheckUtils]: 5: Hoare triple {3568#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {3568#true} is VALID [2022-04-28 14:01:12,764 INFO L272 TraceCheckUtils]: 4: Hoare triple {3568#true} call #t~ret7 := main(); {3568#true} is VALID [2022-04-28 14:01:12,764 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3568#true} {3568#true} #77#return; {3568#true} is VALID [2022-04-28 14:01:12,764 INFO L290 TraceCheckUtils]: 2: Hoare triple {3568#true} assume true; {3568#true} is VALID [2022-04-28 14:01:12,764 INFO L290 TraceCheckUtils]: 1: Hoare triple {3568#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(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {3568#true} is VALID [2022-04-28 14:01:12,764 INFO L272 TraceCheckUtils]: 0: Hoare triple {3568#true} call ULTIMATE.init(); {3568#true} is VALID [2022-04-28 14:01:12,764 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 14:01:12,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:01:12,764 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [207687881] [2022-04-28 14:01:12,764 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 14:01:12,764 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [581272866] [2022-04-28 14:01:12,764 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [581272866] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 14:01:12,764 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 14:01:12,764 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 11 [2022-04-28 14:01:12,765 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:01:12,765 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1748775401] [2022-04-28 14:01:12,765 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1748775401] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:01:12,765 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:01:12,765 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 14:01:12,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2109081601] [2022-04-28 14:01:12,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:01:12,766 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 29 [2022-04-28 14:01:12,766 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:01:12,766 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), 7 states have internal predecessors, (21), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 14:01:12,790 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:01:12,790 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-28 14:01:12,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:01:12,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-28 14:01:12,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2022-04-28 14:01:12,790 INFO L87 Difference]: Start difference. First operand 67 states and 85 transitions. Second operand has 8 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 14:01:13,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:01:13,579 INFO L93 Difference]: Finished difference Result 95 states and 125 transitions. [2022-04-28 14:01:13,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-28 14:01:13,580 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 29 [2022-04-28 14:01:13,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:01:13,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 14:01:13,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 84 transitions. [2022-04-28 14:01:13,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 14:01:13,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 84 transitions. [2022-04-28 14:01:13,583 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 84 transitions. [2022-04-28 14:01:13,663 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 84 edges. 84 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:01:13,664 INFO L225 Difference]: With dead ends: 95 [2022-04-28 14:01:13,664 INFO L226 Difference]: Without dead ends: 80 [2022-04-28 14:01:13,665 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 47 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2022-04-28 14:01:13,665 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 16 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-28 14:01:13,665 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 116 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-28 14:01:13,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2022-04-28 14:01:13,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 77. [2022-04-28 14:01:13,741 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:01:13,741 INFO L82 GeneralOperation]: Start isEquivalent. First operand 80 states. Second operand has 77 states, 56 states have (on average 1.3214285714285714) internal successors, (74), 60 states have internal predecessors, (74), 13 states have call successors, (13), 8 states have call predecessors, (13), 7 states have return successors, (10), 8 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-28 14:01:13,742 INFO L74 IsIncluded]: Start isIncluded. First operand 80 states. Second operand has 77 states, 56 states have (on average 1.3214285714285714) internal successors, (74), 60 states have internal predecessors, (74), 13 states have call successors, (13), 8 states have call predecessors, (13), 7 states have return successors, (10), 8 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-28 14:01:13,742 INFO L87 Difference]: Start difference. First operand 80 states. Second operand has 77 states, 56 states have (on average 1.3214285714285714) internal successors, (74), 60 states have internal predecessors, (74), 13 states have call successors, (13), 8 states have call predecessors, (13), 7 states have return successors, (10), 8 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-28 14:01:13,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:01:13,744 INFO L93 Difference]: Finished difference Result 80 states and 102 transitions. [2022-04-28 14:01:13,745 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 102 transitions. [2022-04-28 14:01:13,745 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:01:13,745 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:01:13,745 INFO L74 IsIncluded]: Start isIncluded. First operand has 77 states, 56 states have (on average 1.3214285714285714) internal successors, (74), 60 states have internal predecessors, (74), 13 states have call successors, (13), 8 states have call predecessors, (13), 7 states have return successors, (10), 8 states have call predecessors, (10), 10 states have call successors, (10) Second operand 80 states. [2022-04-28 14:01:13,745 INFO L87 Difference]: Start difference. First operand has 77 states, 56 states have (on average 1.3214285714285714) internal successors, (74), 60 states have internal predecessors, (74), 13 states have call successors, (13), 8 states have call predecessors, (13), 7 states have return successors, (10), 8 states have call predecessors, (10), 10 states have call successors, (10) Second operand 80 states. [2022-04-28 14:01:13,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:01:13,748 INFO L93 Difference]: Finished difference Result 80 states and 102 transitions. [2022-04-28 14:01:13,748 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 102 transitions. [2022-04-28 14:01:13,748 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:01:13,748 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:01:13,748 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:01:13,748 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:01:13,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 56 states have (on average 1.3214285714285714) internal successors, (74), 60 states have internal predecessors, (74), 13 states have call successors, (13), 8 states have call predecessors, (13), 7 states have return successors, (10), 8 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-28 14:01:13,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 97 transitions. [2022-04-28 14:01:13,751 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 97 transitions. Word has length 29 [2022-04-28 14:01:13,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:01:13,751 INFO L495 AbstractCegarLoop]: Abstraction has 77 states and 97 transitions. [2022-04-28 14:01:13,752 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 14:01:13,752 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 77 states and 97 transitions. [2022-04-28 14:01:15,907 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 97 edges. 96 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 14:01:15,907 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 97 transitions. [2022-04-28 14:01:15,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-28 14:01:15,907 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:01:15,908 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-04-28 14:01:15,927 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 14:01:16,108 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,SelfDestructingSolverStorable8 [2022-04-28 14:01:16,108 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:01:16,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:01:16,109 INFO L85 PathProgramCache]: Analyzing trace with hash 1481672589, now seen corresponding path program 1 times [2022-04-28 14:01:16,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:01:16,109 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1886065452] [2022-04-28 14:01:22,181 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 14:01:22,182 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 14:01:22,182 INFO L85 PathProgramCache]: Analyzing trace with hash 1481672589, now seen corresponding path program 2 times [2022-04-28 14:01:22,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:01:22,182 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [394701860] [2022-04-28 14:01:22,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:01:22,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:01:22,201 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 14:01:22,202 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1623138677] [2022-04-28 14:01:22,202 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 14:01:22,202 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 14:01:22,202 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 14:01:22,206 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 14:01:22,207 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 14:01:22,245 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 14:01:22,245 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 14:01:22,246 INFO L263 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 21 conjunts are in the unsatisfiable core [2022-04-28 14:01:22,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:01:22,259 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 14:01:22,468 INFO L272 TraceCheckUtils]: 0: Hoare triple {4260#true} call ULTIMATE.init(); {4260#true} is VALID [2022-04-28 14:01:22,469 INFO L290 TraceCheckUtils]: 1: Hoare triple {4260#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(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {4260#true} is VALID [2022-04-28 14:01:22,469 INFO L290 TraceCheckUtils]: 2: Hoare triple {4260#true} assume true; {4260#true} is VALID [2022-04-28 14:01:22,469 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4260#true} {4260#true} #77#return; {4260#true} is VALID [2022-04-28 14:01:22,469 INFO L272 TraceCheckUtils]: 4: Hoare triple {4260#true} call #t~ret7 := main(); {4260#true} is VALID [2022-04-28 14:01:22,469 INFO L290 TraceCheckUtils]: 5: Hoare triple {4260#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {4260#true} is VALID [2022-04-28 14:01:22,469 INFO L272 TraceCheckUtils]: 6: Hoare triple {4260#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {4260#true} is VALID [2022-04-28 14:01:22,469 INFO L290 TraceCheckUtils]: 7: Hoare triple {4260#true} ~cond := #in~cond; {4260#true} is VALID [2022-04-28 14:01:22,469 INFO L290 TraceCheckUtils]: 8: Hoare triple {4260#true} assume !(0 == ~cond); {4260#true} is VALID [2022-04-28 14:01:22,469 INFO L290 TraceCheckUtils]: 9: Hoare triple {4260#true} assume true; {4260#true} is VALID [2022-04-28 14:01:22,469 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4260#true} {4260#true} #69#return; {4260#true} is VALID [2022-04-28 14:01:22,470 INFO L290 TraceCheckUtils]: 11: Hoare triple {4260#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {4298#(and (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 14:01:22,470 INFO L290 TraceCheckUtils]: 12: Hoare triple {4298#(and (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4298#(and (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 14:01:22,471 INFO L290 TraceCheckUtils]: 13: Hoare triple {4298#(and (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !!(#t~post6 < 100);havoc #t~post6; {4298#(and (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 14:01:22,471 INFO L272 TraceCheckUtils]: 14: Hoare triple {4298#(and (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {4260#true} is VALID [2022-04-28 14:01:22,471 INFO L290 TraceCheckUtils]: 15: Hoare triple {4260#true} ~cond := #in~cond; {4260#true} is VALID [2022-04-28 14:01:22,471 INFO L290 TraceCheckUtils]: 16: Hoare triple {4260#true} assume !(0 == ~cond); {4260#true} is VALID [2022-04-28 14:01:22,471 INFO L290 TraceCheckUtils]: 17: Hoare triple {4260#true} assume true; {4260#true} is VALID [2022-04-28 14:01:22,472 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {4260#true} {4298#(and (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #71#return; {4298#(and (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 14:01:22,473 INFO L290 TraceCheckUtils]: 19: Hoare triple {4298#(and (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !!(0 != ~a~0 && 0 != ~b~0); {4298#(and (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 14:01:22,473 INFO L290 TraceCheckUtils]: 20: Hoare triple {4298#(and (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !(0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2)); {4298#(and (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 14:01:22,474 INFO L290 TraceCheckUtils]: 21: Hoare triple {4298#(and (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !(1 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2)); {4298#(and (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 14:01:22,475 INFO L290 TraceCheckUtils]: 22: Hoare triple {4298#(and (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !(0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 1 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2));~a~0 := ~a~0 - 1;~b~0 := ~b~0 - 1;~q~0 := ~q~0 + (1 + (~a~0 + ~b~0)) * ~p~0; {4332#(and (= main_~b~0 (+ (- 1) main_~y~0)) (= (+ main_~q~0 (* (- 1) main_~a~0 main_~p~0) (* (- 1) main_~b~0 main_~p~0) (* (- 1) main_~p~0)) 0) (= (+ (- 1) main_~x~0) main_~a~0) (= main_~p~0 1))} is VALID [2022-04-28 14:01:22,476 INFO L290 TraceCheckUtils]: 23: Hoare triple {4332#(and (= main_~b~0 (+ (- 1) main_~y~0)) (= (+ main_~q~0 (* (- 1) main_~a~0 main_~p~0) (* (- 1) main_~b~0 main_~p~0) (* (- 1) main_~p~0)) 0) (= (+ (- 1) main_~x~0) main_~a~0) (= main_~p~0 1))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4332#(and (= main_~b~0 (+ (- 1) main_~y~0)) (= (+ main_~q~0 (* (- 1) main_~a~0 main_~p~0) (* (- 1) main_~b~0 main_~p~0) (* (- 1) main_~p~0)) 0) (= (+ (- 1) main_~x~0) main_~a~0) (= main_~p~0 1))} is VALID [2022-04-28 14:01:22,476 INFO L290 TraceCheckUtils]: 24: Hoare triple {4332#(and (= main_~b~0 (+ (- 1) main_~y~0)) (= (+ main_~q~0 (* (- 1) main_~a~0 main_~p~0) (* (- 1) main_~b~0 main_~p~0) (* (- 1) main_~p~0)) 0) (= (+ (- 1) main_~x~0) main_~a~0) (= main_~p~0 1))} assume !!(#t~post6 < 100);havoc #t~post6; {4332#(and (= main_~b~0 (+ (- 1) main_~y~0)) (= (+ main_~q~0 (* (- 1) main_~a~0 main_~p~0) (* (- 1) main_~b~0 main_~p~0) (* (- 1) main_~p~0)) 0) (= (+ (- 1) main_~x~0) main_~a~0) (= main_~p~0 1))} is VALID [2022-04-28 14:01:22,479 INFO L272 TraceCheckUtils]: 25: Hoare triple {4332#(and (= main_~b~0 (+ (- 1) main_~y~0)) (= (+ main_~q~0 (* (- 1) main_~a~0 main_~p~0) (* (- 1) main_~b~0 main_~p~0) (* (- 1) main_~p~0)) 0) (= (+ (- 1) main_~x~0) main_~a~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {4342#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 14:01:22,479 INFO L290 TraceCheckUtils]: 26: Hoare triple {4342#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4346#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 14:01:22,479 INFO L290 TraceCheckUtils]: 27: Hoare triple {4346#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4261#false} is VALID [2022-04-28 14:01:22,479 INFO L290 TraceCheckUtils]: 28: Hoare triple {4261#false} assume !false; {4261#false} is VALID [2022-04-28 14:01:22,480 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 14:01:22,480 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 14:01:22,606 INFO L290 TraceCheckUtils]: 28: Hoare triple {4261#false} assume !false; {4261#false} is VALID [2022-04-28 14:01:22,606 INFO L290 TraceCheckUtils]: 27: Hoare triple {4346#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4261#false} is VALID [2022-04-28 14:01:22,606 INFO L290 TraceCheckUtils]: 26: Hoare triple {4342#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4346#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 14:01:22,607 INFO L272 TraceCheckUtils]: 25: Hoare triple {4362#(= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {4342#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 14:01:22,607 INFO L290 TraceCheckUtils]: 24: Hoare triple {4362#(= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))} assume !!(#t~post6 < 100);havoc #t~post6; {4362#(= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))} is VALID [2022-04-28 14:01:22,608 INFO L290 TraceCheckUtils]: 23: Hoare triple {4362#(= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4362#(= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))} is VALID [2022-04-28 14:01:22,611 INFO L290 TraceCheckUtils]: 22: Hoare triple {4362#(= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))} assume !(0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 1 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2));~a~0 := ~a~0 - 1;~b~0 := ~b~0 - 1;~q~0 := ~q~0 + (1 + (~a~0 + ~b~0)) * ~p~0; {4362#(= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))} is VALID [2022-04-28 14:01:22,612 INFO L290 TraceCheckUtils]: 21: Hoare triple {4362#(= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))} assume !(1 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2)); {4362#(= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))} is VALID [2022-04-28 14:01:22,612 INFO L290 TraceCheckUtils]: 20: Hoare triple {4362#(= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))} assume !(0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2)); {4362#(= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))} is VALID [2022-04-28 14:01:22,613 INFO L290 TraceCheckUtils]: 19: Hoare triple {4362#(= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))} assume !!(0 != ~a~0 && 0 != ~b~0); {4362#(= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))} is VALID [2022-04-28 14:01:22,613 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {4260#true} {4362#(= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))} #71#return; {4362#(= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))} is VALID [2022-04-28 14:01:22,613 INFO L290 TraceCheckUtils]: 17: Hoare triple {4260#true} assume true; {4260#true} is VALID [2022-04-28 14:01:22,613 INFO L290 TraceCheckUtils]: 16: Hoare triple {4260#true} assume !(0 == ~cond); {4260#true} is VALID [2022-04-28 14:01:22,613 INFO L290 TraceCheckUtils]: 15: Hoare triple {4260#true} ~cond := #in~cond; {4260#true} is VALID [2022-04-28 14:01:22,614 INFO L272 TraceCheckUtils]: 14: Hoare triple {4362#(= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {4260#true} is VALID [2022-04-28 14:01:22,614 INFO L290 TraceCheckUtils]: 13: Hoare triple {4362#(= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))} assume !!(#t~post6 < 100);havoc #t~post6; {4362#(= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))} is VALID [2022-04-28 14:01:22,614 INFO L290 TraceCheckUtils]: 12: Hoare triple {4362#(= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4362#(= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))} is VALID [2022-04-28 14:01:22,615 INFO L290 TraceCheckUtils]: 11: Hoare triple {4260#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {4362#(= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))} is VALID [2022-04-28 14:01:22,615 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4260#true} {4260#true} #69#return; {4260#true} is VALID [2022-04-28 14:01:22,615 INFO L290 TraceCheckUtils]: 9: Hoare triple {4260#true} assume true; {4260#true} is VALID [2022-04-28 14:01:22,615 INFO L290 TraceCheckUtils]: 8: Hoare triple {4260#true} assume !(0 == ~cond); {4260#true} is VALID [2022-04-28 14:01:22,615 INFO L290 TraceCheckUtils]: 7: Hoare triple {4260#true} ~cond := #in~cond; {4260#true} is VALID [2022-04-28 14:01:22,615 INFO L272 TraceCheckUtils]: 6: Hoare triple {4260#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {4260#true} is VALID [2022-04-28 14:01:22,615 INFO L290 TraceCheckUtils]: 5: Hoare triple {4260#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {4260#true} is VALID [2022-04-28 14:01:22,615 INFO L272 TraceCheckUtils]: 4: Hoare triple {4260#true} call #t~ret7 := main(); {4260#true} is VALID [2022-04-28 14:01:22,615 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4260#true} {4260#true} #77#return; {4260#true} is VALID [2022-04-28 14:01:22,615 INFO L290 TraceCheckUtils]: 2: Hoare triple {4260#true} assume true; {4260#true} is VALID [2022-04-28 14:01:22,615 INFO L290 TraceCheckUtils]: 1: Hoare triple {4260#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(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {4260#true} is VALID [2022-04-28 14:01:22,616 INFO L272 TraceCheckUtils]: 0: Hoare triple {4260#true} call ULTIMATE.init(); {4260#true} is VALID [2022-04-28 14:01:22,616 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-28 14:01:22,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:01:22,616 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [394701860] [2022-04-28 14:01:22,616 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 14:01:22,616 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1623138677] [2022-04-28 14:01:22,616 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1623138677] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-28 14:01:22,616 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-28 14:01:22,616 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2022-04-28 14:01:22,617 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:01:22,617 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1886065452] [2022-04-28 14:01:22,617 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1886065452] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:01:22,617 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:01:22,617 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 14:01:22,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [903016655] [2022-04-28 14:01:22,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:01:22,617 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 29 [2022-04-28 14:01:22,618 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:01:22,618 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 14:01:22,639 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:01:22,639 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 14:01:22,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:01:22,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 14:01:22,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-04-28 14:01:22,639 INFO L87 Difference]: Start difference. First operand 77 states and 97 transitions. Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 14:01:22,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:01:22,953 INFO L93 Difference]: Finished difference Result 83 states and 102 transitions. [2022-04-28 14:01:22,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 14:01:22,954 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 29 [2022-04-28 14:01:22,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:01:22,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 14:01:22,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 38 transitions. [2022-04-28 14:01:22,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 14:01:22,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 38 transitions. [2022-04-28 14:01:22,956 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 38 transitions. [2022-04-28 14:01:23,038 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:01:23,039 INFO L225 Difference]: With dead ends: 83 [2022-04-28 14:01:23,039 INFO L226 Difference]: Without dead ends: 81 [2022-04-28 14:01:23,040 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 50 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-04-28 14:01:23,040 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 7 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 14:01:23,040 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 72 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 14:01:23,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2022-04-28 14:01:23,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2022-04-28 14:01:23,130 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:01:23,131 INFO L82 GeneralOperation]: Start isEquivalent. First operand 81 states. Second operand has 81 states, 59 states have (on average 1.305084745762712) internal successors, (77), 63 states have internal predecessors, (77), 13 states have call successors, (13), 9 states have call predecessors, (13), 8 states have return successors, (10), 8 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-28 14:01:23,131 INFO L74 IsIncluded]: Start isIncluded. First operand 81 states. Second operand has 81 states, 59 states have (on average 1.305084745762712) internal successors, (77), 63 states have internal predecessors, (77), 13 states have call successors, (13), 9 states have call predecessors, (13), 8 states have return successors, (10), 8 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-28 14:01:23,131 INFO L87 Difference]: Start difference. First operand 81 states. Second operand has 81 states, 59 states have (on average 1.305084745762712) internal successors, (77), 63 states have internal predecessors, (77), 13 states have call successors, (13), 9 states have call predecessors, (13), 8 states have return successors, (10), 8 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-28 14:01:23,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:01:23,133 INFO L93 Difference]: Finished difference Result 81 states and 100 transitions. [2022-04-28 14:01:23,133 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 100 transitions. [2022-04-28 14:01:23,134 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:01:23,134 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:01:23,134 INFO L74 IsIncluded]: Start isIncluded. First operand has 81 states, 59 states have (on average 1.305084745762712) internal successors, (77), 63 states have internal predecessors, (77), 13 states have call successors, (13), 9 states have call predecessors, (13), 8 states have return successors, (10), 8 states have call predecessors, (10), 10 states have call successors, (10) Second operand 81 states. [2022-04-28 14:01:23,134 INFO L87 Difference]: Start difference. First operand has 81 states, 59 states have (on average 1.305084745762712) internal successors, (77), 63 states have internal predecessors, (77), 13 states have call successors, (13), 9 states have call predecessors, (13), 8 states have return successors, (10), 8 states have call predecessors, (10), 10 states have call successors, (10) Second operand 81 states. [2022-04-28 14:01:23,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:01:23,136 INFO L93 Difference]: Finished difference Result 81 states and 100 transitions. [2022-04-28 14:01:23,136 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 100 transitions. [2022-04-28 14:01:23,136 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:01:23,136 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:01:23,136 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:01:23,136 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:01:23,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 59 states have (on average 1.305084745762712) internal successors, (77), 63 states have internal predecessors, (77), 13 states have call successors, (13), 9 states have call predecessors, (13), 8 states have return successors, (10), 8 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-28 14:01:23,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 100 transitions. [2022-04-28 14:01:23,138 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 100 transitions. Word has length 29 [2022-04-28 14:01:23,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:01:23,138 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 100 transitions. [2022-04-28 14:01:23,139 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 14:01:23,139 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 81 states and 100 transitions. [2022-04-28 14:01:25,470 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 100 edges. 99 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 14:01:25,470 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 100 transitions. [2022-04-28 14:01:25,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-04-28 14:01:25,471 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:01:25,471 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-04-28 14:01:25,488 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 14:01:25,676 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,SelfDestructingSolverStorable9 [2022-04-28 14:01:25,676 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:01:25,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:01:25,676 INFO L85 PathProgramCache]: Analyzing trace with hash 1680888588, now seen corresponding path program 1 times [2022-04-28 14:01:25,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:01:25,677 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1432165138] [2022-04-28 14:01:31,734 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 14:01:31,734 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 14:01:31,734 INFO L85 PathProgramCache]: Analyzing trace with hash 1680888588, now seen corresponding path program 2 times [2022-04-28 14:01:31,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:01:31,734 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348475777] [2022-04-28 14:01:31,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:01:31,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:01:31,743 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 14:01:31,744 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1699356024] [2022-04-28 14:01:31,744 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 14:01:31,744 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 14:01:31,744 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 14:01:31,750 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 14:01:31,751 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 14:01:31,789 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 14:01:31,789 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 14:01:31,790 INFO L263 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 14 conjunts are in the unsatisfiable core [2022-04-28 14:01:31,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:01:31,798 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 14:01:32,180 INFO L272 TraceCheckUtils]: 0: Hoare triple {4932#true} call ULTIMATE.init(); {4932#true} is VALID [2022-04-28 14:01:32,180 INFO L290 TraceCheckUtils]: 1: Hoare triple {4932#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(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {4932#true} is VALID [2022-04-28 14:01:32,180 INFO L290 TraceCheckUtils]: 2: Hoare triple {4932#true} assume true; {4932#true} is VALID [2022-04-28 14:01:32,180 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4932#true} {4932#true} #77#return; {4932#true} is VALID [2022-04-28 14:01:32,180 INFO L272 TraceCheckUtils]: 4: Hoare triple {4932#true} call #t~ret7 := main(); {4932#true} is VALID [2022-04-28 14:01:32,180 INFO L290 TraceCheckUtils]: 5: Hoare triple {4932#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {4932#true} is VALID [2022-04-28 14:01:32,180 INFO L272 TraceCheckUtils]: 6: Hoare triple {4932#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {4932#true} is VALID [2022-04-28 14:01:32,181 INFO L290 TraceCheckUtils]: 7: Hoare triple {4932#true} ~cond := #in~cond; {4958#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-28 14:01:32,181 INFO L290 TraceCheckUtils]: 8: Hoare triple {4958#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {4962#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 14:01:32,182 INFO L290 TraceCheckUtils]: 9: Hoare triple {4962#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {4962#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 14:01:32,182 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4962#(not (= |assume_abort_if_not_#in~cond| 0))} {4932#true} #69#return; {4969#(<= 1 main_~y~0)} is VALID [2022-04-28 14:01:32,183 INFO L290 TraceCheckUtils]: 11: Hoare triple {4969#(<= 1 main_~y~0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {4973#(<= 1 main_~b~0)} is VALID [2022-04-28 14:01:32,183 INFO L290 TraceCheckUtils]: 12: Hoare triple {4973#(<= 1 main_~b~0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4973#(<= 1 main_~b~0)} is VALID [2022-04-28 14:01:32,184 INFO L290 TraceCheckUtils]: 13: Hoare triple {4973#(<= 1 main_~b~0)} assume !!(#t~post6 < 100);havoc #t~post6; {4973#(<= 1 main_~b~0)} is VALID [2022-04-28 14:01:32,184 INFO L272 TraceCheckUtils]: 14: Hoare triple {4973#(<= 1 main_~b~0)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {4932#true} is VALID [2022-04-28 14:01:32,184 INFO L290 TraceCheckUtils]: 15: Hoare triple {4932#true} ~cond := #in~cond; {4932#true} is VALID [2022-04-28 14:01:32,184 INFO L290 TraceCheckUtils]: 16: Hoare triple {4932#true} assume !(0 == ~cond); {4932#true} is VALID [2022-04-28 14:01:32,184 INFO L290 TraceCheckUtils]: 17: Hoare triple {4932#true} assume true; {4932#true} is VALID [2022-04-28 14:01:32,185 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {4932#true} {4973#(<= 1 main_~b~0)} #71#return; {4973#(<= 1 main_~b~0)} is VALID [2022-04-28 14:01:32,185 INFO L290 TraceCheckUtils]: 19: Hoare triple {4973#(<= 1 main_~b~0)} assume !!(0 != ~a~0 && 0 != ~b~0); {4998#(and (not (= main_~a~0 0)) (<= 1 main_~b~0))} is VALID [2022-04-28 14:01:32,187 INFO L290 TraceCheckUtils]: 20: Hoare triple {4998#(and (not (= main_~a~0 0)) (<= 1 main_~b~0))} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {4998#(and (not (= main_~a~0 0)) (<= 1 main_~b~0))} is VALID [2022-04-28 14:01:32,187 INFO L290 TraceCheckUtils]: 21: Hoare triple {4998#(and (not (= main_~a~0 0)) (<= 1 main_~b~0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4998#(and (not (= main_~a~0 0)) (<= 1 main_~b~0))} is VALID [2022-04-28 14:01:32,188 INFO L290 TraceCheckUtils]: 22: Hoare triple {4998#(and (not (= main_~a~0 0)) (<= 1 main_~b~0))} assume !!(#t~post6 < 100);havoc #t~post6; {4998#(and (not (= main_~a~0 0)) (<= 1 main_~b~0))} is VALID [2022-04-28 14:01:32,188 INFO L272 TraceCheckUtils]: 23: Hoare triple {4998#(and (not (= main_~a~0 0)) (<= 1 main_~b~0))} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {4932#true} is VALID [2022-04-28 14:01:32,188 INFO L290 TraceCheckUtils]: 24: Hoare triple {4932#true} ~cond := #in~cond; {4932#true} is VALID [2022-04-28 14:01:32,188 INFO L290 TraceCheckUtils]: 25: Hoare triple {4932#true} assume !(0 == ~cond); {4932#true} is VALID [2022-04-28 14:01:32,188 INFO L290 TraceCheckUtils]: 26: Hoare triple {4932#true} assume true; {4932#true} is VALID [2022-04-28 14:01:32,189 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {4932#true} {4998#(and (not (= main_~a~0 0)) (<= 1 main_~b~0))} #71#return; {4998#(and (not (= main_~a~0 0)) (<= 1 main_~b~0))} is VALID [2022-04-28 14:01:32,189 INFO L290 TraceCheckUtils]: 28: Hoare triple {4998#(and (not (= main_~a~0 0)) (<= 1 main_~b~0))} assume !(0 != ~a~0 && 0 != ~b~0); {4933#false} is VALID [2022-04-28 14:01:32,190 INFO L272 TraceCheckUtils]: 29: Hoare triple {4933#false} call __VERIFIER_assert((if ~q~0 == ~x~0 * ~y~0 then 1 else 0)); {4933#false} is VALID [2022-04-28 14:01:32,190 INFO L290 TraceCheckUtils]: 30: Hoare triple {4933#false} ~cond := #in~cond; {4933#false} is VALID [2022-04-28 14:01:32,190 INFO L290 TraceCheckUtils]: 31: Hoare triple {4933#false} assume 0 == ~cond; {4933#false} is VALID [2022-04-28 14:01:32,190 INFO L290 TraceCheckUtils]: 32: Hoare triple {4933#false} assume !false; {4933#false} is VALID [2022-04-28 14:01:32,190 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 14:01:32,190 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 14:01:32,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:01:32,190 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1348475777] [2022-04-28 14:01:32,190 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 14:01:32,190 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1699356024] [2022-04-28 14:01:32,191 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1699356024] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:01:32,191 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:01:32,191 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 14:01:32,191 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:01:32,191 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1432165138] [2022-04-28 14:01:32,191 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1432165138] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:01:32,191 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:01:32,191 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 14:01:32,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1554308326] [2022-04-28 14:01:32,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:01:32,192 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 4 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 33 [2022-04-28 14:01:32,192 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:01:32,192 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 4 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-28 14:01:32,220 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 14:01:32,220 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-28 14:01:32,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:01:32,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-28 14:01:32,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-04-28 14:01:32,221 INFO L87 Difference]: Start difference. First operand 81 states and 100 transitions. Second operand has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 4 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-28 14:01:32,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:01:32,619 INFO L93 Difference]: Finished difference Result 97 states and 121 transitions. [2022-04-28 14:01:32,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-28 14:01:32,620 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 4 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 33 [2022-04-28 14:01:32,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:01:32,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 4 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-28 14:01:32,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 65 transitions. [2022-04-28 14:01:32,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 4 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-28 14:01:32,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 65 transitions. [2022-04-28 14:01:32,622 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 65 transitions. [2022-04-28 14:01:32,671 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:01:32,673 INFO L225 Difference]: With dead ends: 97 [2022-04-28 14:01:32,673 INFO L226 Difference]: Without dead ends: 90 [2022-04-28 14:01:32,673 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2022-04-28 14:01:32,674 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 30 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 14:01:32,674 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 115 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 14:01:32,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2022-04-28 14:01:32,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 85. [2022-04-28 14:01:32,769 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:01:32,769 INFO L82 GeneralOperation]: Start isEquivalent. First operand 90 states. Second operand has 85 states, 62 states have (on average 1.3064516129032258) internal successors, (81), 66 states have internal predecessors, (81), 14 states have call successors, (14), 9 states have call predecessors, (14), 8 states have return successors, (11), 9 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-28 14:01:32,770 INFO L74 IsIncluded]: Start isIncluded. First operand 90 states. Second operand has 85 states, 62 states have (on average 1.3064516129032258) internal successors, (81), 66 states have internal predecessors, (81), 14 states have call successors, (14), 9 states have call predecessors, (14), 8 states have return successors, (11), 9 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-28 14:01:32,770 INFO L87 Difference]: Start difference. First operand 90 states. Second operand has 85 states, 62 states have (on average 1.3064516129032258) internal successors, (81), 66 states have internal predecessors, (81), 14 states have call successors, (14), 9 states have call predecessors, (14), 8 states have return successors, (11), 9 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-28 14:01:32,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:01:32,772 INFO L93 Difference]: Finished difference Result 90 states and 114 transitions. [2022-04-28 14:01:32,772 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 114 transitions. [2022-04-28 14:01:32,773 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:01:32,773 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:01:32,773 INFO L74 IsIncluded]: Start isIncluded. First operand has 85 states, 62 states have (on average 1.3064516129032258) internal successors, (81), 66 states have internal predecessors, (81), 14 states have call successors, (14), 9 states have call predecessors, (14), 8 states have return successors, (11), 9 states have call predecessors, (11), 11 states have call successors, (11) Second operand 90 states. [2022-04-28 14:01:32,773 INFO L87 Difference]: Start difference. First operand has 85 states, 62 states have (on average 1.3064516129032258) internal successors, (81), 66 states have internal predecessors, (81), 14 states have call successors, (14), 9 states have call predecessors, (14), 8 states have return successors, (11), 9 states have call predecessors, (11), 11 states have call successors, (11) Second operand 90 states. [2022-04-28 14:01:32,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:01:32,775 INFO L93 Difference]: Finished difference Result 90 states and 114 transitions. [2022-04-28 14:01:32,775 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 114 transitions. [2022-04-28 14:01:32,776 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:01:32,776 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:01:32,776 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:01:32,776 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:01:32,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 62 states have (on average 1.3064516129032258) internal successors, (81), 66 states have internal predecessors, (81), 14 states have call successors, (14), 9 states have call predecessors, (14), 8 states have return successors, (11), 9 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-28 14:01:32,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 106 transitions. [2022-04-28 14:01:32,778 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 106 transitions. Word has length 33 [2022-04-28 14:01:32,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:01:32,778 INFO L495 AbstractCegarLoop]: Abstraction has 85 states and 106 transitions. [2022-04-28 14:01:32,778 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 4 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-28 14:01:32,778 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 85 states and 106 transitions. [2022-04-28 14:01:35,067 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 106 edges. 105 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 14:01:35,068 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 106 transitions. [2022-04-28 14:01:35,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-04-28 14:01:35,068 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:01:35,068 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-04-28 14:01:35,085 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 14:01:35,269 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,SelfDestructingSolverStorable10 [2022-04-28 14:01:35,269 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:01:35,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:01:35,269 INFO L85 PathProgramCache]: Analyzing trace with hash 368374993, now seen corresponding path program 1 times [2022-04-28 14:01:35,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:01:35,269 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1144043654] [2022-04-28 14:01:41,338 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 14:01:41,338 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 14:01:41,338 INFO L85 PathProgramCache]: Analyzing trace with hash 368374993, now seen corresponding path program 2 times [2022-04-28 14:01:41,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:01:41,338 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [746556767] [2022-04-28 14:01:41,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:01:41,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:01:41,349 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 14:01:41,349 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1878091087] [2022-04-28 14:01:41,349 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 14:01:41,350 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 14:01:41,350 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 14:01:41,352 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 14:01:41,354 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-04-28 14:01:41,391 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 14:01:41,392 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 14:01:41,392 INFO L263 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-28 14:01:41,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:01:41,402 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 14:01:51,591 INFO L272 TraceCheckUtils]: 0: Hoare triple {5587#true} call ULTIMATE.init(); {5587#true} is VALID [2022-04-28 14:01:51,591 INFO L290 TraceCheckUtils]: 1: Hoare triple {5587#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(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {5587#true} is VALID [2022-04-28 14:01:51,591 INFO L290 TraceCheckUtils]: 2: Hoare triple {5587#true} assume true; {5587#true} is VALID [2022-04-28 14:01:51,591 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5587#true} {5587#true} #77#return; {5587#true} is VALID [2022-04-28 14:01:51,591 INFO L272 TraceCheckUtils]: 4: Hoare triple {5587#true} call #t~ret7 := main(); {5587#true} is VALID [2022-04-28 14:01:51,591 INFO L290 TraceCheckUtils]: 5: Hoare triple {5587#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {5587#true} is VALID [2022-04-28 14:01:51,591 INFO L272 TraceCheckUtils]: 6: Hoare triple {5587#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {5587#true} is VALID [2022-04-28 14:01:51,591 INFO L290 TraceCheckUtils]: 7: Hoare triple {5587#true} ~cond := #in~cond; {5587#true} is VALID [2022-04-28 14:01:51,591 INFO L290 TraceCheckUtils]: 8: Hoare triple {5587#true} assume !(0 == ~cond); {5587#true} is VALID [2022-04-28 14:01:51,591 INFO L290 TraceCheckUtils]: 9: Hoare triple {5587#true} assume true; {5587#true} is VALID [2022-04-28 14:01:51,592 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {5587#true} {5587#true} #69#return; {5587#true} is VALID [2022-04-28 14:01:51,592 INFO L290 TraceCheckUtils]: 11: Hoare triple {5587#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {5587#true} is VALID [2022-04-28 14:01:51,592 INFO L290 TraceCheckUtils]: 12: Hoare triple {5587#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {5587#true} is VALID [2022-04-28 14:01:51,592 INFO L290 TraceCheckUtils]: 13: Hoare triple {5587#true} assume !!(#t~post6 < 100);havoc #t~post6; {5587#true} is VALID [2022-04-28 14:01:51,592 INFO L272 TraceCheckUtils]: 14: Hoare triple {5587#true} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {5587#true} is VALID [2022-04-28 14:01:51,592 INFO L290 TraceCheckUtils]: 15: Hoare triple {5587#true} ~cond := #in~cond; {5587#true} is VALID [2022-04-28 14:01:51,592 INFO L290 TraceCheckUtils]: 16: Hoare triple {5587#true} assume !(0 == ~cond); {5587#true} is VALID [2022-04-28 14:01:51,592 INFO L290 TraceCheckUtils]: 17: Hoare triple {5587#true} assume true; {5587#true} is VALID [2022-04-28 14:01:51,592 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {5587#true} {5587#true} #71#return; {5587#true} is VALID [2022-04-28 14:01:51,594 INFO L290 TraceCheckUtils]: 19: Hoare triple {5587#true} assume !!(0 != ~a~0 && 0 != ~b~0); {5649#(not (= main_~a~0 0))} is VALID [2022-04-28 14:01:51,594 INFO L290 TraceCheckUtils]: 20: Hoare triple {5649#(not (= main_~a~0 0))} assume !(0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2)); {5649#(not (= main_~a~0 0))} is VALID [2022-04-28 14:01:51,594 INFO L290 TraceCheckUtils]: 21: Hoare triple {5649#(not (= main_~a~0 0))} assume !(1 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2)); {5649#(not (= main_~a~0 0))} is VALID [2022-04-28 14:01:51,595 INFO L290 TraceCheckUtils]: 22: Hoare triple {5649#(not (= main_~a~0 0))} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 1 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~b~0 := ~b~0 - 1;~q~0 := ~q~0 + ~a~0 * ~p~0; {5649#(not (= main_~a~0 0))} is VALID [2022-04-28 14:01:51,595 INFO L290 TraceCheckUtils]: 23: Hoare triple {5649#(not (= main_~a~0 0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {5649#(not (= main_~a~0 0))} is VALID [2022-04-28 14:01:51,595 INFO L290 TraceCheckUtils]: 24: Hoare triple {5649#(not (= main_~a~0 0))} assume !!(#t~post6 < 100);havoc #t~post6; {5649#(not (= main_~a~0 0))} is VALID [2022-04-28 14:01:51,595 INFO L272 TraceCheckUtils]: 25: Hoare triple {5649#(not (= main_~a~0 0))} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {5587#true} is VALID [2022-04-28 14:01:51,595 INFO L290 TraceCheckUtils]: 26: Hoare triple {5587#true} ~cond := #in~cond; {5671#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 14:01:51,596 INFO L290 TraceCheckUtils]: 27: Hoare triple {5671#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {5675#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 14:01:51,596 INFO L290 TraceCheckUtils]: 28: Hoare triple {5675#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {5675#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 14:01:53,598 WARN L284 TraceCheckUtils]: 29: Hoare quadruple {5675#(not (= |__VERIFIER_assert_#in~cond| 0))} {5649#(not (= main_~a~0 0))} #71#return; {5682#(and (or (and (= (mod (+ (* main_~y~0 main_~x~0) (* (- 1) main_~q~0)) (* main_~b~0 main_~a~0)) 0) (not (= main_~b~0 0))) (= (+ (* main_~y~0 main_~x~0) (* (- 1) main_~q~0)) 0)) (not (= main_~a~0 0)))} is UNKNOWN [2022-04-28 14:01:53,599 INFO L290 TraceCheckUtils]: 30: Hoare triple {5682#(and (or (and (= (mod (+ (* main_~y~0 main_~x~0) (* (- 1) main_~q~0)) (* main_~b~0 main_~a~0)) 0) (not (= main_~b~0 0))) (= (+ (* main_~y~0 main_~x~0) (* (- 1) main_~q~0)) 0)) (not (= main_~a~0 0)))} assume !(0 != ~a~0 && 0 != ~b~0); {5686#(= main_~q~0 (* main_~y~0 main_~x~0))} is VALID [2022-04-28 14:01:53,599 INFO L272 TraceCheckUtils]: 31: Hoare triple {5686#(= main_~q~0 (* main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~q~0 == ~x~0 * ~y~0 then 1 else 0)); {5690#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 14:01:53,600 INFO L290 TraceCheckUtils]: 32: Hoare triple {5690#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {5694#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 14:01:53,600 INFO L290 TraceCheckUtils]: 33: Hoare triple {5694#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {5588#false} is VALID [2022-04-28 14:01:53,600 INFO L290 TraceCheckUtils]: 34: Hoare triple {5588#false} assume !false; {5588#false} is VALID [2022-04-28 14:01:53,600 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-28 14:01:53,600 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 14:02:20,165 INFO L290 TraceCheckUtils]: 34: Hoare triple {5588#false} assume !false; {5588#false} is VALID [2022-04-28 14:02:20,166 INFO L290 TraceCheckUtils]: 33: Hoare triple {5694#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {5588#false} is VALID [2022-04-28 14:02:20,166 INFO L290 TraceCheckUtils]: 32: Hoare triple {5690#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {5694#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 14:02:20,167 INFO L272 TraceCheckUtils]: 31: Hoare triple {5686#(= main_~q~0 (* main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~q~0 == ~x~0 * ~y~0 then 1 else 0)); {5690#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 14:02:20,167 INFO L290 TraceCheckUtils]: 30: Hoare triple {5713#(or (= main_~q~0 (* main_~y~0 main_~x~0)) (and (not (= main_~b~0 0)) (not (= main_~a~0 0))))} assume !(0 != ~a~0 && 0 != ~b~0); {5686#(= main_~q~0 (* main_~y~0 main_~x~0))} is VALID [2022-04-28 14:02:20,170 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {5675#(not (= |__VERIFIER_assert_#in~cond| 0))} {5587#true} #71#return; {5713#(or (= main_~q~0 (* main_~y~0 main_~x~0)) (and (not (= main_~b~0 0)) (not (= main_~a~0 0))))} is VALID [2022-04-28 14:02:20,170 INFO L290 TraceCheckUtils]: 28: Hoare triple {5675#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {5675#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 14:02:20,170 INFO L290 TraceCheckUtils]: 27: Hoare triple {5726#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {5675#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 14:02:20,171 INFO L290 TraceCheckUtils]: 26: Hoare triple {5587#true} ~cond := #in~cond; {5726#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 14:02:20,171 INFO L272 TraceCheckUtils]: 25: Hoare triple {5587#true} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {5587#true} is VALID [2022-04-28 14:02:20,171 INFO L290 TraceCheckUtils]: 24: Hoare triple {5587#true} assume !!(#t~post6 < 100);havoc #t~post6; {5587#true} is VALID [2022-04-28 14:02:20,171 INFO L290 TraceCheckUtils]: 23: Hoare triple {5587#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {5587#true} is VALID [2022-04-28 14:02:20,171 INFO L290 TraceCheckUtils]: 22: Hoare triple {5587#true} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 1 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~b~0 := ~b~0 - 1;~q~0 := ~q~0 + ~a~0 * ~p~0; {5587#true} is VALID [2022-04-28 14:02:20,171 INFO L290 TraceCheckUtils]: 21: Hoare triple {5587#true} assume !(1 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2)); {5587#true} is VALID [2022-04-28 14:02:20,171 INFO L290 TraceCheckUtils]: 20: Hoare triple {5587#true} assume !(0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2)); {5587#true} is VALID [2022-04-28 14:02:20,172 INFO L290 TraceCheckUtils]: 19: Hoare triple {5587#true} assume !!(0 != ~a~0 && 0 != ~b~0); {5587#true} is VALID [2022-04-28 14:02:20,172 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {5587#true} {5587#true} #71#return; {5587#true} is VALID [2022-04-28 14:02:20,172 INFO L290 TraceCheckUtils]: 17: Hoare triple {5587#true} assume true; {5587#true} is VALID [2022-04-28 14:02:20,172 INFO L290 TraceCheckUtils]: 16: Hoare triple {5587#true} assume !(0 == ~cond); {5587#true} is VALID [2022-04-28 14:02:20,172 INFO L290 TraceCheckUtils]: 15: Hoare triple {5587#true} ~cond := #in~cond; {5587#true} is VALID [2022-04-28 14:02:20,172 INFO L272 TraceCheckUtils]: 14: Hoare triple {5587#true} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {5587#true} is VALID [2022-04-28 14:02:20,172 INFO L290 TraceCheckUtils]: 13: Hoare triple {5587#true} assume !!(#t~post6 < 100);havoc #t~post6; {5587#true} is VALID [2022-04-28 14:02:20,172 INFO L290 TraceCheckUtils]: 12: Hoare triple {5587#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {5587#true} is VALID [2022-04-28 14:02:20,172 INFO L290 TraceCheckUtils]: 11: Hoare triple {5587#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {5587#true} is VALID [2022-04-28 14:02:20,172 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {5587#true} {5587#true} #69#return; {5587#true} is VALID [2022-04-28 14:02:20,173 INFO L290 TraceCheckUtils]: 9: Hoare triple {5587#true} assume true; {5587#true} is VALID [2022-04-28 14:02:20,173 INFO L290 TraceCheckUtils]: 8: Hoare triple {5587#true} assume !(0 == ~cond); {5587#true} is VALID [2022-04-28 14:02:20,173 INFO L290 TraceCheckUtils]: 7: Hoare triple {5587#true} ~cond := #in~cond; {5587#true} is VALID [2022-04-28 14:02:20,173 INFO L272 TraceCheckUtils]: 6: Hoare triple {5587#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {5587#true} is VALID [2022-04-28 14:02:20,173 INFO L290 TraceCheckUtils]: 5: Hoare triple {5587#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {5587#true} is VALID [2022-04-28 14:02:20,173 INFO L272 TraceCheckUtils]: 4: Hoare triple {5587#true} call #t~ret7 := main(); {5587#true} is VALID [2022-04-28 14:02:20,173 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5587#true} {5587#true} #77#return; {5587#true} is VALID [2022-04-28 14:02:20,173 INFO L290 TraceCheckUtils]: 2: Hoare triple {5587#true} assume true; {5587#true} is VALID [2022-04-28 14:02:20,173 INFO L290 TraceCheckUtils]: 1: Hoare triple {5587#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(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {5587#true} is VALID [2022-04-28 14:02:20,173 INFO L272 TraceCheckUtils]: 0: Hoare triple {5587#true} call ULTIMATE.init(); {5587#true} is VALID [2022-04-28 14:02:20,174 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 14:02:20,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:02:20,174 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [746556767] [2022-04-28 14:02:20,174 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 14:02:20,174 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1878091087] [2022-04-28 14:02:20,174 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1878091087] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 14:02:20,174 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 14:02:20,174 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 11 [2022-04-28 14:02:20,174 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:02:20,174 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1144043654] [2022-04-28 14:02:20,175 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1144043654] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:02:20,175 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:02:20,175 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-28 14:02:20,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [800801673] [2022-04-28 14:02:20,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:02:20,175 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.125) internal successors, (25), 7 states have internal predecessors, (25), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 35 [2022-04-28 14:02:20,175 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:02:20,176 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 8 states have (on average 3.125) internal successors, (25), 7 states have internal predecessors, (25), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-28 14:02:22,202 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 34 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 14:02:22,202 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-28 14:02:22,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:02:22,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-28 14:02:22,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2022-04-28 14:02:22,202 INFO L87 Difference]: Start difference. First operand 85 states and 106 transitions. Second operand has 9 states, 8 states have (on average 3.125) internal successors, (25), 7 states have internal predecessors, (25), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-28 14:02:25,192 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-28 14:02:25,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:02:25,597 INFO L93 Difference]: Finished difference Result 103 states and 133 transitions. [2022-04-28 14:02:25,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-28 14:02:25,598 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.125) internal successors, (25), 7 states have internal predecessors, (25), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 35 [2022-04-28 14:02:25,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:02:25,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 3.125) internal successors, (25), 7 states have internal predecessors, (25), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-28 14:02:25,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 56 transitions. [2022-04-28 14:02:25,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 3.125) internal successors, (25), 7 states have internal predecessors, (25), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-28 14:02:25,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 56 transitions. [2022-04-28 14:02:25,600 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 56 transitions. [2022-04-28 14:02:27,654 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 55 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 14:02:27,655 INFO L225 Difference]: With dead ends: 103 [2022-04-28 14:02:27,655 INFO L226 Difference]: Without dead ends: 101 [2022-04-28 14:02:27,656 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 59 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2022-04-28 14:02:27,656 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 16 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 8 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2022-04-28 14:02:27,656 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 125 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 147 Invalid, 1 Unknown, 0 Unchecked, 2.8s Time] [2022-04-28 14:02:27,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2022-04-28 14:02:27,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 94. [2022-04-28 14:02:27,746 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:02:27,747 INFO L82 GeneralOperation]: Start isEquivalent. First operand 101 states. Second operand has 94 states, 68 states have (on average 1.3088235294117647) internal successors, (89), 73 states have internal predecessors, (89), 16 states have call successors, (16), 10 states have call predecessors, (16), 9 states have return successors, (13), 10 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-28 14:02:27,747 INFO L74 IsIncluded]: Start isIncluded. First operand 101 states. Second operand has 94 states, 68 states have (on average 1.3088235294117647) internal successors, (89), 73 states have internal predecessors, (89), 16 states have call successors, (16), 10 states have call predecessors, (16), 9 states have return successors, (13), 10 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-28 14:02:27,747 INFO L87 Difference]: Start difference. First operand 101 states. Second operand has 94 states, 68 states have (on average 1.3088235294117647) internal successors, (89), 73 states have internal predecessors, (89), 16 states have call successors, (16), 10 states have call predecessors, (16), 9 states have return successors, (13), 10 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-28 14:02:27,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:02:27,749 INFO L93 Difference]: Finished difference Result 101 states and 131 transitions. [2022-04-28 14:02:27,749 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 131 transitions. [2022-04-28 14:02:27,750 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:02:27,750 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:02:27,750 INFO L74 IsIncluded]: Start isIncluded. First operand has 94 states, 68 states have (on average 1.3088235294117647) internal successors, (89), 73 states have internal predecessors, (89), 16 states have call successors, (16), 10 states have call predecessors, (16), 9 states have return successors, (13), 10 states have call predecessors, (13), 13 states have call successors, (13) Second operand 101 states. [2022-04-28 14:02:27,750 INFO L87 Difference]: Start difference. First operand has 94 states, 68 states have (on average 1.3088235294117647) internal successors, (89), 73 states have internal predecessors, (89), 16 states have call successors, (16), 10 states have call predecessors, (16), 9 states have return successors, (13), 10 states have call predecessors, (13), 13 states have call successors, (13) Second operand 101 states. [2022-04-28 14:02:27,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:02:27,753 INFO L93 Difference]: Finished difference Result 101 states and 131 transitions. [2022-04-28 14:02:27,753 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 131 transitions. [2022-04-28 14:02:27,753 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:02:27,753 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:02:27,753 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:02:27,753 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:02:27,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 68 states have (on average 1.3088235294117647) internal successors, (89), 73 states have internal predecessors, (89), 16 states have call successors, (16), 10 states have call predecessors, (16), 9 states have return successors, (13), 10 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-28 14:02:27,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 118 transitions. [2022-04-28 14:02:27,755 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 118 transitions. Word has length 35 [2022-04-28 14:02:27,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:02:27,756 INFO L495 AbstractCegarLoop]: Abstraction has 94 states and 118 transitions. [2022-04-28 14:02:27,756 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.125) internal successors, (25), 7 states have internal predecessors, (25), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-28 14:02:27,756 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 94 states and 118 transitions. [2022-04-28 14:02:34,080 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 118 edges. 115 inductive. 0 not inductive. 3 times theorem prover too weak to decide inductivity. [2022-04-28 14:02:34,080 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 118 transitions. [2022-04-28 14:02:34,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-04-28 14:02:34,080 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:02:34,081 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-04-28 14:02:34,097 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-04-28 14:02:34,285 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-04-28 14:02:34,285 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:02:34,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:02:34,286 INFO L85 PathProgramCache]: Analyzing trace with hash -218431021, now seen corresponding path program 1 times [2022-04-28 14:02:34,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:02:34,286 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1666263485] [2022-04-28 14:02:38,472 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 14:02:38,473 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 14:02:38,473 INFO L85 PathProgramCache]: Analyzing trace with hash -218431021, now seen corresponding path program 2 times [2022-04-28 14:02:38,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:02:38,473 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [508295304] [2022-04-28 14:02:38,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:02:38,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:02:38,482 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 14:02:38,482 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1643011123] [2022-04-28 14:02:38,482 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 14:02:38,483 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 14:02:38,483 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 14:02:38,489 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 14:02:38,490 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-04-28 14:02:38,527 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 14:02:38,527 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 14:02:38,528 INFO L263 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-28 14:02:38,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:02:38,536 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 14:02:48,702 INFO L272 TraceCheckUtils]: 0: Hoare triple {6409#true} call ULTIMATE.init(); {6409#true} is VALID [2022-04-28 14:02:48,703 INFO L290 TraceCheckUtils]: 1: Hoare triple {6409#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(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {6409#true} is VALID [2022-04-28 14:02:48,703 INFO L290 TraceCheckUtils]: 2: Hoare triple {6409#true} assume true; {6409#true} is VALID [2022-04-28 14:02:48,703 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6409#true} {6409#true} #77#return; {6409#true} is VALID [2022-04-28 14:02:48,703 INFO L272 TraceCheckUtils]: 4: Hoare triple {6409#true} call #t~ret7 := main(); {6409#true} is VALID [2022-04-28 14:02:48,703 INFO L290 TraceCheckUtils]: 5: Hoare triple {6409#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {6409#true} is VALID [2022-04-28 14:02:48,703 INFO L272 TraceCheckUtils]: 6: Hoare triple {6409#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {6409#true} is VALID [2022-04-28 14:02:48,703 INFO L290 TraceCheckUtils]: 7: Hoare triple {6409#true} ~cond := #in~cond; {6409#true} is VALID [2022-04-28 14:02:48,703 INFO L290 TraceCheckUtils]: 8: Hoare triple {6409#true} assume !(0 == ~cond); {6409#true} is VALID [2022-04-28 14:02:48,703 INFO L290 TraceCheckUtils]: 9: Hoare triple {6409#true} assume true; {6409#true} is VALID [2022-04-28 14:02:48,703 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {6409#true} {6409#true} #69#return; {6409#true} is VALID [2022-04-28 14:02:48,703 INFO L290 TraceCheckUtils]: 11: Hoare triple {6409#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {6409#true} is VALID [2022-04-28 14:02:48,703 INFO L290 TraceCheckUtils]: 12: Hoare triple {6409#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {6409#true} is VALID [2022-04-28 14:02:48,703 INFO L290 TraceCheckUtils]: 13: Hoare triple {6409#true} assume !!(#t~post6 < 100);havoc #t~post6; {6409#true} is VALID [2022-04-28 14:02:48,704 INFO L272 TraceCheckUtils]: 14: Hoare triple {6409#true} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {6409#true} is VALID [2022-04-28 14:02:48,704 INFO L290 TraceCheckUtils]: 15: Hoare triple {6409#true} ~cond := #in~cond; {6409#true} is VALID [2022-04-28 14:02:48,704 INFO L290 TraceCheckUtils]: 16: Hoare triple {6409#true} assume !(0 == ~cond); {6409#true} is VALID [2022-04-28 14:02:48,704 INFO L290 TraceCheckUtils]: 17: Hoare triple {6409#true} assume true; {6409#true} is VALID [2022-04-28 14:02:48,704 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {6409#true} {6409#true} #71#return; {6409#true} is VALID [2022-04-28 14:02:48,704 INFO L290 TraceCheckUtils]: 19: Hoare triple {6409#true} assume !!(0 != ~a~0 && 0 != ~b~0); {6409#true} is VALID [2022-04-28 14:02:48,704 INFO L290 TraceCheckUtils]: 20: Hoare triple {6409#true} assume !(0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2)); {6409#true} is VALID [2022-04-28 14:02:48,704 INFO L290 TraceCheckUtils]: 21: Hoare triple {6409#true} assume !(1 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2)); {6409#true} is VALID [2022-04-28 14:02:48,704 INFO L290 TraceCheckUtils]: 22: Hoare triple {6409#true} assume !(0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 1 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2));~a~0 := ~a~0 - 1;~b~0 := ~b~0 - 1;~q~0 := ~q~0 + (1 + (~a~0 + ~b~0)) * ~p~0; {6409#true} is VALID [2022-04-28 14:02:48,704 INFO L290 TraceCheckUtils]: 23: Hoare triple {6409#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {6409#true} is VALID [2022-04-28 14:02:48,704 INFO L290 TraceCheckUtils]: 24: Hoare triple {6409#true} assume !!(#t~post6 < 100);havoc #t~post6; {6409#true} is VALID [2022-04-28 14:02:48,704 INFO L272 TraceCheckUtils]: 25: Hoare triple {6409#true} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {6409#true} is VALID [2022-04-28 14:02:48,704 INFO L290 TraceCheckUtils]: 26: Hoare triple {6409#true} ~cond := #in~cond; {6492#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 14:02:48,705 INFO L290 TraceCheckUtils]: 27: Hoare triple {6492#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {6496#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 14:02:48,705 INFO L290 TraceCheckUtils]: 28: Hoare triple {6496#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {6496#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 14:02:50,708 WARN L284 TraceCheckUtils]: 29: Hoare quadruple {6496#(not (= |__VERIFIER_assert_#in~cond| 0))} {6409#true} #71#return; {6503#(or (= main_~q~0 (* main_~y~0 main_~x~0)) (and (= (mod (+ (* main_~y~0 main_~x~0) (* (- 1) main_~q~0)) (* main_~b~0 main_~a~0)) 0) (not (= main_~b~0 0)) (not (= main_~a~0 0))))} is UNKNOWN [2022-04-28 14:02:50,709 INFO L290 TraceCheckUtils]: 30: Hoare triple {6503#(or (= main_~q~0 (* main_~y~0 main_~x~0)) (and (= (mod (+ (* main_~y~0 main_~x~0) (* (- 1) main_~q~0)) (* main_~b~0 main_~a~0)) 0) (not (= main_~b~0 0)) (not (= main_~a~0 0))))} assume !(0 != ~a~0 && 0 != ~b~0); {6507#(= main_~q~0 (* main_~y~0 main_~x~0))} is VALID [2022-04-28 14:02:50,710 INFO L272 TraceCheckUtils]: 31: Hoare triple {6507#(= main_~q~0 (* main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~q~0 == ~x~0 * ~y~0 then 1 else 0)); {6511#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 14:02:50,710 INFO L290 TraceCheckUtils]: 32: Hoare triple {6511#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {6515#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 14:02:50,711 INFO L290 TraceCheckUtils]: 33: Hoare triple {6515#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {6410#false} is VALID [2022-04-28 14:02:50,711 INFO L290 TraceCheckUtils]: 34: Hoare triple {6410#false} assume !false; {6410#false} is VALID [2022-04-28 14:02:50,711 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 14:02:50,711 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 14:03:27,720 INFO L290 TraceCheckUtils]: 34: Hoare triple {6410#false} assume !false; {6410#false} is VALID [2022-04-28 14:03:27,720 INFO L290 TraceCheckUtils]: 33: Hoare triple {6515#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {6410#false} is VALID [2022-04-28 14:03:27,721 INFO L290 TraceCheckUtils]: 32: Hoare triple {6511#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {6515#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 14:03:27,721 INFO L272 TraceCheckUtils]: 31: Hoare triple {6507#(= main_~q~0 (* main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~q~0 == ~x~0 * ~y~0 then 1 else 0)); {6511#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 14:03:27,722 INFO L290 TraceCheckUtils]: 30: Hoare triple {6534#(or (= main_~q~0 (* main_~y~0 main_~x~0)) (and (not (= main_~b~0 0)) (not (= main_~a~0 0))))} assume !(0 != ~a~0 && 0 != ~b~0); {6507#(= main_~q~0 (* main_~y~0 main_~x~0))} is VALID [2022-04-28 14:03:27,723 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {6496#(not (= |__VERIFIER_assert_#in~cond| 0))} {6409#true} #71#return; {6534#(or (= main_~q~0 (* main_~y~0 main_~x~0)) (and (not (= main_~b~0 0)) (not (= main_~a~0 0))))} is VALID [2022-04-28 14:03:27,724 INFO L290 TraceCheckUtils]: 28: Hoare triple {6496#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {6496#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 14:03:27,724 INFO L290 TraceCheckUtils]: 27: Hoare triple {6547#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {6496#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 14:03:27,724 INFO L290 TraceCheckUtils]: 26: Hoare triple {6409#true} ~cond := #in~cond; {6547#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 14:03:27,724 INFO L272 TraceCheckUtils]: 25: Hoare triple {6409#true} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {6409#true} is VALID [2022-04-28 14:03:27,724 INFO L290 TraceCheckUtils]: 24: Hoare triple {6409#true} assume !!(#t~post6 < 100);havoc #t~post6; {6409#true} is VALID [2022-04-28 14:03:27,724 INFO L290 TraceCheckUtils]: 23: Hoare triple {6409#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {6409#true} is VALID [2022-04-28 14:03:27,724 INFO L290 TraceCheckUtils]: 22: Hoare triple {6409#true} assume !(0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 1 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2));~a~0 := ~a~0 - 1;~b~0 := ~b~0 - 1;~q~0 := ~q~0 + (1 + (~a~0 + ~b~0)) * ~p~0; {6409#true} is VALID [2022-04-28 14:03:27,724 INFO L290 TraceCheckUtils]: 21: Hoare triple {6409#true} assume !(1 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2)); {6409#true} is VALID [2022-04-28 14:03:27,725 INFO L290 TraceCheckUtils]: 20: Hoare triple {6409#true} assume !(0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2)); {6409#true} is VALID [2022-04-28 14:03:27,725 INFO L290 TraceCheckUtils]: 19: Hoare triple {6409#true} assume !!(0 != ~a~0 && 0 != ~b~0); {6409#true} is VALID [2022-04-28 14:03:27,725 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {6409#true} {6409#true} #71#return; {6409#true} is VALID [2022-04-28 14:03:27,725 INFO L290 TraceCheckUtils]: 17: Hoare triple {6409#true} assume true; {6409#true} is VALID [2022-04-28 14:03:27,725 INFO L290 TraceCheckUtils]: 16: Hoare triple {6409#true} assume !(0 == ~cond); {6409#true} is VALID [2022-04-28 14:03:27,725 INFO L290 TraceCheckUtils]: 15: Hoare triple {6409#true} ~cond := #in~cond; {6409#true} is VALID [2022-04-28 14:03:27,725 INFO L272 TraceCheckUtils]: 14: Hoare triple {6409#true} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {6409#true} is VALID [2022-04-28 14:03:27,725 INFO L290 TraceCheckUtils]: 13: Hoare triple {6409#true} assume !!(#t~post6 < 100);havoc #t~post6; {6409#true} is VALID [2022-04-28 14:03:27,725 INFO L290 TraceCheckUtils]: 12: Hoare triple {6409#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {6409#true} is VALID [2022-04-28 14:03:27,725 INFO L290 TraceCheckUtils]: 11: Hoare triple {6409#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {6409#true} is VALID [2022-04-28 14:03:27,725 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {6409#true} {6409#true} #69#return; {6409#true} is VALID [2022-04-28 14:03:27,725 INFO L290 TraceCheckUtils]: 9: Hoare triple {6409#true} assume true; {6409#true} is VALID [2022-04-28 14:03:27,725 INFO L290 TraceCheckUtils]: 8: Hoare triple {6409#true} assume !(0 == ~cond); {6409#true} is VALID [2022-04-28 14:03:27,725 INFO L290 TraceCheckUtils]: 7: Hoare triple {6409#true} ~cond := #in~cond; {6409#true} is VALID [2022-04-28 14:03:27,725 INFO L272 TraceCheckUtils]: 6: Hoare triple {6409#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {6409#true} is VALID [2022-04-28 14:03:27,725 INFO L290 TraceCheckUtils]: 5: Hoare triple {6409#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {6409#true} is VALID [2022-04-28 14:03:27,726 INFO L272 TraceCheckUtils]: 4: Hoare triple {6409#true} call #t~ret7 := main(); {6409#true} is VALID [2022-04-28 14:03:27,726 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6409#true} {6409#true} #77#return; {6409#true} is VALID [2022-04-28 14:03:27,726 INFO L290 TraceCheckUtils]: 2: Hoare triple {6409#true} assume true; {6409#true} is VALID [2022-04-28 14:03:27,726 INFO L290 TraceCheckUtils]: 1: Hoare triple {6409#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(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {6409#true} is VALID [2022-04-28 14:03:27,726 INFO L272 TraceCheckUtils]: 0: Hoare triple {6409#true} call ULTIMATE.init(); {6409#true} is VALID [2022-04-28 14:03:27,726 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 14:03:27,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:03:27,726 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [508295304] [2022-04-28 14:03:27,726 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 14:03:27,727 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1643011123] [2022-04-28 14:03:27,727 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1643011123] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 14:03:27,727 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 14:03:27,727 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2022-04-28 14:03:27,727 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:03:27,727 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1666263485] [2022-04-28 14:03:27,727 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1666263485] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:03:27,727 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:03:27,727 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 14:03:27,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [77405049] [2022-04-28 14:03:27,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:03:27,728 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 6 states have internal predecessors, (23), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 35 [2022-04-28 14:03:27,728 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:03:27,728 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 6 states have internal predecessors, (23), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-28 14:03:29,755 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 31 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 14:03:29,756 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-28 14:03:29,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:03:29,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-28 14:03:29,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-04-28 14:03:29,757 INFO L87 Difference]: Start difference. First operand 94 states and 118 transitions. Second operand has 8 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 6 states have internal predecessors, (23), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-28 14:03:32,230 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-28 14:03:35,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:03:35,549 INFO L93 Difference]: Finished difference Result 101 states and 125 transitions. [2022-04-28 14:03:35,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-28 14:03:35,549 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 6 states have internal predecessors, (23), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 35 [2022-04-28 14:03:35,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:03:35,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 6 states have internal predecessors, (23), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-28 14:03:35,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 44 transitions. [2022-04-28 14:03:35,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 6 states have internal predecessors, (23), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-28 14:03:35,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 44 transitions. [2022-04-28 14:03:35,551 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 44 transitions. [2022-04-28 14:03:37,588 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 43 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 14:03:37,590 INFO L225 Difference]: With dead ends: 101 [2022-04-28 14:03:37,590 INFO L226 Difference]: Without dead ends: 98 [2022-04-28 14:03:37,590 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 60 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2022-04-28 14:03:37,591 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 15 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 3 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2022-04-28 14:03:37,591 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 121 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 113 Invalid, 1 Unknown, 0 Unchecked, 2.8s Time] [2022-04-28 14:03:37,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2022-04-28 14:03:37,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 72. [2022-04-28 14:03:37,676 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:03:37,676 INFO L82 GeneralOperation]: Start isEquivalent. First operand 98 states. Second operand has 72 states, 52 states have (on average 1.2692307692307692) internal successors, (66), 55 states have internal predecessors, (66), 11 states have call successors, (11), 9 states have call predecessors, (11), 8 states have return successors, (9), 7 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-28 14:03:37,677 INFO L74 IsIncluded]: Start isIncluded. First operand 98 states. Second operand has 72 states, 52 states have (on average 1.2692307692307692) internal successors, (66), 55 states have internal predecessors, (66), 11 states have call successors, (11), 9 states have call predecessors, (11), 8 states have return successors, (9), 7 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-28 14:03:37,677 INFO L87 Difference]: Start difference. First operand 98 states. Second operand has 72 states, 52 states have (on average 1.2692307692307692) internal successors, (66), 55 states have internal predecessors, (66), 11 states have call successors, (11), 9 states have call predecessors, (11), 8 states have return successors, (9), 7 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-28 14:03:37,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:03:37,679 INFO L93 Difference]: Finished difference Result 98 states and 121 transitions. [2022-04-28 14:03:37,679 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 121 transitions. [2022-04-28 14:03:37,679 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:03:37,679 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:03:37,679 INFO L74 IsIncluded]: Start isIncluded. First operand has 72 states, 52 states have (on average 1.2692307692307692) internal successors, (66), 55 states have internal predecessors, (66), 11 states have call successors, (11), 9 states have call predecessors, (11), 8 states have return successors, (9), 7 states have call predecessors, (9), 9 states have call successors, (9) Second operand 98 states. [2022-04-28 14:03:37,680 INFO L87 Difference]: Start difference. First operand has 72 states, 52 states have (on average 1.2692307692307692) internal successors, (66), 55 states have internal predecessors, (66), 11 states have call successors, (11), 9 states have call predecessors, (11), 8 states have return successors, (9), 7 states have call predecessors, (9), 9 states have call successors, (9) Second operand 98 states. [2022-04-28 14:03:37,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:03:37,682 INFO L93 Difference]: Finished difference Result 98 states and 121 transitions. [2022-04-28 14:03:37,682 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 121 transitions. [2022-04-28 14:03:37,682 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:03:37,682 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:03:37,682 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:03:37,682 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:03:37,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 52 states have (on average 1.2692307692307692) internal successors, (66), 55 states have internal predecessors, (66), 11 states have call successors, (11), 9 states have call predecessors, (11), 8 states have return successors, (9), 7 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-28 14:03:37,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 86 transitions. [2022-04-28 14:03:37,684 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 86 transitions. Word has length 35 [2022-04-28 14:03:37,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:03:37,684 INFO L495 AbstractCegarLoop]: Abstraction has 72 states and 86 transitions. [2022-04-28 14:03:37,684 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 6 states have internal predecessors, (23), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-28 14:03:37,684 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 72 states and 86 transitions. [2022-04-28 14:03:42,000 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 86 edges. 84 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-28 14:03:42,000 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 86 transitions. [2022-04-28 14:03:42,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-04-28 14:03:42,001 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:03:42,001 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 14:03:42,016 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-04-28 14:03:42,201 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-04-28 14:03:42,201 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:03:42,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:03:42,202 INFO L85 PathProgramCache]: Analyzing trace with hash 604176890, now seen corresponding path program 3 times [2022-04-28 14:03:42,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:03:42,202 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [170467099] [2022-04-28 14:03:48,250 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 14:03:48,250 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 14:03:48,250 INFO L85 PathProgramCache]: Analyzing trace with hash 604176890, now seen corresponding path program 4 times [2022-04-28 14:03:48,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:03:48,251 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [55083955] [2022-04-28 14:03:48,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:03:48,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:03:48,260 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 14:03:48,260 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1838119286] [2022-04-28 14:03:48,260 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 14:03:48,260 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 14:03:48,260 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 14:03:48,272 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 14:03:48,276 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-04-28 14:03:48,318 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 14:03:48,319 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 14:03:48,319 INFO L263 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-28 14:03:48,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:03:48,328 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 14:03:48,471 INFO L272 TraceCheckUtils]: 0: Hoare triple {7174#true} call ULTIMATE.init(); {7174#true} is VALID [2022-04-28 14:03:48,472 INFO L290 TraceCheckUtils]: 1: Hoare triple {7174#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(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {7182#(<= ~counter~0 0)} is VALID [2022-04-28 14:03:48,472 INFO L290 TraceCheckUtils]: 2: Hoare triple {7182#(<= ~counter~0 0)} assume true; {7182#(<= ~counter~0 0)} is VALID [2022-04-28 14:03:48,472 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7182#(<= ~counter~0 0)} {7174#true} #77#return; {7182#(<= ~counter~0 0)} is VALID [2022-04-28 14:03:48,472 INFO L272 TraceCheckUtils]: 4: Hoare triple {7182#(<= ~counter~0 0)} call #t~ret7 := main(); {7182#(<= ~counter~0 0)} is VALID [2022-04-28 14:03:48,473 INFO L290 TraceCheckUtils]: 5: Hoare triple {7182#(<= ~counter~0 0)} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {7182#(<= ~counter~0 0)} is VALID [2022-04-28 14:03:48,473 INFO L272 TraceCheckUtils]: 6: Hoare triple {7182#(<= ~counter~0 0)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {7182#(<= ~counter~0 0)} is VALID [2022-04-28 14:03:48,473 INFO L290 TraceCheckUtils]: 7: Hoare triple {7182#(<= ~counter~0 0)} ~cond := #in~cond; {7182#(<= ~counter~0 0)} is VALID [2022-04-28 14:03:48,474 INFO L290 TraceCheckUtils]: 8: Hoare triple {7182#(<= ~counter~0 0)} assume !(0 == ~cond); {7182#(<= ~counter~0 0)} is VALID [2022-04-28 14:03:48,474 INFO L290 TraceCheckUtils]: 9: Hoare triple {7182#(<= ~counter~0 0)} assume true; {7182#(<= ~counter~0 0)} is VALID [2022-04-28 14:03:48,474 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {7182#(<= ~counter~0 0)} {7182#(<= ~counter~0 0)} #69#return; {7182#(<= ~counter~0 0)} is VALID [2022-04-28 14:03:48,474 INFO L290 TraceCheckUtils]: 11: Hoare triple {7182#(<= ~counter~0 0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {7182#(<= ~counter~0 0)} is VALID [2022-04-28 14:03:48,475 INFO L290 TraceCheckUtils]: 12: Hoare triple {7182#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {7216#(<= ~counter~0 1)} is VALID [2022-04-28 14:03:48,475 INFO L290 TraceCheckUtils]: 13: Hoare triple {7216#(<= ~counter~0 1)} assume !!(#t~post6 < 100);havoc #t~post6; {7216#(<= ~counter~0 1)} is VALID [2022-04-28 14:03:48,476 INFO L272 TraceCheckUtils]: 14: Hoare triple {7216#(<= ~counter~0 1)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {7216#(<= ~counter~0 1)} is VALID [2022-04-28 14:03:48,476 INFO L290 TraceCheckUtils]: 15: Hoare triple {7216#(<= ~counter~0 1)} ~cond := #in~cond; {7216#(<= ~counter~0 1)} is VALID [2022-04-28 14:03:48,476 INFO L290 TraceCheckUtils]: 16: Hoare triple {7216#(<= ~counter~0 1)} assume !(0 == ~cond); {7216#(<= ~counter~0 1)} is VALID [2022-04-28 14:03:48,477 INFO L290 TraceCheckUtils]: 17: Hoare triple {7216#(<= ~counter~0 1)} assume true; {7216#(<= ~counter~0 1)} is VALID [2022-04-28 14:03:48,477 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {7216#(<= ~counter~0 1)} {7216#(<= ~counter~0 1)} #71#return; {7216#(<= ~counter~0 1)} is VALID [2022-04-28 14:03:48,477 INFO L290 TraceCheckUtils]: 19: Hoare triple {7216#(<= ~counter~0 1)} assume !!(0 != ~a~0 && 0 != ~b~0); {7216#(<= ~counter~0 1)} is VALID [2022-04-28 14:03:48,478 INFO L290 TraceCheckUtils]: 20: Hoare triple {7216#(<= ~counter~0 1)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {7216#(<= ~counter~0 1)} is VALID [2022-04-28 14:03:48,478 INFO L290 TraceCheckUtils]: 21: Hoare triple {7216#(<= ~counter~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {7244#(<= ~counter~0 2)} is VALID [2022-04-28 14:03:48,478 INFO L290 TraceCheckUtils]: 22: Hoare triple {7244#(<= ~counter~0 2)} assume !!(#t~post6 < 100);havoc #t~post6; {7244#(<= ~counter~0 2)} is VALID [2022-04-28 14:03:48,479 INFO L272 TraceCheckUtils]: 23: Hoare triple {7244#(<= ~counter~0 2)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {7244#(<= ~counter~0 2)} is VALID [2022-04-28 14:03:48,479 INFO L290 TraceCheckUtils]: 24: Hoare triple {7244#(<= ~counter~0 2)} ~cond := #in~cond; {7244#(<= ~counter~0 2)} is VALID [2022-04-28 14:03:48,479 INFO L290 TraceCheckUtils]: 25: Hoare triple {7244#(<= ~counter~0 2)} assume !(0 == ~cond); {7244#(<= ~counter~0 2)} is VALID [2022-04-28 14:03:48,480 INFO L290 TraceCheckUtils]: 26: Hoare triple {7244#(<= ~counter~0 2)} assume true; {7244#(<= ~counter~0 2)} is VALID [2022-04-28 14:03:48,480 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {7244#(<= ~counter~0 2)} {7244#(<= ~counter~0 2)} #71#return; {7244#(<= ~counter~0 2)} is VALID [2022-04-28 14:03:48,480 INFO L290 TraceCheckUtils]: 28: Hoare triple {7244#(<= ~counter~0 2)} assume !!(0 != ~a~0 && 0 != ~b~0); {7244#(<= ~counter~0 2)} is VALID [2022-04-28 14:03:48,481 INFO L290 TraceCheckUtils]: 29: Hoare triple {7244#(<= ~counter~0 2)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {7244#(<= ~counter~0 2)} is VALID [2022-04-28 14:03:48,481 INFO L290 TraceCheckUtils]: 30: Hoare triple {7244#(<= ~counter~0 2)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {7272#(<= |main_#t~post6| 2)} is VALID [2022-04-28 14:03:48,481 INFO L290 TraceCheckUtils]: 31: Hoare triple {7272#(<= |main_#t~post6| 2)} assume !(#t~post6 < 100);havoc #t~post6; {7175#false} is VALID [2022-04-28 14:03:48,481 INFO L272 TraceCheckUtils]: 32: Hoare triple {7175#false} call __VERIFIER_assert((if ~q~0 == ~x~0 * ~y~0 then 1 else 0)); {7175#false} is VALID [2022-04-28 14:03:48,481 INFO L290 TraceCheckUtils]: 33: Hoare triple {7175#false} ~cond := #in~cond; {7175#false} is VALID [2022-04-28 14:03:48,482 INFO L290 TraceCheckUtils]: 34: Hoare triple {7175#false} assume 0 == ~cond; {7175#false} is VALID [2022-04-28 14:03:48,482 INFO L290 TraceCheckUtils]: 35: Hoare triple {7175#false} assume !false; {7175#false} is VALID [2022-04-28 14:03:48,482 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 14:03:48,482 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 14:03:48,650 INFO L290 TraceCheckUtils]: 35: Hoare triple {7175#false} assume !false; {7175#false} is VALID [2022-04-28 14:03:48,650 INFO L290 TraceCheckUtils]: 34: Hoare triple {7175#false} assume 0 == ~cond; {7175#false} is VALID [2022-04-28 14:03:48,650 INFO L290 TraceCheckUtils]: 33: Hoare triple {7175#false} ~cond := #in~cond; {7175#false} is VALID [2022-04-28 14:03:48,650 INFO L272 TraceCheckUtils]: 32: Hoare triple {7175#false} call __VERIFIER_assert((if ~q~0 == ~x~0 * ~y~0 then 1 else 0)); {7175#false} is VALID [2022-04-28 14:03:48,651 INFO L290 TraceCheckUtils]: 31: Hoare triple {7300#(< |main_#t~post6| 100)} assume !(#t~post6 < 100);havoc #t~post6; {7175#false} is VALID [2022-04-28 14:03:48,651 INFO L290 TraceCheckUtils]: 30: Hoare triple {7304#(< ~counter~0 100)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {7300#(< |main_#t~post6| 100)} is VALID [2022-04-28 14:03:48,651 INFO L290 TraceCheckUtils]: 29: Hoare triple {7304#(< ~counter~0 100)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {7304#(< ~counter~0 100)} is VALID [2022-04-28 14:03:48,652 INFO L290 TraceCheckUtils]: 28: Hoare triple {7304#(< ~counter~0 100)} assume !!(0 != ~a~0 && 0 != ~b~0); {7304#(< ~counter~0 100)} is VALID [2022-04-28 14:03:48,652 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {7174#true} {7304#(< ~counter~0 100)} #71#return; {7304#(< ~counter~0 100)} is VALID [2022-04-28 14:03:48,652 INFO L290 TraceCheckUtils]: 26: Hoare triple {7174#true} assume true; {7174#true} is VALID [2022-04-28 14:03:48,652 INFO L290 TraceCheckUtils]: 25: Hoare triple {7174#true} assume !(0 == ~cond); {7174#true} is VALID [2022-04-28 14:03:48,652 INFO L290 TraceCheckUtils]: 24: Hoare triple {7174#true} ~cond := #in~cond; {7174#true} is VALID [2022-04-28 14:03:48,652 INFO L272 TraceCheckUtils]: 23: Hoare triple {7304#(< ~counter~0 100)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {7174#true} is VALID [2022-04-28 14:03:48,653 INFO L290 TraceCheckUtils]: 22: Hoare triple {7304#(< ~counter~0 100)} assume !!(#t~post6 < 100);havoc #t~post6; {7304#(< ~counter~0 100)} is VALID [2022-04-28 14:03:48,653 INFO L290 TraceCheckUtils]: 21: Hoare triple {7332#(< ~counter~0 99)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {7304#(< ~counter~0 100)} is VALID [2022-04-28 14:03:48,653 INFO L290 TraceCheckUtils]: 20: Hoare triple {7332#(< ~counter~0 99)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {7332#(< ~counter~0 99)} is VALID [2022-04-28 14:03:48,654 INFO L290 TraceCheckUtils]: 19: Hoare triple {7332#(< ~counter~0 99)} assume !!(0 != ~a~0 && 0 != ~b~0); {7332#(< ~counter~0 99)} is VALID [2022-04-28 14:03:48,654 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {7174#true} {7332#(< ~counter~0 99)} #71#return; {7332#(< ~counter~0 99)} is VALID [2022-04-28 14:03:48,654 INFO L290 TraceCheckUtils]: 17: Hoare triple {7174#true} assume true; {7174#true} is VALID [2022-04-28 14:03:48,654 INFO L290 TraceCheckUtils]: 16: Hoare triple {7174#true} assume !(0 == ~cond); {7174#true} is VALID [2022-04-28 14:03:48,654 INFO L290 TraceCheckUtils]: 15: Hoare triple {7174#true} ~cond := #in~cond; {7174#true} is VALID [2022-04-28 14:03:48,655 INFO L272 TraceCheckUtils]: 14: Hoare triple {7332#(< ~counter~0 99)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {7174#true} is VALID [2022-04-28 14:03:48,655 INFO L290 TraceCheckUtils]: 13: Hoare triple {7332#(< ~counter~0 99)} assume !!(#t~post6 < 100);havoc #t~post6; {7332#(< ~counter~0 99)} is VALID [2022-04-28 14:03:48,655 INFO L290 TraceCheckUtils]: 12: Hoare triple {7360#(< ~counter~0 98)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {7332#(< ~counter~0 99)} is VALID [2022-04-28 14:03:48,655 INFO L290 TraceCheckUtils]: 11: Hoare triple {7360#(< ~counter~0 98)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {7360#(< ~counter~0 98)} is VALID [2022-04-28 14:03:48,656 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {7174#true} {7360#(< ~counter~0 98)} #69#return; {7360#(< ~counter~0 98)} is VALID [2022-04-28 14:03:48,656 INFO L290 TraceCheckUtils]: 9: Hoare triple {7174#true} assume true; {7174#true} is VALID [2022-04-28 14:03:48,656 INFO L290 TraceCheckUtils]: 8: Hoare triple {7174#true} assume !(0 == ~cond); {7174#true} is VALID [2022-04-28 14:03:48,656 INFO L290 TraceCheckUtils]: 7: Hoare triple {7174#true} ~cond := #in~cond; {7174#true} is VALID [2022-04-28 14:03:48,656 INFO L272 TraceCheckUtils]: 6: Hoare triple {7360#(< ~counter~0 98)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {7174#true} is VALID [2022-04-28 14:03:48,656 INFO L290 TraceCheckUtils]: 5: Hoare triple {7360#(< ~counter~0 98)} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {7360#(< ~counter~0 98)} is VALID [2022-04-28 14:03:48,657 INFO L272 TraceCheckUtils]: 4: Hoare triple {7360#(< ~counter~0 98)} call #t~ret7 := main(); {7360#(< ~counter~0 98)} is VALID [2022-04-28 14:03:48,657 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7360#(< ~counter~0 98)} {7174#true} #77#return; {7360#(< ~counter~0 98)} is VALID [2022-04-28 14:03:48,657 INFO L290 TraceCheckUtils]: 2: Hoare triple {7360#(< ~counter~0 98)} assume true; {7360#(< ~counter~0 98)} is VALID [2022-04-28 14:03:48,658 INFO L290 TraceCheckUtils]: 1: Hoare triple {7174#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(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {7360#(< ~counter~0 98)} is VALID [2022-04-28 14:03:48,658 INFO L272 TraceCheckUtils]: 0: Hoare triple {7174#true} call ULTIMATE.init(); {7174#true} is VALID [2022-04-28 14:03:48,658 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 14:03:48,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:03:48,658 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [55083955] [2022-04-28 14:03:48,658 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 14:03:48,658 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1838119286] [2022-04-28 14:03:48,658 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1838119286] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 14:03:48,658 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 14:03:48,658 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2022-04-28 14:03:48,658 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:03:48,659 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [170467099] [2022-04-28 14:03:48,659 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [170467099] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:03:48,659 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:03:48,659 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 14:03:48,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100294248] [2022-04-28 14:03:48,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:03:48,659 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 5 states have call successors, (6), 5 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Word has length 36 [2022-04-28 14:03:48,659 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:03:48,660 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 5 states have call successors, (6), 5 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-28 14:03:48,684 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:03:48,684 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 14:03:48,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:03:48,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 14:03:48,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-04-28 14:03:48,684 INFO L87 Difference]: Start difference. First operand 72 states and 86 transitions. Second operand has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 5 states have call successors, (6), 5 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-28 14:03:48,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:03:48,885 INFO L93 Difference]: Finished difference Result 108 states and 129 transitions. [2022-04-28 14:03:48,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-28 14:03:48,885 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 5 states have call successors, (6), 5 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Word has length 36 [2022-04-28 14:03:48,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:03:48,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 5 states have call successors, (6), 5 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-28 14:03:48,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 78 transitions. [2022-04-28 14:03:48,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 5 states have call successors, (6), 5 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-28 14:03:48,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 78 transitions. [2022-04-28 14:03:48,887 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 78 transitions. [2022-04-28 14:03:48,940 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 14:03:48,941 INFO L225 Difference]: With dead ends: 108 [2022-04-28 14:03:48,942 INFO L226 Difference]: Without dead ends: 98 [2022-04-28 14:03:48,953 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2022-04-28 14:03:48,954 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 22 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 14:03:48,954 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 114 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 14:03:48,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2022-04-28 14:03:49,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 96. [2022-04-28 14:03:49,068 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:03:49,068 INFO L82 GeneralOperation]: Start isEquivalent. First operand 98 states. Second operand has 96 states, 71 states have (on average 1.2816901408450705) internal successors, (91), 73 states have internal predecessors, (91), 14 states have call successors, (14), 12 states have call predecessors, (14), 10 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-28 14:03:49,068 INFO L74 IsIncluded]: Start isIncluded. First operand 98 states. Second operand has 96 states, 71 states have (on average 1.2816901408450705) internal successors, (91), 73 states have internal predecessors, (91), 14 states have call successors, (14), 12 states have call predecessors, (14), 10 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-28 14:03:49,068 INFO L87 Difference]: Start difference. First operand 98 states. Second operand has 96 states, 71 states have (on average 1.2816901408450705) internal successors, (91), 73 states have internal predecessors, (91), 14 states have call successors, (14), 12 states have call predecessors, (14), 10 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-28 14:03:49,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:03:49,070 INFO L93 Difference]: Finished difference Result 98 states and 117 transitions. [2022-04-28 14:03:49,070 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 117 transitions. [2022-04-28 14:03:49,070 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:03:49,070 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:03:49,070 INFO L74 IsIncluded]: Start isIncluded. First operand has 96 states, 71 states have (on average 1.2816901408450705) internal successors, (91), 73 states have internal predecessors, (91), 14 states have call successors, (14), 12 states have call predecessors, (14), 10 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) Second operand 98 states. [2022-04-28 14:03:49,071 INFO L87 Difference]: Start difference. First operand has 96 states, 71 states have (on average 1.2816901408450705) internal successors, (91), 73 states have internal predecessors, (91), 14 states have call successors, (14), 12 states have call predecessors, (14), 10 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) Second operand 98 states. [2022-04-28 14:03:49,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:03:49,072 INFO L93 Difference]: Finished difference Result 98 states and 117 transitions. [2022-04-28 14:03:49,072 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 117 transitions. [2022-04-28 14:03:49,072 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:03:49,072 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:03:49,072 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:03:49,072 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:03:49,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 71 states have (on average 1.2816901408450705) internal successors, (91), 73 states have internal predecessors, (91), 14 states have call successors, (14), 12 states have call predecessors, (14), 10 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-28 14:03:49,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 116 transitions. [2022-04-28 14:03:49,074 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 116 transitions. Word has length 36 [2022-04-28 14:03:49,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:03:49,075 INFO L495 AbstractCegarLoop]: Abstraction has 96 states and 116 transitions. [2022-04-28 14:03:49,075 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 5 states have call successors, (6), 5 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-28 14:03:49,075 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 96 states and 116 transitions. [2022-04-28 14:03:55,522 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 116 edges. 113 inductive. 0 not inductive. 3 times theorem prover too weak to decide inductivity. [2022-04-28 14:03:55,522 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 116 transitions. [2022-04-28 14:03:55,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-04-28 14:03:55,523 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:03:55,523 INFO L195 NwaCegarLoop]: trace histogram [4, 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] [2022-04-28 14:03:55,539 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-04-28 14:03:55,727 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-04-28 14:03:55,727 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:03:55,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:03:55,728 INFO L85 PathProgramCache]: Analyzing trace with hash 1524039145, now seen corresponding path program 1 times [2022-04-28 14:03:55,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:03:55,728 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1597088162] [2022-04-28 14:04:01,775 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 14:04:01,776 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 14:04:01,776 INFO L85 PathProgramCache]: Analyzing trace with hash 1524039145, now seen corresponding path program 2 times [2022-04-28 14:04:01,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:04:01,776 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029194116] [2022-04-28 14:04:01,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:04:01,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:04:01,787 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 14:04:01,787 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1135666048] [2022-04-28 14:04:01,787 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 14:04:01,788 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 14:04:01,788 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 14:04:01,796 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 14:04:01,797 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-04-28 14:04:01,830 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 14:04:01,830 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 14:04:01,831 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-28 14:04:01,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:04:01,838 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 14:04:01,957 INFO L272 TraceCheckUtils]: 0: Hoare triple {8007#true} call ULTIMATE.init(); {8007#true} is VALID [2022-04-28 14:04:01,957 INFO L290 TraceCheckUtils]: 1: Hoare triple {8007#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(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {8007#true} is VALID [2022-04-28 14:04:01,957 INFO L290 TraceCheckUtils]: 2: Hoare triple {8007#true} assume true; {8007#true} is VALID [2022-04-28 14:04:01,957 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8007#true} {8007#true} #77#return; {8007#true} is VALID [2022-04-28 14:04:01,957 INFO L272 TraceCheckUtils]: 4: Hoare triple {8007#true} call #t~ret7 := main(); {8007#true} is VALID [2022-04-28 14:04:01,957 INFO L290 TraceCheckUtils]: 5: Hoare triple {8007#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {8007#true} is VALID [2022-04-28 14:04:01,957 INFO L272 TraceCheckUtils]: 6: Hoare triple {8007#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {8007#true} is VALID [2022-04-28 14:04:01,957 INFO L290 TraceCheckUtils]: 7: Hoare triple {8007#true} ~cond := #in~cond; {8007#true} is VALID [2022-04-28 14:04:01,957 INFO L290 TraceCheckUtils]: 8: Hoare triple {8007#true} assume !(0 == ~cond); {8007#true} is VALID [2022-04-28 14:04:01,958 INFO L290 TraceCheckUtils]: 9: Hoare triple {8007#true} assume true; {8007#true} is VALID [2022-04-28 14:04:01,958 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {8007#true} {8007#true} #69#return; {8007#true} is VALID [2022-04-28 14:04:01,958 INFO L290 TraceCheckUtils]: 11: Hoare triple {8007#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {8007#true} is VALID [2022-04-28 14:04:01,958 INFO L290 TraceCheckUtils]: 12: Hoare triple {8007#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8007#true} is VALID [2022-04-28 14:04:01,958 INFO L290 TraceCheckUtils]: 13: Hoare triple {8007#true} assume !!(#t~post6 < 100);havoc #t~post6; {8007#true} is VALID [2022-04-28 14:04:01,958 INFO L272 TraceCheckUtils]: 14: Hoare triple {8007#true} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {8007#true} is VALID [2022-04-28 14:04:01,958 INFO L290 TraceCheckUtils]: 15: Hoare triple {8007#true} ~cond := #in~cond; {8007#true} is VALID [2022-04-28 14:04:01,958 INFO L290 TraceCheckUtils]: 16: Hoare triple {8007#true} assume !(0 == ~cond); {8007#true} is VALID [2022-04-28 14:04:01,958 INFO L290 TraceCheckUtils]: 17: Hoare triple {8007#true} assume true; {8007#true} is VALID [2022-04-28 14:04:01,958 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {8007#true} {8007#true} #71#return; {8007#true} is VALID [2022-04-28 14:04:01,959 INFO L290 TraceCheckUtils]: 19: Hoare triple {8007#true} assume !!(0 != ~a~0 && 0 != ~b~0); {8069#(not (= main_~a~0 0))} is VALID [2022-04-28 14:04:01,959 INFO L290 TraceCheckUtils]: 20: Hoare triple {8069#(not (= main_~a~0 0))} assume !(0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2)); {8069#(not (= main_~a~0 0))} is VALID [2022-04-28 14:04:01,959 INFO L290 TraceCheckUtils]: 21: Hoare triple {8069#(not (= main_~a~0 0))} assume !(1 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2)); {8069#(not (= main_~a~0 0))} is VALID [2022-04-28 14:04:01,960 INFO L290 TraceCheckUtils]: 22: Hoare triple {8069#(not (= main_~a~0 0))} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 1 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~b~0 := ~b~0 - 1;~q~0 := ~q~0 + ~a~0 * ~p~0; {8069#(not (= main_~a~0 0))} is VALID [2022-04-28 14:04:01,960 INFO L290 TraceCheckUtils]: 23: Hoare triple {8069#(not (= main_~a~0 0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8069#(not (= main_~a~0 0))} is VALID [2022-04-28 14:04:01,961 INFO L290 TraceCheckUtils]: 24: Hoare triple {8069#(not (= main_~a~0 0))} assume !!(#t~post6 < 100);havoc #t~post6; {8069#(not (= main_~a~0 0))} is VALID [2022-04-28 14:04:01,961 INFO L272 TraceCheckUtils]: 25: Hoare triple {8069#(not (= main_~a~0 0))} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {8007#true} is VALID [2022-04-28 14:04:01,961 INFO L290 TraceCheckUtils]: 26: Hoare triple {8007#true} ~cond := #in~cond; {8007#true} is VALID [2022-04-28 14:04:01,961 INFO L290 TraceCheckUtils]: 27: Hoare triple {8007#true} assume !(0 == ~cond); {8007#true} is VALID [2022-04-28 14:04:01,961 INFO L290 TraceCheckUtils]: 28: Hoare triple {8007#true} assume true; {8007#true} is VALID [2022-04-28 14:04:01,962 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {8007#true} {8069#(not (= main_~a~0 0))} #71#return; {8069#(not (= main_~a~0 0))} is VALID [2022-04-28 14:04:01,962 INFO L290 TraceCheckUtils]: 30: Hoare triple {8069#(not (= main_~a~0 0))} assume !(0 != ~a~0 && 0 != ~b~0); {8103#(and (= main_~b~0 0) (not (= main_~a~0 0)))} is VALID [2022-04-28 14:04:01,962 INFO L272 TraceCheckUtils]: 31: Hoare triple {8103#(and (= main_~b~0 0) (not (= main_~a~0 0)))} call __VERIFIER_assert((if ~q~0 == ~x~0 * ~y~0 then 1 else 0)); {8007#true} is VALID [2022-04-28 14:04:01,962 INFO L290 TraceCheckUtils]: 32: Hoare triple {8007#true} ~cond := #in~cond; {8007#true} is VALID [2022-04-28 14:04:01,962 INFO L290 TraceCheckUtils]: 33: Hoare triple {8007#true} assume !(0 == ~cond); {8007#true} is VALID [2022-04-28 14:04:01,963 INFO L290 TraceCheckUtils]: 34: Hoare triple {8007#true} assume true; {8007#true} is VALID [2022-04-28 14:04:01,963 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {8007#true} {8103#(and (= main_~b~0 0) (not (= main_~a~0 0)))} #73#return; {8103#(and (= main_~b~0 0) (not (= main_~a~0 0)))} is VALID [2022-04-28 14:04:01,964 INFO L272 TraceCheckUtils]: 36: Hoare triple {8103#(and (= main_~b~0 0) (not (= main_~a~0 0)))} call __VERIFIER_assert((if 0 == ~a~0 * ~b~0 then 1 else 0)); {8122#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 14:04:01,964 INFO L290 TraceCheckUtils]: 37: Hoare triple {8122#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {8126#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 14:04:01,965 INFO L290 TraceCheckUtils]: 38: Hoare triple {8126#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {8008#false} is VALID [2022-04-28 14:04:01,965 INFO L290 TraceCheckUtils]: 39: Hoare triple {8008#false} assume !false; {8008#false} is VALID [2022-04-28 14:04:01,965 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-28 14:04:01,965 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 14:04:01,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:04:01,965 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1029194116] [2022-04-28 14:04:01,965 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 14:04:01,965 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1135666048] [2022-04-28 14:04:01,966 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1135666048] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:04:01,966 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:04:01,966 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 14:04:01,966 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:04:01,966 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1597088162] [2022-04-28 14:04:01,966 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1597088162] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:04:01,966 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:04:01,966 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 14:04:01,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2105611840] [2022-04-28 14:04:01,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:04:01,967 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 40 [2022-04-28 14:04:01,967 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:04:01,967 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-28 14:04:01,995 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:04:01,996 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 14:04:01,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:04:01,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 14:04:01,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-04-28 14:04:01,996 INFO L87 Difference]: Start difference. First operand 96 states and 116 transitions. Second operand has 6 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-28 14:04:02,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:04:02,257 INFO L93 Difference]: Finished difference Result 126 states and 154 transitions. [2022-04-28 14:04:02,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-28 14:04:02,257 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 40 [2022-04-28 14:04:02,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:04:02,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-28 14:04:02,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 51 transitions. [2022-04-28 14:04:02,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-28 14:04:02,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 51 transitions. [2022-04-28 14:04:02,259 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 51 transitions. [2022-04-28 14:04:02,297 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:04:02,298 INFO L225 Difference]: With dead ends: 126 [2022-04-28 14:04:02,298 INFO L226 Difference]: Without dead ends: 114 [2022-04-28 14:04:02,299 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-04-28 14:04:02,299 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 7 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 14:04:02,300 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 114 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 14:04:02,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2022-04-28 14:04:02,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 102. [2022-04-28 14:04:02,405 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:04:02,405 INFO L82 GeneralOperation]: Start isEquivalent. First operand 114 states. Second operand has 102 states, 76 states have (on average 1.263157894736842) internal successors, (96), 78 states have internal predecessors, (96), 15 states have call successors, (15), 12 states have call predecessors, (15), 10 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-28 14:04:02,405 INFO L74 IsIncluded]: Start isIncluded. First operand 114 states. Second operand has 102 states, 76 states have (on average 1.263157894736842) internal successors, (96), 78 states have internal predecessors, (96), 15 states have call successors, (15), 12 states have call predecessors, (15), 10 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-28 14:04:02,406 INFO L87 Difference]: Start difference. First operand 114 states. Second operand has 102 states, 76 states have (on average 1.263157894736842) internal successors, (96), 78 states have internal predecessors, (96), 15 states have call successors, (15), 12 states have call predecessors, (15), 10 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-28 14:04:02,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:04:02,424 INFO L93 Difference]: Finished difference Result 114 states and 139 transitions. [2022-04-28 14:04:02,424 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 139 transitions. [2022-04-28 14:04:02,424 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:04:02,424 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:04:02,424 INFO L74 IsIncluded]: Start isIncluded. First operand has 102 states, 76 states have (on average 1.263157894736842) internal successors, (96), 78 states have internal predecessors, (96), 15 states have call successors, (15), 12 states have call predecessors, (15), 10 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) Second operand 114 states. [2022-04-28 14:04:02,425 INFO L87 Difference]: Start difference. First operand has 102 states, 76 states have (on average 1.263157894736842) internal successors, (96), 78 states have internal predecessors, (96), 15 states have call successors, (15), 12 states have call predecessors, (15), 10 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) Second operand 114 states. [2022-04-28 14:04:02,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:04:02,426 INFO L93 Difference]: Finished difference Result 114 states and 139 transitions. [2022-04-28 14:04:02,426 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 139 transitions. [2022-04-28 14:04:02,427 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:04:02,427 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:04:02,427 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:04:02,427 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:04:02,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 76 states have (on average 1.263157894736842) internal successors, (96), 78 states have internal predecessors, (96), 15 states have call successors, (15), 12 states have call predecessors, (15), 10 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-28 14:04:02,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 123 transitions. [2022-04-28 14:04:02,429 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 123 transitions. Word has length 40 [2022-04-28 14:04:02,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:04:02,429 INFO L495 AbstractCegarLoop]: Abstraction has 102 states and 123 transitions. [2022-04-28 14:04:02,429 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-28 14:04:02,430 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 102 states and 123 transitions. [2022-04-28 14:04:10,896 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 123 edges. 119 inductive. 0 not inductive. 4 times theorem prover too weak to decide inductivity. [2022-04-28 14:04:10,897 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 123 transitions. [2022-04-28 14:04:10,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-04-28 14:04:10,897 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:04:10,897 INFO L195 NwaCegarLoop]: trace histogram [4, 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] [2022-04-28 14:04:10,913 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2022-04-28 14:04:11,099 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 14:04:11,100 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:04:11,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:04:11,100 INFO L85 PathProgramCache]: Analyzing trace with hash -470105561, now seen corresponding path program 1 times [2022-04-28 14:04:11,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:04:11,100 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1219339004] [2022-04-28 14:04:17,152 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 14:04:17,152 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 14:04:17,152 INFO L85 PathProgramCache]: Analyzing trace with hash -470105561, now seen corresponding path program 2 times [2022-04-28 14:04:17,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:04:17,152 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [700106125] [2022-04-28 14:04:17,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:04:17,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:04:17,161 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 14:04:17,162 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1722200422] [2022-04-28 14:04:17,162 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 14:04:17,162 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 14:04:17,162 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 14:04:17,164 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 14:04:17,191 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-04-28 14:04:17,218 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 14:04:17,218 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 14:04:17,218 INFO L263 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-28 14:04:17,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:04:17,228 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 14:04:17,439 WARN L828 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-28 14:04:17,478 INFO L272 TraceCheckUtils]: 0: Hoare triple {8818#true} call ULTIMATE.init(); {8818#true} is VALID [2022-04-28 14:04:17,478 INFO L290 TraceCheckUtils]: 1: Hoare triple {8818#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(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {8818#true} is VALID [2022-04-28 14:04:17,478 INFO L290 TraceCheckUtils]: 2: Hoare triple {8818#true} assume true; {8818#true} is VALID [2022-04-28 14:04:17,478 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8818#true} {8818#true} #77#return; {8818#true} is VALID [2022-04-28 14:04:17,478 INFO L272 TraceCheckUtils]: 4: Hoare triple {8818#true} call #t~ret7 := main(); {8818#true} is VALID [2022-04-28 14:04:17,478 INFO L290 TraceCheckUtils]: 5: Hoare triple {8818#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {8818#true} is VALID [2022-04-28 14:04:17,478 INFO L272 TraceCheckUtils]: 6: Hoare triple {8818#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {8818#true} is VALID [2022-04-28 14:04:17,479 INFO L290 TraceCheckUtils]: 7: Hoare triple {8818#true} ~cond := #in~cond; {8844#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-28 14:04:17,479 INFO L290 TraceCheckUtils]: 8: Hoare triple {8844#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {8848#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 14:04:17,480 INFO L290 TraceCheckUtils]: 9: Hoare triple {8848#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {8848#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 14:04:17,480 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {8848#(not (= |assume_abort_if_not_#in~cond| 0))} {8818#true} #69#return; {8855#(<= 1 main_~y~0)} is VALID [2022-04-28 14:04:17,481 INFO L290 TraceCheckUtils]: 11: Hoare triple {8855#(<= 1 main_~y~0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {8859#(<= 1 main_~b~0)} is VALID [2022-04-28 14:04:17,481 INFO L290 TraceCheckUtils]: 12: Hoare triple {8859#(<= 1 main_~b~0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8859#(<= 1 main_~b~0)} is VALID [2022-04-28 14:04:17,481 INFO L290 TraceCheckUtils]: 13: Hoare triple {8859#(<= 1 main_~b~0)} assume !!(#t~post6 < 100);havoc #t~post6; {8859#(<= 1 main_~b~0)} is VALID [2022-04-28 14:04:17,481 INFO L272 TraceCheckUtils]: 14: Hoare triple {8859#(<= 1 main_~b~0)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {8818#true} is VALID [2022-04-28 14:04:17,482 INFO L290 TraceCheckUtils]: 15: Hoare triple {8818#true} ~cond := #in~cond; {8818#true} is VALID [2022-04-28 14:04:17,482 INFO L290 TraceCheckUtils]: 16: Hoare triple {8818#true} assume !(0 == ~cond); {8818#true} is VALID [2022-04-28 14:04:17,482 INFO L290 TraceCheckUtils]: 17: Hoare triple {8818#true} assume true; {8818#true} is VALID [2022-04-28 14:04:17,482 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {8818#true} {8859#(<= 1 main_~b~0)} #71#return; {8859#(<= 1 main_~b~0)} is VALID [2022-04-28 14:04:17,483 INFO L290 TraceCheckUtils]: 19: Hoare triple {8859#(<= 1 main_~b~0)} assume !!(0 != ~a~0 && 0 != ~b~0); {8859#(<= 1 main_~b~0)} is VALID [2022-04-28 14:04:17,483 INFO L290 TraceCheckUtils]: 20: Hoare triple {8859#(<= 1 main_~b~0)} assume !(0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2)); {8859#(<= 1 main_~b~0)} is VALID [2022-04-28 14:04:17,483 INFO L290 TraceCheckUtils]: 21: Hoare triple {8859#(<= 1 main_~b~0)} assume !(1 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2)); {8859#(<= 1 main_~b~0)} is VALID [2022-04-28 14:04:17,484 INFO L290 TraceCheckUtils]: 22: Hoare triple {8859#(<= 1 main_~b~0)} assume !(0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 1 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2));~a~0 := ~a~0 - 1;~b~0 := ~b~0 - 1;~q~0 := ~q~0 + (1 + (~a~0 + ~b~0)) * ~p~0; {8893#(<= 0 main_~b~0)} is VALID [2022-04-28 14:04:17,485 INFO L290 TraceCheckUtils]: 23: Hoare triple {8893#(<= 0 main_~b~0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8893#(<= 0 main_~b~0)} is VALID [2022-04-28 14:04:17,485 INFO L290 TraceCheckUtils]: 24: Hoare triple {8893#(<= 0 main_~b~0)} assume !!(#t~post6 < 100);havoc #t~post6; {8893#(<= 0 main_~b~0)} is VALID [2022-04-28 14:04:17,485 INFO L272 TraceCheckUtils]: 25: Hoare triple {8893#(<= 0 main_~b~0)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {8818#true} is VALID [2022-04-28 14:04:17,485 INFO L290 TraceCheckUtils]: 26: Hoare triple {8818#true} ~cond := #in~cond; {8818#true} is VALID [2022-04-28 14:04:17,485 INFO L290 TraceCheckUtils]: 27: Hoare triple {8818#true} assume !(0 == ~cond); {8818#true} is VALID [2022-04-28 14:04:17,486 INFO L290 TraceCheckUtils]: 28: Hoare triple {8818#true} assume true; {8818#true} is VALID [2022-04-28 14:04:17,486 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {8818#true} {8893#(<= 0 main_~b~0)} #71#return; {8893#(<= 0 main_~b~0)} is VALID [2022-04-28 14:04:17,487 INFO L290 TraceCheckUtils]: 30: Hoare triple {8893#(<= 0 main_~b~0)} assume !(0 != ~a~0 && 0 != ~b~0); {8918#(and (or (= main_~a~0 0) (= main_~b~0 0)) (<= 0 main_~b~0))} is VALID [2022-04-28 14:04:17,487 INFO L272 TraceCheckUtils]: 31: Hoare triple {8918#(and (or (= main_~a~0 0) (= main_~b~0 0)) (<= 0 main_~b~0))} call __VERIFIER_assert((if ~q~0 == ~x~0 * ~y~0 then 1 else 0)); {8818#true} is VALID [2022-04-28 14:04:17,487 INFO L290 TraceCheckUtils]: 32: Hoare triple {8818#true} ~cond := #in~cond; {8818#true} is VALID [2022-04-28 14:04:17,487 INFO L290 TraceCheckUtils]: 33: Hoare triple {8818#true} assume !(0 == ~cond); {8818#true} is VALID [2022-04-28 14:04:17,487 INFO L290 TraceCheckUtils]: 34: Hoare triple {8818#true} assume true; {8818#true} is VALID [2022-04-28 14:04:17,488 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {8818#true} {8918#(and (or (= main_~a~0 0) (= main_~b~0 0)) (<= 0 main_~b~0))} #73#return; {8918#(and (or (= main_~a~0 0) (= main_~b~0 0)) (<= 0 main_~b~0))} is VALID [2022-04-28 14:04:17,489 INFO L272 TraceCheckUtils]: 36: Hoare triple {8918#(and (or (= main_~a~0 0) (= main_~b~0 0)) (<= 0 main_~b~0))} call __VERIFIER_assert((if 0 == ~a~0 * ~b~0 then 1 else 0)); {8937#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 14:04:17,490 INFO L290 TraceCheckUtils]: 37: Hoare triple {8937#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {8941#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 14:04:17,490 INFO L290 TraceCheckUtils]: 38: Hoare triple {8941#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {8819#false} is VALID [2022-04-28 14:04:17,490 INFO L290 TraceCheckUtils]: 39: Hoare triple {8819#false} assume !false; {8819#false} is VALID [2022-04-28 14:04:17,491 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-28 14:04:17,491 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 14:04:17,700 INFO L290 TraceCheckUtils]: 39: Hoare triple {8819#false} assume !false; {8819#false} is VALID [2022-04-28 14:04:17,701 INFO L290 TraceCheckUtils]: 38: Hoare triple {8941#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {8819#false} is VALID [2022-04-28 14:04:17,701 INFO L290 TraceCheckUtils]: 37: Hoare triple {8937#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {8941#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 14:04:17,702 INFO L272 TraceCheckUtils]: 36: Hoare triple {8957#(= (* main_~b~0 main_~a~0) 0)} call __VERIFIER_assert((if 0 == ~a~0 * ~b~0 then 1 else 0)); {8937#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 14:04:17,702 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {8818#true} {8957#(= (* main_~b~0 main_~a~0) 0)} #73#return; {8957#(= (* main_~b~0 main_~a~0) 0)} is VALID [2022-04-28 14:04:17,702 INFO L290 TraceCheckUtils]: 34: Hoare triple {8818#true} assume true; {8818#true} is VALID [2022-04-28 14:04:17,702 INFO L290 TraceCheckUtils]: 33: Hoare triple {8818#true} assume !(0 == ~cond); {8818#true} is VALID [2022-04-28 14:04:17,702 INFO L290 TraceCheckUtils]: 32: Hoare triple {8818#true} ~cond := #in~cond; {8818#true} is VALID [2022-04-28 14:04:17,702 INFO L272 TraceCheckUtils]: 31: Hoare triple {8957#(= (* main_~b~0 main_~a~0) 0)} call __VERIFIER_assert((if ~q~0 == ~x~0 * ~y~0 then 1 else 0)); {8818#true} is VALID [2022-04-28 14:04:17,703 INFO L290 TraceCheckUtils]: 30: Hoare triple {8818#true} assume !(0 != ~a~0 && 0 != ~b~0); {8957#(= (* main_~b~0 main_~a~0) 0)} is VALID [2022-04-28 14:04:17,704 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {8818#true} {8818#true} #71#return; {8818#true} is VALID [2022-04-28 14:04:17,704 INFO L290 TraceCheckUtils]: 28: Hoare triple {8818#true} assume true; {8818#true} is VALID [2022-04-28 14:04:17,704 INFO L290 TraceCheckUtils]: 27: Hoare triple {8818#true} assume !(0 == ~cond); {8818#true} is VALID [2022-04-28 14:04:17,704 INFO L290 TraceCheckUtils]: 26: Hoare triple {8818#true} ~cond := #in~cond; {8818#true} is VALID [2022-04-28 14:04:17,704 INFO L272 TraceCheckUtils]: 25: Hoare triple {8818#true} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {8818#true} is VALID [2022-04-28 14:04:17,704 INFO L290 TraceCheckUtils]: 24: Hoare triple {8818#true} assume !!(#t~post6 < 100);havoc #t~post6; {8818#true} is VALID [2022-04-28 14:04:17,704 INFO L290 TraceCheckUtils]: 23: Hoare triple {8818#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8818#true} is VALID [2022-04-28 14:04:17,704 INFO L290 TraceCheckUtils]: 22: Hoare triple {8818#true} assume !(0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 1 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2));~a~0 := ~a~0 - 1;~b~0 := ~b~0 - 1;~q~0 := ~q~0 + (1 + (~a~0 + ~b~0)) * ~p~0; {8818#true} is VALID [2022-04-28 14:04:17,704 INFO L290 TraceCheckUtils]: 21: Hoare triple {8818#true} assume !(1 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2)); {8818#true} is VALID [2022-04-28 14:04:17,704 INFO L290 TraceCheckUtils]: 20: Hoare triple {8818#true} assume !(0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2)); {8818#true} is VALID [2022-04-28 14:04:17,704 INFO L290 TraceCheckUtils]: 19: Hoare triple {8818#true} assume !!(0 != ~a~0 && 0 != ~b~0); {8818#true} is VALID [2022-04-28 14:04:17,704 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {8818#true} {8818#true} #71#return; {8818#true} is VALID [2022-04-28 14:04:17,704 INFO L290 TraceCheckUtils]: 17: Hoare triple {8818#true} assume true; {8818#true} is VALID [2022-04-28 14:04:17,704 INFO L290 TraceCheckUtils]: 16: Hoare triple {8818#true} assume !(0 == ~cond); {8818#true} is VALID [2022-04-28 14:04:17,704 INFO L290 TraceCheckUtils]: 15: Hoare triple {8818#true} ~cond := #in~cond; {8818#true} is VALID [2022-04-28 14:04:17,704 INFO L272 TraceCheckUtils]: 14: Hoare triple {8818#true} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {8818#true} is VALID [2022-04-28 14:04:17,705 INFO L290 TraceCheckUtils]: 13: Hoare triple {8818#true} assume !!(#t~post6 < 100);havoc #t~post6; {8818#true} is VALID [2022-04-28 14:04:17,705 INFO L290 TraceCheckUtils]: 12: Hoare triple {8818#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8818#true} is VALID [2022-04-28 14:04:17,705 INFO L290 TraceCheckUtils]: 11: Hoare triple {8818#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {8818#true} is VALID [2022-04-28 14:04:17,705 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {8818#true} {8818#true} #69#return; {8818#true} is VALID [2022-04-28 14:04:17,705 INFO L290 TraceCheckUtils]: 9: Hoare triple {8818#true} assume true; {8818#true} is VALID [2022-04-28 14:04:17,705 INFO L290 TraceCheckUtils]: 8: Hoare triple {8818#true} assume !(0 == ~cond); {8818#true} is VALID [2022-04-28 14:04:17,705 INFO L290 TraceCheckUtils]: 7: Hoare triple {8818#true} ~cond := #in~cond; {8818#true} is VALID [2022-04-28 14:04:17,705 INFO L272 TraceCheckUtils]: 6: Hoare triple {8818#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {8818#true} is VALID [2022-04-28 14:04:17,705 INFO L290 TraceCheckUtils]: 5: Hoare triple {8818#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {8818#true} is VALID [2022-04-28 14:04:17,705 INFO L272 TraceCheckUtils]: 4: Hoare triple {8818#true} call #t~ret7 := main(); {8818#true} is VALID [2022-04-28 14:04:17,706 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8818#true} {8818#true} #77#return; {8818#true} is VALID [2022-04-28 14:04:17,706 INFO L290 TraceCheckUtils]: 2: Hoare triple {8818#true} assume true; {8818#true} is VALID [2022-04-28 14:04:17,706 INFO L290 TraceCheckUtils]: 1: Hoare triple {8818#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(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {8818#true} is VALID [2022-04-28 14:04:17,706 INFO L272 TraceCheckUtils]: 0: Hoare triple {8818#true} call ULTIMATE.init(); {8818#true} is VALID [2022-04-28 14:04:17,706 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-04-28 14:04:17,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:04:17,706 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [700106125] [2022-04-28 14:04:17,706 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 14:04:17,706 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1722200422] [2022-04-28 14:04:17,707 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1722200422] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-28 14:04:17,707 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-28 14:04:17,707 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 11 [2022-04-28 14:04:17,707 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:04:17,707 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1219339004] [2022-04-28 14:04:17,707 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1219339004] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:04:17,707 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:04:17,707 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 14:04:17,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1460266328] [2022-04-28 14:04:17,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:04:17,708 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 2 states have call successors, (6), 2 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 40 [2022-04-28 14:04:17,708 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:04:17,708 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 2 states have call successors, (6), 2 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 14:04:17,741 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 14:04:17,741 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 14:04:17,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:04:17,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 14:04:17,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2022-04-28 14:04:17,742 INFO L87 Difference]: Start difference. First operand 102 states and 123 transitions. Second operand has 5 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 2 states have call successors, (6), 2 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 14:04:18,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:04:18,145 INFO L93 Difference]: Finished difference Result 109 states and 129 transitions. [2022-04-28 14:04:18,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 14:04:18,145 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 2 states have call successors, (6), 2 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 40 [2022-04-28 14:04:18,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:04:18,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 2 states have call successors, (6), 2 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 14:04:18,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 41 transitions. [2022-04-28 14:04:18,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 2 states have call successors, (6), 2 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 14:04:18,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 41 transitions. [2022-04-28 14:04:18,146 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 41 transitions. [2022-04-28 14:04:18,181 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:04:18,183 INFO L225 Difference]: With dead ends: 109 [2022-04-28 14:04:18,183 INFO L226 Difference]: Without dead ends: 89 [2022-04-28 14:04:18,183 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 69 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2022-04-28 14:04:18,184 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 5 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 14:04:18,184 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 117 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 14:04:18,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2022-04-28 14:04:18,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 65. [2022-04-28 14:04:18,286 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:04:18,286 INFO L82 GeneralOperation]: Start isEquivalent. First operand 89 states. Second operand has 65 states, 48 states have (on average 1.25) internal successors, (60), 49 states have internal predecessors, (60), 9 states have call successors, (9), 8 states have call predecessors, (9), 7 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 14:04:18,286 INFO L74 IsIncluded]: Start isIncluded. First operand 89 states. Second operand has 65 states, 48 states have (on average 1.25) internal successors, (60), 49 states have internal predecessors, (60), 9 states have call successors, (9), 8 states have call predecessors, (9), 7 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 14:04:18,286 INFO L87 Difference]: Start difference. First operand 89 states. Second operand has 65 states, 48 states have (on average 1.25) internal successors, (60), 49 states have internal predecessors, (60), 9 states have call successors, (9), 8 states have call predecessors, (9), 7 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 14:04:18,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:04:18,288 INFO L93 Difference]: Finished difference Result 89 states and 108 transitions. [2022-04-28 14:04:18,288 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 108 transitions. [2022-04-28 14:04:18,288 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:04:18,289 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:04:18,289 INFO L74 IsIncluded]: Start isIncluded. First operand has 65 states, 48 states have (on average 1.25) internal successors, (60), 49 states have internal predecessors, (60), 9 states have call successors, (9), 8 states have call predecessors, (9), 7 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 89 states. [2022-04-28 14:04:18,289 INFO L87 Difference]: Start difference. First operand has 65 states, 48 states have (on average 1.25) internal successors, (60), 49 states have internal predecessors, (60), 9 states have call successors, (9), 8 states have call predecessors, (9), 7 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 89 states. [2022-04-28 14:04:18,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:04:18,290 INFO L93 Difference]: Finished difference Result 89 states and 108 transitions. [2022-04-28 14:04:18,291 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 108 transitions. [2022-04-28 14:04:18,291 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:04:18,291 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:04:18,291 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:04:18,291 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:04:18,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 48 states have (on average 1.25) internal successors, (60), 49 states have internal predecessors, (60), 9 states have call successors, (9), 8 states have call predecessors, (9), 7 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 14:04:18,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 76 transitions. [2022-04-28 14:04:18,292 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 76 transitions. Word has length 40 [2022-04-28 14:04:18,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:04:18,293 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 76 transitions. [2022-04-28 14:04:18,293 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 2 states have call successors, (6), 2 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 14:04:18,293 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 65 states and 76 transitions. [2022-04-28 14:04:22,667 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 74 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-28 14:04:22,667 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 76 transitions. [2022-04-28 14:04:22,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-04-28 14:04:22,668 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:04:22,668 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 14:04:22,685 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-04-28 14:04:22,875 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-04-28 14:04:22,875 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:04:22,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:04:22,876 INFO L85 PathProgramCache]: Analyzing trace with hash 517832770, now seen corresponding path program 5 times [2022-04-28 14:04:22,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:04:22,876 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [888860651] [2022-04-28 14:04:28,932 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 14:04:28,932 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 14:04:28,932 INFO L85 PathProgramCache]: Analyzing trace with hash 517832770, now seen corresponding path program 6 times [2022-04-28 14:04:28,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:04:28,933 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047551355] [2022-04-28 14:04:28,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:04:28,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:04:28,942 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 14:04:28,942 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [426526585] [2022-04-28 14:04:28,942 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 14:04:28,942 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 14:04:28,942 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 14:04:28,948 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 14:04:28,951 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-04-28 14:04:28,993 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-04-28 14:04:28,993 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 14:04:28,994 INFO L263 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-28 14:04:29,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:04:29,005 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 14:04:29,195 INFO L272 TraceCheckUtils]: 0: Hoare triple {9596#true} call ULTIMATE.init(); {9596#true} is VALID [2022-04-28 14:04:29,196 INFO L290 TraceCheckUtils]: 1: Hoare triple {9596#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(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {9604#(<= ~counter~0 0)} is VALID [2022-04-28 14:04:29,196 INFO L290 TraceCheckUtils]: 2: Hoare triple {9604#(<= ~counter~0 0)} assume true; {9604#(<= ~counter~0 0)} is VALID [2022-04-28 14:04:29,197 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9604#(<= ~counter~0 0)} {9596#true} #77#return; {9604#(<= ~counter~0 0)} is VALID [2022-04-28 14:04:29,197 INFO L272 TraceCheckUtils]: 4: Hoare triple {9604#(<= ~counter~0 0)} call #t~ret7 := main(); {9604#(<= ~counter~0 0)} is VALID [2022-04-28 14:04:29,197 INFO L290 TraceCheckUtils]: 5: Hoare triple {9604#(<= ~counter~0 0)} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {9604#(<= ~counter~0 0)} is VALID [2022-04-28 14:04:29,197 INFO L272 TraceCheckUtils]: 6: Hoare triple {9604#(<= ~counter~0 0)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {9604#(<= ~counter~0 0)} is VALID [2022-04-28 14:04:29,198 INFO L290 TraceCheckUtils]: 7: Hoare triple {9604#(<= ~counter~0 0)} ~cond := #in~cond; {9604#(<= ~counter~0 0)} is VALID [2022-04-28 14:04:29,198 INFO L290 TraceCheckUtils]: 8: Hoare triple {9604#(<= ~counter~0 0)} assume !(0 == ~cond); {9604#(<= ~counter~0 0)} is VALID [2022-04-28 14:04:29,198 INFO L290 TraceCheckUtils]: 9: Hoare triple {9604#(<= ~counter~0 0)} assume true; {9604#(<= ~counter~0 0)} is VALID [2022-04-28 14:04:29,199 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {9604#(<= ~counter~0 0)} {9604#(<= ~counter~0 0)} #69#return; {9604#(<= ~counter~0 0)} is VALID [2022-04-28 14:04:29,199 INFO L290 TraceCheckUtils]: 11: Hoare triple {9604#(<= ~counter~0 0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {9604#(<= ~counter~0 0)} is VALID [2022-04-28 14:04:29,199 INFO L290 TraceCheckUtils]: 12: Hoare triple {9604#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {9638#(<= ~counter~0 1)} is VALID [2022-04-28 14:04:29,200 INFO L290 TraceCheckUtils]: 13: Hoare triple {9638#(<= ~counter~0 1)} assume !!(#t~post6 < 100);havoc #t~post6; {9638#(<= ~counter~0 1)} is VALID [2022-04-28 14:04:29,200 INFO L272 TraceCheckUtils]: 14: Hoare triple {9638#(<= ~counter~0 1)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {9638#(<= ~counter~0 1)} is VALID [2022-04-28 14:04:29,201 INFO L290 TraceCheckUtils]: 15: Hoare triple {9638#(<= ~counter~0 1)} ~cond := #in~cond; {9638#(<= ~counter~0 1)} is VALID [2022-04-28 14:04:29,201 INFO L290 TraceCheckUtils]: 16: Hoare triple {9638#(<= ~counter~0 1)} assume !(0 == ~cond); {9638#(<= ~counter~0 1)} is VALID [2022-04-28 14:04:29,201 INFO L290 TraceCheckUtils]: 17: Hoare triple {9638#(<= ~counter~0 1)} assume true; {9638#(<= ~counter~0 1)} is VALID [2022-04-28 14:04:29,202 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {9638#(<= ~counter~0 1)} {9638#(<= ~counter~0 1)} #71#return; {9638#(<= ~counter~0 1)} is VALID [2022-04-28 14:04:29,202 INFO L290 TraceCheckUtils]: 19: Hoare triple {9638#(<= ~counter~0 1)} assume !!(0 != ~a~0 && 0 != ~b~0); {9638#(<= ~counter~0 1)} is VALID [2022-04-28 14:04:29,202 INFO L290 TraceCheckUtils]: 20: Hoare triple {9638#(<= ~counter~0 1)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {9638#(<= ~counter~0 1)} is VALID [2022-04-28 14:04:29,203 INFO L290 TraceCheckUtils]: 21: Hoare triple {9638#(<= ~counter~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {9666#(<= ~counter~0 2)} is VALID [2022-04-28 14:04:29,203 INFO L290 TraceCheckUtils]: 22: Hoare triple {9666#(<= ~counter~0 2)} assume !!(#t~post6 < 100);havoc #t~post6; {9666#(<= ~counter~0 2)} is VALID [2022-04-28 14:04:29,203 INFO L272 TraceCheckUtils]: 23: Hoare triple {9666#(<= ~counter~0 2)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {9666#(<= ~counter~0 2)} is VALID [2022-04-28 14:04:29,204 INFO L290 TraceCheckUtils]: 24: Hoare triple {9666#(<= ~counter~0 2)} ~cond := #in~cond; {9666#(<= ~counter~0 2)} is VALID [2022-04-28 14:04:29,204 INFO L290 TraceCheckUtils]: 25: Hoare triple {9666#(<= ~counter~0 2)} assume !(0 == ~cond); {9666#(<= ~counter~0 2)} is VALID [2022-04-28 14:04:29,204 INFO L290 TraceCheckUtils]: 26: Hoare triple {9666#(<= ~counter~0 2)} assume true; {9666#(<= ~counter~0 2)} is VALID [2022-04-28 14:04:29,205 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {9666#(<= ~counter~0 2)} {9666#(<= ~counter~0 2)} #71#return; {9666#(<= ~counter~0 2)} is VALID [2022-04-28 14:04:29,205 INFO L290 TraceCheckUtils]: 28: Hoare triple {9666#(<= ~counter~0 2)} assume !!(0 != ~a~0 && 0 != ~b~0); {9666#(<= ~counter~0 2)} is VALID [2022-04-28 14:04:29,205 INFO L290 TraceCheckUtils]: 29: Hoare triple {9666#(<= ~counter~0 2)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {9666#(<= ~counter~0 2)} is VALID [2022-04-28 14:04:29,206 INFO L290 TraceCheckUtils]: 30: Hoare triple {9666#(<= ~counter~0 2)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {9694#(<= ~counter~0 3)} is VALID [2022-04-28 14:04:29,206 INFO L290 TraceCheckUtils]: 31: Hoare triple {9694#(<= ~counter~0 3)} assume !!(#t~post6 < 100);havoc #t~post6; {9694#(<= ~counter~0 3)} is VALID [2022-04-28 14:04:29,206 INFO L272 TraceCheckUtils]: 32: Hoare triple {9694#(<= ~counter~0 3)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {9694#(<= ~counter~0 3)} is VALID [2022-04-28 14:04:29,207 INFO L290 TraceCheckUtils]: 33: Hoare triple {9694#(<= ~counter~0 3)} ~cond := #in~cond; {9694#(<= ~counter~0 3)} is VALID [2022-04-28 14:04:29,207 INFO L290 TraceCheckUtils]: 34: Hoare triple {9694#(<= ~counter~0 3)} assume !(0 == ~cond); {9694#(<= ~counter~0 3)} is VALID [2022-04-28 14:04:29,207 INFO L290 TraceCheckUtils]: 35: Hoare triple {9694#(<= ~counter~0 3)} assume true; {9694#(<= ~counter~0 3)} is VALID [2022-04-28 14:04:29,208 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {9694#(<= ~counter~0 3)} {9694#(<= ~counter~0 3)} #71#return; {9694#(<= ~counter~0 3)} is VALID [2022-04-28 14:04:29,208 INFO L290 TraceCheckUtils]: 37: Hoare triple {9694#(<= ~counter~0 3)} assume !!(0 != ~a~0 && 0 != ~b~0); {9694#(<= ~counter~0 3)} is VALID [2022-04-28 14:04:29,208 INFO L290 TraceCheckUtils]: 38: Hoare triple {9694#(<= ~counter~0 3)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {9694#(<= ~counter~0 3)} is VALID [2022-04-28 14:04:29,209 INFO L290 TraceCheckUtils]: 39: Hoare triple {9694#(<= ~counter~0 3)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {9722#(<= |main_#t~post6| 3)} is VALID [2022-04-28 14:04:29,209 INFO L290 TraceCheckUtils]: 40: Hoare triple {9722#(<= |main_#t~post6| 3)} assume !(#t~post6 < 100);havoc #t~post6; {9597#false} is VALID [2022-04-28 14:04:29,209 INFO L272 TraceCheckUtils]: 41: Hoare triple {9597#false} call __VERIFIER_assert((if ~q~0 == ~x~0 * ~y~0 then 1 else 0)); {9597#false} is VALID [2022-04-28 14:04:29,209 INFO L290 TraceCheckUtils]: 42: Hoare triple {9597#false} ~cond := #in~cond; {9597#false} is VALID [2022-04-28 14:04:29,209 INFO L290 TraceCheckUtils]: 43: Hoare triple {9597#false} assume 0 == ~cond; {9597#false} is VALID [2022-04-28 14:04:29,209 INFO L290 TraceCheckUtils]: 44: Hoare triple {9597#false} assume !false; {9597#false} is VALID [2022-04-28 14:04:29,209 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 6 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 14:04:29,209 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 14:04:29,442 INFO L290 TraceCheckUtils]: 44: Hoare triple {9597#false} assume !false; {9597#false} is VALID [2022-04-28 14:04:29,443 INFO L290 TraceCheckUtils]: 43: Hoare triple {9597#false} assume 0 == ~cond; {9597#false} is VALID [2022-04-28 14:04:29,443 INFO L290 TraceCheckUtils]: 42: Hoare triple {9597#false} ~cond := #in~cond; {9597#false} is VALID [2022-04-28 14:04:29,443 INFO L272 TraceCheckUtils]: 41: Hoare triple {9597#false} call __VERIFIER_assert((if ~q~0 == ~x~0 * ~y~0 then 1 else 0)); {9597#false} is VALID [2022-04-28 14:04:29,443 INFO L290 TraceCheckUtils]: 40: Hoare triple {9750#(< |main_#t~post6| 100)} assume !(#t~post6 < 100);havoc #t~post6; {9597#false} is VALID [2022-04-28 14:04:29,444 INFO L290 TraceCheckUtils]: 39: Hoare triple {9754#(< ~counter~0 100)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {9750#(< |main_#t~post6| 100)} is VALID [2022-04-28 14:04:29,444 INFO L290 TraceCheckUtils]: 38: Hoare triple {9754#(< ~counter~0 100)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {9754#(< ~counter~0 100)} is VALID [2022-04-28 14:04:29,444 INFO L290 TraceCheckUtils]: 37: Hoare triple {9754#(< ~counter~0 100)} assume !!(0 != ~a~0 && 0 != ~b~0); {9754#(< ~counter~0 100)} is VALID [2022-04-28 14:04:29,445 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {9596#true} {9754#(< ~counter~0 100)} #71#return; {9754#(< ~counter~0 100)} is VALID [2022-04-28 14:04:29,445 INFO L290 TraceCheckUtils]: 35: Hoare triple {9596#true} assume true; {9596#true} is VALID [2022-04-28 14:04:29,445 INFO L290 TraceCheckUtils]: 34: Hoare triple {9596#true} assume !(0 == ~cond); {9596#true} is VALID [2022-04-28 14:04:29,445 INFO L290 TraceCheckUtils]: 33: Hoare triple {9596#true} ~cond := #in~cond; {9596#true} is VALID [2022-04-28 14:04:29,445 INFO L272 TraceCheckUtils]: 32: Hoare triple {9754#(< ~counter~0 100)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {9596#true} is VALID [2022-04-28 14:04:29,446 INFO L290 TraceCheckUtils]: 31: Hoare triple {9754#(< ~counter~0 100)} assume !!(#t~post6 < 100);havoc #t~post6; {9754#(< ~counter~0 100)} is VALID [2022-04-28 14:04:29,446 INFO L290 TraceCheckUtils]: 30: Hoare triple {9782#(< ~counter~0 99)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {9754#(< ~counter~0 100)} is VALID [2022-04-28 14:04:29,447 INFO L290 TraceCheckUtils]: 29: Hoare triple {9782#(< ~counter~0 99)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {9782#(< ~counter~0 99)} is VALID [2022-04-28 14:04:29,447 INFO L290 TraceCheckUtils]: 28: Hoare triple {9782#(< ~counter~0 99)} assume !!(0 != ~a~0 && 0 != ~b~0); {9782#(< ~counter~0 99)} is VALID [2022-04-28 14:04:29,448 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {9596#true} {9782#(< ~counter~0 99)} #71#return; {9782#(< ~counter~0 99)} is VALID [2022-04-28 14:04:29,448 INFO L290 TraceCheckUtils]: 26: Hoare triple {9596#true} assume true; {9596#true} is VALID [2022-04-28 14:04:29,448 INFO L290 TraceCheckUtils]: 25: Hoare triple {9596#true} assume !(0 == ~cond); {9596#true} is VALID [2022-04-28 14:04:29,448 INFO L290 TraceCheckUtils]: 24: Hoare triple {9596#true} ~cond := #in~cond; {9596#true} is VALID [2022-04-28 14:04:29,448 INFO L272 TraceCheckUtils]: 23: Hoare triple {9782#(< ~counter~0 99)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {9596#true} is VALID [2022-04-28 14:04:29,448 INFO L290 TraceCheckUtils]: 22: Hoare triple {9782#(< ~counter~0 99)} assume !!(#t~post6 < 100);havoc #t~post6; {9782#(< ~counter~0 99)} is VALID [2022-04-28 14:04:29,449 INFO L290 TraceCheckUtils]: 21: Hoare triple {9810#(< ~counter~0 98)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {9782#(< ~counter~0 99)} is VALID [2022-04-28 14:04:29,449 INFO L290 TraceCheckUtils]: 20: Hoare triple {9810#(< ~counter~0 98)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {9810#(< ~counter~0 98)} is VALID [2022-04-28 14:04:29,450 INFO L290 TraceCheckUtils]: 19: Hoare triple {9810#(< ~counter~0 98)} assume !!(0 != ~a~0 && 0 != ~b~0); {9810#(< ~counter~0 98)} is VALID [2022-04-28 14:04:29,450 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {9596#true} {9810#(< ~counter~0 98)} #71#return; {9810#(< ~counter~0 98)} is VALID [2022-04-28 14:04:29,450 INFO L290 TraceCheckUtils]: 17: Hoare triple {9596#true} assume true; {9596#true} is VALID [2022-04-28 14:04:29,450 INFO L290 TraceCheckUtils]: 16: Hoare triple {9596#true} assume !(0 == ~cond); {9596#true} is VALID [2022-04-28 14:04:29,451 INFO L290 TraceCheckUtils]: 15: Hoare triple {9596#true} ~cond := #in~cond; {9596#true} is VALID [2022-04-28 14:04:29,451 INFO L272 TraceCheckUtils]: 14: Hoare triple {9810#(< ~counter~0 98)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {9596#true} is VALID [2022-04-28 14:04:29,451 INFO L290 TraceCheckUtils]: 13: Hoare triple {9810#(< ~counter~0 98)} assume !!(#t~post6 < 100);havoc #t~post6; {9810#(< ~counter~0 98)} is VALID [2022-04-28 14:04:29,451 INFO L290 TraceCheckUtils]: 12: Hoare triple {9838#(< ~counter~0 97)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {9810#(< ~counter~0 98)} is VALID [2022-04-28 14:04:29,452 INFO L290 TraceCheckUtils]: 11: Hoare triple {9838#(< ~counter~0 97)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {9838#(< ~counter~0 97)} is VALID [2022-04-28 14:04:29,452 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {9596#true} {9838#(< ~counter~0 97)} #69#return; {9838#(< ~counter~0 97)} is VALID [2022-04-28 14:04:29,452 INFO L290 TraceCheckUtils]: 9: Hoare triple {9596#true} assume true; {9596#true} is VALID [2022-04-28 14:04:29,452 INFO L290 TraceCheckUtils]: 8: Hoare triple {9596#true} assume !(0 == ~cond); {9596#true} is VALID [2022-04-28 14:04:29,452 INFO L290 TraceCheckUtils]: 7: Hoare triple {9596#true} ~cond := #in~cond; {9596#true} is VALID [2022-04-28 14:04:29,453 INFO L272 TraceCheckUtils]: 6: Hoare triple {9838#(< ~counter~0 97)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {9596#true} is VALID [2022-04-28 14:04:29,453 INFO L290 TraceCheckUtils]: 5: Hoare triple {9838#(< ~counter~0 97)} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {9838#(< ~counter~0 97)} is VALID [2022-04-28 14:04:29,453 INFO L272 TraceCheckUtils]: 4: Hoare triple {9838#(< ~counter~0 97)} call #t~ret7 := main(); {9838#(< ~counter~0 97)} is VALID [2022-04-28 14:04:29,454 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9838#(< ~counter~0 97)} {9596#true} #77#return; {9838#(< ~counter~0 97)} is VALID [2022-04-28 14:04:29,454 INFO L290 TraceCheckUtils]: 2: Hoare triple {9838#(< ~counter~0 97)} assume true; {9838#(< ~counter~0 97)} is VALID [2022-04-28 14:04:29,455 INFO L290 TraceCheckUtils]: 1: Hoare triple {9596#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(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {9838#(< ~counter~0 97)} is VALID [2022-04-28 14:04:29,455 INFO L272 TraceCheckUtils]: 0: Hoare triple {9596#true} call ULTIMATE.init(); {9596#true} is VALID [2022-04-28 14:04:29,455 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 6 proven. 21 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-28 14:04:29,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:04:29,455 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2047551355] [2022-04-28 14:04:29,455 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 14:04:29,455 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [426526585] [2022-04-28 14:04:29,455 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [426526585] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 14:04:29,455 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 14:04:29,455 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2022-04-28 14:04:29,456 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:04:29,456 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [888860651] [2022-04-28 14:04:29,456 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [888860651] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:04:29,456 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:04:29,456 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 14:04:29,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [188796733] [2022-04-28 14:04:29,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:04:29,457 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 6 states have internal predecessors, (33), 6 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) Word has length 45 [2022-04-28 14:04:29,457 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:04:29,457 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 6 states have internal predecessors, (33), 6 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-28 14:04:29,494 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:04:29,495 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-28 14:04:29,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:04:29,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-28 14:04:29,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2022-04-28 14:04:29,496 INFO L87 Difference]: Start difference. First operand 65 states and 76 transitions. Second operand has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 6 states have internal predecessors, (33), 6 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-28 14:04:29,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:04:29,736 INFO L93 Difference]: Finished difference Result 84 states and 99 transitions. [2022-04-28 14:04:29,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-28 14:04:29,736 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 6 states have internal predecessors, (33), 6 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) Word has length 45 [2022-04-28 14:04:29,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:04:29,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 6 states have internal predecessors, (33), 6 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-28 14:04:29,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 85 transitions. [2022-04-28 14:04:29,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 6 states have internal predecessors, (33), 6 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-28 14:04:29,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 85 transitions. [2022-04-28 14:04:29,739 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 85 transitions. [2022-04-28 14:04:29,813 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 85 edges. 85 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:04:29,814 INFO L225 Difference]: With dead ends: 84 [2022-04-28 14:04:29,814 INFO L226 Difference]: Without dead ends: 76 [2022-04-28 14:04:29,815 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=83, Invalid=127, Unknown=0, NotChecked=0, Total=210 [2022-04-28 14:04:29,815 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 21 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 14:04:29,815 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 138 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 14:04:29,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2022-04-28 14:04:29,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2022-04-28 14:04:29,929 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:04:29,930 INFO L82 GeneralOperation]: Start isEquivalent. First operand 76 states. Second operand has 76 states, 57 states have (on average 1.263157894736842) internal successors, (72), 58 states have internal predecessors, (72), 10 states have call successors, (10), 9 states have call predecessors, (10), 8 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 14:04:29,930 INFO L74 IsIncluded]: Start isIncluded. First operand 76 states. Second operand has 76 states, 57 states have (on average 1.263157894736842) internal successors, (72), 58 states have internal predecessors, (72), 10 states have call successors, (10), 9 states have call predecessors, (10), 8 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 14:04:29,930 INFO L87 Difference]: Start difference. First operand 76 states. Second operand has 76 states, 57 states have (on average 1.263157894736842) internal successors, (72), 58 states have internal predecessors, (72), 10 states have call successors, (10), 9 states have call predecessors, (10), 8 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 14:04:29,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:04:29,931 INFO L93 Difference]: Finished difference Result 76 states and 90 transitions. [2022-04-28 14:04:29,931 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 90 transitions. [2022-04-28 14:04:29,931 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:04:29,931 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:04:29,931 INFO L74 IsIncluded]: Start isIncluded. First operand has 76 states, 57 states have (on average 1.263157894736842) internal successors, (72), 58 states have internal predecessors, (72), 10 states have call successors, (10), 9 states have call predecessors, (10), 8 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 76 states. [2022-04-28 14:04:29,932 INFO L87 Difference]: Start difference. First operand has 76 states, 57 states have (on average 1.263157894736842) internal successors, (72), 58 states have internal predecessors, (72), 10 states have call successors, (10), 9 states have call predecessors, (10), 8 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 76 states. [2022-04-28 14:04:29,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:04:29,933 INFO L93 Difference]: Finished difference Result 76 states and 90 transitions. [2022-04-28 14:04:29,933 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 90 transitions. [2022-04-28 14:04:29,933 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:04:29,933 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:04:29,933 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:04:29,934 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:04:29,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 57 states have (on average 1.263157894736842) internal successors, (72), 58 states have internal predecessors, (72), 10 states have call successors, (10), 9 states have call predecessors, (10), 8 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 14:04:29,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 90 transitions. [2022-04-28 14:04:29,935 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 90 transitions. Word has length 45 [2022-04-28 14:04:29,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:04:29,935 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 90 transitions. [2022-04-28 14:04:29,935 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 6 states have internal predecessors, (33), 6 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-28 14:04:29,935 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 76 states and 90 transitions. [2022-04-28 14:04:36,490 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 90 edges. 87 inductive. 0 not inductive. 3 times theorem prover too weak to decide inductivity. [2022-04-28 14:04:36,490 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 90 transitions. [2022-04-28 14:04:36,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-04-28 14:04:36,490 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:04:36,490 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 14:04:36,506 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2022-04-28 14:04:36,690 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-04-28 14:04:36,691 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:04:36,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:04:36,691 INFO L85 PathProgramCache]: Analyzing trace with hash -1818717446, now seen corresponding path program 7 times [2022-04-28 14:04:36,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:04:36,691 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1588427648] [2022-04-28 14:04:42,747 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 14:04:42,747 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 14:04:42,747 INFO L85 PathProgramCache]: Analyzing trace with hash -1818717446, now seen corresponding path program 8 times [2022-04-28 14:04:42,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:04:42,747 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1940997193] [2022-04-28 14:04:42,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:04:42,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:04:42,758 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 14:04:42,758 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2052559541] [2022-04-28 14:04:42,758 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 14:04:42,758 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 14:04:42,758 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 14:04:42,761 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 14:04:42,762 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-04-28 14:04:42,807 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 14:04:42,807 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 14:04:42,808 INFO L263 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-28 14:04:42,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:04:42,823 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 14:04:43,083 INFO L272 TraceCheckUtils]: 0: Hoare triple {10355#true} call ULTIMATE.init(); {10355#true} is VALID [2022-04-28 14:04:43,083 INFO L290 TraceCheckUtils]: 1: Hoare triple {10355#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(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {10363#(<= ~counter~0 0)} is VALID [2022-04-28 14:04:43,084 INFO L290 TraceCheckUtils]: 2: Hoare triple {10363#(<= ~counter~0 0)} assume true; {10363#(<= ~counter~0 0)} is VALID [2022-04-28 14:04:43,084 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10363#(<= ~counter~0 0)} {10355#true} #77#return; {10363#(<= ~counter~0 0)} is VALID [2022-04-28 14:04:43,085 INFO L272 TraceCheckUtils]: 4: Hoare triple {10363#(<= ~counter~0 0)} call #t~ret7 := main(); {10363#(<= ~counter~0 0)} is VALID [2022-04-28 14:04:43,085 INFO L290 TraceCheckUtils]: 5: Hoare triple {10363#(<= ~counter~0 0)} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {10363#(<= ~counter~0 0)} is VALID [2022-04-28 14:04:43,085 INFO L272 TraceCheckUtils]: 6: Hoare triple {10363#(<= ~counter~0 0)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {10363#(<= ~counter~0 0)} is VALID [2022-04-28 14:04:43,086 INFO L290 TraceCheckUtils]: 7: Hoare triple {10363#(<= ~counter~0 0)} ~cond := #in~cond; {10363#(<= ~counter~0 0)} is VALID [2022-04-28 14:04:43,086 INFO L290 TraceCheckUtils]: 8: Hoare triple {10363#(<= ~counter~0 0)} assume !(0 == ~cond); {10363#(<= ~counter~0 0)} is VALID [2022-04-28 14:04:43,086 INFO L290 TraceCheckUtils]: 9: Hoare triple {10363#(<= ~counter~0 0)} assume true; {10363#(<= ~counter~0 0)} is VALID [2022-04-28 14:04:43,087 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {10363#(<= ~counter~0 0)} {10363#(<= ~counter~0 0)} #69#return; {10363#(<= ~counter~0 0)} is VALID [2022-04-28 14:04:43,087 INFO L290 TraceCheckUtils]: 11: Hoare triple {10363#(<= ~counter~0 0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {10363#(<= ~counter~0 0)} is VALID [2022-04-28 14:04:43,088 INFO L290 TraceCheckUtils]: 12: Hoare triple {10363#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {10397#(<= ~counter~0 1)} is VALID [2022-04-28 14:04:43,088 INFO L290 TraceCheckUtils]: 13: Hoare triple {10397#(<= ~counter~0 1)} assume !!(#t~post6 < 100);havoc #t~post6; {10397#(<= ~counter~0 1)} is VALID [2022-04-28 14:04:43,089 INFO L272 TraceCheckUtils]: 14: Hoare triple {10397#(<= ~counter~0 1)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {10397#(<= ~counter~0 1)} is VALID [2022-04-28 14:04:43,089 INFO L290 TraceCheckUtils]: 15: Hoare triple {10397#(<= ~counter~0 1)} ~cond := #in~cond; {10397#(<= ~counter~0 1)} is VALID [2022-04-28 14:04:43,090 INFO L290 TraceCheckUtils]: 16: Hoare triple {10397#(<= ~counter~0 1)} assume !(0 == ~cond); {10397#(<= ~counter~0 1)} is VALID [2022-04-28 14:04:43,090 INFO L290 TraceCheckUtils]: 17: Hoare triple {10397#(<= ~counter~0 1)} assume true; {10397#(<= ~counter~0 1)} is VALID [2022-04-28 14:04:43,091 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {10397#(<= ~counter~0 1)} {10397#(<= ~counter~0 1)} #71#return; {10397#(<= ~counter~0 1)} is VALID [2022-04-28 14:04:43,091 INFO L290 TraceCheckUtils]: 19: Hoare triple {10397#(<= ~counter~0 1)} assume !!(0 != ~a~0 && 0 != ~b~0); {10397#(<= ~counter~0 1)} is VALID [2022-04-28 14:04:43,091 INFO L290 TraceCheckUtils]: 20: Hoare triple {10397#(<= ~counter~0 1)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {10397#(<= ~counter~0 1)} is VALID [2022-04-28 14:04:43,092 INFO L290 TraceCheckUtils]: 21: Hoare triple {10397#(<= ~counter~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {10425#(<= ~counter~0 2)} is VALID [2022-04-28 14:04:43,092 INFO L290 TraceCheckUtils]: 22: Hoare triple {10425#(<= ~counter~0 2)} assume !!(#t~post6 < 100);havoc #t~post6; {10425#(<= ~counter~0 2)} is VALID [2022-04-28 14:04:43,093 INFO L272 TraceCheckUtils]: 23: Hoare triple {10425#(<= ~counter~0 2)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {10425#(<= ~counter~0 2)} is VALID [2022-04-28 14:04:43,093 INFO L290 TraceCheckUtils]: 24: Hoare triple {10425#(<= ~counter~0 2)} ~cond := #in~cond; {10425#(<= ~counter~0 2)} is VALID [2022-04-28 14:04:43,093 INFO L290 TraceCheckUtils]: 25: Hoare triple {10425#(<= ~counter~0 2)} assume !(0 == ~cond); {10425#(<= ~counter~0 2)} is VALID [2022-04-28 14:04:43,094 INFO L290 TraceCheckUtils]: 26: Hoare triple {10425#(<= ~counter~0 2)} assume true; {10425#(<= ~counter~0 2)} is VALID [2022-04-28 14:04:43,094 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {10425#(<= ~counter~0 2)} {10425#(<= ~counter~0 2)} #71#return; {10425#(<= ~counter~0 2)} is VALID [2022-04-28 14:04:43,095 INFO L290 TraceCheckUtils]: 28: Hoare triple {10425#(<= ~counter~0 2)} assume !!(0 != ~a~0 && 0 != ~b~0); {10425#(<= ~counter~0 2)} is VALID [2022-04-28 14:04:43,095 INFO L290 TraceCheckUtils]: 29: Hoare triple {10425#(<= ~counter~0 2)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {10425#(<= ~counter~0 2)} is VALID [2022-04-28 14:04:43,096 INFO L290 TraceCheckUtils]: 30: Hoare triple {10425#(<= ~counter~0 2)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {10453#(<= ~counter~0 3)} is VALID [2022-04-28 14:04:43,096 INFO L290 TraceCheckUtils]: 31: Hoare triple {10453#(<= ~counter~0 3)} assume !!(#t~post6 < 100);havoc #t~post6; {10453#(<= ~counter~0 3)} is VALID [2022-04-28 14:04:43,097 INFO L272 TraceCheckUtils]: 32: Hoare triple {10453#(<= ~counter~0 3)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {10453#(<= ~counter~0 3)} is VALID [2022-04-28 14:04:43,097 INFO L290 TraceCheckUtils]: 33: Hoare triple {10453#(<= ~counter~0 3)} ~cond := #in~cond; {10453#(<= ~counter~0 3)} is VALID [2022-04-28 14:04:43,098 INFO L290 TraceCheckUtils]: 34: Hoare triple {10453#(<= ~counter~0 3)} assume !(0 == ~cond); {10453#(<= ~counter~0 3)} is VALID [2022-04-28 14:04:43,098 INFO L290 TraceCheckUtils]: 35: Hoare triple {10453#(<= ~counter~0 3)} assume true; {10453#(<= ~counter~0 3)} is VALID [2022-04-28 14:04:43,099 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {10453#(<= ~counter~0 3)} {10453#(<= ~counter~0 3)} #71#return; {10453#(<= ~counter~0 3)} is VALID [2022-04-28 14:04:43,099 INFO L290 TraceCheckUtils]: 37: Hoare triple {10453#(<= ~counter~0 3)} assume !!(0 != ~a~0 && 0 != ~b~0); {10453#(<= ~counter~0 3)} is VALID [2022-04-28 14:04:43,099 INFO L290 TraceCheckUtils]: 38: Hoare triple {10453#(<= ~counter~0 3)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {10453#(<= ~counter~0 3)} is VALID [2022-04-28 14:04:43,100 INFO L290 TraceCheckUtils]: 39: Hoare triple {10453#(<= ~counter~0 3)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {10481#(<= ~counter~0 4)} is VALID [2022-04-28 14:04:43,100 INFO L290 TraceCheckUtils]: 40: Hoare triple {10481#(<= ~counter~0 4)} assume !!(#t~post6 < 100);havoc #t~post6; {10481#(<= ~counter~0 4)} is VALID [2022-04-28 14:04:43,101 INFO L272 TraceCheckUtils]: 41: Hoare triple {10481#(<= ~counter~0 4)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {10481#(<= ~counter~0 4)} is VALID [2022-04-28 14:04:43,102 INFO L290 TraceCheckUtils]: 42: Hoare triple {10481#(<= ~counter~0 4)} ~cond := #in~cond; {10481#(<= ~counter~0 4)} is VALID [2022-04-28 14:04:43,102 INFO L290 TraceCheckUtils]: 43: Hoare triple {10481#(<= ~counter~0 4)} assume !(0 == ~cond); {10481#(<= ~counter~0 4)} is VALID [2022-04-28 14:04:43,102 INFO L290 TraceCheckUtils]: 44: Hoare triple {10481#(<= ~counter~0 4)} assume true; {10481#(<= ~counter~0 4)} is VALID [2022-04-28 14:04:43,103 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {10481#(<= ~counter~0 4)} {10481#(<= ~counter~0 4)} #71#return; {10481#(<= ~counter~0 4)} is VALID [2022-04-28 14:04:43,104 INFO L290 TraceCheckUtils]: 46: Hoare triple {10481#(<= ~counter~0 4)} assume !!(0 != ~a~0 && 0 != ~b~0); {10481#(<= ~counter~0 4)} is VALID [2022-04-28 14:04:43,104 INFO L290 TraceCheckUtils]: 47: Hoare triple {10481#(<= ~counter~0 4)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {10481#(<= ~counter~0 4)} is VALID [2022-04-28 14:04:43,105 INFO L290 TraceCheckUtils]: 48: Hoare triple {10481#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {10509#(<= |main_#t~post6| 4)} is VALID [2022-04-28 14:04:43,105 INFO L290 TraceCheckUtils]: 49: Hoare triple {10509#(<= |main_#t~post6| 4)} assume !(#t~post6 < 100);havoc #t~post6; {10356#false} is VALID [2022-04-28 14:04:43,105 INFO L272 TraceCheckUtils]: 50: Hoare triple {10356#false} call __VERIFIER_assert((if ~q~0 == ~x~0 * ~y~0 then 1 else 0)); {10356#false} is VALID [2022-04-28 14:04:43,105 INFO L290 TraceCheckUtils]: 51: Hoare triple {10356#false} ~cond := #in~cond; {10356#false} is VALID [2022-04-28 14:04:43,105 INFO L290 TraceCheckUtils]: 52: Hoare triple {10356#false} assume 0 == ~cond; {10356#false} is VALID [2022-04-28 14:04:43,105 INFO L290 TraceCheckUtils]: 53: Hoare triple {10356#false} assume !false; {10356#false} is VALID [2022-04-28 14:04:43,106 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 8 proven. 62 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 14:04:43,106 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 14:04:43,368 INFO L290 TraceCheckUtils]: 53: Hoare triple {10356#false} assume !false; {10356#false} is VALID [2022-04-28 14:04:43,368 INFO L290 TraceCheckUtils]: 52: Hoare triple {10356#false} assume 0 == ~cond; {10356#false} is VALID [2022-04-28 14:04:43,368 INFO L290 TraceCheckUtils]: 51: Hoare triple {10356#false} ~cond := #in~cond; {10356#false} is VALID [2022-04-28 14:04:43,368 INFO L272 TraceCheckUtils]: 50: Hoare triple {10356#false} call __VERIFIER_assert((if ~q~0 == ~x~0 * ~y~0 then 1 else 0)); {10356#false} is VALID [2022-04-28 14:04:43,368 INFO L290 TraceCheckUtils]: 49: Hoare triple {10537#(< |main_#t~post6| 100)} assume !(#t~post6 < 100);havoc #t~post6; {10356#false} is VALID [2022-04-28 14:04:43,369 INFO L290 TraceCheckUtils]: 48: Hoare triple {10541#(< ~counter~0 100)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {10537#(< |main_#t~post6| 100)} is VALID [2022-04-28 14:04:43,369 INFO L290 TraceCheckUtils]: 47: Hoare triple {10541#(< ~counter~0 100)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {10541#(< ~counter~0 100)} is VALID [2022-04-28 14:04:43,369 INFO L290 TraceCheckUtils]: 46: Hoare triple {10541#(< ~counter~0 100)} assume !!(0 != ~a~0 && 0 != ~b~0); {10541#(< ~counter~0 100)} is VALID [2022-04-28 14:04:43,370 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {10355#true} {10541#(< ~counter~0 100)} #71#return; {10541#(< ~counter~0 100)} is VALID [2022-04-28 14:04:43,370 INFO L290 TraceCheckUtils]: 44: Hoare triple {10355#true} assume true; {10355#true} is VALID [2022-04-28 14:04:43,370 INFO L290 TraceCheckUtils]: 43: Hoare triple {10355#true} assume !(0 == ~cond); {10355#true} is VALID [2022-04-28 14:04:43,370 INFO L290 TraceCheckUtils]: 42: Hoare triple {10355#true} ~cond := #in~cond; {10355#true} is VALID [2022-04-28 14:04:43,370 INFO L272 TraceCheckUtils]: 41: Hoare triple {10541#(< ~counter~0 100)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {10355#true} is VALID [2022-04-28 14:04:43,370 INFO L290 TraceCheckUtils]: 40: Hoare triple {10541#(< ~counter~0 100)} assume !!(#t~post6 < 100);havoc #t~post6; {10541#(< ~counter~0 100)} is VALID [2022-04-28 14:04:43,371 INFO L290 TraceCheckUtils]: 39: Hoare triple {10569#(< ~counter~0 99)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {10541#(< ~counter~0 100)} is VALID [2022-04-28 14:04:43,371 INFO L290 TraceCheckUtils]: 38: Hoare triple {10569#(< ~counter~0 99)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {10569#(< ~counter~0 99)} is VALID [2022-04-28 14:04:43,371 INFO L290 TraceCheckUtils]: 37: Hoare triple {10569#(< ~counter~0 99)} assume !!(0 != ~a~0 && 0 != ~b~0); {10569#(< ~counter~0 99)} is VALID [2022-04-28 14:04:43,372 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {10355#true} {10569#(< ~counter~0 99)} #71#return; {10569#(< ~counter~0 99)} is VALID [2022-04-28 14:04:43,372 INFO L290 TraceCheckUtils]: 35: Hoare triple {10355#true} assume true; {10355#true} is VALID [2022-04-28 14:04:43,372 INFO L290 TraceCheckUtils]: 34: Hoare triple {10355#true} assume !(0 == ~cond); {10355#true} is VALID [2022-04-28 14:04:43,372 INFO L290 TraceCheckUtils]: 33: Hoare triple {10355#true} ~cond := #in~cond; {10355#true} is VALID [2022-04-28 14:04:43,372 INFO L272 TraceCheckUtils]: 32: Hoare triple {10569#(< ~counter~0 99)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {10355#true} is VALID [2022-04-28 14:04:43,372 INFO L290 TraceCheckUtils]: 31: Hoare triple {10569#(< ~counter~0 99)} assume !!(#t~post6 < 100);havoc #t~post6; {10569#(< ~counter~0 99)} is VALID [2022-04-28 14:04:43,373 INFO L290 TraceCheckUtils]: 30: Hoare triple {10597#(< ~counter~0 98)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {10569#(< ~counter~0 99)} is VALID [2022-04-28 14:04:43,373 INFO L290 TraceCheckUtils]: 29: Hoare triple {10597#(< ~counter~0 98)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {10597#(< ~counter~0 98)} is VALID [2022-04-28 14:04:43,373 INFO L290 TraceCheckUtils]: 28: Hoare triple {10597#(< ~counter~0 98)} assume !!(0 != ~a~0 && 0 != ~b~0); {10597#(< ~counter~0 98)} is VALID [2022-04-28 14:04:43,374 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {10355#true} {10597#(< ~counter~0 98)} #71#return; {10597#(< ~counter~0 98)} is VALID [2022-04-28 14:04:43,374 INFO L290 TraceCheckUtils]: 26: Hoare triple {10355#true} assume true; {10355#true} is VALID [2022-04-28 14:04:43,374 INFO L290 TraceCheckUtils]: 25: Hoare triple {10355#true} assume !(0 == ~cond); {10355#true} is VALID [2022-04-28 14:04:43,374 INFO L290 TraceCheckUtils]: 24: Hoare triple {10355#true} ~cond := #in~cond; {10355#true} is VALID [2022-04-28 14:04:43,374 INFO L272 TraceCheckUtils]: 23: Hoare triple {10597#(< ~counter~0 98)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {10355#true} is VALID [2022-04-28 14:04:43,375 INFO L290 TraceCheckUtils]: 22: Hoare triple {10597#(< ~counter~0 98)} assume !!(#t~post6 < 100);havoc #t~post6; {10597#(< ~counter~0 98)} is VALID [2022-04-28 14:04:43,376 INFO L290 TraceCheckUtils]: 21: Hoare triple {10625#(< ~counter~0 97)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {10597#(< ~counter~0 98)} is VALID [2022-04-28 14:04:43,376 INFO L290 TraceCheckUtils]: 20: Hoare triple {10625#(< ~counter~0 97)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {10625#(< ~counter~0 97)} is VALID [2022-04-28 14:04:43,376 INFO L290 TraceCheckUtils]: 19: Hoare triple {10625#(< ~counter~0 97)} assume !!(0 != ~a~0 && 0 != ~b~0); {10625#(< ~counter~0 97)} is VALID [2022-04-28 14:04:43,377 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {10355#true} {10625#(< ~counter~0 97)} #71#return; {10625#(< ~counter~0 97)} is VALID [2022-04-28 14:04:43,377 INFO L290 TraceCheckUtils]: 17: Hoare triple {10355#true} assume true; {10355#true} is VALID [2022-04-28 14:04:43,377 INFO L290 TraceCheckUtils]: 16: Hoare triple {10355#true} assume !(0 == ~cond); {10355#true} is VALID [2022-04-28 14:04:43,377 INFO L290 TraceCheckUtils]: 15: Hoare triple {10355#true} ~cond := #in~cond; {10355#true} is VALID [2022-04-28 14:04:43,377 INFO L272 TraceCheckUtils]: 14: Hoare triple {10625#(< ~counter~0 97)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {10355#true} is VALID [2022-04-28 14:04:43,378 INFO L290 TraceCheckUtils]: 13: Hoare triple {10625#(< ~counter~0 97)} assume !!(#t~post6 < 100);havoc #t~post6; {10625#(< ~counter~0 97)} is VALID [2022-04-28 14:04:43,378 INFO L290 TraceCheckUtils]: 12: Hoare triple {10653#(< ~counter~0 96)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {10625#(< ~counter~0 97)} is VALID [2022-04-28 14:04:43,378 INFO L290 TraceCheckUtils]: 11: Hoare triple {10653#(< ~counter~0 96)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {10653#(< ~counter~0 96)} is VALID [2022-04-28 14:04:43,379 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {10355#true} {10653#(< ~counter~0 96)} #69#return; {10653#(< ~counter~0 96)} is VALID [2022-04-28 14:04:43,379 INFO L290 TraceCheckUtils]: 9: Hoare triple {10355#true} assume true; {10355#true} is VALID [2022-04-28 14:04:43,379 INFO L290 TraceCheckUtils]: 8: Hoare triple {10355#true} assume !(0 == ~cond); {10355#true} is VALID [2022-04-28 14:04:43,379 INFO L290 TraceCheckUtils]: 7: Hoare triple {10355#true} ~cond := #in~cond; {10355#true} is VALID [2022-04-28 14:04:43,379 INFO L272 TraceCheckUtils]: 6: Hoare triple {10653#(< ~counter~0 96)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {10355#true} is VALID [2022-04-28 14:04:43,379 INFO L290 TraceCheckUtils]: 5: Hoare triple {10653#(< ~counter~0 96)} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {10653#(< ~counter~0 96)} is VALID [2022-04-28 14:04:43,380 INFO L272 TraceCheckUtils]: 4: Hoare triple {10653#(< ~counter~0 96)} call #t~ret7 := main(); {10653#(< ~counter~0 96)} is VALID [2022-04-28 14:04:43,380 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10653#(< ~counter~0 96)} {10355#true} #77#return; {10653#(< ~counter~0 96)} is VALID [2022-04-28 14:04:43,380 INFO L290 TraceCheckUtils]: 2: Hoare triple {10653#(< ~counter~0 96)} assume true; {10653#(< ~counter~0 96)} is VALID [2022-04-28 14:04:43,381 INFO L290 TraceCheckUtils]: 1: Hoare triple {10355#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(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {10653#(< ~counter~0 96)} is VALID [2022-04-28 14:04:43,381 INFO L272 TraceCheckUtils]: 0: Hoare triple {10355#true} call ULTIMATE.init(); {10355#true} is VALID [2022-04-28 14:04:43,381 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 8 proven. 38 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-28 14:04:43,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:04:43,381 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1940997193] [2022-04-28 14:04:43,381 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 14:04:43,381 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2052559541] [2022-04-28 14:04:43,382 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2052559541] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 14:04:43,382 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 14:04:43,382 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2022-04-28 14:04:43,382 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:04:43,382 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1588427648] [2022-04-28 14:04:43,382 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1588427648] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:04:43,382 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:04:43,382 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 14:04:43,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [378379569] [2022-04-28 14:04:43,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:04:43,383 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.0) internal successors, (40), 7 states have internal predecessors, (40), 7 states have call successors, (8), 7 states have call predecessors, (8), 5 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) Word has length 54 [2022-04-28 14:04:43,383 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:04:43,383 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 5.0) internal successors, (40), 7 states have internal predecessors, (40), 7 states have call successors, (8), 7 states have call predecessors, (8), 5 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-28 14:04:43,421 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:04:43,421 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-28 14:04:43,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:04:43,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-28 14:04:43,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2022-04-28 14:04:43,422 INFO L87 Difference]: Start difference. First operand 76 states and 90 transitions. Second operand has 8 states, 8 states have (on average 5.0) internal successors, (40), 7 states have internal predecessors, (40), 7 states have call successors, (8), 7 states have call predecessors, (8), 5 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-28 14:04:43,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:04:43,709 INFO L93 Difference]: Finished difference Result 95 states and 113 transitions. [2022-04-28 14:04:43,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-28 14:04:43,709 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.0) internal successors, (40), 7 states have internal predecessors, (40), 7 states have call successors, (8), 7 states have call predecessors, (8), 5 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) Word has length 54 [2022-04-28 14:04:43,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:04:43,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 5.0) internal successors, (40), 7 states have internal predecessors, (40), 7 states have call successors, (8), 7 states have call predecessors, (8), 5 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-28 14:04:43,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 99 transitions. [2022-04-28 14:04:43,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 5.0) internal successors, (40), 7 states have internal predecessors, (40), 7 states have call successors, (8), 7 states have call predecessors, (8), 5 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-28 14:04:43,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 99 transitions. [2022-04-28 14:04:43,713 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 99 transitions. [2022-04-28 14:04:43,805 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 99 edges. 99 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:04:43,807 INFO L225 Difference]: With dead ends: 95 [2022-04-28 14:04:43,807 INFO L226 Difference]: Without dead ends: 87 [2022-04-28 14:04:43,807 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=123, Invalid=183, Unknown=0, NotChecked=0, Total=306 [2022-04-28 14:04:43,807 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 53 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 14:04:43,808 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 134 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 14:04:43,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2022-04-28 14:04:43,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2022-04-28 14:04:43,927 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:04:43,928 INFO L82 GeneralOperation]: Start isEquivalent. First operand 87 states. Second operand has 87 states, 66 states have (on average 1.2727272727272727) internal successors, (84), 67 states have internal predecessors, (84), 11 states have call successors, (11), 10 states have call predecessors, (11), 9 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-28 14:04:43,928 INFO L74 IsIncluded]: Start isIncluded. First operand 87 states. Second operand has 87 states, 66 states have (on average 1.2727272727272727) internal successors, (84), 67 states have internal predecessors, (84), 11 states have call successors, (11), 10 states have call predecessors, (11), 9 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-28 14:04:43,928 INFO L87 Difference]: Start difference. First operand 87 states. Second operand has 87 states, 66 states have (on average 1.2727272727272727) internal successors, (84), 67 states have internal predecessors, (84), 11 states have call successors, (11), 10 states have call predecessors, (11), 9 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-28 14:04:43,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:04:43,929 INFO L93 Difference]: Finished difference Result 87 states and 104 transitions. [2022-04-28 14:04:43,929 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 104 transitions. [2022-04-28 14:04:43,929 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:04:43,929 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:04:43,929 INFO L74 IsIncluded]: Start isIncluded. First operand has 87 states, 66 states have (on average 1.2727272727272727) internal successors, (84), 67 states have internal predecessors, (84), 11 states have call successors, (11), 10 states have call predecessors, (11), 9 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand 87 states. [2022-04-28 14:04:43,929 INFO L87 Difference]: Start difference. First operand has 87 states, 66 states have (on average 1.2727272727272727) internal successors, (84), 67 states have internal predecessors, (84), 11 states have call successors, (11), 10 states have call predecessors, (11), 9 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand 87 states. [2022-04-28 14:04:43,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:04:43,931 INFO L93 Difference]: Finished difference Result 87 states and 104 transitions. [2022-04-28 14:04:43,931 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 104 transitions. [2022-04-28 14:04:43,931 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:04:43,931 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:04:43,931 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:04:43,931 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:04:43,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 66 states have (on average 1.2727272727272727) internal successors, (84), 67 states have internal predecessors, (84), 11 states have call successors, (11), 10 states have call predecessors, (11), 9 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-28 14:04:43,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 104 transitions. [2022-04-28 14:04:43,933 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 104 transitions. Word has length 54 [2022-04-28 14:04:43,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:04:43,933 INFO L495 AbstractCegarLoop]: Abstraction has 87 states and 104 transitions. [2022-04-28 14:04:43,933 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.0) internal successors, (40), 7 states have internal predecessors, (40), 7 states have call successors, (8), 7 states have call predecessors, (8), 5 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-28 14:04:43,933 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 87 states and 104 transitions. [2022-04-28 14:04:52,635 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 104 edges. 100 inductive. 0 not inductive. 4 times theorem prover too weak to decide inductivity. [2022-04-28 14:04:52,635 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 104 transitions. [2022-04-28 14:04:52,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-04-28 14:04:52,636 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:04:52,636 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 14:04:52,652 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-04-28 14:04:52,836 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-04-28 14:04:52,836 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:04:52,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:04:52,837 INFO L85 PathProgramCache]: Analyzing trace with hash -323774, now seen corresponding path program 9 times [2022-04-28 14:04:52,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:04:52,837 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1804530801] [2022-04-28 14:04:58,885 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 14:04:58,886 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 14:04:58,886 INFO L85 PathProgramCache]: Analyzing trace with hash -323774, now seen corresponding path program 10 times [2022-04-28 14:04:58,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:04:58,886 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1685224107] [2022-04-28 14:04:58,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:04:58,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:04:58,897 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 14:04:58,897 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [730818620] [2022-04-28 14:04:58,897 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 14:04:58,897 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 14:04:58,897 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 14:04:58,900 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 14:04:58,901 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-04-28 14:04:59,014 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 14:04:59,014 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 14:04:59,015 INFO L263 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 15 conjunts are in the unsatisfiable core [2022-04-28 14:04:59,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:04:59,029 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 14:04:59,317 INFO L272 TraceCheckUtils]: 0: Hoare triple {11238#true} call ULTIMATE.init(); {11238#true} is VALID [2022-04-28 14:04:59,318 INFO L290 TraceCheckUtils]: 1: Hoare triple {11238#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(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {11246#(<= ~counter~0 0)} is VALID [2022-04-28 14:04:59,318 INFO L290 TraceCheckUtils]: 2: Hoare triple {11246#(<= ~counter~0 0)} assume true; {11246#(<= ~counter~0 0)} is VALID [2022-04-28 14:04:59,318 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11246#(<= ~counter~0 0)} {11238#true} #77#return; {11246#(<= ~counter~0 0)} is VALID [2022-04-28 14:04:59,319 INFO L272 TraceCheckUtils]: 4: Hoare triple {11246#(<= ~counter~0 0)} call #t~ret7 := main(); {11246#(<= ~counter~0 0)} is VALID [2022-04-28 14:04:59,319 INFO L290 TraceCheckUtils]: 5: Hoare triple {11246#(<= ~counter~0 0)} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {11246#(<= ~counter~0 0)} is VALID [2022-04-28 14:04:59,319 INFO L272 TraceCheckUtils]: 6: Hoare triple {11246#(<= ~counter~0 0)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {11246#(<= ~counter~0 0)} is VALID [2022-04-28 14:04:59,320 INFO L290 TraceCheckUtils]: 7: Hoare triple {11246#(<= ~counter~0 0)} ~cond := #in~cond; {11246#(<= ~counter~0 0)} is VALID [2022-04-28 14:04:59,320 INFO L290 TraceCheckUtils]: 8: Hoare triple {11246#(<= ~counter~0 0)} assume !(0 == ~cond); {11246#(<= ~counter~0 0)} is VALID [2022-04-28 14:04:59,320 INFO L290 TraceCheckUtils]: 9: Hoare triple {11246#(<= ~counter~0 0)} assume true; {11246#(<= ~counter~0 0)} is VALID [2022-04-28 14:04:59,321 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {11246#(<= ~counter~0 0)} {11246#(<= ~counter~0 0)} #69#return; {11246#(<= ~counter~0 0)} is VALID [2022-04-28 14:04:59,321 INFO L290 TraceCheckUtils]: 11: Hoare triple {11246#(<= ~counter~0 0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {11246#(<= ~counter~0 0)} is VALID [2022-04-28 14:04:59,321 INFO L290 TraceCheckUtils]: 12: Hoare triple {11246#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {11280#(<= ~counter~0 1)} is VALID [2022-04-28 14:04:59,322 INFO L290 TraceCheckUtils]: 13: Hoare triple {11280#(<= ~counter~0 1)} assume !!(#t~post6 < 100);havoc #t~post6; {11280#(<= ~counter~0 1)} is VALID [2022-04-28 14:04:59,322 INFO L272 TraceCheckUtils]: 14: Hoare triple {11280#(<= ~counter~0 1)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {11280#(<= ~counter~0 1)} is VALID [2022-04-28 14:04:59,322 INFO L290 TraceCheckUtils]: 15: Hoare triple {11280#(<= ~counter~0 1)} ~cond := #in~cond; {11280#(<= ~counter~0 1)} is VALID [2022-04-28 14:04:59,323 INFO L290 TraceCheckUtils]: 16: Hoare triple {11280#(<= ~counter~0 1)} assume !(0 == ~cond); {11280#(<= ~counter~0 1)} is VALID [2022-04-28 14:04:59,323 INFO L290 TraceCheckUtils]: 17: Hoare triple {11280#(<= ~counter~0 1)} assume true; {11280#(<= ~counter~0 1)} is VALID [2022-04-28 14:04:59,323 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {11280#(<= ~counter~0 1)} {11280#(<= ~counter~0 1)} #71#return; {11280#(<= ~counter~0 1)} is VALID [2022-04-28 14:04:59,324 INFO L290 TraceCheckUtils]: 19: Hoare triple {11280#(<= ~counter~0 1)} assume !!(0 != ~a~0 && 0 != ~b~0); {11280#(<= ~counter~0 1)} is VALID [2022-04-28 14:04:59,324 INFO L290 TraceCheckUtils]: 20: Hoare triple {11280#(<= ~counter~0 1)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {11280#(<= ~counter~0 1)} is VALID [2022-04-28 14:04:59,324 INFO L290 TraceCheckUtils]: 21: Hoare triple {11280#(<= ~counter~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {11308#(<= ~counter~0 2)} is VALID [2022-04-28 14:04:59,325 INFO L290 TraceCheckUtils]: 22: Hoare triple {11308#(<= ~counter~0 2)} assume !!(#t~post6 < 100);havoc #t~post6; {11308#(<= ~counter~0 2)} is VALID [2022-04-28 14:04:59,325 INFO L272 TraceCheckUtils]: 23: Hoare triple {11308#(<= ~counter~0 2)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {11308#(<= ~counter~0 2)} is VALID [2022-04-28 14:04:59,325 INFO L290 TraceCheckUtils]: 24: Hoare triple {11308#(<= ~counter~0 2)} ~cond := #in~cond; {11308#(<= ~counter~0 2)} is VALID [2022-04-28 14:04:59,326 INFO L290 TraceCheckUtils]: 25: Hoare triple {11308#(<= ~counter~0 2)} assume !(0 == ~cond); {11308#(<= ~counter~0 2)} is VALID [2022-04-28 14:04:59,326 INFO L290 TraceCheckUtils]: 26: Hoare triple {11308#(<= ~counter~0 2)} assume true; {11308#(<= ~counter~0 2)} is VALID [2022-04-28 14:04:59,327 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {11308#(<= ~counter~0 2)} {11308#(<= ~counter~0 2)} #71#return; {11308#(<= ~counter~0 2)} is VALID [2022-04-28 14:04:59,327 INFO L290 TraceCheckUtils]: 28: Hoare triple {11308#(<= ~counter~0 2)} assume !!(0 != ~a~0 && 0 != ~b~0); {11308#(<= ~counter~0 2)} is VALID [2022-04-28 14:04:59,327 INFO L290 TraceCheckUtils]: 29: Hoare triple {11308#(<= ~counter~0 2)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {11308#(<= ~counter~0 2)} is VALID [2022-04-28 14:04:59,327 INFO L290 TraceCheckUtils]: 30: Hoare triple {11308#(<= ~counter~0 2)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {11336#(<= ~counter~0 3)} is VALID [2022-04-28 14:04:59,328 INFO L290 TraceCheckUtils]: 31: Hoare triple {11336#(<= ~counter~0 3)} assume !!(#t~post6 < 100);havoc #t~post6; {11336#(<= ~counter~0 3)} is VALID [2022-04-28 14:04:59,328 INFO L272 TraceCheckUtils]: 32: Hoare triple {11336#(<= ~counter~0 3)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {11336#(<= ~counter~0 3)} is VALID [2022-04-28 14:04:59,329 INFO L290 TraceCheckUtils]: 33: Hoare triple {11336#(<= ~counter~0 3)} ~cond := #in~cond; {11336#(<= ~counter~0 3)} is VALID [2022-04-28 14:04:59,329 INFO L290 TraceCheckUtils]: 34: Hoare triple {11336#(<= ~counter~0 3)} assume !(0 == ~cond); {11336#(<= ~counter~0 3)} is VALID [2022-04-28 14:04:59,330 INFO L290 TraceCheckUtils]: 35: Hoare triple {11336#(<= ~counter~0 3)} assume true; {11336#(<= ~counter~0 3)} is VALID [2022-04-28 14:04:59,330 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {11336#(<= ~counter~0 3)} {11336#(<= ~counter~0 3)} #71#return; {11336#(<= ~counter~0 3)} is VALID [2022-04-28 14:04:59,330 INFO L290 TraceCheckUtils]: 37: Hoare triple {11336#(<= ~counter~0 3)} assume !!(0 != ~a~0 && 0 != ~b~0); {11336#(<= ~counter~0 3)} is VALID [2022-04-28 14:04:59,331 INFO L290 TraceCheckUtils]: 38: Hoare triple {11336#(<= ~counter~0 3)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {11336#(<= ~counter~0 3)} is VALID [2022-04-28 14:04:59,331 INFO L290 TraceCheckUtils]: 39: Hoare triple {11336#(<= ~counter~0 3)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {11364#(<= ~counter~0 4)} is VALID [2022-04-28 14:04:59,332 INFO L290 TraceCheckUtils]: 40: Hoare triple {11364#(<= ~counter~0 4)} assume !!(#t~post6 < 100);havoc #t~post6; {11364#(<= ~counter~0 4)} is VALID [2022-04-28 14:04:59,332 INFO L272 TraceCheckUtils]: 41: Hoare triple {11364#(<= ~counter~0 4)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {11364#(<= ~counter~0 4)} is VALID [2022-04-28 14:04:59,332 INFO L290 TraceCheckUtils]: 42: Hoare triple {11364#(<= ~counter~0 4)} ~cond := #in~cond; {11364#(<= ~counter~0 4)} is VALID [2022-04-28 14:04:59,333 INFO L290 TraceCheckUtils]: 43: Hoare triple {11364#(<= ~counter~0 4)} assume !(0 == ~cond); {11364#(<= ~counter~0 4)} is VALID [2022-04-28 14:04:59,333 INFO L290 TraceCheckUtils]: 44: Hoare triple {11364#(<= ~counter~0 4)} assume true; {11364#(<= ~counter~0 4)} is VALID [2022-04-28 14:04:59,334 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {11364#(<= ~counter~0 4)} {11364#(<= ~counter~0 4)} #71#return; {11364#(<= ~counter~0 4)} is VALID [2022-04-28 14:04:59,334 INFO L290 TraceCheckUtils]: 46: Hoare triple {11364#(<= ~counter~0 4)} assume !!(0 != ~a~0 && 0 != ~b~0); {11364#(<= ~counter~0 4)} is VALID [2022-04-28 14:04:59,334 INFO L290 TraceCheckUtils]: 47: Hoare triple {11364#(<= ~counter~0 4)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {11364#(<= ~counter~0 4)} is VALID [2022-04-28 14:04:59,334 INFO L290 TraceCheckUtils]: 48: Hoare triple {11364#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {11392#(<= ~counter~0 5)} is VALID [2022-04-28 14:04:59,335 INFO L290 TraceCheckUtils]: 49: Hoare triple {11392#(<= ~counter~0 5)} assume !!(#t~post6 < 100);havoc #t~post6; {11392#(<= ~counter~0 5)} is VALID [2022-04-28 14:04:59,335 INFO L272 TraceCheckUtils]: 50: Hoare triple {11392#(<= ~counter~0 5)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {11392#(<= ~counter~0 5)} is VALID [2022-04-28 14:04:59,336 INFO L290 TraceCheckUtils]: 51: Hoare triple {11392#(<= ~counter~0 5)} ~cond := #in~cond; {11392#(<= ~counter~0 5)} is VALID [2022-04-28 14:04:59,336 INFO L290 TraceCheckUtils]: 52: Hoare triple {11392#(<= ~counter~0 5)} assume !(0 == ~cond); {11392#(<= ~counter~0 5)} is VALID [2022-04-28 14:04:59,336 INFO L290 TraceCheckUtils]: 53: Hoare triple {11392#(<= ~counter~0 5)} assume true; {11392#(<= ~counter~0 5)} is VALID [2022-04-28 14:04:59,337 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {11392#(<= ~counter~0 5)} {11392#(<= ~counter~0 5)} #71#return; {11392#(<= ~counter~0 5)} is VALID [2022-04-28 14:04:59,337 INFO L290 TraceCheckUtils]: 55: Hoare triple {11392#(<= ~counter~0 5)} assume !!(0 != ~a~0 && 0 != ~b~0); {11392#(<= ~counter~0 5)} is VALID [2022-04-28 14:04:59,337 INFO L290 TraceCheckUtils]: 56: Hoare triple {11392#(<= ~counter~0 5)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {11392#(<= ~counter~0 5)} is VALID [2022-04-28 14:04:59,337 INFO L290 TraceCheckUtils]: 57: Hoare triple {11392#(<= ~counter~0 5)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {11420#(<= |main_#t~post6| 5)} is VALID [2022-04-28 14:04:59,338 INFO L290 TraceCheckUtils]: 58: Hoare triple {11420#(<= |main_#t~post6| 5)} assume !(#t~post6 < 100);havoc #t~post6; {11239#false} is VALID [2022-04-28 14:04:59,338 INFO L272 TraceCheckUtils]: 59: Hoare triple {11239#false} call __VERIFIER_assert((if ~q~0 == ~x~0 * ~y~0 then 1 else 0)); {11239#false} is VALID [2022-04-28 14:04:59,338 INFO L290 TraceCheckUtils]: 60: Hoare triple {11239#false} ~cond := #in~cond; {11239#false} is VALID [2022-04-28 14:04:59,338 INFO L290 TraceCheckUtils]: 61: Hoare triple {11239#false} assume 0 == ~cond; {11239#false} is VALID [2022-04-28 14:04:59,338 INFO L290 TraceCheckUtils]: 62: Hoare triple {11239#false} assume !false; {11239#false} is VALID [2022-04-28 14:04:59,338 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 10 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 14:04:59,338 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 14:04:59,729 INFO L290 TraceCheckUtils]: 62: Hoare triple {11239#false} assume !false; {11239#false} is VALID [2022-04-28 14:04:59,729 INFO L290 TraceCheckUtils]: 61: Hoare triple {11239#false} assume 0 == ~cond; {11239#false} is VALID [2022-04-28 14:04:59,729 INFO L290 TraceCheckUtils]: 60: Hoare triple {11239#false} ~cond := #in~cond; {11239#false} is VALID [2022-04-28 14:04:59,729 INFO L272 TraceCheckUtils]: 59: Hoare triple {11239#false} call __VERIFIER_assert((if ~q~0 == ~x~0 * ~y~0 then 1 else 0)); {11239#false} is VALID [2022-04-28 14:04:59,730 INFO L290 TraceCheckUtils]: 58: Hoare triple {11448#(< |main_#t~post6| 100)} assume !(#t~post6 < 100);havoc #t~post6; {11239#false} is VALID [2022-04-28 14:04:59,730 INFO L290 TraceCheckUtils]: 57: Hoare triple {11452#(< ~counter~0 100)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {11448#(< |main_#t~post6| 100)} is VALID [2022-04-28 14:04:59,730 INFO L290 TraceCheckUtils]: 56: Hoare triple {11452#(< ~counter~0 100)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {11452#(< ~counter~0 100)} is VALID [2022-04-28 14:04:59,731 INFO L290 TraceCheckUtils]: 55: Hoare triple {11452#(< ~counter~0 100)} assume !!(0 != ~a~0 && 0 != ~b~0); {11452#(< ~counter~0 100)} is VALID [2022-04-28 14:04:59,731 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {11238#true} {11452#(< ~counter~0 100)} #71#return; {11452#(< ~counter~0 100)} is VALID [2022-04-28 14:04:59,731 INFO L290 TraceCheckUtils]: 53: Hoare triple {11238#true} assume true; {11238#true} is VALID [2022-04-28 14:04:59,731 INFO L290 TraceCheckUtils]: 52: Hoare triple {11238#true} assume !(0 == ~cond); {11238#true} is VALID [2022-04-28 14:04:59,731 INFO L290 TraceCheckUtils]: 51: Hoare triple {11238#true} ~cond := #in~cond; {11238#true} is VALID [2022-04-28 14:04:59,731 INFO L272 TraceCheckUtils]: 50: Hoare triple {11452#(< ~counter~0 100)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {11238#true} is VALID [2022-04-28 14:04:59,732 INFO L290 TraceCheckUtils]: 49: Hoare triple {11452#(< ~counter~0 100)} assume !!(#t~post6 < 100);havoc #t~post6; {11452#(< ~counter~0 100)} is VALID [2022-04-28 14:04:59,732 INFO L290 TraceCheckUtils]: 48: Hoare triple {11480#(< ~counter~0 99)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {11452#(< ~counter~0 100)} is VALID [2022-04-28 14:04:59,732 INFO L290 TraceCheckUtils]: 47: Hoare triple {11480#(< ~counter~0 99)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {11480#(< ~counter~0 99)} is VALID [2022-04-28 14:04:59,733 INFO L290 TraceCheckUtils]: 46: Hoare triple {11480#(< ~counter~0 99)} assume !!(0 != ~a~0 && 0 != ~b~0); {11480#(< ~counter~0 99)} is VALID [2022-04-28 14:04:59,733 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {11238#true} {11480#(< ~counter~0 99)} #71#return; {11480#(< ~counter~0 99)} is VALID [2022-04-28 14:04:59,733 INFO L290 TraceCheckUtils]: 44: Hoare triple {11238#true} assume true; {11238#true} is VALID [2022-04-28 14:04:59,733 INFO L290 TraceCheckUtils]: 43: Hoare triple {11238#true} assume !(0 == ~cond); {11238#true} is VALID [2022-04-28 14:04:59,733 INFO L290 TraceCheckUtils]: 42: Hoare triple {11238#true} ~cond := #in~cond; {11238#true} is VALID [2022-04-28 14:04:59,733 INFO L272 TraceCheckUtils]: 41: Hoare triple {11480#(< ~counter~0 99)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {11238#true} is VALID [2022-04-28 14:04:59,734 INFO L290 TraceCheckUtils]: 40: Hoare triple {11480#(< ~counter~0 99)} assume !!(#t~post6 < 100);havoc #t~post6; {11480#(< ~counter~0 99)} is VALID [2022-04-28 14:04:59,734 INFO L290 TraceCheckUtils]: 39: Hoare triple {11508#(< ~counter~0 98)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {11480#(< ~counter~0 99)} is VALID [2022-04-28 14:04:59,734 INFO L290 TraceCheckUtils]: 38: Hoare triple {11508#(< ~counter~0 98)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {11508#(< ~counter~0 98)} is VALID [2022-04-28 14:04:59,735 INFO L290 TraceCheckUtils]: 37: Hoare triple {11508#(< ~counter~0 98)} assume !!(0 != ~a~0 && 0 != ~b~0); {11508#(< ~counter~0 98)} is VALID [2022-04-28 14:04:59,735 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {11238#true} {11508#(< ~counter~0 98)} #71#return; {11508#(< ~counter~0 98)} is VALID [2022-04-28 14:04:59,735 INFO L290 TraceCheckUtils]: 35: Hoare triple {11238#true} assume true; {11238#true} is VALID [2022-04-28 14:04:59,735 INFO L290 TraceCheckUtils]: 34: Hoare triple {11238#true} assume !(0 == ~cond); {11238#true} is VALID [2022-04-28 14:04:59,735 INFO L290 TraceCheckUtils]: 33: Hoare triple {11238#true} ~cond := #in~cond; {11238#true} is VALID [2022-04-28 14:04:59,735 INFO L272 TraceCheckUtils]: 32: Hoare triple {11508#(< ~counter~0 98)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {11238#true} is VALID [2022-04-28 14:04:59,736 INFO L290 TraceCheckUtils]: 31: Hoare triple {11508#(< ~counter~0 98)} assume !!(#t~post6 < 100);havoc #t~post6; {11508#(< ~counter~0 98)} is VALID [2022-04-28 14:04:59,736 INFO L290 TraceCheckUtils]: 30: Hoare triple {11536#(< ~counter~0 97)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {11508#(< ~counter~0 98)} is VALID [2022-04-28 14:04:59,736 INFO L290 TraceCheckUtils]: 29: Hoare triple {11536#(< ~counter~0 97)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {11536#(< ~counter~0 97)} is VALID [2022-04-28 14:04:59,737 INFO L290 TraceCheckUtils]: 28: Hoare triple {11536#(< ~counter~0 97)} assume !!(0 != ~a~0 && 0 != ~b~0); {11536#(< ~counter~0 97)} is VALID [2022-04-28 14:04:59,737 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {11238#true} {11536#(< ~counter~0 97)} #71#return; {11536#(< ~counter~0 97)} is VALID [2022-04-28 14:04:59,737 INFO L290 TraceCheckUtils]: 26: Hoare triple {11238#true} assume true; {11238#true} is VALID [2022-04-28 14:04:59,737 INFO L290 TraceCheckUtils]: 25: Hoare triple {11238#true} assume !(0 == ~cond); {11238#true} is VALID [2022-04-28 14:04:59,737 INFO L290 TraceCheckUtils]: 24: Hoare triple {11238#true} ~cond := #in~cond; {11238#true} is VALID [2022-04-28 14:04:59,737 INFO L272 TraceCheckUtils]: 23: Hoare triple {11536#(< ~counter~0 97)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {11238#true} is VALID [2022-04-28 14:04:59,738 INFO L290 TraceCheckUtils]: 22: Hoare triple {11536#(< ~counter~0 97)} assume !!(#t~post6 < 100);havoc #t~post6; {11536#(< ~counter~0 97)} is VALID [2022-04-28 14:04:59,738 INFO L290 TraceCheckUtils]: 21: Hoare triple {11564#(< ~counter~0 96)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {11536#(< ~counter~0 97)} is VALID [2022-04-28 14:04:59,738 INFO L290 TraceCheckUtils]: 20: Hoare triple {11564#(< ~counter~0 96)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {11564#(< ~counter~0 96)} is VALID [2022-04-28 14:04:59,739 INFO L290 TraceCheckUtils]: 19: Hoare triple {11564#(< ~counter~0 96)} assume !!(0 != ~a~0 && 0 != ~b~0); {11564#(< ~counter~0 96)} is VALID [2022-04-28 14:04:59,739 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {11238#true} {11564#(< ~counter~0 96)} #71#return; {11564#(< ~counter~0 96)} is VALID [2022-04-28 14:04:59,739 INFO L290 TraceCheckUtils]: 17: Hoare triple {11238#true} assume true; {11238#true} is VALID [2022-04-28 14:04:59,739 INFO L290 TraceCheckUtils]: 16: Hoare triple {11238#true} assume !(0 == ~cond); {11238#true} is VALID [2022-04-28 14:04:59,739 INFO L290 TraceCheckUtils]: 15: Hoare triple {11238#true} ~cond := #in~cond; {11238#true} is VALID [2022-04-28 14:04:59,739 INFO L272 TraceCheckUtils]: 14: Hoare triple {11564#(< ~counter~0 96)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {11238#true} is VALID [2022-04-28 14:04:59,740 INFO L290 TraceCheckUtils]: 13: Hoare triple {11564#(< ~counter~0 96)} assume !!(#t~post6 < 100);havoc #t~post6; {11564#(< ~counter~0 96)} is VALID [2022-04-28 14:04:59,740 INFO L290 TraceCheckUtils]: 12: Hoare triple {11592#(< ~counter~0 95)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {11564#(< ~counter~0 96)} is VALID [2022-04-28 14:04:59,740 INFO L290 TraceCheckUtils]: 11: Hoare triple {11592#(< ~counter~0 95)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {11592#(< ~counter~0 95)} is VALID [2022-04-28 14:04:59,741 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {11238#true} {11592#(< ~counter~0 95)} #69#return; {11592#(< ~counter~0 95)} is VALID [2022-04-28 14:04:59,741 INFO L290 TraceCheckUtils]: 9: Hoare triple {11238#true} assume true; {11238#true} is VALID [2022-04-28 14:04:59,741 INFO L290 TraceCheckUtils]: 8: Hoare triple {11238#true} assume !(0 == ~cond); {11238#true} is VALID [2022-04-28 14:04:59,741 INFO L290 TraceCheckUtils]: 7: Hoare triple {11238#true} ~cond := #in~cond; {11238#true} is VALID [2022-04-28 14:04:59,741 INFO L272 TraceCheckUtils]: 6: Hoare triple {11592#(< ~counter~0 95)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {11238#true} is VALID [2022-04-28 14:04:59,741 INFO L290 TraceCheckUtils]: 5: Hoare triple {11592#(< ~counter~0 95)} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {11592#(< ~counter~0 95)} is VALID [2022-04-28 14:04:59,742 INFO L272 TraceCheckUtils]: 4: Hoare triple {11592#(< ~counter~0 95)} call #t~ret7 := main(); {11592#(< ~counter~0 95)} is VALID [2022-04-28 14:04:59,742 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11592#(< ~counter~0 95)} {11238#true} #77#return; {11592#(< ~counter~0 95)} is VALID [2022-04-28 14:04:59,742 INFO L290 TraceCheckUtils]: 2: Hoare triple {11592#(< ~counter~0 95)} assume true; {11592#(< ~counter~0 95)} is VALID [2022-04-28 14:04:59,742 INFO L290 TraceCheckUtils]: 1: Hoare triple {11238#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(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {11592#(< ~counter~0 95)} is VALID [2022-04-28 14:04:59,743 INFO L272 TraceCheckUtils]: 0: Hoare triple {11238#true} call ULTIMATE.init(); {11238#true} is VALID [2022-04-28 14:04:59,743 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 10 proven. 60 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-04-28 14:04:59,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:04:59,743 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1685224107] [2022-04-28 14:04:59,743 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 14:04:59,743 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [730818620] [2022-04-28 14:04:59,743 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [730818620] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 14:04:59,743 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 14:04:59,743 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2022-04-28 14:04:59,743 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:04:59,744 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1804530801] [2022-04-28 14:04:59,744 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1804530801] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:04:59,744 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:04:59,744 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-28 14:04:59,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1469399683] [2022-04-28 14:04:59,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:04:59,744 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.222222222222222) internal successors, (47), 8 states have internal predecessors, (47), 8 states have call successors, (9), 8 states have call predecessors, (9), 6 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) Word has length 63 [2022-04-28 14:04:59,744 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:04:59,744 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 5.222222222222222) internal successors, (47), 8 states have internal predecessors, (47), 8 states have call successors, (9), 8 states have call predecessors, (9), 6 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 14:04:59,788 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 14:04:59,788 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-28 14:04:59,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:04:59,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-28 14:04:59,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=144, Unknown=0, NotChecked=0, Total=240 [2022-04-28 14:04:59,789 INFO L87 Difference]: Start difference. First operand 87 states and 104 transitions. Second operand has 9 states, 9 states have (on average 5.222222222222222) internal successors, (47), 8 states have internal predecessors, (47), 8 states have call successors, (9), 8 states have call predecessors, (9), 6 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 14:05:00,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:05:00,130 INFO L93 Difference]: Finished difference Result 106 states and 127 transitions. [2022-04-28 14:05:00,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-28 14:05:00,130 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.222222222222222) internal successors, (47), 8 states have internal predecessors, (47), 8 states have call successors, (9), 8 states have call predecessors, (9), 6 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) Word has length 63 [2022-04-28 14:05:00,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:05:00,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 5.222222222222222) internal successors, (47), 8 states have internal predecessors, (47), 8 states have call successors, (9), 8 states have call predecessors, (9), 6 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 14:05:00,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 113 transitions. [2022-04-28 14:05:00,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 5.222222222222222) internal successors, (47), 8 states have internal predecessors, (47), 8 states have call successors, (9), 8 states have call predecessors, (9), 6 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 14:05:00,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 113 transitions. [2022-04-28 14:05:00,134 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 113 transitions. [2022-04-28 14:05:00,231 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 113 edges. 113 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:05:00,232 INFO L225 Difference]: With dead ends: 106 [2022-04-28 14:05:00,232 INFO L226 Difference]: Without dead ends: 98 [2022-04-28 14:05:00,232 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=171, Invalid=249, Unknown=0, NotChecked=0, Total=420 [2022-04-28 14:05:00,233 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 84 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 14:05:00,233 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 138 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 14:05:00,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2022-04-28 14:05:00,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2022-04-28 14:05:00,378 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:05:00,378 INFO L82 GeneralOperation]: Start isEquivalent. First operand 98 states. Second operand has 98 states, 75 states have (on average 1.28) internal successors, (96), 76 states have internal predecessors, (96), 12 states have call successors, (12), 11 states have call predecessors, (12), 10 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-28 14:05:00,378 INFO L74 IsIncluded]: Start isIncluded. First operand 98 states. Second operand has 98 states, 75 states have (on average 1.28) internal successors, (96), 76 states have internal predecessors, (96), 12 states have call successors, (12), 11 states have call predecessors, (12), 10 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-28 14:05:00,378 INFO L87 Difference]: Start difference. First operand 98 states. Second operand has 98 states, 75 states have (on average 1.28) internal successors, (96), 76 states have internal predecessors, (96), 12 states have call successors, (12), 11 states have call predecessors, (12), 10 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-28 14:05:00,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:05:00,380 INFO L93 Difference]: Finished difference Result 98 states and 118 transitions. [2022-04-28 14:05:00,380 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 118 transitions. [2022-04-28 14:05:00,380 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:05:00,381 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:05:00,381 INFO L74 IsIncluded]: Start isIncluded. First operand has 98 states, 75 states have (on average 1.28) internal successors, (96), 76 states have internal predecessors, (96), 12 states have call successors, (12), 11 states have call predecessors, (12), 10 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 98 states. [2022-04-28 14:05:00,381 INFO L87 Difference]: Start difference. First operand has 98 states, 75 states have (on average 1.28) internal successors, (96), 76 states have internal predecessors, (96), 12 states have call successors, (12), 11 states have call predecessors, (12), 10 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 98 states. [2022-04-28 14:05:00,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:05:00,383 INFO L93 Difference]: Finished difference Result 98 states and 118 transitions. [2022-04-28 14:05:00,383 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 118 transitions. [2022-04-28 14:05:00,383 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:05:00,383 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:05:00,383 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:05:00,383 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:05:00,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 75 states have (on average 1.28) internal successors, (96), 76 states have internal predecessors, (96), 12 states have call successors, (12), 11 states have call predecessors, (12), 10 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-28 14:05:00,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 118 transitions. [2022-04-28 14:05:00,385 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 118 transitions. Word has length 63 [2022-04-28 14:05:00,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:05:00,385 INFO L495 AbstractCegarLoop]: Abstraction has 98 states and 118 transitions. [2022-04-28 14:05:00,385 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.222222222222222) internal successors, (47), 8 states have internal predecessors, (47), 8 states have call successors, (9), 8 states have call predecessors, (9), 6 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 14:05:00,385 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 98 states and 118 transitions. [2022-04-28 14:05:11,198 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 118 edges. 113 inductive. 0 not inductive. 5 times theorem prover too weak to decide inductivity. [2022-04-28 14:05:11,198 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 118 transitions. [2022-04-28 14:05:11,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2022-04-28 14:05:11,199 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:05:11,199 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 14:05:11,216 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-04-28 14:05:11,403 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 14:05:11,403 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:05:11,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:05:11,404 INFO L85 PathProgramCache]: Analyzing trace with hash -1454644230, now seen corresponding path program 11 times [2022-04-28 14:05:11,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:05:11,404 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1570355924] [2022-04-28 14:05:17,453 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 14:05:17,453 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 14:05:17,453 INFO L85 PathProgramCache]: Analyzing trace with hash -1454644230, now seen corresponding path program 12 times [2022-04-28 14:05:17,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:05:17,453 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798198499] [2022-04-28 14:05:17,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:05:17,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:05:17,466 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 14:05:17,466 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1799996521] [2022-04-28 14:05:17,466 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 14:05:17,466 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 14:05:17,466 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 14:05:17,476 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 14:05:17,480 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-04-28 14:05:17,553 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-04-28 14:05:17,554 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 14:05:17,554 INFO L263 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 17 conjunts are in the unsatisfiable core [2022-04-28 14:05:17,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:05:17,569 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 14:05:17,889 INFO L272 TraceCheckUtils]: 0: Hoare triple {12245#true} call ULTIMATE.init(); {12245#true} is VALID [2022-04-28 14:05:17,890 INFO L290 TraceCheckUtils]: 1: Hoare triple {12245#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(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {12253#(<= ~counter~0 0)} is VALID [2022-04-28 14:05:17,890 INFO L290 TraceCheckUtils]: 2: Hoare triple {12253#(<= ~counter~0 0)} assume true; {12253#(<= ~counter~0 0)} is VALID [2022-04-28 14:05:17,891 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12253#(<= ~counter~0 0)} {12245#true} #77#return; {12253#(<= ~counter~0 0)} is VALID [2022-04-28 14:05:17,891 INFO L272 TraceCheckUtils]: 4: Hoare triple {12253#(<= ~counter~0 0)} call #t~ret7 := main(); {12253#(<= ~counter~0 0)} is VALID [2022-04-28 14:05:17,891 INFO L290 TraceCheckUtils]: 5: Hoare triple {12253#(<= ~counter~0 0)} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {12253#(<= ~counter~0 0)} is VALID [2022-04-28 14:05:17,891 INFO L272 TraceCheckUtils]: 6: Hoare triple {12253#(<= ~counter~0 0)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {12253#(<= ~counter~0 0)} is VALID [2022-04-28 14:05:17,892 INFO L290 TraceCheckUtils]: 7: Hoare triple {12253#(<= ~counter~0 0)} ~cond := #in~cond; {12253#(<= ~counter~0 0)} is VALID [2022-04-28 14:05:17,892 INFO L290 TraceCheckUtils]: 8: Hoare triple {12253#(<= ~counter~0 0)} assume !(0 == ~cond); {12253#(<= ~counter~0 0)} is VALID [2022-04-28 14:05:17,892 INFO L290 TraceCheckUtils]: 9: Hoare triple {12253#(<= ~counter~0 0)} assume true; {12253#(<= ~counter~0 0)} is VALID [2022-04-28 14:05:17,893 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {12253#(<= ~counter~0 0)} {12253#(<= ~counter~0 0)} #69#return; {12253#(<= ~counter~0 0)} is VALID [2022-04-28 14:05:17,893 INFO L290 TraceCheckUtils]: 11: Hoare triple {12253#(<= ~counter~0 0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {12253#(<= ~counter~0 0)} is VALID [2022-04-28 14:05:17,893 INFO L290 TraceCheckUtils]: 12: Hoare triple {12253#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {12287#(<= ~counter~0 1)} is VALID [2022-04-28 14:05:17,894 INFO L290 TraceCheckUtils]: 13: Hoare triple {12287#(<= ~counter~0 1)} assume !!(#t~post6 < 100);havoc #t~post6; {12287#(<= ~counter~0 1)} is VALID [2022-04-28 14:05:17,894 INFO L272 TraceCheckUtils]: 14: Hoare triple {12287#(<= ~counter~0 1)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {12287#(<= ~counter~0 1)} is VALID [2022-04-28 14:05:17,895 INFO L290 TraceCheckUtils]: 15: Hoare triple {12287#(<= ~counter~0 1)} ~cond := #in~cond; {12287#(<= ~counter~0 1)} is VALID [2022-04-28 14:05:17,895 INFO L290 TraceCheckUtils]: 16: Hoare triple {12287#(<= ~counter~0 1)} assume !(0 == ~cond); {12287#(<= ~counter~0 1)} is VALID [2022-04-28 14:05:17,895 INFO L290 TraceCheckUtils]: 17: Hoare triple {12287#(<= ~counter~0 1)} assume true; {12287#(<= ~counter~0 1)} is VALID [2022-04-28 14:05:17,896 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {12287#(<= ~counter~0 1)} {12287#(<= ~counter~0 1)} #71#return; {12287#(<= ~counter~0 1)} is VALID [2022-04-28 14:05:17,896 INFO L290 TraceCheckUtils]: 19: Hoare triple {12287#(<= ~counter~0 1)} assume !!(0 != ~a~0 && 0 != ~b~0); {12287#(<= ~counter~0 1)} is VALID [2022-04-28 14:05:17,896 INFO L290 TraceCheckUtils]: 20: Hoare triple {12287#(<= ~counter~0 1)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {12287#(<= ~counter~0 1)} is VALID [2022-04-28 14:05:17,897 INFO L290 TraceCheckUtils]: 21: Hoare triple {12287#(<= ~counter~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {12315#(<= ~counter~0 2)} is VALID [2022-04-28 14:05:17,897 INFO L290 TraceCheckUtils]: 22: Hoare triple {12315#(<= ~counter~0 2)} assume !!(#t~post6 < 100);havoc #t~post6; {12315#(<= ~counter~0 2)} is VALID [2022-04-28 14:05:17,897 INFO L272 TraceCheckUtils]: 23: Hoare triple {12315#(<= ~counter~0 2)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {12315#(<= ~counter~0 2)} is VALID [2022-04-28 14:05:17,898 INFO L290 TraceCheckUtils]: 24: Hoare triple {12315#(<= ~counter~0 2)} ~cond := #in~cond; {12315#(<= ~counter~0 2)} is VALID [2022-04-28 14:05:17,898 INFO L290 TraceCheckUtils]: 25: Hoare triple {12315#(<= ~counter~0 2)} assume !(0 == ~cond); {12315#(<= ~counter~0 2)} is VALID [2022-04-28 14:05:17,898 INFO L290 TraceCheckUtils]: 26: Hoare triple {12315#(<= ~counter~0 2)} assume true; {12315#(<= ~counter~0 2)} is VALID [2022-04-28 14:05:17,899 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {12315#(<= ~counter~0 2)} {12315#(<= ~counter~0 2)} #71#return; {12315#(<= ~counter~0 2)} is VALID [2022-04-28 14:05:17,899 INFO L290 TraceCheckUtils]: 28: Hoare triple {12315#(<= ~counter~0 2)} assume !!(0 != ~a~0 && 0 != ~b~0); {12315#(<= ~counter~0 2)} is VALID [2022-04-28 14:05:17,899 INFO L290 TraceCheckUtils]: 29: Hoare triple {12315#(<= ~counter~0 2)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {12315#(<= ~counter~0 2)} is VALID [2022-04-28 14:05:17,900 INFO L290 TraceCheckUtils]: 30: Hoare triple {12315#(<= ~counter~0 2)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {12343#(<= ~counter~0 3)} is VALID [2022-04-28 14:05:17,900 INFO L290 TraceCheckUtils]: 31: Hoare triple {12343#(<= ~counter~0 3)} assume !!(#t~post6 < 100);havoc #t~post6; {12343#(<= ~counter~0 3)} is VALID [2022-04-28 14:05:17,900 INFO L272 TraceCheckUtils]: 32: Hoare triple {12343#(<= ~counter~0 3)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {12343#(<= ~counter~0 3)} is VALID [2022-04-28 14:05:17,901 INFO L290 TraceCheckUtils]: 33: Hoare triple {12343#(<= ~counter~0 3)} ~cond := #in~cond; {12343#(<= ~counter~0 3)} is VALID [2022-04-28 14:05:17,901 INFO L290 TraceCheckUtils]: 34: Hoare triple {12343#(<= ~counter~0 3)} assume !(0 == ~cond); {12343#(<= ~counter~0 3)} is VALID [2022-04-28 14:05:17,901 INFO L290 TraceCheckUtils]: 35: Hoare triple {12343#(<= ~counter~0 3)} assume true; {12343#(<= ~counter~0 3)} is VALID [2022-04-28 14:05:17,902 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {12343#(<= ~counter~0 3)} {12343#(<= ~counter~0 3)} #71#return; {12343#(<= ~counter~0 3)} is VALID [2022-04-28 14:05:17,902 INFO L290 TraceCheckUtils]: 37: Hoare triple {12343#(<= ~counter~0 3)} assume !!(0 != ~a~0 && 0 != ~b~0); {12343#(<= ~counter~0 3)} is VALID [2022-04-28 14:05:17,902 INFO L290 TraceCheckUtils]: 38: Hoare triple {12343#(<= ~counter~0 3)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {12343#(<= ~counter~0 3)} is VALID [2022-04-28 14:05:17,903 INFO L290 TraceCheckUtils]: 39: Hoare triple {12343#(<= ~counter~0 3)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {12371#(<= ~counter~0 4)} is VALID [2022-04-28 14:05:17,903 INFO L290 TraceCheckUtils]: 40: Hoare triple {12371#(<= ~counter~0 4)} assume !!(#t~post6 < 100);havoc #t~post6; {12371#(<= ~counter~0 4)} is VALID [2022-04-28 14:05:17,903 INFO L272 TraceCheckUtils]: 41: Hoare triple {12371#(<= ~counter~0 4)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {12371#(<= ~counter~0 4)} is VALID [2022-04-28 14:05:17,904 INFO L290 TraceCheckUtils]: 42: Hoare triple {12371#(<= ~counter~0 4)} ~cond := #in~cond; {12371#(<= ~counter~0 4)} is VALID [2022-04-28 14:05:17,904 INFO L290 TraceCheckUtils]: 43: Hoare triple {12371#(<= ~counter~0 4)} assume !(0 == ~cond); {12371#(<= ~counter~0 4)} is VALID [2022-04-28 14:05:17,904 INFO L290 TraceCheckUtils]: 44: Hoare triple {12371#(<= ~counter~0 4)} assume true; {12371#(<= ~counter~0 4)} is VALID [2022-04-28 14:05:17,905 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {12371#(<= ~counter~0 4)} {12371#(<= ~counter~0 4)} #71#return; {12371#(<= ~counter~0 4)} is VALID [2022-04-28 14:05:17,905 INFO L290 TraceCheckUtils]: 46: Hoare triple {12371#(<= ~counter~0 4)} assume !!(0 != ~a~0 && 0 != ~b~0); {12371#(<= ~counter~0 4)} is VALID [2022-04-28 14:05:17,905 INFO L290 TraceCheckUtils]: 47: Hoare triple {12371#(<= ~counter~0 4)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {12371#(<= ~counter~0 4)} is VALID [2022-04-28 14:05:17,906 INFO L290 TraceCheckUtils]: 48: Hoare triple {12371#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {12399#(<= ~counter~0 5)} is VALID [2022-04-28 14:05:17,906 INFO L290 TraceCheckUtils]: 49: Hoare triple {12399#(<= ~counter~0 5)} assume !!(#t~post6 < 100);havoc #t~post6; {12399#(<= ~counter~0 5)} is VALID [2022-04-28 14:05:17,907 INFO L272 TraceCheckUtils]: 50: Hoare triple {12399#(<= ~counter~0 5)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {12399#(<= ~counter~0 5)} is VALID [2022-04-28 14:05:17,907 INFO L290 TraceCheckUtils]: 51: Hoare triple {12399#(<= ~counter~0 5)} ~cond := #in~cond; {12399#(<= ~counter~0 5)} is VALID [2022-04-28 14:05:17,907 INFO L290 TraceCheckUtils]: 52: Hoare triple {12399#(<= ~counter~0 5)} assume !(0 == ~cond); {12399#(<= ~counter~0 5)} is VALID [2022-04-28 14:05:17,907 INFO L290 TraceCheckUtils]: 53: Hoare triple {12399#(<= ~counter~0 5)} assume true; {12399#(<= ~counter~0 5)} is VALID [2022-04-28 14:05:17,908 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {12399#(<= ~counter~0 5)} {12399#(<= ~counter~0 5)} #71#return; {12399#(<= ~counter~0 5)} is VALID [2022-04-28 14:05:17,908 INFO L290 TraceCheckUtils]: 55: Hoare triple {12399#(<= ~counter~0 5)} assume !!(0 != ~a~0 && 0 != ~b~0); {12399#(<= ~counter~0 5)} is VALID [2022-04-28 14:05:17,908 INFO L290 TraceCheckUtils]: 56: Hoare triple {12399#(<= ~counter~0 5)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {12399#(<= ~counter~0 5)} is VALID [2022-04-28 14:05:17,909 INFO L290 TraceCheckUtils]: 57: Hoare triple {12399#(<= ~counter~0 5)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {12427#(<= ~counter~0 6)} is VALID [2022-04-28 14:05:17,909 INFO L290 TraceCheckUtils]: 58: Hoare triple {12427#(<= ~counter~0 6)} assume !!(#t~post6 < 100);havoc #t~post6; {12427#(<= ~counter~0 6)} is VALID [2022-04-28 14:05:17,910 INFO L272 TraceCheckUtils]: 59: Hoare triple {12427#(<= ~counter~0 6)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {12427#(<= ~counter~0 6)} is VALID [2022-04-28 14:05:17,910 INFO L290 TraceCheckUtils]: 60: Hoare triple {12427#(<= ~counter~0 6)} ~cond := #in~cond; {12427#(<= ~counter~0 6)} is VALID [2022-04-28 14:05:17,910 INFO L290 TraceCheckUtils]: 61: Hoare triple {12427#(<= ~counter~0 6)} assume !(0 == ~cond); {12427#(<= ~counter~0 6)} is VALID [2022-04-28 14:05:17,910 INFO L290 TraceCheckUtils]: 62: Hoare triple {12427#(<= ~counter~0 6)} assume true; {12427#(<= ~counter~0 6)} is VALID [2022-04-28 14:05:17,911 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {12427#(<= ~counter~0 6)} {12427#(<= ~counter~0 6)} #71#return; {12427#(<= ~counter~0 6)} is VALID [2022-04-28 14:05:17,911 INFO L290 TraceCheckUtils]: 64: Hoare triple {12427#(<= ~counter~0 6)} assume !!(0 != ~a~0 && 0 != ~b~0); {12427#(<= ~counter~0 6)} is VALID [2022-04-28 14:05:17,911 INFO L290 TraceCheckUtils]: 65: Hoare triple {12427#(<= ~counter~0 6)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {12427#(<= ~counter~0 6)} is VALID [2022-04-28 14:05:17,912 INFO L290 TraceCheckUtils]: 66: Hoare triple {12427#(<= ~counter~0 6)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {12455#(<= |main_#t~post6| 6)} is VALID [2022-04-28 14:05:17,912 INFO L290 TraceCheckUtils]: 67: Hoare triple {12455#(<= |main_#t~post6| 6)} assume !(#t~post6 < 100);havoc #t~post6; {12246#false} is VALID [2022-04-28 14:05:17,912 INFO L272 TraceCheckUtils]: 68: Hoare triple {12246#false} call __VERIFIER_assert((if ~q~0 == ~x~0 * ~y~0 then 1 else 0)); {12246#false} is VALID [2022-04-28 14:05:17,912 INFO L290 TraceCheckUtils]: 69: Hoare triple {12246#false} ~cond := #in~cond; {12246#false} is VALID [2022-04-28 14:05:17,912 INFO L290 TraceCheckUtils]: 70: Hoare triple {12246#false} assume 0 == ~cond; {12246#false} is VALID [2022-04-28 14:05:17,912 INFO L290 TraceCheckUtils]: 71: Hoare triple {12246#false} assume !false; {12246#false} is VALID [2022-04-28 14:05:17,913 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 12 proven. 147 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 14:05:17,913 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 14:05:18,270 INFO L290 TraceCheckUtils]: 71: Hoare triple {12246#false} assume !false; {12246#false} is VALID [2022-04-28 14:05:18,270 INFO L290 TraceCheckUtils]: 70: Hoare triple {12246#false} assume 0 == ~cond; {12246#false} is VALID [2022-04-28 14:05:18,270 INFO L290 TraceCheckUtils]: 69: Hoare triple {12246#false} ~cond := #in~cond; {12246#false} is VALID [2022-04-28 14:05:18,270 INFO L272 TraceCheckUtils]: 68: Hoare triple {12246#false} call __VERIFIER_assert((if ~q~0 == ~x~0 * ~y~0 then 1 else 0)); {12246#false} is VALID [2022-04-28 14:05:18,271 INFO L290 TraceCheckUtils]: 67: Hoare triple {12483#(< |main_#t~post6| 100)} assume !(#t~post6 < 100);havoc #t~post6; {12246#false} is VALID [2022-04-28 14:05:18,271 INFO L290 TraceCheckUtils]: 66: Hoare triple {12487#(< ~counter~0 100)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {12483#(< |main_#t~post6| 100)} is VALID [2022-04-28 14:05:18,271 INFO L290 TraceCheckUtils]: 65: Hoare triple {12487#(< ~counter~0 100)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {12487#(< ~counter~0 100)} is VALID [2022-04-28 14:05:18,272 INFO L290 TraceCheckUtils]: 64: Hoare triple {12487#(< ~counter~0 100)} assume !!(0 != ~a~0 && 0 != ~b~0); {12487#(< ~counter~0 100)} is VALID [2022-04-28 14:05:18,272 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {12245#true} {12487#(< ~counter~0 100)} #71#return; {12487#(< ~counter~0 100)} is VALID [2022-04-28 14:05:18,272 INFO L290 TraceCheckUtils]: 62: Hoare triple {12245#true} assume true; {12245#true} is VALID [2022-04-28 14:05:18,272 INFO L290 TraceCheckUtils]: 61: Hoare triple {12245#true} assume !(0 == ~cond); {12245#true} is VALID [2022-04-28 14:05:18,272 INFO L290 TraceCheckUtils]: 60: Hoare triple {12245#true} ~cond := #in~cond; {12245#true} is VALID [2022-04-28 14:05:18,272 INFO L272 TraceCheckUtils]: 59: Hoare triple {12487#(< ~counter~0 100)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {12245#true} is VALID [2022-04-28 14:05:18,273 INFO L290 TraceCheckUtils]: 58: Hoare triple {12487#(< ~counter~0 100)} assume !!(#t~post6 < 100);havoc #t~post6; {12487#(< ~counter~0 100)} is VALID [2022-04-28 14:05:18,273 INFO L290 TraceCheckUtils]: 57: Hoare triple {12515#(< ~counter~0 99)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {12487#(< ~counter~0 100)} is VALID [2022-04-28 14:05:18,274 INFO L290 TraceCheckUtils]: 56: Hoare triple {12515#(< ~counter~0 99)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {12515#(< ~counter~0 99)} is VALID [2022-04-28 14:05:18,274 INFO L290 TraceCheckUtils]: 55: Hoare triple {12515#(< ~counter~0 99)} assume !!(0 != ~a~0 && 0 != ~b~0); {12515#(< ~counter~0 99)} is VALID [2022-04-28 14:05:18,274 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {12245#true} {12515#(< ~counter~0 99)} #71#return; {12515#(< ~counter~0 99)} is VALID [2022-04-28 14:05:18,274 INFO L290 TraceCheckUtils]: 53: Hoare triple {12245#true} assume true; {12245#true} is VALID [2022-04-28 14:05:18,274 INFO L290 TraceCheckUtils]: 52: Hoare triple {12245#true} assume !(0 == ~cond); {12245#true} is VALID [2022-04-28 14:05:18,275 INFO L290 TraceCheckUtils]: 51: Hoare triple {12245#true} ~cond := #in~cond; {12245#true} is VALID [2022-04-28 14:05:18,275 INFO L272 TraceCheckUtils]: 50: Hoare triple {12515#(< ~counter~0 99)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {12245#true} is VALID [2022-04-28 14:05:18,275 INFO L290 TraceCheckUtils]: 49: Hoare triple {12515#(< ~counter~0 99)} assume !!(#t~post6 < 100);havoc #t~post6; {12515#(< ~counter~0 99)} is VALID [2022-04-28 14:05:18,275 INFO L290 TraceCheckUtils]: 48: Hoare triple {12543#(< ~counter~0 98)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {12515#(< ~counter~0 99)} is VALID [2022-04-28 14:05:18,276 INFO L290 TraceCheckUtils]: 47: Hoare triple {12543#(< ~counter~0 98)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {12543#(< ~counter~0 98)} is VALID [2022-04-28 14:05:18,276 INFO L290 TraceCheckUtils]: 46: Hoare triple {12543#(< ~counter~0 98)} assume !!(0 != ~a~0 && 0 != ~b~0); {12543#(< ~counter~0 98)} is VALID [2022-04-28 14:05:18,276 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {12245#true} {12543#(< ~counter~0 98)} #71#return; {12543#(< ~counter~0 98)} is VALID [2022-04-28 14:05:18,276 INFO L290 TraceCheckUtils]: 44: Hoare triple {12245#true} assume true; {12245#true} is VALID [2022-04-28 14:05:18,276 INFO L290 TraceCheckUtils]: 43: Hoare triple {12245#true} assume !(0 == ~cond); {12245#true} is VALID [2022-04-28 14:05:18,277 INFO L290 TraceCheckUtils]: 42: Hoare triple {12245#true} ~cond := #in~cond; {12245#true} is VALID [2022-04-28 14:05:18,277 INFO L272 TraceCheckUtils]: 41: Hoare triple {12543#(< ~counter~0 98)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {12245#true} is VALID [2022-04-28 14:05:18,277 INFO L290 TraceCheckUtils]: 40: Hoare triple {12543#(< ~counter~0 98)} assume !!(#t~post6 < 100);havoc #t~post6; {12543#(< ~counter~0 98)} is VALID [2022-04-28 14:05:18,277 INFO L290 TraceCheckUtils]: 39: Hoare triple {12571#(< ~counter~0 97)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {12543#(< ~counter~0 98)} is VALID [2022-04-28 14:05:18,277 INFO L290 TraceCheckUtils]: 38: Hoare triple {12571#(< ~counter~0 97)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {12571#(< ~counter~0 97)} is VALID [2022-04-28 14:05:18,278 INFO L290 TraceCheckUtils]: 37: Hoare triple {12571#(< ~counter~0 97)} assume !!(0 != ~a~0 && 0 != ~b~0); {12571#(< ~counter~0 97)} is VALID [2022-04-28 14:05:18,278 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {12245#true} {12571#(< ~counter~0 97)} #71#return; {12571#(< ~counter~0 97)} is VALID [2022-04-28 14:05:18,278 INFO L290 TraceCheckUtils]: 35: Hoare triple {12245#true} assume true; {12245#true} is VALID [2022-04-28 14:05:18,278 INFO L290 TraceCheckUtils]: 34: Hoare triple {12245#true} assume !(0 == ~cond); {12245#true} is VALID [2022-04-28 14:05:18,278 INFO L290 TraceCheckUtils]: 33: Hoare triple {12245#true} ~cond := #in~cond; {12245#true} is VALID [2022-04-28 14:05:18,279 INFO L272 TraceCheckUtils]: 32: Hoare triple {12571#(< ~counter~0 97)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {12245#true} is VALID [2022-04-28 14:05:18,279 INFO L290 TraceCheckUtils]: 31: Hoare triple {12571#(< ~counter~0 97)} assume !!(#t~post6 < 100);havoc #t~post6; {12571#(< ~counter~0 97)} is VALID [2022-04-28 14:05:18,279 INFO L290 TraceCheckUtils]: 30: Hoare triple {12599#(< ~counter~0 96)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {12571#(< ~counter~0 97)} is VALID [2022-04-28 14:05:18,279 INFO L290 TraceCheckUtils]: 29: Hoare triple {12599#(< ~counter~0 96)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {12599#(< ~counter~0 96)} is VALID [2022-04-28 14:05:18,280 INFO L290 TraceCheckUtils]: 28: Hoare triple {12599#(< ~counter~0 96)} assume !!(0 != ~a~0 && 0 != ~b~0); {12599#(< ~counter~0 96)} is VALID [2022-04-28 14:05:18,280 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {12245#true} {12599#(< ~counter~0 96)} #71#return; {12599#(< ~counter~0 96)} is VALID [2022-04-28 14:05:18,280 INFO L290 TraceCheckUtils]: 26: Hoare triple {12245#true} assume true; {12245#true} is VALID [2022-04-28 14:05:18,280 INFO L290 TraceCheckUtils]: 25: Hoare triple {12245#true} assume !(0 == ~cond); {12245#true} is VALID [2022-04-28 14:05:18,280 INFO L290 TraceCheckUtils]: 24: Hoare triple {12245#true} ~cond := #in~cond; {12245#true} is VALID [2022-04-28 14:05:18,281 INFO L272 TraceCheckUtils]: 23: Hoare triple {12599#(< ~counter~0 96)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {12245#true} is VALID [2022-04-28 14:05:18,281 INFO L290 TraceCheckUtils]: 22: Hoare triple {12599#(< ~counter~0 96)} assume !!(#t~post6 < 100);havoc #t~post6; {12599#(< ~counter~0 96)} is VALID [2022-04-28 14:05:18,281 INFO L290 TraceCheckUtils]: 21: Hoare triple {12627#(< ~counter~0 95)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {12599#(< ~counter~0 96)} is VALID [2022-04-28 14:05:18,281 INFO L290 TraceCheckUtils]: 20: Hoare triple {12627#(< ~counter~0 95)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {12627#(< ~counter~0 95)} is VALID [2022-04-28 14:05:18,282 INFO L290 TraceCheckUtils]: 19: Hoare triple {12627#(< ~counter~0 95)} assume !!(0 != ~a~0 && 0 != ~b~0); {12627#(< ~counter~0 95)} is VALID [2022-04-28 14:05:18,282 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {12245#true} {12627#(< ~counter~0 95)} #71#return; {12627#(< ~counter~0 95)} is VALID [2022-04-28 14:05:18,282 INFO L290 TraceCheckUtils]: 17: Hoare triple {12245#true} assume true; {12245#true} is VALID [2022-04-28 14:05:18,282 INFO L290 TraceCheckUtils]: 16: Hoare triple {12245#true} assume !(0 == ~cond); {12245#true} is VALID [2022-04-28 14:05:18,282 INFO L290 TraceCheckUtils]: 15: Hoare triple {12245#true} ~cond := #in~cond; {12245#true} is VALID [2022-04-28 14:05:18,282 INFO L272 TraceCheckUtils]: 14: Hoare triple {12627#(< ~counter~0 95)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {12245#true} is VALID [2022-04-28 14:05:18,283 INFO L290 TraceCheckUtils]: 13: Hoare triple {12627#(< ~counter~0 95)} assume !!(#t~post6 < 100);havoc #t~post6; {12627#(< ~counter~0 95)} is VALID [2022-04-28 14:05:18,283 INFO L290 TraceCheckUtils]: 12: Hoare triple {12655#(< ~counter~0 94)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {12627#(< ~counter~0 95)} is VALID [2022-04-28 14:05:18,283 INFO L290 TraceCheckUtils]: 11: Hoare triple {12655#(< ~counter~0 94)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {12655#(< ~counter~0 94)} is VALID [2022-04-28 14:05:18,284 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {12245#true} {12655#(< ~counter~0 94)} #69#return; {12655#(< ~counter~0 94)} is VALID [2022-04-28 14:05:18,284 INFO L290 TraceCheckUtils]: 9: Hoare triple {12245#true} assume true; {12245#true} is VALID [2022-04-28 14:05:18,284 INFO L290 TraceCheckUtils]: 8: Hoare triple {12245#true} assume !(0 == ~cond); {12245#true} is VALID [2022-04-28 14:05:18,284 INFO L290 TraceCheckUtils]: 7: Hoare triple {12245#true} ~cond := #in~cond; {12245#true} is VALID [2022-04-28 14:05:18,284 INFO L272 TraceCheckUtils]: 6: Hoare triple {12655#(< ~counter~0 94)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {12245#true} is VALID [2022-04-28 14:05:18,284 INFO L290 TraceCheckUtils]: 5: Hoare triple {12655#(< ~counter~0 94)} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {12655#(< ~counter~0 94)} is VALID [2022-04-28 14:05:18,285 INFO L272 TraceCheckUtils]: 4: Hoare triple {12655#(< ~counter~0 94)} call #t~ret7 := main(); {12655#(< ~counter~0 94)} is VALID [2022-04-28 14:05:18,285 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12655#(< ~counter~0 94)} {12245#true} #77#return; {12655#(< ~counter~0 94)} is VALID [2022-04-28 14:05:18,285 INFO L290 TraceCheckUtils]: 2: Hoare triple {12655#(< ~counter~0 94)} assume true; {12655#(< ~counter~0 94)} is VALID [2022-04-28 14:05:18,286 INFO L290 TraceCheckUtils]: 1: Hoare triple {12245#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(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {12655#(< ~counter~0 94)} is VALID [2022-04-28 14:05:18,286 INFO L272 TraceCheckUtils]: 0: Hoare triple {12245#true} call ULTIMATE.init(); {12245#true} is VALID [2022-04-28 14:05:18,286 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 12 proven. 87 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-04-28 14:05:18,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:05:18,286 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1798198499] [2022-04-28 14:05:18,286 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 14:05:18,286 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1799996521] [2022-04-28 14:05:18,286 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1799996521] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 14:05:18,286 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 14:05:18,286 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2022-04-28 14:05:18,286 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:05:18,286 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1570355924] [2022-04-28 14:05:18,287 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1570355924] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:05:18,287 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:05:18,287 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-28 14:05:18,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [4724048] [2022-04-28 14:05:18,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:05:18,287 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.4) internal successors, (54), 9 states have internal predecessors, (54), 9 states have call successors, (10), 9 states have call predecessors, (10), 7 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) Word has length 72 [2022-04-28 14:05:18,287 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:05:18,288 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 5.4) internal successors, (54), 9 states have internal predecessors, (54), 9 states have call successors, (10), 9 states have call predecessors, (10), 7 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 14:05:18,344 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:05:18,344 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-28 14:05:18,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:05:18,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-28 14:05:18,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=181, Unknown=0, NotChecked=0, Total=306 [2022-04-28 14:05:18,345 INFO L87 Difference]: Start difference. First operand 98 states and 118 transitions. Second operand has 10 states, 10 states have (on average 5.4) internal successors, (54), 9 states have internal predecessors, (54), 9 states have call successors, (10), 9 states have call predecessors, (10), 7 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 14:05:18,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:05:18,723 INFO L93 Difference]: Finished difference Result 117 states and 141 transitions. [2022-04-28 14:05:18,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-04-28 14:05:18,723 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.4) internal successors, (54), 9 states have internal predecessors, (54), 9 states have call successors, (10), 9 states have call predecessors, (10), 7 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) Word has length 72 [2022-04-28 14:05:18,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:05:18,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 5.4) internal successors, (54), 9 states have internal predecessors, (54), 9 states have call successors, (10), 9 states have call predecessors, (10), 7 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 14:05:18,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 127 transitions. [2022-04-28 14:05:18,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 5.4) internal successors, (54), 9 states have internal predecessors, (54), 9 states have call successors, (10), 9 states have call predecessors, (10), 7 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 14:05:18,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 127 transitions. [2022-04-28 14:05:18,727 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 127 transitions. [2022-04-28 14:05:18,852 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 127 edges. 127 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:05:18,853 INFO L225 Difference]: With dead ends: 117 [2022-04-28 14:05:18,853 INFO L226 Difference]: Without dead ends: 109 [2022-04-28 14:05:18,854 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 127 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=227, Invalid=325, Unknown=0, NotChecked=0, Total=552 [2022-04-28 14:05:18,854 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 62 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 14:05:18,854 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 158 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 14:05:18,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2022-04-28 14:05:19,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2022-04-28 14:05:19,049 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:05:19,050 INFO L82 GeneralOperation]: Start isEquivalent. First operand 109 states. Second operand has 109 states, 84 states have (on average 1.2857142857142858) internal successors, (108), 85 states have internal predecessors, (108), 13 states have call successors, (13), 12 states have call predecessors, (13), 11 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-28 14:05:19,050 INFO L74 IsIncluded]: Start isIncluded. First operand 109 states. Second operand has 109 states, 84 states have (on average 1.2857142857142858) internal successors, (108), 85 states have internal predecessors, (108), 13 states have call successors, (13), 12 states have call predecessors, (13), 11 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-28 14:05:19,050 INFO L87 Difference]: Start difference. First operand 109 states. Second operand has 109 states, 84 states have (on average 1.2857142857142858) internal successors, (108), 85 states have internal predecessors, (108), 13 states have call successors, (13), 12 states have call predecessors, (13), 11 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-28 14:05:19,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:05:19,052 INFO L93 Difference]: Finished difference Result 109 states and 132 transitions. [2022-04-28 14:05:19,052 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 132 transitions. [2022-04-28 14:05:19,052 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:05:19,052 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:05:19,053 INFO L74 IsIncluded]: Start isIncluded. First operand has 109 states, 84 states have (on average 1.2857142857142858) internal successors, (108), 85 states have internal predecessors, (108), 13 states have call successors, (13), 12 states have call predecessors, (13), 11 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 109 states. [2022-04-28 14:05:19,053 INFO L87 Difference]: Start difference. First operand has 109 states, 84 states have (on average 1.2857142857142858) internal successors, (108), 85 states have internal predecessors, (108), 13 states have call successors, (13), 12 states have call predecessors, (13), 11 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 109 states. [2022-04-28 14:05:19,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:05:19,054 INFO L93 Difference]: Finished difference Result 109 states and 132 transitions. [2022-04-28 14:05:19,054 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 132 transitions. [2022-04-28 14:05:19,055 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:05:19,055 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:05:19,055 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:05:19,055 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:05:19,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 84 states have (on average 1.2857142857142858) internal successors, (108), 85 states have internal predecessors, (108), 13 states have call successors, (13), 12 states have call predecessors, (13), 11 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-28 14:05:19,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 132 transitions. [2022-04-28 14:05:19,057 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 132 transitions. Word has length 72 [2022-04-28 14:05:19,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:05:19,057 INFO L495 AbstractCegarLoop]: Abstraction has 109 states and 132 transitions. [2022-04-28 14:05:19,057 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.4) internal successors, (54), 9 states have internal predecessors, (54), 9 states have call successors, (10), 9 states have call predecessors, (10), 7 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 14:05:19,057 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 109 states and 132 transitions. [2022-04-28 14:05:32,069 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 132 edges. 126 inductive. 0 not inductive. 6 times theorem prover too weak to decide inductivity. [2022-04-28 14:05:32,069 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 132 transitions. [2022-04-28 14:05:32,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2022-04-28 14:05:32,070 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:05:32,070 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 14:05:32,086 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-04-28 14:05:32,270 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 14:05:32,270 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:05:32,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:05:32,271 INFO L85 PathProgramCache]: Analyzing trace with hash -529342910, now seen corresponding path program 13 times [2022-04-28 14:05:32,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:05:32,271 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1999325889] [2022-04-28 14:05:38,319 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 14:05:38,319 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 14:05:38,319 INFO L85 PathProgramCache]: Analyzing trace with hash -529342910, now seen corresponding path program 14 times [2022-04-28 14:05:38,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:05:38,320 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [801011655] [2022-04-28 14:05:38,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:05:38,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:05:38,332 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 14:05:38,332 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1247535734] [2022-04-28 14:05:38,332 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 14:05:38,332 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 14:05:38,333 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 14:05:38,340 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 14:05:38,341 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-04-28 14:05:38,398 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 14:05:38,398 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 14:05:38,399 INFO L263 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 19 conjunts are in the unsatisfiable core [2022-04-28 14:05:38,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:05:38,415 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 14:05:38,768 INFO L272 TraceCheckUtils]: 0: Hoare triple {13376#true} call ULTIMATE.init(); {13376#true} is VALID [2022-04-28 14:05:38,768 INFO L290 TraceCheckUtils]: 1: Hoare triple {13376#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(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {13384#(<= ~counter~0 0)} is VALID [2022-04-28 14:05:38,769 INFO L290 TraceCheckUtils]: 2: Hoare triple {13384#(<= ~counter~0 0)} assume true; {13384#(<= ~counter~0 0)} is VALID [2022-04-28 14:05:38,769 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13384#(<= ~counter~0 0)} {13376#true} #77#return; {13384#(<= ~counter~0 0)} is VALID [2022-04-28 14:05:38,769 INFO L272 TraceCheckUtils]: 4: Hoare triple {13384#(<= ~counter~0 0)} call #t~ret7 := main(); {13384#(<= ~counter~0 0)} is VALID [2022-04-28 14:05:38,769 INFO L290 TraceCheckUtils]: 5: Hoare triple {13384#(<= ~counter~0 0)} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {13384#(<= ~counter~0 0)} is VALID [2022-04-28 14:05:38,770 INFO L272 TraceCheckUtils]: 6: Hoare triple {13384#(<= ~counter~0 0)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {13384#(<= ~counter~0 0)} is VALID [2022-04-28 14:05:38,770 INFO L290 TraceCheckUtils]: 7: Hoare triple {13384#(<= ~counter~0 0)} ~cond := #in~cond; {13384#(<= ~counter~0 0)} is VALID [2022-04-28 14:05:38,770 INFO L290 TraceCheckUtils]: 8: Hoare triple {13384#(<= ~counter~0 0)} assume !(0 == ~cond); {13384#(<= ~counter~0 0)} is VALID [2022-04-28 14:05:38,771 INFO L290 TraceCheckUtils]: 9: Hoare triple {13384#(<= ~counter~0 0)} assume true; {13384#(<= ~counter~0 0)} is VALID [2022-04-28 14:05:38,771 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {13384#(<= ~counter~0 0)} {13384#(<= ~counter~0 0)} #69#return; {13384#(<= ~counter~0 0)} is VALID [2022-04-28 14:05:38,771 INFO L290 TraceCheckUtils]: 11: Hoare triple {13384#(<= ~counter~0 0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {13384#(<= ~counter~0 0)} is VALID [2022-04-28 14:05:38,772 INFO L290 TraceCheckUtils]: 12: Hoare triple {13384#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {13418#(<= ~counter~0 1)} is VALID [2022-04-28 14:05:38,772 INFO L290 TraceCheckUtils]: 13: Hoare triple {13418#(<= ~counter~0 1)} assume !!(#t~post6 < 100);havoc #t~post6; {13418#(<= ~counter~0 1)} is VALID [2022-04-28 14:05:38,773 INFO L272 TraceCheckUtils]: 14: Hoare triple {13418#(<= ~counter~0 1)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {13418#(<= ~counter~0 1)} is VALID [2022-04-28 14:05:38,773 INFO L290 TraceCheckUtils]: 15: Hoare triple {13418#(<= ~counter~0 1)} ~cond := #in~cond; {13418#(<= ~counter~0 1)} is VALID [2022-04-28 14:05:38,773 INFO L290 TraceCheckUtils]: 16: Hoare triple {13418#(<= ~counter~0 1)} assume !(0 == ~cond); {13418#(<= ~counter~0 1)} is VALID [2022-04-28 14:05:38,773 INFO L290 TraceCheckUtils]: 17: Hoare triple {13418#(<= ~counter~0 1)} assume true; {13418#(<= ~counter~0 1)} is VALID [2022-04-28 14:05:38,774 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {13418#(<= ~counter~0 1)} {13418#(<= ~counter~0 1)} #71#return; {13418#(<= ~counter~0 1)} is VALID [2022-04-28 14:05:38,774 INFO L290 TraceCheckUtils]: 19: Hoare triple {13418#(<= ~counter~0 1)} assume !!(0 != ~a~0 && 0 != ~b~0); {13418#(<= ~counter~0 1)} is VALID [2022-04-28 14:05:38,774 INFO L290 TraceCheckUtils]: 20: Hoare triple {13418#(<= ~counter~0 1)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {13418#(<= ~counter~0 1)} is VALID [2022-04-28 14:05:38,775 INFO L290 TraceCheckUtils]: 21: Hoare triple {13418#(<= ~counter~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {13446#(<= ~counter~0 2)} is VALID [2022-04-28 14:05:38,775 INFO L290 TraceCheckUtils]: 22: Hoare triple {13446#(<= ~counter~0 2)} assume !!(#t~post6 < 100);havoc #t~post6; {13446#(<= ~counter~0 2)} is VALID [2022-04-28 14:05:38,776 INFO L272 TraceCheckUtils]: 23: Hoare triple {13446#(<= ~counter~0 2)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {13446#(<= ~counter~0 2)} is VALID [2022-04-28 14:05:38,776 INFO L290 TraceCheckUtils]: 24: Hoare triple {13446#(<= ~counter~0 2)} ~cond := #in~cond; {13446#(<= ~counter~0 2)} is VALID [2022-04-28 14:05:38,776 INFO L290 TraceCheckUtils]: 25: Hoare triple {13446#(<= ~counter~0 2)} assume !(0 == ~cond); {13446#(<= ~counter~0 2)} is VALID [2022-04-28 14:05:38,776 INFO L290 TraceCheckUtils]: 26: Hoare triple {13446#(<= ~counter~0 2)} assume true; {13446#(<= ~counter~0 2)} is VALID [2022-04-28 14:05:38,777 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {13446#(<= ~counter~0 2)} {13446#(<= ~counter~0 2)} #71#return; {13446#(<= ~counter~0 2)} is VALID [2022-04-28 14:05:38,777 INFO L290 TraceCheckUtils]: 28: Hoare triple {13446#(<= ~counter~0 2)} assume !!(0 != ~a~0 && 0 != ~b~0); {13446#(<= ~counter~0 2)} is VALID [2022-04-28 14:05:38,777 INFO L290 TraceCheckUtils]: 29: Hoare triple {13446#(<= ~counter~0 2)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {13446#(<= ~counter~0 2)} is VALID [2022-04-28 14:05:38,778 INFO L290 TraceCheckUtils]: 30: Hoare triple {13446#(<= ~counter~0 2)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {13474#(<= ~counter~0 3)} is VALID [2022-04-28 14:05:38,778 INFO L290 TraceCheckUtils]: 31: Hoare triple {13474#(<= ~counter~0 3)} assume !!(#t~post6 < 100);havoc #t~post6; {13474#(<= ~counter~0 3)} is VALID [2022-04-28 14:05:38,779 INFO L272 TraceCheckUtils]: 32: Hoare triple {13474#(<= ~counter~0 3)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {13474#(<= ~counter~0 3)} is VALID [2022-04-28 14:05:38,779 INFO L290 TraceCheckUtils]: 33: Hoare triple {13474#(<= ~counter~0 3)} ~cond := #in~cond; {13474#(<= ~counter~0 3)} is VALID [2022-04-28 14:05:38,779 INFO L290 TraceCheckUtils]: 34: Hoare triple {13474#(<= ~counter~0 3)} assume !(0 == ~cond); {13474#(<= ~counter~0 3)} is VALID [2022-04-28 14:05:38,780 INFO L290 TraceCheckUtils]: 35: Hoare triple {13474#(<= ~counter~0 3)} assume true; {13474#(<= ~counter~0 3)} is VALID [2022-04-28 14:05:38,780 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {13474#(<= ~counter~0 3)} {13474#(<= ~counter~0 3)} #71#return; {13474#(<= ~counter~0 3)} is VALID [2022-04-28 14:05:38,780 INFO L290 TraceCheckUtils]: 37: Hoare triple {13474#(<= ~counter~0 3)} assume !!(0 != ~a~0 && 0 != ~b~0); {13474#(<= ~counter~0 3)} is VALID [2022-04-28 14:05:38,781 INFO L290 TraceCheckUtils]: 38: Hoare triple {13474#(<= ~counter~0 3)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {13474#(<= ~counter~0 3)} is VALID [2022-04-28 14:05:38,781 INFO L290 TraceCheckUtils]: 39: Hoare triple {13474#(<= ~counter~0 3)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {13502#(<= ~counter~0 4)} is VALID [2022-04-28 14:05:38,781 INFO L290 TraceCheckUtils]: 40: Hoare triple {13502#(<= ~counter~0 4)} assume !!(#t~post6 < 100);havoc #t~post6; {13502#(<= ~counter~0 4)} is VALID [2022-04-28 14:05:38,782 INFO L272 TraceCheckUtils]: 41: Hoare triple {13502#(<= ~counter~0 4)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {13502#(<= ~counter~0 4)} is VALID [2022-04-28 14:05:38,782 INFO L290 TraceCheckUtils]: 42: Hoare triple {13502#(<= ~counter~0 4)} ~cond := #in~cond; {13502#(<= ~counter~0 4)} is VALID [2022-04-28 14:05:38,782 INFO L290 TraceCheckUtils]: 43: Hoare triple {13502#(<= ~counter~0 4)} assume !(0 == ~cond); {13502#(<= ~counter~0 4)} is VALID [2022-04-28 14:05:38,783 INFO L290 TraceCheckUtils]: 44: Hoare triple {13502#(<= ~counter~0 4)} assume true; {13502#(<= ~counter~0 4)} is VALID [2022-04-28 14:05:38,783 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {13502#(<= ~counter~0 4)} {13502#(<= ~counter~0 4)} #71#return; {13502#(<= ~counter~0 4)} is VALID [2022-04-28 14:05:38,783 INFO L290 TraceCheckUtils]: 46: Hoare triple {13502#(<= ~counter~0 4)} assume !!(0 != ~a~0 && 0 != ~b~0); {13502#(<= ~counter~0 4)} is VALID [2022-04-28 14:05:38,784 INFO L290 TraceCheckUtils]: 47: Hoare triple {13502#(<= ~counter~0 4)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {13502#(<= ~counter~0 4)} is VALID [2022-04-28 14:05:38,784 INFO L290 TraceCheckUtils]: 48: Hoare triple {13502#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {13530#(<= ~counter~0 5)} is VALID [2022-04-28 14:05:38,784 INFO L290 TraceCheckUtils]: 49: Hoare triple {13530#(<= ~counter~0 5)} assume !!(#t~post6 < 100);havoc #t~post6; {13530#(<= ~counter~0 5)} is VALID [2022-04-28 14:05:38,785 INFO L272 TraceCheckUtils]: 50: Hoare triple {13530#(<= ~counter~0 5)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {13530#(<= ~counter~0 5)} is VALID [2022-04-28 14:05:38,785 INFO L290 TraceCheckUtils]: 51: Hoare triple {13530#(<= ~counter~0 5)} ~cond := #in~cond; {13530#(<= ~counter~0 5)} is VALID [2022-04-28 14:05:38,785 INFO L290 TraceCheckUtils]: 52: Hoare triple {13530#(<= ~counter~0 5)} assume !(0 == ~cond); {13530#(<= ~counter~0 5)} is VALID [2022-04-28 14:05:38,786 INFO L290 TraceCheckUtils]: 53: Hoare triple {13530#(<= ~counter~0 5)} assume true; {13530#(<= ~counter~0 5)} is VALID [2022-04-28 14:05:38,786 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {13530#(<= ~counter~0 5)} {13530#(<= ~counter~0 5)} #71#return; {13530#(<= ~counter~0 5)} is VALID [2022-04-28 14:05:38,786 INFO L290 TraceCheckUtils]: 55: Hoare triple {13530#(<= ~counter~0 5)} assume !!(0 != ~a~0 && 0 != ~b~0); {13530#(<= ~counter~0 5)} is VALID [2022-04-28 14:05:38,787 INFO L290 TraceCheckUtils]: 56: Hoare triple {13530#(<= ~counter~0 5)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {13530#(<= ~counter~0 5)} is VALID [2022-04-28 14:05:38,787 INFO L290 TraceCheckUtils]: 57: Hoare triple {13530#(<= ~counter~0 5)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {13558#(<= ~counter~0 6)} is VALID [2022-04-28 14:05:38,787 INFO L290 TraceCheckUtils]: 58: Hoare triple {13558#(<= ~counter~0 6)} assume !!(#t~post6 < 100);havoc #t~post6; {13558#(<= ~counter~0 6)} is VALID [2022-04-28 14:05:38,788 INFO L272 TraceCheckUtils]: 59: Hoare triple {13558#(<= ~counter~0 6)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {13558#(<= ~counter~0 6)} is VALID [2022-04-28 14:05:38,788 INFO L290 TraceCheckUtils]: 60: Hoare triple {13558#(<= ~counter~0 6)} ~cond := #in~cond; {13558#(<= ~counter~0 6)} is VALID [2022-04-28 14:05:38,788 INFO L290 TraceCheckUtils]: 61: Hoare triple {13558#(<= ~counter~0 6)} assume !(0 == ~cond); {13558#(<= ~counter~0 6)} is VALID [2022-04-28 14:05:38,789 INFO L290 TraceCheckUtils]: 62: Hoare triple {13558#(<= ~counter~0 6)} assume true; {13558#(<= ~counter~0 6)} is VALID [2022-04-28 14:05:38,789 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {13558#(<= ~counter~0 6)} {13558#(<= ~counter~0 6)} #71#return; {13558#(<= ~counter~0 6)} is VALID [2022-04-28 14:05:38,789 INFO L290 TraceCheckUtils]: 64: Hoare triple {13558#(<= ~counter~0 6)} assume !!(0 != ~a~0 && 0 != ~b~0); {13558#(<= ~counter~0 6)} is VALID [2022-04-28 14:05:38,790 INFO L290 TraceCheckUtils]: 65: Hoare triple {13558#(<= ~counter~0 6)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {13558#(<= ~counter~0 6)} is VALID [2022-04-28 14:05:38,790 INFO L290 TraceCheckUtils]: 66: Hoare triple {13558#(<= ~counter~0 6)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {13586#(<= ~counter~0 7)} is VALID [2022-04-28 14:05:38,790 INFO L290 TraceCheckUtils]: 67: Hoare triple {13586#(<= ~counter~0 7)} assume !!(#t~post6 < 100);havoc #t~post6; {13586#(<= ~counter~0 7)} is VALID [2022-04-28 14:05:38,791 INFO L272 TraceCheckUtils]: 68: Hoare triple {13586#(<= ~counter~0 7)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {13586#(<= ~counter~0 7)} is VALID [2022-04-28 14:05:38,791 INFO L290 TraceCheckUtils]: 69: Hoare triple {13586#(<= ~counter~0 7)} ~cond := #in~cond; {13586#(<= ~counter~0 7)} is VALID [2022-04-28 14:05:38,791 INFO L290 TraceCheckUtils]: 70: Hoare triple {13586#(<= ~counter~0 7)} assume !(0 == ~cond); {13586#(<= ~counter~0 7)} is VALID [2022-04-28 14:05:38,792 INFO L290 TraceCheckUtils]: 71: Hoare triple {13586#(<= ~counter~0 7)} assume true; {13586#(<= ~counter~0 7)} is VALID [2022-04-28 14:05:38,792 INFO L284 TraceCheckUtils]: 72: Hoare quadruple {13586#(<= ~counter~0 7)} {13586#(<= ~counter~0 7)} #71#return; {13586#(<= ~counter~0 7)} is VALID [2022-04-28 14:05:38,792 INFO L290 TraceCheckUtils]: 73: Hoare triple {13586#(<= ~counter~0 7)} assume !!(0 != ~a~0 && 0 != ~b~0); {13586#(<= ~counter~0 7)} is VALID [2022-04-28 14:05:38,793 INFO L290 TraceCheckUtils]: 74: Hoare triple {13586#(<= ~counter~0 7)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {13586#(<= ~counter~0 7)} is VALID [2022-04-28 14:05:38,793 INFO L290 TraceCheckUtils]: 75: Hoare triple {13586#(<= ~counter~0 7)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {13614#(<= |main_#t~post6| 7)} is VALID [2022-04-28 14:05:38,793 INFO L290 TraceCheckUtils]: 76: Hoare triple {13614#(<= |main_#t~post6| 7)} assume !(#t~post6 < 100);havoc #t~post6; {13377#false} is VALID [2022-04-28 14:05:38,793 INFO L272 TraceCheckUtils]: 77: Hoare triple {13377#false} call __VERIFIER_assert((if ~q~0 == ~x~0 * ~y~0 then 1 else 0)); {13377#false} is VALID [2022-04-28 14:05:38,793 INFO L290 TraceCheckUtils]: 78: Hoare triple {13377#false} ~cond := #in~cond; {13377#false} is VALID [2022-04-28 14:05:38,794 INFO L290 TraceCheckUtils]: 79: Hoare triple {13377#false} assume 0 == ~cond; {13377#false} is VALID [2022-04-28 14:05:38,794 INFO L290 TraceCheckUtils]: 80: Hoare triple {13377#false} assume !false; {13377#false} is VALID [2022-04-28 14:05:38,794 INFO L134 CoverageAnalysis]: Checked inductivity of 217 backedges. 14 proven. 203 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 14:05:38,794 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 14:05:39,202 INFO L290 TraceCheckUtils]: 80: Hoare triple {13377#false} assume !false; {13377#false} is VALID [2022-04-28 14:05:39,203 INFO L290 TraceCheckUtils]: 79: Hoare triple {13377#false} assume 0 == ~cond; {13377#false} is VALID [2022-04-28 14:05:39,203 INFO L290 TraceCheckUtils]: 78: Hoare triple {13377#false} ~cond := #in~cond; {13377#false} is VALID [2022-04-28 14:05:39,203 INFO L272 TraceCheckUtils]: 77: Hoare triple {13377#false} call __VERIFIER_assert((if ~q~0 == ~x~0 * ~y~0 then 1 else 0)); {13377#false} is VALID [2022-04-28 14:05:39,203 INFO L290 TraceCheckUtils]: 76: Hoare triple {13642#(< |main_#t~post6| 100)} assume !(#t~post6 < 100);havoc #t~post6; {13377#false} is VALID [2022-04-28 14:05:39,203 INFO L290 TraceCheckUtils]: 75: Hoare triple {13646#(< ~counter~0 100)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {13642#(< |main_#t~post6| 100)} is VALID [2022-04-28 14:05:39,203 INFO L290 TraceCheckUtils]: 74: Hoare triple {13646#(< ~counter~0 100)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {13646#(< ~counter~0 100)} is VALID [2022-04-28 14:05:39,204 INFO L290 TraceCheckUtils]: 73: Hoare triple {13646#(< ~counter~0 100)} assume !!(0 != ~a~0 && 0 != ~b~0); {13646#(< ~counter~0 100)} is VALID [2022-04-28 14:05:39,204 INFO L284 TraceCheckUtils]: 72: Hoare quadruple {13376#true} {13646#(< ~counter~0 100)} #71#return; {13646#(< ~counter~0 100)} is VALID [2022-04-28 14:05:39,204 INFO L290 TraceCheckUtils]: 71: Hoare triple {13376#true} assume true; {13376#true} is VALID [2022-04-28 14:05:39,204 INFO L290 TraceCheckUtils]: 70: Hoare triple {13376#true} assume !(0 == ~cond); {13376#true} is VALID [2022-04-28 14:05:39,204 INFO L290 TraceCheckUtils]: 69: Hoare triple {13376#true} ~cond := #in~cond; {13376#true} is VALID [2022-04-28 14:05:39,205 INFO L272 TraceCheckUtils]: 68: Hoare triple {13646#(< ~counter~0 100)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {13376#true} is VALID [2022-04-28 14:05:39,205 INFO L290 TraceCheckUtils]: 67: Hoare triple {13646#(< ~counter~0 100)} assume !!(#t~post6 < 100);havoc #t~post6; {13646#(< ~counter~0 100)} is VALID [2022-04-28 14:05:39,205 INFO L290 TraceCheckUtils]: 66: Hoare triple {13674#(< ~counter~0 99)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {13646#(< ~counter~0 100)} is VALID [2022-04-28 14:05:39,206 INFO L290 TraceCheckUtils]: 65: Hoare triple {13674#(< ~counter~0 99)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {13674#(< ~counter~0 99)} is VALID [2022-04-28 14:05:39,206 INFO L290 TraceCheckUtils]: 64: Hoare triple {13674#(< ~counter~0 99)} assume !!(0 != ~a~0 && 0 != ~b~0); {13674#(< ~counter~0 99)} is VALID [2022-04-28 14:05:39,206 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {13376#true} {13674#(< ~counter~0 99)} #71#return; {13674#(< ~counter~0 99)} is VALID [2022-04-28 14:05:39,206 INFO L290 TraceCheckUtils]: 62: Hoare triple {13376#true} assume true; {13376#true} is VALID [2022-04-28 14:05:39,206 INFO L290 TraceCheckUtils]: 61: Hoare triple {13376#true} assume !(0 == ~cond); {13376#true} is VALID [2022-04-28 14:05:39,207 INFO L290 TraceCheckUtils]: 60: Hoare triple {13376#true} ~cond := #in~cond; {13376#true} is VALID [2022-04-28 14:05:39,207 INFO L272 TraceCheckUtils]: 59: Hoare triple {13674#(< ~counter~0 99)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {13376#true} is VALID [2022-04-28 14:05:39,207 INFO L290 TraceCheckUtils]: 58: Hoare triple {13674#(< ~counter~0 99)} assume !!(#t~post6 < 100);havoc #t~post6; {13674#(< ~counter~0 99)} is VALID [2022-04-28 14:05:39,207 INFO L290 TraceCheckUtils]: 57: Hoare triple {13702#(< ~counter~0 98)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {13674#(< ~counter~0 99)} is VALID [2022-04-28 14:05:39,208 INFO L290 TraceCheckUtils]: 56: Hoare triple {13702#(< ~counter~0 98)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {13702#(< ~counter~0 98)} is VALID [2022-04-28 14:05:39,208 INFO L290 TraceCheckUtils]: 55: Hoare triple {13702#(< ~counter~0 98)} assume !!(0 != ~a~0 && 0 != ~b~0); {13702#(< ~counter~0 98)} is VALID [2022-04-28 14:05:39,208 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {13376#true} {13702#(< ~counter~0 98)} #71#return; {13702#(< ~counter~0 98)} is VALID [2022-04-28 14:05:39,208 INFO L290 TraceCheckUtils]: 53: Hoare triple {13376#true} assume true; {13376#true} is VALID [2022-04-28 14:05:39,208 INFO L290 TraceCheckUtils]: 52: Hoare triple {13376#true} assume !(0 == ~cond); {13376#true} is VALID [2022-04-28 14:05:39,208 INFO L290 TraceCheckUtils]: 51: Hoare triple {13376#true} ~cond := #in~cond; {13376#true} is VALID [2022-04-28 14:05:39,209 INFO L272 TraceCheckUtils]: 50: Hoare triple {13702#(< ~counter~0 98)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {13376#true} is VALID [2022-04-28 14:05:39,209 INFO L290 TraceCheckUtils]: 49: Hoare triple {13702#(< ~counter~0 98)} assume !!(#t~post6 < 100);havoc #t~post6; {13702#(< ~counter~0 98)} is VALID [2022-04-28 14:05:39,209 INFO L290 TraceCheckUtils]: 48: Hoare triple {13730#(< ~counter~0 97)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {13702#(< ~counter~0 98)} is VALID [2022-04-28 14:05:39,209 INFO L290 TraceCheckUtils]: 47: Hoare triple {13730#(< ~counter~0 97)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {13730#(< ~counter~0 97)} is VALID [2022-04-28 14:05:39,211 INFO L290 TraceCheckUtils]: 46: Hoare triple {13730#(< ~counter~0 97)} assume !!(0 != ~a~0 && 0 != ~b~0); {13730#(< ~counter~0 97)} is VALID [2022-04-28 14:05:39,212 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {13376#true} {13730#(< ~counter~0 97)} #71#return; {13730#(< ~counter~0 97)} is VALID [2022-04-28 14:05:39,212 INFO L290 TraceCheckUtils]: 44: Hoare triple {13376#true} assume true; {13376#true} is VALID [2022-04-28 14:05:39,212 INFO L290 TraceCheckUtils]: 43: Hoare triple {13376#true} assume !(0 == ~cond); {13376#true} is VALID [2022-04-28 14:05:39,212 INFO L290 TraceCheckUtils]: 42: Hoare triple {13376#true} ~cond := #in~cond; {13376#true} is VALID [2022-04-28 14:05:39,212 INFO L272 TraceCheckUtils]: 41: Hoare triple {13730#(< ~counter~0 97)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {13376#true} is VALID [2022-04-28 14:05:39,213 INFO L290 TraceCheckUtils]: 40: Hoare triple {13730#(< ~counter~0 97)} assume !!(#t~post6 < 100);havoc #t~post6; {13730#(< ~counter~0 97)} is VALID [2022-04-28 14:05:39,213 INFO L290 TraceCheckUtils]: 39: Hoare triple {13758#(< ~counter~0 96)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {13730#(< ~counter~0 97)} is VALID [2022-04-28 14:05:39,213 INFO L290 TraceCheckUtils]: 38: Hoare triple {13758#(< ~counter~0 96)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {13758#(< ~counter~0 96)} is VALID [2022-04-28 14:05:39,214 INFO L290 TraceCheckUtils]: 37: Hoare triple {13758#(< ~counter~0 96)} assume !!(0 != ~a~0 && 0 != ~b~0); {13758#(< ~counter~0 96)} is VALID [2022-04-28 14:05:39,214 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {13376#true} {13758#(< ~counter~0 96)} #71#return; {13758#(< ~counter~0 96)} is VALID [2022-04-28 14:05:39,215 INFO L290 TraceCheckUtils]: 35: Hoare triple {13376#true} assume true; {13376#true} is VALID [2022-04-28 14:05:39,215 INFO L290 TraceCheckUtils]: 34: Hoare triple {13376#true} assume !(0 == ~cond); {13376#true} is VALID [2022-04-28 14:05:39,215 INFO L290 TraceCheckUtils]: 33: Hoare triple {13376#true} ~cond := #in~cond; {13376#true} is VALID [2022-04-28 14:05:39,215 INFO L272 TraceCheckUtils]: 32: Hoare triple {13758#(< ~counter~0 96)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {13376#true} is VALID [2022-04-28 14:05:39,215 INFO L290 TraceCheckUtils]: 31: Hoare triple {13758#(< ~counter~0 96)} assume !!(#t~post6 < 100);havoc #t~post6; {13758#(< ~counter~0 96)} is VALID [2022-04-28 14:05:39,216 INFO L290 TraceCheckUtils]: 30: Hoare triple {13786#(< ~counter~0 95)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {13758#(< ~counter~0 96)} is VALID [2022-04-28 14:05:39,216 INFO L290 TraceCheckUtils]: 29: Hoare triple {13786#(< ~counter~0 95)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {13786#(< ~counter~0 95)} is VALID [2022-04-28 14:05:39,216 INFO L290 TraceCheckUtils]: 28: Hoare triple {13786#(< ~counter~0 95)} assume !!(0 != ~a~0 && 0 != ~b~0); {13786#(< ~counter~0 95)} is VALID [2022-04-28 14:05:39,217 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {13376#true} {13786#(< ~counter~0 95)} #71#return; {13786#(< ~counter~0 95)} is VALID [2022-04-28 14:05:39,217 INFO L290 TraceCheckUtils]: 26: Hoare triple {13376#true} assume true; {13376#true} is VALID [2022-04-28 14:05:39,217 INFO L290 TraceCheckUtils]: 25: Hoare triple {13376#true} assume !(0 == ~cond); {13376#true} is VALID [2022-04-28 14:05:39,217 INFO L290 TraceCheckUtils]: 24: Hoare triple {13376#true} ~cond := #in~cond; {13376#true} is VALID [2022-04-28 14:05:39,217 INFO L272 TraceCheckUtils]: 23: Hoare triple {13786#(< ~counter~0 95)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {13376#true} is VALID [2022-04-28 14:05:39,218 INFO L290 TraceCheckUtils]: 22: Hoare triple {13786#(< ~counter~0 95)} assume !!(#t~post6 < 100);havoc #t~post6; {13786#(< ~counter~0 95)} is VALID [2022-04-28 14:05:39,218 INFO L290 TraceCheckUtils]: 21: Hoare triple {13814#(< ~counter~0 94)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {13786#(< ~counter~0 95)} is VALID [2022-04-28 14:05:39,219 INFO L290 TraceCheckUtils]: 20: Hoare triple {13814#(< ~counter~0 94)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {13814#(< ~counter~0 94)} is VALID [2022-04-28 14:05:39,219 INFO L290 TraceCheckUtils]: 19: Hoare triple {13814#(< ~counter~0 94)} assume !!(0 != ~a~0 && 0 != ~b~0); {13814#(< ~counter~0 94)} is VALID [2022-04-28 14:05:39,220 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {13376#true} {13814#(< ~counter~0 94)} #71#return; {13814#(< ~counter~0 94)} is VALID [2022-04-28 14:05:39,220 INFO L290 TraceCheckUtils]: 17: Hoare triple {13376#true} assume true; {13376#true} is VALID [2022-04-28 14:05:39,220 INFO L290 TraceCheckUtils]: 16: Hoare triple {13376#true} assume !(0 == ~cond); {13376#true} is VALID [2022-04-28 14:05:39,220 INFO L290 TraceCheckUtils]: 15: Hoare triple {13376#true} ~cond := #in~cond; {13376#true} is VALID [2022-04-28 14:05:39,220 INFO L272 TraceCheckUtils]: 14: Hoare triple {13814#(< ~counter~0 94)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {13376#true} is VALID [2022-04-28 14:05:39,220 INFO L290 TraceCheckUtils]: 13: Hoare triple {13814#(< ~counter~0 94)} assume !!(#t~post6 < 100);havoc #t~post6; {13814#(< ~counter~0 94)} is VALID [2022-04-28 14:05:39,221 INFO L290 TraceCheckUtils]: 12: Hoare triple {13842#(< ~counter~0 93)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {13814#(< ~counter~0 94)} is VALID [2022-04-28 14:05:39,221 INFO L290 TraceCheckUtils]: 11: Hoare triple {13842#(< ~counter~0 93)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {13842#(< ~counter~0 93)} is VALID [2022-04-28 14:05:39,222 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {13376#true} {13842#(< ~counter~0 93)} #69#return; {13842#(< ~counter~0 93)} is VALID [2022-04-28 14:05:39,222 INFO L290 TraceCheckUtils]: 9: Hoare triple {13376#true} assume true; {13376#true} is VALID [2022-04-28 14:05:39,222 INFO L290 TraceCheckUtils]: 8: Hoare triple {13376#true} assume !(0 == ~cond); {13376#true} is VALID [2022-04-28 14:05:39,222 INFO L290 TraceCheckUtils]: 7: Hoare triple {13376#true} ~cond := #in~cond; {13376#true} is VALID [2022-04-28 14:05:39,222 INFO L272 TraceCheckUtils]: 6: Hoare triple {13842#(< ~counter~0 93)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {13376#true} is VALID [2022-04-28 14:05:39,222 INFO L290 TraceCheckUtils]: 5: Hoare triple {13842#(< ~counter~0 93)} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {13842#(< ~counter~0 93)} is VALID [2022-04-28 14:05:39,223 INFO L272 TraceCheckUtils]: 4: Hoare triple {13842#(< ~counter~0 93)} call #t~ret7 := main(); {13842#(< ~counter~0 93)} is VALID [2022-04-28 14:05:39,223 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13842#(< ~counter~0 93)} {13376#true} #77#return; {13842#(< ~counter~0 93)} is VALID [2022-04-28 14:05:39,223 INFO L290 TraceCheckUtils]: 2: Hoare triple {13842#(< ~counter~0 93)} assume true; {13842#(< ~counter~0 93)} is VALID [2022-04-28 14:05:39,224 INFO L290 TraceCheckUtils]: 1: Hoare triple {13376#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(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {13842#(< ~counter~0 93)} is VALID [2022-04-28 14:05:39,224 INFO L272 TraceCheckUtils]: 0: Hoare triple {13376#true} call ULTIMATE.init(); {13376#true} is VALID [2022-04-28 14:05:39,224 INFO L134 CoverageAnalysis]: Checked inductivity of 217 backedges. 14 proven. 119 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2022-04-28 14:05:39,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:05:39,225 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [801011655] [2022-04-28 14:05:39,225 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 14:05:39,225 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1247535734] [2022-04-28 14:05:39,225 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1247535734] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 14:05:39,225 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 14:05:39,225 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2022-04-28 14:05:39,225 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:05:39,225 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1999325889] [2022-04-28 14:05:39,225 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1999325889] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:05:39,226 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:05:39,226 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-28 14:05:39,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [544743906] [2022-04-28 14:05:39,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:05:39,226 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.545454545454546) internal successors, (61), 10 states have internal predecessors, (61), 10 states have call successors, (11), 10 states have call predecessors, (11), 8 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) Word has length 81 [2022-04-28 14:05:39,226 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:05:39,227 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 5.545454545454546) internal successors, (61), 10 states have internal predecessors, (61), 10 states have call successors, (11), 10 states have call predecessors, (11), 8 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-28 14:05:39,293 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 81 edges. 81 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:05:39,294 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-28 14:05:39,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:05:39,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-28 14:05:39,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=222, Unknown=0, NotChecked=0, Total=380 [2022-04-28 14:05:39,294 INFO L87 Difference]: Start difference. First operand 109 states and 132 transitions. Second operand has 11 states, 11 states have (on average 5.545454545454546) internal successors, (61), 10 states have internal predecessors, (61), 10 states have call successors, (11), 10 states have call predecessors, (11), 8 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-28 14:05:39,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:05:39,803 INFO L93 Difference]: Finished difference Result 128 states and 155 transitions. [2022-04-28 14:05:39,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-04-28 14:05:39,803 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.545454545454546) internal successors, (61), 10 states have internal predecessors, (61), 10 states have call successors, (11), 10 states have call predecessors, (11), 8 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) Word has length 81 [2022-04-28 14:05:39,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:05:39,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 5.545454545454546) internal successors, (61), 10 states have internal predecessors, (61), 10 states have call successors, (11), 10 states have call predecessors, (11), 8 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-28 14:05:39,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 141 transitions. [2022-04-28 14:05:39,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 5.545454545454546) internal successors, (61), 10 states have internal predecessors, (61), 10 states have call successors, (11), 10 states have call predecessors, (11), 8 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-28 14:05:39,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 141 transitions. [2022-04-28 14:05:39,807 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 141 transitions. [2022-04-28 14:05:39,938 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 14:05:39,940 INFO L225 Difference]: With dead ends: 128 [2022-04-28 14:05:39,940 INFO L226 Difference]: Without dead ends: 120 [2022-04-28 14:05:39,940 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=291, Invalid=411, Unknown=0, NotChecked=0, Total=702 [2022-04-28 14:05:39,941 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 67 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 14:05:39,941 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 186 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 14:05:39,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2022-04-28 14:05:40,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2022-04-28 14:05:40,170 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:05:40,171 INFO L82 GeneralOperation]: Start isEquivalent. First operand 120 states. Second operand has 120 states, 93 states have (on average 1.2903225806451613) internal successors, (120), 94 states have internal predecessors, (120), 14 states have call successors, (14), 13 states have call predecessors, (14), 12 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-28 14:05:40,171 INFO L74 IsIncluded]: Start isIncluded. First operand 120 states. Second operand has 120 states, 93 states have (on average 1.2903225806451613) internal successors, (120), 94 states have internal predecessors, (120), 14 states have call successors, (14), 13 states have call predecessors, (14), 12 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-28 14:05:40,171 INFO L87 Difference]: Start difference. First operand 120 states. Second operand has 120 states, 93 states have (on average 1.2903225806451613) internal successors, (120), 94 states have internal predecessors, (120), 14 states have call successors, (14), 13 states have call predecessors, (14), 12 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-28 14:05:40,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:05:40,173 INFO L93 Difference]: Finished difference Result 120 states and 146 transitions. [2022-04-28 14:05:40,173 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 146 transitions. [2022-04-28 14:05:40,174 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:05:40,174 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:05:40,174 INFO L74 IsIncluded]: Start isIncluded. First operand has 120 states, 93 states have (on average 1.2903225806451613) internal successors, (120), 94 states have internal predecessors, (120), 14 states have call successors, (14), 13 states have call predecessors, (14), 12 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand 120 states. [2022-04-28 14:05:40,174 INFO L87 Difference]: Start difference. First operand has 120 states, 93 states have (on average 1.2903225806451613) internal successors, (120), 94 states have internal predecessors, (120), 14 states have call successors, (14), 13 states have call predecessors, (14), 12 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand 120 states. [2022-04-28 14:05:40,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:05:40,176 INFO L93 Difference]: Finished difference Result 120 states and 146 transitions. [2022-04-28 14:05:40,176 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 146 transitions. [2022-04-28 14:05:40,176 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:05:40,176 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:05:40,176 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:05:40,177 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:05:40,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 93 states have (on average 1.2903225806451613) internal successors, (120), 94 states have internal predecessors, (120), 14 states have call successors, (14), 13 states have call predecessors, (14), 12 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-28 14:05:40,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 146 transitions. [2022-04-28 14:05:40,189 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 146 transitions. Word has length 81 [2022-04-28 14:05:40,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:05:40,189 INFO L495 AbstractCegarLoop]: Abstraction has 120 states and 146 transitions. [2022-04-28 14:05:40,189 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.545454545454546) internal successors, (61), 10 states have internal predecessors, (61), 10 states have call successors, (11), 10 states have call predecessors, (11), 8 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-28 14:05:40,190 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 120 states and 146 transitions. [2022-04-28 14:05:55,408 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 146 edges. 139 inductive. 0 not inductive. 7 times theorem prover too weak to decide inductivity. [2022-04-28 14:05:55,408 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 146 transitions. [2022-04-28 14:05:55,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2022-04-28 14:05:55,409 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:05:55,409 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 14:05:55,435 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2022-04-28 14:05:55,609 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2022-04-28 14:05:55,610 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:05:55,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:05:55,610 INFO L85 PathProgramCache]: Analyzing trace with hash -1054018310, now seen corresponding path program 15 times [2022-04-28 14:05:55,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:05:55,610 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1914857508] [2022-04-28 14:06:01,661 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 14:06:01,661 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 14:06:01,661 INFO L85 PathProgramCache]: Analyzing trace with hash -1054018310, now seen corresponding path program 16 times [2022-04-28 14:06:01,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:06:01,661 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [262351492] [2022-04-28 14:06:01,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:06:01,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:06:01,674 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 14:06:01,675 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [209269071] [2022-04-28 14:06:01,675 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 14:06:01,675 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 14:06:01,675 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 14:06:01,676 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 14:06:01,677 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-04-28 14:06:01,765 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 14:06:01,766 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 14:06:01,767 INFO L263 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 21 conjunts are in the unsatisfiable core [2022-04-28 14:06:01,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:06:01,785 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 14:06:02,215 INFO L272 TraceCheckUtils]: 0: Hoare triple {14631#true} call ULTIMATE.init(); {14631#true} is VALID [2022-04-28 14:06:02,216 INFO L290 TraceCheckUtils]: 1: Hoare triple {14631#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(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {14639#(<= ~counter~0 0)} is VALID [2022-04-28 14:06:02,216 INFO L290 TraceCheckUtils]: 2: Hoare triple {14639#(<= ~counter~0 0)} assume true; {14639#(<= ~counter~0 0)} is VALID [2022-04-28 14:06:02,216 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14639#(<= ~counter~0 0)} {14631#true} #77#return; {14639#(<= ~counter~0 0)} is VALID [2022-04-28 14:06:02,217 INFO L272 TraceCheckUtils]: 4: Hoare triple {14639#(<= ~counter~0 0)} call #t~ret7 := main(); {14639#(<= ~counter~0 0)} is VALID [2022-04-28 14:06:02,217 INFO L290 TraceCheckUtils]: 5: Hoare triple {14639#(<= ~counter~0 0)} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {14639#(<= ~counter~0 0)} is VALID [2022-04-28 14:06:02,217 INFO L272 TraceCheckUtils]: 6: Hoare triple {14639#(<= ~counter~0 0)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {14639#(<= ~counter~0 0)} is VALID [2022-04-28 14:06:02,218 INFO L290 TraceCheckUtils]: 7: Hoare triple {14639#(<= ~counter~0 0)} ~cond := #in~cond; {14639#(<= ~counter~0 0)} is VALID [2022-04-28 14:06:02,218 INFO L290 TraceCheckUtils]: 8: Hoare triple {14639#(<= ~counter~0 0)} assume !(0 == ~cond); {14639#(<= ~counter~0 0)} is VALID [2022-04-28 14:06:02,218 INFO L290 TraceCheckUtils]: 9: Hoare triple {14639#(<= ~counter~0 0)} assume true; {14639#(<= ~counter~0 0)} is VALID [2022-04-28 14:06:02,219 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {14639#(<= ~counter~0 0)} {14639#(<= ~counter~0 0)} #69#return; {14639#(<= ~counter~0 0)} is VALID [2022-04-28 14:06:02,219 INFO L290 TraceCheckUtils]: 11: Hoare triple {14639#(<= ~counter~0 0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {14639#(<= ~counter~0 0)} is VALID [2022-04-28 14:06:02,219 INFO L290 TraceCheckUtils]: 12: Hoare triple {14639#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {14673#(<= ~counter~0 1)} is VALID [2022-04-28 14:06:02,220 INFO L290 TraceCheckUtils]: 13: Hoare triple {14673#(<= ~counter~0 1)} assume !!(#t~post6 < 100);havoc #t~post6; {14673#(<= ~counter~0 1)} is VALID [2022-04-28 14:06:02,220 INFO L272 TraceCheckUtils]: 14: Hoare triple {14673#(<= ~counter~0 1)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {14673#(<= ~counter~0 1)} is VALID [2022-04-28 14:06:02,220 INFO L290 TraceCheckUtils]: 15: Hoare triple {14673#(<= ~counter~0 1)} ~cond := #in~cond; {14673#(<= ~counter~0 1)} is VALID [2022-04-28 14:06:02,221 INFO L290 TraceCheckUtils]: 16: Hoare triple {14673#(<= ~counter~0 1)} assume !(0 == ~cond); {14673#(<= ~counter~0 1)} is VALID [2022-04-28 14:06:02,221 INFO L290 TraceCheckUtils]: 17: Hoare triple {14673#(<= ~counter~0 1)} assume true; {14673#(<= ~counter~0 1)} is VALID [2022-04-28 14:06:02,222 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {14673#(<= ~counter~0 1)} {14673#(<= ~counter~0 1)} #71#return; {14673#(<= ~counter~0 1)} is VALID [2022-04-28 14:06:02,222 INFO L290 TraceCheckUtils]: 19: Hoare triple {14673#(<= ~counter~0 1)} assume !!(0 != ~a~0 && 0 != ~b~0); {14673#(<= ~counter~0 1)} is VALID [2022-04-28 14:06:02,222 INFO L290 TraceCheckUtils]: 20: Hoare triple {14673#(<= ~counter~0 1)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {14673#(<= ~counter~0 1)} is VALID [2022-04-28 14:06:02,223 INFO L290 TraceCheckUtils]: 21: Hoare triple {14673#(<= ~counter~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {14701#(<= ~counter~0 2)} is VALID [2022-04-28 14:06:02,223 INFO L290 TraceCheckUtils]: 22: Hoare triple {14701#(<= ~counter~0 2)} assume !!(#t~post6 < 100);havoc #t~post6; {14701#(<= ~counter~0 2)} is VALID [2022-04-28 14:06:02,223 INFO L272 TraceCheckUtils]: 23: Hoare triple {14701#(<= ~counter~0 2)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {14701#(<= ~counter~0 2)} is VALID [2022-04-28 14:06:02,224 INFO L290 TraceCheckUtils]: 24: Hoare triple {14701#(<= ~counter~0 2)} ~cond := #in~cond; {14701#(<= ~counter~0 2)} is VALID [2022-04-28 14:06:02,224 INFO L290 TraceCheckUtils]: 25: Hoare triple {14701#(<= ~counter~0 2)} assume !(0 == ~cond); {14701#(<= ~counter~0 2)} is VALID [2022-04-28 14:06:02,224 INFO L290 TraceCheckUtils]: 26: Hoare triple {14701#(<= ~counter~0 2)} assume true; {14701#(<= ~counter~0 2)} is VALID [2022-04-28 14:06:02,225 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {14701#(<= ~counter~0 2)} {14701#(<= ~counter~0 2)} #71#return; {14701#(<= ~counter~0 2)} is VALID [2022-04-28 14:06:02,225 INFO L290 TraceCheckUtils]: 28: Hoare triple {14701#(<= ~counter~0 2)} assume !!(0 != ~a~0 && 0 != ~b~0); {14701#(<= ~counter~0 2)} is VALID [2022-04-28 14:06:02,225 INFO L290 TraceCheckUtils]: 29: Hoare triple {14701#(<= ~counter~0 2)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {14701#(<= ~counter~0 2)} is VALID [2022-04-28 14:06:02,226 INFO L290 TraceCheckUtils]: 30: Hoare triple {14701#(<= ~counter~0 2)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {14729#(<= ~counter~0 3)} is VALID [2022-04-28 14:06:02,226 INFO L290 TraceCheckUtils]: 31: Hoare triple {14729#(<= ~counter~0 3)} assume !!(#t~post6 < 100);havoc #t~post6; {14729#(<= ~counter~0 3)} is VALID [2022-04-28 14:06:02,226 INFO L272 TraceCheckUtils]: 32: Hoare triple {14729#(<= ~counter~0 3)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {14729#(<= ~counter~0 3)} is VALID [2022-04-28 14:06:02,227 INFO L290 TraceCheckUtils]: 33: Hoare triple {14729#(<= ~counter~0 3)} ~cond := #in~cond; {14729#(<= ~counter~0 3)} is VALID [2022-04-28 14:06:02,227 INFO L290 TraceCheckUtils]: 34: Hoare triple {14729#(<= ~counter~0 3)} assume !(0 == ~cond); {14729#(<= ~counter~0 3)} is VALID [2022-04-28 14:06:02,227 INFO L290 TraceCheckUtils]: 35: Hoare triple {14729#(<= ~counter~0 3)} assume true; {14729#(<= ~counter~0 3)} is VALID [2022-04-28 14:06:02,228 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {14729#(<= ~counter~0 3)} {14729#(<= ~counter~0 3)} #71#return; {14729#(<= ~counter~0 3)} is VALID [2022-04-28 14:06:02,228 INFO L290 TraceCheckUtils]: 37: Hoare triple {14729#(<= ~counter~0 3)} assume !!(0 != ~a~0 && 0 != ~b~0); {14729#(<= ~counter~0 3)} is VALID [2022-04-28 14:06:02,228 INFO L290 TraceCheckUtils]: 38: Hoare triple {14729#(<= ~counter~0 3)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {14729#(<= ~counter~0 3)} is VALID [2022-04-28 14:06:02,229 INFO L290 TraceCheckUtils]: 39: Hoare triple {14729#(<= ~counter~0 3)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {14757#(<= ~counter~0 4)} is VALID [2022-04-28 14:06:02,229 INFO L290 TraceCheckUtils]: 40: Hoare triple {14757#(<= ~counter~0 4)} assume !!(#t~post6 < 100);havoc #t~post6; {14757#(<= ~counter~0 4)} is VALID [2022-04-28 14:06:02,230 INFO L272 TraceCheckUtils]: 41: Hoare triple {14757#(<= ~counter~0 4)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {14757#(<= ~counter~0 4)} is VALID [2022-04-28 14:06:02,230 INFO L290 TraceCheckUtils]: 42: Hoare triple {14757#(<= ~counter~0 4)} ~cond := #in~cond; {14757#(<= ~counter~0 4)} is VALID [2022-04-28 14:06:02,230 INFO L290 TraceCheckUtils]: 43: Hoare triple {14757#(<= ~counter~0 4)} assume !(0 == ~cond); {14757#(<= ~counter~0 4)} is VALID [2022-04-28 14:06:02,230 INFO L290 TraceCheckUtils]: 44: Hoare triple {14757#(<= ~counter~0 4)} assume true; {14757#(<= ~counter~0 4)} is VALID [2022-04-28 14:06:02,231 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {14757#(<= ~counter~0 4)} {14757#(<= ~counter~0 4)} #71#return; {14757#(<= ~counter~0 4)} is VALID [2022-04-28 14:06:02,231 INFO L290 TraceCheckUtils]: 46: Hoare triple {14757#(<= ~counter~0 4)} assume !!(0 != ~a~0 && 0 != ~b~0); {14757#(<= ~counter~0 4)} is VALID [2022-04-28 14:06:02,231 INFO L290 TraceCheckUtils]: 47: Hoare triple {14757#(<= ~counter~0 4)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {14757#(<= ~counter~0 4)} is VALID [2022-04-28 14:06:02,232 INFO L290 TraceCheckUtils]: 48: Hoare triple {14757#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {14785#(<= ~counter~0 5)} is VALID [2022-04-28 14:06:02,232 INFO L290 TraceCheckUtils]: 49: Hoare triple {14785#(<= ~counter~0 5)} assume !!(#t~post6 < 100);havoc #t~post6; {14785#(<= ~counter~0 5)} is VALID [2022-04-28 14:06:02,233 INFO L272 TraceCheckUtils]: 50: Hoare triple {14785#(<= ~counter~0 5)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {14785#(<= ~counter~0 5)} is VALID [2022-04-28 14:06:02,233 INFO L290 TraceCheckUtils]: 51: Hoare triple {14785#(<= ~counter~0 5)} ~cond := #in~cond; {14785#(<= ~counter~0 5)} is VALID [2022-04-28 14:06:02,233 INFO L290 TraceCheckUtils]: 52: Hoare triple {14785#(<= ~counter~0 5)} assume !(0 == ~cond); {14785#(<= ~counter~0 5)} is VALID [2022-04-28 14:06:02,233 INFO L290 TraceCheckUtils]: 53: Hoare triple {14785#(<= ~counter~0 5)} assume true; {14785#(<= ~counter~0 5)} is VALID [2022-04-28 14:06:02,234 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {14785#(<= ~counter~0 5)} {14785#(<= ~counter~0 5)} #71#return; {14785#(<= ~counter~0 5)} is VALID [2022-04-28 14:06:02,234 INFO L290 TraceCheckUtils]: 55: Hoare triple {14785#(<= ~counter~0 5)} assume !!(0 != ~a~0 && 0 != ~b~0); {14785#(<= ~counter~0 5)} is VALID [2022-04-28 14:06:02,235 INFO L290 TraceCheckUtils]: 56: Hoare triple {14785#(<= ~counter~0 5)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {14785#(<= ~counter~0 5)} is VALID [2022-04-28 14:06:02,235 INFO L290 TraceCheckUtils]: 57: Hoare triple {14785#(<= ~counter~0 5)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {14813#(<= ~counter~0 6)} is VALID [2022-04-28 14:06:02,235 INFO L290 TraceCheckUtils]: 58: Hoare triple {14813#(<= ~counter~0 6)} assume !!(#t~post6 < 100);havoc #t~post6; {14813#(<= ~counter~0 6)} is VALID [2022-04-28 14:06:02,236 INFO L272 TraceCheckUtils]: 59: Hoare triple {14813#(<= ~counter~0 6)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {14813#(<= ~counter~0 6)} is VALID [2022-04-28 14:06:02,236 INFO L290 TraceCheckUtils]: 60: Hoare triple {14813#(<= ~counter~0 6)} ~cond := #in~cond; {14813#(<= ~counter~0 6)} is VALID [2022-04-28 14:06:02,236 INFO L290 TraceCheckUtils]: 61: Hoare triple {14813#(<= ~counter~0 6)} assume !(0 == ~cond); {14813#(<= ~counter~0 6)} is VALID [2022-04-28 14:06:02,237 INFO L290 TraceCheckUtils]: 62: Hoare triple {14813#(<= ~counter~0 6)} assume true; {14813#(<= ~counter~0 6)} is VALID [2022-04-28 14:06:02,237 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {14813#(<= ~counter~0 6)} {14813#(<= ~counter~0 6)} #71#return; {14813#(<= ~counter~0 6)} is VALID [2022-04-28 14:06:02,237 INFO L290 TraceCheckUtils]: 64: Hoare triple {14813#(<= ~counter~0 6)} assume !!(0 != ~a~0 && 0 != ~b~0); {14813#(<= ~counter~0 6)} is VALID [2022-04-28 14:06:02,238 INFO L290 TraceCheckUtils]: 65: Hoare triple {14813#(<= ~counter~0 6)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {14813#(<= ~counter~0 6)} is VALID [2022-04-28 14:06:02,238 INFO L290 TraceCheckUtils]: 66: Hoare triple {14813#(<= ~counter~0 6)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {14841#(<= ~counter~0 7)} is VALID [2022-04-28 14:06:02,238 INFO L290 TraceCheckUtils]: 67: Hoare triple {14841#(<= ~counter~0 7)} assume !!(#t~post6 < 100);havoc #t~post6; {14841#(<= ~counter~0 7)} is VALID [2022-04-28 14:06:02,239 INFO L272 TraceCheckUtils]: 68: Hoare triple {14841#(<= ~counter~0 7)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {14841#(<= ~counter~0 7)} is VALID [2022-04-28 14:06:02,239 INFO L290 TraceCheckUtils]: 69: Hoare triple {14841#(<= ~counter~0 7)} ~cond := #in~cond; {14841#(<= ~counter~0 7)} is VALID [2022-04-28 14:06:02,239 INFO L290 TraceCheckUtils]: 70: Hoare triple {14841#(<= ~counter~0 7)} assume !(0 == ~cond); {14841#(<= ~counter~0 7)} is VALID [2022-04-28 14:06:02,240 INFO L290 TraceCheckUtils]: 71: Hoare triple {14841#(<= ~counter~0 7)} assume true; {14841#(<= ~counter~0 7)} is VALID [2022-04-28 14:06:02,240 INFO L284 TraceCheckUtils]: 72: Hoare quadruple {14841#(<= ~counter~0 7)} {14841#(<= ~counter~0 7)} #71#return; {14841#(<= ~counter~0 7)} is VALID [2022-04-28 14:06:02,241 INFO L290 TraceCheckUtils]: 73: Hoare triple {14841#(<= ~counter~0 7)} assume !!(0 != ~a~0 && 0 != ~b~0); {14841#(<= ~counter~0 7)} is VALID [2022-04-28 14:06:02,241 INFO L290 TraceCheckUtils]: 74: Hoare triple {14841#(<= ~counter~0 7)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {14841#(<= ~counter~0 7)} is VALID [2022-04-28 14:06:02,241 INFO L290 TraceCheckUtils]: 75: Hoare triple {14841#(<= ~counter~0 7)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {14869#(<= ~counter~0 8)} is VALID [2022-04-28 14:06:02,241 INFO L290 TraceCheckUtils]: 76: Hoare triple {14869#(<= ~counter~0 8)} assume !!(#t~post6 < 100);havoc #t~post6; {14869#(<= ~counter~0 8)} is VALID [2022-04-28 14:06:02,242 INFO L272 TraceCheckUtils]: 77: Hoare triple {14869#(<= ~counter~0 8)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {14869#(<= ~counter~0 8)} is VALID [2022-04-28 14:06:02,242 INFO L290 TraceCheckUtils]: 78: Hoare triple {14869#(<= ~counter~0 8)} ~cond := #in~cond; {14869#(<= ~counter~0 8)} is VALID [2022-04-28 14:06:02,243 INFO L290 TraceCheckUtils]: 79: Hoare triple {14869#(<= ~counter~0 8)} assume !(0 == ~cond); {14869#(<= ~counter~0 8)} is VALID [2022-04-28 14:06:02,243 INFO L290 TraceCheckUtils]: 80: Hoare triple {14869#(<= ~counter~0 8)} assume true; {14869#(<= ~counter~0 8)} is VALID [2022-04-28 14:06:02,243 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {14869#(<= ~counter~0 8)} {14869#(<= ~counter~0 8)} #71#return; {14869#(<= ~counter~0 8)} is VALID [2022-04-28 14:06:02,244 INFO L290 TraceCheckUtils]: 82: Hoare triple {14869#(<= ~counter~0 8)} assume !!(0 != ~a~0 && 0 != ~b~0); {14869#(<= ~counter~0 8)} is VALID [2022-04-28 14:06:02,244 INFO L290 TraceCheckUtils]: 83: Hoare triple {14869#(<= ~counter~0 8)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {14869#(<= ~counter~0 8)} is VALID [2022-04-28 14:06:02,244 INFO L290 TraceCheckUtils]: 84: Hoare triple {14869#(<= ~counter~0 8)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {14897#(<= |main_#t~post6| 8)} is VALID [2022-04-28 14:06:02,245 INFO L290 TraceCheckUtils]: 85: Hoare triple {14897#(<= |main_#t~post6| 8)} assume !(#t~post6 < 100);havoc #t~post6; {14632#false} is VALID [2022-04-28 14:06:02,245 INFO L272 TraceCheckUtils]: 86: Hoare triple {14632#false} call __VERIFIER_assert((if ~q~0 == ~x~0 * ~y~0 then 1 else 0)); {14632#false} is VALID [2022-04-28 14:06:02,245 INFO L290 TraceCheckUtils]: 87: Hoare triple {14632#false} ~cond := #in~cond; {14632#false} is VALID [2022-04-28 14:06:02,245 INFO L290 TraceCheckUtils]: 88: Hoare triple {14632#false} assume 0 == ~cond; {14632#false} is VALID [2022-04-28 14:06:02,245 INFO L290 TraceCheckUtils]: 89: Hoare triple {14632#false} assume !false; {14632#false} is VALID [2022-04-28 14:06:02,245 INFO L134 CoverageAnalysis]: Checked inductivity of 284 backedges. 16 proven. 268 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 14:06:02,245 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 14:06:02,740 INFO L290 TraceCheckUtils]: 89: Hoare triple {14632#false} assume !false; {14632#false} is VALID [2022-04-28 14:06:02,740 INFO L290 TraceCheckUtils]: 88: Hoare triple {14632#false} assume 0 == ~cond; {14632#false} is VALID [2022-04-28 14:06:02,740 INFO L290 TraceCheckUtils]: 87: Hoare triple {14632#false} ~cond := #in~cond; {14632#false} is VALID [2022-04-28 14:06:02,740 INFO L272 TraceCheckUtils]: 86: Hoare triple {14632#false} call __VERIFIER_assert((if ~q~0 == ~x~0 * ~y~0 then 1 else 0)); {14632#false} is VALID [2022-04-28 14:06:02,741 INFO L290 TraceCheckUtils]: 85: Hoare triple {14925#(< |main_#t~post6| 100)} assume !(#t~post6 < 100);havoc #t~post6; {14632#false} is VALID [2022-04-28 14:06:02,741 INFO L290 TraceCheckUtils]: 84: Hoare triple {14929#(< ~counter~0 100)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {14925#(< |main_#t~post6| 100)} is VALID [2022-04-28 14:06:02,741 INFO L290 TraceCheckUtils]: 83: Hoare triple {14929#(< ~counter~0 100)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {14929#(< ~counter~0 100)} is VALID [2022-04-28 14:06:02,742 INFO L290 TraceCheckUtils]: 82: Hoare triple {14929#(< ~counter~0 100)} assume !!(0 != ~a~0 && 0 != ~b~0); {14929#(< ~counter~0 100)} is VALID [2022-04-28 14:06:02,742 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {14631#true} {14929#(< ~counter~0 100)} #71#return; {14929#(< ~counter~0 100)} is VALID [2022-04-28 14:06:02,742 INFO L290 TraceCheckUtils]: 80: Hoare triple {14631#true} assume true; {14631#true} is VALID [2022-04-28 14:06:02,742 INFO L290 TraceCheckUtils]: 79: Hoare triple {14631#true} assume !(0 == ~cond); {14631#true} is VALID [2022-04-28 14:06:02,742 INFO L290 TraceCheckUtils]: 78: Hoare triple {14631#true} ~cond := #in~cond; {14631#true} is VALID [2022-04-28 14:06:02,742 INFO L272 TraceCheckUtils]: 77: Hoare triple {14929#(< ~counter~0 100)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {14631#true} is VALID [2022-04-28 14:06:02,743 INFO L290 TraceCheckUtils]: 76: Hoare triple {14929#(< ~counter~0 100)} assume !!(#t~post6 < 100);havoc #t~post6; {14929#(< ~counter~0 100)} is VALID [2022-04-28 14:06:02,743 INFO L290 TraceCheckUtils]: 75: Hoare triple {14957#(< ~counter~0 99)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {14929#(< ~counter~0 100)} is VALID [2022-04-28 14:06:02,743 INFO L290 TraceCheckUtils]: 74: Hoare triple {14957#(< ~counter~0 99)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {14957#(< ~counter~0 99)} is VALID [2022-04-28 14:06:02,744 INFO L290 TraceCheckUtils]: 73: Hoare triple {14957#(< ~counter~0 99)} assume !!(0 != ~a~0 && 0 != ~b~0); {14957#(< ~counter~0 99)} is VALID [2022-04-28 14:06:02,744 INFO L284 TraceCheckUtils]: 72: Hoare quadruple {14631#true} {14957#(< ~counter~0 99)} #71#return; {14957#(< ~counter~0 99)} is VALID [2022-04-28 14:06:02,744 INFO L290 TraceCheckUtils]: 71: Hoare triple {14631#true} assume true; {14631#true} is VALID [2022-04-28 14:06:02,744 INFO L290 TraceCheckUtils]: 70: Hoare triple {14631#true} assume !(0 == ~cond); {14631#true} is VALID [2022-04-28 14:06:02,744 INFO L290 TraceCheckUtils]: 69: Hoare triple {14631#true} ~cond := #in~cond; {14631#true} is VALID [2022-04-28 14:06:02,744 INFO L272 TraceCheckUtils]: 68: Hoare triple {14957#(< ~counter~0 99)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {14631#true} is VALID [2022-04-28 14:06:02,745 INFO L290 TraceCheckUtils]: 67: Hoare triple {14957#(< ~counter~0 99)} assume !!(#t~post6 < 100);havoc #t~post6; {14957#(< ~counter~0 99)} is VALID [2022-04-28 14:06:02,745 INFO L290 TraceCheckUtils]: 66: Hoare triple {14985#(< ~counter~0 98)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {14957#(< ~counter~0 99)} is VALID [2022-04-28 14:06:02,745 INFO L290 TraceCheckUtils]: 65: Hoare triple {14985#(< ~counter~0 98)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {14985#(< ~counter~0 98)} is VALID [2022-04-28 14:06:02,746 INFO L290 TraceCheckUtils]: 64: Hoare triple {14985#(< ~counter~0 98)} assume !!(0 != ~a~0 && 0 != ~b~0); {14985#(< ~counter~0 98)} is VALID [2022-04-28 14:06:02,746 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {14631#true} {14985#(< ~counter~0 98)} #71#return; {14985#(< ~counter~0 98)} is VALID [2022-04-28 14:06:02,746 INFO L290 TraceCheckUtils]: 62: Hoare triple {14631#true} assume true; {14631#true} is VALID [2022-04-28 14:06:02,746 INFO L290 TraceCheckUtils]: 61: Hoare triple {14631#true} assume !(0 == ~cond); {14631#true} is VALID [2022-04-28 14:06:02,746 INFO L290 TraceCheckUtils]: 60: Hoare triple {14631#true} ~cond := #in~cond; {14631#true} is VALID [2022-04-28 14:06:02,746 INFO L272 TraceCheckUtils]: 59: Hoare triple {14985#(< ~counter~0 98)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {14631#true} is VALID [2022-04-28 14:06:02,747 INFO L290 TraceCheckUtils]: 58: Hoare triple {14985#(< ~counter~0 98)} assume !!(#t~post6 < 100);havoc #t~post6; {14985#(< ~counter~0 98)} is VALID [2022-04-28 14:06:02,747 INFO L290 TraceCheckUtils]: 57: Hoare triple {15013#(< ~counter~0 97)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {14985#(< ~counter~0 98)} is VALID [2022-04-28 14:06:02,747 INFO L290 TraceCheckUtils]: 56: Hoare triple {15013#(< ~counter~0 97)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {15013#(< ~counter~0 97)} is VALID [2022-04-28 14:06:02,748 INFO L290 TraceCheckUtils]: 55: Hoare triple {15013#(< ~counter~0 97)} assume !!(0 != ~a~0 && 0 != ~b~0); {15013#(< ~counter~0 97)} is VALID [2022-04-28 14:06:02,748 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {14631#true} {15013#(< ~counter~0 97)} #71#return; {15013#(< ~counter~0 97)} is VALID [2022-04-28 14:06:02,748 INFO L290 TraceCheckUtils]: 53: Hoare triple {14631#true} assume true; {14631#true} is VALID [2022-04-28 14:06:02,748 INFO L290 TraceCheckUtils]: 52: Hoare triple {14631#true} assume !(0 == ~cond); {14631#true} is VALID [2022-04-28 14:06:02,748 INFO L290 TraceCheckUtils]: 51: Hoare triple {14631#true} ~cond := #in~cond; {14631#true} is VALID [2022-04-28 14:06:02,748 INFO L272 TraceCheckUtils]: 50: Hoare triple {15013#(< ~counter~0 97)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {14631#true} is VALID [2022-04-28 14:06:02,749 INFO L290 TraceCheckUtils]: 49: Hoare triple {15013#(< ~counter~0 97)} assume !!(#t~post6 < 100);havoc #t~post6; {15013#(< ~counter~0 97)} is VALID [2022-04-28 14:06:02,749 INFO L290 TraceCheckUtils]: 48: Hoare triple {15041#(< ~counter~0 96)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {15013#(< ~counter~0 97)} is VALID [2022-04-28 14:06:02,749 INFO L290 TraceCheckUtils]: 47: Hoare triple {15041#(< ~counter~0 96)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {15041#(< ~counter~0 96)} is VALID [2022-04-28 14:06:02,749 INFO L290 TraceCheckUtils]: 46: Hoare triple {15041#(< ~counter~0 96)} assume !!(0 != ~a~0 && 0 != ~b~0); {15041#(< ~counter~0 96)} is VALID [2022-04-28 14:06:02,750 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {14631#true} {15041#(< ~counter~0 96)} #71#return; {15041#(< ~counter~0 96)} is VALID [2022-04-28 14:06:02,750 INFO L290 TraceCheckUtils]: 44: Hoare triple {14631#true} assume true; {14631#true} is VALID [2022-04-28 14:06:02,750 INFO L290 TraceCheckUtils]: 43: Hoare triple {14631#true} assume !(0 == ~cond); {14631#true} is VALID [2022-04-28 14:06:02,750 INFO L290 TraceCheckUtils]: 42: Hoare triple {14631#true} ~cond := #in~cond; {14631#true} is VALID [2022-04-28 14:06:02,750 INFO L272 TraceCheckUtils]: 41: Hoare triple {15041#(< ~counter~0 96)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {14631#true} is VALID [2022-04-28 14:06:02,750 INFO L290 TraceCheckUtils]: 40: Hoare triple {15041#(< ~counter~0 96)} assume !!(#t~post6 < 100);havoc #t~post6; {15041#(< ~counter~0 96)} is VALID [2022-04-28 14:06:02,751 INFO L290 TraceCheckUtils]: 39: Hoare triple {15069#(< ~counter~0 95)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {15041#(< ~counter~0 96)} is VALID [2022-04-28 14:06:02,751 INFO L290 TraceCheckUtils]: 38: Hoare triple {15069#(< ~counter~0 95)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {15069#(< ~counter~0 95)} is VALID [2022-04-28 14:06:02,751 INFO L290 TraceCheckUtils]: 37: Hoare triple {15069#(< ~counter~0 95)} assume !!(0 != ~a~0 && 0 != ~b~0); {15069#(< ~counter~0 95)} is VALID [2022-04-28 14:06:02,752 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {14631#true} {15069#(< ~counter~0 95)} #71#return; {15069#(< ~counter~0 95)} is VALID [2022-04-28 14:06:02,752 INFO L290 TraceCheckUtils]: 35: Hoare triple {14631#true} assume true; {14631#true} is VALID [2022-04-28 14:06:02,752 INFO L290 TraceCheckUtils]: 34: Hoare triple {14631#true} assume !(0 == ~cond); {14631#true} is VALID [2022-04-28 14:06:02,752 INFO L290 TraceCheckUtils]: 33: Hoare triple {14631#true} ~cond := #in~cond; {14631#true} is VALID [2022-04-28 14:06:02,752 INFO L272 TraceCheckUtils]: 32: Hoare triple {15069#(< ~counter~0 95)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {14631#true} is VALID [2022-04-28 14:06:02,752 INFO L290 TraceCheckUtils]: 31: Hoare triple {15069#(< ~counter~0 95)} assume !!(#t~post6 < 100);havoc #t~post6; {15069#(< ~counter~0 95)} is VALID [2022-04-28 14:06:02,753 INFO L290 TraceCheckUtils]: 30: Hoare triple {15097#(< ~counter~0 94)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {15069#(< ~counter~0 95)} is VALID [2022-04-28 14:06:02,753 INFO L290 TraceCheckUtils]: 29: Hoare triple {15097#(< ~counter~0 94)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {15097#(< ~counter~0 94)} is VALID [2022-04-28 14:06:02,753 INFO L290 TraceCheckUtils]: 28: Hoare triple {15097#(< ~counter~0 94)} assume !!(0 != ~a~0 && 0 != ~b~0); {15097#(< ~counter~0 94)} is VALID [2022-04-28 14:06:02,754 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {14631#true} {15097#(< ~counter~0 94)} #71#return; {15097#(< ~counter~0 94)} is VALID [2022-04-28 14:06:02,754 INFO L290 TraceCheckUtils]: 26: Hoare triple {14631#true} assume true; {14631#true} is VALID [2022-04-28 14:06:02,754 INFO L290 TraceCheckUtils]: 25: Hoare triple {14631#true} assume !(0 == ~cond); {14631#true} is VALID [2022-04-28 14:06:02,754 INFO L290 TraceCheckUtils]: 24: Hoare triple {14631#true} ~cond := #in~cond; {14631#true} is VALID [2022-04-28 14:06:02,754 INFO L272 TraceCheckUtils]: 23: Hoare triple {15097#(< ~counter~0 94)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {14631#true} is VALID [2022-04-28 14:06:02,754 INFO L290 TraceCheckUtils]: 22: Hoare triple {15097#(< ~counter~0 94)} assume !!(#t~post6 < 100);havoc #t~post6; {15097#(< ~counter~0 94)} is VALID [2022-04-28 14:06:02,755 INFO L290 TraceCheckUtils]: 21: Hoare triple {15125#(< ~counter~0 93)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {15097#(< ~counter~0 94)} is VALID [2022-04-28 14:06:02,755 INFO L290 TraceCheckUtils]: 20: Hoare triple {15125#(< ~counter~0 93)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {15125#(< ~counter~0 93)} is VALID [2022-04-28 14:06:02,755 INFO L290 TraceCheckUtils]: 19: Hoare triple {15125#(< ~counter~0 93)} assume !!(0 != ~a~0 && 0 != ~b~0); {15125#(< ~counter~0 93)} is VALID [2022-04-28 14:06:02,756 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {14631#true} {15125#(< ~counter~0 93)} #71#return; {15125#(< ~counter~0 93)} is VALID [2022-04-28 14:06:02,756 INFO L290 TraceCheckUtils]: 17: Hoare triple {14631#true} assume true; {14631#true} is VALID [2022-04-28 14:06:02,756 INFO L290 TraceCheckUtils]: 16: Hoare triple {14631#true} assume !(0 == ~cond); {14631#true} is VALID [2022-04-28 14:06:02,756 INFO L290 TraceCheckUtils]: 15: Hoare triple {14631#true} ~cond := #in~cond; {14631#true} is VALID [2022-04-28 14:06:02,756 INFO L272 TraceCheckUtils]: 14: Hoare triple {15125#(< ~counter~0 93)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {14631#true} is VALID [2022-04-28 14:06:02,756 INFO L290 TraceCheckUtils]: 13: Hoare triple {15125#(< ~counter~0 93)} assume !!(#t~post6 < 100);havoc #t~post6; {15125#(< ~counter~0 93)} is VALID [2022-04-28 14:06:02,757 INFO L290 TraceCheckUtils]: 12: Hoare triple {15153#(< ~counter~0 92)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {15125#(< ~counter~0 93)} is VALID [2022-04-28 14:06:02,757 INFO L290 TraceCheckUtils]: 11: Hoare triple {15153#(< ~counter~0 92)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {15153#(< ~counter~0 92)} is VALID [2022-04-28 14:06:02,757 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {14631#true} {15153#(< ~counter~0 92)} #69#return; {15153#(< ~counter~0 92)} is VALID [2022-04-28 14:06:02,757 INFO L290 TraceCheckUtils]: 9: Hoare triple {14631#true} assume true; {14631#true} is VALID [2022-04-28 14:06:02,758 INFO L290 TraceCheckUtils]: 8: Hoare triple {14631#true} assume !(0 == ~cond); {14631#true} is VALID [2022-04-28 14:06:02,758 INFO L290 TraceCheckUtils]: 7: Hoare triple {14631#true} ~cond := #in~cond; {14631#true} is VALID [2022-04-28 14:06:02,758 INFO L272 TraceCheckUtils]: 6: Hoare triple {15153#(< ~counter~0 92)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {14631#true} is VALID [2022-04-28 14:06:02,758 INFO L290 TraceCheckUtils]: 5: Hoare triple {15153#(< ~counter~0 92)} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {15153#(< ~counter~0 92)} is VALID [2022-04-28 14:06:02,758 INFO L272 TraceCheckUtils]: 4: Hoare triple {15153#(< ~counter~0 92)} call #t~ret7 := main(); {15153#(< ~counter~0 92)} is VALID [2022-04-28 14:06:02,758 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15153#(< ~counter~0 92)} {14631#true} #77#return; {15153#(< ~counter~0 92)} is VALID [2022-04-28 14:06:02,759 INFO L290 TraceCheckUtils]: 2: Hoare triple {15153#(< ~counter~0 92)} assume true; {15153#(< ~counter~0 92)} is VALID [2022-04-28 14:06:02,759 INFO L290 TraceCheckUtils]: 1: Hoare triple {14631#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(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {15153#(< ~counter~0 92)} is VALID [2022-04-28 14:06:02,759 INFO L272 TraceCheckUtils]: 0: Hoare triple {14631#true} call ULTIMATE.init(); {14631#true} is VALID [2022-04-28 14:06:02,759 INFO L134 CoverageAnalysis]: Checked inductivity of 284 backedges. 16 proven. 156 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2022-04-28 14:06:02,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:06:02,760 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [262351492] [2022-04-28 14:06:02,760 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 14:06:02,760 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [209269071] [2022-04-28 14:06:02,760 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [209269071] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 14:06:02,760 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 14:06:02,760 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 22 [2022-04-28 14:06:02,760 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:06:02,760 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1914857508] [2022-04-28 14:06:02,760 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1914857508] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:06:02,760 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:06:02,760 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-28 14:06:02,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1013095131] [2022-04-28 14:06:02,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:06:02,761 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.666666666666667) internal successors, (68), 11 states have internal predecessors, (68), 11 states have call successors, (12), 11 states have call predecessors, (12), 9 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) Word has length 90 [2022-04-28 14:06:02,761 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:06:02,761 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 5.666666666666667) internal successors, (68), 11 states have internal predecessors, (68), 11 states have call successors, (12), 11 states have call predecessors, (12), 9 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-28 14:06:02,823 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 90 edges. 90 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:06:02,823 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-28 14:06:02,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:06:02,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-28 14:06:02,823 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=195, Invalid=267, Unknown=0, NotChecked=0, Total=462 [2022-04-28 14:06:02,823 INFO L87 Difference]: Start difference. First operand 120 states and 146 transitions. Second operand has 12 states, 12 states have (on average 5.666666666666667) internal successors, (68), 11 states have internal predecessors, (68), 11 states have call successors, (12), 11 states have call predecessors, (12), 9 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-28 14:06:03,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:06:03,304 INFO L93 Difference]: Finished difference Result 139 states and 169 transitions. [2022-04-28 14:06:03,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-04-28 14:06:03,304 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.666666666666667) internal successors, (68), 11 states have internal predecessors, (68), 11 states have call successors, (12), 11 states have call predecessors, (12), 9 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) Word has length 90 [2022-04-28 14:06:03,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:06:03,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 5.666666666666667) internal successors, (68), 11 states have internal predecessors, (68), 11 states have call successors, (12), 11 states have call predecessors, (12), 9 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-28 14:06:03,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 155 transitions. [2022-04-28 14:06:03,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 5.666666666666667) internal successors, (68), 11 states have internal predecessors, (68), 11 states have call successors, (12), 11 states have call predecessors, (12), 9 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-28 14:06:03,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 155 transitions. [2022-04-28 14:06:03,309 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 20 states and 155 transitions. [2022-04-28 14:06:03,454 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 155 edges. 155 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:06:03,456 INFO L225 Difference]: With dead ends: 139 [2022-04-28 14:06:03,456 INFO L226 Difference]: Without dead ends: 131 [2022-04-28 14:06:03,457 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 159 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=363, Invalid=507, Unknown=0, NotChecked=0, Total=870 [2022-04-28 14:06:03,457 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 78 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 206 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 14:06:03,458 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 206 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 14:06:03,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2022-04-28 14:06:03,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2022-04-28 14:06:03,715 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:06:03,716 INFO L82 GeneralOperation]: Start isEquivalent. First operand 131 states. Second operand has 131 states, 102 states have (on average 1.2941176470588236) internal successors, (132), 103 states have internal predecessors, (132), 15 states have call successors, (15), 14 states have call predecessors, (15), 13 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-28 14:06:03,716 INFO L74 IsIncluded]: Start isIncluded. First operand 131 states. Second operand has 131 states, 102 states have (on average 1.2941176470588236) internal successors, (132), 103 states have internal predecessors, (132), 15 states have call successors, (15), 14 states have call predecessors, (15), 13 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-28 14:06:03,716 INFO L87 Difference]: Start difference. First operand 131 states. Second operand has 131 states, 102 states have (on average 1.2941176470588236) internal successors, (132), 103 states have internal predecessors, (132), 15 states have call successors, (15), 14 states have call predecessors, (15), 13 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-28 14:06:03,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:06:03,718 INFO L93 Difference]: Finished difference Result 131 states and 160 transitions. [2022-04-28 14:06:03,718 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 160 transitions. [2022-04-28 14:06:03,719 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:06:03,719 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:06:03,719 INFO L74 IsIncluded]: Start isIncluded. First operand has 131 states, 102 states have (on average 1.2941176470588236) internal successors, (132), 103 states have internal predecessors, (132), 15 states have call successors, (15), 14 states have call predecessors, (15), 13 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand 131 states. [2022-04-28 14:06:03,719 INFO L87 Difference]: Start difference. First operand has 131 states, 102 states have (on average 1.2941176470588236) internal successors, (132), 103 states have internal predecessors, (132), 15 states have call successors, (15), 14 states have call predecessors, (15), 13 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand 131 states. [2022-04-28 14:06:03,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:06:03,721 INFO L93 Difference]: Finished difference Result 131 states and 160 transitions. [2022-04-28 14:06:03,721 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 160 transitions. [2022-04-28 14:06:03,722 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:06:03,722 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:06:03,722 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:06:03,722 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:06:03,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 102 states have (on average 1.2941176470588236) internal successors, (132), 103 states have internal predecessors, (132), 15 states have call successors, (15), 14 states have call predecessors, (15), 13 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-28 14:06:03,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 160 transitions. [2022-04-28 14:06:03,724 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 160 transitions. Word has length 90 [2022-04-28 14:06:03,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:06:03,728 INFO L495 AbstractCegarLoop]: Abstraction has 131 states and 160 transitions. [2022-04-28 14:06:03,729 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.666666666666667) internal successors, (68), 11 states have internal predecessors, (68), 11 states have call successors, (12), 11 states have call predecessors, (12), 9 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-28 14:06:03,729 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 131 states and 160 transitions. [2022-04-28 14:06:21,020 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 160 edges. 152 inductive. 0 not inductive. 8 times theorem prover too weak to decide inductivity. [2022-04-28 14:06:21,021 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 160 transitions. [2022-04-28 14:06:21,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-04-28 14:06:21,022 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:06:21,022 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 14:06:21,038 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2022-04-28 14:06:21,223 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2022-04-28 14:06:21,223 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:06:21,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:06:21,224 INFO L85 PathProgramCache]: Analyzing trace with hash -164303550, now seen corresponding path program 17 times [2022-04-28 14:06:21,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:06:21,224 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1012242810] [2022-04-28 14:06:27,274 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 14:06:27,274 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 14:06:27,274 INFO L85 PathProgramCache]: Analyzing trace with hash -164303550, now seen corresponding path program 18 times [2022-04-28 14:06:27,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:06:27,274 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1102423390] [2022-04-28 14:06:27,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:06:27,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:06:27,288 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 14:06:27,288 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1779937370] [2022-04-28 14:06:27,288 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 14:06:27,288 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 14:06:27,288 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 14:06:27,289 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 14:06:27,290 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2022-04-28 14:06:27,414 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 10 check-sat command(s) [2022-04-28 14:06:27,414 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 14:06:27,416 INFO L263 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 23 conjunts are in the unsatisfiable core [2022-04-28 14:06:27,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:06:27,439 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 14:06:27,878 INFO L272 TraceCheckUtils]: 0: Hoare triple {16010#true} call ULTIMATE.init(); {16010#true} is VALID [2022-04-28 14:06:27,879 INFO L290 TraceCheckUtils]: 1: Hoare triple {16010#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(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {16018#(<= ~counter~0 0)} is VALID [2022-04-28 14:06:27,879 INFO L290 TraceCheckUtils]: 2: Hoare triple {16018#(<= ~counter~0 0)} assume true; {16018#(<= ~counter~0 0)} is VALID [2022-04-28 14:06:27,880 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16018#(<= ~counter~0 0)} {16010#true} #77#return; {16018#(<= ~counter~0 0)} is VALID [2022-04-28 14:06:27,880 INFO L272 TraceCheckUtils]: 4: Hoare triple {16018#(<= ~counter~0 0)} call #t~ret7 := main(); {16018#(<= ~counter~0 0)} is VALID [2022-04-28 14:06:27,880 INFO L290 TraceCheckUtils]: 5: Hoare triple {16018#(<= ~counter~0 0)} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {16018#(<= ~counter~0 0)} is VALID [2022-04-28 14:06:27,881 INFO L272 TraceCheckUtils]: 6: Hoare triple {16018#(<= ~counter~0 0)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {16018#(<= ~counter~0 0)} is VALID [2022-04-28 14:06:27,881 INFO L290 TraceCheckUtils]: 7: Hoare triple {16018#(<= ~counter~0 0)} ~cond := #in~cond; {16018#(<= ~counter~0 0)} is VALID [2022-04-28 14:06:27,881 INFO L290 TraceCheckUtils]: 8: Hoare triple {16018#(<= ~counter~0 0)} assume !(0 == ~cond); {16018#(<= ~counter~0 0)} is VALID [2022-04-28 14:06:27,881 INFO L290 TraceCheckUtils]: 9: Hoare triple {16018#(<= ~counter~0 0)} assume true; {16018#(<= ~counter~0 0)} is VALID [2022-04-28 14:06:27,882 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {16018#(<= ~counter~0 0)} {16018#(<= ~counter~0 0)} #69#return; {16018#(<= ~counter~0 0)} is VALID [2022-04-28 14:06:27,882 INFO L290 TraceCheckUtils]: 11: Hoare triple {16018#(<= ~counter~0 0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {16018#(<= ~counter~0 0)} is VALID [2022-04-28 14:06:27,883 INFO L290 TraceCheckUtils]: 12: Hoare triple {16018#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {16052#(<= ~counter~0 1)} is VALID [2022-04-28 14:06:27,883 INFO L290 TraceCheckUtils]: 13: Hoare triple {16052#(<= ~counter~0 1)} assume !!(#t~post6 < 100);havoc #t~post6; {16052#(<= ~counter~0 1)} is VALID [2022-04-28 14:06:27,883 INFO L272 TraceCheckUtils]: 14: Hoare triple {16052#(<= ~counter~0 1)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {16052#(<= ~counter~0 1)} is VALID [2022-04-28 14:06:27,884 INFO L290 TraceCheckUtils]: 15: Hoare triple {16052#(<= ~counter~0 1)} ~cond := #in~cond; {16052#(<= ~counter~0 1)} is VALID [2022-04-28 14:06:27,884 INFO L290 TraceCheckUtils]: 16: Hoare triple {16052#(<= ~counter~0 1)} assume !(0 == ~cond); {16052#(<= ~counter~0 1)} is VALID [2022-04-28 14:06:27,884 INFO L290 TraceCheckUtils]: 17: Hoare triple {16052#(<= ~counter~0 1)} assume true; {16052#(<= ~counter~0 1)} is VALID [2022-04-28 14:06:27,885 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {16052#(<= ~counter~0 1)} {16052#(<= ~counter~0 1)} #71#return; {16052#(<= ~counter~0 1)} is VALID [2022-04-28 14:06:27,885 INFO L290 TraceCheckUtils]: 19: Hoare triple {16052#(<= ~counter~0 1)} assume !!(0 != ~a~0 && 0 != ~b~0); {16052#(<= ~counter~0 1)} is VALID [2022-04-28 14:06:27,885 INFO L290 TraceCheckUtils]: 20: Hoare triple {16052#(<= ~counter~0 1)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {16052#(<= ~counter~0 1)} is VALID [2022-04-28 14:06:27,886 INFO L290 TraceCheckUtils]: 21: Hoare triple {16052#(<= ~counter~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {16080#(<= ~counter~0 2)} is VALID [2022-04-28 14:06:27,886 INFO L290 TraceCheckUtils]: 22: Hoare triple {16080#(<= ~counter~0 2)} assume !!(#t~post6 < 100);havoc #t~post6; {16080#(<= ~counter~0 2)} is VALID [2022-04-28 14:06:27,886 INFO L272 TraceCheckUtils]: 23: Hoare triple {16080#(<= ~counter~0 2)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {16080#(<= ~counter~0 2)} is VALID [2022-04-28 14:06:27,887 INFO L290 TraceCheckUtils]: 24: Hoare triple {16080#(<= ~counter~0 2)} ~cond := #in~cond; {16080#(<= ~counter~0 2)} is VALID [2022-04-28 14:06:27,887 INFO L290 TraceCheckUtils]: 25: Hoare triple {16080#(<= ~counter~0 2)} assume !(0 == ~cond); {16080#(<= ~counter~0 2)} is VALID [2022-04-28 14:06:27,887 INFO L290 TraceCheckUtils]: 26: Hoare triple {16080#(<= ~counter~0 2)} assume true; {16080#(<= ~counter~0 2)} is VALID [2022-04-28 14:06:27,888 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {16080#(<= ~counter~0 2)} {16080#(<= ~counter~0 2)} #71#return; {16080#(<= ~counter~0 2)} is VALID [2022-04-28 14:06:27,888 INFO L290 TraceCheckUtils]: 28: Hoare triple {16080#(<= ~counter~0 2)} assume !!(0 != ~a~0 && 0 != ~b~0); {16080#(<= ~counter~0 2)} is VALID [2022-04-28 14:06:27,888 INFO L290 TraceCheckUtils]: 29: Hoare triple {16080#(<= ~counter~0 2)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {16080#(<= ~counter~0 2)} is VALID [2022-04-28 14:06:27,889 INFO L290 TraceCheckUtils]: 30: Hoare triple {16080#(<= ~counter~0 2)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {16108#(<= ~counter~0 3)} is VALID [2022-04-28 14:06:27,889 INFO L290 TraceCheckUtils]: 31: Hoare triple {16108#(<= ~counter~0 3)} assume !!(#t~post6 < 100);havoc #t~post6; {16108#(<= ~counter~0 3)} is VALID [2022-04-28 14:06:27,890 INFO L272 TraceCheckUtils]: 32: Hoare triple {16108#(<= ~counter~0 3)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {16108#(<= ~counter~0 3)} is VALID [2022-04-28 14:06:27,890 INFO L290 TraceCheckUtils]: 33: Hoare triple {16108#(<= ~counter~0 3)} ~cond := #in~cond; {16108#(<= ~counter~0 3)} is VALID [2022-04-28 14:06:27,890 INFO L290 TraceCheckUtils]: 34: Hoare triple {16108#(<= ~counter~0 3)} assume !(0 == ~cond); {16108#(<= ~counter~0 3)} is VALID [2022-04-28 14:06:27,890 INFO L290 TraceCheckUtils]: 35: Hoare triple {16108#(<= ~counter~0 3)} assume true; {16108#(<= ~counter~0 3)} is VALID [2022-04-28 14:06:27,891 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {16108#(<= ~counter~0 3)} {16108#(<= ~counter~0 3)} #71#return; {16108#(<= ~counter~0 3)} is VALID [2022-04-28 14:06:27,891 INFO L290 TraceCheckUtils]: 37: Hoare triple {16108#(<= ~counter~0 3)} assume !!(0 != ~a~0 && 0 != ~b~0); {16108#(<= ~counter~0 3)} is VALID [2022-04-28 14:06:27,891 INFO L290 TraceCheckUtils]: 38: Hoare triple {16108#(<= ~counter~0 3)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {16108#(<= ~counter~0 3)} is VALID [2022-04-28 14:06:27,892 INFO L290 TraceCheckUtils]: 39: Hoare triple {16108#(<= ~counter~0 3)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {16136#(<= ~counter~0 4)} is VALID [2022-04-28 14:06:27,892 INFO L290 TraceCheckUtils]: 40: Hoare triple {16136#(<= ~counter~0 4)} assume !!(#t~post6 < 100);havoc #t~post6; {16136#(<= ~counter~0 4)} is VALID [2022-04-28 14:06:27,893 INFO L272 TraceCheckUtils]: 41: Hoare triple {16136#(<= ~counter~0 4)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {16136#(<= ~counter~0 4)} is VALID [2022-04-28 14:06:27,893 INFO L290 TraceCheckUtils]: 42: Hoare triple {16136#(<= ~counter~0 4)} ~cond := #in~cond; {16136#(<= ~counter~0 4)} is VALID [2022-04-28 14:06:27,893 INFO L290 TraceCheckUtils]: 43: Hoare triple {16136#(<= ~counter~0 4)} assume !(0 == ~cond); {16136#(<= ~counter~0 4)} is VALID [2022-04-28 14:06:27,893 INFO L290 TraceCheckUtils]: 44: Hoare triple {16136#(<= ~counter~0 4)} assume true; {16136#(<= ~counter~0 4)} is VALID [2022-04-28 14:06:27,894 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {16136#(<= ~counter~0 4)} {16136#(<= ~counter~0 4)} #71#return; {16136#(<= ~counter~0 4)} is VALID [2022-04-28 14:06:27,894 INFO L290 TraceCheckUtils]: 46: Hoare triple {16136#(<= ~counter~0 4)} assume !!(0 != ~a~0 && 0 != ~b~0); {16136#(<= ~counter~0 4)} is VALID [2022-04-28 14:06:27,894 INFO L290 TraceCheckUtils]: 47: Hoare triple {16136#(<= ~counter~0 4)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {16136#(<= ~counter~0 4)} is VALID [2022-04-28 14:06:27,895 INFO L290 TraceCheckUtils]: 48: Hoare triple {16136#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {16164#(<= ~counter~0 5)} is VALID [2022-04-28 14:06:27,895 INFO L290 TraceCheckUtils]: 49: Hoare triple {16164#(<= ~counter~0 5)} assume !!(#t~post6 < 100);havoc #t~post6; {16164#(<= ~counter~0 5)} is VALID [2022-04-28 14:06:27,896 INFO L272 TraceCheckUtils]: 50: Hoare triple {16164#(<= ~counter~0 5)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {16164#(<= ~counter~0 5)} is VALID [2022-04-28 14:06:27,896 INFO L290 TraceCheckUtils]: 51: Hoare triple {16164#(<= ~counter~0 5)} ~cond := #in~cond; {16164#(<= ~counter~0 5)} is VALID [2022-04-28 14:06:27,896 INFO L290 TraceCheckUtils]: 52: Hoare triple {16164#(<= ~counter~0 5)} assume !(0 == ~cond); {16164#(<= ~counter~0 5)} is VALID [2022-04-28 14:06:27,896 INFO L290 TraceCheckUtils]: 53: Hoare triple {16164#(<= ~counter~0 5)} assume true; {16164#(<= ~counter~0 5)} is VALID [2022-04-28 14:06:27,897 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {16164#(<= ~counter~0 5)} {16164#(<= ~counter~0 5)} #71#return; {16164#(<= ~counter~0 5)} is VALID [2022-04-28 14:06:27,897 INFO L290 TraceCheckUtils]: 55: Hoare triple {16164#(<= ~counter~0 5)} assume !!(0 != ~a~0 && 0 != ~b~0); {16164#(<= ~counter~0 5)} is VALID [2022-04-28 14:06:27,897 INFO L290 TraceCheckUtils]: 56: Hoare triple {16164#(<= ~counter~0 5)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {16164#(<= ~counter~0 5)} is VALID [2022-04-28 14:06:27,898 INFO L290 TraceCheckUtils]: 57: Hoare triple {16164#(<= ~counter~0 5)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {16192#(<= ~counter~0 6)} is VALID [2022-04-28 14:06:27,898 INFO L290 TraceCheckUtils]: 58: Hoare triple {16192#(<= ~counter~0 6)} assume !!(#t~post6 < 100);havoc #t~post6; {16192#(<= ~counter~0 6)} is VALID [2022-04-28 14:06:27,899 INFO L272 TraceCheckUtils]: 59: Hoare triple {16192#(<= ~counter~0 6)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {16192#(<= ~counter~0 6)} is VALID [2022-04-28 14:06:27,899 INFO L290 TraceCheckUtils]: 60: Hoare triple {16192#(<= ~counter~0 6)} ~cond := #in~cond; {16192#(<= ~counter~0 6)} is VALID [2022-04-28 14:06:27,899 INFO L290 TraceCheckUtils]: 61: Hoare triple {16192#(<= ~counter~0 6)} assume !(0 == ~cond); {16192#(<= ~counter~0 6)} is VALID [2022-04-28 14:06:27,899 INFO L290 TraceCheckUtils]: 62: Hoare triple {16192#(<= ~counter~0 6)} assume true; {16192#(<= ~counter~0 6)} is VALID [2022-04-28 14:06:27,900 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {16192#(<= ~counter~0 6)} {16192#(<= ~counter~0 6)} #71#return; {16192#(<= ~counter~0 6)} is VALID [2022-04-28 14:06:27,900 INFO L290 TraceCheckUtils]: 64: Hoare triple {16192#(<= ~counter~0 6)} assume !!(0 != ~a~0 && 0 != ~b~0); {16192#(<= ~counter~0 6)} is VALID [2022-04-28 14:06:27,900 INFO L290 TraceCheckUtils]: 65: Hoare triple {16192#(<= ~counter~0 6)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {16192#(<= ~counter~0 6)} is VALID [2022-04-28 14:06:27,901 INFO L290 TraceCheckUtils]: 66: Hoare triple {16192#(<= ~counter~0 6)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {16220#(<= ~counter~0 7)} is VALID [2022-04-28 14:06:27,901 INFO L290 TraceCheckUtils]: 67: Hoare triple {16220#(<= ~counter~0 7)} assume !!(#t~post6 < 100);havoc #t~post6; {16220#(<= ~counter~0 7)} is VALID [2022-04-28 14:06:27,902 INFO L272 TraceCheckUtils]: 68: Hoare triple {16220#(<= ~counter~0 7)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {16220#(<= ~counter~0 7)} is VALID [2022-04-28 14:06:27,902 INFO L290 TraceCheckUtils]: 69: Hoare triple {16220#(<= ~counter~0 7)} ~cond := #in~cond; {16220#(<= ~counter~0 7)} is VALID [2022-04-28 14:06:27,902 INFO L290 TraceCheckUtils]: 70: Hoare triple {16220#(<= ~counter~0 7)} assume !(0 == ~cond); {16220#(<= ~counter~0 7)} is VALID [2022-04-28 14:06:27,902 INFO L290 TraceCheckUtils]: 71: Hoare triple {16220#(<= ~counter~0 7)} assume true; {16220#(<= ~counter~0 7)} is VALID [2022-04-28 14:06:27,903 INFO L284 TraceCheckUtils]: 72: Hoare quadruple {16220#(<= ~counter~0 7)} {16220#(<= ~counter~0 7)} #71#return; {16220#(<= ~counter~0 7)} is VALID [2022-04-28 14:06:27,903 INFO L290 TraceCheckUtils]: 73: Hoare triple {16220#(<= ~counter~0 7)} assume !!(0 != ~a~0 && 0 != ~b~0); {16220#(<= ~counter~0 7)} is VALID [2022-04-28 14:06:27,903 INFO L290 TraceCheckUtils]: 74: Hoare triple {16220#(<= ~counter~0 7)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {16220#(<= ~counter~0 7)} is VALID [2022-04-28 14:06:27,904 INFO L290 TraceCheckUtils]: 75: Hoare triple {16220#(<= ~counter~0 7)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {16248#(<= ~counter~0 8)} is VALID [2022-04-28 14:06:27,904 INFO L290 TraceCheckUtils]: 76: Hoare triple {16248#(<= ~counter~0 8)} assume !!(#t~post6 < 100);havoc #t~post6; {16248#(<= ~counter~0 8)} is VALID [2022-04-28 14:06:27,905 INFO L272 TraceCheckUtils]: 77: Hoare triple {16248#(<= ~counter~0 8)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {16248#(<= ~counter~0 8)} is VALID [2022-04-28 14:06:27,905 INFO L290 TraceCheckUtils]: 78: Hoare triple {16248#(<= ~counter~0 8)} ~cond := #in~cond; {16248#(<= ~counter~0 8)} is VALID [2022-04-28 14:06:27,905 INFO L290 TraceCheckUtils]: 79: Hoare triple {16248#(<= ~counter~0 8)} assume !(0 == ~cond); {16248#(<= ~counter~0 8)} is VALID [2022-04-28 14:06:27,905 INFO L290 TraceCheckUtils]: 80: Hoare triple {16248#(<= ~counter~0 8)} assume true; {16248#(<= ~counter~0 8)} is VALID [2022-04-28 14:06:27,906 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {16248#(<= ~counter~0 8)} {16248#(<= ~counter~0 8)} #71#return; {16248#(<= ~counter~0 8)} is VALID [2022-04-28 14:06:27,906 INFO L290 TraceCheckUtils]: 82: Hoare triple {16248#(<= ~counter~0 8)} assume !!(0 != ~a~0 && 0 != ~b~0); {16248#(<= ~counter~0 8)} is VALID [2022-04-28 14:06:27,906 INFO L290 TraceCheckUtils]: 83: Hoare triple {16248#(<= ~counter~0 8)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {16248#(<= ~counter~0 8)} is VALID [2022-04-28 14:06:27,907 INFO L290 TraceCheckUtils]: 84: Hoare triple {16248#(<= ~counter~0 8)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {16276#(<= ~counter~0 9)} is VALID [2022-04-28 14:06:27,907 INFO L290 TraceCheckUtils]: 85: Hoare triple {16276#(<= ~counter~0 9)} assume !!(#t~post6 < 100);havoc #t~post6; {16276#(<= ~counter~0 9)} is VALID [2022-04-28 14:06:27,908 INFO L272 TraceCheckUtils]: 86: Hoare triple {16276#(<= ~counter~0 9)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {16276#(<= ~counter~0 9)} is VALID [2022-04-28 14:06:27,908 INFO L290 TraceCheckUtils]: 87: Hoare triple {16276#(<= ~counter~0 9)} ~cond := #in~cond; {16276#(<= ~counter~0 9)} is VALID [2022-04-28 14:06:27,908 INFO L290 TraceCheckUtils]: 88: Hoare triple {16276#(<= ~counter~0 9)} assume !(0 == ~cond); {16276#(<= ~counter~0 9)} is VALID [2022-04-28 14:06:27,908 INFO L290 TraceCheckUtils]: 89: Hoare triple {16276#(<= ~counter~0 9)} assume true; {16276#(<= ~counter~0 9)} is VALID [2022-04-28 14:06:27,909 INFO L284 TraceCheckUtils]: 90: Hoare quadruple {16276#(<= ~counter~0 9)} {16276#(<= ~counter~0 9)} #71#return; {16276#(<= ~counter~0 9)} is VALID [2022-04-28 14:06:27,909 INFO L290 TraceCheckUtils]: 91: Hoare triple {16276#(<= ~counter~0 9)} assume !!(0 != ~a~0 && 0 != ~b~0); {16276#(<= ~counter~0 9)} is VALID [2022-04-28 14:06:27,909 INFO L290 TraceCheckUtils]: 92: Hoare triple {16276#(<= ~counter~0 9)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {16276#(<= ~counter~0 9)} is VALID [2022-04-28 14:06:27,910 INFO L290 TraceCheckUtils]: 93: Hoare triple {16276#(<= ~counter~0 9)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {16304#(<= |main_#t~post6| 9)} is VALID [2022-04-28 14:06:27,910 INFO L290 TraceCheckUtils]: 94: Hoare triple {16304#(<= |main_#t~post6| 9)} assume !(#t~post6 < 100);havoc #t~post6; {16011#false} is VALID [2022-04-28 14:06:27,910 INFO L272 TraceCheckUtils]: 95: Hoare triple {16011#false} call __VERIFIER_assert((if ~q~0 == ~x~0 * ~y~0 then 1 else 0)); {16011#false} is VALID [2022-04-28 14:06:27,910 INFO L290 TraceCheckUtils]: 96: Hoare triple {16011#false} ~cond := #in~cond; {16011#false} is VALID [2022-04-28 14:06:27,910 INFO L290 TraceCheckUtils]: 97: Hoare triple {16011#false} assume 0 == ~cond; {16011#false} is VALID [2022-04-28 14:06:27,910 INFO L290 TraceCheckUtils]: 98: Hoare triple {16011#false} assume !false; {16011#false} is VALID [2022-04-28 14:06:27,911 INFO L134 CoverageAnalysis]: Checked inductivity of 360 backedges. 18 proven. 342 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 14:06:27,911 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 14:06:28,517 INFO L290 TraceCheckUtils]: 98: Hoare triple {16011#false} assume !false; {16011#false} is VALID [2022-04-28 14:06:28,518 INFO L290 TraceCheckUtils]: 97: Hoare triple {16011#false} assume 0 == ~cond; {16011#false} is VALID [2022-04-28 14:06:28,518 INFO L290 TraceCheckUtils]: 96: Hoare triple {16011#false} ~cond := #in~cond; {16011#false} is VALID [2022-04-28 14:06:28,518 INFO L272 TraceCheckUtils]: 95: Hoare triple {16011#false} call __VERIFIER_assert((if ~q~0 == ~x~0 * ~y~0 then 1 else 0)); {16011#false} is VALID [2022-04-28 14:06:28,518 INFO L290 TraceCheckUtils]: 94: Hoare triple {16332#(< |main_#t~post6| 100)} assume !(#t~post6 < 100);havoc #t~post6; {16011#false} is VALID [2022-04-28 14:06:28,518 INFO L290 TraceCheckUtils]: 93: Hoare triple {16336#(< ~counter~0 100)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {16332#(< |main_#t~post6| 100)} is VALID [2022-04-28 14:06:28,519 INFO L290 TraceCheckUtils]: 92: Hoare triple {16336#(< ~counter~0 100)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {16336#(< ~counter~0 100)} is VALID [2022-04-28 14:06:28,519 INFO L290 TraceCheckUtils]: 91: Hoare triple {16336#(< ~counter~0 100)} assume !!(0 != ~a~0 && 0 != ~b~0); {16336#(< ~counter~0 100)} is VALID [2022-04-28 14:06:28,519 INFO L284 TraceCheckUtils]: 90: Hoare quadruple {16010#true} {16336#(< ~counter~0 100)} #71#return; {16336#(< ~counter~0 100)} is VALID [2022-04-28 14:06:28,519 INFO L290 TraceCheckUtils]: 89: Hoare triple {16010#true} assume true; {16010#true} is VALID [2022-04-28 14:06:28,520 INFO L290 TraceCheckUtils]: 88: Hoare triple {16010#true} assume !(0 == ~cond); {16010#true} is VALID [2022-04-28 14:06:28,520 INFO L290 TraceCheckUtils]: 87: Hoare triple {16010#true} ~cond := #in~cond; {16010#true} is VALID [2022-04-28 14:06:28,520 INFO L272 TraceCheckUtils]: 86: Hoare triple {16336#(< ~counter~0 100)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {16010#true} is VALID [2022-04-28 14:06:28,520 INFO L290 TraceCheckUtils]: 85: Hoare triple {16336#(< ~counter~0 100)} assume !!(#t~post6 < 100);havoc #t~post6; {16336#(< ~counter~0 100)} is VALID [2022-04-28 14:06:28,520 INFO L290 TraceCheckUtils]: 84: Hoare triple {16364#(< ~counter~0 99)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {16336#(< ~counter~0 100)} is VALID [2022-04-28 14:06:28,521 INFO L290 TraceCheckUtils]: 83: Hoare triple {16364#(< ~counter~0 99)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {16364#(< ~counter~0 99)} is VALID [2022-04-28 14:06:28,521 INFO L290 TraceCheckUtils]: 82: Hoare triple {16364#(< ~counter~0 99)} assume !!(0 != ~a~0 && 0 != ~b~0); {16364#(< ~counter~0 99)} is VALID [2022-04-28 14:06:28,522 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {16010#true} {16364#(< ~counter~0 99)} #71#return; {16364#(< ~counter~0 99)} is VALID [2022-04-28 14:06:28,522 INFO L290 TraceCheckUtils]: 80: Hoare triple {16010#true} assume true; {16010#true} is VALID [2022-04-28 14:06:28,522 INFO L290 TraceCheckUtils]: 79: Hoare triple {16010#true} assume !(0 == ~cond); {16010#true} is VALID [2022-04-28 14:06:28,522 INFO L290 TraceCheckUtils]: 78: Hoare triple {16010#true} ~cond := #in~cond; {16010#true} is VALID [2022-04-28 14:06:28,522 INFO L272 TraceCheckUtils]: 77: Hoare triple {16364#(< ~counter~0 99)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {16010#true} is VALID [2022-04-28 14:06:28,522 INFO L290 TraceCheckUtils]: 76: Hoare triple {16364#(< ~counter~0 99)} assume !!(#t~post6 < 100);havoc #t~post6; {16364#(< ~counter~0 99)} is VALID [2022-04-28 14:06:28,523 INFO L290 TraceCheckUtils]: 75: Hoare triple {16392#(< ~counter~0 98)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {16364#(< ~counter~0 99)} is VALID [2022-04-28 14:06:28,523 INFO L290 TraceCheckUtils]: 74: Hoare triple {16392#(< ~counter~0 98)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {16392#(< ~counter~0 98)} is VALID [2022-04-28 14:06:28,523 INFO L290 TraceCheckUtils]: 73: Hoare triple {16392#(< ~counter~0 98)} assume !!(0 != ~a~0 && 0 != ~b~0); {16392#(< ~counter~0 98)} is VALID [2022-04-28 14:06:28,524 INFO L284 TraceCheckUtils]: 72: Hoare quadruple {16010#true} {16392#(< ~counter~0 98)} #71#return; {16392#(< ~counter~0 98)} is VALID [2022-04-28 14:06:28,524 INFO L290 TraceCheckUtils]: 71: Hoare triple {16010#true} assume true; {16010#true} is VALID [2022-04-28 14:06:28,524 INFO L290 TraceCheckUtils]: 70: Hoare triple {16010#true} assume !(0 == ~cond); {16010#true} is VALID [2022-04-28 14:06:28,524 INFO L290 TraceCheckUtils]: 69: Hoare triple {16010#true} ~cond := #in~cond; {16010#true} is VALID [2022-04-28 14:06:28,524 INFO L272 TraceCheckUtils]: 68: Hoare triple {16392#(< ~counter~0 98)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {16010#true} is VALID [2022-04-28 14:06:28,524 INFO L290 TraceCheckUtils]: 67: Hoare triple {16392#(< ~counter~0 98)} assume !!(#t~post6 < 100);havoc #t~post6; {16392#(< ~counter~0 98)} is VALID [2022-04-28 14:06:28,525 INFO L290 TraceCheckUtils]: 66: Hoare triple {16420#(< ~counter~0 97)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {16392#(< ~counter~0 98)} is VALID [2022-04-28 14:06:28,525 INFO L290 TraceCheckUtils]: 65: Hoare triple {16420#(< ~counter~0 97)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {16420#(< ~counter~0 97)} is VALID [2022-04-28 14:06:28,525 INFO L290 TraceCheckUtils]: 64: Hoare triple {16420#(< ~counter~0 97)} assume !!(0 != ~a~0 && 0 != ~b~0); {16420#(< ~counter~0 97)} is VALID [2022-04-28 14:06:28,526 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {16010#true} {16420#(< ~counter~0 97)} #71#return; {16420#(< ~counter~0 97)} is VALID [2022-04-28 14:06:28,526 INFO L290 TraceCheckUtils]: 62: Hoare triple {16010#true} assume true; {16010#true} is VALID [2022-04-28 14:06:28,526 INFO L290 TraceCheckUtils]: 61: Hoare triple {16010#true} assume !(0 == ~cond); {16010#true} is VALID [2022-04-28 14:06:28,526 INFO L290 TraceCheckUtils]: 60: Hoare triple {16010#true} ~cond := #in~cond; {16010#true} is VALID [2022-04-28 14:06:28,526 INFO L272 TraceCheckUtils]: 59: Hoare triple {16420#(< ~counter~0 97)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {16010#true} is VALID [2022-04-28 14:06:28,526 INFO L290 TraceCheckUtils]: 58: Hoare triple {16420#(< ~counter~0 97)} assume !!(#t~post6 < 100);havoc #t~post6; {16420#(< ~counter~0 97)} is VALID [2022-04-28 14:06:28,527 INFO L290 TraceCheckUtils]: 57: Hoare triple {16448#(< ~counter~0 96)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {16420#(< ~counter~0 97)} is VALID [2022-04-28 14:06:28,527 INFO L290 TraceCheckUtils]: 56: Hoare triple {16448#(< ~counter~0 96)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {16448#(< ~counter~0 96)} is VALID [2022-04-28 14:06:28,527 INFO L290 TraceCheckUtils]: 55: Hoare triple {16448#(< ~counter~0 96)} assume !!(0 != ~a~0 && 0 != ~b~0); {16448#(< ~counter~0 96)} is VALID [2022-04-28 14:06:28,528 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {16010#true} {16448#(< ~counter~0 96)} #71#return; {16448#(< ~counter~0 96)} is VALID [2022-04-28 14:06:28,528 INFO L290 TraceCheckUtils]: 53: Hoare triple {16010#true} assume true; {16010#true} is VALID [2022-04-28 14:06:28,528 INFO L290 TraceCheckUtils]: 52: Hoare triple {16010#true} assume !(0 == ~cond); {16010#true} is VALID [2022-04-28 14:06:28,528 INFO L290 TraceCheckUtils]: 51: Hoare triple {16010#true} ~cond := #in~cond; {16010#true} is VALID [2022-04-28 14:06:28,528 INFO L272 TraceCheckUtils]: 50: Hoare triple {16448#(< ~counter~0 96)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {16010#true} is VALID [2022-04-28 14:06:28,528 INFO L290 TraceCheckUtils]: 49: Hoare triple {16448#(< ~counter~0 96)} assume !!(#t~post6 < 100);havoc #t~post6; {16448#(< ~counter~0 96)} is VALID [2022-04-28 14:06:28,529 INFO L290 TraceCheckUtils]: 48: Hoare triple {16476#(< ~counter~0 95)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {16448#(< ~counter~0 96)} is VALID [2022-04-28 14:06:28,529 INFO L290 TraceCheckUtils]: 47: Hoare triple {16476#(< ~counter~0 95)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {16476#(< ~counter~0 95)} is VALID [2022-04-28 14:06:28,529 INFO L290 TraceCheckUtils]: 46: Hoare triple {16476#(< ~counter~0 95)} assume !!(0 != ~a~0 && 0 != ~b~0); {16476#(< ~counter~0 95)} is VALID [2022-04-28 14:06:28,530 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {16010#true} {16476#(< ~counter~0 95)} #71#return; {16476#(< ~counter~0 95)} is VALID [2022-04-28 14:06:28,530 INFO L290 TraceCheckUtils]: 44: Hoare triple {16010#true} assume true; {16010#true} is VALID [2022-04-28 14:06:28,530 INFO L290 TraceCheckUtils]: 43: Hoare triple {16010#true} assume !(0 == ~cond); {16010#true} is VALID [2022-04-28 14:06:28,530 INFO L290 TraceCheckUtils]: 42: Hoare triple {16010#true} ~cond := #in~cond; {16010#true} is VALID [2022-04-28 14:06:28,530 INFO L272 TraceCheckUtils]: 41: Hoare triple {16476#(< ~counter~0 95)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {16010#true} is VALID [2022-04-28 14:06:28,540 INFO L290 TraceCheckUtils]: 40: Hoare triple {16476#(< ~counter~0 95)} assume !!(#t~post6 < 100);havoc #t~post6; {16476#(< ~counter~0 95)} is VALID [2022-04-28 14:06:28,541 INFO L290 TraceCheckUtils]: 39: Hoare triple {16504#(< ~counter~0 94)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {16476#(< ~counter~0 95)} is VALID [2022-04-28 14:06:28,541 INFO L290 TraceCheckUtils]: 38: Hoare triple {16504#(< ~counter~0 94)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {16504#(< ~counter~0 94)} is VALID [2022-04-28 14:06:28,541 INFO L290 TraceCheckUtils]: 37: Hoare triple {16504#(< ~counter~0 94)} assume !!(0 != ~a~0 && 0 != ~b~0); {16504#(< ~counter~0 94)} is VALID [2022-04-28 14:06:28,542 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {16010#true} {16504#(< ~counter~0 94)} #71#return; {16504#(< ~counter~0 94)} is VALID [2022-04-28 14:06:28,542 INFO L290 TraceCheckUtils]: 35: Hoare triple {16010#true} assume true; {16010#true} is VALID [2022-04-28 14:06:28,542 INFO L290 TraceCheckUtils]: 34: Hoare triple {16010#true} assume !(0 == ~cond); {16010#true} is VALID [2022-04-28 14:06:28,542 INFO L290 TraceCheckUtils]: 33: Hoare triple {16010#true} ~cond := #in~cond; {16010#true} is VALID [2022-04-28 14:06:28,542 INFO L272 TraceCheckUtils]: 32: Hoare triple {16504#(< ~counter~0 94)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {16010#true} is VALID [2022-04-28 14:06:28,542 INFO L290 TraceCheckUtils]: 31: Hoare triple {16504#(< ~counter~0 94)} assume !!(#t~post6 < 100);havoc #t~post6; {16504#(< ~counter~0 94)} is VALID [2022-04-28 14:06:28,543 INFO L290 TraceCheckUtils]: 30: Hoare triple {16532#(< ~counter~0 93)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {16504#(< ~counter~0 94)} is VALID [2022-04-28 14:06:28,543 INFO L290 TraceCheckUtils]: 29: Hoare triple {16532#(< ~counter~0 93)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {16532#(< ~counter~0 93)} is VALID [2022-04-28 14:06:28,543 INFO L290 TraceCheckUtils]: 28: Hoare triple {16532#(< ~counter~0 93)} assume !!(0 != ~a~0 && 0 != ~b~0); {16532#(< ~counter~0 93)} is VALID [2022-04-28 14:06:28,544 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {16010#true} {16532#(< ~counter~0 93)} #71#return; {16532#(< ~counter~0 93)} is VALID [2022-04-28 14:06:28,544 INFO L290 TraceCheckUtils]: 26: Hoare triple {16010#true} assume true; {16010#true} is VALID [2022-04-28 14:06:28,544 INFO L290 TraceCheckUtils]: 25: Hoare triple {16010#true} assume !(0 == ~cond); {16010#true} is VALID [2022-04-28 14:06:28,544 INFO L290 TraceCheckUtils]: 24: Hoare triple {16010#true} ~cond := #in~cond; {16010#true} is VALID [2022-04-28 14:06:28,544 INFO L272 TraceCheckUtils]: 23: Hoare triple {16532#(< ~counter~0 93)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {16010#true} is VALID [2022-04-28 14:06:28,544 INFO L290 TraceCheckUtils]: 22: Hoare triple {16532#(< ~counter~0 93)} assume !!(#t~post6 < 100);havoc #t~post6; {16532#(< ~counter~0 93)} is VALID [2022-04-28 14:06:28,545 INFO L290 TraceCheckUtils]: 21: Hoare triple {16560#(< ~counter~0 92)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {16532#(< ~counter~0 93)} is VALID [2022-04-28 14:06:28,545 INFO L290 TraceCheckUtils]: 20: Hoare triple {16560#(< ~counter~0 92)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {16560#(< ~counter~0 92)} is VALID [2022-04-28 14:06:28,545 INFO L290 TraceCheckUtils]: 19: Hoare triple {16560#(< ~counter~0 92)} assume !!(0 != ~a~0 && 0 != ~b~0); {16560#(< ~counter~0 92)} is VALID [2022-04-28 14:06:28,546 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {16010#true} {16560#(< ~counter~0 92)} #71#return; {16560#(< ~counter~0 92)} is VALID [2022-04-28 14:06:28,546 INFO L290 TraceCheckUtils]: 17: Hoare triple {16010#true} assume true; {16010#true} is VALID [2022-04-28 14:06:28,546 INFO L290 TraceCheckUtils]: 16: Hoare triple {16010#true} assume !(0 == ~cond); {16010#true} is VALID [2022-04-28 14:06:28,546 INFO L290 TraceCheckUtils]: 15: Hoare triple {16010#true} ~cond := #in~cond; {16010#true} is VALID [2022-04-28 14:06:28,546 INFO L272 TraceCheckUtils]: 14: Hoare triple {16560#(< ~counter~0 92)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {16010#true} is VALID [2022-04-28 14:06:28,546 INFO L290 TraceCheckUtils]: 13: Hoare triple {16560#(< ~counter~0 92)} assume !!(#t~post6 < 100);havoc #t~post6; {16560#(< ~counter~0 92)} is VALID [2022-04-28 14:06:28,547 INFO L290 TraceCheckUtils]: 12: Hoare triple {16588#(< ~counter~0 91)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {16560#(< ~counter~0 92)} is VALID [2022-04-28 14:06:28,547 INFO L290 TraceCheckUtils]: 11: Hoare triple {16588#(< ~counter~0 91)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {16588#(< ~counter~0 91)} is VALID [2022-04-28 14:06:28,547 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {16010#true} {16588#(< ~counter~0 91)} #69#return; {16588#(< ~counter~0 91)} is VALID [2022-04-28 14:06:28,548 INFO L290 TraceCheckUtils]: 9: Hoare triple {16010#true} assume true; {16010#true} is VALID [2022-04-28 14:06:28,548 INFO L290 TraceCheckUtils]: 8: Hoare triple {16010#true} assume !(0 == ~cond); {16010#true} is VALID [2022-04-28 14:06:28,548 INFO L290 TraceCheckUtils]: 7: Hoare triple {16010#true} ~cond := #in~cond; {16010#true} is VALID [2022-04-28 14:06:28,548 INFO L272 TraceCheckUtils]: 6: Hoare triple {16588#(< ~counter~0 91)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {16010#true} is VALID [2022-04-28 14:06:28,548 INFO L290 TraceCheckUtils]: 5: Hoare triple {16588#(< ~counter~0 91)} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {16588#(< ~counter~0 91)} is VALID [2022-04-28 14:06:28,548 INFO L272 TraceCheckUtils]: 4: Hoare triple {16588#(< ~counter~0 91)} call #t~ret7 := main(); {16588#(< ~counter~0 91)} is VALID [2022-04-28 14:06:28,549 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16588#(< ~counter~0 91)} {16010#true} #77#return; {16588#(< ~counter~0 91)} is VALID [2022-04-28 14:06:28,549 INFO L290 TraceCheckUtils]: 2: Hoare triple {16588#(< ~counter~0 91)} assume true; {16588#(< ~counter~0 91)} is VALID [2022-04-28 14:06:28,549 INFO L290 TraceCheckUtils]: 1: Hoare triple {16010#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(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {16588#(< ~counter~0 91)} is VALID [2022-04-28 14:06:28,549 INFO L272 TraceCheckUtils]: 0: Hoare triple {16010#true} call ULTIMATE.init(); {16010#true} is VALID [2022-04-28 14:06:28,550 INFO L134 CoverageAnalysis]: Checked inductivity of 360 backedges. 18 proven. 198 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2022-04-28 14:06:28,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:06:28,550 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1102423390] [2022-04-28 14:06:28,550 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 14:06:28,550 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1779937370] [2022-04-28 14:06:28,550 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1779937370] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 14:06:28,550 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 14:06:28,550 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 24 [2022-04-28 14:06:28,550 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:06:28,550 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1012242810] [2022-04-28 14:06:28,550 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1012242810] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:06:28,551 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:06:28,551 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-28 14:06:28,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [690352309] [2022-04-28 14:06:28,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:06:28,551 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.769230769230769) internal successors, (75), 12 states have internal predecessors, (75), 12 states have call successors, (13), 12 states have call predecessors, (13), 10 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) Word has length 99 [2022-04-28 14:06:28,551 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:06:28,552 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 13 states have (on average 5.769230769230769) internal successors, (75), 12 states have internal predecessors, (75), 12 states have call successors, (13), 12 states have call predecessors, (13), 10 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-28 14:06:28,621 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 99 edges. 99 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:06:28,621 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-28 14:06:28,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:06:28,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-28 14:06:28,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=316, Unknown=0, NotChecked=0, Total=552 [2022-04-28 14:06:28,622 INFO L87 Difference]: Start difference. First operand 131 states and 160 transitions. Second operand has 13 states, 13 states have (on average 5.769230769230769) internal successors, (75), 12 states have internal predecessors, (75), 12 states have call successors, (13), 12 states have call predecessors, (13), 10 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-28 14:06:29,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:06:29,200 INFO L93 Difference]: Finished difference Result 150 states and 183 transitions. [2022-04-28 14:06:29,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-04-28 14:06:29,200 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.769230769230769) internal successors, (75), 12 states have internal predecessors, (75), 12 states have call successors, (13), 12 states have call predecessors, (13), 10 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) Word has length 99 [2022-04-28 14:06:29,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:06:29,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 5.769230769230769) internal successors, (75), 12 states have internal predecessors, (75), 12 states have call successors, (13), 12 states have call predecessors, (13), 10 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-28 14:06:29,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 169 transitions. [2022-04-28 14:06:29,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 5.769230769230769) internal successors, (75), 12 states have internal predecessors, (75), 12 states have call successors, (13), 12 states have call predecessors, (13), 10 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-28 14:06:29,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 169 transitions. [2022-04-28 14:06:29,205 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 22 states and 169 transitions. [2022-04-28 14:06:29,334 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 169 edges. 169 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:06:29,336 INFO L225 Difference]: With dead ends: 150 [2022-04-28 14:06:29,336 INFO L226 Difference]: Without dead ends: 142 [2022-04-28 14:06:29,337 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 175 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=443, Invalid=613, Unknown=0, NotChecked=0, Total=1056 [2022-04-28 14:06:29,337 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 122 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 14:06:29,337 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 186 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 14:06:29,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2022-04-28 14:06:29,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 142. [2022-04-28 14:06:29,567 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:06:29,567 INFO L82 GeneralOperation]: Start isEquivalent. First operand 142 states. Second operand has 142 states, 111 states have (on average 1.2972972972972974) internal successors, (144), 112 states have internal predecessors, (144), 16 states have call successors, (16), 15 states have call predecessors, (16), 14 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-28 14:06:29,567 INFO L74 IsIncluded]: Start isIncluded. First operand 142 states. Second operand has 142 states, 111 states have (on average 1.2972972972972974) internal successors, (144), 112 states have internal predecessors, (144), 16 states have call successors, (16), 15 states have call predecessors, (16), 14 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-28 14:06:29,567 INFO L87 Difference]: Start difference. First operand 142 states. Second operand has 142 states, 111 states have (on average 1.2972972972972974) internal successors, (144), 112 states have internal predecessors, (144), 16 states have call successors, (16), 15 states have call predecessors, (16), 14 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-28 14:06:29,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:06:29,569 INFO L93 Difference]: Finished difference Result 142 states and 174 transitions. [2022-04-28 14:06:29,570 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 174 transitions. [2022-04-28 14:06:29,570 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:06:29,570 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:06:29,570 INFO L74 IsIncluded]: Start isIncluded. First operand has 142 states, 111 states have (on average 1.2972972972972974) internal successors, (144), 112 states have internal predecessors, (144), 16 states have call successors, (16), 15 states have call predecessors, (16), 14 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand 142 states. [2022-04-28 14:06:29,570 INFO L87 Difference]: Start difference. First operand has 142 states, 111 states have (on average 1.2972972972972974) internal successors, (144), 112 states have internal predecessors, (144), 16 states have call successors, (16), 15 states have call predecessors, (16), 14 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand 142 states. [2022-04-28 14:06:29,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:06:29,573 INFO L93 Difference]: Finished difference Result 142 states and 174 transitions. [2022-04-28 14:06:29,573 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 174 transitions. [2022-04-28 14:06:29,573 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:06:29,573 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:06:29,573 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:06:29,573 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:06:29,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 111 states have (on average 1.2972972972972974) internal successors, (144), 112 states have internal predecessors, (144), 16 states have call successors, (16), 15 states have call predecessors, (16), 14 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-28 14:06:29,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 174 transitions. [2022-04-28 14:06:29,576 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 174 transitions. Word has length 99 [2022-04-28 14:06:29,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:06:29,576 INFO L495 AbstractCegarLoop]: Abstraction has 142 states and 174 transitions. [2022-04-28 14:06:29,576 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.769230769230769) internal successors, (75), 12 states have internal predecessors, (75), 12 states have call successors, (13), 12 states have call predecessors, (13), 10 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-28 14:06:29,576 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 142 states and 174 transitions. [2022-04-28 14:06:49,195 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 174 edges. 165 inductive. 0 not inductive. 9 times theorem prover too weak to decide inductivity. [2022-04-28 14:06:49,196 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 174 transitions. [2022-04-28 14:06:49,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2022-04-28 14:06:49,197 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:06:49,197 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 14:06:49,227 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2022-04-28 14:06:49,407 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 14:06:49,407 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:06:49,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:06:49,408 INFO L85 PathProgramCache]: Analyzing trace with hash 1397474810, now seen corresponding path program 19 times [2022-04-28 14:06:49,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:06:49,408 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [206511481] [2022-04-28 14:06:55,458 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 14:06:55,458 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 14:06:55,458 INFO L85 PathProgramCache]: Analyzing trace with hash 1397474810, now seen corresponding path program 20 times [2022-04-28 14:06:55,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:06:55,458 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1303706940] [2022-04-28 14:06:55,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:06:55,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:06:55,474 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 14:06:55,474 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1789440714] [2022-04-28 14:06:55,474 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 14:06:55,474 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 14:06:55,474 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 14:06:55,479 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 14:06:55,483 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2022-04-28 14:06:55,558 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 14:06:55,558 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 14:06:55,560 INFO L263 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 25 conjunts are in the unsatisfiable core [2022-04-28 14:06:55,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:06:55,587 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 14:06:56,093 INFO L272 TraceCheckUtils]: 0: Hoare triple {17513#true} call ULTIMATE.init(); {17513#true} is VALID [2022-04-28 14:06:56,094 INFO L290 TraceCheckUtils]: 1: Hoare triple {17513#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(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {17521#(<= ~counter~0 0)} is VALID [2022-04-28 14:06:56,094 INFO L290 TraceCheckUtils]: 2: Hoare triple {17521#(<= ~counter~0 0)} assume true; {17521#(<= ~counter~0 0)} is VALID [2022-04-28 14:06:56,094 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17521#(<= ~counter~0 0)} {17513#true} #77#return; {17521#(<= ~counter~0 0)} is VALID [2022-04-28 14:06:56,095 INFO L272 TraceCheckUtils]: 4: Hoare triple {17521#(<= ~counter~0 0)} call #t~ret7 := main(); {17521#(<= ~counter~0 0)} is VALID [2022-04-28 14:06:56,095 INFO L290 TraceCheckUtils]: 5: Hoare triple {17521#(<= ~counter~0 0)} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {17521#(<= ~counter~0 0)} is VALID [2022-04-28 14:06:56,095 INFO L272 TraceCheckUtils]: 6: Hoare triple {17521#(<= ~counter~0 0)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {17521#(<= ~counter~0 0)} is VALID [2022-04-28 14:06:56,096 INFO L290 TraceCheckUtils]: 7: Hoare triple {17521#(<= ~counter~0 0)} ~cond := #in~cond; {17521#(<= ~counter~0 0)} is VALID [2022-04-28 14:06:56,096 INFO L290 TraceCheckUtils]: 8: Hoare triple {17521#(<= ~counter~0 0)} assume !(0 == ~cond); {17521#(<= ~counter~0 0)} is VALID [2022-04-28 14:06:56,096 INFO L290 TraceCheckUtils]: 9: Hoare triple {17521#(<= ~counter~0 0)} assume true; {17521#(<= ~counter~0 0)} is VALID [2022-04-28 14:06:56,096 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {17521#(<= ~counter~0 0)} {17521#(<= ~counter~0 0)} #69#return; {17521#(<= ~counter~0 0)} is VALID [2022-04-28 14:06:56,097 INFO L290 TraceCheckUtils]: 11: Hoare triple {17521#(<= ~counter~0 0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {17521#(<= ~counter~0 0)} is VALID [2022-04-28 14:06:56,097 INFO L290 TraceCheckUtils]: 12: Hoare triple {17521#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {17555#(<= ~counter~0 1)} is VALID [2022-04-28 14:06:56,098 INFO L290 TraceCheckUtils]: 13: Hoare triple {17555#(<= ~counter~0 1)} assume !!(#t~post6 < 100);havoc #t~post6; {17555#(<= ~counter~0 1)} is VALID [2022-04-28 14:06:56,098 INFO L272 TraceCheckUtils]: 14: Hoare triple {17555#(<= ~counter~0 1)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {17555#(<= ~counter~0 1)} is VALID [2022-04-28 14:06:56,098 INFO L290 TraceCheckUtils]: 15: Hoare triple {17555#(<= ~counter~0 1)} ~cond := #in~cond; {17555#(<= ~counter~0 1)} is VALID [2022-04-28 14:06:56,099 INFO L290 TraceCheckUtils]: 16: Hoare triple {17555#(<= ~counter~0 1)} assume !(0 == ~cond); {17555#(<= ~counter~0 1)} is VALID [2022-04-28 14:06:56,099 INFO L290 TraceCheckUtils]: 17: Hoare triple {17555#(<= ~counter~0 1)} assume true; {17555#(<= ~counter~0 1)} is VALID [2022-04-28 14:06:56,100 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {17555#(<= ~counter~0 1)} {17555#(<= ~counter~0 1)} #71#return; {17555#(<= ~counter~0 1)} is VALID [2022-04-28 14:06:56,100 INFO L290 TraceCheckUtils]: 19: Hoare triple {17555#(<= ~counter~0 1)} assume !!(0 != ~a~0 && 0 != ~b~0); {17555#(<= ~counter~0 1)} is VALID [2022-04-28 14:06:56,101 INFO L290 TraceCheckUtils]: 20: Hoare triple {17555#(<= ~counter~0 1)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {17555#(<= ~counter~0 1)} is VALID [2022-04-28 14:06:56,101 INFO L290 TraceCheckUtils]: 21: Hoare triple {17555#(<= ~counter~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {17583#(<= ~counter~0 2)} is VALID [2022-04-28 14:06:56,101 INFO L290 TraceCheckUtils]: 22: Hoare triple {17583#(<= ~counter~0 2)} assume !!(#t~post6 < 100);havoc #t~post6; {17583#(<= ~counter~0 2)} is VALID [2022-04-28 14:06:56,102 INFO L272 TraceCheckUtils]: 23: Hoare triple {17583#(<= ~counter~0 2)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {17583#(<= ~counter~0 2)} is VALID [2022-04-28 14:06:56,102 INFO L290 TraceCheckUtils]: 24: Hoare triple {17583#(<= ~counter~0 2)} ~cond := #in~cond; {17583#(<= ~counter~0 2)} is VALID [2022-04-28 14:06:56,102 INFO L290 TraceCheckUtils]: 25: Hoare triple {17583#(<= ~counter~0 2)} assume !(0 == ~cond); {17583#(<= ~counter~0 2)} is VALID [2022-04-28 14:06:56,103 INFO L290 TraceCheckUtils]: 26: Hoare triple {17583#(<= ~counter~0 2)} assume true; {17583#(<= ~counter~0 2)} is VALID [2022-04-28 14:06:56,103 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {17583#(<= ~counter~0 2)} {17583#(<= ~counter~0 2)} #71#return; {17583#(<= ~counter~0 2)} is VALID [2022-04-28 14:06:56,103 INFO L290 TraceCheckUtils]: 28: Hoare triple {17583#(<= ~counter~0 2)} assume !!(0 != ~a~0 && 0 != ~b~0); {17583#(<= ~counter~0 2)} is VALID [2022-04-28 14:06:56,104 INFO L290 TraceCheckUtils]: 29: Hoare triple {17583#(<= ~counter~0 2)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {17583#(<= ~counter~0 2)} is VALID [2022-04-28 14:06:56,104 INFO L290 TraceCheckUtils]: 30: Hoare triple {17583#(<= ~counter~0 2)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {17611#(<= ~counter~0 3)} is VALID [2022-04-28 14:06:56,104 INFO L290 TraceCheckUtils]: 31: Hoare triple {17611#(<= ~counter~0 3)} assume !!(#t~post6 < 100);havoc #t~post6; {17611#(<= ~counter~0 3)} is VALID [2022-04-28 14:06:56,105 INFO L272 TraceCheckUtils]: 32: Hoare triple {17611#(<= ~counter~0 3)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {17611#(<= ~counter~0 3)} is VALID [2022-04-28 14:06:56,105 INFO L290 TraceCheckUtils]: 33: Hoare triple {17611#(<= ~counter~0 3)} ~cond := #in~cond; {17611#(<= ~counter~0 3)} is VALID [2022-04-28 14:06:56,106 INFO L290 TraceCheckUtils]: 34: Hoare triple {17611#(<= ~counter~0 3)} assume !(0 == ~cond); {17611#(<= ~counter~0 3)} is VALID [2022-04-28 14:06:56,106 INFO L290 TraceCheckUtils]: 35: Hoare triple {17611#(<= ~counter~0 3)} assume true; {17611#(<= ~counter~0 3)} is VALID [2022-04-28 14:06:56,106 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {17611#(<= ~counter~0 3)} {17611#(<= ~counter~0 3)} #71#return; {17611#(<= ~counter~0 3)} is VALID [2022-04-28 14:06:56,107 INFO L290 TraceCheckUtils]: 37: Hoare triple {17611#(<= ~counter~0 3)} assume !!(0 != ~a~0 && 0 != ~b~0); {17611#(<= ~counter~0 3)} is VALID [2022-04-28 14:06:56,107 INFO L290 TraceCheckUtils]: 38: Hoare triple {17611#(<= ~counter~0 3)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {17611#(<= ~counter~0 3)} is VALID [2022-04-28 14:06:56,107 INFO L290 TraceCheckUtils]: 39: Hoare triple {17611#(<= ~counter~0 3)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {17639#(<= ~counter~0 4)} is VALID [2022-04-28 14:06:56,108 INFO L290 TraceCheckUtils]: 40: Hoare triple {17639#(<= ~counter~0 4)} assume !!(#t~post6 < 100);havoc #t~post6; {17639#(<= ~counter~0 4)} is VALID [2022-04-28 14:06:56,108 INFO L272 TraceCheckUtils]: 41: Hoare triple {17639#(<= ~counter~0 4)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {17639#(<= ~counter~0 4)} is VALID [2022-04-28 14:06:56,108 INFO L290 TraceCheckUtils]: 42: Hoare triple {17639#(<= ~counter~0 4)} ~cond := #in~cond; {17639#(<= ~counter~0 4)} is VALID [2022-04-28 14:06:56,109 INFO L290 TraceCheckUtils]: 43: Hoare triple {17639#(<= ~counter~0 4)} assume !(0 == ~cond); {17639#(<= ~counter~0 4)} is VALID [2022-04-28 14:06:56,109 INFO L290 TraceCheckUtils]: 44: Hoare triple {17639#(<= ~counter~0 4)} assume true; {17639#(<= ~counter~0 4)} is VALID [2022-04-28 14:06:56,110 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {17639#(<= ~counter~0 4)} {17639#(<= ~counter~0 4)} #71#return; {17639#(<= ~counter~0 4)} is VALID [2022-04-28 14:06:56,110 INFO L290 TraceCheckUtils]: 46: Hoare triple {17639#(<= ~counter~0 4)} assume !!(0 != ~a~0 && 0 != ~b~0); {17639#(<= ~counter~0 4)} is VALID [2022-04-28 14:06:56,110 INFO L290 TraceCheckUtils]: 47: Hoare triple {17639#(<= ~counter~0 4)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {17639#(<= ~counter~0 4)} is VALID [2022-04-28 14:06:56,111 INFO L290 TraceCheckUtils]: 48: Hoare triple {17639#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {17667#(<= ~counter~0 5)} is VALID [2022-04-28 14:06:56,111 INFO L290 TraceCheckUtils]: 49: Hoare triple {17667#(<= ~counter~0 5)} assume !!(#t~post6 < 100);havoc #t~post6; {17667#(<= ~counter~0 5)} is VALID [2022-04-28 14:06:56,111 INFO L272 TraceCheckUtils]: 50: Hoare triple {17667#(<= ~counter~0 5)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {17667#(<= ~counter~0 5)} is VALID [2022-04-28 14:06:56,112 INFO L290 TraceCheckUtils]: 51: Hoare triple {17667#(<= ~counter~0 5)} ~cond := #in~cond; {17667#(<= ~counter~0 5)} is VALID [2022-04-28 14:06:56,112 INFO L290 TraceCheckUtils]: 52: Hoare triple {17667#(<= ~counter~0 5)} assume !(0 == ~cond); {17667#(<= ~counter~0 5)} is VALID [2022-04-28 14:06:56,112 INFO L290 TraceCheckUtils]: 53: Hoare triple {17667#(<= ~counter~0 5)} assume true; {17667#(<= ~counter~0 5)} is VALID [2022-04-28 14:06:56,113 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {17667#(<= ~counter~0 5)} {17667#(<= ~counter~0 5)} #71#return; {17667#(<= ~counter~0 5)} is VALID [2022-04-28 14:06:56,113 INFO L290 TraceCheckUtils]: 55: Hoare triple {17667#(<= ~counter~0 5)} assume !!(0 != ~a~0 && 0 != ~b~0); {17667#(<= ~counter~0 5)} is VALID [2022-04-28 14:06:56,113 INFO L290 TraceCheckUtils]: 56: Hoare triple {17667#(<= ~counter~0 5)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {17667#(<= ~counter~0 5)} is VALID [2022-04-28 14:06:56,114 INFO L290 TraceCheckUtils]: 57: Hoare triple {17667#(<= ~counter~0 5)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {17695#(<= ~counter~0 6)} is VALID [2022-04-28 14:06:56,114 INFO L290 TraceCheckUtils]: 58: Hoare triple {17695#(<= ~counter~0 6)} assume !!(#t~post6 < 100);havoc #t~post6; {17695#(<= ~counter~0 6)} is VALID [2022-04-28 14:06:56,115 INFO L272 TraceCheckUtils]: 59: Hoare triple {17695#(<= ~counter~0 6)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {17695#(<= ~counter~0 6)} is VALID [2022-04-28 14:06:56,115 INFO L290 TraceCheckUtils]: 60: Hoare triple {17695#(<= ~counter~0 6)} ~cond := #in~cond; {17695#(<= ~counter~0 6)} is VALID [2022-04-28 14:06:56,115 INFO L290 TraceCheckUtils]: 61: Hoare triple {17695#(<= ~counter~0 6)} assume !(0 == ~cond); {17695#(<= ~counter~0 6)} is VALID [2022-04-28 14:06:56,115 INFO L290 TraceCheckUtils]: 62: Hoare triple {17695#(<= ~counter~0 6)} assume true; {17695#(<= ~counter~0 6)} is VALID [2022-04-28 14:06:56,116 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {17695#(<= ~counter~0 6)} {17695#(<= ~counter~0 6)} #71#return; {17695#(<= ~counter~0 6)} is VALID [2022-04-28 14:06:56,116 INFO L290 TraceCheckUtils]: 64: Hoare triple {17695#(<= ~counter~0 6)} assume !!(0 != ~a~0 && 0 != ~b~0); {17695#(<= ~counter~0 6)} is VALID [2022-04-28 14:06:56,116 INFO L290 TraceCheckUtils]: 65: Hoare triple {17695#(<= ~counter~0 6)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {17695#(<= ~counter~0 6)} is VALID [2022-04-28 14:06:56,117 INFO L290 TraceCheckUtils]: 66: Hoare triple {17695#(<= ~counter~0 6)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {17723#(<= ~counter~0 7)} is VALID [2022-04-28 14:06:56,117 INFO L290 TraceCheckUtils]: 67: Hoare triple {17723#(<= ~counter~0 7)} assume !!(#t~post6 < 100);havoc #t~post6; {17723#(<= ~counter~0 7)} is VALID [2022-04-28 14:06:56,118 INFO L272 TraceCheckUtils]: 68: Hoare triple {17723#(<= ~counter~0 7)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {17723#(<= ~counter~0 7)} is VALID [2022-04-28 14:06:56,118 INFO L290 TraceCheckUtils]: 69: Hoare triple {17723#(<= ~counter~0 7)} ~cond := #in~cond; {17723#(<= ~counter~0 7)} is VALID [2022-04-28 14:06:56,118 INFO L290 TraceCheckUtils]: 70: Hoare triple {17723#(<= ~counter~0 7)} assume !(0 == ~cond); {17723#(<= ~counter~0 7)} is VALID [2022-04-28 14:06:56,118 INFO L290 TraceCheckUtils]: 71: Hoare triple {17723#(<= ~counter~0 7)} assume true; {17723#(<= ~counter~0 7)} is VALID [2022-04-28 14:06:56,119 INFO L284 TraceCheckUtils]: 72: Hoare quadruple {17723#(<= ~counter~0 7)} {17723#(<= ~counter~0 7)} #71#return; {17723#(<= ~counter~0 7)} is VALID [2022-04-28 14:06:56,119 INFO L290 TraceCheckUtils]: 73: Hoare triple {17723#(<= ~counter~0 7)} assume !!(0 != ~a~0 && 0 != ~b~0); {17723#(<= ~counter~0 7)} is VALID [2022-04-28 14:06:56,120 INFO L290 TraceCheckUtils]: 74: Hoare triple {17723#(<= ~counter~0 7)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {17723#(<= ~counter~0 7)} is VALID [2022-04-28 14:06:56,120 INFO L290 TraceCheckUtils]: 75: Hoare triple {17723#(<= ~counter~0 7)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {17751#(<= ~counter~0 8)} is VALID [2022-04-28 14:06:56,120 INFO L290 TraceCheckUtils]: 76: Hoare triple {17751#(<= ~counter~0 8)} assume !!(#t~post6 < 100);havoc #t~post6; {17751#(<= ~counter~0 8)} is VALID [2022-04-28 14:06:56,121 INFO L272 TraceCheckUtils]: 77: Hoare triple {17751#(<= ~counter~0 8)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {17751#(<= ~counter~0 8)} is VALID [2022-04-28 14:06:56,121 INFO L290 TraceCheckUtils]: 78: Hoare triple {17751#(<= ~counter~0 8)} ~cond := #in~cond; {17751#(<= ~counter~0 8)} is VALID [2022-04-28 14:06:56,121 INFO L290 TraceCheckUtils]: 79: Hoare triple {17751#(<= ~counter~0 8)} assume !(0 == ~cond); {17751#(<= ~counter~0 8)} is VALID [2022-04-28 14:06:56,122 INFO L290 TraceCheckUtils]: 80: Hoare triple {17751#(<= ~counter~0 8)} assume true; {17751#(<= ~counter~0 8)} is VALID [2022-04-28 14:06:56,122 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {17751#(<= ~counter~0 8)} {17751#(<= ~counter~0 8)} #71#return; {17751#(<= ~counter~0 8)} is VALID [2022-04-28 14:06:56,122 INFO L290 TraceCheckUtils]: 82: Hoare triple {17751#(<= ~counter~0 8)} assume !!(0 != ~a~0 && 0 != ~b~0); {17751#(<= ~counter~0 8)} is VALID [2022-04-28 14:06:56,123 INFO L290 TraceCheckUtils]: 83: Hoare triple {17751#(<= ~counter~0 8)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {17751#(<= ~counter~0 8)} is VALID [2022-04-28 14:06:56,123 INFO L290 TraceCheckUtils]: 84: Hoare triple {17751#(<= ~counter~0 8)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {17779#(<= ~counter~0 9)} is VALID [2022-04-28 14:06:56,123 INFO L290 TraceCheckUtils]: 85: Hoare triple {17779#(<= ~counter~0 9)} assume !!(#t~post6 < 100);havoc #t~post6; {17779#(<= ~counter~0 9)} is VALID [2022-04-28 14:06:56,124 INFO L272 TraceCheckUtils]: 86: Hoare triple {17779#(<= ~counter~0 9)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {17779#(<= ~counter~0 9)} is VALID [2022-04-28 14:06:56,124 INFO L290 TraceCheckUtils]: 87: Hoare triple {17779#(<= ~counter~0 9)} ~cond := #in~cond; {17779#(<= ~counter~0 9)} is VALID [2022-04-28 14:06:56,125 INFO L290 TraceCheckUtils]: 88: Hoare triple {17779#(<= ~counter~0 9)} assume !(0 == ~cond); {17779#(<= ~counter~0 9)} is VALID [2022-04-28 14:06:56,125 INFO L290 TraceCheckUtils]: 89: Hoare triple {17779#(<= ~counter~0 9)} assume true; {17779#(<= ~counter~0 9)} is VALID [2022-04-28 14:06:56,125 INFO L284 TraceCheckUtils]: 90: Hoare quadruple {17779#(<= ~counter~0 9)} {17779#(<= ~counter~0 9)} #71#return; {17779#(<= ~counter~0 9)} is VALID [2022-04-28 14:06:56,126 INFO L290 TraceCheckUtils]: 91: Hoare triple {17779#(<= ~counter~0 9)} assume !!(0 != ~a~0 && 0 != ~b~0); {17779#(<= ~counter~0 9)} is VALID [2022-04-28 14:06:56,126 INFO L290 TraceCheckUtils]: 92: Hoare triple {17779#(<= ~counter~0 9)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {17779#(<= ~counter~0 9)} is VALID [2022-04-28 14:06:56,126 INFO L290 TraceCheckUtils]: 93: Hoare triple {17779#(<= ~counter~0 9)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {17807#(<= ~counter~0 10)} is VALID [2022-04-28 14:06:56,127 INFO L290 TraceCheckUtils]: 94: Hoare triple {17807#(<= ~counter~0 10)} assume !!(#t~post6 < 100);havoc #t~post6; {17807#(<= ~counter~0 10)} is VALID [2022-04-28 14:06:56,127 INFO L272 TraceCheckUtils]: 95: Hoare triple {17807#(<= ~counter~0 10)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {17807#(<= ~counter~0 10)} is VALID [2022-04-28 14:06:56,127 INFO L290 TraceCheckUtils]: 96: Hoare triple {17807#(<= ~counter~0 10)} ~cond := #in~cond; {17807#(<= ~counter~0 10)} is VALID [2022-04-28 14:06:56,128 INFO L290 TraceCheckUtils]: 97: Hoare triple {17807#(<= ~counter~0 10)} assume !(0 == ~cond); {17807#(<= ~counter~0 10)} is VALID [2022-04-28 14:06:56,128 INFO L290 TraceCheckUtils]: 98: Hoare triple {17807#(<= ~counter~0 10)} assume true; {17807#(<= ~counter~0 10)} is VALID [2022-04-28 14:06:56,128 INFO L284 TraceCheckUtils]: 99: Hoare quadruple {17807#(<= ~counter~0 10)} {17807#(<= ~counter~0 10)} #71#return; {17807#(<= ~counter~0 10)} is VALID [2022-04-28 14:06:56,129 INFO L290 TraceCheckUtils]: 100: Hoare triple {17807#(<= ~counter~0 10)} assume !!(0 != ~a~0 && 0 != ~b~0); {17807#(<= ~counter~0 10)} is VALID [2022-04-28 14:06:56,129 INFO L290 TraceCheckUtils]: 101: Hoare triple {17807#(<= ~counter~0 10)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {17807#(<= ~counter~0 10)} is VALID [2022-04-28 14:06:56,129 INFO L290 TraceCheckUtils]: 102: Hoare triple {17807#(<= ~counter~0 10)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {17835#(<= |main_#t~post6| 10)} is VALID [2022-04-28 14:06:56,130 INFO L290 TraceCheckUtils]: 103: Hoare triple {17835#(<= |main_#t~post6| 10)} assume !(#t~post6 < 100);havoc #t~post6; {17514#false} is VALID [2022-04-28 14:06:56,130 INFO L272 TraceCheckUtils]: 104: Hoare triple {17514#false} call __VERIFIER_assert((if ~q~0 == ~x~0 * ~y~0 then 1 else 0)); {17514#false} is VALID [2022-04-28 14:06:56,130 INFO L290 TraceCheckUtils]: 105: Hoare triple {17514#false} ~cond := #in~cond; {17514#false} is VALID [2022-04-28 14:06:56,130 INFO L290 TraceCheckUtils]: 106: Hoare triple {17514#false} assume 0 == ~cond; {17514#false} is VALID [2022-04-28 14:06:56,130 INFO L290 TraceCheckUtils]: 107: Hoare triple {17514#false} assume !false; {17514#false} is VALID [2022-04-28 14:06:56,130 INFO L134 CoverageAnalysis]: Checked inductivity of 445 backedges. 20 proven. 425 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 14:06:56,130 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 14:06:56,733 INFO L290 TraceCheckUtils]: 107: Hoare triple {17514#false} assume !false; {17514#false} is VALID [2022-04-28 14:06:56,734 INFO L290 TraceCheckUtils]: 106: Hoare triple {17514#false} assume 0 == ~cond; {17514#false} is VALID [2022-04-28 14:06:56,734 INFO L290 TraceCheckUtils]: 105: Hoare triple {17514#false} ~cond := #in~cond; {17514#false} is VALID [2022-04-28 14:06:56,734 INFO L272 TraceCheckUtils]: 104: Hoare triple {17514#false} call __VERIFIER_assert((if ~q~0 == ~x~0 * ~y~0 then 1 else 0)); {17514#false} is VALID [2022-04-28 14:06:56,734 INFO L290 TraceCheckUtils]: 103: Hoare triple {17863#(< |main_#t~post6| 100)} assume !(#t~post6 < 100);havoc #t~post6; {17514#false} is VALID [2022-04-28 14:06:56,734 INFO L290 TraceCheckUtils]: 102: Hoare triple {17867#(< ~counter~0 100)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {17863#(< |main_#t~post6| 100)} is VALID [2022-04-28 14:06:56,735 INFO L290 TraceCheckUtils]: 101: Hoare triple {17867#(< ~counter~0 100)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {17867#(< ~counter~0 100)} is VALID [2022-04-28 14:06:56,735 INFO L290 TraceCheckUtils]: 100: Hoare triple {17867#(< ~counter~0 100)} assume !!(0 != ~a~0 && 0 != ~b~0); {17867#(< ~counter~0 100)} is VALID [2022-04-28 14:06:56,735 INFO L284 TraceCheckUtils]: 99: Hoare quadruple {17513#true} {17867#(< ~counter~0 100)} #71#return; {17867#(< ~counter~0 100)} is VALID [2022-04-28 14:06:56,736 INFO L290 TraceCheckUtils]: 98: Hoare triple {17513#true} assume true; {17513#true} is VALID [2022-04-28 14:06:56,736 INFO L290 TraceCheckUtils]: 97: Hoare triple {17513#true} assume !(0 == ~cond); {17513#true} is VALID [2022-04-28 14:06:56,736 INFO L290 TraceCheckUtils]: 96: Hoare triple {17513#true} ~cond := #in~cond; {17513#true} is VALID [2022-04-28 14:06:56,736 INFO L272 TraceCheckUtils]: 95: Hoare triple {17867#(< ~counter~0 100)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {17513#true} is VALID [2022-04-28 14:06:56,736 INFO L290 TraceCheckUtils]: 94: Hoare triple {17867#(< ~counter~0 100)} assume !!(#t~post6 < 100);havoc #t~post6; {17867#(< ~counter~0 100)} is VALID [2022-04-28 14:06:56,737 INFO L290 TraceCheckUtils]: 93: Hoare triple {17895#(< ~counter~0 99)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {17867#(< ~counter~0 100)} is VALID [2022-04-28 14:06:56,737 INFO L290 TraceCheckUtils]: 92: Hoare triple {17895#(< ~counter~0 99)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {17895#(< ~counter~0 99)} is VALID [2022-04-28 14:06:56,737 INFO L290 TraceCheckUtils]: 91: Hoare triple {17895#(< ~counter~0 99)} assume !!(0 != ~a~0 && 0 != ~b~0); {17895#(< ~counter~0 99)} is VALID [2022-04-28 14:06:56,738 INFO L284 TraceCheckUtils]: 90: Hoare quadruple {17513#true} {17895#(< ~counter~0 99)} #71#return; {17895#(< ~counter~0 99)} is VALID [2022-04-28 14:06:56,738 INFO L290 TraceCheckUtils]: 89: Hoare triple {17513#true} assume true; {17513#true} is VALID [2022-04-28 14:06:56,738 INFO L290 TraceCheckUtils]: 88: Hoare triple {17513#true} assume !(0 == ~cond); {17513#true} is VALID [2022-04-28 14:06:56,738 INFO L290 TraceCheckUtils]: 87: Hoare triple {17513#true} ~cond := #in~cond; {17513#true} is VALID [2022-04-28 14:06:56,738 INFO L272 TraceCheckUtils]: 86: Hoare triple {17895#(< ~counter~0 99)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {17513#true} is VALID [2022-04-28 14:06:56,738 INFO L290 TraceCheckUtils]: 85: Hoare triple {17895#(< ~counter~0 99)} assume !!(#t~post6 < 100);havoc #t~post6; {17895#(< ~counter~0 99)} is VALID [2022-04-28 14:06:56,739 INFO L290 TraceCheckUtils]: 84: Hoare triple {17923#(< ~counter~0 98)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {17895#(< ~counter~0 99)} is VALID [2022-04-28 14:06:56,739 INFO L290 TraceCheckUtils]: 83: Hoare triple {17923#(< ~counter~0 98)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {17923#(< ~counter~0 98)} is VALID [2022-04-28 14:06:56,739 INFO L290 TraceCheckUtils]: 82: Hoare triple {17923#(< ~counter~0 98)} assume !!(0 != ~a~0 && 0 != ~b~0); {17923#(< ~counter~0 98)} is VALID [2022-04-28 14:06:56,740 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {17513#true} {17923#(< ~counter~0 98)} #71#return; {17923#(< ~counter~0 98)} is VALID [2022-04-28 14:06:56,740 INFO L290 TraceCheckUtils]: 80: Hoare triple {17513#true} assume true; {17513#true} is VALID [2022-04-28 14:06:56,740 INFO L290 TraceCheckUtils]: 79: Hoare triple {17513#true} assume !(0 == ~cond); {17513#true} is VALID [2022-04-28 14:06:56,740 INFO L290 TraceCheckUtils]: 78: Hoare triple {17513#true} ~cond := #in~cond; {17513#true} is VALID [2022-04-28 14:06:56,740 INFO L272 TraceCheckUtils]: 77: Hoare triple {17923#(< ~counter~0 98)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {17513#true} is VALID [2022-04-28 14:06:56,740 INFO L290 TraceCheckUtils]: 76: Hoare triple {17923#(< ~counter~0 98)} assume !!(#t~post6 < 100);havoc #t~post6; {17923#(< ~counter~0 98)} is VALID [2022-04-28 14:06:56,741 INFO L290 TraceCheckUtils]: 75: Hoare triple {17951#(< ~counter~0 97)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {17923#(< ~counter~0 98)} is VALID [2022-04-28 14:06:56,741 INFO L290 TraceCheckUtils]: 74: Hoare triple {17951#(< ~counter~0 97)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {17951#(< ~counter~0 97)} is VALID [2022-04-28 14:06:56,741 INFO L290 TraceCheckUtils]: 73: Hoare triple {17951#(< ~counter~0 97)} assume !!(0 != ~a~0 && 0 != ~b~0); {17951#(< ~counter~0 97)} is VALID [2022-04-28 14:06:56,742 INFO L284 TraceCheckUtils]: 72: Hoare quadruple {17513#true} {17951#(< ~counter~0 97)} #71#return; {17951#(< ~counter~0 97)} is VALID [2022-04-28 14:06:56,742 INFO L290 TraceCheckUtils]: 71: Hoare triple {17513#true} assume true; {17513#true} is VALID [2022-04-28 14:06:56,742 INFO L290 TraceCheckUtils]: 70: Hoare triple {17513#true} assume !(0 == ~cond); {17513#true} is VALID [2022-04-28 14:06:56,742 INFO L290 TraceCheckUtils]: 69: Hoare triple {17513#true} ~cond := #in~cond; {17513#true} is VALID [2022-04-28 14:06:56,742 INFO L272 TraceCheckUtils]: 68: Hoare triple {17951#(< ~counter~0 97)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {17513#true} is VALID [2022-04-28 14:06:56,742 INFO L290 TraceCheckUtils]: 67: Hoare triple {17951#(< ~counter~0 97)} assume !!(#t~post6 < 100);havoc #t~post6; {17951#(< ~counter~0 97)} is VALID [2022-04-28 14:06:56,743 INFO L290 TraceCheckUtils]: 66: Hoare triple {17979#(< ~counter~0 96)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {17951#(< ~counter~0 97)} is VALID [2022-04-28 14:06:56,743 INFO L290 TraceCheckUtils]: 65: Hoare triple {17979#(< ~counter~0 96)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {17979#(< ~counter~0 96)} is VALID [2022-04-28 14:06:56,743 INFO L290 TraceCheckUtils]: 64: Hoare triple {17979#(< ~counter~0 96)} assume !!(0 != ~a~0 && 0 != ~b~0); {17979#(< ~counter~0 96)} is VALID [2022-04-28 14:06:56,744 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {17513#true} {17979#(< ~counter~0 96)} #71#return; {17979#(< ~counter~0 96)} is VALID [2022-04-28 14:06:56,744 INFO L290 TraceCheckUtils]: 62: Hoare triple {17513#true} assume true; {17513#true} is VALID [2022-04-28 14:06:56,744 INFO L290 TraceCheckUtils]: 61: Hoare triple {17513#true} assume !(0 == ~cond); {17513#true} is VALID [2022-04-28 14:06:56,744 INFO L290 TraceCheckUtils]: 60: Hoare triple {17513#true} ~cond := #in~cond; {17513#true} is VALID [2022-04-28 14:06:56,744 INFO L272 TraceCheckUtils]: 59: Hoare triple {17979#(< ~counter~0 96)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {17513#true} is VALID [2022-04-28 14:06:56,744 INFO L290 TraceCheckUtils]: 58: Hoare triple {17979#(< ~counter~0 96)} assume !!(#t~post6 < 100);havoc #t~post6; {17979#(< ~counter~0 96)} is VALID [2022-04-28 14:06:56,745 INFO L290 TraceCheckUtils]: 57: Hoare triple {18007#(< ~counter~0 95)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {17979#(< ~counter~0 96)} is VALID [2022-04-28 14:06:56,745 INFO L290 TraceCheckUtils]: 56: Hoare triple {18007#(< ~counter~0 95)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {18007#(< ~counter~0 95)} is VALID [2022-04-28 14:06:56,745 INFO L290 TraceCheckUtils]: 55: Hoare triple {18007#(< ~counter~0 95)} assume !!(0 != ~a~0 && 0 != ~b~0); {18007#(< ~counter~0 95)} is VALID [2022-04-28 14:06:56,746 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {17513#true} {18007#(< ~counter~0 95)} #71#return; {18007#(< ~counter~0 95)} is VALID [2022-04-28 14:06:56,746 INFO L290 TraceCheckUtils]: 53: Hoare triple {17513#true} assume true; {17513#true} is VALID [2022-04-28 14:06:56,746 INFO L290 TraceCheckUtils]: 52: Hoare triple {17513#true} assume !(0 == ~cond); {17513#true} is VALID [2022-04-28 14:06:56,746 INFO L290 TraceCheckUtils]: 51: Hoare triple {17513#true} ~cond := #in~cond; {17513#true} is VALID [2022-04-28 14:06:56,746 INFO L272 TraceCheckUtils]: 50: Hoare triple {18007#(< ~counter~0 95)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {17513#true} is VALID [2022-04-28 14:06:56,746 INFO L290 TraceCheckUtils]: 49: Hoare triple {18007#(< ~counter~0 95)} assume !!(#t~post6 < 100);havoc #t~post6; {18007#(< ~counter~0 95)} is VALID [2022-04-28 14:06:56,747 INFO L290 TraceCheckUtils]: 48: Hoare triple {18035#(< ~counter~0 94)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {18007#(< ~counter~0 95)} is VALID [2022-04-28 14:06:56,747 INFO L290 TraceCheckUtils]: 47: Hoare triple {18035#(< ~counter~0 94)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {18035#(< ~counter~0 94)} is VALID [2022-04-28 14:06:56,747 INFO L290 TraceCheckUtils]: 46: Hoare triple {18035#(< ~counter~0 94)} assume !!(0 != ~a~0 && 0 != ~b~0); {18035#(< ~counter~0 94)} is VALID [2022-04-28 14:06:56,748 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {17513#true} {18035#(< ~counter~0 94)} #71#return; {18035#(< ~counter~0 94)} is VALID [2022-04-28 14:06:56,748 INFO L290 TraceCheckUtils]: 44: Hoare triple {17513#true} assume true; {17513#true} is VALID [2022-04-28 14:06:56,748 INFO L290 TraceCheckUtils]: 43: Hoare triple {17513#true} assume !(0 == ~cond); {17513#true} is VALID [2022-04-28 14:06:56,748 INFO L290 TraceCheckUtils]: 42: Hoare triple {17513#true} ~cond := #in~cond; {17513#true} is VALID [2022-04-28 14:06:56,748 INFO L272 TraceCheckUtils]: 41: Hoare triple {18035#(< ~counter~0 94)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {17513#true} is VALID [2022-04-28 14:06:56,748 INFO L290 TraceCheckUtils]: 40: Hoare triple {18035#(< ~counter~0 94)} assume !!(#t~post6 < 100);havoc #t~post6; {18035#(< ~counter~0 94)} is VALID [2022-04-28 14:06:56,749 INFO L290 TraceCheckUtils]: 39: Hoare triple {18063#(< ~counter~0 93)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {18035#(< ~counter~0 94)} is VALID [2022-04-28 14:06:56,749 INFO L290 TraceCheckUtils]: 38: Hoare triple {18063#(< ~counter~0 93)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {18063#(< ~counter~0 93)} is VALID [2022-04-28 14:06:56,749 INFO L290 TraceCheckUtils]: 37: Hoare triple {18063#(< ~counter~0 93)} assume !!(0 != ~a~0 && 0 != ~b~0); {18063#(< ~counter~0 93)} is VALID [2022-04-28 14:06:56,750 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {17513#true} {18063#(< ~counter~0 93)} #71#return; {18063#(< ~counter~0 93)} is VALID [2022-04-28 14:06:56,750 INFO L290 TraceCheckUtils]: 35: Hoare triple {17513#true} assume true; {17513#true} is VALID [2022-04-28 14:06:56,750 INFO L290 TraceCheckUtils]: 34: Hoare triple {17513#true} assume !(0 == ~cond); {17513#true} is VALID [2022-04-28 14:06:56,750 INFO L290 TraceCheckUtils]: 33: Hoare triple {17513#true} ~cond := #in~cond; {17513#true} is VALID [2022-04-28 14:06:56,750 INFO L272 TraceCheckUtils]: 32: Hoare triple {18063#(< ~counter~0 93)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {17513#true} is VALID [2022-04-28 14:06:56,750 INFO L290 TraceCheckUtils]: 31: Hoare triple {18063#(< ~counter~0 93)} assume !!(#t~post6 < 100);havoc #t~post6; {18063#(< ~counter~0 93)} is VALID [2022-04-28 14:06:56,751 INFO L290 TraceCheckUtils]: 30: Hoare triple {18091#(< ~counter~0 92)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {18063#(< ~counter~0 93)} is VALID [2022-04-28 14:06:56,751 INFO L290 TraceCheckUtils]: 29: Hoare triple {18091#(< ~counter~0 92)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {18091#(< ~counter~0 92)} is VALID [2022-04-28 14:06:56,751 INFO L290 TraceCheckUtils]: 28: Hoare triple {18091#(< ~counter~0 92)} assume !!(0 != ~a~0 && 0 != ~b~0); {18091#(< ~counter~0 92)} is VALID [2022-04-28 14:06:56,752 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {17513#true} {18091#(< ~counter~0 92)} #71#return; {18091#(< ~counter~0 92)} is VALID [2022-04-28 14:06:56,752 INFO L290 TraceCheckUtils]: 26: Hoare triple {17513#true} assume true; {17513#true} is VALID [2022-04-28 14:06:56,752 INFO L290 TraceCheckUtils]: 25: Hoare triple {17513#true} assume !(0 == ~cond); {17513#true} is VALID [2022-04-28 14:06:56,752 INFO L290 TraceCheckUtils]: 24: Hoare triple {17513#true} ~cond := #in~cond; {17513#true} is VALID [2022-04-28 14:06:56,752 INFO L272 TraceCheckUtils]: 23: Hoare triple {18091#(< ~counter~0 92)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {17513#true} is VALID [2022-04-28 14:06:56,752 INFO L290 TraceCheckUtils]: 22: Hoare triple {18091#(< ~counter~0 92)} assume !!(#t~post6 < 100);havoc #t~post6; {18091#(< ~counter~0 92)} is VALID [2022-04-28 14:06:56,753 INFO L290 TraceCheckUtils]: 21: Hoare triple {18119#(< ~counter~0 91)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {18091#(< ~counter~0 92)} is VALID [2022-04-28 14:06:56,753 INFO L290 TraceCheckUtils]: 20: Hoare triple {18119#(< ~counter~0 91)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {18119#(< ~counter~0 91)} is VALID [2022-04-28 14:06:56,753 INFO L290 TraceCheckUtils]: 19: Hoare triple {18119#(< ~counter~0 91)} assume !!(0 != ~a~0 && 0 != ~b~0); {18119#(< ~counter~0 91)} is VALID [2022-04-28 14:06:56,754 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {17513#true} {18119#(< ~counter~0 91)} #71#return; {18119#(< ~counter~0 91)} is VALID [2022-04-28 14:06:56,754 INFO L290 TraceCheckUtils]: 17: Hoare triple {17513#true} assume true; {17513#true} is VALID [2022-04-28 14:06:56,754 INFO L290 TraceCheckUtils]: 16: Hoare triple {17513#true} assume !(0 == ~cond); {17513#true} is VALID [2022-04-28 14:06:56,754 INFO L290 TraceCheckUtils]: 15: Hoare triple {17513#true} ~cond := #in~cond; {17513#true} is VALID [2022-04-28 14:06:56,754 INFO L272 TraceCheckUtils]: 14: Hoare triple {18119#(< ~counter~0 91)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {17513#true} is VALID [2022-04-28 14:06:56,754 INFO L290 TraceCheckUtils]: 13: Hoare triple {18119#(< ~counter~0 91)} assume !!(#t~post6 < 100);havoc #t~post6; {18119#(< ~counter~0 91)} is VALID [2022-04-28 14:06:56,755 INFO L290 TraceCheckUtils]: 12: Hoare triple {18147#(< ~counter~0 90)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {18119#(< ~counter~0 91)} is VALID [2022-04-28 14:06:56,755 INFO L290 TraceCheckUtils]: 11: Hoare triple {18147#(< ~counter~0 90)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {18147#(< ~counter~0 90)} is VALID [2022-04-28 14:06:56,755 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {17513#true} {18147#(< ~counter~0 90)} #69#return; {18147#(< ~counter~0 90)} is VALID [2022-04-28 14:06:56,755 INFO L290 TraceCheckUtils]: 9: Hoare triple {17513#true} assume true; {17513#true} is VALID [2022-04-28 14:06:56,755 INFO L290 TraceCheckUtils]: 8: Hoare triple {17513#true} assume !(0 == ~cond); {17513#true} is VALID [2022-04-28 14:06:56,755 INFO L290 TraceCheckUtils]: 7: Hoare triple {17513#true} ~cond := #in~cond; {17513#true} is VALID [2022-04-28 14:06:56,755 INFO L272 TraceCheckUtils]: 6: Hoare triple {18147#(< ~counter~0 90)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {17513#true} is VALID [2022-04-28 14:06:56,756 INFO L290 TraceCheckUtils]: 5: Hoare triple {18147#(< ~counter~0 90)} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {18147#(< ~counter~0 90)} is VALID [2022-04-28 14:06:56,756 INFO L272 TraceCheckUtils]: 4: Hoare triple {18147#(< ~counter~0 90)} call #t~ret7 := main(); {18147#(< ~counter~0 90)} is VALID [2022-04-28 14:06:56,756 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18147#(< ~counter~0 90)} {17513#true} #77#return; {18147#(< ~counter~0 90)} is VALID [2022-04-28 14:06:56,757 INFO L290 TraceCheckUtils]: 2: Hoare triple {18147#(< ~counter~0 90)} assume true; {18147#(< ~counter~0 90)} is VALID [2022-04-28 14:06:56,759 INFO L290 TraceCheckUtils]: 1: Hoare triple {17513#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(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {18147#(< ~counter~0 90)} is VALID [2022-04-28 14:06:56,759 INFO L272 TraceCheckUtils]: 0: Hoare triple {17513#true} call ULTIMATE.init(); {17513#true} is VALID [2022-04-28 14:06:56,760 INFO L134 CoverageAnalysis]: Checked inductivity of 445 backedges. 20 proven. 245 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2022-04-28 14:06:56,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:06:56,760 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1303706940] [2022-04-28 14:06:56,760 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 14:06:56,760 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1789440714] [2022-04-28 14:06:56,760 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1789440714] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 14:06:56,760 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 14:06:56,760 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2022-04-28 14:06:56,760 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:06:56,760 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [206511481] [2022-04-28 14:06:56,760 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [206511481] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:06:56,760 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:06:56,760 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-28 14:06:56,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [879599414] [2022-04-28 14:06:56,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:06:56,761 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.857142857142857) internal successors, (82), 13 states have internal predecessors, (82), 13 states have call successors, (14), 13 states have call predecessors, (14), 11 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) Word has length 108 [2022-04-28 14:06:56,762 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:06:56,762 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 14 states have (on average 5.857142857142857) internal successors, (82), 13 states have internal predecessors, (82), 13 states have call successors, (14), 13 states have call predecessors, (14), 11 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-28 14:06:56,839 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 14:06:56,839 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-28 14:06:56,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:06:56,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-28 14:06:56,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=281, Invalid=369, Unknown=0, NotChecked=0, Total=650 [2022-04-28 14:06:56,840 INFO L87 Difference]: Start difference. First operand 142 states and 174 transitions. Second operand has 14 states, 14 states have (on average 5.857142857142857) internal successors, (82), 13 states have internal predecessors, (82), 13 states have call successors, (14), 13 states have call predecessors, (14), 11 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-28 14:06:57,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:06:57,455 INFO L93 Difference]: Finished difference Result 161 states and 197 transitions. [2022-04-28 14:06:57,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-04-28 14:06:57,455 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.857142857142857) internal successors, (82), 13 states have internal predecessors, (82), 13 states have call successors, (14), 13 states have call predecessors, (14), 11 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) Word has length 108 [2022-04-28 14:06:57,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:06:57,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 5.857142857142857) internal successors, (82), 13 states have internal predecessors, (82), 13 states have call successors, (14), 13 states have call predecessors, (14), 11 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-28 14:06:57,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 183 transitions. [2022-04-28 14:06:57,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 5.857142857142857) internal successors, (82), 13 states have internal predecessors, (82), 13 states have call successors, (14), 13 states have call predecessors, (14), 11 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-28 14:06:57,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 183 transitions. [2022-04-28 14:06:57,461 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 24 states and 183 transitions. [2022-04-28 14:06:57,645 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 183 edges. 183 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:06:57,648 INFO L225 Difference]: With dead ends: 161 [2022-04-28 14:06:57,648 INFO L226 Difference]: Without dead ends: 153 [2022-04-28 14:06:57,648 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 191 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=531, Invalid=729, Unknown=0, NotChecked=0, Total=1260 [2022-04-28 14:06:57,649 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 97 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 14:06:57,649 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 222 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 14:06:57,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2022-04-28 14:06:57,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 153. [2022-04-28 14:06:57,976 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:06:57,977 INFO L82 GeneralOperation]: Start isEquivalent. First operand 153 states. Second operand has 153 states, 120 states have (on average 1.3) internal successors, (156), 121 states have internal predecessors, (156), 17 states have call successors, (17), 16 states have call predecessors, (17), 15 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-28 14:06:57,977 INFO L74 IsIncluded]: Start isIncluded. First operand 153 states. Second operand has 153 states, 120 states have (on average 1.3) internal successors, (156), 121 states have internal predecessors, (156), 17 states have call successors, (17), 16 states have call predecessors, (17), 15 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-28 14:06:57,977 INFO L87 Difference]: Start difference. First operand 153 states. Second operand has 153 states, 120 states have (on average 1.3) internal successors, (156), 121 states have internal predecessors, (156), 17 states have call successors, (17), 16 states have call predecessors, (17), 15 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-28 14:06:57,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:06:57,980 INFO L93 Difference]: Finished difference Result 153 states and 188 transitions. [2022-04-28 14:06:57,980 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 188 transitions. [2022-04-28 14:06:57,980 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:06:57,980 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:06:57,981 INFO L74 IsIncluded]: Start isIncluded. First operand has 153 states, 120 states have (on average 1.3) internal successors, (156), 121 states have internal predecessors, (156), 17 states have call successors, (17), 16 states have call predecessors, (17), 15 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand 153 states. [2022-04-28 14:06:57,981 INFO L87 Difference]: Start difference. First operand has 153 states, 120 states have (on average 1.3) internal successors, (156), 121 states have internal predecessors, (156), 17 states have call successors, (17), 16 states have call predecessors, (17), 15 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand 153 states. [2022-04-28 14:06:57,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:06:57,983 INFO L93 Difference]: Finished difference Result 153 states and 188 transitions. [2022-04-28 14:06:57,983 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 188 transitions. [2022-04-28 14:06:57,983 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:06:57,983 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:06:57,983 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:06:57,983 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:06:57,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 120 states have (on average 1.3) internal successors, (156), 121 states have internal predecessors, (156), 17 states have call successors, (17), 16 states have call predecessors, (17), 15 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-28 14:06:57,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 188 transitions. [2022-04-28 14:06:57,986 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 188 transitions. Word has length 108 [2022-04-28 14:06:57,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:06:57,986 INFO L495 AbstractCegarLoop]: Abstraction has 153 states and 188 transitions. [2022-04-28 14:06:57,986 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 5.857142857142857) internal successors, (82), 13 states have internal predecessors, (82), 13 states have call successors, (14), 13 states have call predecessors, (14), 11 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-28 14:06:57,987 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 153 states and 188 transitions. [2022-04-28 14:07:19,757 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 188 edges. 178 inductive. 0 not inductive. 10 times theorem prover too weak to decide inductivity. [2022-04-28 14:07:19,757 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 188 transitions. [2022-04-28 14:07:19,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2022-04-28 14:07:19,758 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:07:19,758 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 11, 11, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 14:07:19,780 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Ended with exit code 0 [2022-04-28 14:07:19,971 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 14:07:19,971 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:07:19,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:07:19,972 INFO L85 PathProgramCache]: Analyzing trace with hash -617530302, now seen corresponding path program 21 times [2022-04-28 14:07:19,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:07:19,972 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1996505154] [2022-04-28 14:07:26,019 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 14:07:26,019 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 14:07:26,019 INFO L85 PathProgramCache]: Analyzing trace with hash -617530302, now seen corresponding path program 22 times [2022-04-28 14:07:26,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:07:26,020 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2002864631] [2022-04-28 14:07:26,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:07:26,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:07:26,046 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 14:07:26,046 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [223536504] [2022-04-28 14:07:26,046 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 14:07:26,046 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 14:07:26,046 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 14:07:26,047 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 14:07:26,049 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2022-04-28 14:07:26,141 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 14:07:26,141 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 14:07:26,143 INFO L263 TraceCheckSpWp]: Trace formula consists of 372 conjuncts, 27 conjunts are in the unsatisfiable core [2022-04-28 14:07:26,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:07:26,166 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 14:07:26,761 INFO L272 TraceCheckUtils]: 0: Hoare triple {19140#true} call ULTIMATE.init(); {19140#true} is VALID [2022-04-28 14:07:26,762 INFO L290 TraceCheckUtils]: 1: Hoare triple {19140#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(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {19148#(<= ~counter~0 0)} is VALID [2022-04-28 14:07:26,762 INFO L290 TraceCheckUtils]: 2: Hoare triple {19148#(<= ~counter~0 0)} assume true; {19148#(<= ~counter~0 0)} is VALID [2022-04-28 14:07:26,762 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19148#(<= ~counter~0 0)} {19140#true} #77#return; {19148#(<= ~counter~0 0)} is VALID [2022-04-28 14:07:26,763 INFO L272 TraceCheckUtils]: 4: Hoare triple {19148#(<= ~counter~0 0)} call #t~ret7 := main(); {19148#(<= ~counter~0 0)} is VALID [2022-04-28 14:07:26,763 INFO L290 TraceCheckUtils]: 5: Hoare triple {19148#(<= ~counter~0 0)} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {19148#(<= ~counter~0 0)} is VALID [2022-04-28 14:07:26,763 INFO L272 TraceCheckUtils]: 6: Hoare triple {19148#(<= ~counter~0 0)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {19148#(<= ~counter~0 0)} is VALID [2022-04-28 14:07:26,764 INFO L290 TraceCheckUtils]: 7: Hoare triple {19148#(<= ~counter~0 0)} ~cond := #in~cond; {19148#(<= ~counter~0 0)} is VALID [2022-04-28 14:07:26,764 INFO L290 TraceCheckUtils]: 8: Hoare triple {19148#(<= ~counter~0 0)} assume !(0 == ~cond); {19148#(<= ~counter~0 0)} is VALID [2022-04-28 14:07:26,764 INFO L290 TraceCheckUtils]: 9: Hoare triple {19148#(<= ~counter~0 0)} assume true; {19148#(<= ~counter~0 0)} is VALID [2022-04-28 14:07:26,765 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {19148#(<= ~counter~0 0)} {19148#(<= ~counter~0 0)} #69#return; {19148#(<= ~counter~0 0)} is VALID [2022-04-28 14:07:26,765 INFO L290 TraceCheckUtils]: 11: Hoare triple {19148#(<= ~counter~0 0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {19148#(<= ~counter~0 0)} is VALID [2022-04-28 14:07:26,765 INFO L290 TraceCheckUtils]: 12: Hoare triple {19148#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {19182#(<= ~counter~0 1)} is VALID [2022-04-28 14:07:26,766 INFO L290 TraceCheckUtils]: 13: Hoare triple {19182#(<= ~counter~0 1)} assume !!(#t~post6 < 100);havoc #t~post6; {19182#(<= ~counter~0 1)} is VALID [2022-04-28 14:07:26,766 INFO L272 TraceCheckUtils]: 14: Hoare triple {19182#(<= ~counter~0 1)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {19182#(<= ~counter~0 1)} is VALID [2022-04-28 14:07:26,767 INFO L290 TraceCheckUtils]: 15: Hoare triple {19182#(<= ~counter~0 1)} ~cond := #in~cond; {19182#(<= ~counter~0 1)} is VALID [2022-04-28 14:07:26,767 INFO L290 TraceCheckUtils]: 16: Hoare triple {19182#(<= ~counter~0 1)} assume !(0 == ~cond); {19182#(<= ~counter~0 1)} is VALID [2022-04-28 14:07:26,767 INFO L290 TraceCheckUtils]: 17: Hoare triple {19182#(<= ~counter~0 1)} assume true; {19182#(<= ~counter~0 1)} is VALID [2022-04-28 14:07:26,768 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {19182#(<= ~counter~0 1)} {19182#(<= ~counter~0 1)} #71#return; {19182#(<= ~counter~0 1)} is VALID [2022-04-28 14:07:26,768 INFO L290 TraceCheckUtils]: 19: Hoare triple {19182#(<= ~counter~0 1)} assume !!(0 != ~a~0 && 0 != ~b~0); {19182#(<= ~counter~0 1)} is VALID [2022-04-28 14:07:26,768 INFO L290 TraceCheckUtils]: 20: Hoare triple {19182#(<= ~counter~0 1)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {19182#(<= ~counter~0 1)} is VALID [2022-04-28 14:07:26,769 INFO L290 TraceCheckUtils]: 21: Hoare triple {19182#(<= ~counter~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {19210#(<= ~counter~0 2)} is VALID [2022-04-28 14:07:26,769 INFO L290 TraceCheckUtils]: 22: Hoare triple {19210#(<= ~counter~0 2)} assume !!(#t~post6 < 100);havoc #t~post6; {19210#(<= ~counter~0 2)} is VALID [2022-04-28 14:07:26,769 INFO L272 TraceCheckUtils]: 23: Hoare triple {19210#(<= ~counter~0 2)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {19210#(<= ~counter~0 2)} is VALID [2022-04-28 14:07:26,770 INFO L290 TraceCheckUtils]: 24: Hoare triple {19210#(<= ~counter~0 2)} ~cond := #in~cond; {19210#(<= ~counter~0 2)} is VALID [2022-04-28 14:07:26,770 INFO L290 TraceCheckUtils]: 25: Hoare triple {19210#(<= ~counter~0 2)} assume !(0 == ~cond); {19210#(<= ~counter~0 2)} is VALID [2022-04-28 14:07:26,770 INFO L290 TraceCheckUtils]: 26: Hoare triple {19210#(<= ~counter~0 2)} assume true; {19210#(<= ~counter~0 2)} is VALID [2022-04-28 14:07:26,771 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {19210#(<= ~counter~0 2)} {19210#(<= ~counter~0 2)} #71#return; {19210#(<= ~counter~0 2)} is VALID [2022-04-28 14:07:26,771 INFO L290 TraceCheckUtils]: 28: Hoare triple {19210#(<= ~counter~0 2)} assume !!(0 != ~a~0 && 0 != ~b~0); {19210#(<= ~counter~0 2)} is VALID [2022-04-28 14:07:26,771 INFO L290 TraceCheckUtils]: 29: Hoare triple {19210#(<= ~counter~0 2)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {19210#(<= ~counter~0 2)} is VALID [2022-04-28 14:07:26,772 INFO L290 TraceCheckUtils]: 30: Hoare triple {19210#(<= ~counter~0 2)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {19238#(<= ~counter~0 3)} is VALID [2022-04-28 14:07:26,772 INFO L290 TraceCheckUtils]: 31: Hoare triple {19238#(<= ~counter~0 3)} assume !!(#t~post6 < 100);havoc #t~post6; {19238#(<= ~counter~0 3)} is VALID [2022-04-28 14:07:26,773 INFO L272 TraceCheckUtils]: 32: Hoare triple {19238#(<= ~counter~0 3)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {19238#(<= ~counter~0 3)} is VALID [2022-04-28 14:07:26,773 INFO L290 TraceCheckUtils]: 33: Hoare triple {19238#(<= ~counter~0 3)} ~cond := #in~cond; {19238#(<= ~counter~0 3)} is VALID [2022-04-28 14:07:26,773 INFO L290 TraceCheckUtils]: 34: Hoare triple {19238#(<= ~counter~0 3)} assume !(0 == ~cond); {19238#(<= ~counter~0 3)} is VALID [2022-04-28 14:07:26,773 INFO L290 TraceCheckUtils]: 35: Hoare triple {19238#(<= ~counter~0 3)} assume true; {19238#(<= ~counter~0 3)} is VALID [2022-04-28 14:07:26,774 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {19238#(<= ~counter~0 3)} {19238#(<= ~counter~0 3)} #71#return; {19238#(<= ~counter~0 3)} is VALID [2022-04-28 14:07:26,774 INFO L290 TraceCheckUtils]: 37: Hoare triple {19238#(<= ~counter~0 3)} assume !!(0 != ~a~0 && 0 != ~b~0); {19238#(<= ~counter~0 3)} is VALID [2022-04-28 14:07:26,774 INFO L290 TraceCheckUtils]: 38: Hoare triple {19238#(<= ~counter~0 3)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {19238#(<= ~counter~0 3)} is VALID [2022-04-28 14:07:26,775 INFO L290 TraceCheckUtils]: 39: Hoare triple {19238#(<= ~counter~0 3)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {19266#(<= ~counter~0 4)} is VALID [2022-04-28 14:07:26,775 INFO L290 TraceCheckUtils]: 40: Hoare triple {19266#(<= ~counter~0 4)} assume !!(#t~post6 < 100);havoc #t~post6; {19266#(<= ~counter~0 4)} is VALID [2022-04-28 14:07:26,776 INFO L272 TraceCheckUtils]: 41: Hoare triple {19266#(<= ~counter~0 4)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {19266#(<= ~counter~0 4)} is VALID [2022-04-28 14:07:26,776 INFO L290 TraceCheckUtils]: 42: Hoare triple {19266#(<= ~counter~0 4)} ~cond := #in~cond; {19266#(<= ~counter~0 4)} is VALID [2022-04-28 14:07:26,776 INFO L290 TraceCheckUtils]: 43: Hoare triple {19266#(<= ~counter~0 4)} assume !(0 == ~cond); {19266#(<= ~counter~0 4)} is VALID [2022-04-28 14:07:26,776 INFO L290 TraceCheckUtils]: 44: Hoare triple {19266#(<= ~counter~0 4)} assume true; {19266#(<= ~counter~0 4)} is VALID [2022-04-28 14:07:26,777 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {19266#(<= ~counter~0 4)} {19266#(<= ~counter~0 4)} #71#return; {19266#(<= ~counter~0 4)} is VALID [2022-04-28 14:07:26,777 INFO L290 TraceCheckUtils]: 46: Hoare triple {19266#(<= ~counter~0 4)} assume !!(0 != ~a~0 && 0 != ~b~0); {19266#(<= ~counter~0 4)} is VALID [2022-04-28 14:07:26,778 INFO L290 TraceCheckUtils]: 47: Hoare triple {19266#(<= ~counter~0 4)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {19266#(<= ~counter~0 4)} is VALID [2022-04-28 14:07:26,778 INFO L290 TraceCheckUtils]: 48: Hoare triple {19266#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {19294#(<= ~counter~0 5)} is VALID [2022-04-28 14:07:26,778 INFO L290 TraceCheckUtils]: 49: Hoare triple {19294#(<= ~counter~0 5)} assume !!(#t~post6 < 100);havoc #t~post6; {19294#(<= ~counter~0 5)} is VALID [2022-04-28 14:07:26,779 INFO L272 TraceCheckUtils]: 50: Hoare triple {19294#(<= ~counter~0 5)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {19294#(<= ~counter~0 5)} is VALID [2022-04-28 14:07:26,779 INFO L290 TraceCheckUtils]: 51: Hoare triple {19294#(<= ~counter~0 5)} ~cond := #in~cond; {19294#(<= ~counter~0 5)} is VALID [2022-04-28 14:07:26,779 INFO L290 TraceCheckUtils]: 52: Hoare triple {19294#(<= ~counter~0 5)} assume !(0 == ~cond); {19294#(<= ~counter~0 5)} is VALID [2022-04-28 14:07:26,780 INFO L290 TraceCheckUtils]: 53: Hoare triple {19294#(<= ~counter~0 5)} assume true; {19294#(<= ~counter~0 5)} is VALID [2022-04-28 14:07:26,780 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {19294#(<= ~counter~0 5)} {19294#(<= ~counter~0 5)} #71#return; {19294#(<= ~counter~0 5)} is VALID [2022-04-28 14:07:26,780 INFO L290 TraceCheckUtils]: 55: Hoare triple {19294#(<= ~counter~0 5)} assume !!(0 != ~a~0 && 0 != ~b~0); {19294#(<= ~counter~0 5)} is VALID [2022-04-28 14:07:26,781 INFO L290 TraceCheckUtils]: 56: Hoare triple {19294#(<= ~counter~0 5)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {19294#(<= ~counter~0 5)} is VALID [2022-04-28 14:07:26,781 INFO L290 TraceCheckUtils]: 57: Hoare triple {19294#(<= ~counter~0 5)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {19322#(<= ~counter~0 6)} is VALID [2022-04-28 14:07:26,781 INFO L290 TraceCheckUtils]: 58: Hoare triple {19322#(<= ~counter~0 6)} assume !!(#t~post6 < 100);havoc #t~post6; {19322#(<= ~counter~0 6)} is VALID [2022-04-28 14:07:26,782 INFO L272 TraceCheckUtils]: 59: Hoare triple {19322#(<= ~counter~0 6)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {19322#(<= ~counter~0 6)} is VALID [2022-04-28 14:07:26,782 INFO L290 TraceCheckUtils]: 60: Hoare triple {19322#(<= ~counter~0 6)} ~cond := #in~cond; {19322#(<= ~counter~0 6)} is VALID [2022-04-28 14:07:26,782 INFO L290 TraceCheckUtils]: 61: Hoare triple {19322#(<= ~counter~0 6)} assume !(0 == ~cond); {19322#(<= ~counter~0 6)} is VALID [2022-04-28 14:07:26,783 INFO L290 TraceCheckUtils]: 62: Hoare triple {19322#(<= ~counter~0 6)} assume true; {19322#(<= ~counter~0 6)} is VALID [2022-04-28 14:07:26,783 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {19322#(<= ~counter~0 6)} {19322#(<= ~counter~0 6)} #71#return; {19322#(<= ~counter~0 6)} is VALID [2022-04-28 14:07:26,784 INFO L290 TraceCheckUtils]: 64: Hoare triple {19322#(<= ~counter~0 6)} assume !!(0 != ~a~0 && 0 != ~b~0); {19322#(<= ~counter~0 6)} is VALID [2022-04-28 14:07:26,784 INFO L290 TraceCheckUtils]: 65: Hoare triple {19322#(<= ~counter~0 6)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {19322#(<= ~counter~0 6)} is VALID [2022-04-28 14:07:26,784 INFO L290 TraceCheckUtils]: 66: Hoare triple {19322#(<= ~counter~0 6)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {19350#(<= ~counter~0 7)} is VALID [2022-04-28 14:07:26,785 INFO L290 TraceCheckUtils]: 67: Hoare triple {19350#(<= ~counter~0 7)} assume !!(#t~post6 < 100);havoc #t~post6; {19350#(<= ~counter~0 7)} is VALID [2022-04-28 14:07:26,785 INFO L272 TraceCheckUtils]: 68: Hoare triple {19350#(<= ~counter~0 7)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {19350#(<= ~counter~0 7)} is VALID [2022-04-28 14:07:26,785 INFO L290 TraceCheckUtils]: 69: Hoare triple {19350#(<= ~counter~0 7)} ~cond := #in~cond; {19350#(<= ~counter~0 7)} is VALID [2022-04-28 14:07:26,786 INFO L290 TraceCheckUtils]: 70: Hoare triple {19350#(<= ~counter~0 7)} assume !(0 == ~cond); {19350#(<= ~counter~0 7)} is VALID [2022-04-28 14:07:26,786 INFO L290 TraceCheckUtils]: 71: Hoare triple {19350#(<= ~counter~0 7)} assume true; {19350#(<= ~counter~0 7)} is VALID [2022-04-28 14:07:26,786 INFO L284 TraceCheckUtils]: 72: Hoare quadruple {19350#(<= ~counter~0 7)} {19350#(<= ~counter~0 7)} #71#return; {19350#(<= ~counter~0 7)} is VALID [2022-04-28 14:07:26,787 INFO L290 TraceCheckUtils]: 73: Hoare triple {19350#(<= ~counter~0 7)} assume !!(0 != ~a~0 && 0 != ~b~0); {19350#(<= ~counter~0 7)} is VALID [2022-04-28 14:07:26,787 INFO L290 TraceCheckUtils]: 74: Hoare triple {19350#(<= ~counter~0 7)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {19350#(<= ~counter~0 7)} is VALID [2022-04-28 14:07:26,787 INFO L290 TraceCheckUtils]: 75: Hoare triple {19350#(<= ~counter~0 7)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {19378#(<= ~counter~0 8)} is VALID [2022-04-28 14:07:26,788 INFO L290 TraceCheckUtils]: 76: Hoare triple {19378#(<= ~counter~0 8)} assume !!(#t~post6 < 100);havoc #t~post6; {19378#(<= ~counter~0 8)} is VALID [2022-04-28 14:07:26,788 INFO L272 TraceCheckUtils]: 77: Hoare triple {19378#(<= ~counter~0 8)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {19378#(<= ~counter~0 8)} is VALID [2022-04-28 14:07:26,788 INFO L290 TraceCheckUtils]: 78: Hoare triple {19378#(<= ~counter~0 8)} ~cond := #in~cond; {19378#(<= ~counter~0 8)} is VALID [2022-04-28 14:07:26,789 INFO L290 TraceCheckUtils]: 79: Hoare triple {19378#(<= ~counter~0 8)} assume !(0 == ~cond); {19378#(<= ~counter~0 8)} is VALID [2022-04-28 14:07:26,789 INFO L290 TraceCheckUtils]: 80: Hoare triple {19378#(<= ~counter~0 8)} assume true; {19378#(<= ~counter~0 8)} is VALID [2022-04-28 14:07:26,790 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {19378#(<= ~counter~0 8)} {19378#(<= ~counter~0 8)} #71#return; {19378#(<= ~counter~0 8)} is VALID [2022-04-28 14:07:26,790 INFO L290 TraceCheckUtils]: 82: Hoare triple {19378#(<= ~counter~0 8)} assume !!(0 != ~a~0 && 0 != ~b~0); {19378#(<= ~counter~0 8)} is VALID [2022-04-28 14:07:26,790 INFO L290 TraceCheckUtils]: 83: Hoare triple {19378#(<= ~counter~0 8)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {19378#(<= ~counter~0 8)} is VALID [2022-04-28 14:07:26,791 INFO L290 TraceCheckUtils]: 84: Hoare triple {19378#(<= ~counter~0 8)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {19406#(<= ~counter~0 9)} is VALID [2022-04-28 14:07:26,791 INFO L290 TraceCheckUtils]: 85: Hoare triple {19406#(<= ~counter~0 9)} assume !!(#t~post6 < 100);havoc #t~post6; {19406#(<= ~counter~0 9)} is VALID [2022-04-28 14:07:26,791 INFO L272 TraceCheckUtils]: 86: Hoare triple {19406#(<= ~counter~0 9)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {19406#(<= ~counter~0 9)} is VALID [2022-04-28 14:07:26,792 INFO L290 TraceCheckUtils]: 87: Hoare triple {19406#(<= ~counter~0 9)} ~cond := #in~cond; {19406#(<= ~counter~0 9)} is VALID [2022-04-28 14:07:26,792 INFO L290 TraceCheckUtils]: 88: Hoare triple {19406#(<= ~counter~0 9)} assume !(0 == ~cond); {19406#(<= ~counter~0 9)} is VALID [2022-04-28 14:07:26,792 INFO L290 TraceCheckUtils]: 89: Hoare triple {19406#(<= ~counter~0 9)} assume true; {19406#(<= ~counter~0 9)} is VALID [2022-04-28 14:07:26,793 INFO L284 TraceCheckUtils]: 90: Hoare quadruple {19406#(<= ~counter~0 9)} {19406#(<= ~counter~0 9)} #71#return; {19406#(<= ~counter~0 9)} is VALID [2022-04-28 14:07:26,793 INFO L290 TraceCheckUtils]: 91: Hoare triple {19406#(<= ~counter~0 9)} assume !!(0 != ~a~0 && 0 != ~b~0); {19406#(<= ~counter~0 9)} is VALID [2022-04-28 14:07:26,793 INFO L290 TraceCheckUtils]: 92: Hoare triple {19406#(<= ~counter~0 9)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {19406#(<= ~counter~0 9)} is VALID [2022-04-28 14:07:26,794 INFO L290 TraceCheckUtils]: 93: Hoare triple {19406#(<= ~counter~0 9)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {19434#(<= ~counter~0 10)} is VALID [2022-04-28 14:07:26,794 INFO L290 TraceCheckUtils]: 94: Hoare triple {19434#(<= ~counter~0 10)} assume !!(#t~post6 < 100);havoc #t~post6; {19434#(<= ~counter~0 10)} is VALID [2022-04-28 14:07:26,794 INFO L272 TraceCheckUtils]: 95: Hoare triple {19434#(<= ~counter~0 10)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {19434#(<= ~counter~0 10)} is VALID [2022-04-28 14:07:26,795 INFO L290 TraceCheckUtils]: 96: Hoare triple {19434#(<= ~counter~0 10)} ~cond := #in~cond; {19434#(<= ~counter~0 10)} is VALID [2022-04-28 14:07:26,795 INFO L290 TraceCheckUtils]: 97: Hoare triple {19434#(<= ~counter~0 10)} assume !(0 == ~cond); {19434#(<= ~counter~0 10)} is VALID [2022-04-28 14:07:26,795 INFO L290 TraceCheckUtils]: 98: Hoare triple {19434#(<= ~counter~0 10)} assume true; {19434#(<= ~counter~0 10)} is VALID [2022-04-28 14:07:26,796 INFO L284 TraceCheckUtils]: 99: Hoare quadruple {19434#(<= ~counter~0 10)} {19434#(<= ~counter~0 10)} #71#return; {19434#(<= ~counter~0 10)} is VALID [2022-04-28 14:07:26,796 INFO L290 TraceCheckUtils]: 100: Hoare triple {19434#(<= ~counter~0 10)} assume !!(0 != ~a~0 && 0 != ~b~0); {19434#(<= ~counter~0 10)} is VALID [2022-04-28 14:07:26,796 INFO L290 TraceCheckUtils]: 101: Hoare triple {19434#(<= ~counter~0 10)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {19434#(<= ~counter~0 10)} is VALID [2022-04-28 14:07:26,797 INFO L290 TraceCheckUtils]: 102: Hoare triple {19434#(<= ~counter~0 10)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {19462#(<= ~counter~0 11)} is VALID [2022-04-28 14:07:26,797 INFO L290 TraceCheckUtils]: 103: Hoare triple {19462#(<= ~counter~0 11)} assume !!(#t~post6 < 100);havoc #t~post6; {19462#(<= ~counter~0 11)} is VALID [2022-04-28 14:07:26,798 INFO L272 TraceCheckUtils]: 104: Hoare triple {19462#(<= ~counter~0 11)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {19462#(<= ~counter~0 11)} is VALID [2022-04-28 14:07:26,798 INFO L290 TraceCheckUtils]: 105: Hoare triple {19462#(<= ~counter~0 11)} ~cond := #in~cond; {19462#(<= ~counter~0 11)} is VALID [2022-04-28 14:07:26,798 INFO L290 TraceCheckUtils]: 106: Hoare triple {19462#(<= ~counter~0 11)} assume !(0 == ~cond); {19462#(<= ~counter~0 11)} is VALID [2022-04-28 14:07:26,798 INFO L290 TraceCheckUtils]: 107: Hoare triple {19462#(<= ~counter~0 11)} assume true; {19462#(<= ~counter~0 11)} is VALID [2022-04-28 14:07:26,799 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {19462#(<= ~counter~0 11)} {19462#(<= ~counter~0 11)} #71#return; {19462#(<= ~counter~0 11)} is VALID [2022-04-28 14:07:26,799 INFO L290 TraceCheckUtils]: 109: Hoare triple {19462#(<= ~counter~0 11)} assume !!(0 != ~a~0 && 0 != ~b~0); {19462#(<= ~counter~0 11)} is VALID [2022-04-28 14:07:26,800 INFO L290 TraceCheckUtils]: 110: Hoare triple {19462#(<= ~counter~0 11)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {19462#(<= ~counter~0 11)} is VALID [2022-04-28 14:07:26,800 INFO L290 TraceCheckUtils]: 111: Hoare triple {19462#(<= ~counter~0 11)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {19490#(<= |main_#t~post6| 11)} is VALID [2022-04-28 14:07:26,800 INFO L290 TraceCheckUtils]: 112: Hoare triple {19490#(<= |main_#t~post6| 11)} assume !(#t~post6 < 100);havoc #t~post6; {19141#false} is VALID [2022-04-28 14:07:26,800 INFO L272 TraceCheckUtils]: 113: Hoare triple {19141#false} call __VERIFIER_assert((if ~q~0 == ~x~0 * ~y~0 then 1 else 0)); {19141#false} is VALID [2022-04-28 14:07:26,800 INFO L290 TraceCheckUtils]: 114: Hoare triple {19141#false} ~cond := #in~cond; {19141#false} is VALID [2022-04-28 14:07:26,800 INFO L290 TraceCheckUtils]: 115: Hoare triple {19141#false} assume 0 == ~cond; {19141#false} is VALID [2022-04-28 14:07:26,800 INFO L290 TraceCheckUtils]: 116: Hoare triple {19141#false} assume !false; {19141#false} is VALID [2022-04-28 14:07:26,801 INFO L134 CoverageAnalysis]: Checked inductivity of 539 backedges. 22 proven. 517 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 14:07:26,801 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 14:07:27,486 INFO L290 TraceCheckUtils]: 116: Hoare triple {19141#false} assume !false; {19141#false} is VALID [2022-04-28 14:07:27,486 INFO L290 TraceCheckUtils]: 115: Hoare triple {19141#false} assume 0 == ~cond; {19141#false} is VALID [2022-04-28 14:07:27,486 INFO L290 TraceCheckUtils]: 114: Hoare triple {19141#false} ~cond := #in~cond; {19141#false} is VALID [2022-04-28 14:07:27,486 INFO L272 TraceCheckUtils]: 113: Hoare triple {19141#false} call __VERIFIER_assert((if ~q~0 == ~x~0 * ~y~0 then 1 else 0)); {19141#false} is VALID [2022-04-28 14:07:27,486 INFO L290 TraceCheckUtils]: 112: Hoare triple {19518#(< |main_#t~post6| 100)} assume !(#t~post6 < 100);havoc #t~post6; {19141#false} is VALID [2022-04-28 14:07:27,487 INFO L290 TraceCheckUtils]: 111: Hoare triple {19522#(< ~counter~0 100)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {19518#(< |main_#t~post6| 100)} is VALID [2022-04-28 14:07:27,487 INFO L290 TraceCheckUtils]: 110: Hoare triple {19522#(< ~counter~0 100)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {19522#(< ~counter~0 100)} is VALID [2022-04-28 14:07:27,487 INFO L290 TraceCheckUtils]: 109: Hoare triple {19522#(< ~counter~0 100)} assume !!(0 != ~a~0 && 0 != ~b~0); {19522#(< ~counter~0 100)} is VALID [2022-04-28 14:07:27,488 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {19140#true} {19522#(< ~counter~0 100)} #71#return; {19522#(< ~counter~0 100)} is VALID [2022-04-28 14:07:27,488 INFO L290 TraceCheckUtils]: 107: Hoare triple {19140#true} assume true; {19140#true} is VALID [2022-04-28 14:07:27,488 INFO L290 TraceCheckUtils]: 106: Hoare triple {19140#true} assume !(0 == ~cond); {19140#true} is VALID [2022-04-28 14:07:27,488 INFO L290 TraceCheckUtils]: 105: Hoare triple {19140#true} ~cond := #in~cond; {19140#true} is VALID [2022-04-28 14:07:27,488 INFO L272 TraceCheckUtils]: 104: Hoare triple {19522#(< ~counter~0 100)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {19140#true} is VALID [2022-04-28 14:07:27,488 INFO L290 TraceCheckUtils]: 103: Hoare triple {19522#(< ~counter~0 100)} assume !!(#t~post6 < 100);havoc #t~post6; {19522#(< ~counter~0 100)} is VALID [2022-04-28 14:07:27,489 INFO L290 TraceCheckUtils]: 102: Hoare triple {19550#(< ~counter~0 99)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {19522#(< ~counter~0 100)} is VALID [2022-04-28 14:07:27,490 INFO L290 TraceCheckUtils]: 101: Hoare triple {19550#(< ~counter~0 99)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {19550#(< ~counter~0 99)} is VALID [2022-04-28 14:07:27,490 INFO L290 TraceCheckUtils]: 100: Hoare triple {19550#(< ~counter~0 99)} assume !!(0 != ~a~0 && 0 != ~b~0); {19550#(< ~counter~0 99)} is VALID [2022-04-28 14:07:27,491 INFO L284 TraceCheckUtils]: 99: Hoare quadruple {19140#true} {19550#(< ~counter~0 99)} #71#return; {19550#(< ~counter~0 99)} is VALID [2022-04-28 14:07:27,491 INFO L290 TraceCheckUtils]: 98: Hoare triple {19140#true} assume true; {19140#true} is VALID [2022-04-28 14:07:27,491 INFO L290 TraceCheckUtils]: 97: Hoare triple {19140#true} assume !(0 == ~cond); {19140#true} is VALID [2022-04-28 14:07:27,491 INFO L290 TraceCheckUtils]: 96: Hoare triple {19140#true} ~cond := #in~cond; {19140#true} is VALID [2022-04-28 14:07:27,491 INFO L272 TraceCheckUtils]: 95: Hoare triple {19550#(< ~counter~0 99)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {19140#true} is VALID [2022-04-28 14:07:27,491 INFO L290 TraceCheckUtils]: 94: Hoare triple {19550#(< ~counter~0 99)} assume !!(#t~post6 < 100);havoc #t~post6; {19550#(< ~counter~0 99)} is VALID [2022-04-28 14:07:27,492 INFO L290 TraceCheckUtils]: 93: Hoare triple {19578#(< ~counter~0 98)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {19550#(< ~counter~0 99)} is VALID [2022-04-28 14:07:27,492 INFO L290 TraceCheckUtils]: 92: Hoare triple {19578#(< ~counter~0 98)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {19578#(< ~counter~0 98)} is VALID [2022-04-28 14:07:27,492 INFO L290 TraceCheckUtils]: 91: Hoare triple {19578#(< ~counter~0 98)} assume !!(0 != ~a~0 && 0 != ~b~0); {19578#(< ~counter~0 98)} is VALID [2022-04-28 14:07:27,493 INFO L284 TraceCheckUtils]: 90: Hoare quadruple {19140#true} {19578#(< ~counter~0 98)} #71#return; {19578#(< ~counter~0 98)} is VALID [2022-04-28 14:07:27,493 INFO L290 TraceCheckUtils]: 89: Hoare triple {19140#true} assume true; {19140#true} is VALID [2022-04-28 14:07:27,493 INFO L290 TraceCheckUtils]: 88: Hoare triple {19140#true} assume !(0 == ~cond); {19140#true} is VALID [2022-04-28 14:07:27,493 INFO L290 TraceCheckUtils]: 87: Hoare triple {19140#true} ~cond := #in~cond; {19140#true} is VALID [2022-04-28 14:07:27,493 INFO L272 TraceCheckUtils]: 86: Hoare triple {19578#(< ~counter~0 98)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {19140#true} is VALID [2022-04-28 14:07:27,493 INFO L290 TraceCheckUtils]: 85: Hoare triple {19578#(< ~counter~0 98)} assume !!(#t~post6 < 100);havoc #t~post6; {19578#(< ~counter~0 98)} is VALID [2022-04-28 14:07:27,494 INFO L290 TraceCheckUtils]: 84: Hoare triple {19606#(< ~counter~0 97)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {19578#(< ~counter~0 98)} is VALID [2022-04-28 14:07:27,494 INFO L290 TraceCheckUtils]: 83: Hoare triple {19606#(< ~counter~0 97)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {19606#(< ~counter~0 97)} is VALID [2022-04-28 14:07:27,494 INFO L290 TraceCheckUtils]: 82: Hoare triple {19606#(< ~counter~0 97)} assume !!(0 != ~a~0 && 0 != ~b~0); {19606#(< ~counter~0 97)} is VALID [2022-04-28 14:07:27,495 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {19140#true} {19606#(< ~counter~0 97)} #71#return; {19606#(< ~counter~0 97)} is VALID [2022-04-28 14:07:27,495 INFO L290 TraceCheckUtils]: 80: Hoare triple {19140#true} assume true; {19140#true} is VALID [2022-04-28 14:07:27,495 INFO L290 TraceCheckUtils]: 79: Hoare triple {19140#true} assume !(0 == ~cond); {19140#true} is VALID [2022-04-28 14:07:27,495 INFO L290 TraceCheckUtils]: 78: Hoare triple {19140#true} ~cond := #in~cond; {19140#true} is VALID [2022-04-28 14:07:27,495 INFO L272 TraceCheckUtils]: 77: Hoare triple {19606#(< ~counter~0 97)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {19140#true} is VALID [2022-04-28 14:07:27,495 INFO L290 TraceCheckUtils]: 76: Hoare triple {19606#(< ~counter~0 97)} assume !!(#t~post6 < 100);havoc #t~post6; {19606#(< ~counter~0 97)} is VALID [2022-04-28 14:07:27,496 INFO L290 TraceCheckUtils]: 75: Hoare triple {19634#(< ~counter~0 96)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {19606#(< ~counter~0 97)} is VALID [2022-04-28 14:07:27,496 INFO L290 TraceCheckUtils]: 74: Hoare triple {19634#(< ~counter~0 96)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {19634#(< ~counter~0 96)} is VALID [2022-04-28 14:07:27,496 INFO L290 TraceCheckUtils]: 73: Hoare triple {19634#(< ~counter~0 96)} assume !!(0 != ~a~0 && 0 != ~b~0); {19634#(< ~counter~0 96)} is VALID [2022-04-28 14:07:27,497 INFO L284 TraceCheckUtils]: 72: Hoare quadruple {19140#true} {19634#(< ~counter~0 96)} #71#return; {19634#(< ~counter~0 96)} is VALID [2022-04-28 14:07:27,497 INFO L290 TraceCheckUtils]: 71: Hoare triple {19140#true} assume true; {19140#true} is VALID [2022-04-28 14:07:27,497 INFO L290 TraceCheckUtils]: 70: Hoare triple {19140#true} assume !(0 == ~cond); {19140#true} is VALID [2022-04-28 14:07:27,497 INFO L290 TraceCheckUtils]: 69: Hoare triple {19140#true} ~cond := #in~cond; {19140#true} is VALID [2022-04-28 14:07:27,497 INFO L272 TraceCheckUtils]: 68: Hoare triple {19634#(< ~counter~0 96)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {19140#true} is VALID [2022-04-28 14:07:27,497 INFO L290 TraceCheckUtils]: 67: Hoare triple {19634#(< ~counter~0 96)} assume !!(#t~post6 < 100);havoc #t~post6; {19634#(< ~counter~0 96)} is VALID [2022-04-28 14:07:27,498 INFO L290 TraceCheckUtils]: 66: Hoare triple {19662#(< ~counter~0 95)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {19634#(< ~counter~0 96)} is VALID [2022-04-28 14:07:27,498 INFO L290 TraceCheckUtils]: 65: Hoare triple {19662#(< ~counter~0 95)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {19662#(< ~counter~0 95)} is VALID [2022-04-28 14:07:27,498 INFO L290 TraceCheckUtils]: 64: Hoare triple {19662#(< ~counter~0 95)} assume !!(0 != ~a~0 && 0 != ~b~0); {19662#(< ~counter~0 95)} is VALID [2022-04-28 14:07:27,499 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {19140#true} {19662#(< ~counter~0 95)} #71#return; {19662#(< ~counter~0 95)} is VALID [2022-04-28 14:07:27,499 INFO L290 TraceCheckUtils]: 62: Hoare triple {19140#true} assume true; {19140#true} is VALID [2022-04-28 14:07:27,499 INFO L290 TraceCheckUtils]: 61: Hoare triple {19140#true} assume !(0 == ~cond); {19140#true} is VALID [2022-04-28 14:07:27,499 INFO L290 TraceCheckUtils]: 60: Hoare triple {19140#true} ~cond := #in~cond; {19140#true} is VALID [2022-04-28 14:07:27,499 INFO L272 TraceCheckUtils]: 59: Hoare triple {19662#(< ~counter~0 95)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {19140#true} is VALID [2022-04-28 14:07:27,499 INFO L290 TraceCheckUtils]: 58: Hoare triple {19662#(< ~counter~0 95)} assume !!(#t~post6 < 100);havoc #t~post6; {19662#(< ~counter~0 95)} is VALID [2022-04-28 14:07:27,500 INFO L290 TraceCheckUtils]: 57: Hoare triple {19690#(< ~counter~0 94)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {19662#(< ~counter~0 95)} is VALID [2022-04-28 14:07:27,500 INFO L290 TraceCheckUtils]: 56: Hoare triple {19690#(< ~counter~0 94)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {19690#(< ~counter~0 94)} is VALID [2022-04-28 14:07:27,500 INFO L290 TraceCheckUtils]: 55: Hoare triple {19690#(< ~counter~0 94)} assume !!(0 != ~a~0 && 0 != ~b~0); {19690#(< ~counter~0 94)} is VALID [2022-04-28 14:07:27,501 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {19140#true} {19690#(< ~counter~0 94)} #71#return; {19690#(< ~counter~0 94)} is VALID [2022-04-28 14:07:27,501 INFO L290 TraceCheckUtils]: 53: Hoare triple {19140#true} assume true; {19140#true} is VALID [2022-04-28 14:07:27,501 INFO L290 TraceCheckUtils]: 52: Hoare triple {19140#true} assume !(0 == ~cond); {19140#true} is VALID [2022-04-28 14:07:27,501 INFO L290 TraceCheckUtils]: 51: Hoare triple {19140#true} ~cond := #in~cond; {19140#true} is VALID [2022-04-28 14:07:27,501 INFO L272 TraceCheckUtils]: 50: Hoare triple {19690#(< ~counter~0 94)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {19140#true} is VALID [2022-04-28 14:07:27,501 INFO L290 TraceCheckUtils]: 49: Hoare triple {19690#(< ~counter~0 94)} assume !!(#t~post6 < 100);havoc #t~post6; {19690#(< ~counter~0 94)} is VALID [2022-04-28 14:07:27,502 INFO L290 TraceCheckUtils]: 48: Hoare triple {19718#(< ~counter~0 93)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {19690#(< ~counter~0 94)} is VALID [2022-04-28 14:07:27,502 INFO L290 TraceCheckUtils]: 47: Hoare triple {19718#(< ~counter~0 93)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {19718#(< ~counter~0 93)} is VALID [2022-04-28 14:07:27,502 INFO L290 TraceCheckUtils]: 46: Hoare triple {19718#(< ~counter~0 93)} assume !!(0 != ~a~0 && 0 != ~b~0); {19718#(< ~counter~0 93)} is VALID [2022-04-28 14:07:27,503 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {19140#true} {19718#(< ~counter~0 93)} #71#return; {19718#(< ~counter~0 93)} is VALID [2022-04-28 14:07:27,503 INFO L290 TraceCheckUtils]: 44: Hoare triple {19140#true} assume true; {19140#true} is VALID [2022-04-28 14:07:27,503 INFO L290 TraceCheckUtils]: 43: Hoare triple {19140#true} assume !(0 == ~cond); {19140#true} is VALID [2022-04-28 14:07:27,503 INFO L290 TraceCheckUtils]: 42: Hoare triple {19140#true} ~cond := #in~cond; {19140#true} is VALID [2022-04-28 14:07:27,503 INFO L272 TraceCheckUtils]: 41: Hoare triple {19718#(< ~counter~0 93)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {19140#true} is VALID [2022-04-28 14:07:27,503 INFO L290 TraceCheckUtils]: 40: Hoare triple {19718#(< ~counter~0 93)} assume !!(#t~post6 < 100);havoc #t~post6; {19718#(< ~counter~0 93)} is VALID [2022-04-28 14:07:27,504 INFO L290 TraceCheckUtils]: 39: Hoare triple {19746#(< ~counter~0 92)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {19718#(< ~counter~0 93)} is VALID [2022-04-28 14:07:27,504 INFO L290 TraceCheckUtils]: 38: Hoare triple {19746#(< ~counter~0 92)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {19746#(< ~counter~0 92)} is VALID [2022-04-28 14:07:27,504 INFO L290 TraceCheckUtils]: 37: Hoare triple {19746#(< ~counter~0 92)} assume !!(0 != ~a~0 && 0 != ~b~0); {19746#(< ~counter~0 92)} is VALID [2022-04-28 14:07:27,505 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {19140#true} {19746#(< ~counter~0 92)} #71#return; {19746#(< ~counter~0 92)} is VALID [2022-04-28 14:07:27,505 INFO L290 TraceCheckUtils]: 35: Hoare triple {19140#true} assume true; {19140#true} is VALID [2022-04-28 14:07:27,505 INFO L290 TraceCheckUtils]: 34: Hoare triple {19140#true} assume !(0 == ~cond); {19140#true} is VALID [2022-04-28 14:07:27,505 INFO L290 TraceCheckUtils]: 33: Hoare triple {19140#true} ~cond := #in~cond; {19140#true} is VALID [2022-04-28 14:07:27,505 INFO L272 TraceCheckUtils]: 32: Hoare triple {19746#(< ~counter~0 92)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {19140#true} is VALID [2022-04-28 14:07:27,505 INFO L290 TraceCheckUtils]: 31: Hoare triple {19746#(< ~counter~0 92)} assume !!(#t~post6 < 100);havoc #t~post6; {19746#(< ~counter~0 92)} is VALID [2022-04-28 14:07:27,506 INFO L290 TraceCheckUtils]: 30: Hoare triple {19774#(< ~counter~0 91)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {19746#(< ~counter~0 92)} is VALID [2022-04-28 14:07:27,506 INFO L290 TraceCheckUtils]: 29: Hoare triple {19774#(< ~counter~0 91)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {19774#(< ~counter~0 91)} is VALID [2022-04-28 14:07:27,506 INFO L290 TraceCheckUtils]: 28: Hoare triple {19774#(< ~counter~0 91)} assume !!(0 != ~a~0 && 0 != ~b~0); {19774#(< ~counter~0 91)} is VALID [2022-04-28 14:07:27,507 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {19140#true} {19774#(< ~counter~0 91)} #71#return; {19774#(< ~counter~0 91)} is VALID [2022-04-28 14:07:27,507 INFO L290 TraceCheckUtils]: 26: Hoare triple {19140#true} assume true; {19140#true} is VALID [2022-04-28 14:07:27,507 INFO L290 TraceCheckUtils]: 25: Hoare triple {19140#true} assume !(0 == ~cond); {19140#true} is VALID [2022-04-28 14:07:27,507 INFO L290 TraceCheckUtils]: 24: Hoare triple {19140#true} ~cond := #in~cond; {19140#true} is VALID [2022-04-28 14:07:27,507 INFO L272 TraceCheckUtils]: 23: Hoare triple {19774#(< ~counter~0 91)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {19140#true} is VALID [2022-04-28 14:07:27,507 INFO L290 TraceCheckUtils]: 22: Hoare triple {19774#(< ~counter~0 91)} assume !!(#t~post6 < 100);havoc #t~post6; {19774#(< ~counter~0 91)} is VALID [2022-04-28 14:07:27,508 INFO L290 TraceCheckUtils]: 21: Hoare triple {19802#(< ~counter~0 90)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {19774#(< ~counter~0 91)} is VALID [2022-04-28 14:07:27,508 INFO L290 TraceCheckUtils]: 20: Hoare triple {19802#(< ~counter~0 90)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {19802#(< ~counter~0 90)} is VALID [2022-04-28 14:07:27,508 INFO L290 TraceCheckUtils]: 19: Hoare triple {19802#(< ~counter~0 90)} assume !!(0 != ~a~0 && 0 != ~b~0); {19802#(< ~counter~0 90)} is VALID [2022-04-28 14:07:27,509 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {19140#true} {19802#(< ~counter~0 90)} #71#return; {19802#(< ~counter~0 90)} is VALID [2022-04-28 14:07:27,509 INFO L290 TraceCheckUtils]: 17: Hoare triple {19140#true} assume true; {19140#true} is VALID [2022-04-28 14:07:27,509 INFO L290 TraceCheckUtils]: 16: Hoare triple {19140#true} assume !(0 == ~cond); {19140#true} is VALID [2022-04-28 14:07:27,509 INFO L290 TraceCheckUtils]: 15: Hoare triple {19140#true} ~cond := #in~cond; {19140#true} is VALID [2022-04-28 14:07:27,509 INFO L272 TraceCheckUtils]: 14: Hoare triple {19802#(< ~counter~0 90)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {19140#true} is VALID [2022-04-28 14:07:27,509 INFO L290 TraceCheckUtils]: 13: Hoare triple {19802#(< ~counter~0 90)} assume !!(#t~post6 < 100);havoc #t~post6; {19802#(< ~counter~0 90)} is VALID [2022-04-28 14:07:27,510 INFO L290 TraceCheckUtils]: 12: Hoare triple {19830#(< ~counter~0 89)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {19802#(< ~counter~0 90)} is VALID [2022-04-28 14:07:27,510 INFO L290 TraceCheckUtils]: 11: Hoare triple {19830#(< ~counter~0 89)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {19830#(< ~counter~0 89)} is VALID [2022-04-28 14:07:27,510 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {19140#true} {19830#(< ~counter~0 89)} #69#return; {19830#(< ~counter~0 89)} is VALID [2022-04-28 14:07:27,510 INFO L290 TraceCheckUtils]: 9: Hoare triple {19140#true} assume true; {19140#true} is VALID [2022-04-28 14:07:27,511 INFO L290 TraceCheckUtils]: 8: Hoare triple {19140#true} assume !(0 == ~cond); {19140#true} is VALID [2022-04-28 14:07:27,511 INFO L290 TraceCheckUtils]: 7: Hoare triple {19140#true} ~cond := #in~cond; {19140#true} is VALID [2022-04-28 14:07:27,511 INFO L272 TraceCheckUtils]: 6: Hoare triple {19830#(< ~counter~0 89)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {19140#true} is VALID [2022-04-28 14:07:27,511 INFO L290 TraceCheckUtils]: 5: Hoare triple {19830#(< ~counter~0 89)} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {19830#(< ~counter~0 89)} is VALID [2022-04-28 14:07:27,511 INFO L272 TraceCheckUtils]: 4: Hoare triple {19830#(< ~counter~0 89)} call #t~ret7 := main(); {19830#(< ~counter~0 89)} is VALID [2022-04-28 14:07:27,511 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19830#(< ~counter~0 89)} {19140#true} #77#return; {19830#(< ~counter~0 89)} is VALID [2022-04-28 14:07:27,512 INFO L290 TraceCheckUtils]: 2: Hoare triple {19830#(< ~counter~0 89)} assume true; {19830#(< ~counter~0 89)} is VALID [2022-04-28 14:07:27,512 INFO L290 TraceCheckUtils]: 1: Hoare triple {19140#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(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {19830#(< ~counter~0 89)} is VALID [2022-04-28 14:07:27,512 INFO L272 TraceCheckUtils]: 0: Hoare triple {19140#true} call ULTIMATE.init(); {19140#true} is VALID [2022-04-28 14:07:27,513 INFO L134 CoverageAnalysis]: Checked inductivity of 539 backedges. 22 proven. 297 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2022-04-28 14:07:27,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:07:27,513 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2002864631] [2022-04-28 14:07:27,513 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 14:07:27,513 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [223536504] [2022-04-28 14:07:27,513 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [223536504] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 14:07:27,513 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 14:07:27,513 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 28 [2022-04-28 14:07:27,513 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:07:27,513 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1996505154] [2022-04-28 14:07:27,513 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1996505154] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:07:27,513 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:07:27,513 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-04-28 14:07:27,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1421896687] [2022-04-28 14:07:27,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:07:27,514 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 5.933333333333334) internal successors, (89), 14 states have internal predecessors, (89), 14 states have call successors, (15), 14 states have call predecessors, (15), 12 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) Word has length 117 [2022-04-28 14:07:27,514 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:07:27,514 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 15 states, 15 states have (on average 5.933333333333334) internal successors, (89), 14 states have internal predecessors, (89), 14 states have call successors, (15), 14 states have call predecessors, (15), 12 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-28 14:07:27,604 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 117 edges. 117 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:07:27,604 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-28 14:07:27,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:07:27,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-28 14:07:27,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=330, Invalid=426, Unknown=0, NotChecked=0, Total=756 [2022-04-28 14:07:27,605 INFO L87 Difference]: Start difference. First operand 153 states and 188 transitions. Second operand has 15 states, 15 states have (on average 5.933333333333334) internal successors, (89), 14 states have internal predecessors, (89), 14 states have call successors, (15), 14 states have call predecessors, (15), 12 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-28 14:07:28,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:07:28,362 INFO L93 Difference]: Finished difference Result 172 states and 211 transitions. [2022-04-28 14:07:28,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-04-28 14:07:28,362 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 5.933333333333334) internal successors, (89), 14 states have internal predecessors, (89), 14 states have call successors, (15), 14 states have call predecessors, (15), 12 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) Word has length 117 [2022-04-28 14:07:28,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:07:28,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 5.933333333333334) internal successors, (89), 14 states have internal predecessors, (89), 14 states have call successors, (15), 14 states have call predecessors, (15), 12 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-28 14:07:28,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 197 transitions. [2022-04-28 14:07:28,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 5.933333333333334) internal successors, (89), 14 states have internal predecessors, (89), 14 states have call successors, (15), 14 states have call predecessors, (15), 12 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-28 14:07:28,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 197 transitions. [2022-04-28 14:07:28,369 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 26 states and 197 transitions. [2022-04-28 14:07:28,537 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 197 edges. 197 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:07:28,539 INFO L225 Difference]: With dead ends: 172 [2022-04-28 14:07:28,539 INFO L226 Difference]: Without dead ends: 164 [2022-04-28 14:07:28,540 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 244 GetRequests, 207 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=627, Invalid=855, Unknown=0, NotChecked=0, Total=1482 [2022-04-28 14:07:28,540 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 127 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 226 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 14:07:28,540 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 226 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 14:07:28,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2022-04-28 14:07:28,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 164. [2022-04-28 14:07:28,816 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:07:28,816 INFO L82 GeneralOperation]: Start isEquivalent. First operand 164 states. Second operand has 164 states, 129 states have (on average 1.302325581395349) internal successors, (168), 130 states have internal predecessors, (168), 18 states have call successors, (18), 17 states have call predecessors, (18), 16 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-28 14:07:28,817 INFO L74 IsIncluded]: Start isIncluded. First operand 164 states. Second operand has 164 states, 129 states have (on average 1.302325581395349) internal successors, (168), 130 states have internal predecessors, (168), 18 states have call successors, (18), 17 states have call predecessors, (18), 16 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-28 14:07:28,817 INFO L87 Difference]: Start difference. First operand 164 states. Second operand has 164 states, 129 states have (on average 1.302325581395349) internal successors, (168), 130 states have internal predecessors, (168), 18 states have call successors, (18), 17 states have call predecessors, (18), 16 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-28 14:07:28,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:07:28,819 INFO L93 Difference]: Finished difference Result 164 states and 202 transitions. [2022-04-28 14:07:28,819 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 202 transitions. [2022-04-28 14:07:28,820 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:07:28,820 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:07:28,820 INFO L74 IsIncluded]: Start isIncluded. First operand has 164 states, 129 states have (on average 1.302325581395349) internal successors, (168), 130 states have internal predecessors, (168), 18 states have call successors, (18), 17 states have call predecessors, (18), 16 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand 164 states. [2022-04-28 14:07:28,820 INFO L87 Difference]: Start difference. First operand has 164 states, 129 states have (on average 1.302325581395349) internal successors, (168), 130 states have internal predecessors, (168), 18 states have call successors, (18), 17 states have call predecessors, (18), 16 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand 164 states. [2022-04-28 14:07:28,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:07:28,823 INFO L93 Difference]: Finished difference Result 164 states and 202 transitions. [2022-04-28 14:07:28,823 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 202 transitions. [2022-04-28 14:07:28,823 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:07:28,823 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:07:28,823 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:07:28,824 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:07:28,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 129 states have (on average 1.302325581395349) internal successors, (168), 130 states have internal predecessors, (168), 18 states have call successors, (18), 17 states have call predecessors, (18), 16 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-28 14:07:28,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 202 transitions. [2022-04-28 14:07:28,827 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 202 transitions. Word has length 117 [2022-04-28 14:07:28,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:07:28,827 INFO L495 AbstractCegarLoop]: Abstraction has 164 states and 202 transitions. [2022-04-28 14:07:28,827 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 5.933333333333334) internal successors, (89), 14 states have internal predecessors, (89), 14 states have call successors, (15), 14 states have call predecessors, (15), 12 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-28 14:07:28,827 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 164 states and 202 transitions. [2022-04-28 14:07:52,766 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 202 edges. 191 inductive. 0 not inductive. 11 times theorem prover too weak to decide inductivity. [2022-04-28 14:07:52,766 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 202 transitions. [2022-04-28 14:07:52,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2022-04-28 14:07:52,766 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:07:52,766 INFO L195 NwaCegarLoop]: trace histogram [13, 13, 12, 12, 12, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 14:07:52,783 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Ended with exit code 0 [2022-04-28 14:07:52,967 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2022-04-28 14:07:52,967 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:07:52,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:07:52,967 INFO L85 PathProgramCache]: Analyzing trace with hash -206022918, now seen corresponding path program 23 times [2022-04-28 14:07:52,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:07:52,967 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [229439272] [2022-04-28 14:07:59,020 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 14:07:59,020 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 14:07:59,020 INFO L85 PathProgramCache]: Analyzing trace with hash -206022918, now seen corresponding path program 24 times [2022-04-28 14:07:59,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:07:59,021 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2122258380] [2022-04-28 14:07:59,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:07:59,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:07:59,048 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 14:07:59,048 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [142656881] [2022-04-28 14:07:59,049 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 14:07:59,049 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 14:07:59,049 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 14:07:59,055 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 14:07:59,056 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2022-04-28 14:07:59,188 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2022-04-28 14:07:59,189 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 14:07:59,190 INFO L263 TraceCheckSpWp]: Trace formula consists of 398 conjuncts, 29 conjunts are in the unsatisfiable core [2022-04-28 14:07:59,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:07:59,214 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 14:07:59,810 INFO L272 TraceCheckUtils]: 0: Hoare triple {20891#true} call ULTIMATE.init(); {20891#true} is VALID [2022-04-28 14:07:59,811 INFO L290 TraceCheckUtils]: 1: Hoare triple {20891#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(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {20899#(<= ~counter~0 0)} is VALID [2022-04-28 14:07:59,811 INFO L290 TraceCheckUtils]: 2: Hoare triple {20899#(<= ~counter~0 0)} assume true; {20899#(<= ~counter~0 0)} is VALID [2022-04-28 14:07:59,811 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20899#(<= ~counter~0 0)} {20891#true} #77#return; {20899#(<= ~counter~0 0)} is VALID [2022-04-28 14:07:59,812 INFO L272 TraceCheckUtils]: 4: Hoare triple {20899#(<= ~counter~0 0)} call #t~ret7 := main(); {20899#(<= ~counter~0 0)} is VALID [2022-04-28 14:07:59,812 INFO L290 TraceCheckUtils]: 5: Hoare triple {20899#(<= ~counter~0 0)} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {20899#(<= ~counter~0 0)} is VALID [2022-04-28 14:07:59,812 INFO L272 TraceCheckUtils]: 6: Hoare triple {20899#(<= ~counter~0 0)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {20899#(<= ~counter~0 0)} is VALID [2022-04-28 14:07:59,812 INFO L290 TraceCheckUtils]: 7: Hoare triple {20899#(<= ~counter~0 0)} ~cond := #in~cond; {20899#(<= ~counter~0 0)} is VALID [2022-04-28 14:07:59,813 INFO L290 TraceCheckUtils]: 8: Hoare triple {20899#(<= ~counter~0 0)} assume !(0 == ~cond); {20899#(<= ~counter~0 0)} is VALID [2022-04-28 14:07:59,813 INFO L290 TraceCheckUtils]: 9: Hoare triple {20899#(<= ~counter~0 0)} assume true; {20899#(<= ~counter~0 0)} is VALID [2022-04-28 14:07:59,813 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {20899#(<= ~counter~0 0)} {20899#(<= ~counter~0 0)} #69#return; {20899#(<= ~counter~0 0)} is VALID [2022-04-28 14:07:59,814 INFO L290 TraceCheckUtils]: 11: Hoare triple {20899#(<= ~counter~0 0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {20899#(<= ~counter~0 0)} is VALID [2022-04-28 14:07:59,814 INFO L290 TraceCheckUtils]: 12: Hoare triple {20899#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {20933#(<= ~counter~0 1)} is VALID [2022-04-28 14:07:59,814 INFO L290 TraceCheckUtils]: 13: Hoare triple {20933#(<= ~counter~0 1)} assume !!(#t~post6 < 100);havoc #t~post6; {20933#(<= ~counter~0 1)} is VALID [2022-04-28 14:07:59,815 INFO L272 TraceCheckUtils]: 14: Hoare triple {20933#(<= ~counter~0 1)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {20933#(<= ~counter~0 1)} is VALID [2022-04-28 14:07:59,815 INFO L290 TraceCheckUtils]: 15: Hoare triple {20933#(<= ~counter~0 1)} ~cond := #in~cond; {20933#(<= ~counter~0 1)} is VALID [2022-04-28 14:07:59,815 INFO L290 TraceCheckUtils]: 16: Hoare triple {20933#(<= ~counter~0 1)} assume !(0 == ~cond); {20933#(<= ~counter~0 1)} is VALID [2022-04-28 14:07:59,816 INFO L290 TraceCheckUtils]: 17: Hoare triple {20933#(<= ~counter~0 1)} assume true; {20933#(<= ~counter~0 1)} is VALID [2022-04-28 14:07:59,816 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {20933#(<= ~counter~0 1)} {20933#(<= ~counter~0 1)} #71#return; {20933#(<= ~counter~0 1)} is VALID [2022-04-28 14:07:59,817 INFO L290 TraceCheckUtils]: 19: Hoare triple {20933#(<= ~counter~0 1)} assume !!(0 != ~a~0 && 0 != ~b~0); {20933#(<= ~counter~0 1)} is VALID [2022-04-28 14:07:59,817 INFO L290 TraceCheckUtils]: 20: Hoare triple {20933#(<= ~counter~0 1)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {20933#(<= ~counter~0 1)} is VALID [2022-04-28 14:07:59,818 INFO L290 TraceCheckUtils]: 21: Hoare triple {20933#(<= ~counter~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {20961#(<= ~counter~0 2)} is VALID [2022-04-28 14:07:59,818 INFO L290 TraceCheckUtils]: 22: Hoare triple {20961#(<= ~counter~0 2)} assume !!(#t~post6 < 100);havoc #t~post6; {20961#(<= ~counter~0 2)} is VALID [2022-04-28 14:07:59,819 INFO L272 TraceCheckUtils]: 23: Hoare triple {20961#(<= ~counter~0 2)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {20961#(<= ~counter~0 2)} is VALID [2022-04-28 14:07:59,819 INFO L290 TraceCheckUtils]: 24: Hoare triple {20961#(<= ~counter~0 2)} ~cond := #in~cond; {20961#(<= ~counter~0 2)} is VALID [2022-04-28 14:07:59,819 INFO L290 TraceCheckUtils]: 25: Hoare triple {20961#(<= ~counter~0 2)} assume !(0 == ~cond); {20961#(<= ~counter~0 2)} is VALID [2022-04-28 14:07:59,819 INFO L290 TraceCheckUtils]: 26: Hoare triple {20961#(<= ~counter~0 2)} assume true; {20961#(<= ~counter~0 2)} is VALID [2022-04-28 14:07:59,820 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {20961#(<= ~counter~0 2)} {20961#(<= ~counter~0 2)} #71#return; {20961#(<= ~counter~0 2)} is VALID [2022-04-28 14:07:59,820 INFO L290 TraceCheckUtils]: 28: Hoare triple {20961#(<= ~counter~0 2)} assume !!(0 != ~a~0 && 0 != ~b~0); {20961#(<= ~counter~0 2)} is VALID [2022-04-28 14:07:59,820 INFO L290 TraceCheckUtils]: 29: Hoare triple {20961#(<= ~counter~0 2)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {20961#(<= ~counter~0 2)} is VALID [2022-04-28 14:07:59,821 INFO L290 TraceCheckUtils]: 30: Hoare triple {20961#(<= ~counter~0 2)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {20989#(<= ~counter~0 3)} is VALID [2022-04-28 14:07:59,821 INFO L290 TraceCheckUtils]: 31: Hoare triple {20989#(<= ~counter~0 3)} assume !!(#t~post6 < 100);havoc #t~post6; {20989#(<= ~counter~0 3)} is VALID [2022-04-28 14:07:59,822 INFO L272 TraceCheckUtils]: 32: Hoare triple {20989#(<= ~counter~0 3)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {20989#(<= ~counter~0 3)} is VALID [2022-04-28 14:07:59,822 INFO L290 TraceCheckUtils]: 33: Hoare triple {20989#(<= ~counter~0 3)} ~cond := #in~cond; {20989#(<= ~counter~0 3)} is VALID [2022-04-28 14:07:59,822 INFO L290 TraceCheckUtils]: 34: Hoare triple {20989#(<= ~counter~0 3)} assume !(0 == ~cond); {20989#(<= ~counter~0 3)} is VALID [2022-04-28 14:07:59,822 INFO L290 TraceCheckUtils]: 35: Hoare triple {20989#(<= ~counter~0 3)} assume true; {20989#(<= ~counter~0 3)} is VALID [2022-04-28 14:07:59,823 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {20989#(<= ~counter~0 3)} {20989#(<= ~counter~0 3)} #71#return; {20989#(<= ~counter~0 3)} is VALID [2022-04-28 14:07:59,823 INFO L290 TraceCheckUtils]: 37: Hoare triple {20989#(<= ~counter~0 3)} assume !!(0 != ~a~0 && 0 != ~b~0); {20989#(<= ~counter~0 3)} is VALID [2022-04-28 14:07:59,823 INFO L290 TraceCheckUtils]: 38: Hoare triple {20989#(<= ~counter~0 3)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {20989#(<= ~counter~0 3)} is VALID [2022-04-28 14:07:59,824 INFO L290 TraceCheckUtils]: 39: Hoare triple {20989#(<= ~counter~0 3)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {21017#(<= ~counter~0 4)} is VALID [2022-04-28 14:07:59,824 INFO L290 TraceCheckUtils]: 40: Hoare triple {21017#(<= ~counter~0 4)} assume !!(#t~post6 < 100);havoc #t~post6; {21017#(<= ~counter~0 4)} is VALID [2022-04-28 14:07:59,825 INFO L272 TraceCheckUtils]: 41: Hoare triple {21017#(<= ~counter~0 4)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {21017#(<= ~counter~0 4)} is VALID [2022-04-28 14:07:59,825 INFO L290 TraceCheckUtils]: 42: Hoare triple {21017#(<= ~counter~0 4)} ~cond := #in~cond; {21017#(<= ~counter~0 4)} is VALID [2022-04-28 14:07:59,825 INFO L290 TraceCheckUtils]: 43: Hoare triple {21017#(<= ~counter~0 4)} assume !(0 == ~cond); {21017#(<= ~counter~0 4)} is VALID [2022-04-28 14:07:59,825 INFO L290 TraceCheckUtils]: 44: Hoare triple {21017#(<= ~counter~0 4)} assume true; {21017#(<= ~counter~0 4)} is VALID [2022-04-28 14:07:59,826 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {21017#(<= ~counter~0 4)} {21017#(<= ~counter~0 4)} #71#return; {21017#(<= ~counter~0 4)} is VALID [2022-04-28 14:07:59,826 INFO L290 TraceCheckUtils]: 46: Hoare triple {21017#(<= ~counter~0 4)} assume !!(0 != ~a~0 && 0 != ~b~0); {21017#(<= ~counter~0 4)} is VALID [2022-04-28 14:07:59,826 INFO L290 TraceCheckUtils]: 47: Hoare triple {21017#(<= ~counter~0 4)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {21017#(<= ~counter~0 4)} is VALID [2022-04-28 14:07:59,827 INFO L290 TraceCheckUtils]: 48: Hoare triple {21017#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {21045#(<= ~counter~0 5)} is VALID [2022-04-28 14:07:59,827 INFO L290 TraceCheckUtils]: 49: Hoare triple {21045#(<= ~counter~0 5)} assume !!(#t~post6 < 100);havoc #t~post6; {21045#(<= ~counter~0 5)} is VALID [2022-04-28 14:07:59,828 INFO L272 TraceCheckUtils]: 50: Hoare triple {21045#(<= ~counter~0 5)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {21045#(<= ~counter~0 5)} is VALID [2022-04-28 14:07:59,828 INFO L290 TraceCheckUtils]: 51: Hoare triple {21045#(<= ~counter~0 5)} ~cond := #in~cond; {21045#(<= ~counter~0 5)} is VALID [2022-04-28 14:07:59,828 INFO L290 TraceCheckUtils]: 52: Hoare triple {21045#(<= ~counter~0 5)} assume !(0 == ~cond); {21045#(<= ~counter~0 5)} is VALID [2022-04-28 14:07:59,828 INFO L290 TraceCheckUtils]: 53: Hoare triple {21045#(<= ~counter~0 5)} assume true; {21045#(<= ~counter~0 5)} is VALID [2022-04-28 14:07:59,829 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {21045#(<= ~counter~0 5)} {21045#(<= ~counter~0 5)} #71#return; {21045#(<= ~counter~0 5)} is VALID [2022-04-28 14:07:59,829 INFO L290 TraceCheckUtils]: 55: Hoare triple {21045#(<= ~counter~0 5)} assume !!(0 != ~a~0 && 0 != ~b~0); {21045#(<= ~counter~0 5)} is VALID [2022-04-28 14:07:59,829 INFO L290 TraceCheckUtils]: 56: Hoare triple {21045#(<= ~counter~0 5)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {21045#(<= ~counter~0 5)} is VALID [2022-04-28 14:07:59,830 INFO L290 TraceCheckUtils]: 57: Hoare triple {21045#(<= ~counter~0 5)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {21073#(<= ~counter~0 6)} is VALID [2022-04-28 14:07:59,830 INFO L290 TraceCheckUtils]: 58: Hoare triple {21073#(<= ~counter~0 6)} assume !!(#t~post6 < 100);havoc #t~post6; {21073#(<= ~counter~0 6)} is VALID [2022-04-28 14:07:59,831 INFO L272 TraceCheckUtils]: 59: Hoare triple {21073#(<= ~counter~0 6)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {21073#(<= ~counter~0 6)} is VALID [2022-04-28 14:07:59,831 INFO L290 TraceCheckUtils]: 60: Hoare triple {21073#(<= ~counter~0 6)} ~cond := #in~cond; {21073#(<= ~counter~0 6)} is VALID [2022-04-28 14:07:59,831 INFO L290 TraceCheckUtils]: 61: Hoare triple {21073#(<= ~counter~0 6)} assume !(0 == ~cond); {21073#(<= ~counter~0 6)} is VALID [2022-04-28 14:07:59,831 INFO L290 TraceCheckUtils]: 62: Hoare triple {21073#(<= ~counter~0 6)} assume true; {21073#(<= ~counter~0 6)} is VALID [2022-04-28 14:07:59,832 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {21073#(<= ~counter~0 6)} {21073#(<= ~counter~0 6)} #71#return; {21073#(<= ~counter~0 6)} is VALID [2022-04-28 14:07:59,832 INFO L290 TraceCheckUtils]: 64: Hoare triple {21073#(<= ~counter~0 6)} assume !!(0 != ~a~0 && 0 != ~b~0); {21073#(<= ~counter~0 6)} is VALID [2022-04-28 14:07:59,832 INFO L290 TraceCheckUtils]: 65: Hoare triple {21073#(<= ~counter~0 6)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {21073#(<= ~counter~0 6)} is VALID [2022-04-28 14:07:59,833 INFO L290 TraceCheckUtils]: 66: Hoare triple {21073#(<= ~counter~0 6)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {21101#(<= ~counter~0 7)} is VALID [2022-04-28 14:07:59,833 INFO L290 TraceCheckUtils]: 67: Hoare triple {21101#(<= ~counter~0 7)} assume !!(#t~post6 < 100);havoc #t~post6; {21101#(<= ~counter~0 7)} is VALID [2022-04-28 14:07:59,834 INFO L272 TraceCheckUtils]: 68: Hoare triple {21101#(<= ~counter~0 7)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {21101#(<= ~counter~0 7)} is VALID [2022-04-28 14:07:59,834 INFO L290 TraceCheckUtils]: 69: Hoare triple {21101#(<= ~counter~0 7)} ~cond := #in~cond; {21101#(<= ~counter~0 7)} is VALID [2022-04-28 14:07:59,834 INFO L290 TraceCheckUtils]: 70: Hoare triple {21101#(<= ~counter~0 7)} assume !(0 == ~cond); {21101#(<= ~counter~0 7)} is VALID [2022-04-28 14:07:59,834 INFO L290 TraceCheckUtils]: 71: Hoare triple {21101#(<= ~counter~0 7)} assume true; {21101#(<= ~counter~0 7)} is VALID [2022-04-28 14:07:59,835 INFO L284 TraceCheckUtils]: 72: Hoare quadruple {21101#(<= ~counter~0 7)} {21101#(<= ~counter~0 7)} #71#return; {21101#(<= ~counter~0 7)} is VALID [2022-04-28 14:07:59,835 INFO L290 TraceCheckUtils]: 73: Hoare triple {21101#(<= ~counter~0 7)} assume !!(0 != ~a~0 && 0 != ~b~0); {21101#(<= ~counter~0 7)} is VALID [2022-04-28 14:07:59,836 INFO L290 TraceCheckUtils]: 74: Hoare triple {21101#(<= ~counter~0 7)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {21101#(<= ~counter~0 7)} is VALID [2022-04-28 14:07:59,836 INFO L290 TraceCheckUtils]: 75: Hoare triple {21101#(<= ~counter~0 7)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {21129#(<= ~counter~0 8)} is VALID [2022-04-28 14:07:59,836 INFO L290 TraceCheckUtils]: 76: Hoare triple {21129#(<= ~counter~0 8)} assume !!(#t~post6 < 100);havoc #t~post6; {21129#(<= ~counter~0 8)} is VALID [2022-04-28 14:07:59,837 INFO L272 TraceCheckUtils]: 77: Hoare triple {21129#(<= ~counter~0 8)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {21129#(<= ~counter~0 8)} is VALID [2022-04-28 14:07:59,837 INFO L290 TraceCheckUtils]: 78: Hoare triple {21129#(<= ~counter~0 8)} ~cond := #in~cond; {21129#(<= ~counter~0 8)} is VALID [2022-04-28 14:07:59,837 INFO L290 TraceCheckUtils]: 79: Hoare triple {21129#(<= ~counter~0 8)} assume !(0 == ~cond); {21129#(<= ~counter~0 8)} is VALID [2022-04-28 14:07:59,837 INFO L290 TraceCheckUtils]: 80: Hoare triple {21129#(<= ~counter~0 8)} assume true; {21129#(<= ~counter~0 8)} is VALID [2022-04-28 14:07:59,838 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {21129#(<= ~counter~0 8)} {21129#(<= ~counter~0 8)} #71#return; {21129#(<= ~counter~0 8)} is VALID [2022-04-28 14:07:59,838 INFO L290 TraceCheckUtils]: 82: Hoare triple {21129#(<= ~counter~0 8)} assume !!(0 != ~a~0 && 0 != ~b~0); {21129#(<= ~counter~0 8)} is VALID [2022-04-28 14:07:59,839 INFO L290 TraceCheckUtils]: 83: Hoare triple {21129#(<= ~counter~0 8)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {21129#(<= ~counter~0 8)} is VALID [2022-04-28 14:07:59,839 INFO L290 TraceCheckUtils]: 84: Hoare triple {21129#(<= ~counter~0 8)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {21157#(<= ~counter~0 9)} is VALID [2022-04-28 14:07:59,839 INFO L290 TraceCheckUtils]: 85: Hoare triple {21157#(<= ~counter~0 9)} assume !!(#t~post6 < 100);havoc #t~post6; {21157#(<= ~counter~0 9)} is VALID [2022-04-28 14:07:59,840 INFO L272 TraceCheckUtils]: 86: Hoare triple {21157#(<= ~counter~0 9)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {21157#(<= ~counter~0 9)} is VALID [2022-04-28 14:07:59,840 INFO L290 TraceCheckUtils]: 87: Hoare triple {21157#(<= ~counter~0 9)} ~cond := #in~cond; {21157#(<= ~counter~0 9)} is VALID [2022-04-28 14:07:59,840 INFO L290 TraceCheckUtils]: 88: Hoare triple {21157#(<= ~counter~0 9)} assume !(0 == ~cond); {21157#(<= ~counter~0 9)} is VALID [2022-04-28 14:07:59,841 INFO L290 TraceCheckUtils]: 89: Hoare triple {21157#(<= ~counter~0 9)} assume true; {21157#(<= ~counter~0 9)} is VALID [2022-04-28 14:07:59,841 INFO L284 TraceCheckUtils]: 90: Hoare quadruple {21157#(<= ~counter~0 9)} {21157#(<= ~counter~0 9)} #71#return; {21157#(<= ~counter~0 9)} is VALID [2022-04-28 14:07:59,841 INFO L290 TraceCheckUtils]: 91: Hoare triple {21157#(<= ~counter~0 9)} assume !!(0 != ~a~0 && 0 != ~b~0); {21157#(<= ~counter~0 9)} is VALID [2022-04-28 14:07:59,842 INFO L290 TraceCheckUtils]: 92: Hoare triple {21157#(<= ~counter~0 9)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {21157#(<= ~counter~0 9)} is VALID [2022-04-28 14:07:59,842 INFO L290 TraceCheckUtils]: 93: Hoare triple {21157#(<= ~counter~0 9)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {21185#(<= ~counter~0 10)} is VALID [2022-04-28 14:07:59,842 INFO L290 TraceCheckUtils]: 94: Hoare triple {21185#(<= ~counter~0 10)} assume !!(#t~post6 < 100);havoc #t~post6; {21185#(<= ~counter~0 10)} is VALID [2022-04-28 14:07:59,843 INFO L272 TraceCheckUtils]: 95: Hoare triple {21185#(<= ~counter~0 10)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {21185#(<= ~counter~0 10)} is VALID [2022-04-28 14:07:59,843 INFO L290 TraceCheckUtils]: 96: Hoare triple {21185#(<= ~counter~0 10)} ~cond := #in~cond; {21185#(<= ~counter~0 10)} is VALID [2022-04-28 14:07:59,843 INFO L290 TraceCheckUtils]: 97: Hoare triple {21185#(<= ~counter~0 10)} assume !(0 == ~cond); {21185#(<= ~counter~0 10)} is VALID [2022-04-28 14:07:59,844 INFO L290 TraceCheckUtils]: 98: Hoare triple {21185#(<= ~counter~0 10)} assume true; {21185#(<= ~counter~0 10)} is VALID [2022-04-28 14:07:59,844 INFO L284 TraceCheckUtils]: 99: Hoare quadruple {21185#(<= ~counter~0 10)} {21185#(<= ~counter~0 10)} #71#return; {21185#(<= ~counter~0 10)} is VALID [2022-04-28 14:07:59,844 INFO L290 TraceCheckUtils]: 100: Hoare triple {21185#(<= ~counter~0 10)} assume !!(0 != ~a~0 && 0 != ~b~0); {21185#(<= ~counter~0 10)} is VALID [2022-04-28 14:07:59,845 INFO L290 TraceCheckUtils]: 101: Hoare triple {21185#(<= ~counter~0 10)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {21185#(<= ~counter~0 10)} is VALID [2022-04-28 14:07:59,845 INFO L290 TraceCheckUtils]: 102: Hoare triple {21185#(<= ~counter~0 10)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {21213#(<= ~counter~0 11)} is VALID [2022-04-28 14:07:59,845 INFO L290 TraceCheckUtils]: 103: Hoare triple {21213#(<= ~counter~0 11)} assume !!(#t~post6 < 100);havoc #t~post6; {21213#(<= ~counter~0 11)} is VALID [2022-04-28 14:07:59,846 INFO L272 TraceCheckUtils]: 104: Hoare triple {21213#(<= ~counter~0 11)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {21213#(<= ~counter~0 11)} is VALID [2022-04-28 14:07:59,846 INFO L290 TraceCheckUtils]: 105: Hoare triple {21213#(<= ~counter~0 11)} ~cond := #in~cond; {21213#(<= ~counter~0 11)} is VALID [2022-04-28 14:07:59,846 INFO L290 TraceCheckUtils]: 106: Hoare triple {21213#(<= ~counter~0 11)} assume !(0 == ~cond); {21213#(<= ~counter~0 11)} is VALID [2022-04-28 14:07:59,847 INFO L290 TraceCheckUtils]: 107: Hoare triple {21213#(<= ~counter~0 11)} assume true; {21213#(<= ~counter~0 11)} is VALID [2022-04-28 14:07:59,847 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {21213#(<= ~counter~0 11)} {21213#(<= ~counter~0 11)} #71#return; {21213#(<= ~counter~0 11)} is VALID [2022-04-28 14:07:59,847 INFO L290 TraceCheckUtils]: 109: Hoare triple {21213#(<= ~counter~0 11)} assume !!(0 != ~a~0 && 0 != ~b~0); {21213#(<= ~counter~0 11)} is VALID [2022-04-28 14:07:59,848 INFO L290 TraceCheckUtils]: 110: Hoare triple {21213#(<= ~counter~0 11)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {21213#(<= ~counter~0 11)} is VALID [2022-04-28 14:07:59,848 INFO L290 TraceCheckUtils]: 111: Hoare triple {21213#(<= ~counter~0 11)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {21241#(<= ~counter~0 12)} is VALID [2022-04-28 14:07:59,848 INFO L290 TraceCheckUtils]: 112: Hoare triple {21241#(<= ~counter~0 12)} assume !!(#t~post6 < 100);havoc #t~post6; {21241#(<= ~counter~0 12)} is VALID [2022-04-28 14:07:59,849 INFO L272 TraceCheckUtils]: 113: Hoare triple {21241#(<= ~counter~0 12)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {21241#(<= ~counter~0 12)} is VALID [2022-04-28 14:07:59,849 INFO L290 TraceCheckUtils]: 114: Hoare triple {21241#(<= ~counter~0 12)} ~cond := #in~cond; {21241#(<= ~counter~0 12)} is VALID [2022-04-28 14:07:59,849 INFO L290 TraceCheckUtils]: 115: Hoare triple {21241#(<= ~counter~0 12)} assume !(0 == ~cond); {21241#(<= ~counter~0 12)} is VALID [2022-04-28 14:07:59,850 INFO L290 TraceCheckUtils]: 116: Hoare triple {21241#(<= ~counter~0 12)} assume true; {21241#(<= ~counter~0 12)} is VALID [2022-04-28 14:07:59,850 INFO L284 TraceCheckUtils]: 117: Hoare quadruple {21241#(<= ~counter~0 12)} {21241#(<= ~counter~0 12)} #71#return; {21241#(<= ~counter~0 12)} is VALID [2022-04-28 14:07:59,850 INFO L290 TraceCheckUtils]: 118: Hoare triple {21241#(<= ~counter~0 12)} assume !!(0 != ~a~0 && 0 != ~b~0); {21241#(<= ~counter~0 12)} is VALID [2022-04-28 14:07:59,851 INFO L290 TraceCheckUtils]: 119: Hoare triple {21241#(<= ~counter~0 12)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {21241#(<= ~counter~0 12)} is VALID [2022-04-28 14:07:59,851 INFO L290 TraceCheckUtils]: 120: Hoare triple {21241#(<= ~counter~0 12)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {21269#(<= |main_#t~post6| 12)} is VALID [2022-04-28 14:07:59,851 INFO L290 TraceCheckUtils]: 121: Hoare triple {21269#(<= |main_#t~post6| 12)} assume !(#t~post6 < 100);havoc #t~post6; {20892#false} is VALID [2022-04-28 14:07:59,851 INFO L272 TraceCheckUtils]: 122: Hoare triple {20892#false} call __VERIFIER_assert((if ~q~0 == ~x~0 * ~y~0 then 1 else 0)); {20892#false} is VALID [2022-04-28 14:07:59,851 INFO L290 TraceCheckUtils]: 123: Hoare triple {20892#false} ~cond := #in~cond; {20892#false} is VALID [2022-04-28 14:07:59,851 INFO L290 TraceCheckUtils]: 124: Hoare triple {20892#false} assume 0 == ~cond; {20892#false} is VALID [2022-04-28 14:07:59,851 INFO L290 TraceCheckUtils]: 125: Hoare triple {20892#false} assume !false; {20892#false} is VALID [2022-04-28 14:07:59,852 INFO L134 CoverageAnalysis]: Checked inductivity of 642 backedges. 24 proven. 618 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 14:07:59,852 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 14:08:00,543 INFO L290 TraceCheckUtils]: 125: Hoare triple {20892#false} assume !false; {20892#false} is VALID [2022-04-28 14:08:00,544 INFO L290 TraceCheckUtils]: 124: Hoare triple {20892#false} assume 0 == ~cond; {20892#false} is VALID [2022-04-28 14:08:00,544 INFO L290 TraceCheckUtils]: 123: Hoare triple {20892#false} ~cond := #in~cond; {20892#false} is VALID [2022-04-28 14:08:00,544 INFO L272 TraceCheckUtils]: 122: Hoare triple {20892#false} call __VERIFIER_assert((if ~q~0 == ~x~0 * ~y~0 then 1 else 0)); {20892#false} is VALID [2022-04-28 14:08:00,544 INFO L290 TraceCheckUtils]: 121: Hoare triple {21297#(< |main_#t~post6| 100)} assume !(#t~post6 < 100);havoc #t~post6; {20892#false} is VALID [2022-04-28 14:08:00,544 INFO L290 TraceCheckUtils]: 120: Hoare triple {21301#(< ~counter~0 100)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {21297#(< |main_#t~post6| 100)} is VALID [2022-04-28 14:08:00,545 INFO L290 TraceCheckUtils]: 119: Hoare triple {21301#(< ~counter~0 100)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {21301#(< ~counter~0 100)} is VALID [2022-04-28 14:08:00,545 INFO L290 TraceCheckUtils]: 118: Hoare triple {21301#(< ~counter~0 100)} assume !!(0 != ~a~0 && 0 != ~b~0); {21301#(< ~counter~0 100)} is VALID [2022-04-28 14:08:00,545 INFO L284 TraceCheckUtils]: 117: Hoare quadruple {20891#true} {21301#(< ~counter~0 100)} #71#return; {21301#(< ~counter~0 100)} is VALID [2022-04-28 14:08:00,545 INFO L290 TraceCheckUtils]: 116: Hoare triple {20891#true} assume true; {20891#true} is VALID [2022-04-28 14:08:00,546 INFO L290 TraceCheckUtils]: 115: Hoare triple {20891#true} assume !(0 == ~cond); {20891#true} is VALID [2022-04-28 14:08:00,546 INFO L290 TraceCheckUtils]: 114: Hoare triple {20891#true} ~cond := #in~cond; {20891#true} is VALID [2022-04-28 14:08:00,546 INFO L272 TraceCheckUtils]: 113: Hoare triple {21301#(< ~counter~0 100)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {20891#true} is VALID [2022-04-28 14:08:00,546 INFO L290 TraceCheckUtils]: 112: Hoare triple {21301#(< ~counter~0 100)} assume !!(#t~post6 < 100);havoc #t~post6; {21301#(< ~counter~0 100)} is VALID [2022-04-28 14:08:00,546 INFO L290 TraceCheckUtils]: 111: Hoare triple {21329#(< ~counter~0 99)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {21301#(< ~counter~0 100)} is VALID [2022-04-28 14:08:00,547 INFO L290 TraceCheckUtils]: 110: Hoare triple {21329#(< ~counter~0 99)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {21329#(< ~counter~0 99)} is VALID [2022-04-28 14:08:00,547 INFO L290 TraceCheckUtils]: 109: Hoare triple {21329#(< ~counter~0 99)} assume !!(0 != ~a~0 && 0 != ~b~0); {21329#(< ~counter~0 99)} is VALID [2022-04-28 14:08:00,548 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {20891#true} {21329#(< ~counter~0 99)} #71#return; {21329#(< ~counter~0 99)} is VALID [2022-04-28 14:08:00,548 INFO L290 TraceCheckUtils]: 107: Hoare triple {20891#true} assume true; {20891#true} is VALID [2022-04-28 14:08:00,548 INFO L290 TraceCheckUtils]: 106: Hoare triple {20891#true} assume !(0 == ~cond); {20891#true} is VALID [2022-04-28 14:08:00,548 INFO L290 TraceCheckUtils]: 105: Hoare triple {20891#true} ~cond := #in~cond; {20891#true} is VALID [2022-04-28 14:08:00,548 INFO L272 TraceCheckUtils]: 104: Hoare triple {21329#(< ~counter~0 99)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {20891#true} is VALID [2022-04-28 14:08:00,548 INFO L290 TraceCheckUtils]: 103: Hoare triple {21329#(< ~counter~0 99)} assume !!(#t~post6 < 100);havoc #t~post6; {21329#(< ~counter~0 99)} is VALID [2022-04-28 14:08:00,548 INFO L290 TraceCheckUtils]: 102: Hoare triple {21357#(< ~counter~0 98)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {21329#(< ~counter~0 99)} is VALID [2022-04-28 14:08:00,549 INFO L290 TraceCheckUtils]: 101: Hoare triple {21357#(< ~counter~0 98)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {21357#(< ~counter~0 98)} is VALID [2022-04-28 14:08:00,549 INFO L290 TraceCheckUtils]: 100: Hoare triple {21357#(< ~counter~0 98)} assume !!(0 != ~a~0 && 0 != ~b~0); {21357#(< ~counter~0 98)} is VALID [2022-04-28 14:08:00,550 INFO L284 TraceCheckUtils]: 99: Hoare quadruple {20891#true} {21357#(< ~counter~0 98)} #71#return; {21357#(< ~counter~0 98)} is VALID [2022-04-28 14:08:00,550 INFO L290 TraceCheckUtils]: 98: Hoare triple {20891#true} assume true; {20891#true} is VALID [2022-04-28 14:08:00,550 INFO L290 TraceCheckUtils]: 97: Hoare triple {20891#true} assume !(0 == ~cond); {20891#true} is VALID [2022-04-28 14:08:00,550 INFO L290 TraceCheckUtils]: 96: Hoare triple {20891#true} ~cond := #in~cond; {20891#true} is VALID [2022-04-28 14:08:00,550 INFO L272 TraceCheckUtils]: 95: Hoare triple {21357#(< ~counter~0 98)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {20891#true} is VALID [2022-04-28 14:08:00,550 INFO L290 TraceCheckUtils]: 94: Hoare triple {21357#(< ~counter~0 98)} assume !!(#t~post6 < 100);havoc #t~post6; {21357#(< ~counter~0 98)} is VALID [2022-04-28 14:08:00,550 INFO L290 TraceCheckUtils]: 93: Hoare triple {21385#(< ~counter~0 97)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {21357#(< ~counter~0 98)} is VALID [2022-04-28 14:08:00,551 INFO L290 TraceCheckUtils]: 92: Hoare triple {21385#(< ~counter~0 97)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {21385#(< ~counter~0 97)} is VALID [2022-04-28 14:08:00,551 INFO L290 TraceCheckUtils]: 91: Hoare triple {21385#(< ~counter~0 97)} assume !!(0 != ~a~0 && 0 != ~b~0); {21385#(< ~counter~0 97)} is VALID [2022-04-28 14:08:00,551 INFO L284 TraceCheckUtils]: 90: Hoare quadruple {20891#true} {21385#(< ~counter~0 97)} #71#return; {21385#(< ~counter~0 97)} is VALID [2022-04-28 14:08:00,552 INFO L290 TraceCheckUtils]: 89: Hoare triple {20891#true} assume true; {20891#true} is VALID [2022-04-28 14:08:00,552 INFO L290 TraceCheckUtils]: 88: Hoare triple {20891#true} assume !(0 == ~cond); {20891#true} is VALID [2022-04-28 14:08:00,552 INFO L290 TraceCheckUtils]: 87: Hoare triple {20891#true} ~cond := #in~cond; {20891#true} is VALID [2022-04-28 14:08:00,552 INFO L272 TraceCheckUtils]: 86: Hoare triple {21385#(< ~counter~0 97)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {20891#true} is VALID [2022-04-28 14:08:00,552 INFO L290 TraceCheckUtils]: 85: Hoare triple {21385#(< ~counter~0 97)} assume !!(#t~post6 < 100);havoc #t~post6; {21385#(< ~counter~0 97)} is VALID [2022-04-28 14:08:00,552 INFO L290 TraceCheckUtils]: 84: Hoare triple {21413#(< ~counter~0 96)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {21385#(< ~counter~0 97)} is VALID [2022-04-28 14:08:00,553 INFO L290 TraceCheckUtils]: 83: Hoare triple {21413#(< ~counter~0 96)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {21413#(< ~counter~0 96)} is VALID [2022-04-28 14:08:00,553 INFO L290 TraceCheckUtils]: 82: Hoare triple {21413#(< ~counter~0 96)} assume !!(0 != ~a~0 && 0 != ~b~0); {21413#(< ~counter~0 96)} is VALID [2022-04-28 14:08:00,553 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {20891#true} {21413#(< ~counter~0 96)} #71#return; {21413#(< ~counter~0 96)} is VALID [2022-04-28 14:08:00,554 INFO L290 TraceCheckUtils]: 80: Hoare triple {20891#true} assume true; {20891#true} is VALID [2022-04-28 14:08:00,554 INFO L290 TraceCheckUtils]: 79: Hoare triple {20891#true} assume !(0 == ~cond); {20891#true} is VALID [2022-04-28 14:08:00,554 INFO L290 TraceCheckUtils]: 78: Hoare triple {20891#true} ~cond := #in~cond; {20891#true} is VALID [2022-04-28 14:08:00,554 INFO L272 TraceCheckUtils]: 77: Hoare triple {21413#(< ~counter~0 96)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {20891#true} is VALID [2022-04-28 14:08:00,554 INFO L290 TraceCheckUtils]: 76: Hoare triple {21413#(< ~counter~0 96)} assume !!(#t~post6 < 100);havoc #t~post6; {21413#(< ~counter~0 96)} is VALID [2022-04-28 14:08:00,554 INFO L290 TraceCheckUtils]: 75: Hoare triple {21441#(< ~counter~0 95)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {21413#(< ~counter~0 96)} is VALID [2022-04-28 14:08:00,555 INFO L290 TraceCheckUtils]: 74: Hoare triple {21441#(< ~counter~0 95)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {21441#(< ~counter~0 95)} is VALID [2022-04-28 14:08:00,555 INFO L290 TraceCheckUtils]: 73: Hoare triple {21441#(< ~counter~0 95)} assume !!(0 != ~a~0 && 0 != ~b~0); {21441#(< ~counter~0 95)} is VALID [2022-04-28 14:08:00,555 INFO L284 TraceCheckUtils]: 72: Hoare quadruple {20891#true} {21441#(< ~counter~0 95)} #71#return; {21441#(< ~counter~0 95)} is VALID [2022-04-28 14:08:00,556 INFO L290 TraceCheckUtils]: 71: Hoare triple {20891#true} assume true; {20891#true} is VALID [2022-04-28 14:08:00,556 INFO L290 TraceCheckUtils]: 70: Hoare triple {20891#true} assume !(0 == ~cond); {20891#true} is VALID [2022-04-28 14:08:00,556 INFO L290 TraceCheckUtils]: 69: Hoare triple {20891#true} ~cond := #in~cond; {20891#true} is VALID [2022-04-28 14:08:00,556 INFO L272 TraceCheckUtils]: 68: Hoare triple {21441#(< ~counter~0 95)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {20891#true} is VALID [2022-04-28 14:08:00,556 INFO L290 TraceCheckUtils]: 67: Hoare triple {21441#(< ~counter~0 95)} assume !!(#t~post6 < 100);havoc #t~post6; {21441#(< ~counter~0 95)} is VALID [2022-04-28 14:08:00,556 INFO L290 TraceCheckUtils]: 66: Hoare triple {21469#(< ~counter~0 94)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {21441#(< ~counter~0 95)} is VALID [2022-04-28 14:08:00,557 INFO L290 TraceCheckUtils]: 65: Hoare triple {21469#(< ~counter~0 94)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {21469#(< ~counter~0 94)} is VALID [2022-04-28 14:08:00,557 INFO L290 TraceCheckUtils]: 64: Hoare triple {21469#(< ~counter~0 94)} assume !!(0 != ~a~0 && 0 != ~b~0); {21469#(< ~counter~0 94)} is VALID [2022-04-28 14:08:00,557 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {20891#true} {21469#(< ~counter~0 94)} #71#return; {21469#(< ~counter~0 94)} is VALID [2022-04-28 14:08:00,558 INFO L290 TraceCheckUtils]: 62: Hoare triple {20891#true} assume true; {20891#true} is VALID [2022-04-28 14:08:00,558 INFO L290 TraceCheckUtils]: 61: Hoare triple {20891#true} assume !(0 == ~cond); {20891#true} is VALID [2022-04-28 14:08:00,558 INFO L290 TraceCheckUtils]: 60: Hoare triple {20891#true} ~cond := #in~cond; {20891#true} is VALID [2022-04-28 14:08:00,558 INFO L272 TraceCheckUtils]: 59: Hoare triple {21469#(< ~counter~0 94)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {20891#true} is VALID [2022-04-28 14:08:00,558 INFO L290 TraceCheckUtils]: 58: Hoare triple {21469#(< ~counter~0 94)} assume !!(#t~post6 < 100);havoc #t~post6; {21469#(< ~counter~0 94)} is VALID [2022-04-28 14:08:00,558 INFO L290 TraceCheckUtils]: 57: Hoare triple {21497#(< ~counter~0 93)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {21469#(< ~counter~0 94)} is VALID [2022-04-28 14:08:00,559 INFO L290 TraceCheckUtils]: 56: Hoare triple {21497#(< ~counter~0 93)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {21497#(< ~counter~0 93)} is VALID [2022-04-28 14:08:00,559 INFO L290 TraceCheckUtils]: 55: Hoare triple {21497#(< ~counter~0 93)} assume !!(0 != ~a~0 && 0 != ~b~0); {21497#(< ~counter~0 93)} is VALID [2022-04-28 14:08:00,559 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {20891#true} {21497#(< ~counter~0 93)} #71#return; {21497#(< ~counter~0 93)} is VALID [2022-04-28 14:08:00,560 INFO L290 TraceCheckUtils]: 53: Hoare triple {20891#true} assume true; {20891#true} is VALID [2022-04-28 14:08:00,560 INFO L290 TraceCheckUtils]: 52: Hoare triple {20891#true} assume !(0 == ~cond); {20891#true} is VALID [2022-04-28 14:08:00,560 INFO L290 TraceCheckUtils]: 51: Hoare triple {20891#true} ~cond := #in~cond; {20891#true} is VALID [2022-04-28 14:08:00,560 INFO L272 TraceCheckUtils]: 50: Hoare triple {21497#(< ~counter~0 93)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {20891#true} is VALID [2022-04-28 14:08:00,560 INFO L290 TraceCheckUtils]: 49: Hoare triple {21497#(< ~counter~0 93)} assume !!(#t~post6 < 100);havoc #t~post6; {21497#(< ~counter~0 93)} is VALID [2022-04-28 14:08:00,560 INFO L290 TraceCheckUtils]: 48: Hoare triple {21525#(< ~counter~0 92)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {21497#(< ~counter~0 93)} is VALID [2022-04-28 14:08:00,561 INFO L290 TraceCheckUtils]: 47: Hoare triple {21525#(< ~counter~0 92)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {21525#(< ~counter~0 92)} is VALID [2022-04-28 14:08:00,561 INFO L290 TraceCheckUtils]: 46: Hoare triple {21525#(< ~counter~0 92)} assume !!(0 != ~a~0 && 0 != ~b~0); {21525#(< ~counter~0 92)} is VALID [2022-04-28 14:08:00,561 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {20891#true} {21525#(< ~counter~0 92)} #71#return; {21525#(< ~counter~0 92)} is VALID [2022-04-28 14:08:00,562 INFO L290 TraceCheckUtils]: 44: Hoare triple {20891#true} assume true; {20891#true} is VALID [2022-04-28 14:08:00,562 INFO L290 TraceCheckUtils]: 43: Hoare triple {20891#true} assume !(0 == ~cond); {20891#true} is VALID [2022-04-28 14:08:00,562 INFO L290 TraceCheckUtils]: 42: Hoare triple {20891#true} ~cond := #in~cond; {20891#true} is VALID [2022-04-28 14:08:00,562 INFO L272 TraceCheckUtils]: 41: Hoare triple {21525#(< ~counter~0 92)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {20891#true} is VALID [2022-04-28 14:08:00,562 INFO L290 TraceCheckUtils]: 40: Hoare triple {21525#(< ~counter~0 92)} assume !!(#t~post6 < 100);havoc #t~post6; {21525#(< ~counter~0 92)} is VALID [2022-04-28 14:08:00,562 INFO L290 TraceCheckUtils]: 39: Hoare triple {21553#(< ~counter~0 91)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {21525#(< ~counter~0 92)} is VALID [2022-04-28 14:08:00,563 INFO L290 TraceCheckUtils]: 38: Hoare triple {21553#(< ~counter~0 91)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {21553#(< ~counter~0 91)} is VALID [2022-04-28 14:08:00,563 INFO L290 TraceCheckUtils]: 37: Hoare triple {21553#(< ~counter~0 91)} assume !!(0 != ~a~0 && 0 != ~b~0); {21553#(< ~counter~0 91)} is VALID [2022-04-28 14:08:00,563 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {20891#true} {21553#(< ~counter~0 91)} #71#return; {21553#(< ~counter~0 91)} is VALID [2022-04-28 14:08:00,564 INFO L290 TraceCheckUtils]: 35: Hoare triple {20891#true} assume true; {20891#true} is VALID [2022-04-28 14:08:00,564 INFO L290 TraceCheckUtils]: 34: Hoare triple {20891#true} assume !(0 == ~cond); {20891#true} is VALID [2022-04-28 14:08:00,564 INFO L290 TraceCheckUtils]: 33: Hoare triple {20891#true} ~cond := #in~cond; {20891#true} is VALID [2022-04-28 14:08:00,564 INFO L272 TraceCheckUtils]: 32: Hoare triple {21553#(< ~counter~0 91)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {20891#true} is VALID [2022-04-28 14:08:00,564 INFO L290 TraceCheckUtils]: 31: Hoare triple {21553#(< ~counter~0 91)} assume !!(#t~post6 < 100);havoc #t~post6; {21553#(< ~counter~0 91)} is VALID [2022-04-28 14:08:00,564 INFO L290 TraceCheckUtils]: 30: Hoare triple {21581#(< ~counter~0 90)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {21553#(< ~counter~0 91)} is VALID [2022-04-28 14:08:00,565 INFO L290 TraceCheckUtils]: 29: Hoare triple {21581#(< ~counter~0 90)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {21581#(< ~counter~0 90)} is VALID [2022-04-28 14:08:00,565 INFO L290 TraceCheckUtils]: 28: Hoare triple {21581#(< ~counter~0 90)} assume !!(0 != ~a~0 && 0 != ~b~0); {21581#(< ~counter~0 90)} is VALID [2022-04-28 14:08:00,565 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {20891#true} {21581#(< ~counter~0 90)} #71#return; {21581#(< ~counter~0 90)} is VALID [2022-04-28 14:08:00,566 INFO L290 TraceCheckUtils]: 26: Hoare triple {20891#true} assume true; {20891#true} is VALID [2022-04-28 14:08:00,566 INFO L290 TraceCheckUtils]: 25: Hoare triple {20891#true} assume !(0 == ~cond); {20891#true} is VALID [2022-04-28 14:08:00,566 INFO L290 TraceCheckUtils]: 24: Hoare triple {20891#true} ~cond := #in~cond; {20891#true} is VALID [2022-04-28 14:08:00,566 INFO L272 TraceCheckUtils]: 23: Hoare triple {21581#(< ~counter~0 90)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {20891#true} is VALID [2022-04-28 14:08:00,566 INFO L290 TraceCheckUtils]: 22: Hoare triple {21581#(< ~counter~0 90)} assume !!(#t~post6 < 100);havoc #t~post6; {21581#(< ~counter~0 90)} is VALID [2022-04-28 14:08:00,566 INFO L290 TraceCheckUtils]: 21: Hoare triple {21609#(< ~counter~0 89)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {21581#(< ~counter~0 90)} is VALID [2022-04-28 14:08:00,567 INFO L290 TraceCheckUtils]: 20: Hoare triple {21609#(< ~counter~0 89)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {21609#(< ~counter~0 89)} is VALID [2022-04-28 14:08:00,567 INFO L290 TraceCheckUtils]: 19: Hoare triple {21609#(< ~counter~0 89)} assume !!(0 != ~a~0 && 0 != ~b~0); {21609#(< ~counter~0 89)} is VALID [2022-04-28 14:08:00,568 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {20891#true} {21609#(< ~counter~0 89)} #71#return; {21609#(< ~counter~0 89)} is VALID [2022-04-28 14:08:00,568 INFO L290 TraceCheckUtils]: 17: Hoare triple {20891#true} assume true; {20891#true} is VALID [2022-04-28 14:08:00,568 INFO L290 TraceCheckUtils]: 16: Hoare triple {20891#true} assume !(0 == ~cond); {20891#true} is VALID [2022-04-28 14:08:00,568 INFO L290 TraceCheckUtils]: 15: Hoare triple {20891#true} ~cond := #in~cond; {20891#true} is VALID [2022-04-28 14:08:00,568 INFO L272 TraceCheckUtils]: 14: Hoare triple {21609#(< ~counter~0 89)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {20891#true} is VALID [2022-04-28 14:08:00,568 INFO L290 TraceCheckUtils]: 13: Hoare triple {21609#(< ~counter~0 89)} assume !!(#t~post6 < 100);havoc #t~post6; {21609#(< ~counter~0 89)} is VALID [2022-04-28 14:08:00,568 INFO L290 TraceCheckUtils]: 12: Hoare triple {21637#(< ~counter~0 88)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {21609#(< ~counter~0 89)} is VALID [2022-04-28 14:08:00,569 INFO L290 TraceCheckUtils]: 11: Hoare triple {21637#(< ~counter~0 88)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {21637#(< ~counter~0 88)} is VALID [2022-04-28 14:08:00,569 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {20891#true} {21637#(< ~counter~0 88)} #69#return; {21637#(< ~counter~0 88)} is VALID [2022-04-28 14:08:00,569 INFO L290 TraceCheckUtils]: 9: Hoare triple {20891#true} assume true; {20891#true} is VALID [2022-04-28 14:08:00,569 INFO L290 TraceCheckUtils]: 8: Hoare triple {20891#true} assume !(0 == ~cond); {20891#true} is VALID [2022-04-28 14:08:00,569 INFO L290 TraceCheckUtils]: 7: Hoare triple {20891#true} ~cond := #in~cond; {20891#true} is VALID [2022-04-28 14:08:00,569 INFO L272 TraceCheckUtils]: 6: Hoare triple {21637#(< ~counter~0 88)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {20891#true} is VALID [2022-04-28 14:08:00,569 INFO L290 TraceCheckUtils]: 5: Hoare triple {21637#(< ~counter~0 88)} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {21637#(< ~counter~0 88)} is VALID [2022-04-28 14:08:00,570 INFO L272 TraceCheckUtils]: 4: Hoare triple {21637#(< ~counter~0 88)} call #t~ret7 := main(); {21637#(< ~counter~0 88)} is VALID [2022-04-28 14:08:00,570 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21637#(< ~counter~0 88)} {20891#true} #77#return; {21637#(< ~counter~0 88)} is VALID [2022-04-28 14:08:00,570 INFO L290 TraceCheckUtils]: 2: Hoare triple {21637#(< ~counter~0 88)} assume true; {21637#(< ~counter~0 88)} is VALID [2022-04-28 14:08:00,571 INFO L290 TraceCheckUtils]: 1: Hoare triple {20891#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(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {21637#(< ~counter~0 88)} is VALID [2022-04-28 14:08:00,571 INFO L272 TraceCheckUtils]: 0: Hoare triple {20891#true} call ULTIMATE.init(); {20891#true} is VALID [2022-04-28 14:08:00,571 INFO L134 CoverageAnalysis]: Checked inductivity of 642 backedges. 24 proven. 354 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2022-04-28 14:08:00,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:08:00,571 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2122258380] [2022-04-28 14:08:00,572 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 14:08:00,572 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [142656881] [2022-04-28 14:08:00,572 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [142656881] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 14:08:00,572 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 14:08:00,572 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 30 [2022-04-28 14:08:00,572 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:08:00,572 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [229439272] [2022-04-28 14:08:00,572 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [229439272] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:08:00,572 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:08:00,572 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-04-28 14:08:00,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1485280327] [2022-04-28 14:08:00,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:08:00,573 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 6.0) internal successors, (96), 15 states have internal predecessors, (96), 15 states have call successors, (16), 15 states have call predecessors, (16), 13 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) Word has length 126 [2022-04-28 14:08:00,573 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:08:00,573 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 16 states, 16 states have (on average 6.0) internal successors, (96), 15 states have internal predecessors, (96), 15 states have call successors, (16), 15 states have call predecessors, (16), 13 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-28 14:08:00,661 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 126 edges. 126 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:08:00,662 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-28 14:08:00,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:08:00,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-28 14:08:00,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=383, Invalid=487, Unknown=0, NotChecked=0, Total=870 [2022-04-28 14:08:00,662 INFO L87 Difference]: Start difference. First operand 164 states and 202 transitions. Second operand has 16 states, 16 states have (on average 6.0) internal successors, (96), 15 states have internal predecessors, (96), 15 states have call successors, (16), 15 states have call predecessors, (16), 13 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-28 14:08:01,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:08:01,391 INFO L93 Difference]: Finished difference Result 183 states and 225 transitions. [2022-04-28 14:08:01,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-04-28 14:08:01,391 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 6.0) internal successors, (96), 15 states have internal predecessors, (96), 15 states have call successors, (16), 15 states have call predecessors, (16), 13 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) Word has length 126 [2022-04-28 14:08:01,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:08:01,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 6.0) internal successors, (96), 15 states have internal predecessors, (96), 15 states have call successors, (16), 15 states have call predecessors, (16), 13 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-28 14:08:01,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 211 transitions. [2022-04-28 14:08:01,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 6.0) internal successors, (96), 15 states have internal predecessors, (96), 15 states have call successors, (16), 15 states have call predecessors, (16), 13 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-28 14:08:01,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 211 transitions. [2022-04-28 14:08:01,397 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 28 states and 211 transitions. [2022-04-28 14:08:01,579 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 211 edges. 211 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:08:01,581 INFO L225 Difference]: With dead ends: 183 [2022-04-28 14:08:01,582 INFO L226 Difference]: Without dead ends: 175 [2022-04-28 14:08:01,582 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 263 GetRequests, 223 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=731, Invalid=991, Unknown=0, NotChecked=0, Total=1722 [2022-04-28 14:08:01,582 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 121 mSDsluCounter, 204 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 246 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 14:08:01,583 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 246 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 14:08:01,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2022-04-28 14:08:01,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 175. [2022-04-28 14:08:01,882 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:08:01,882 INFO L82 GeneralOperation]: Start isEquivalent. First operand 175 states. Second operand has 175 states, 138 states have (on average 1.3043478260869565) internal successors, (180), 139 states have internal predecessors, (180), 19 states have call successors, (19), 18 states have call predecessors, (19), 17 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-28 14:08:01,882 INFO L74 IsIncluded]: Start isIncluded. First operand 175 states. Second operand has 175 states, 138 states have (on average 1.3043478260869565) internal successors, (180), 139 states have internal predecessors, (180), 19 states have call successors, (19), 18 states have call predecessors, (19), 17 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-28 14:08:01,883 INFO L87 Difference]: Start difference. First operand 175 states. Second operand has 175 states, 138 states have (on average 1.3043478260869565) internal successors, (180), 139 states have internal predecessors, (180), 19 states have call successors, (19), 18 states have call predecessors, (19), 17 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-28 14:08:01,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:08:01,885 INFO L93 Difference]: Finished difference Result 175 states and 216 transitions. [2022-04-28 14:08:01,885 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 216 transitions. [2022-04-28 14:08:01,886 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:08:01,886 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:08:01,886 INFO L74 IsIncluded]: Start isIncluded. First operand has 175 states, 138 states have (on average 1.3043478260869565) internal successors, (180), 139 states have internal predecessors, (180), 19 states have call successors, (19), 18 states have call predecessors, (19), 17 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand 175 states. [2022-04-28 14:08:01,886 INFO L87 Difference]: Start difference. First operand has 175 states, 138 states have (on average 1.3043478260869565) internal successors, (180), 139 states have internal predecessors, (180), 19 states have call successors, (19), 18 states have call predecessors, (19), 17 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand 175 states. [2022-04-28 14:08:01,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:08:01,889 INFO L93 Difference]: Finished difference Result 175 states and 216 transitions. [2022-04-28 14:08:01,889 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 216 transitions. [2022-04-28 14:08:01,889 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:08:01,889 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:08:01,890 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:08:01,890 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:08:01,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 138 states have (on average 1.3043478260869565) internal successors, (180), 139 states have internal predecessors, (180), 19 states have call successors, (19), 18 states have call predecessors, (19), 17 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-28 14:08:01,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 216 transitions. [2022-04-28 14:08:01,893 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 216 transitions. Word has length 126 [2022-04-28 14:08:01,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:08:01,893 INFO L495 AbstractCegarLoop]: Abstraction has 175 states and 216 transitions. [2022-04-28 14:08:01,893 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 6.0) internal successors, (96), 15 states have internal predecessors, (96), 15 states have call successors, (16), 15 states have call predecessors, (16), 13 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-28 14:08:01,893 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 175 states and 216 transitions. [2022-04-28 14:08:28,247 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 216 edges. 204 inductive. 0 not inductive. 12 times theorem prover too weak to decide inductivity. [2022-04-28 14:08:28,247 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 216 transitions. [2022-04-28 14:08:28,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2022-04-28 14:08:28,248 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:08:28,248 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 13, 13, 13, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 14:08:28,265 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Ended with exit code 0 [2022-04-28 14:08:28,448 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-04-28 14:08:28,448 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:08:28,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:08:28,449 INFO L85 PathProgramCache]: Analyzing trace with hash -1923626174, now seen corresponding path program 25 times [2022-04-28 14:08:28,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:08:28,449 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [401865306] [2022-04-28 14:08:34,499 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 14:08:34,499 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 14:08:34,499 INFO L85 PathProgramCache]: Analyzing trace with hash -1923626174, now seen corresponding path program 26 times [2022-04-28 14:08:34,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:08:34,499 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1621436515] [2022-04-28 14:08:34,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:08:34,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:08:34,516 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 14:08:34,517 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [682345027] [2022-04-28 14:08:34,517 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 14:08:34,517 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 14:08:34,517 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 14:08:34,520 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 14:08:34,521 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2022-04-28 14:08:34,602 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 14:08:34,602 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 14:08:34,604 INFO L263 TraceCheckSpWp]: Trace formula consists of 424 conjuncts, 31 conjunts are in the unsatisfiable core [2022-04-28 14:08:34,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:08:34,636 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 14:08:35,278 INFO L272 TraceCheckUtils]: 0: Hoare triple {22766#true} call ULTIMATE.init(); {22766#true} is VALID [2022-04-28 14:08:35,279 INFO L290 TraceCheckUtils]: 1: Hoare triple {22766#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(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {22774#(<= ~counter~0 0)} is VALID [2022-04-28 14:08:35,279 INFO L290 TraceCheckUtils]: 2: Hoare triple {22774#(<= ~counter~0 0)} assume true; {22774#(<= ~counter~0 0)} is VALID [2022-04-28 14:08:35,279 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22774#(<= ~counter~0 0)} {22766#true} #77#return; {22774#(<= ~counter~0 0)} is VALID [2022-04-28 14:08:35,280 INFO L272 TraceCheckUtils]: 4: Hoare triple {22774#(<= ~counter~0 0)} call #t~ret7 := main(); {22774#(<= ~counter~0 0)} is VALID [2022-04-28 14:08:35,280 INFO L290 TraceCheckUtils]: 5: Hoare triple {22774#(<= ~counter~0 0)} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {22774#(<= ~counter~0 0)} is VALID [2022-04-28 14:08:35,280 INFO L272 TraceCheckUtils]: 6: Hoare triple {22774#(<= ~counter~0 0)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {22774#(<= ~counter~0 0)} is VALID [2022-04-28 14:08:35,281 INFO L290 TraceCheckUtils]: 7: Hoare triple {22774#(<= ~counter~0 0)} ~cond := #in~cond; {22774#(<= ~counter~0 0)} is VALID [2022-04-28 14:08:35,281 INFO L290 TraceCheckUtils]: 8: Hoare triple {22774#(<= ~counter~0 0)} assume !(0 == ~cond); {22774#(<= ~counter~0 0)} is VALID [2022-04-28 14:08:35,281 INFO L290 TraceCheckUtils]: 9: Hoare triple {22774#(<= ~counter~0 0)} assume true; {22774#(<= ~counter~0 0)} is VALID [2022-04-28 14:08:35,281 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {22774#(<= ~counter~0 0)} {22774#(<= ~counter~0 0)} #69#return; {22774#(<= ~counter~0 0)} is VALID [2022-04-28 14:08:35,282 INFO L290 TraceCheckUtils]: 11: Hoare triple {22774#(<= ~counter~0 0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {22774#(<= ~counter~0 0)} is VALID [2022-04-28 14:08:35,282 INFO L290 TraceCheckUtils]: 12: Hoare triple {22774#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {22808#(<= ~counter~0 1)} is VALID [2022-04-28 14:08:35,283 INFO L290 TraceCheckUtils]: 13: Hoare triple {22808#(<= ~counter~0 1)} assume !!(#t~post6 < 100);havoc #t~post6; {22808#(<= ~counter~0 1)} is VALID [2022-04-28 14:08:35,283 INFO L272 TraceCheckUtils]: 14: Hoare triple {22808#(<= ~counter~0 1)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {22808#(<= ~counter~0 1)} is VALID [2022-04-28 14:08:35,283 INFO L290 TraceCheckUtils]: 15: Hoare triple {22808#(<= ~counter~0 1)} ~cond := #in~cond; {22808#(<= ~counter~0 1)} is VALID [2022-04-28 14:08:35,284 INFO L290 TraceCheckUtils]: 16: Hoare triple {22808#(<= ~counter~0 1)} assume !(0 == ~cond); {22808#(<= ~counter~0 1)} is VALID [2022-04-28 14:08:35,284 INFO L290 TraceCheckUtils]: 17: Hoare triple {22808#(<= ~counter~0 1)} assume true; {22808#(<= ~counter~0 1)} is VALID [2022-04-28 14:08:35,284 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {22808#(<= ~counter~0 1)} {22808#(<= ~counter~0 1)} #71#return; {22808#(<= ~counter~0 1)} is VALID [2022-04-28 14:08:35,285 INFO L290 TraceCheckUtils]: 19: Hoare triple {22808#(<= ~counter~0 1)} assume !!(0 != ~a~0 && 0 != ~b~0); {22808#(<= ~counter~0 1)} is VALID [2022-04-28 14:08:35,285 INFO L290 TraceCheckUtils]: 20: Hoare triple {22808#(<= ~counter~0 1)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {22808#(<= ~counter~0 1)} is VALID [2022-04-28 14:08:35,285 INFO L290 TraceCheckUtils]: 21: Hoare triple {22808#(<= ~counter~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {22836#(<= ~counter~0 2)} is VALID [2022-04-28 14:08:35,286 INFO L290 TraceCheckUtils]: 22: Hoare triple {22836#(<= ~counter~0 2)} assume !!(#t~post6 < 100);havoc #t~post6; {22836#(<= ~counter~0 2)} is VALID [2022-04-28 14:08:35,286 INFO L272 TraceCheckUtils]: 23: Hoare triple {22836#(<= ~counter~0 2)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {22836#(<= ~counter~0 2)} is VALID [2022-04-28 14:08:35,286 INFO L290 TraceCheckUtils]: 24: Hoare triple {22836#(<= ~counter~0 2)} ~cond := #in~cond; {22836#(<= ~counter~0 2)} is VALID [2022-04-28 14:08:35,287 INFO L290 TraceCheckUtils]: 25: Hoare triple {22836#(<= ~counter~0 2)} assume !(0 == ~cond); {22836#(<= ~counter~0 2)} is VALID [2022-04-28 14:08:35,287 INFO L290 TraceCheckUtils]: 26: Hoare triple {22836#(<= ~counter~0 2)} assume true; {22836#(<= ~counter~0 2)} is VALID [2022-04-28 14:08:35,287 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {22836#(<= ~counter~0 2)} {22836#(<= ~counter~0 2)} #71#return; {22836#(<= ~counter~0 2)} is VALID [2022-04-28 14:08:35,288 INFO L290 TraceCheckUtils]: 28: Hoare triple {22836#(<= ~counter~0 2)} assume !!(0 != ~a~0 && 0 != ~b~0); {22836#(<= ~counter~0 2)} is VALID [2022-04-28 14:08:35,288 INFO L290 TraceCheckUtils]: 29: Hoare triple {22836#(<= ~counter~0 2)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {22836#(<= ~counter~0 2)} is VALID [2022-04-28 14:08:35,288 INFO L290 TraceCheckUtils]: 30: Hoare triple {22836#(<= ~counter~0 2)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {22864#(<= ~counter~0 3)} is VALID [2022-04-28 14:08:35,289 INFO L290 TraceCheckUtils]: 31: Hoare triple {22864#(<= ~counter~0 3)} assume !!(#t~post6 < 100);havoc #t~post6; {22864#(<= ~counter~0 3)} is VALID [2022-04-28 14:08:35,289 INFO L272 TraceCheckUtils]: 32: Hoare triple {22864#(<= ~counter~0 3)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {22864#(<= ~counter~0 3)} is VALID [2022-04-28 14:08:35,289 INFO L290 TraceCheckUtils]: 33: Hoare triple {22864#(<= ~counter~0 3)} ~cond := #in~cond; {22864#(<= ~counter~0 3)} is VALID [2022-04-28 14:08:35,290 INFO L290 TraceCheckUtils]: 34: Hoare triple {22864#(<= ~counter~0 3)} assume !(0 == ~cond); {22864#(<= ~counter~0 3)} is VALID [2022-04-28 14:08:35,290 INFO L290 TraceCheckUtils]: 35: Hoare triple {22864#(<= ~counter~0 3)} assume true; {22864#(<= ~counter~0 3)} is VALID [2022-04-28 14:08:35,290 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {22864#(<= ~counter~0 3)} {22864#(<= ~counter~0 3)} #71#return; {22864#(<= ~counter~0 3)} is VALID [2022-04-28 14:08:35,291 INFO L290 TraceCheckUtils]: 37: Hoare triple {22864#(<= ~counter~0 3)} assume !!(0 != ~a~0 && 0 != ~b~0); {22864#(<= ~counter~0 3)} is VALID [2022-04-28 14:08:35,291 INFO L290 TraceCheckUtils]: 38: Hoare triple {22864#(<= ~counter~0 3)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {22864#(<= ~counter~0 3)} is VALID [2022-04-28 14:08:35,291 INFO L290 TraceCheckUtils]: 39: Hoare triple {22864#(<= ~counter~0 3)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {22892#(<= ~counter~0 4)} is VALID [2022-04-28 14:08:35,292 INFO L290 TraceCheckUtils]: 40: Hoare triple {22892#(<= ~counter~0 4)} assume !!(#t~post6 < 100);havoc #t~post6; {22892#(<= ~counter~0 4)} is VALID [2022-04-28 14:08:35,292 INFO L272 TraceCheckUtils]: 41: Hoare triple {22892#(<= ~counter~0 4)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {22892#(<= ~counter~0 4)} is VALID [2022-04-28 14:08:35,292 INFO L290 TraceCheckUtils]: 42: Hoare triple {22892#(<= ~counter~0 4)} ~cond := #in~cond; {22892#(<= ~counter~0 4)} is VALID [2022-04-28 14:08:35,293 INFO L290 TraceCheckUtils]: 43: Hoare triple {22892#(<= ~counter~0 4)} assume !(0 == ~cond); {22892#(<= ~counter~0 4)} is VALID [2022-04-28 14:08:35,293 INFO L290 TraceCheckUtils]: 44: Hoare triple {22892#(<= ~counter~0 4)} assume true; {22892#(<= ~counter~0 4)} is VALID [2022-04-28 14:08:35,293 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {22892#(<= ~counter~0 4)} {22892#(<= ~counter~0 4)} #71#return; {22892#(<= ~counter~0 4)} is VALID [2022-04-28 14:08:35,294 INFO L290 TraceCheckUtils]: 46: Hoare triple {22892#(<= ~counter~0 4)} assume !!(0 != ~a~0 && 0 != ~b~0); {22892#(<= ~counter~0 4)} is VALID [2022-04-28 14:08:35,294 INFO L290 TraceCheckUtils]: 47: Hoare triple {22892#(<= ~counter~0 4)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {22892#(<= ~counter~0 4)} is VALID [2022-04-28 14:08:35,294 INFO L290 TraceCheckUtils]: 48: Hoare triple {22892#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {22920#(<= ~counter~0 5)} is VALID [2022-04-28 14:08:35,295 INFO L290 TraceCheckUtils]: 49: Hoare triple {22920#(<= ~counter~0 5)} assume !!(#t~post6 < 100);havoc #t~post6; {22920#(<= ~counter~0 5)} is VALID [2022-04-28 14:08:35,295 INFO L272 TraceCheckUtils]: 50: Hoare triple {22920#(<= ~counter~0 5)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {22920#(<= ~counter~0 5)} is VALID [2022-04-28 14:08:35,295 INFO L290 TraceCheckUtils]: 51: Hoare triple {22920#(<= ~counter~0 5)} ~cond := #in~cond; {22920#(<= ~counter~0 5)} is VALID [2022-04-28 14:08:35,296 INFO L290 TraceCheckUtils]: 52: Hoare triple {22920#(<= ~counter~0 5)} assume !(0 == ~cond); {22920#(<= ~counter~0 5)} is VALID [2022-04-28 14:08:35,296 INFO L290 TraceCheckUtils]: 53: Hoare triple {22920#(<= ~counter~0 5)} assume true; {22920#(<= ~counter~0 5)} is VALID [2022-04-28 14:08:35,296 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {22920#(<= ~counter~0 5)} {22920#(<= ~counter~0 5)} #71#return; {22920#(<= ~counter~0 5)} is VALID [2022-04-28 14:08:35,297 INFO L290 TraceCheckUtils]: 55: Hoare triple {22920#(<= ~counter~0 5)} assume !!(0 != ~a~0 && 0 != ~b~0); {22920#(<= ~counter~0 5)} is VALID [2022-04-28 14:08:35,297 INFO L290 TraceCheckUtils]: 56: Hoare triple {22920#(<= ~counter~0 5)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {22920#(<= ~counter~0 5)} is VALID [2022-04-28 14:08:35,297 INFO L290 TraceCheckUtils]: 57: Hoare triple {22920#(<= ~counter~0 5)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {22948#(<= ~counter~0 6)} is VALID [2022-04-28 14:08:35,298 INFO L290 TraceCheckUtils]: 58: Hoare triple {22948#(<= ~counter~0 6)} assume !!(#t~post6 < 100);havoc #t~post6; {22948#(<= ~counter~0 6)} is VALID [2022-04-28 14:08:35,298 INFO L272 TraceCheckUtils]: 59: Hoare triple {22948#(<= ~counter~0 6)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {22948#(<= ~counter~0 6)} is VALID [2022-04-28 14:08:35,298 INFO L290 TraceCheckUtils]: 60: Hoare triple {22948#(<= ~counter~0 6)} ~cond := #in~cond; {22948#(<= ~counter~0 6)} is VALID [2022-04-28 14:08:35,299 INFO L290 TraceCheckUtils]: 61: Hoare triple {22948#(<= ~counter~0 6)} assume !(0 == ~cond); {22948#(<= ~counter~0 6)} is VALID [2022-04-28 14:08:35,299 INFO L290 TraceCheckUtils]: 62: Hoare triple {22948#(<= ~counter~0 6)} assume true; {22948#(<= ~counter~0 6)} is VALID [2022-04-28 14:08:35,299 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {22948#(<= ~counter~0 6)} {22948#(<= ~counter~0 6)} #71#return; {22948#(<= ~counter~0 6)} is VALID [2022-04-28 14:08:35,319 INFO L290 TraceCheckUtils]: 64: Hoare triple {22948#(<= ~counter~0 6)} assume !!(0 != ~a~0 && 0 != ~b~0); {22948#(<= ~counter~0 6)} is VALID [2022-04-28 14:08:35,320 INFO L290 TraceCheckUtils]: 65: Hoare triple {22948#(<= ~counter~0 6)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {22948#(<= ~counter~0 6)} is VALID [2022-04-28 14:08:35,321 INFO L290 TraceCheckUtils]: 66: Hoare triple {22948#(<= ~counter~0 6)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {22976#(<= ~counter~0 7)} is VALID [2022-04-28 14:08:35,321 INFO L290 TraceCheckUtils]: 67: Hoare triple {22976#(<= ~counter~0 7)} assume !!(#t~post6 < 100);havoc #t~post6; {22976#(<= ~counter~0 7)} is VALID [2022-04-28 14:08:35,322 INFO L272 TraceCheckUtils]: 68: Hoare triple {22976#(<= ~counter~0 7)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {22976#(<= ~counter~0 7)} is VALID [2022-04-28 14:08:35,323 INFO L290 TraceCheckUtils]: 69: Hoare triple {22976#(<= ~counter~0 7)} ~cond := #in~cond; {22976#(<= ~counter~0 7)} is VALID [2022-04-28 14:08:35,323 INFO L290 TraceCheckUtils]: 70: Hoare triple {22976#(<= ~counter~0 7)} assume !(0 == ~cond); {22976#(<= ~counter~0 7)} is VALID [2022-04-28 14:08:35,324 INFO L290 TraceCheckUtils]: 71: Hoare triple {22976#(<= ~counter~0 7)} assume true; {22976#(<= ~counter~0 7)} is VALID [2022-04-28 14:08:35,325 INFO L284 TraceCheckUtils]: 72: Hoare quadruple {22976#(<= ~counter~0 7)} {22976#(<= ~counter~0 7)} #71#return; {22976#(<= ~counter~0 7)} is VALID [2022-04-28 14:08:35,325 INFO L290 TraceCheckUtils]: 73: Hoare triple {22976#(<= ~counter~0 7)} assume !!(0 != ~a~0 && 0 != ~b~0); {22976#(<= ~counter~0 7)} is VALID [2022-04-28 14:08:35,326 INFO L290 TraceCheckUtils]: 74: Hoare triple {22976#(<= ~counter~0 7)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {22976#(<= ~counter~0 7)} is VALID [2022-04-28 14:08:35,327 INFO L290 TraceCheckUtils]: 75: Hoare triple {22976#(<= ~counter~0 7)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {23004#(<= ~counter~0 8)} is VALID [2022-04-28 14:08:35,327 INFO L290 TraceCheckUtils]: 76: Hoare triple {23004#(<= ~counter~0 8)} assume !!(#t~post6 < 100);havoc #t~post6; {23004#(<= ~counter~0 8)} is VALID [2022-04-28 14:08:35,328 INFO L272 TraceCheckUtils]: 77: Hoare triple {23004#(<= ~counter~0 8)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {23004#(<= ~counter~0 8)} is VALID [2022-04-28 14:08:35,328 INFO L290 TraceCheckUtils]: 78: Hoare triple {23004#(<= ~counter~0 8)} ~cond := #in~cond; {23004#(<= ~counter~0 8)} is VALID [2022-04-28 14:08:35,328 INFO L290 TraceCheckUtils]: 79: Hoare triple {23004#(<= ~counter~0 8)} assume !(0 == ~cond); {23004#(<= ~counter~0 8)} is VALID [2022-04-28 14:08:35,328 INFO L290 TraceCheckUtils]: 80: Hoare triple {23004#(<= ~counter~0 8)} assume true; {23004#(<= ~counter~0 8)} is VALID [2022-04-28 14:08:35,329 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {23004#(<= ~counter~0 8)} {23004#(<= ~counter~0 8)} #71#return; {23004#(<= ~counter~0 8)} is VALID [2022-04-28 14:08:35,329 INFO L290 TraceCheckUtils]: 82: Hoare triple {23004#(<= ~counter~0 8)} assume !!(0 != ~a~0 && 0 != ~b~0); {23004#(<= ~counter~0 8)} is VALID [2022-04-28 14:08:35,329 INFO L290 TraceCheckUtils]: 83: Hoare triple {23004#(<= ~counter~0 8)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {23004#(<= ~counter~0 8)} is VALID [2022-04-28 14:08:35,330 INFO L290 TraceCheckUtils]: 84: Hoare triple {23004#(<= ~counter~0 8)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {23032#(<= ~counter~0 9)} is VALID [2022-04-28 14:08:35,330 INFO L290 TraceCheckUtils]: 85: Hoare triple {23032#(<= ~counter~0 9)} assume !!(#t~post6 < 100);havoc #t~post6; {23032#(<= ~counter~0 9)} is VALID [2022-04-28 14:08:35,331 INFO L272 TraceCheckUtils]: 86: Hoare triple {23032#(<= ~counter~0 9)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {23032#(<= ~counter~0 9)} is VALID [2022-04-28 14:08:35,331 INFO L290 TraceCheckUtils]: 87: Hoare triple {23032#(<= ~counter~0 9)} ~cond := #in~cond; {23032#(<= ~counter~0 9)} is VALID [2022-04-28 14:08:35,331 INFO L290 TraceCheckUtils]: 88: Hoare triple {23032#(<= ~counter~0 9)} assume !(0 == ~cond); {23032#(<= ~counter~0 9)} is VALID [2022-04-28 14:08:35,331 INFO L290 TraceCheckUtils]: 89: Hoare triple {23032#(<= ~counter~0 9)} assume true; {23032#(<= ~counter~0 9)} is VALID [2022-04-28 14:08:35,332 INFO L284 TraceCheckUtils]: 90: Hoare quadruple {23032#(<= ~counter~0 9)} {23032#(<= ~counter~0 9)} #71#return; {23032#(<= ~counter~0 9)} is VALID [2022-04-28 14:08:35,332 INFO L290 TraceCheckUtils]: 91: Hoare triple {23032#(<= ~counter~0 9)} assume !!(0 != ~a~0 && 0 != ~b~0); {23032#(<= ~counter~0 9)} is VALID [2022-04-28 14:08:35,332 INFO L290 TraceCheckUtils]: 92: Hoare triple {23032#(<= ~counter~0 9)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {23032#(<= ~counter~0 9)} is VALID [2022-04-28 14:08:35,333 INFO L290 TraceCheckUtils]: 93: Hoare triple {23032#(<= ~counter~0 9)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {23060#(<= ~counter~0 10)} is VALID [2022-04-28 14:08:35,333 INFO L290 TraceCheckUtils]: 94: Hoare triple {23060#(<= ~counter~0 10)} assume !!(#t~post6 < 100);havoc #t~post6; {23060#(<= ~counter~0 10)} is VALID [2022-04-28 14:08:35,334 INFO L272 TraceCheckUtils]: 95: Hoare triple {23060#(<= ~counter~0 10)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {23060#(<= ~counter~0 10)} is VALID [2022-04-28 14:08:35,334 INFO L290 TraceCheckUtils]: 96: Hoare triple {23060#(<= ~counter~0 10)} ~cond := #in~cond; {23060#(<= ~counter~0 10)} is VALID [2022-04-28 14:08:35,334 INFO L290 TraceCheckUtils]: 97: Hoare triple {23060#(<= ~counter~0 10)} assume !(0 == ~cond); {23060#(<= ~counter~0 10)} is VALID [2022-04-28 14:08:35,334 INFO L290 TraceCheckUtils]: 98: Hoare triple {23060#(<= ~counter~0 10)} assume true; {23060#(<= ~counter~0 10)} is VALID [2022-04-28 14:08:35,335 INFO L284 TraceCheckUtils]: 99: Hoare quadruple {23060#(<= ~counter~0 10)} {23060#(<= ~counter~0 10)} #71#return; {23060#(<= ~counter~0 10)} is VALID [2022-04-28 14:08:35,335 INFO L290 TraceCheckUtils]: 100: Hoare triple {23060#(<= ~counter~0 10)} assume !!(0 != ~a~0 && 0 != ~b~0); {23060#(<= ~counter~0 10)} is VALID [2022-04-28 14:08:35,336 INFO L290 TraceCheckUtils]: 101: Hoare triple {23060#(<= ~counter~0 10)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {23060#(<= ~counter~0 10)} is VALID [2022-04-28 14:08:35,336 INFO L290 TraceCheckUtils]: 102: Hoare triple {23060#(<= ~counter~0 10)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {23088#(<= ~counter~0 11)} is VALID [2022-04-28 14:08:35,336 INFO L290 TraceCheckUtils]: 103: Hoare triple {23088#(<= ~counter~0 11)} assume !!(#t~post6 < 100);havoc #t~post6; {23088#(<= ~counter~0 11)} is VALID [2022-04-28 14:08:35,337 INFO L272 TraceCheckUtils]: 104: Hoare triple {23088#(<= ~counter~0 11)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {23088#(<= ~counter~0 11)} is VALID [2022-04-28 14:08:35,337 INFO L290 TraceCheckUtils]: 105: Hoare triple {23088#(<= ~counter~0 11)} ~cond := #in~cond; {23088#(<= ~counter~0 11)} is VALID [2022-04-28 14:08:35,337 INFO L290 TraceCheckUtils]: 106: Hoare triple {23088#(<= ~counter~0 11)} assume !(0 == ~cond); {23088#(<= ~counter~0 11)} is VALID [2022-04-28 14:08:35,338 INFO L290 TraceCheckUtils]: 107: Hoare triple {23088#(<= ~counter~0 11)} assume true; {23088#(<= ~counter~0 11)} is VALID [2022-04-28 14:08:35,338 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {23088#(<= ~counter~0 11)} {23088#(<= ~counter~0 11)} #71#return; {23088#(<= ~counter~0 11)} is VALID [2022-04-28 14:08:35,338 INFO L290 TraceCheckUtils]: 109: Hoare triple {23088#(<= ~counter~0 11)} assume !!(0 != ~a~0 && 0 != ~b~0); {23088#(<= ~counter~0 11)} is VALID [2022-04-28 14:08:35,339 INFO L290 TraceCheckUtils]: 110: Hoare triple {23088#(<= ~counter~0 11)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {23088#(<= ~counter~0 11)} is VALID [2022-04-28 14:08:35,339 INFO L290 TraceCheckUtils]: 111: Hoare triple {23088#(<= ~counter~0 11)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {23116#(<= ~counter~0 12)} is VALID [2022-04-28 14:08:35,339 INFO L290 TraceCheckUtils]: 112: Hoare triple {23116#(<= ~counter~0 12)} assume !!(#t~post6 < 100);havoc #t~post6; {23116#(<= ~counter~0 12)} is VALID [2022-04-28 14:08:35,340 INFO L272 TraceCheckUtils]: 113: Hoare triple {23116#(<= ~counter~0 12)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {23116#(<= ~counter~0 12)} is VALID [2022-04-28 14:08:35,340 INFO L290 TraceCheckUtils]: 114: Hoare triple {23116#(<= ~counter~0 12)} ~cond := #in~cond; {23116#(<= ~counter~0 12)} is VALID [2022-04-28 14:08:35,340 INFO L290 TraceCheckUtils]: 115: Hoare triple {23116#(<= ~counter~0 12)} assume !(0 == ~cond); {23116#(<= ~counter~0 12)} is VALID [2022-04-28 14:08:35,341 INFO L290 TraceCheckUtils]: 116: Hoare triple {23116#(<= ~counter~0 12)} assume true; {23116#(<= ~counter~0 12)} is VALID [2022-04-28 14:08:35,341 INFO L284 TraceCheckUtils]: 117: Hoare quadruple {23116#(<= ~counter~0 12)} {23116#(<= ~counter~0 12)} #71#return; {23116#(<= ~counter~0 12)} is VALID [2022-04-28 14:08:35,343 INFO L290 TraceCheckUtils]: 118: Hoare triple {23116#(<= ~counter~0 12)} assume !!(0 != ~a~0 && 0 != ~b~0); {23116#(<= ~counter~0 12)} is VALID [2022-04-28 14:08:35,343 INFO L290 TraceCheckUtils]: 119: Hoare triple {23116#(<= ~counter~0 12)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {23116#(<= ~counter~0 12)} is VALID [2022-04-28 14:08:35,344 INFO L290 TraceCheckUtils]: 120: Hoare triple {23116#(<= ~counter~0 12)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {23144#(<= ~counter~0 13)} is VALID [2022-04-28 14:08:35,344 INFO L290 TraceCheckUtils]: 121: Hoare triple {23144#(<= ~counter~0 13)} assume !!(#t~post6 < 100);havoc #t~post6; {23144#(<= ~counter~0 13)} is VALID [2022-04-28 14:08:35,345 INFO L272 TraceCheckUtils]: 122: Hoare triple {23144#(<= ~counter~0 13)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {23144#(<= ~counter~0 13)} is VALID [2022-04-28 14:08:35,345 INFO L290 TraceCheckUtils]: 123: Hoare triple {23144#(<= ~counter~0 13)} ~cond := #in~cond; {23144#(<= ~counter~0 13)} is VALID [2022-04-28 14:08:35,346 INFO L290 TraceCheckUtils]: 124: Hoare triple {23144#(<= ~counter~0 13)} assume !(0 == ~cond); {23144#(<= ~counter~0 13)} is VALID [2022-04-28 14:08:35,346 INFO L290 TraceCheckUtils]: 125: Hoare triple {23144#(<= ~counter~0 13)} assume true; {23144#(<= ~counter~0 13)} is VALID [2022-04-28 14:08:35,347 INFO L284 TraceCheckUtils]: 126: Hoare quadruple {23144#(<= ~counter~0 13)} {23144#(<= ~counter~0 13)} #71#return; {23144#(<= ~counter~0 13)} is VALID [2022-04-28 14:08:35,347 INFO L290 TraceCheckUtils]: 127: Hoare triple {23144#(<= ~counter~0 13)} assume !!(0 != ~a~0 && 0 != ~b~0); {23144#(<= ~counter~0 13)} is VALID [2022-04-28 14:08:35,347 INFO L290 TraceCheckUtils]: 128: Hoare triple {23144#(<= ~counter~0 13)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {23144#(<= ~counter~0 13)} is VALID [2022-04-28 14:08:35,348 INFO L290 TraceCheckUtils]: 129: Hoare triple {23144#(<= ~counter~0 13)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {23172#(<= |main_#t~post6| 13)} is VALID [2022-04-28 14:08:35,348 INFO L290 TraceCheckUtils]: 130: Hoare triple {23172#(<= |main_#t~post6| 13)} assume !(#t~post6 < 100);havoc #t~post6; {22767#false} is VALID [2022-04-28 14:08:35,348 INFO L272 TraceCheckUtils]: 131: Hoare triple {22767#false} call __VERIFIER_assert((if ~q~0 == ~x~0 * ~y~0 then 1 else 0)); {22767#false} is VALID [2022-04-28 14:08:35,348 INFO L290 TraceCheckUtils]: 132: Hoare triple {22767#false} ~cond := #in~cond; {22767#false} is VALID [2022-04-28 14:08:35,349 INFO L290 TraceCheckUtils]: 133: Hoare triple {22767#false} assume 0 == ~cond; {22767#false} is VALID [2022-04-28 14:08:35,349 INFO L290 TraceCheckUtils]: 134: Hoare triple {22767#false} assume !false; {22767#false} is VALID [2022-04-28 14:08:35,349 INFO L134 CoverageAnalysis]: Checked inductivity of 754 backedges. 26 proven. 728 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 14:08:35,349 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 14:08:36,135 INFO L290 TraceCheckUtils]: 134: Hoare triple {22767#false} assume !false; {22767#false} is VALID [2022-04-28 14:08:36,135 INFO L290 TraceCheckUtils]: 133: Hoare triple {22767#false} assume 0 == ~cond; {22767#false} is VALID [2022-04-28 14:08:36,135 INFO L290 TraceCheckUtils]: 132: Hoare triple {22767#false} ~cond := #in~cond; {22767#false} is VALID [2022-04-28 14:08:36,136 INFO L272 TraceCheckUtils]: 131: Hoare triple {22767#false} call __VERIFIER_assert((if ~q~0 == ~x~0 * ~y~0 then 1 else 0)); {22767#false} is VALID [2022-04-28 14:08:36,136 INFO L290 TraceCheckUtils]: 130: Hoare triple {23200#(< |main_#t~post6| 100)} assume !(#t~post6 < 100);havoc #t~post6; {22767#false} is VALID [2022-04-28 14:08:36,136 INFO L290 TraceCheckUtils]: 129: Hoare triple {23204#(< ~counter~0 100)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {23200#(< |main_#t~post6| 100)} is VALID [2022-04-28 14:08:36,137 INFO L290 TraceCheckUtils]: 128: Hoare triple {23204#(< ~counter~0 100)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {23204#(< ~counter~0 100)} is VALID [2022-04-28 14:08:36,137 INFO L290 TraceCheckUtils]: 127: Hoare triple {23204#(< ~counter~0 100)} assume !!(0 != ~a~0 && 0 != ~b~0); {23204#(< ~counter~0 100)} is VALID [2022-04-28 14:08:36,138 INFO L284 TraceCheckUtils]: 126: Hoare quadruple {22766#true} {23204#(< ~counter~0 100)} #71#return; {23204#(< ~counter~0 100)} is VALID [2022-04-28 14:08:36,138 INFO L290 TraceCheckUtils]: 125: Hoare triple {22766#true} assume true; {22766#true} is VALID [2022-04-28 14:08:36,138 INFO L290 TraceCheckUtils]: 124: Hoare triple {22766#true} assume !(0 == ~cond); {22766#true} is VALID [2022-04-28 14:08:36,138 INFO L290 TraceCheckUtils]: 123: Hoare triple {22766#true} ~cond := #in~cond; {22766#true} is VALID [2022-04-28 14:08:36,138 INFO L272 TraceCheckUtils]: 122: Hoare triple {23204#(< ~counter~0 100)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {22766#true} is VALID [2022-04-28 14:08:36,138 INFO L290 TraceCheckUtils]: 121: Hoare triple {23204#(< ~counter~0 100)} assume !!(#t~post6 < 100);havoc #t~post6; {23204#(< ~counter~0 100)} is VALID [2022-04-28 14:08:36,139 INFO L290 TraceCheckUtils]: 120: Hoare triple {23232#(< ~counter~0 99)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {23204#(< ~counter~0 100)} is VALID [2022-04-28 14:08:36,139 INFO L290 TraceCheckUtils]: 119: Hoare triple {23232#(< ~counter~0 99)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {23232#(< ~counter~0 99)} is VALID [2022-04-28 14:08:36,140 INFO L290 TraceCheckUtils]: 118: Hoare triple {23232#(< ~counter~0 99)} assume !!(0 != ~a~0 && 0 != ~b~0); {23232#(< ~counter~0 99)} is VALID [2022-04-28 14:08:36,140 INFO L284 TraceCheckUtils]: 117: Hoare quadruple {22766#true} {23232#(< ~counter~0 99)} #71#return; {23232#(< ~counter~0 99)} is VALID [2022-04-28 14:08:36,140 INFO L290 TraceCheckUtils]: 116: Hoare triple {22766#true} assume true; {22766#true} is VALID [2022-04-28 14:08:36,140 INFO L290 TraceCheckUtils]: 115: Hoare triple {22766#true} assume !(0 == ~cond); {22766#true} is VALID [2022-04-28 14:08:36,141 INFO L290 TraceCheckUtils]: 114: Hoare triple {22766#true} ~cond := #in~cond; {22766#true} is VALID [2022-04-28 14:08:36,141 INFO L272 TraceCheckUtils]: 113: Hoare triple {23232#(< ~counter~0 99)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {22766#true} is VALID [2022-04-28 14:08:36,141 INFO L290 TraceCheckUtils]: 112: Hoare triple {23232#(< ~counter~0 99)} assume !!(#t~post6 < 100);havoc #t~post6; {23232#(< ~counter~0 99)} is VALID [2022-04-28 14:08:36,141 INFO L290 TraceCheckUtils]: 111: Hoare triple {23260#(< ~counter~0 98)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {23232#(< ~counter~0 99)} is VALID [2022-04-28 14:08:36,142 INFO L290 TraceCheckUtils]: 110: Hoare triple {23260#(< ~counter~0 98)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {23260#(< ~counter~0 98)} is VALID [2022-04-28 14:08:36,142 INFO L290 TraceCheckUtils]: 109: Hoare triple {23260#(< ~counter~0 98)} assume !!(0 != ~a~0 && 0 != ~b~0); {23260#(< ~counter~0 98)} is VALID [2022-04-28 14:08:36,143 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {22766#true} {23260#(< ~counter~0 98)} #71#return; {23260#(< ~counter~0 98)} is VALID [2022-04-28 14:08:36,143 INFO L290 TraceCheckUtils]: 107: Hoare triple {22766#true} assume true; {22766#true} is VALID [2022-04-28 14:08:36,143 INFO L290 TraceCheckUtils]: 106: Hoare triple {22766#true} assume !(0 == ~cond); {22766#true} is VALID [2022-04-28 14:08:36,143 INFO L290 TraceCheckUtils]: 105: Hoare triple {22766#true} ~cond := #in~cond; {22766#true} is VALID [2022-04-28 14:08:36,143 INFO L272 TraceCheckUtils]: 104: Hoare triple {23260#(< ~counter~0 98)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {22766#true} is VALID [2022-04-28 14:08:36,143 INFO L290 TraceCheckUtils]: 103: Hoare triple {23260#(< ~counter~0 98)} assume !!(#t~post6 < 100);havoc #t~post6; {23260#(< ~counter~0 98)} is VALID [2022-04-28 14:08:36,144 INFO L290 TraceCheckUtils]: 102: Hoare triple {23288#(< ~counter~0 97)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {23260#(< ~counter~0 98)} is VALID [2022-04-28 14:08:36,144 INFO L290 TraceCheckUtils]: 101: Hoare triple {23288#(< ~counter~0 97)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {23288#(< ~counter~0 97)} is VALID [2022-04-28 14:08:36,145 INFO L290 TraceCheckUtils]: 100: Hoare triple {23288#(< ~counter~0 97)} assume !!(0 != ~a~0 && 0 != ~b~0); {23288#(< ~counter~0 97)} is VALID [2022-04-28 14:08:36,145 INFO L284 TraceCheckUtils]: 99: Hoare quadruple {22766#true} {23288#(< ~counter~0 97)} #71#return; {23288#(< ~counter~0 97)} is VALID [2022-04-28 14:08:36,145 INFO L290 TraceCheckUtils]: 98: Hoare triple {22766#true} assume true; {22766#true} is VALID [2022-04-28 14:08:36,145 INFO L290 TraceCheckUtils]: 97: Hoare triple {22766#true} assume !(0 == ~cond); {22766#true} is VALID [2022-04-28 14:08:36,145 INFO L290 TraceCheckUtils]: 96: Hoare triple {22766#true} ~cond := #in~cond; {22766#true} is VALID [2022-04-28 14:08:36,145 INFO L272 TraceCheckUtils]: 95: Hoare triple {23288#(< ~counter~0 97)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {22766#true} is VALID [2022-04-28 14:08:36,146 INFO L290 TraceCheckUtils]: 94: Hoare triple {23288#(< ~counter~0 97)} assume !!(#t~post6 < 100);havoc #t~post6; {23288#(< ~counter~0 97)} is VALID [2022-04-28 14:08:36,146 INFO L290 TraceCheckUtils]: 93: Hoare triple {23316#(< ~counter~0 96)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {23288#(< ~counter~0 97)} is VALID [2022-04-28 14:08:36,147 INFO L290 TraceCheckUtils]: 92: Hoare triple {23316#(< ~counter~0 96)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {23316#(< ~counter~0 96)} is VALID [2022-04-28 14:08:36,147 INFO L290 TraceCheckUtils]: 91: Hoare triple {23316#(< ~counter~0 96)} assume !!(0 != ~a~0 && 0 != ~b~0); {23316#(< ~counter~0 96)} is VALID [2022-04-28 14:08:36,148 INFO L284 TraceCheckUtils]: 90: Hoare quadruple {22766#true} {23316#(< ~counter~0 96)} #71#return; {23316#(< ~counter~0 96)} is VALID [2022-04-28 14:08:36,148 INFO L290 TraceCheckUtils]: 89: Hoare triple {22766#true} assume true; {22766#true} is VALID [2022-04-28 14:08:36,148 INFO L290 TraceCheckUtils]: 88: Hoare triple {22766#true} assume !(0 == ~cond); {22766#true} is VALID [2022-04-28 14:08:36,148 INFO L290 TraceCheckUtils]: 87: Hoare triple {22766#true} ~cond := #in~cond; {22766#true} is VALID [2022-04-28 14:08:36,148 INFO L272 TraceCheckUtils]: 86: Hoare triple {23316#(< ~counter~0 96)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {22766#true} is VALID [2022-04-28 14:08:36,148 INFO L290 TraceCheckUtils]: 85: Hoare triple {23316#(< ~counter~0 96)} assume !!(#t~post6 < 100);havoc #t~post6; {23316#(< ~counter~0 96)} is VALID [2022-04-28 14:08:36,149 INFO L290 TraceCheckUtils]: 84: Hoare triple {23344#(< ~counter~0 95)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {23316#(< ~counter~0 96)} is VALID [2022-04-28 14:08:36,149 INFO L290 TraceCheckUtils]: 83: Hoare triple {23344#(< ~counter~0 95)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {23344#(< ~counter~0 95)} is VALID [2022-04-28 14:08:36,149 INFO L290 TraceCheckUtils]: 82: Hoare triple {23344#(< ~counter~0 95)} assume !!(0 != ~a~0 && 0 != ~b~0); {23344#(< ~counter~0 95)} is VALID [2022-04-28 14:08:36,150 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {22766#true} {23344#(< ~counter~0 95)} #71#return; {23344#(< ~counter~0 95)} is VALID [2022-04-28 14:08:36,150 INFO L290 TraceCheckUtils]: 80: Hoare triple {22766#true} assume true; {22766#true} is VALID [2022-04-28 14:08:36,150 INFO L290 TraceCheckUtils]: 79: Hoare triple {22766#true} assume !(0 == ~cond); {22766#true} is VALID [2022-04-28 14:08:36,150 INFO L290 TraceCheckUtils]: 78: Hoare triple {22766#true} ~cond := #in~cond; {22766#true} is VALID [2022-04-28 14:08:36,150 INFO L272 TraceCheckUtils]: 77: Hoare triple {23344#(< ~counter~0 95)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {22766#true} is VALID [2022-04-28 14:08:36,151 INFO L290 TraceCheckUtils]: 76: Hoare triple {23344#(< ~counter~0 95)} assume !!(#t~post6 < 100);havoc #t~post6; {23344#(< ~counter~0 95)} is VALID [2022-04-28 14:08:36,151 INFO L290 TraceCheckUtils]: 75: Hoare triple {23372#(< ~counter~0 94)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {23344#(< ~counter~0 95)} is VALID [2022-04-28 14:08:36,152 INFO L290 TraceCheckUtils]: 74: Hoare triple {23372#(< ~counter~0 94)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {23372#(< ~counter~0 94)} is VALID [2022-04-28 14:08:36,152 INFO L290 TraceCheckUtils]: 73: Hoare triple {23372#(< ~counter~0 94)} assume !!(0 != ~a~0 && 0 != ~b~0); {23372#(< ~counter~0 94)} is VALID [2022-04-28 14:08:36,153 INFO L284 TraceCheckUtils]: 72: Hoare quadruple {22766#true} {23372#(< ~counter~0 94)} #71#return; {23372#(< ~counter~0 94)} is VALID [2022-04-28 14:08:36,153 INFO L290 TraceCheckUtils]: 71: Hoare triple {22766#true} assume true; {22766#true} is VALID [2022-04-28 14:08:36,153 INFO L290 TraceCheckUtils]: 70: Hoare triple {22766#true} assume !(0 == ~cond); {22766#true} is VALID [2022-04-28 14:08:36,153 INFO L290 TraceCheckUtils]: 69: Hoare triple {22766#true} ~cond := #in~cond; {22766#true} is VALID [2022-04-28 14:08:36,153 INFO L272 TraceCheckUtils]: 68: Hoare triple {23372#(< ~counter~0 94)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {22766#true} is VALID [2022-04-28 14:08:36,153 INFO L290 TraceCheckUtils]: 67: Hoare triple {23372#(< ~counter~0 94)} assume !!(#t~post6 < 100);havoc #t~post6; {23372#(< ~counter~0 94)} is VALID [2022-04-28 14:08:36,154 INFO L290 TraceCheckUtils]: 66: Hoare triple {23400#(< ~counter~0 93)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {23372#(< ~counter~0 94)} is VALID [2022-04-28 14:08:36,154 INFO L290 TraceCheckUtils]: 65: Hoare triple {23400#(< ~counter~0 93)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {23400#(< ~counter~0 93)} is VALID [2022-04-28 14:08:36,155 INFO L290 TraceCheckUtils]: 64: Hoare triple {23400#(< ~counter~0 93)} assume !!(0 != ~a~0 && 0 != ~b~0); {23400#(< ~counter~0 93)} is VALID [2022-04-28 14:08:36,155 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {22766#true} {23400#(< ~counter~0 93)} #71#return; {23400#(< ~counter~0 93)} is VALID [2022-04-28 14:08:36,155 INFO L290 TraceCheckUtils]: 62: Hoare triple {22766#true} assume true; {22766#true} is VALID [2022-04-28 14:08:36,155 INFO L290 TraceCheckUtils]: 61: Hoare triple {22766#true} assume !(0 == ~cond); {22766#true} is VALID [2022-04-28 14:08:36,155 INFO L290 TraceCheckUtils]: 60: Hoare triple {22766#true} ~cond := #in~cond; {22766#true} is VALID [2022-04-28 14:08:36,155 INFO L272 TraceCheckUtils]: 59: Hoare triple {23400#(< ~counter~0 93)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {22766#true} is VALID [2022-04-28 14:08:36,156 INFO L290 TraceCheckUtils]: 58: Hoare triple {23400#(< ~counter~0 93)} assume !!(#t~post6 < 100);havoc #t~post6; {23400#(< ~counter~0 93)} is VALID [2022-04-28 14:08:36,156 INFO L290 TraceCheckUtils]: 57: Hoare triple {23428#(< ~counter~0 92)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {23400#(< ~counter~0 93)} is VALID [2022-04-28 14:08:36,157 INFO L290 TraceCheckUtils]: 56: Hoare triple {23428#(< ~counter~0 92)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {23428#(< ~counter~0 92)} is VALID [2022-04-28 14:08:36,157 INFO L290 TraceCheckUtils]: 55: Hoare triple {23428#(< ~counter~0 92)} assume !!(0 != ~a~0 && 0 != ~b~0); {23428#(< ~counter~0 92)} is VALID [2022-04-28 14:08:36,158 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {22766#true} {23428#(< ~counter~0 92)} #71#return; {23428#(< ~counter~0 92)} is VALID [2022-04-28 14:08:36,158 INFO L290 TraceCheckUtils]: 53: Hoare triple {22766#true} assume true; {22766#true} is VALID [2022-04-28 14:08:36,158 INFO L290 TraceCheckUtils]: 52: Hoare triple {22766#true} assume !(0 == ~cond); {22766#true} is VALID [2022-04-28 14:08:36,158 INFO L290 TraceCheckUtils]: 51: Hoare triple {22766#true} ~cond := #in~cond; {22766#true} is VALID [2022-04-28 14:08:36,158 INFO L272 TraceCheckUtils]: 50: Hoare triple {23428#(< ~counter~0 92)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {22766#true} is VALID [2022-04-28 14:08:36,158 INFO L290 TraceCheckUtils]: 49: Hoare triple {23428#(< ~counter~0 92)} assume !!(#t~post6 < 100);havoc #t~post6; {23428#(< ~counter~0 92)} is VALID [2022-04-28 14:08:36,159 INFO L290 TraceCheckUtils]: 48: Hoare triple {23456#(< ~counter~0 91)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {23428#(< ~counter~0 92)} is VALID [2022-04-28 14:08:36,159 INFO L290 TraceCheckUtils]: 47: Hoare triple {23456#(< ~counter~0 91)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {23456#(< ~counter~0 91)} is VALID [2022-04-28 14:08:36,159 INFO L290 TraceCheckUtils]: 46: Hoare triple {23456#(< ~counter~0 91)} assume !!(0 != ~a~0 && 0 != ~b~0); {23456#(< ~counter~0 91)} is VALID [2022-04-28 14:08:36,160 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {22766#true} {23456#(< ~counter~0 91)} #71#return; {23456#(< ~counter~0 91)} is VALID [2022-04-28 14:08:36,160 INFO L290 TraceCheckUtils]: 44: Hoare triple {22766#true} assume true; {22766#true} is VALID [2022-04-28 14:08:36,160 INFO L290 TraceCheckUtils]: 43: Hoare triple {22766#true} assume !(0 == ~cond); {22766#true} is VALID [2022-04-28 14:08:36,160 INFO L290 TraceCheckUtils]: 42: Hoare triple {22766#true} ~cond := #in~cond; {22766#true} is VALID [2022-04-28 14:08:36,160 INFO L272 TraceCheckUtils]: 41: Hoare triple {23456#(< ~counter~0 91)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {22766#true} is VALID [2022-04-28 14:08:36,161 INFO L290 TraceCheckUtils]: 40: Hoare triple {23456#(< ~counter~0 91)} assume !!(#t~post6 < 100);havoc #t~post6; {23456#(< ~counter~0 91)} is VALID [2022-04-28 14:08:36,161 INFO L290 TraceCheckUtils]: 39: Hoare triple {23484#(< ~counter~0 90)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {23456#(< ~counter~0 91)} is VALID [2022-04-28 14:08:36,161 INFO L290 TraceCheckUtils]: 38: Hoare triple {23484#(< ~counter~0 90)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {23484#(< ~counter~0 90)} is VALID [2022-04-28 14:08:36,162 INFO L290 TraceCheckUtils]: 37: Hoare triple {23484#(< ~counter~0 90)} assume !!(0 != ~a~0 && 0 != ~b~0); {23484#(< ~counter~0 90)} is VALID [2022-04-28 14:08:36,162 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {22766#true} {23484#(< ~counter~0 90)} #71#return; {23484#(< ~counter~0 90)} is VALID [2022-04-28 14:08:36,163 INFO L290 TraceCheckUtils]: 35: Hoare triple {22766#true} assume true; {22766#true} is VALID [2022-04-28 14:08:36,163 INFO L290 TraceCheckUtils]: 34: Hoare triple {22766#true} assume !(0 == ~cond); {22766#true} is VALID [2022-04-28 14:08:36,163 INFO L290 TraceCheckUtils]: 33: Hoare triple {22766#true} ~cond := #in~cond; {22766#true} is VALID [2022-04-28 14:08:36,163 INFO L272 TraceCheckUtils]: 32: Hoare triple {23484#(< ~counter~0 90)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {22766#true} is VALID [2022-04-28 14:08:36,163 INFO L290 TraceCheckUtils]: 31: Hoare triple {23484#(< ~counter~0 90)} assume !!(#t~post6 < 100);havoc #t~post6; {23484#(< ~counter~0 90)} is VALID [2022-04-28 14:08:36,164 INFO L290 TraceCheckUtils]: 30: Hoare triple {23512#(< ~counter~0 89)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {23484#(< ~counter~0 90)} is VALID [2022-04-28 14:08:36,164 INFO L290 TraceCheckUtils]: 29: Hoare triple {23512#(< ~counter~0 89)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {23512#(< ~counter~0 89)} is VALID [2022-04-28 14:08:36,164 INFO L290 TraceCheckUtils]: 28: Hoare triple {23512#(< ~counter~0 89)} assume !!(0 != ~a~0 && 0 != ~b~0); {23512#(< ~counter~0 89)} is VALID [2022-04-28 14:08:36,165 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {22766#true} {23512#(< ~counter~0 89)} #71#return; {23512#(< ~counter~0 89)} is VALID [2022-04-28 14:08:36,165 INFO L290 TraceCheckUtils]: 26: Hoare triple {22766#true} assume true; {22766#true} is VALID [2022-04-28 14:08:36,165 INFO L290 TraceCheckUtils]: 25: Hoare triple {22766#true} assume !(0 == ~cond); {22766#true} is VALID [2022-04-28 14:08:36,165 INFO L290 TraceCheckUtils]: 24: Hoare triple {22766#true} ~cond := #in~cond; {22766#true} is VALID [2022-04-28 14:08:36,165 INFO L272 TraceCheckUtils]: 23: Hoare triple {23512#(< ~counter~0 89)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {22766#true} is VALID [2022-04-28 14:08:36,166 INFO L290 TraceCheckUtils]: 22: Hoare triple {23512#(< ~counter~0 89)} assume !!(#t~post6 < 100);havoc #t~post6; {23512#(< ~counter~0 89)} is VALID [2022-04-28 14:08:36,166 INFO L290 TraceCheckUtils]: 21: Hoare triple {23540#(< ~counter~0 88)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {23512#(< ~counter~0 89)} is VALID [2022-04-28 14:08:36,166 INFO L290 TraceCheckUtils]: 20: Hoare triple {23540#(< ~counter~0 88)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {23540#(< ~counter~0 88)} is VALID [2022-04-28 14:08:36,167 INFO L290 TraceCheckUtils]: 19: Hoare triple {23540#(< ~counter~0 88)} assume !!(0 != ~a~0 && 0 != ~b~0); {23540#(< ~counter~0 88)} is VALID [2022-04-28 14:08:36,167 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {22766#true} {23540#(< ~counter~0 88)} #71#return; {23540#(< ~counter~0 88)} is VALID [2022-04-28 14:08:36,167 INFO L290 TraceCheckUtils]: 17: Hoare triple {22766#true} assume true; {22766#true} is VALID [2022-04-28 14:08:36,168 INFO L290 TraceCheckUtils]: 16: Hoare triple {22766#true} assume !(0 == ~cond); {22766#true} is VALID [2022-04-28 14:08:36,168 INFO L290 TraceCheckUtils]: 15: Hoare triple {22766#true} ~cond := #in~cond; {22766#true} is VALID [2022-04-28 14:08:36,168 INFO L272 TraceCheckUtils]: 14: Hoare triple {23540#(< ~counter~0 88)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {22766#true} is VALID [2022-04-28 14:08:36,168 INFO L290 TraceCheckUtils]: 13: Hoare triple {23540#(< ~counter~0 88)} assume !!(#t~post6 < 100);havoc #t~post6; {23540#(< ~counter~0 88)} is VALID [2022-04-28 14:08:36,169 INFO L290 TraceCheckUtils]: 12: Hoare triple {23568#(< ~counter~0 87)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {23540#(< ~counter~0 88)} is VALID [2022-04-28 14:08:36,169 INFO L290 TraceCheckUtils]: 11: Hoare triple {23568#(< ~counter~0 87)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {23568#(< ~counter~0 87)} is VALID [2022-04-28 14:08:36,169 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {22766#true} {23568#(< ~counter~0 87)} #69#return; {23568#(< ~counter~0 87)} is VALID [2022-04-28 14:08:36,169 INFO L290 TraceCheckUtils]: 9: Hoare triple {22766#true} assume true; {22766#true} is VALID [2022-04-28 14:08:36,170 INFO L290 TraceCheckUtils]: 8: Hoare triple {22766#true} assume !(0 == ~cond); {22766#true} is VALID [2022-04-28 14:08:36,170 INFO L290 TraceCheckUtils]: 7: Hoare triple {22766#true} ~cond := #in~cond; {22766#true} is VALID [2022-04-28 14:08:36,170 INFO L272 TraceCheckUtils]: 6: Hoare triple {23568#(< ~counter~0 87)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {22766#true} is VALID [2022-04-28 14:08:36,170 INFO L290 TraceCheckUtils]: 5: Hoare triple {23568#(< ~counter~0 87)} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {23568#(< ~counter~0 87)} is VALID [2022-04-28 14:08:36,170 INFO L272 TraceCheckUtils]: 4: Hoare triple {23568#(< ~counter~0 87)} call #t~ret7 := main(); {23568#(< ~counter~0 87)} is VALID [2022-04-28 14:08:36,171 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23568#(< ~counter~0 87)} {22766#true} #77#return; {23568#(< ~counter~0 87)} is VALID [2022-04-28 14:08:36,171 INFO L290 TraceCheckUtils]: 2: Hoare triple {23568#(< ~counter~0 87)} assume true; {23568#(< ~counter~0 87)} is VALID [2022-04-28 14:08:36,172 INFO L290 TraceCheckUtils]: 1: Hoare triple {22766#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(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {23568#(< ~counter~0 87)} is VALID [2022-04-28 14:08:36,172 INFO L272 TraceCheckUtils]: 0: Hoare triple {22766#true} call ULTIMATE.init(); {22766#true} is VALID [2022-04-28 14:08:36,172 INFO L134 CoverageAnalysis]: Checked inductivity of 754 backedges. 26 proven. 416 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2022-04-28 14:08:36,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:08:36,172 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1621436515] [2022-04-28 14:08:36,173 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 14:08:36,173 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [682345027] [2022-04-28 14:08:36,173 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [682345027] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 14:08:36,173 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 14:08:36,173 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 32 [2022-04-28 14:08:36,173 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:08:36,173 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [401865306] [2022-04-28 14:08:36,173 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [401865306] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:08:36,173 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:08:36,173 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-04-28 14:08:36,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [319018100] [2022-04-28 14:08:36,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:08:36,174 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 6.0588235294117645) internal successors, (103), 16 states have internal predecessors, (103), 16 states have call successors, (17), 16 states have call predecessors, (17), 14 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) Word has length 135 [2022-04-28 14:08:36,174 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:08:36,174 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 17 states, 17 states have (on average 6.0588235294117645) internal successors, (103), 16 states have internal predecessors, (103), 16 states have call successors, (17), 16 states have call predecessors, (17), 14 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-28 14:08:36,297 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 135 edges. 135 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:08:36,297 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-04-28 14:08:36,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:08:36,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-04-28 14:08:36,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=440, Invalid=552, Unknown=0, NotChecked=0, Total=992 [2022-04-28 14:08:36,299 INFO L87 Difference]: Start difference. First operand 175 states and 216 transitions. Second operand has 17 states, 17 states have (on average 6.0588235294117645) internal successors, (103), 16 states have internal predecessors, (103), 16 states have call successors, (17), 16 states have call predecessors, (17), 14 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-28 14:08:37,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:08:37,175 INFO L93 Difference]: Finished difference Result 194 states and 239 transitions. [2022-04-28 14:08:37,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-04-28 14:08:37,175 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 6.0588235294117645) internal successors, (103), 16 states have internal predecessors, (103), 16 states have call successors, (17), 16 states have call predecessors, (17), 14 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) Word has length 135 [2022-04-28 14:08:37,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:08:37,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 6.0588235294117645) internal successors, (103), 16 states have internal predecessors, (103), 16 states have call successors, (17), 16 states have call predecessors, (17), 14 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-28 14:08:37,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 225 transitions. [2022-04-28 14:08:37,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 6.0588235294117645) internal successors, (103), 16 states have internal predecessors, (103), 16 states have call successors, (17), 16 states have call predecessors, (17), 14 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-28 14:08:37,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 225 transitions. [2022-04-28 14:08:37,182 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 30 states and 225 transitions. [2022-04-28 14:08:37,390 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 225 edges. 225 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:08:37,393 INFO L225 Difference]: With dead ends: 194 [2022-04-28 14:08:37,393 INFO L226 Difference]: Without dead ends: 186 [2022-04-28 14:08:37,394 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 282 GetRequests, 239 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=843, Invalid=1137, Unknown=0, NotChecked=0, Total=1980 [2022-04-28 14:08:37,394 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 163 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 250 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 14:08:37,395 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 250 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 14:08:37,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2022-04-28 14:08:37,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 186. [2022-04-28 14:08:37,716 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:08:37,717 INFO L82 GeneralOperation]: Start isEquivalent. First operand 186 states. Second operand has 186 states, 147 states have (on average 1.3061224489795917) internal successors, (192), 148 states have internal predecessors, (192), 20 states have call successors, (20), 19 states have call predecessors, (20), 18 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-28 14:08:37,717 INFO L74 IsIncluded]: Start isIncluded. First operand 186 states. Second operand has 186 states, 147 states have (on average 1.3061224489795917) internal successors, (192), 148 states have internal predecessors, (192), 20 states have call successors, (20), 19 states have call predecessors, (20), 18 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-28 14:08:37,717 INFO L87 Difference]: Start difference. First operand 186 states. Second operand has 186 states, 147 states have (on average 1.3061224489795917) internal successors, (192), 148 states have internal predecessors, (192), 20 states have call successors, (20), 19 states have call predecessors, (20), 18 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-28 14:08:37,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:08:37,719 INFO L93 Difference]: Finished difference Result 186 states and 230 transitions. [2022-04-28 14:08:37,719 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 230 transitions. [2022-04-28 14:08:37,723 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:08:37,723 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:08:37,724 INFO L74 IsIncluded]: Start isIncluded. First operand has 186 states, 147 states have (on average 1.3061224489795917) internal successors, (192), 148 states have internal predecessors, (192), 20 states have call successors, (20), 19 states have call predecessors, (20), 18 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand 186 states. [2022-04-28 14:08:37,724 INFO L87 Difference]: Start difference. First operand has 186 states, 147 states have (on average 1.3061224489795917) internal successors, (192), 148 states have internal predecessors, (192), 20 states have call successors, (20), 19 states have call predecessors, (20), 18 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand 186 states. [2022-04-28 14:08:37,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:08:37,727 INFO L93 Difference]: Finished difference Result 186 states and 230 transitions. [2022-04-28 14:08:37,727 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 230 transitions. [2022-04-28 14:08:37,727 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:08:37,727 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:08:37,727 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:08:37,727 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:08:37,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 147 states have (on average 1.3061224489795917) internal successors, (192), 148 states have internal predecessors, (192), 20 states have call successors, (20), 19 states have call predecessors, (20), 18 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-28 14:08:37,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 230 transitions. [2022-04-28 14:08:37,731 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 230 transitions. Word has length 135 [2022-04-28 14:08:37,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:08:37,731 INFO L495 AbstractCegarLoop]: Abstraction has 186 states and 230 transitions. [2022-04-28 14:08:37,731 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 6.0588235294117645) internal successors, (103), 16 states have internal predecessors, (103), 16 states have call successors, (17), 16 states have call predecessors, (17), 14 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-28 14:08:37,731 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 186 states and 230 transitions. [2022-04-28 14:09:05,926 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 230 edges. 217 inductive. 0 not inductive. 13 times theorem prover too weak to decide inductivity. [2022-04-28 14:09:05,927 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 230 transitions. [2022-04-28 14:09:05,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2022-04-28 14:09:05,927 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:09:05,928 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 14, 14, 14, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 14:09:05,946 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Forceful destruction successful, exit code 0 [2022-04-28 14:09:06,128 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2022-04-28 14:09:06,128 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:09:06,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:09:06,129 INFO L85 PathProgramCache]: Analyzing trace with hash 1384294394, now seen corresponding path program 27 times [2022-04-28 14:09:06,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:09:06,129 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2129780878] [2022-04-28 14:09:11,903 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 14:09:11,904 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 14:09:11,904 INFO L85 PathProgramCache]: Analyzing trace with hash 1384294394, now seen corresponding path program 28 times [2022-04-28 14:09:11,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:09:11,904 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [797353331] [2022-04-28 14:09:11,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:09:11,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:09:11,930 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 14:09:11,930 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1887425354] [2022-04-28 14:09:11,930 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 14:09:11,930 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 14:09:11,931 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 14:09:11,932 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 14:09:11,933 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2022-04-28 14:09:12,056 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 14:09:12,057 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 14:09:12,058 INFO L263 TraceCheckSpWp]: Trace formula consists of 450 conjuncts, 33 conjunts are in the unsatisfiable core [2022-04-28 14:09:12,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:09:12,085 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 14:09:12,764 INFO L272 TraceCheckUtils]: 0: Hoare triple {24765#true} call ULTIMATE.init(); {24765#true} is VALID [2022-04-28 14:09:12,765 INFO L290 TraceCheckUtils]: 1: Hoare triple {24765#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(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {24773#(<= ~counter~0 0)} is VALID [2022-04-28 14:09:12,765 INFO L290 TraceCheckUtils]: 2: Hoare triple {24773#(<= ~counter~0 0)} assume true; {24773#(<= ~counter~0 0)} is VALID [2022-04-28 14:09:12,766 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24773#(<= ~counter~0 0)} {24765#true} #77#return; {24773#(<= ~counter~0 0)} is VALID [2022-04-28 14:09:12,766 INFO L272 TraceCheckUtils]: 4: Hoare triple {24773#(<= ~counter~0 0)} call #t~ret7 := main(); {24773#(<= ~counter~0 0)} is VALID [2022-04-28 14:09:12,766 INFO L290 TraceCheckUtils]: 5: Hoare triple {24773#(<= ~counter~0 0)} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {24773#(<= ~counter~0 0)} is VALID [2022-04-28 14:09:12,767 INFO L272 TraceCheckUtils]: 6: Hoare triple {24773#(<= ~counter~0 0)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {24773#(<= ~counter~0 0)} is VALID [2022-04-28 14:09:12,775 INFO L290 TraceCheckUtils]: 7: Hoare triple {24773#(<= ~counter~0 0)} ~cond := #in~cond; {24773#(<= ~counter~0 0)} is VALID [2022-04-28 14:09:12,776 INFO L290 TraceCheckUtils]: 8: Hoare triple {24773#(<= ~counter~0 0)} assume !(0 == ~cond); {24773#(<= ~counter~0 0)} is VALID [2022-04-28 14:09:12,776 INFO L290 TraceCheckUtils]: 9: Hoare triple {24773#(<= ~counter~0 0)} assume true; {24773#(<= ~counter~0 0)} is VALID [2022-04-28 14:09:12,776 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {24773#(<= ~counter~0 0)} {24773#(<= ~counter~0 0)} #69#return; {24773#(<= ~counter~0 0)} is VALID [2022-04-28 14:09:12,777 INFO L290 TraceCheckUtils]: 11: Hoare triple {24773#(<= ~counter~0 0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {24773#(<= ~counter~0 0)} is VALID [2022-04-28 14:09:12,778 INFO L290 TraceCheckUtils]: 12: Hoare triple {24773#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {24807#(<= ~counter~0 1)} is VALID [2022-04-28 14:09:12,778 INFO L290 TraceCheckUtils]: 13: Hoare triple {24807#(<= ~counter~0 1)} assume !!(#t~post6 < 100);havoc #t~post6; {24807#(<= ~counter~0 1)} is VALID [2022-04-28 14:09:12,779 INFO L272 TraceCheckUtils]: 14: Hoare triple {24807#(<= ~counter~0 1)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {24807#(<= ~counter~0 1)} is VALID [2022-04-28 14:09:12,779 INFO L290 TraceCheckUtils]: 15: Hoare triple {24807#(<= ~counter~0 1)} ~cond := #in~cond; {24807#(<= ~counter~0 1)} is VALID [2022-04-28 14:09:12,779 INFO L290 TraceCheckUtils]: 16: Hoare triple {24807#(<= ~counter~0 1)} assume !(0 == ~cond); {24807#(<= ~counter~0 1)} is VALID [2022-04-28 14:09:12,780 INFO L290 TraceCheckUtils]: 17: Hoare triple {24807#(<= ~counter~0 1)} assume true; {24807#(<= ~counter~0 1)} is VALID [2022-04-28 14:09:12,780 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {24807#(<= ~counter~0 1)} {24807#(<= ~counter~0 1)} #71#return; {24807#(<= ~counter~0 1)} is VALID [2022-04-28 14:09:12,781 INFO L290 TraceCheckUtils]: 19: Hoare triple {24807#(<= ~counter~0 1)} assume !!(0 != ~a~0 && 0 != ~b~0); {24807#(<= ~counter~0 1)} is VALID [2022-04-28 14:09:12,781 INFO L290 TraceCheckUtils]: 20: Hoare triple {24807#(<= ~counter~0 1)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {24807#(<= ~counter~0 1)} is VALID [2022-04-28 14:09:12,782 INFO L290 TraceCheckUtils]: 21: Hoare triple {24807#(<= ~counter~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {24835#(<= ~counter~0 2)} is VALID [2022-04-28 14:09:12,782 INFO L290 TraceCheckUtils]: 22: Hoare triple {24835#(<= ~counter~0 2)} assume !!(#t~post6 < 100);havoc #t~post6; {24835#(<= ~counter~0 2)} is VALID [2022-04-28 14:09:12,783 INFO L272 TraceCheckUtils]: 23: Hoare triple {24835#(<= ~counter~0 2)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {24835#(<= ~counter~0 2)} is VALID [2022-04-28 14:09:12,783 INFO L290 TraceCheckUtils]: 24: Hoare triple {24835#(<= ~counter~0 2)} ~cond := #in~cond; {24835#(<= ~counter~0 2)} is VALID [2022-04-28 14:09:12,783 INFO L290 TraceCheckUtils]: 25: Hoare triple {24835#(<= ~counter~0 2)} assume !(0 == ~cond); {24835#(<= ~counter~0 2)} is VALID [2022-04-28 14:09:12,784 INFO L290 TraceCheckUtils]: 26: Hoare triple {24835#(<= ~counter~0 2)} assume true; {24835#(<= ~counter~0 2)} is VALID [2022-04-28 14:09:12,784 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {24835#(<= ~counter~0 2)} {24835#(<= ~counter~0 2)} #71#return; {24835#(<= ~counter~0 2)} is VALID [2022-04-28 14:09:12,785 INFO L290 TraceCheckUtils]: 28: Hoare triple {24835#(<= ~counter~0 2)} assume !!(0 != ~a~0 && 0 != ~b~0); {24835#(<= ~counter~0 2)} is VALID [2022-04-28 14:09:12,785 INFO L290 TraceCheckUtils]: 29: Hoare triple {24835#(<= ~counter~0 2)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {24835#(<= ~counter~0 2)} is VALID [2022-04-28 14:09:12,786 INFO L290 TraceCheckUtils]: 30: Hoare triple {24835#(<= ~counter~0 2)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {24863#(<= ~counter~0 3)} is VALID [2022-04-28 14:09:12,786 INFO L290 TraceCheckUtils]: 31: Hoare triple {24863#(<= ~counter~0 3)} assume !!(#t~post6 < 100);havoc #t~post6; {24863#(<= ~counter~0 3)} is VALID [2022-04-28 14:09:12,787 INFO L272 TraceCheckUtils]: 32: Hoare triple {24863#(<= ~counter~0 3)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {24863#(<= ~counter~0 3)} is VALID [2022-04-28 14:09:12,787 INFO L290 TraceCheckUtils]: 33: Hoare triple {24863#(<= ~counter~0 3)} ~cond := #in~cond; {24863#(<= ~counter~0 3)} is VALID [2022-04-28 14:09:12,787 INFO L290 TraceCheckUtils]: 34: Hoare triple {24863#(<= ~counter~0 3)} assume !(0 == ~cond); {24863#(<= ~counter~0 3)} is VALID [2022-04-28 14:09:12,788 INFO L290 TraceCheckUtils]: 35: Hoare triple {24863#(<= ~counter~0 3)} assume true; {24863#(<= ~counter~0 3)} is VALID [2022-04-28 14:09:12,788 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {24863#(<= ~counter~0 3)} {24863#(<= ~counter~0 3)} #71#return; {24863#(<= ~counter~0 3)} is VALID [2022-04-28 14:09:12,789 INFO L290 TraceCheckUtils]: 37: Hoare triple {24863#(<= ~counter~0 3)} assume !!(0 != ~a~0 && 0 != ~b~0); {24863#(<= ~counter~0 3)} is VALID [2022-04-28 14:09:12,789 INFO L290 TraceCheckUtils]: 38: Hoare triple {24863#(<= ~counter~0 3)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {24863#(<= ~counter~0 3)} is VALID [2022-04-28 14:09:12,790 INFO L290 TraceCheckUtils]: 39: Hoare triple {24863#(<= ~counter~0 3)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {24891#(<= ~counter~0 4)} is VALID [2022-04-28 14:09:12,790 INFO L290 TraceCheckUtils]: 40: Hoare triple {24891#(<= ~counter~0 4)} assume !!(#t~post6 < 100);havoc #t~post6; {24891#(<= ~counter~0 4)} is VALID [2022-04-28 14:09:12,791 INFO L272 TraceCheckUtils]: 41: Hoare triple {24891#(<= ~counter~0 4)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {24891#(<= ~counter~0 4)} is VALID [2022-04-28 14:09:12,791 INFO L290 TraceCheckUtils]: 42: Hoare triple {24891#(<= ~counter~0 4)} ~cond := #in~cond; {24891#(<= ~counter~0 4)} is VALID [2022-04-28 14:09:12,791 INFO L290 TraceCheckUtils]: 43: Hoare triple {24891#(<= ~counter~0 4)} assume !(0 == ~cond); {24891#(<= ~counter~0 4)} is VALID [2022-04-28 14:09:12,792 INFO L290 TraceCheckUtils]: 44: Hoare triple {24891#(<= ~counter~0 4)} assume true; {24891#(<= ~counter~0 4)} is VALID [2022-04-28 14:09:12,792 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {24891#(<= ~counter~0 4)} {24891#(<= ~counter~0 4)} #71#return; {24891#(<= ~counter~0 4)} is VALID [2022-04-28 14:09:12,793 INFO L290 TraceCheckUtils]: 46: Hoare triple {24891#(<= ~counter~0 4)} assume !!(0 != ~a~0 && 0 != ~b~0); {24891#(<= ~counter~0 4)} is VALID [2022-04-28 14:09:12,793 INFO L290 TraceCheckUtils]: 47: Hoare triple {24891#(<= ~counter~0 4)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {24891#(<= ~counter~0 4)} is VALID [2022-04-28 14:09:12,794 INFO L290 TraceCheckUtils]: 48: Hoare triple {24891#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {24919#(<= ~counter~0 5)} is VALID [2022-04-28 14:09:12,794 INFO L290 TraceCheckUtils]: 49: Hoare triple {24919#(<= ~counter~0 5)} assume !!(#t~post6 < 100);havoc #t~post6; {24919#(<= ~counter~0 5)} is VALID [2022-04-28 14:09:12,795 INFO L272 TraceCheckUtils]: 50: Hoare triple {24919#(<= ~counter~0 5)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {24919#(<= ~counter~0 5)} is VALID [2022-04-28 14:09:12,795 INFO L290 TraceCheckUtils]: 51: Hoare triple {24919#(<= ~counter~0 5)} ~cond := #in~cond; {24919#(<= ~counter~0 5)} is VALID [2022-04-28 14:09:12,795 INFO L290 TraceCheckUtils]: 52: Hoare triple {24919#(<= ~counter~0 5)} assume !(0 == ~cond); {24919#(<= ~counter~0 5)} is VALID [2022-04-28 14:09:12,796 INFO L290 TraceCheckUtils]: 53: Hoare triple {24919#(<= ~counter~0 5)} assume true; {24919#(<= ~counter~0 5)} is VALID [2022-04-28 14:09:12,796 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {24919#(<= ~counter~0 5)} {24919#(<= ~counter~0 5)} #71#return; {24919#(<= ~counter~0 5)} is VALID [2022-04-28 14:09:12,797 INFO L290 TraceCheckUtils]: 55: Hoare triple {24919#(<= ~counter~0 5)} assume !!(0 != ~a~0 && 0 != ~b~0); {24919#(<= ~counter~0 5)} is VALID [2022-04-28 14:09:12,797 INFO L290 TraceCheckUtils]: 56: Hoare triple {24919#(<= ~counter~0 5)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {24919#(<= ~counter~0 5)} is VALID [2022-04-28 14:09:12,798 INFO L290 TraceCheckUtils]: 57: Hoare triple {24919#(<= ~counter~0 5)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {24947#(<= ~counter~0 6)} is VALID [2022-04-28 14:09:12,798 INFO L290 TraceCheckUtils]: 58: Hoare triple {24947#(<= ~counter~0 6)} assume !!(#t~post6 < 100);havoc #t~post6; {24947#(<= ~counter~0 6)} is VALID [2022-04-28 14:09:12,799 INFO L272 TraceCheckUtils]: 59: Hoare triple {24947#(<= ~counter~0 6)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {24947#(<= ~counter~0 6)} is VALID [2022-04-28 14:09:12,799 INFO L290 TraceCheckUtils]: 60: Hoare triple {24947#(<= ~counter~0 6)} ~cond := #in~cond; {24947#(<= ~counter~0 6)} is VALID [2022-04-28 14:09:12,799 INFO L290 TraceCheckUtils]: 61: Hoare triple {24947#(<= ~counter~0 6)} assume !(0 == ~cond); {24947#(<= ~counter~0 6)} is VALID [2022-04-28 14:09:12,800 INFO L290 TraceCheckUtils]: 62: Hoare triple {24947#(<= ~counter~0 6)} assume true; {24947#(<= ~counter~0 6)} is VALID [2022-04-28 14:09:12,801 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {24947#(<= ~counter~0 6)} {24947#(<= ~counter~0 6)} #71#return; {24947#(<= ~counter~0 6)} is VALID [2022-04-28 14:09:12,801 INFO L290 TraceCheckUtils]: 64: Hoare triple {24947#(<= ~counter~0 6)} assume !!(0 != ~a~0 && 0 != ~b~0); {24947#(<= ~counter~0 6)} is VALID [2022-04-28 14:09:12,801 INFO L290 TraceCheckUtils]: 65: Hoare triple {24947#(<= ~counter~0 6)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {24947#(<= ~counter~0 6)} is VALID [2022-04-28 14:09:12,802 INFO L290 TraceCheckUtils]: 66: Hoare triple {24947#(<= ~counter~0 6)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {24975#(<= ~counter~0 7)} is VALID [2022-04-28 14:09:12,802 INFO L290 TraceCheckUtils]: 67: Hoare triple {24975#(<= ~counter~0 7)} assume !!(#t~post6 < 100);havoc #t~post6; {24975#(<= ~counter~0 7)} is VALID [2022-04-28 14:09:12,803 INFO L272 TraceCheckUtils]: 68: Hoare triple {24975#(<= ~counter~0 7)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {24975#(<= ~counter~0 7)} is VALID [2022-04-28 14:09:12,803 INFO L290 TraceCheckUtils]: 69: Hoare triple {24975#(<= ~counter~0 7)} ~cond := #in~cond; {24975#(<= ~counter~0 7)} is VALID [2022-04-28 14:09:12,804 INFO L290 TraceCheckUtils]: 70: Hoare triple {24975#(<= ~counter~0 7)} assume !(0 == ~cond); {24975#(<= ~counter~0 7)} is VALID [2022-04-28 14:09:12,804 INFO L290 TraceCheckUtils]: 71: Hoare triple {24975#(<= ~counter~0 7)} assume true; {24975#(<= ~counter~0 7)} is VALID [2022-04-28 14:09:12,805 INFO L284 TraceCheckUtils]: 72: Hoare quadruple {24975#(<= ~counter~0 7)} {24975#(<= ~counter~0 7)} #71#return; {24975#(<= ~counter~0 7)} is VALID [2022-04-28 14:09:12,805 INFO L290 TraceCheckUtils]: 73: Hoare triple {24975#(<= ~counter~0 7)} assume !!(0 != ~a~0 && 0 != ~b~0); {24975#(<= ~counter~0 7)} is VALID [2022-04-28 14:09:12,806 INFO L290 TraceCheckUtils]: 74: Hoare triple {24975#(<= ~counter~0 7)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {24975#(<= ~counter~0 7)} is VALID [2022-04-28 14:09:12,806 INFO L290 TraceCheckUtils]: 75: Hoare triple {24975#(<= ~counter~0 7)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {25003#(<= ~counter~0 8)} is VALID [2022-04-28 14:09:12,807 INFO L290 TraceCheckUtils]: 76: Hoare triple {25003#(<= ~counter~0 8)} assume !!(#t~post6 < 100);havoc #t~post6; {25003#(<= ~counter~0 8)} is VALID [2022-04-28 14:09:12,807 INFO L272 TraceCheckUtils]: 77: Hoare triple {25003#(<= ~counter~0 8)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {25003#(<= ~counter~0 8)} is VALID [2022-04-28 14:09:12,808 INFO L290 TraceCheckUtils]: 78: Hoare triple {25003#(<= ~counter~0 8)} ~cond := #in~cond; {25003#(<= ~counter~0 8)} is VALID [2022-04-28 14:09:12,808 INFO L290 TraceCheckUtils]: 79: Hoare triple {25003#(<= ~counter~0 8)} assume !(0 == ~cond); {25003#(<= ~counter~0 8)} is VALID [2022-04-28 14:09:12,808 INFO L290 TraceCheckUtils]: 80: Hoare triple {25003#(<= ~counter~0 8)} assume true; {25003#(<= ~counter~0 8)} is VALID [2022-04-28 14:09:12,809 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {25003#(<= ~counter~0 8)} {25003#(<= ~counter~0 8)} #71#return; {25003#(<= ~counter~0 8)} is VALID [2022-04-28 14:09:12,809 INFO L290 TraceCheckUtils]: 82: Hoare triple {25003#(<= ~counter~0 8)} assume !!(0 != ~a~0 && 0 != ~b~0); {25003#(<= ~counter~0 8)} is VALID [2022-04-28 14:09:12,810 INFO L290 TraceCheckUtils]: 83: Hoare triple {25003#(<= ~counter~0 8)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {25003#(<= ~counter~0 8)} is VALID [2022-04-28 14:09:12,810 INFO L290 TraceCheckUtils]: 84: Hoare triple {25003#(<= ~counter~0 8)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {25031#(<= ~counter~0 9)} is VALID [2022-04-28 14:09:12,811 INFO L290 TraceCheckUtils]: 85: Hoare triple {25031#(<= ~counter~0 9)} assume !!(#t~post6 < 100);havoc #t~post6; {25031#(<= ~counter~0 9)} is VALID [2022-04-28 14:09:12,811 INFO L272 TraceCheckUtils]: 86: Hoare triple {25031#(<= ~counter~0 9)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {25031#(<= ~counter~0 9)} is VALID [2022-04-28 14:09:12,812 INFO L290 TraceCheckUtils]: 87: Hoare triple {25031#(<= ~counter~0 9)} ~cond := #in~cond; {25031#(<= ~counter~0 9)} is VALID [2022-04-28 14:09:12,812 INFO L290 TraceCheckUtils]: 88: Hoare triple {25031#(<= ~counter~0 9)} assume !(0 == ~cond); {25031#(<= ~counter~0 9)} is VALID [2022-04-28 14:09:12,812 INFO L290 TraceCheckUtils]: 89: Hoare triple {25031#(<= ~counter~0 9)} assume true; {25031#(<= ~counter~0 9)} is VALID [2022-04-28 14:09:12,813 INFO L284 TraceCheckUtils]: 90: Hoare quadruple {25031#(<= ~counter~0 9)} {25031#(<= ~counter~0 9)} #71#return; {25031#(<= ~counter~0 9)} is VALID [2022-04-28 14:09:12,813 INFO L290 TraceCheckUtils]: 91: Hoare triple {25031#(<= ~counter~0 9)} assume !!(0 != ~a~0 && 0 != ~b~0); {25031#(<= ~counter~0 9)} is VALID [2022-04-28 14:09:12,814 INFO L290 TraceCheckUtils]: 92: Hoare triple {25031#(<= ~counter~0 9)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {25031#(<= ~counter~0 9)} is VALID [2022-04-28 14:09:12,814 INFO L290 TraceCheckUtils]: 93: Hoare triple {25031#(<= ~counter~0 9)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {25059#(<= ~counter~0 10)} is VALID [2022-04-28 14:09:12,815 INFO L290 TraceCheckUtils]: 94: Hoare triple {25059#(<= ~counter~0 10)} assume !!(#t~post6 < 100);havoc #t~post6; {25059#(<= ~counter~0 10)} is VALID [2022-04-28 14:09:12,816 INFO L272 TraceCheckUtils]: 95: Hoare triple {25059#(<= ~counter~0 10)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {25059#(<= ~counter~0 10)} is VALID [2022-04-28 14:09:12,816 INFO L290 TraceCheckUtils]: 96: Hoare triple {25059#(<= ~counter~0 10)} ~cond := #in~cond; {25059#(<= ~counter~0 10)} is VALID [2022-04-28 14:09:12,816 INFO L290 TraceCheckUtils]: 97: Hoare triple {25059#(<= ~counter~0 10)} assume !(0 == ~cond); {25059#(<= ~counter~0 10)} is VALID [2022-04-28 14:09:12,817 INFO L290 TraceCheckUtils]: 98: Hoare triple {25059#(<= ~counter~0 10)} assume true; {25059#(<= ~counter~0 10)} is VALID [2022-04-28 14:09:12,817 INFO L284 TraceCheckUtils]: 99: Hoare quadruple {25059#(<= ~counter~0 10)} {25059#(<= ~counter~0 10)} #71#return; {25059#(<= ~counter~0 10)} is VALID [2022-04-28 14:09:12,818 INFO L290 TraceCheckUtils]: 100: Hoare triple {25059#(<= ~counter~0 10)} assume !!(0 != ~a~0 && 0 != ~b~0); {25059#(<= ~counter~0 10)} is VALID [2022-04-28 14:09:12,818 INFO L290 TraceCheckUtils]: 101: Hoare triple {25059#(<= ~counter~0 10)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {25059#(<= ~counter~0 10)} is VALID [2022-04-28 14:09:12,819 INFO L290 TraceCheckUtils]: 102: Hoare triple {25059#(<= ~counter~0 10)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {25087#(<= ~counter~0 11)} is VALID [2022-04-28 14:09:12,819 INFO L290 TraceCheckUtils]: 103: Hoare triple {25087#(<= ~counter~0 11)} assume !!(#t~post6 < 100);havoc #t~post6; {25087#(<= ~counter~0 11)} is VALID [2022-04-28 14:09:12,820 INFO L272 TraceCheckUtils]: 104: Hoare triple {25087#(<= ~counter~0 11)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {25087#(<= ~counter~0 11)} is VALID [2022-04-28 14:09:12,820 INFO L290 TraceCheckUtils]: 105: Hoare triple {25087#(<= ~counter~0 11)} ~cond := #in~cond; {25087#(<= ~counter~0 11)} is VALID [2022-04-28 14:09:12,820 INFO L290 TraceCheckUtils]: 106: Hoare triple {25087#(<= ~counter~0 11)} assume !(0 == ~cond); {25087#(<= ~counter~0 11)} is VALID [2022-04-28 14:09:12,821 INFO L290 TraceCheckUtils]: 107: Hoare triple {25087#(<= ~counter~0 11)} assume true; {25087#(<= ~counter~0 11)} is VALID [2022-04-28 14:09:12,821 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {25087#(<= ~counter~0 11)} {25087#(<= ~counter~0 11)} #71#return; {25087#(<= ~counter~0 11)} is VALID [2022-04-28 14:09:12,822 INFO L290 TraceCheckUtils]: 109: Hoare triple {25087#(<= ~counter~0 11)} assume !!(0 != ~a~0 && 0 != ~b~0); {25087#(<= ~counter~0 11)} is VALID [2022-04-28 14:09:12,822 INFO L290 TraceCheckUtils]: 110: Hoare triple {25087#(<= ~counter~0 11)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {25087#(<= ~counter~0 11)} is VALID [2022-04-28 14:09:12,823 INFO L290 TraceCheckUtils]: 111: Hoare triple {25087#(<= ~counter~0 11)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {25115#(<= ~counter~0 12)} is VALID [2022-04-28 14:09:12,823 INFO L290 TraceCheckUtils]: 112: Hoare triple {25115#(<= ~counter~0 12)} assume !!(#t~post6 < 100);havoc #t~post6; {25115#(<= ~counter~0 12)} is VALID [2022-04-28 14:09:12,824 INFO L272 TraceCheckUtils]: 113: Hoare triple {25115#(<= ~counter~0 12)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {25115#(<= ~counter~0 12)} is VALID [2022-04-28 14:09:12,824 INFO L290 TraceCheckUtils]: 114: Hoare triple {25115#(<= ~counter~0 12)} ~cond := #in~cond; {25115#(<= ~counter~0 12)} is VALID [2022-04-28 14:09:12,824 INFO L290 TraceCheckUtils]: 115: Hoare triple {25115#(<= ~counter~0 12)} assume !(0 == ~cond); {25115#(<= ~counter~0 12)} is VALID [2022-04-28 14:09:12,825 INFO L290 TraceCheckUtils]: 116: Hoare triple {25115#(<= ~counter~0 12)} assume true; {25115#(<= ~counter~0 12)} is VALID [2022-04-28 14:09:12,825 INFO L284 TraceCheckUtils]: 117: Hoare quadruple {25115#(<= ~counter~0 12)} {25115#(<= ~counter~0 12)} #71#return; {25115#(<= ~counter~0 12)} is VALID [2022-04-28 14:09:12,826 INFO L290 TraceCheckUtils]: 118: Hoare triple {25115#(<= ~counter~0 12)} assume !!(0 != ~a~0 && 0 != ~b~0); {25115#(<= ~counter~0 12)} is VALID [2022-04-28 14:09:12,826 INFO L290 TraceCheckUtils]: 119: Hoare triple {25115#(<= ~counter~0 12)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {25115#(<= ~counter~0 12)} is VALID [2022-04-28 14:09:12,827 INFO L290 TraceCheckUtils]: 120: Hoare triple {25115#(<= ~counter~0 12)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {25143#(<= ~counter~0 13)} is VALID [2022-04-28 14:09:12,827 INFO L290 TraceCheckUtils]: 121: Hoare triple {25143#(<= ~counter~0 13)} assume !!(#t~post6 < 100);havoc #t~post6; {25143#(<= ~counter~0 13)} is VALID [2022-04-28 14:09:12,828 INFO L272 TraceCheckUtils]: 122: Hoare triple {25143#(<= ~counter~0 13)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {25143#(<= ~counter~0 13)} is VALID [2022-04-28 14:09:12,828 INFO L290 TraceCheckUtils]: 123: Hoare triple {25143#(<= ~counter~0 13)} ~cond := #in~cond; {25143#(<= ~counter~0 13)} is VALID [2022-04-28 14:09:12,828 INFO L290 TraceCheckUtils]: 124: Hoare triple {25143#(<= ~counter~0 13)} assume !(0 == ~cond); {25143#(<= ~counter~0 13)} is VALID [2022-04-28 14:09:12,829 INFO L290 TraceCheckUtils]: 125: Hoare triple {25143#(<= ~counter~0 13)} assume true; {25143#(<= ~counter~0 13)} is VALID [2022-04-28 14:09:12,830 INFO L284 TraceCheckUtils]: 126: Hoare quadruple {25143#(<= ~counter~0 13)} {25143#(<= ~counter~0 13)} #71#return; {25143#(<= ~counter~0 13)} is VALID [2022-04-28 14:09:12,830 INFO L290 TraceCheckUtils]: 127: Hoare triple {25143#(<= ~counter~0 13)} assume !!(0 != ~a~0 && 0 != ~b~0); {25143#(<= ~counter~0 13)} is VALID [2022-04-28 14:09:12,830 INFO L290 TraceCheckUtils]: 128: Hoare triple {25143#(<= ~counter~0 13)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {25143#(<= ~counter~0 13)} is VALID [2022-04-28 14:09:12,831 INFO L290 TraceCheckUtils]: 129: Hoare triple {25143#(<= ~counter~0 13)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {25171#(<= ~counter~0 14)} is VALID [2022-04-28 14:09:12,831 INFO L290 TraceCheckUtils]: 130: Hoare triple {25171#(<= ~counter~0 14)} assume !!(#t~post6 < 100);havoc #t~post6; {25171#(<= ~counter~0 14)} is VALID [2022-04-28 14:09:12,832 INFO L272 TraceCheckUtils]: 131: Hoare triple {25171#(<= ~counter~0 14)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {25171#(<= ~counter~0 14)} is VALID [2022-04-28 14:09:12,832 INFO L290 TraceCheckUtils]: 132: Hoare triple {25171#(<= ~counter~0 14)} ~cond := #in~cond; {25171#(<= ~counter~0 14)} is VALID [2022-04-28 14:09:12,832 INFO L290 TraceCheckUtils]: 133: Hoare triple {25171#(<= ~counter~0 14)} assume !(0 == ~cond); {25171#(<= ~counter~0 14)} is VALID [2022-04-28 14:09:12,833 INFO L290 TraceCheckUtils]: 134: Hoare triple {25171#(<= ~counter~0 14)} assume true; {25171#(<= ~counter~0 14)} is VALID [2022-04-28 14:09:12,834 INFO L284 TraceCheckUtils]: 135: Hoare quadruple {25171#(<= ~counter~0 14)} {25171#(<= ~counter~0 14)} #71#return; {25171#(<= ~counter~0 14)} is VALID [2022-04-28 14:09:12,834 INFO L290 TraceCheckUtils]: 136: Hoare triple {25171#(<= ~counter~0 14)} assume !!(0 != ~a~0 && 0 != ~b~0); {25171#(<= ~counter~0 14)} is VALID [2022-04-28 14:09:12,834 INFO L290 TraceCheckUtils]: 137: Hoare triple {25171#(<= ~counter~0 14)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {25171#(<= ~counter~0 14)} is VALID [2022-04-28 14:09:12,835 INFO L290 TraceCheckUtils]: 138: Hoare triple {25171#(<= ~counter~0 14)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {25199#(<= |main_#t~post6| 14)} is VALID [2022-04-28 14:09:12,835 INFO L290 TraceCheckUtils]: 139: Hoare triple {25199#(<= |main_#t~post6| 14)} assume !(#t~post6 < 100);havoc #t~post6; {24766#false} is VALID [2022-04-28 14:09:12,835 INFO L272 TraceCheckUtils]: 140: Hoare triple {24766#false} call __VERIFIER_assert((if ~q~0 == ~x~0 * ~y~0 then 1 else 0)); {24766#false} is VALID [2022-04-28 14:09:12,835 INFO L290 TraceCheckUtils]: 141: Hoare triple {24766#false} ~cond := #in~cond; {24766#false} is VALID [2022-04-28 14:09:12,835 INFO L290 TraceCheckUtils]: 142: Hoare triple {24766#false} assume 0 == ~cond; {24766#false} is VALID [2022-04-28 14:09:12,835 INFO L290 TraceCheckUtils]: 143: Hoare triple {24766#false} assume !false; {24766#false} is VALID [2022-04-28 14:09:12,836 INFO L134 CoverageAnalysis]: Checked inductivity of 875 backedges. 28 proven. 847 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 14:09:12,836 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 14:09:13,697 INFO L290 TraceCheckUtils]: 143: Hoare triple {24766#false} assume !false; {24766#false} is VALID [2022-04-28 14:09:13,698 INFO L290 TraceCheckUtils]: 142: Hoare triple {24766#false} assume 0 == ~cond; {24766#false} is VALID [2022-04-28 14:09:13,698 INFO L290 TraceCheckUtils]: 141: Hoare triple {24766#false} ~cond := #in~cond; {24766#false} is VALID [2022-04-28 14:09:13,698 INFO L272 TraceCheckUtils]: 140: Hoare triple {24766#false} call __VERIFIER_assert((if ~q~0 == ~x~0 * ~y~0 then 1 else 0)); {24766#false} is VALID [2022-04-28 14:09:13,698 INFO L290 TraceCheckUtils]: 139: Hoare triple {25227#(< |main_#t~post6| 100)} assume !(#t~post6 < 100);havoc #t~post6; {24766#false} is VALID [2022-04-28 14:09:13,698 INFO L290 TraceCheckUtils]: 138: Hoare triple {25231#(< ~counter~0 100)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {25227#(< |main_#t~post6| 100)} is VALID [2022-04-28 14:09:13,699 INFO L290 TraceCheckUtils]: 137: Hoare triple {25231#(< ~counter~0 100)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {25231#(< ~counter~0 100)} is VALID [2022-04-28 14:09:13,699 INFO L290 TraceCheckUtils]: 136: Hoare triple {25231#(< ~counter~0 100)} assume !!(0 != ~a~0 && 0 != ~b~0); {25231#(< ~counter~0 100)} is VALID [2022-04-28 14:09:13,699 INFO L284 TraceCheckUtils]: 135: Hoare quadruple {24765#true} {25231#(< ~counter~0 100)} #71#return; {25231#(< ~counter~0 100)} is VALID [2022-04-28 14:09:13,699 INFO L290 TraceCheckUtils]: 134: Hoare triple {24765#true} assume true; {24765#true} is VALID [2022-04-28 14:09:13,700 INFO L290 TraceCheckUtils]: 133: Hoare triple {24765#true} assume !(0 == ~cond); {24765#true} is VALID [2022-04-28 14:09:13,700 INFO L290 TraceCheckUtils]: 132: Hoare triple {24765#true} ~cond := #in~cond; {24765#true} is VALID [2022-04-28 14:09:13,700 INFO L272 TraceCheckUtils]: 131: Hoare triple {25231#(< ~counter~0 100)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {24765#true} is VALID [2022-04-28 14:09:13,700 INFO L290 TraceCheckUtils]: 130: Hoare triple {25231#(< ~counter~0 100)} assume !!(#t~post6 < 100);havoc #t~post6; {25231#(< ~counter~0 100)} is VALID [2022-04-28 14:09:13,701 INFO L290 TraceCheckUtils]: 129: Hoare triple {25259#(< ~counter~0 99)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {25231#(< ~counter~0 100)} is VALID [2022-04-28 14:09:13,701 INFO L290 TraceCheckUtils]: 128: Hoare triple {25259#(< ~counter~0 99)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {25259#(< ~counter~0 99)} is VALID [2022-04-28 14:09:13,701 INFO L290 TraceCheckUtils]: 127: Hoare triple {25259#(< ~counter~0 99)} assume !!(0 != ~a~0 && 0 != ~b~0); {25259#(< ~counter~0 99)} is VALID [2022-04-28 14:09:13,702 INFO L284 TraceCheckUtils]: 126: Hoare quadruple {24765#true} {25259#(< ~counter~0 99)} #71#return; {25259#(< ~counter~0 99)} is VALID [2022-04-28 14:09:13,702 INFO L290 TraceCheckUtils]: 125: Hoare triple {24765#true} assume true; {24765#true} is VALID [2022-04-28 14:09:13,702 INFO L290 TraceCheckUtils]: 124: Hoare triple {24765#true} assume !(0 == ~cond); {24765#true} is VALID [2022-04-28 14:09:13,702 INFO L290 TraceCheckUtils]: 123: Hoare triple {24765#true} ~cond := #in~cond; {24765#true} is VALID [2022-04-28 14:09:13,702 INFO L272 TraceCheckUtils]: 122: Hoare triple {25259#(< ~counter~0 99)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {24765#true} is VALID [2022-04-28 14:09:13,702 INFO L290 TraceCheckUtils]: 121: Hoare triple {25259#(< ~counter~0 99)} assume !!(#t~post6 < 100);havoc #t~post6; {25259#(< ~counter~0 99)} is VALID [2022-04-28 14:09:13,702 INFO L290 TraceCheckUtils]: 120: Hoare triple {25287#(< ~counter~0 98)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {25259#(< ~counter~0 99)} is VALID [2022-04-28 14:09:13,703 INFO L290 TraceCheckUtils]: 119: Hoare triple {25287#(< ~counter~0 98)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {25287#(< ~counter~0 98)} is VALID [2022-04-28 14:09:13,703 INFO L290 TraceCheckUtils]: 118: Hoare triple {25287#(< ~counter~0 98)} assume !!(0 != ~a~0 && 0 != ~b~0); {25287#(< ~counter~0 98)} is VALID [2022-04-28 14:09:13,704 INFO L284 TraceCheckUtils]: 117: Hoare quadruple {24765#true} {25287#(< ~counter~0 98)} #71#return; {25287#(< ~counter~0 98)} is VALID [2022-04-28 14:09:13,704 INFO L290 TraceCheckUtils]: 116: Hoare triple {24765#true} assume true; {24765#true} is VALID [2022-04-28 14:09:13,704 INFO L290 TraceCheckUtils]: 115: Hoare triple {24765#true} assume !(0 == ~cond); {24765#true} is VALID [2022-04-28 14:09:13,704 INFO L290 TraceCheckUtils]: 114: Hoare triple {24765#true} ~cond := #in~cond; {24765#true} is VALID [2022-04-28 14:09:13,704 INFO L272 TraceCheckUtils]: 113: Hoare triple {25287#(< ~counter~0 98)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {24765#true} is VALID [2022-04-28 14:09:13,704 INFO L290 TraceCheckUtils]: 112: Hoare triple {25287#(< ~counter~0 98)} assume !!(#t~post6 < 100);havoc #t~post6; {25287#(< ~counter~0 98)} is VALID [2022-04-28 14:09:13,704 INFO L290 TraceCheckUtils]: 111: Hoare triple {25315#(< ~counter~0 97)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {25287#(< ~counter~0 98)} is VALID [2022-04-28 14:09:13,705 INFO L290 TraceCheckUtils]: 110: Hoare triple {25315#(< ~counter~0 97)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {25315#(< ~counter~0 97)} is VALID [2022-04-28 14:09:13,705 INFO L290 TraceCheckUtils]: 109: Hoare triple {25315#(< ~counter~0 97)} assume !!(0 != ~a~0 && 0 != ~b~0); {25315#(< ~counter~0 97)} is VALID [2022-04-28 14:09:13,706 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {24765#true} {25315#(< ~counter~0 97)} #71#return; {25315#(< ~counter~0 97)} is VALID [2022-04-28 14:09:13,706 INFO L290 TraceCheckUtils]: 107: Hoare triple {24765#true} assume true; {24765#true} is VALID [2022-04-28 14:09:13,706 INFO L290 TraceCheckUtils]: 106: Hoare triple {24765#true} assume !(0 == ~cond); {24765#true} is VALID [2022-04-28 14:09:13,706 INFO L290 TraceCheckUtils]: 105: Hoare triple {24765#true} ~cond := #in~cond; {24765#true} is VALID [2022-04-28 14:09:13,706 INFO L272 TraceCheckUtils]: 104: Hoare triple {25315#(< ~counter~0 97)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {24765#true} is VALID [2022-04-28 14:09:13,706 INFO L290 TraceCheckUtils]: 103: Hoare triple {25315#(< ~counter~0 97)} assume !!(#t~post6 < 100);havoc #t~post6; {25315#(< ~counter~0 97)} is VALID [2022-04-28 14:09:13,706 INFO L290 TraceCheckUtils]: 102: Hoare triple {25343#(< ~counter~0 96)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {25315#(< ~counter~0 97)} is VALID [2022-04-28 14:09:13,707 INFO L290 TraceCheckUtils]: 101: Hoare triple {25343#(< ~counter~0 96)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {25343#(< ~counter~0 96)} is VALID [2022-04-28 14:09:13,707 INFO L290 TraceCheckUtils]: 100: Hoare triple {25343#(< ~counter~0 96)} assume !!(0 != ~a~0 && 0 != ~b~0); {25343#(< ~counter~0 96)} is VALID [2022-04-28 14:09:13,707 INFO L284 TraceCheckUtils]: 99: Hoare quadruple {24765#true} {25343#(< ~counter~0 96)} #71#return; {25343#(< ~counter~0 96)} is VALID [2022-04-28 14:09:13,708 INFO L290 TraceCheckUtils]: 98: Hoare triple {24765#true} assume true; {24765#true} is VALID [2022-04-28 14:09:13,708 INFO L290 TraceCheckUtils]: 97: Hoare triple {24765#true} assume !(0 == ~cond); {24765#true} is VALID [2022-04-28 14:09:13,708 INFO L290 TraceCheckUtils]: 96: Hoare triple {24765#true} ~cond := #in~cond; {24765#true} is VALID [2022-04-28 14:09:13,708 INFO L272 TraceCheckUtils]: 95: Hoare triple {25343#(< ~counter~0 96)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {24765#true} is VALID [2022-04-28 14:09:13,708 INFO L290 TraceCheckUtils]: 94: Hoare triple {25343#(< ~counter~0 96)} assume !!(#t~post6 < 100);havoc #t~post6; {25343#(< ~counter~0 96)} is VALID [2022-04-28 14:09:13,708 INFO L290 TraceCheckUtils]: 93: Hoare triple {25371#(< ~counter~0 95)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {25343#(< ~counter~0 96)} is VALID [2022-04-28 14:09:13,709 INFO L290 TraceCheckUtils]: 92: Hoare triple {25371#(< ~counter~0 95)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {25371#(< ~counter~0 95)} is VALID [2022-04-28 14:09:13,709 INFO L290 TraceCheckUtils]: 91: Hoare triple {25371#(< ~counter~0 95)} assume !!(0 != ~a~0 && 0 != ~b~0); {25371#(< ~counter~0 95)} is VALID [2022-04-28 14:09:13,709 INFO L284 TraceCheckUtils]: 90: Hoare quadruple {24765#true} {25371#(< ~counter~0 95)} #71#return; {25371#(< ~counter~0 95)} is VALID [2022-04-28 14:09:13,710 INFO L290 TraceCheckUtils]: 89: Hoare triple {24765#true} assume true; {24765#true} is VALID [2022-04-28 14:09:13,710 INFO L290 TraceCheckUtils]: 88: Hoare triple {24765#true} assume !(0 == ~cond); {24765#true} is VALID [2022-04-28 14:09:13,710 INFO L290 TraceCheckUtils]: 87: Hoare triple {24765#true} ~cond := #in~cond; {24765#true} is VALID [2022-04-28 14:09:13,710 INFO L272 TraceCheckUtils]: 86: Hoare triple {25371#(< ~counter~0 95)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {24765#true} is VALID [2022-04-28 14:09:13,710 INFO L290 TraceCheckUtils]: 85: Hoare triple {25371#(< ~counter~0 95)} assume !!(#t~post6 < 100);havoc #t~post6; {25371#(< ~counter~0 95)} is VALID [2022-04-28 14:09:13,710 INFO L290 TraceCheckUtils]: 84: Hoare triple {25399#(< ~counter~0 94)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {25371#(< ~counter~0 95)} is VALID [2022-04-28 14:09:13,711 INFO L290 TraceCheckUtils]: 83: Hoare triple {25399#(< ~counter~0 94)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {25399#(< ~counter~0 94)} is VALID [2022-04-28 14:09:13,711 INFO L290 TraceCheckUtils]: 82: Hoare triple {25399#(< ~counter~0 94)} assume !!(0 != ~a~0 && 0 != ~b~0); {25399#(< ~counter~0 94)} is VALID [2022-04-28 14:09:13,711 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {24765#true} {25399#(< ~counter~0 94)} #71#return; {25399#(< ~counter~0 94)} is VALID [2022-04-28 14:09:13,711 INFO L290 TraceCheckUtils]: 80: Hoare triple {24765#true} assume true; {24765#true} is VALID [2022-04-28 14:09:13,712 INFO L290 TraceCheckUtils]: 79: Hoare triple {24765#true} assume !(0 == ~cond); {24765#true} is VALID [2022-04-28 14:09:13,712 INFO L290 TraceCheckUtils]: 78: Hoare triple {24765#true} ~cond := #in~cond; {24765#true} is VALID [2022-04-28 14:09:13,712 INFO L272 TraceCheckUtils]: 77: Hoare triple {25399#(< ~counter~0 94)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {24765#true} is VALID [2022-04-28 14:09:13,712 INFO L290 TraceCheckUtils]: 76: Hoare triple {25399#(< ~counter~0 94)} assume !!(#t~post6 < 100);havoc #t~post6; {25399#(< ~counter~0 94)} is VALID [2022-04-28 14:09:13,712 INFO L290 TraceCheckUtils]: 75: Hoare triple {25427#(< ~counter~0 93)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {25399#(< ~counter~0 94)} is VALID [2022-04-28 14:09:13,713 INFO L290 TraceCheckUtils]: 74: Hoare triple {25427#(< ~counter~0 93)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {25427#(< ~counter~0 93)} is VALID [2022-04-28 14:09:13,713 INFO L290 TraceCheckUtils]: 73: Hoare triple {25427#(< ~counter~0 93)} assume !!(0 != ~a~0 && 0 != ~b~0); {25427#(< ~counter~0 93)} is VALID [2022-04-28 14:09:13,713 INFO L284 TraceCheckUtils]: 72: Hoare quadruple {24765#true} {25427#(< ~counter~0 93)} #71#return; {25427#(< ~counter~0 93)} is VALID [2022-04-28 14:09:13,713 INFO L290 TraceCheckUtils]: 71: Hoare triple {24765#true} assume true; {24765#true} is VALID [2022-04-28 14:09:13,713 INFO L290 TraceCheckUtils]: 70: Hoare triple {24765#true} assume !(0 == ~cond); {24765#true} is VALID [2022-04-28 14:09:13,714 INFO L290 TraceCheckUtils]: 69: Hoare triple {24765#true} ~cond := #in~cond; {24765#true} is VALID [2022-04-28 14:09:13,714 INFO L272 TraceCheckUtils]: 68: Hoare triple {25427#(< ~counter~0 93)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {24765#true} is VALID [2022-04-28 14:09:13,714 INFO L290 TraceCheckUtils]: 67: Hoare triple {25427#(< ~counter~0 93)} assume !!(#t~post6 < 100);havoc #t~post6; {25427#(< ~counter~0 93)} is VALID [2022-04-28 14:09:13,714 INFO L290 TraceCheckUtils]: 66: Hoare triple {25455#(< ~counter~0 92)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {25427#(< ~counter~0 93)} is VALID [2022-04-28 14:09:13,720 INFO L290 TraceCheckUtils]: 65: Hoare triple {25455#(< ~counter~0 92)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {25455#(< ~counter~0 92)} is VALID [2022-04-28 14:09:13,721 INFO L290 TraceCheckUtils]: 64: Hoare triple {25455#(< ~counter~0 92)} assume !!(0 != ~a~0 && 0 != ~b~0); {25455#(< ~counter~0 92)} is VALID [2022-04-28 14:09:13,721 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {24765#true} {25455#(< ~counter~0 92)} #71#return; {25455#(< ~counter~0 92)} is VALID [2022-04-28 14:09:13,721 INFO L290 TraceCheckUtils]: 62: Hoare triple {24765#true} assume true; {24765#true} is VALID [2022-04-28 14:09:13,721 INFO L290 TraceCheckUtils]: 61: Hoare triple {24765#true} assume !(0 == ~cond); {24765#true} is VALID [2022-04-28 14:09:13,721 INFO L290 TraceCheckUtils]: 60: Hoare triple {24765#true} ~cond := #in~cond; {24765#true} is VALID [2022-04-28 14:09:13,721 INFO L272 TraceCheckUtils]: 59: Hoare triple {25455#(< ~counter~0 92)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {24765#true} is VALID [2022-04-28 14:09:13,722 INFO L290 TraceCheckUtils]: 58: Hoare triple {25455#(< ~counter~0 92)} assume !!(#t~post6 < 100);havoc #t~post6; {25455#(< ~counter~0 92)} is VALID [2022-04-28 14:09:13,722 INFO L290 TraceCheckUtils]: 57: Hoare triple {25483#(< ~counter~0 91)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {25455#(< ~counter~0 92)} is VALID [2022-04-28 14:09:13,723 INFO L290 TraceCheckUtils]: 56: Hoare triple {25483#(< ~counter~0 91)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {25483#(< ~counter~0 91)} is VALID [2022-04-28 14:09:13,723 INFO L290 TraceCheckUtils]: 55: Hoare triple {25483#(< ~counter~0 91)} assume !!(0 != ~a~0 && 0 != ~b~0); {25483#(< ~counter~0 91)} is VALID [2022-04-28 14:09:13,723 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {24765#true} {25483#(< ~counter~0 91)} #71#return; {25483#(< ~counter~0 91)} is VALID [2022-04-28 14:09:13,724 INFO L290 TraceCheckUtils]: 53: Hoare triple {24765#true} assume true; {24765#true} is VALID [2022-04-28 14:09:13,724 INFO L290 TraceCheckUtils]: 52: Hoare triple {24765#true} assume !(0 == ~cond); {24765#true} is VALID [2022-04-28 14:09:13,724 INFO L290 TraceCheckUtils]: 51: Hoare triple {24765#true} ~cond := #in~cond; {24765#true} is VALID [2022-04-28 14:09:13,724 INFO L272 TraceCheckUtils]: 50: Hoare triple {25483#(< ~counter~0 91)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {24765#true} is VALID [2022-04-28 14:09:13,724 INFO L290 TraceCheckUtils]: 49: Hoare triple {25483#(< ~counter~0 91)} assume !!(#t~post6 < 100);havoc #t~post6; {25483#(< ~counter~0 91)} is VALID [2022-04-28 14:09:13,724 INFO L290 TraceCheckUtils]: 48: Hoare triple {25511#(< ~counter~0 90)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {25483#(< ~counter~0 91)} is VALID [2022-04-28 14:09:13,725 INFO L290 TraceCheckUtils]: 47: Hoare triple {25511#(< ~counter~0 90)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {25511#(< ~counter~0 90)} is VALID [2022-04-28 14:09:13,725 INFO L290 TraceCheckUtils]: 46: Hoare triple {25511#(< ~counter~0 90)} assume !!(0 != ~a~0 && 0 != ~b~0); {25511#(< ~counter~0 90)} is VALID [2022-04-28 14:09:13,725 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {24765#true} {25511#(< ~counter~0 90)} #71#return; {25511#(< ~counter~0 90)} is VALID [2022-04-28 14:09:13,725 INFO L290 TraceCheckUtils]: 44: Hoare triple {24765#true} assume true; {24765#true} is VALID [2022-04-28 14:09:13,726 INFO L290 TraceCheckUtils]: 43: Hoare triple {24765#true} assume !(0 == ~cond); {24765#true} is VALID [2022-04-28 14:09:13,726 INFO L290 TraceCheckUtils]: 42: Hoare triple {24765#true} ~cond := #in~cond; {24765#true} is VALID [2022-04-28 14:09:13,726 INFO L272 TraceCheckUtils]: 41: Hoare triple {25511#(< ~counter~0 90)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {24765#true} is VALID [2022-04-28 14:09:13,726 INFO L290 TraceCheckUtils]: 40: Hoare triple {25511#(< ~counter~0 90)} assume !!(#t~post6 < 100);havoc #t~post6; {25511#(< ~counter~0 90)} is VALID [2022-04-28 14:09:13,726 INFO L290 TraceCheckUtils]: 39: Hoare triple {25539#(< ~counter~0 89)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {25511#(< ~counter~0 90)} is VALID [2022-04-28 14:09:13,727 INFO L290 TraceCheckUtils]: 38: Hoare triple {25539#(< ~counter~0 89)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {25539#(< ~counter~0 89)} is VALID [2022-04-28 14:09:13,727 INFO L290 TraceCheckUtils]: 37: Hoare triple {25539#(< ~counter~0 89)} assume !!(0 != ~a~0 && 0 != ~b~0); {25539#(< ~counter~0 89)} is VALID [2022-04-28 14:09:13,727 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {24765#true} {25539#(< ~counter~0 89)} #71#return; {25539#(< ~counter~0 89)} is VALID [2022-04-28 14:09:13,727 INFO L290 TraceCheckUtils]: 35: Hoare triple {24765#true} assume true; {24765#true} is VALID [2022-04-28 14:09:13,727 INFO L290 TraceCheckUtils]: 34: Hoare triple {24765#true} assume !(0 == ~cond); {24765#true} is VALID [2022-04-28 14:09:13,728 INFO L290 TraceCheckUtils]: 33: Hoare triple {24765#true} ~cond := #in~cond; {24765#true} is VALID [2022-04-28 14:09:13,728 INFO L272 TraceCheckUtils]: 32: Hoare triple {25539#(< ~counter~0 89)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {24765#true} is VALID [2022-04-28 14:09:13,728 INFO L290 TraceCheckUtils]: 31: Hoare triple {25539#(< ~counter~0 89)} assume !!(#t~post6 < 100);havoc #t~post6; {25539#(< ~counter~0 89)} is VALID [2022-04-28 14:09:13,728 INFO L290 TraceCheckUtils]: 30: Hoare triple {25567#(< ~counter~0 88)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {25539#(< ~counter~0 89)} is VALID [2022-04-28 14:09:13,729 INFO L290 TraceCheckUtils]: 29: Hoare triple {25567#(< ~counter~0 88)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {25567#(< ~counter~0 88)} is VALID [2022-04-28 14:09:13,729 INFO L290 TraceCheckUtils]: 28: Hoare triple {25567#(< ~counter~0 88)} assume !!(0 != ~a~0 && 0 != ~b~0); {25567#(< ~counter~0 88)} is VALID [2022-04-28 14:09:13,729 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {24765#true} {25567#(< ~counter~0 88)} #71#return; {25567#(< ~counter~0 88)} is VALID [2022-04-28 14:09:13,729 INFO L290 TraceCheckUtils]: 26: Hoare triple {24765#true} assume true; {24765#true} is VALID [2022-04-28 14:09:13,729 INFO L290 TraceCheckUtils]: 25: Hoare triple {24765#true} assume !(0 == ~cond); {24765#true} is VALID [2022-04-28 14:09:13,729 INFO L290 TraceCheckUtils]: 24: Hoare triple {24765#true} ~cond := #in~cond; {24765#true} is VALID [2022-04-28 14:09:13,730 INFO L272 TraceCheckUtils]: 23: Hoare triple {25567#(< ~counter~0 88)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {24765#true} is VALID [2022-04-28 14:09:13,730 INFO L290 TraceCheckUtils]: 22: Hoare triple {25567#(< ~counter~0 88)} assume !!(#t~post6 < 100);havoc #t~post6; {25567#(< ~counter~0 88)} is VALID [2022-04-28 14:09:13,730 INFO L290 TraceCheckUtils]: 21: Hoare triple {25595#(< ~counter~0 87)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {25567#(< ~counter~0 88)} is VALID [2022-04-28 14:09:13,730 INFO L290 TraceCheckUtils]: 20: Hoare triple {25595#(< ~counter~0 87)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {25595#(< ~counter~0 87)} is VALID [2022-04-28 14:09:13,731 INFO L290 TraceCheckUtils]: 19: Hoare triple {25595#(< ~counter~0 87)} assume !!(0 != ~a~0 && 0 != ~b~0); {25595#(< ~counter~0 87)} is VALID [2022-04-28 14:09:13,731 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {24765#true} {25595#(< ~counter~0 87)} #71#return; {25595#(< ~counter~0 87)} is VALID [2022-04-28 14:09:13,731 INFO L290 TraceCheckUtils]: 17: Hoare triple {24765#true} assume true; {24765#true} is VALID [2022-04-28 14:09:13,731 INFO L290 TraceCheckUtils]: 16: Hoare triple {24765#true} assume !(0 == ~cond); {24765#true} is VALID [2022-04-28 14:09:13,731 INFO L290 TraceCheckUtils]: 15: Hoare triple {24765#true} ~cond := #in~cond; {24765#true} is VALID [2022-04-28 14:09:13,731 INFO L272 TraceCheckUtils]: 14: Hoare triple {25595#(< ~counter~0 87)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {24765#true} is VALID [2022-04-28 14:09:13,732 INFO L290 TraceCheckUtils]: 13: Hoare triple {25595#(< ~counter~0 87)} assume !!(#t~post6 < 100);havoc #t~post6; {25595#(< ~counter~0 87)} is VALID [2022-04-28 14:09:13,732 INFO L290 TraceCheckUtils]: 12: Hoare triple {25623#(< ~counter~0 86)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {25595#(< ~counter~0 87)} is VALID [2022-04-28 14:09:13,732 INFO L290 TraceCheckUtils]: 11: Hoare triple {25623#(< ~counter~0 86)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {25623#(< ~counter~0 86)} is VALID [2022-04-28 14:09:13,733 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {24765#true} {25623#(< ~counter~0 86)} #69#return; {25623#(< ~counter~0 86)} is VALID [2022-04-28 14:09:13,733 INFO L290 TraceCheckUtils]: 9: Hoare triple {24765#true} assume true; {24765#true} is VALID [2022-04-28 14:09:13,733 INFO L290 TraceCheckUtils]: 8: Hoare triple {24765#true} assume !(0 == ~cond); {24765#true} is VALID [2022-04-28 14:09:13,733 INFO L290 TraceCheckUtils]: 7: Hoare triple {24765#true} ~cond := #in~cond; {24765#true} is VALID [2022-04-28 14:09:13,733 INFO L272 TraceCheckUtils]: 6: Hoare triple {25623#(< ~counter~0 86)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {24765#true} is VALID [2022-04-28 14:09:13,733 INFO L290 TraceCheckUtils]: 5: Hoare triple {25623#(< ~counter~0 86)} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {25623#(< ~counter~0 86)} is VALID [2022-04-28 14:09:13,734 INFO L272 TraceCheckUtils]: 4: Hoare triple {25623#(< ~counter~0 86)} call #t~ret7 := main(); {25623#(< ~counter~0 86)} is VALID [2022-04-28 14:09:13,734 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25623#(< ~counter~0 86)} {24765#true} #77#return; {25623#(< ~counter~0 86)} is VALID [2022-04-28 14:09:13,734 INFO L290 TraceCheckUtils]: 2: Hoare triple {25623#(< ~counter~0 86)} assume true; {25623#(< ~counter~0 86)} is VALID [2022-04-28 14:09:13,734 INFO L290 TraceCheckUtils]: 1: Hoare triple {24765#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(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {25623#(< ~counter~0 86)} is VALID [2022-04-28 14:09:13,735 INFO L272 TraceCheckUtils]: 0: Hoare triple {24765#true} call ULTIMATE.init(); {24765#true} is VALID [2022-04-28 14:09:13,735 INFO L134 CoverageAnalysis]: Checked inductivity of 875 backedges. 28 proven. 483 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2022-04-28 14:09:13,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:09:13,735 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [797353331] [2022-04-28 14:09:13,735 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 14:09:13,735 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1887425354] [2022-04-28 14:09:13,735 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1887425354] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 14:09:13,735 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 14:09:13,735 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 34 [2022-04-28 14:09:13,736 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:09:13,736 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2129780878] [2022-04-28 14:09:13,736 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2129780878] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:09:13,736 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:09:13,736 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-04-28 14:09:13,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1184341244] [2022-04-28 14:09:13,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:09:13,736 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 6.111111111111111) internal successors, (110), 17 states have internal predecessors, (110), 17 states have call successors, (18), 17 states have call predecessors, (18), 15 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) Word has length 144 [2022-04-28 14:09:13,737 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:09:13,737 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 18 states, 18 states have (on average 6.111111111111111) internal successors, (110), 17 states have internal predecessors, (110), 17 states have call successors, (18), 17 states have call predecessors, (18), 15 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-28 14:09:13,843 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 144 edges. 144 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:09:13,843 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-04-28 14:09:13,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:09:13,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-04-28 14:09:13,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=501, Invalid=621, Unknown=0, NotChecked=0, Total=1122 [2022-04-28 14:09:13,844 INFO L87 Difference]: Start difference. First operand 186 states and 230 transitions. Second operand has 18 states, 18 states have (on average 6.111111111111111) internal successors, (110), 17 states have internal predecessors, (110), 17 states have call successors, (18), 17 states have call predecessors, (18), 15 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-28 14:09:14,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:09:14,755 INFO L93 Difference]: Finished difference Result 205 states and 253 transitions. [2022-04-28 14:09:14,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-04-28 14:09:14,755 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 6.111111111111111) internal successors, (110), 17 states have internal predecessors, (110), 17 states have call successors, (18), 17 states have call predecessors, (18), 15 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) Word has length 144 [2022-04-28 14:09:14,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:09:14,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 6.111111111111111) internal successors, (110), 17 states have internal predecessors, (110), 17 states have call successors, (18), 17 states have call predecessors, (18), 15 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-28 14:09:14,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 239 transitions. [2022-04-28 14:09:14,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 6.111111111111111) internal successors, (110), 17 states have internal predecessors, (110), 17 states have call successors, (18), 17 states have call predecessors, (18), 15 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-28 14:09:14,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 239 transitions. [2022-04-28 14:09:14,762 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 32 states and 239 transitions. [2022-04-28 14:09:15,029 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 239 edges. 239 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:09:15,032 INFO L225 Difference]: With dead ends: 205 [2022-04-28 14:09:15,032 INFO L226 Difference]: Without dead ends: 197 [2022-04-28 14:09:15,033 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 301 GetRequests, 255 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=963, Invalid=1293, Unknown=0, NotChecked=0, Total=2256 [2022-04-28 14:09:15,033 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 187 mSDsluCounter, 218 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 262 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 14:09:15,034 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [187 Valid, 262 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 14:09:15,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2022-04-28 14:09:15,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 197. [2022-04-28 14:09:15,425 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:09:15,426 INFO L82 GeneralOperation]: Start isEquivalent. First operand 197 states. Second operand has 197 states, 156 states have (on average 1.3076923076923077) internal successors, (204), 157 states have internal predecessors, (204), 21 states have call successors, (21), 20 states have call predecessors, (21), 19 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-28 14:09:15,426 INFO L74 IsIncluded]: Start isIncluded. First operand 197 states. Second operand has 197 states, 156 states have (on average 1.3076923076923077) internal successors, (204), 157 states have internal predecessors, (204), 21 states have call successors, (21), 20 states have call predecessors, (21), 19 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-28 14:09:15,426 INFO L87 Difference]: Start difference. First operand 197 states. Second operand has 197 states, 156 states have (on average 1.3076923076923077) internal successors, (204), 157 states have internal predecessors, (204), 21 states have call successors, (21), 20 states have call predecessors, (21), 19 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-28 14:09:15,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:09:15,430 INFO L93 Difference]: Finished difference Result 197 states and 244 transitions. [2022-04-28 14:09:15,431 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 244 transitions. [2022-04-28 14:09:15,432 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:09:15,432 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:09:15,432 INFO L74 IsIncluded]: Start isIncluded. First operand has 197 states, 156 states have (on average 1.3076923076923077) internal successors, (204), 157 states have internal predecessors, (204), 21 states have call successors, (21), 20 states have call predecessors, (21), 19 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand 197 states. [2022-04-28 14:09:15,432 INFO L87 Difference]: Start difference. First operand has 197 states, 156 states have (on average 1.3076923076923077) internal successors, (204), 157 states have internal predecessors, (204), 21 states have call successors, (21), 20 states have call predecessors, (21), 19 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand 197 states. [2022-04-28 14:09:15,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:09:15,435 INFO L93 Difference]: Finished difference Result 197 states and 244 transitions. [2022-04-28 14:09:15,436 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 244 transitions. [2022-04-28 14:09:15,436 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:09:15,436 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:09:15,436 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:09:15,436 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:09:15,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 156 states have (on average 1.3076923076923077) internal successors, (204), 157 states have internal predecessors, (204), 21 states have call successors, (21), 20 states have call predecessors, (21), 19 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-28 14:09:15,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 244 transitions. [2022-04-28 14:09:15,440 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 244 transitions. Word has length 144 [2022-04-28 14:09:15,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:09:15,440 INFO L495 AbstractCegarLoop]: Abstraction has 197 states and 244 transitions. [2022-04-28 14:09:15,440 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 6.111111111111111) internal successors, (110), 17 states have internal predecessors, (110), 17 states have call successors, (18), 17 states have call predecessors, (18), 15 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-28 14:09:15,440 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 197 states and 244 transitions. [2022-04-28 14:09:45,791 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 244 edges. 230 inductive. 0 not inductive. 14 times theorem prover too weak to decide inductivity. [2022-04-28 14:09:45,792 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 244 transitions. [2022-04-28 14:09:45,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2022-04-28 14:09:45,792 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:09:45,792 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 15, 15, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 14:09:45,812 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Ended with exit code 0 [2022-04-28 14:09:45,993 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2022-04-28 14:09:45,993 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:09:45,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:09:45,993 INFO L85 PathProgramCache]: Analyzing trace with hash 1855494722, now seen corresponding path program 29 times [2022-04-28 14:09:45,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:09:45,993 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [702823841] [2022-04-28 14:09:52,058 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 14:09:52,058 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 14:09:52,058 INFO L85 PathProgramCache]: Analyzing trace with hash 1855494722, now seen corresponding path program 30 times [2022-04-28 14:09:52,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:09:52,058 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011769902] [2022-04-28 14:09:52,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:09:52,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:09:52,080 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 14:09:52,080 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [867717584] [2022-04-28 14:09:52,081 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 14:09:52,081 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 14:09:52,081 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 14:09:52,084 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 14:09:52,085 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2022-04-28 14:09:52,304 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 16 check-sat command(s) [2022-04-28 14:09:52,304 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 14:09:52,306 INFO L263 TraceCheckSpWp]: Trace formula consists of 476 conjuncts, 35 conjunts are in the unsatisfiable core [2022-04-28 14:09:52,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:09:52,336 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 14:09:53,113 INFO L272 TraceCheckUtils]: 0: Hoare triple {26888#true} call ULTIMATE.init(); {26888#true} is VALID [2022-04-28 14:09:53,113 INFO L290 TraceCheckUtils]: 1: Hoare triple {26888#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(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {26896#(<= ~counter~0 0)} is VALID [2022-04-28 14:09:53,113 INFO L290 TraceCheckUtils]: 2: Hoare triple {26896#(<= ~counter~0 0)} assume true; {26896#(<= ~counter~0 0)} is VALID [2022-04-28 14:09:53,114 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26896#(<= ~counter~0 0)} {26888#true} #77#return; {26896#(<= ~counter~0 0)} is VALID [2022-04-28 14:09:53,114 INFO L272 TraceCheckUtils]: 4: Hoare triple {26896#(<= ~counter~0 0)} call #t~ret7 := main(); {26896#(<= ~counter~0 0)} is VALID [2022-04-28 14:09:53,114 INFO L290 TraceCheckUtils]: 5: Hoare triple {26896#(<= ~counter~0 0)} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {26896#(<= ~counter~0 0)} is VALID [2022-04-28 14:09:53,115 INFO L272 TraceCheckUtils]: 6: Hoare triple {26896#(<= ~counter~0 0)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {26896#(<= ~counter~0 0)} is VALID [2022-04-28 14:09:53,115 INFO L290 TraceCheckUtils]: 7: Hoare triple {26896#(<= ~counter~0 0)} ~cond := #in~cond; {26896#(<= ~counter~0 0)} is VALID [2022-04-28 14:09:53,115 INFO L290 TraceCheckUtils]: 8: Hoare triple {26896#(<= ~counter~0 0)} assume !(0 == ~cond); {26896#(<= ~counter~0 0)} is VALID [2022-04-28 14:09:53,116 INFO L290 TraceCheckUtils]: 9: Hoare triple {26896#(<= ~counter~0 0)} assume true; {26896#(<= ~counter~0 0)} is VALID [2022-04-28 14:09:53,116 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {26896#(<= ~counter~0 0)} {26896#(<= ~counter~0 0)} #69#return; {26896#(<= ~counter~0 0)} is VALID [2022-04-28 14:09:53,116 INFO L290 TraceCheckUtils]: 11: Hoare triple {26896#(<= ~counter~0 0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {26896#(<= ~counter~0 0)} is VALID [2022-04-28 14:09:53,117 INFO L290 TraceCheckUtils]: 12: Hoare triple {26896#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {26930#(<= ~counter~0 1)} is VALID [2022-04-28 14:09:53,117 INFO L290 TraceCheckUtils]: 13: Hoare triple {26930#(<= ~counter~0 1)} assume !!(#t~post6 < 100);havoc #t~post6; {26930#(<= ~counter~0 1)} is VALID [2022-04-28 14:09:53,118 INFO L272 TraceCheckUtils]: 14: Hoare triple {26930#(<= ~counter~0 1)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {26930#(<= ~counter~0 1)} is VALID [2022-04-28 14:09:53,118 INFO L290 TraceCheckUtils]: 15: Hoare triple {26930#(<= ~counter~0 1)} ~cond := #in~cond; {26930#(<= ~counter~0 1)} is VALID [2022-04-28 14:09:53,118 INFO L290 TraceCheckUtils]: 16: Hoare triple {26930#(<= ~counter~0 1)} assume !(0 == ~cond); {26930#(<= ~counter~0 1)} is VALID [2022-04-28 14:09:53,119 INFO L290 TraceCheckUtils]: 17: Hoare triple {26930#(<= ~counter~0 1)} assume true; {26930#(<= ~counter~0 1)} is VALID [2022-04-28 14:09:53,119 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {26930#(<= ~counter~0 1)} {26930#(<= ~counter~0 1)} #71#return; {26930#(<= ~counter~0 1)} is VALID [2022-04-28 14:09:53,119 INFO L290 TraceCheckUtils]: 19: Hoare triple {26930#(<= ~counter~0 1)} assume !!(0 != ~a~0 && 0 != ~b~0); {26930#(<= ~counter~0 1)} is VALID [2022-04-28 14:09:53,120 INFO L290 TraceCheckUtils]: 20: Hoare triple {26930#(<= ~counter~0 1)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {26930#(<= ~counter~0 1)} is VALID [2022-04-28 14:09:53,120 INFO L290 TraceCheckUtils]: 21: Hoare triple {26930#(<= ~counter~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {26958#(<= ~counter~0 2)} is VALID [2022-04-28 14:09:53,120 INFO L290 TraceCheckUtils]: 22: Hoare triple {26958#(<= ~counter~0 2)} assume !!(#t~post6 < 100);havoc #t~post6; {26958#(<= ~counter~0 2)} is VALID [2022-04-28 14:09:53,121 INFO L272 TraceCheckUtils]: 23: Hoare triple {26958#(<= ~counter~0 2)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {26958#(<= ~counter~0 2)} is VALID [2022-04-28 14:09:53,121 INFO L290 TraceCheckUtils]: 24: Hoare triple {26958#(<= ~counter~0 2)} ~cond := #in~cond; {26958#(<= ~counter~0 2)} is VALID [2022-04-28 14:09:53,122 INFO L290 TraceCheckUtils]: 25: Hoare triple {26958#(<= ~counter~0 2)} assume !(0 == ~cond); {26958#(<= ~counter~0 2)} is VALID [2022-04-28 14:09:53,122 INFO L290 TraceCheckUtils]: 26: Hoare triple {26958#(<= ~counter~0 2)} assume true; {26958#(<= ~counter~0 2)} is VALID [2022-04-28 14:09:53,122 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {26958#(<= ~counter~0 2)} {26958#(<= ~counter~0 2)} #71#return; {26958#(<= ~counter~0 2)} is VALID [2022-04-28 14:09:53,123 INFO L290 TraceCheckUtils]: 28: Hoare triple {26958#(<= ~counter~0 2)} assume !!(0 != ~a~0 && 0 != ~b~0); {26958#(<= ~counter~0 2)} is VALID [2022-04-28 14:09:53,123 INFO L290 TraceCheckUtils]: 29: Hoare triple {26958#(<= ~counter~0 2)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {26958#(<= ~counter~0 2)} is VALID [2022-04-28 14:09:53,123 INFO L290 TraceCheckUtils]: 30: Hoare triple {26958#(<= ~counter~0 2)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {26986#(<= ~counter~0 3)} is VALID [2022-04-28 14:09:53,124 INFO L290 TraceCheckUtils]: 31: Hoare triple {26986#(<= ~counter~0 3)} assume !!(#t~post6 < 100);havoc #t~post6; {26986#(<= ~counter~0 3)} is VALID [2022-04-28 14:09:53,124 INFO L272 TraceCheckUtils]: 32: Hoare triple {26986#(<= ~counter~0 3)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {26986#(<= ~counter~0 3)} is VALID [2022-04-28 14:09:53,124 INFO L290 TraceCheckUtils]: 33: Hoare triple {26986#(<= ~counter~0 3)} ~cond := #in~cond; {26986#(<= ~counter~0 3)} is VALID [2022-04-28 14:09:53,125 INFO L290 TraceCheckUtils]: 34: Hoare triple {26986#(<= ~counter~0 3)} assume !(0 == ~cond); {26986#(<= ~counter~0 3)} is VALID [2022-04-28 14:09:53,125 INFO L290 TraceCheckUtils]: 35: Hoare triple {26986#(<= ~counter~0 3)} assume true; {26986#(<= ~counter~0 3)} is VALID [2022-04-28 14:09:53,126 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {26986#(<= ~counter~0 3)} {26986#(<= ~counter~0 3)} #71#return; {26986#(<= ~counter~0 3)} is VALID [2022-04-28 14:09:53,126 INFO L290 TraceCheckUtils]: 37: Hoare triple {26986#(<= ~counter~0 3)} assume !!(0 != ~a~0 && 0 != ~b~0); {26986#(<= ~counter~0 3)} is VALID [2022-04-28 14:09:53,127 INFO L290 TraceCheckUtils]: 38: Hoare triple {26986#(<= ~counter~0 3)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {26986#(<= ~counter~0 3)} is VALID [2022-04-28 14:09:53,127 INFO L290 TraceCheckUtils]: 39: Hoare triple {26986#(<= ~counter~0 3)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {27014#(<= ~counter~0 4)} is VALID [2022-04-28 14:09:53,127 INFO L290 TraceCheckUtils]: 40: Hoare triple {27014#(<= ~counter~0 4)} assume !!(#t~post6 < 100);havoc #t~post6; {27014#(<= ~counter~0 4)} is VALID [2022-04-28 14:09:53,128 INFO L272 TraceCheckUtils]: 41: Hoare triple {27014#(<= ~counter~0 4)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {27014#(<= ~counter~0 4)} is VALID [2022-04-28 14:09:53,128 INFO L290 TraceCheckUtils]: 42: Hoare triple {27014#(<= ~counter~0 4)} ~cond := #in~cond; {27014#(<= ~counter~0 4)} is VALID [2022-04-28 14:09:53,128 INFO L290 TraceCheckUtils]: 43: Hoare triple {27014#(<= ~counter~0 4)} assume !(0 == ~cond); {27014#(<= ~counter~0 4)} is VALID [2022-04-28 14:09:53,129 INFO L290 TraceCheckUtils]: 44: Hoare triple {27014#(<= ~counter~0 4)} assume true; {27014#(<= ~counter~0 4)} is VALID [2022-04-28 14:09:53,129 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {27014#(<= ~counter~0 4)} {27014#(<= ~counter~0 4)} #71#return; {27014#(<= ~counter~0 4)} is VALID [2022-04-28 14:09:53,130 INFO L290 TraceCheckUtils]: 46: Hoare triple {27014#(<= ~counter~0 4)} assume !!(0 != ~a~0 && 0 != ~b~0); {27014#(<= ~counter~0 4)} is VALID [2022-04-28 14:09:53,130 INFO L290 TraceCheckUtils]: 47: Hoare triple {27014#(<= ~counter~0 4)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {27014#(<= ~counter~0 4)} is VALID [2022-04-28 14:09:53,130 INFO L290 TraceCheckUtils]: 48: Hoare triple {27014#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {27042#(<= ~counter~0 5)} is VALID [2022-04-28 14:09:53,131 INFO L290 TraceCheckUtils]: 49: Hoare triple {27042#(<= ~counter~0 5)} assume !!(#t~post6 < 100);havoc #t~post6; {27042#(<= ~counter~0 5)} is VALID [2022-04-28 14:09:53,131 INFO L272 TraceCheckUtils]: 50: Hoare triple {27042#(<= ~counter~0 5)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {27042#(<= ~counter~0 5)} is VALID [2022-04-28 14:09:53,131 INFO L290 TraceCheckUtils]: 51: Hoare triple {27042#(<= ~counter~0 5)} ~cond := #in~cond; {27042#(<= ~counter~0 5)} is VALID [2022-04-28 14:09:53,132 INFO L290 TraceCheckUtils]: 52: Hoare triple {27042#(<= ~counter~0 5)} assume !(0 == ~cond); {27042#(<= ~counter~0 5)} is VALID [2022-04-28 14:09:53,132 INFO L290 TraceCheckUtils]: 53: Hoare triple {27042#(<= ~counter~0 5)} assume true; {27042#(<= ~counter~0 5)} is VALID [2022-04-28 14:09:53,132 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {27042#(<= ~counter~0 5)} {27042#(<= ~counter~0 5)} #71#return; {27042#(<= ~counter~0 5)} is VALID [2022-04-28 14:09:53,133 INFO L290 TraceCheckUtils]: 55: Hoare triple {27042#(<= ~counter~0 5)} assume !!(0 != ~a~0 && 0 != ~b~0); {27042#(<= ~counter~0 5)} is VALID [2022-04-28 14:09:53,133 INFO L290 TraceCheckUtils]: 56: Hoare triple {27042#(<= ~counter~0 5)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {27042#(<= ~counter~0 5)} is VALID [2022-04-28 14:09:53,133 INFO L290 TraceCheckUtils]: 57: Hoare triple {27042#(<= ~counter~0 5)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {27070#(<= ~counter~0 6)} is VALID [2022-04-28 14:09:53,134 INFO L290 TraceCheckUtils]: 58: Hoare triple {27070#(<= ~counter~0 6)} assume !!(#t~post6 < 100);havoc #t~post6; {27070#(<= ~counter~0 6)} is VALID [2022-04-28 14:09:53,134 INFO L272 TraceCheckUtils]: 59: Hoare triple {27070#(<= ~counter~0 6)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {27070#(<= ~counter~0 6)} is VALID [2022-04-28 14:09:53,135 INFO L290 TraceCheckUtils]: 60: Hoare triple {27070#(<= ~counter~0 6)} ~cond := #in~cond; {27070#(<= ~counter~0 6)} is VALID [2022-04-28 14:09:53,135 INFO L290 TraceCheckUtils]: 61: Hoare triple {27070#(<= ~counter~0 6)} assume !(0 == ~cond); {27070#(<= ~counter~0 6)} is VALID [2022-04-28 14:09:53,135 INFO L290 TraceCheckUtils]: 62: Hoare triple {27070#(<= ~counter~0 6)} assume true; {27070#(<= ~counter~0 6)} is VALID [2022-04-28 14:09:53,136 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {27070#(<= ~counter~0 6)} {27070#(<= ~counter~0 6)} #71#return; {27070#(<= ~counter~0 6)} is VALID [2022-04-28 14:09:53,136 INFO L290 TraceCheckUtils]: 64: Hoare triple {27070#(<= ~counter~0 6)} assume !!(0 != ~a~0 && 0 != ~b~0); {27070#(<= ~counter~0 6)} is VALID [2022-04-28 14:09:53,136 INFO L290 TraceCheckUtils]: 65: Hoare triple {27070#(<= ~counter~0 6)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {27070#(<= ~counter~0 6)} is VALID [2022-04-28 14:09:53,137 INFO L290 TraceCheckUtils]: 66: Hoare triple {27070#(<= ~counter~0 6)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {27098#(<= ~counter~0 7)} is VALID [2022-04-28 14:09:53,137 INFO L290 TraceCheckUtils]: 67: Hoare triple {27098#(<= ~counter~0 7)} assume !!(#t~post6 < 100);havoc #t~post6; {27098#(<= ~counter~0 7)} is VALID [2022-04-28 14:09:53,138 INFO L272 TraceCheckUtils]: 68: Hoare triple {27098#(<= ~counter~0 7)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {27098#(<= ~counter~0 7)} is VALID [2022-04-28 14:09:53,138 INFO L290 TraceCheckUtils]: 69: Hoare triple {27098#(<= ~counter~0 7)} ~cond := #in~cond; {27098#(<= ~counter~0 7)} is VALID [2022-04-28 14:09:53,138 INFO L290 TraceCheckUtils]: 70: Hoare triple {27098#(<= ~counter~0 7)} assume !(0 == ~cond); {27098#(<= ~counter~0 7)} is VALID [2022-04-28 14:09:53,138 INFO L290 TraceCheckUtils]: 71: Hoare triple {27098#(<= ~counter~0 7)} assume true; {27098#(<= ~counter~0 7)} is VALID [2022-04-28 14:09:53,139 INFO L284 TraceCheckUtils]: 72: Hoare quadruple {27098#(<= ~counter~0 7)} {27098#(<= ~counter~0 7)} #71#return; {27098#(<= ~counter~0 7)} is VALID [2022-04-28 14:09:53,139 INFO L290 TraceCheckUtils]: 73: Hoare triple {27098#(<= ~counter~0 7)} assume !!(0 != ~a~0 && 0 != ~b~0); {27098#(<= ~counter~0 7)} is VALID [2022-04-28 14:09:53,139 INFO L290 TraceCheckUtils]: 74: Hoare triple {27098#(<= ~counter~0 7)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {27098#(<= ~counter~0 7)} is VALID [2022-04-28 14:09:53,140 INFO L290 TraceCheckUtils]: 75: Hoare triple {27098#(<= ~counter~0 7)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {27126#(<= ~counter~0 8)} is VALID [2022-04-28 14:09:53,140 INFO L290 TraceCheckUtils]: 76: Hoare triple {27126#(<= ~counter~0 8)} assume !!(#t~post6 < 100);havoc #t~post6; {27126#(<= ~counter~0 8)} is VALID [2022-04-28 14:09:53,141 INFO L272 TraceCheckUtils]: 77: Hoare triple {27126#(<= ~counter~0 8)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {27126#(<= ~counter~0 8)} is VALID [2022-04-28 14:09:53,141 INFO L290 TraceCheckUtils]: 78: Hoare triple {27126#(<= ~counter~0 8)} ~cond := #in~cond; {27126#(<= ~counter~0 8)} is VALID [2022-04-28 14:09:53,141 INFO L290 TraceCheckUtils]: 79: Hoare triple {27126#(<= ~counter~0 8)} assume !(0 == ~cond); {27126#(<= ~counter~0 8)} is VALID [2022-04-28 14:09:53,142 INFO L290 TraceCheckUtils]: 80: Hoare triple {27126#(<= ~counter~0 8)} assume true; {27126#(<= ~counter~0 8)} is VALID [2022-04-28 14:09:53,142 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {27126#(<= ~counter~0 8)} {27126#(<= ~counter~0 8)} #71#return; {27126#(<= ~counter~0 8)} is VALID [2022-04-28 14:09:53,142 INFO L290 TraceCheckUtils]: 82: Hoare triple {27126#(<= ~counter~0 8)} assume !!(0 != ~a~0 && 0 != ~b~0); {27126#(<= ~counter~0 8)} is VALID [2022-04-28 14:09:53,143 INFO L290 TraceCheckUtils]: 83: Hoare triple {27126#(<= ~counter~0 8)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {27126#(<= ~counter~0 8)} is VALID [2022-04-28 14:09:53,143 INFO L290 TraceCheckUtils]: 84: Hoare triple {27126#(<= ~counter~0 8)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {27154#(<= ~counter~0 9)} is VALID [2022-04-28 14:09:53,143 INFO L290 TraceCheckUtils]: 85: Hoare triple {27154#(<= ~counter~0 9)} assume !!(#t~post6 < 100);havoc #t~post6; {27154#(<= ~counter~0 9)} is VALID [2022-04-28 14:09:53,144 INFO L272 TraceCheckUtils]: 86: Hoare triple {27154#(<= ~counter~0 9)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {27154#(<= ~counter~0 9)} is VALID [2022-04-28 14:09:53,144 INFO L290 TraceCheckUtils]: 87: Hoare triple {27154#(<= ~counter~0 9)} ~cond := #in~cond; {27154#(<= ~counter~0 9)} is VALID [2022-04-28 14:09:53,145 INFO L290 TraceCheckUtils]: 88: Hoare triple {27154#(<= ~counter~0 9)} assume !(0 == ~cond); {27154#(<= ~counter~0 9)} is VALID [2022-04-28 14:09:53,145 INFO L290 TraceCheckUtils]: 89: Hoare triple {27154#(<= ~counter~0 9)} assume true; {27154#(<= ~counter~0 9)} is VALID [2022-04-28 14:09:53,145 INFO L284 TraceCheckUtils]: 90: Hoare quadruple {27154#(<= ~counter~0 9)} {27154#(<= ~counter~0 9)} #71#return; {27154#(<= ~counter~0 9)} is VALID [2022-04-28 14:09:53,146 INFO L290 TraceCheckUtils]: 91: Hoare triple {27154#(<= ~counter~0 9)} assume !!(0 != ~a~0 && 0 != ~b~0); {27154#(<= ~counter~0 9)} is VALID [2022-04-28 14:09:53,146 INFO L290 TraceCheckUtils]: 92: Hoare triple {27154#(<= ~counter~0 9)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {27154#(<= ~counter~0 9)} is VALID [2022-04-28 14:09:53,146 INFO L290 TraceCheckUtils]: 93: Hoare triple {27154#(<= ~counter~0 9)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {27182#(<= ~counter~0 10)} is VALID [2022-04-28 14:09:53,147 INFO L290 TraceCheckUtils]: 94: Hoare triple {27182#(<= ~counter~0 10)} assume !!(#t~post6 < 100);havoc #t~post6; {27182#(<= ~counter~0 10)} is VALID [2022-04-28 14:09:53,147 INFO L272 TraceCheckUtils]: 95: Hoare triple {27182#(<= ~counter~0 10)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {27182#(<= ~counter~0 10)} is VALID [2022-04-28 14:09:53,147 INFO L290 TraceCheckUtils]: 96: Hoare triple {27182#(<= ~counter~0 10)} ~cond := #in~cond; {27182#(<= ~counter~0 10)} is VALID [2022-04-28 14:09:53,148 INFO L290 TraceCheckUtils]: 97: Hoare triple {27182#(<= ~counter~0 10)} assume !(0 == ~cond); {27182#(<= ~counter~0 10)} is VALID [2022-04-28 14:09:53,148 INFO L290 TraceCheckUtils]: 98: Hoare triple {27182#(<= ~counter~0 10)} assume true; {27182#(<= ~counter~0 10)} is VALID [2022-04-28 14:09:53,149 INFO L284 TraceCheckUtils]: 99: Hoare quadruple {27182#(<= ~counter~0 10)} {27182#(<= ~counter~0 10)} #71#return; {27182#(<= ~counter~0 10)} is VALID [2022-04-28 14:09:53,149 INFO L290 TraceCheckUtils]: 100: Hoare triple {27182#(<= ~counter~0 10)} assume !!(0 != ~a~0 && 0 != ~b~0); {27182#(<= ~counter~0 10)} is VALID [2022-04-28 14:09:53,149 INFO L290 TraceCheckUtils]: 101: Hoare triple {27182#(<= ~counter~0 10)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {27182#(<= ~counter~0 10)} is VALID [2022-04-28 14:09:53,150 INFO L290 TraceCheckUtils]: 102: Hoare triple {27182#(<= ~counter~0 10)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {27210#(<= ~counter~0 11)} is VALID [2022-04-28 14:09:53,150 INFO L290 TraceCheckUtils]: 103: Hoare triple {27210#(<= ~counter~0 11)} assume !!(#t~post6 < 100);havoc #t~post6; {27210#(<= ~counter~0 11)} is VALID [2022-04-28 14:09:53,150 INFO L272 TraceCheckUtils]: 104: Hoare triple {27210#(<= ~counter~0 11)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {27210#(<= ~counter~0 11)} is VALID [2022-04-28 14:09:53,151 INFO L290 TraceCheckUtils]: 105: Hoare triple {27210#(<= ~counter~0 11)} ~cond := #in~cond; {27210#(<= ~counter~0 11)} is VALID [2022-04-28 14:09:53,151 INFO L290 TraceCheckUtils]: 106: Hoare triple {27210#(<= ~counter~0 11)} assume !(0 == ~cond); {27210#(<= ~counter~0 11)} is VALID [2022-04-28 14:09:53,151 INFO L290 TraceCheckUtils]: 107: Hoare triple {27210#(<= ~counter~0 11)} assume true; {27210#(<= ~counter~0 11)} is VALID [2022-04-28 14:09:53,152 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {27210#(<= ~counter~0 11)} {27210#(<= ~counter~0 11)} #71#return; {27210#(<= ~counter~0 11)} is VALID [2022-04-28 14:09:53,152 INFO L290 TraceCheckUtils]: 109: Hoare triple {27210#(<= ~counter~0 11)} assume !!(0 != ~a~0 && 0 != ~b~0); {27210#(<= ~counter~0 11)} is VALID [2022-04-28 14:09:53,152 INFO L290 TraceCheckUtils]: 110: Hoare triple {27210#(<= ~counter~0 11)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {27210#(<= ~counter~0 11)} is VALID [2022-04-28 14:09:53,153 INFO L290 TraceCheckUtils]: 111: Hoare triple {27210#(<= ~counter~0 11)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {27238#(<= ~counter~0 12)} is VALID [2022-04-28 14:09:53,153 INFO L290 TraceCheckUtils]: 112: Hoare triple {27238#(<= ~counter~0 12)} assume !!(#t~post6 < 100);havoc #t~post6; {27238#(<= ~counter~0 12)} is VALID [2022-04-28 14:09:53,154 INFO L272 TraceCheckUtils]: 113: Hoare triple {27238#(<= ~counter~0 12)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {27238#(<= ~counter~0 12)} is VALID [2022-04-28 14:09:53,154 INFO L290 TraceCheckUtils]: 114: Hoare triple {27238#(<= ~counter~0 12)} ~cond := #in~cond; {27238#(<= ~counter~0 12)} is VALID [2022-04-28 14:09:53,154 INFO L290 TraceCheckUtils]: 115: Hoare triple {27238#(<= ~counter~0 12)} assume !(0 == ~cond); {27238#(<= ~counter~0 12)} is VALID [2022-04-28 14:09:53,154 INFO L290 TraceCheckUtils]: 116: Hoare triple {27238#(<= ~counter~0 12)} assume true; {27238#(<= ~counter~0 12)} is VALID [2022-04-28 14:09:53,155 INFO L284 TraceCheckUtils]: 117: Hoare quadruple {27238#(<= ~counter~0 12)} {27238#(<= ~counter~0 12)} #71#return; {27238#(<= ~counter~0 12)} is VALID [2022-04-28 14:09:53,155 INFO L290 TraceCheckUtils]: 118: Hoare triple {27238#(<= ~counter~0 12)} assume !!(0 != ~a~0 && 0 != ~b~0); {27238#(<= ~counter~0 12)} is VALID [2022-04-28 14:09:53,155 INFO L290 TraceCheckUtils]: 119: Hoare triple {27238#(<= ~counter~0 12)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {27238#(<= ~counter~0 12)} is VALID [2022-04-28 14:09:53,156 INFO L290 TraceCheckUtils]: 120: Hoare triple {27238#(<= ~counter~0 12)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {27266#(<= ~counter~0 13)} is VALID [2022-04-28 14:09:53,156 INFO L290 TraceCheckUtils]: 121: Hoare triple {27266#(<= ~counter~0 13)} assume !!(#t~post6 < 100);havoc #t~post6; {27266#(<= ~counter~0 13)} is VALID [2022-04-28 14:09:53,157 INFO L272 TraceCheckUtils]: 122: Hoare triple {27266#(<= ~counter~0 13)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {27266#(<= ~counter~0 13)} is VALID [2022-04-28 14:09:53,157 INFO L290 TraceCheckUtils]: 123: Hoare triple {27266#(<= ~counter~0 13)} ~cond := #in~cond; {27266#(<= ~counter~0 13)} is VALID [2022-04-28 14:09:53,157 INFO L290 TraceCheckUtils]: 124: Hoare triple {27266#(<= ~counter~0 13)} assume !(0 == ~cond); {27266#(<= ~counter~0 13)} is VALID [2022-04-28 14:09:53,158 INFO L290 TraceCheckUtils]: 125: Hoare triple {27266#(<= ~counter~0 13)} assume true; {27266#(<= ~counter~0 13)} is VALID [2022-04-28 14:09:53,158 INFO L284 TraceCheckUtils]: 126: Hoare quadruple {27266#(<= ~counter~0 13)} {27266#(<= ~counter~0 13)} #71#return; {27266#(<= ~counter~0 13)} is VALID [2022-04-28 14:09:53,158 INFO L290 TraceCheckUtils]: 127: Hoare triple {27266#(<= ~counter~0 13)} assume !!(0 != ~a~0 && 0 != ~b~0); {27266#(<= ~counter~0 13)} is VALID [2022-04-28 14:09:53,159 INFO L290 TraceCheckUtils]: 128: Hoare triple {27266#(<= ~counter~0 13)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {27266#(<= ~counter~0 13)} is VALID [2022-04-28 14:09:53,159 INFO L290 TraceCheckUtils]: 129: Hoare triple {27266#(<= ~counter~0 13)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {27294#(<= ~counter~0 14)} is VALID [2022-04-28 14:09:53,159 INFO L290 TraceCheckUtils]: 130: Hoare triple {27294#(<= ~counter~0 14)} assume !!(#t~post6 < 100);havoc #t~post6; {27294#(<= ~counter~0 14)} is VALID [2022-04-28 14:09:53,160 INFO L272 TraceCheckUtils]: 131: Hoare triple {27294#(<= ~counter~0 14)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {27294#(<= ~counter~0 14)} is VALID [2022-04-28 14:09:53,160 INFO L290 TraceCheckUtils]: 132: Hoare triple {27294#(<= ~counter~0 14)} ~cond := #in~cond; {27294#(<= ~counter~0 14)} is VALID [2022-04-28 14:09:53,160 INFO L290 TraceCheckUtils]: 133: Hoare triple {27294#(<= ~counter~0 14)} assume !(0 == ~cond); {27294#(<= ~counter~0 14)} is VALID [2022-04-28 14:09:53,162 INFO L290 TraceCheckUtils]: 134: Hoare triple {27294#(<= ~counter~0 14)} assume true; {27294#(<= ~counter~0 14)} is VALID [2022-04-28 14:09:53,163 INFO L284 TraceCheckUtils]: 135: Hoare quadruple {27294#(<= ~counter~0 14)} {27294#(<= ~counter~0 14)} #71#return; {27294#(<= ~counter~0 14)} is VALID [2022-04-28 14:09:53,163 INFO L290 TraceCheckUtils]: 136: Hoare triple {27294#(<= ~counter~0 14)} assume !!(0 != ~a~0 && 0 != ~b~0); {27294#(<= ~counter~0 14)} is VALID [2022-04-28 14:09:53,164 INFO L290 TraceCheckUtils]: 137: Hoare triple {27294#(<= ~counter~0 14)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {27294#(<= ~counter~0 14)} is VALID [2022-04-28 14:09:53,165 INFO L290 TraceCheckUtils]: 138: Hoare triple {27294#(<= ~counter~0 14)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {27322#(<= ~counter~0 15)} is VALID [2022-04-28 14:09:53,165 INFO L290 TraceCheckUtils]: 139: Hoare triple {27322#(<= ~counter~0 15)} assume !!(#t~post6 < 100);havoc #t~post6; {27322#(<= ~counter~0 15)} is VALID [2022-04-28 14:09:53,166 INFO L272 TraceCheckUtils]: 140: Hoare triple {27322#(<= ~counter~0 15)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {27322#(<= ~counter~0 15)} is VALID [2022-04-28 14:09:53,166 INFO L290 TraceCheckUtils]: 141: Hoare triple {27322#(<= ~counter~0 15)} ~cond := #in~cond; {27322#(<= ~counter~0 15)} is VALID [2022-04-28 14:09:53,167 INFO L290 TraceCheckUtils]: 142: Hoare triple {27322#(<= ~counter~0 15)} assume !(0 == ~cond); {27322#(<= ~counter~0 15)} is VALID [2022-04-28 14:09:53,167 INFO L290 TraceCheckUtils]: 143: Hoare triple {27322#(<= ~counter~0 15)} assume true; {27322#(<= ~counter~0 15)} is VALID [2022-04-28 14:09:53,167 INFO L284 TraceCheckUtils]: 144: Hoare quadruple {27322#(<= ~counter~0 15)} {27322#(<= ~counter~0 15)} #71#return; {27322#(<= ~counter~0 15)} is VALID [2022-04-28 14:09:53,168 INFO L290 TraceCheckUtils]: 145: Hoare triple {27322#(<= ~counter~0 15)} assume !!(0 != ~a~0 && 0 != ~b~0); {27322#(<= ~counter~0 15)} is VALID [2022-04-28 14:09:53,168 INFO L290 TraceCheckUtils]: 146: Hoare triple {27322#(<= ~counter~0 15)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {27322#(<= ~counter~0 15)} is VALID [2022-04-28 14:09:53,168 INFO L290 TraceCheckUtils]: 147: Hoare triple {27322#(<= ~counter~0 15)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {27350#(<= |main_#t~post6| 15)} is VALID [2022-04-28 14:09:53,169 INFO L290 TraceCheckUtils]: 148: Hoare triple {27350#(<= |main_#t~post6| 15)} assume !(#t~post6 < 100);havoc #t~post6; {26889#false} is VALID [2022-04-28 14:09:53,169 INFO L272 TraceCheckUtils]: 149: Hoare triple {26889#false} call __VERIFIER_assert((if ~q~0 == ~x~0 * ~y~0 then 1 else 0)); {26889#false} is VALID [2022-04-28 14:09:53,169 INFO L290 TraceCheckUtils]: 150: Hoare triple {26889#false} ~cond := #in~cond; {26889#false} is VALID [2022-04-28 14:09:53,169 INFO L290 TraceCheckUtils]: 151: Hoare triple {26889#false} assume 0 == ~cond; {26889#false} is VALID [2022-04-28 14:09:53,169 INFO L290 TraceCheckUtils]: 152: Hoare triple {26889#false} assume !false; {26889#false} is VALID [2022-04-28 14:09:53,170 INFO L134 CoverageAnalysis]: Checked inductivity of 1005 backedges. 30 proven. 975 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 14:09:53,170 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 14:09:54,104 INFO L290 TraceCheckUtils]: 152: Hoare triple {26889#false} assume !false; {26889#false} is VALID [2022-04-28 14:09:54,104 INFO L290 TraceCheckUtils]: 151: Hoare triple {26889#false} assume 0 == ~cond; {26889#false} is VALID [2022-04-28 14:09:54,104 INFO L290 TraceCheckUtils]: 150: Hoare triple {26889#false} ~cond := #in~cond; {26889#false} is VALID [2022-04-28 14:09:54,104 INFO L272 TraceCheckUtils]: 149: Hoare triple {26889#false} call __VERIFIER_assert((if ~q~0 == ~x~0 * ~y~0 then 1 else 0)); {26889#false} is VALID [2022-04-28 14:09:54,105 INFO L290 TraceCheckUtils]: 148: Hoare triple {27378#(< |main_#t~post6| 100)} assume !(#t~post6 < 100);havoc #t~post6; {26889#false} is VALID [2022-04-28 14:09:54,105 INFO L290 TraceCheckUtils]: 147: Hoare triple {27382#(< ~counter~0 100)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {27378#(< |main_#t~post6| 100)} is VALID [2022-04-28 14:09:54,105 INFO L290 TraceCheckUtils]: 146: Hoare triple {27382#(< ~counter~0 100)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {27382#(< ~counter~0 100)} is VALID [2022-04-28 14:09:54,106 INFO L290 TraceCheckUtils]: 145: Hoare triple {27382#(< ~counter~0 100)} assume !!(0 != ~a~0 && 0 != ~b~0); {27382#(< ~counter~0 100)} is VALID [2022-04-28 14:09:54,106 INFO L284 TraceCheckUtils]: 144: Hoare quadruple {26888#true} {27382#(< ~counter~0 100)} #71#return; {27382#(< ~counter~0 100)} is VALID [2022-04-28 14:09:54,106 INFO L290 TraceCheckUtils]: 143: Hoare triple {26888#true} assume true; {26888#true} is VALID [2022-04-28 14:09:54,106 INFO L290 TraceCheckUtils]: 142: Hoare triple {26888#true} assume !(0 == ~cond); {26888#true} is VALID [2022-04-28 14:09:54,106 INFO L290 TraceCheckUtils]: 141: Hoare triple {26888#true} ~cond := #in~cond; {26888#true} is VALID [2022-04-28 14:09:54,106 INFO L272 TraceCheckUtils]: 140: Hoare triple {27382#(< ~counter~0 100)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {26888#true} is VALID [2022-04-28 14:09:54,107 INFO L290 TraceCheckUtils]: 139: Hoare triple {27382#(< ~counter~0 100)} assume !!(#t~post6 < 100);havoc #t~post6; {27382#(< ~counter~0 100)} is VALID [2022-04-28 14:09:54,107 INFO L290 TraceCheckUtils]: 138: Hoare triple {27410#(< ~counter~0 99)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {27382#(< ~counter~0 100)} is VALID [2022-04-28 14:09:54,108 INFO L290 TraceCheckUtils]: 137: Hoare triple {27410#(< ~counter~0 99)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {27410#(< ~counter~0 99)} is VALID [2022-04-28 14:09:54,108 INFO L290 TraceCheckUtils]: 136: Hoare triple {27410#(< ~counter~0 99)} assume !!(0 != ~a~0 && 0 != ~b~0); {27410#(< ~counter~0 99)} is VALID [2022-04-28 14:09:54,108 INFO L284 TraceCheckUtils]: 135: Hoare quadruple {26888#true} {27410#(< ~counter~0 99)} #71#return; {27410#(< ~counter~0 99)} is VALID [2022-04-28 14:09:54,108 INFO L290 TraceCheckUtils]: 134: Hoare triple {26888#true} assume true; {26888#true} is VALID [2022-04-28 14:09:54,108 INFO L290 TraceCheckUtils]: 133: Hoare triple {26888#true} assume !(0 == ~cond); {26888#true} is VALID [2022-04-28 14:09:54,109 INFO L290 TraceCheckUtils]: 132: Hoare triple {26888#true} ~cond := #in~cond; {26888#true} is VALID [2022-04-28 14:09:54,109 INFO L272 TraceCheckUtils]: 131: Hoare triple {27410#(< ~counter~0 99)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {26888#true} is VALID [2022-04-28 14:09:54,109 INFO L290 TraceCheckUtils]: 130: Hoare triple {27410#(< ~counter~0 99)} assume !!(#t~post6 < 100);havoc #t~post6; {27410#(< ~counter~0 99)} is VALID [2022-04-28 14:09:54,109 INFO L290 TraceCheckUtils]: 129: Hoare triple {27438#(< ~counter~0 98)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {27410#(< ~counter~0 99)} is VALID [2022-04-28 14:09:54,110 INFO L290 TraceCheckUtils]: 128: Hoare triple {27438#(< ~counter~0 98)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {27438#(< ~counter~0 98)} is VALID [2022-04-28 14:09:54,110 INFO L290 TraceCheckUtils]: 127: Hoare triple {27438#(< ~counter~0 98)} assume !!(0 != ~a~0 && 0 != ~b~0); {27438#(< ~counter~0 98)} is VALID [2022-04-28 14:09:54,110 INFO L284 TraceCheckUtils]: 126: Hoare quadruple {26888#true} {27438#(< ~counter~0 98)} #71#return; {27438#(< ~counter~0 98)} is VALID [2022-04-28 14:09:54,110 INFO L290 TraceCheckUtils]: 125: Hoare triple {26888#true} assume true; {26888#true} is VALID [2022-04-28 14:09:54,110 INFO L290 TraceCheckUtils]: 124: Hoare triple {26888#true} assume !(0 == ~cond); {26888#true} is VALID [2022-04-28 14:09:54,110 INFO L290 TraceCheckUtils]: 123: Hoare triple {26888#true} ~cond := #in~cond; {26888#true} is VALID [2022-04-28 14:09:54,111 INFO L272 TraceCheckUtils]: 122: Hoare triple {27438#(< ~counter~0 98)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {26888#true} is VALID [2022-04-28 14:09:54,111 INFO L290 TraceCheckUtils]: 121: Hoare triple {27438#(< ~counter~0 98)} assume !!(#t~post6 < 100);havoc #t~post6; {27438#(< ~counter~0 98)} is VALID [2022-04-28 14:09:54,111 INFO L290 TraceCheckUtils]: 120: Hoare triple {27466#(< ~counter~0 97)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {27438#(< ~counter~0 98)} is VALID [2022-04-28 14:09:54,111 INFO L290 TraceCheckUtils]: 119: Hoare triple {27466#(< ~counter~0 97)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {27466#(< ~counter~0 97)} is VALID [2022-04-28 14:09:54,112 INFO L290 TraceCheckUtils]: 118: Hoare triple {27466#(< ~counter~0 97)} assume !!(0 != ~a~0 && 0 != ~b~0); {27466#(< ~counter~0 97)} is VALID [2022-04-28 14:09:54,112 INFO L284 TraceCheckUtils]: 117: Hoare quadruple {26888#true} {27466#(< ~counter~0 97)} #71#return; {27466#(< ~counter~0 97)} is VALID [2022-04-28 14:09:54,112 INFO L290 TraceCheckUtils]: 116: Hoare triple {26888#true} assume true; {26888#true} is VALID [2022-04-28 14:09:54,112 INFO L290 TraceCheckUtils]: 115: Hoare triple {26888#true} assume !(0 == ~cond); {26888#true} is VALID [2022-04-28 14:09:54,112 INFO L290 TraceCheckUtils]: 114: Hoare triple {26888#true} ~cond := #in~cond; {26888#true} is VALID [2022-04-28 14:09:54,113 INFO L272 TraceCheckUtils]: 113: Hoare triple {27466#(< ~counter~0 97)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {26888#true} is VALID [2022-04-28 14:09:54,113 INFO L290 TraceCheckUtils]: 112: Hoare triple {27466#(< ~counter~0 97)} assume !!(#t~post6 < 100);havoc #t~post6; {27466#(< ~counter~0 97)} is VALID [2022-04-28 14:09:54,113 INFO L290 TraceCheckUtils]: 111: Hoare triple {27494#(< ~counter~0 96)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {27466#(< ~counter~0 97)} is VALID [2022-04-28 14:09:54,113 INFO L290 TraceCheckUtils]: 110: Hoare triple {27494#(< ~counter~0 96)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {27494#(< ~counter~0 96)} is VALID [2022-04-28 14:09:54,114 INFO L290 TraceCheckUtils]: 109: Hoare triple {27494#(< ~counter~0 96)} assume !!(0 != ~a~0 && 0 != ~b~0); {27494#(< ~counter~0 96)} is VALID [2022-04-28 14:09:54,114 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {26888#true} {27494#(< ~counter~0 96)} #71#return; {27494#(< ~counter~0 96)} is VALID [2022-04-28 14:09:54,114 INFO L290 TraceCheckUtils]: 107: Hoare triple {26888#true} assume true; {26888#true} is VALID [2022-04-28 14:09:54,114 INFO L290 TraceCheckUtils]: 106: Hoare triple {26888#true} assume !(0 == ~cond); {26888#true} is VALID [2022-04-28 14:09:54,114 INFO L290 TraceCheckUtils]: 105: Hoare triple {26888#true} ~cond := #in~cond; {26888#true} is VALID [2022-04-28 14:09:54,114 INFO L272 TraceCheckUtils]: 104: Hoare triple {27494#(< ~counter~0 96)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {26888#true} is VALID [2022-04-28 14:09:54,115 INFO L290 TraceCheckUtils]: 103: Hoare triple {27494#(< ~counter~0 96)} assume !!(#t~post6 < 100);havoc #t~post6; {27494#(< ~counter~0 96)} is VALID [2022-04-28 14:09:54,115 INFO L290 TraceCheckUtils]: 102: Hoare triple {27522#(< ~counter~0 95)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {27494#(< ~counter~0 96)} is VALID [2022-04-28 14:09:54,115 INFO L290 TraceCheckUtils]: 101: Hoare triple {27522#(< ~counter~0 95)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {27522#(< ~counter~0 95)} is VALID [2022-04-28 14:09:54,116 INFO L290 TraceCheckUtils]: 100: Hoare triple {27522#(< ~counter~0 95)} assume !!(0 != ~a~0 && 0 != ~b~0); {27522#(< ~counter~0 95)} is VALID [2022-04-28 14:09:54,116 INFO L284 TraceCheckUtils]: 99: Hoare quadruple {26888#true} {27522#(< ~counter~0 95)} #71#return; {27522#(< ~counter~0 95)} is VALID [2022-04-28 14:09:54,116 INFO L290 TraceCheckUtils]: 98: Hoare triple {26888#true} assume true; {26888#true} is VALID [2022-04-28 14:09:54,116 INFO L290 TraceCheckUtils]: 97: Hoare triple {26888#true} assume !(0 == ~cond); {26888#true} is VALID [2022-04-28 14:09:54,116 INFO L290 TraceCheckUtils]: 96: Hoare triple {26888#true} ~cond := #in~cond; {26888#true} is VALID [2022-04-28 14:09:54,116 INFO L272 TraceCheckUtils]: 95: Hoare triple {27522#(< ~counter~0 95)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {26888#true} is VALID [2022-04-28 14:09:54,117 INFO L290 TraceCheckUtils]: 94: Hoare triple {27522#(< ~counter~0 95)} assume !!(#t~post6 < 100);havoc #t~post6; {27522#(< ~counter~0 95)} is VALID [2022-04-28 14:09:54,117 INFO L290 TraceCheckUtils]: 93: Hoare triple {27550#(< ~counter~0 94)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {27522#(< ~counter~0 95)} is VALID [2022-04-28 14:09:54,117 INFO L290 TraceCheckUtils]: 92: Hoare triple {27550#(< ~counter~0 94)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {27550#(< ~counter~0 94)} is VALID [2022-04-28 14:09:54,118 INFO L290 TraceCheckUtils]: 91: Hoare triple {27550#(< ~counter~0 94)} assume !!(0 != ~a~0 && 0 != ~b~0); {27550#(< ~counter~0 94)} is VALID [2022-04-28 14:09:54,118 INFO L284 TraceCheckUtils]: 90: Hoare quadruple {26888#true} {27550#(< ~counter~0 94)} #71#return; {27550#(< ~counter~0 94)} is VALID [2022-04-28 14:09:54,118 INFO L290 TraceCheckUtils]: 89: Hoare triple {26888#true} assume true; {26888#true} is VALID [2022-04-28 14:09:54,118 INFO L290 TraceCheckUtils]: 88: Hoare triple {26888#true} assume !(0 == ~cond); {26888#true} is VALID [2022-04-28 14:09:54,118 INFO L290 TraceCheckUtils]: 87: Hoare triple {26888#true} ~cond := #in~cond; {26888#true} is VALID [2022-04-28 14:09:54,118 INFO L272 TraceCheckUtils]: 86: Hoare triple {27550#(< ~counter~0 94)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {26888#true} is VALID [2022-04-28 14:09:54,119 INFO L290 TraceCheckUtils]: 85: Hoare triple {27550#(< ~counter~0 94)} assume !!(#t~post6 < 100);havoc #t~post6; {27550#(< ~counter~0 94)} is VALID [2022-04-28 14:09:54,124 INFO L290 TraceCheckUtils]: 84: Hoare triple {27578#(< ~counter~0 93)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {27550#(< ~counter~0 94)} is VALID [2022-04-28 14:09:54,124 INFO L290 TraceCheckUtils]: 83: Hoare triple {27578#(< ~counter~0 93)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {27578#(< ~counter~0 93)} is VALID [2022-04-28 14:09:54,124 INFO L290 TraceCheckUtils]: 82: Hoare triple {27578#(< ~counter~0 93)} assume !!(0 != ~a~0 && 0 != ~b~0); {27578#(< ~counter~0 93)} is VALID [2022-04-28 14:09:54,125 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {26888#true} {27578#(< ~counter~0 93)} #71#return; {27578#(< ~counter~0 93)} is VALID [2022-04-28 14:09:54,125 INFO L290 TraceCheckUtils]: 80: Hoare triple {26888#true} assume true; {26888#true} is VALID [2022-04-28 14:09:54,125 INFO L290 TraceCheckUtils]: 79: Hoare triple {26888#true} assume !(0 == ~cond); {26888#true} is VALID [2022-04-28 14:09:54,125 INFO L290 TraceCheckUtils]: 78: Hoare triple {26888#true} ~cond := #in~cond; {26888#true} is VALID [2022-04-28 14:09:54,126 INFO L272 TraceCheckUtils]: 77: Hoare triple {27578#(< ~counter~0 93)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {26888#true} is VALID [2022-04-28 14:09:54,126 INFO L290 TraceCheckUtils]: 76: Hoare triple {27578#(< ~counter~0 93)} assume !!(#t~post6 < 100);havoc #t~post6; {27578#(< ~counter~0 93)} is VALID [2022-04-28 14:09:54,127 INFO L290 TraceCheckUtils]: 75: Hoare triple {27606#(< ~counter~0 92)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {27578#(< ~counter~0 93)} is VALID [2022-04-28 14:09:54,127 INFO L290 TraceCheckUtils]: 74: Hoare triple {27606#(< ~counter~0 92)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {27606#(< ~counter~0 92)} is VALID [2022-04-28 14:09:54,127 INFO L290 TraceCheckUtils]: 73: Hoare triple {27606#(< ~counter~0 92)} assume !!(0 != ~a~0 && 0 != ~b~0); {27606#(< ~counter~0 92)} is VALID [2022-04-28 14:09:54,128 INFO L284 TraceCheckUtils]: 72: Hoare quadruple {26888#true} {27606#(< ~counter~0 92)} #71#return; {27606#(< ~counter~0 92)} is VALID [2022-04-28 14:09:54,128 INFO L290 TraceCheckUtils]: 71: Hoare triple {26888#true} assume true; {26888#true} is VALID [2022-04-28 14:09:54,128 INFO L290 TraceCheckUtils]: 70: Hoare triple {26888#true} assume !(0 == ~cond); {26888#true} is VALID [2022-04-28 14:09:54,128 INFO L290 TraceCheckUtils]: 69: Hoare triple {26888#true} ~cond := #in~cond; {26888#true} is VALID [2022-04-28 14:09:54,128 INFO L272 TraceCheckUtils]: 68: Hoare triple {27606#(< ~counter~0 92)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {26888#true} is VALID [2022-04-28 14:09:54,129 INFO L290 TraceCheckUtils]: 67: Hoare triple {27606#(< ~counter~0 92)} assume !!(#t~post6 < 100);havoc #t~post6; {27606#(< ~counter~0 92)} is VALID [2022-04-28 14:09:54,129 INFO L290 TraceCheckUtils]: 66: Hoare triple {27634#(< ~counter~0 91)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {27606#(< ~counter~0 92)} is VALID [2022-04-28 14:09:54,130 INFO L290 TraceCheckUtils]: 65: Hoare triple {27634#(< ~counter~0 91)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {27634#(< ~counter~0 91)} is VALID [2022-04-28 14:09:54,130 INFO L290 TraceCheckUtils]: 64: Hoare triple {27634#(< ~counter~0 91)} assume !!(0 != ~a~0 && 0 != ~b~0); {27634#(< ~counter~0 91)} is VALID [2022-04-28 14:09:54,131 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {26888#true} {27634#(< ~counter~0 91)} #71#return; {27634#(< ~counter~0 91)} is VALID [2022-04-28 14:09:54,131 INFO L290 TraceCheckUtils]: 62: Hoare triple {26888#true} assume true; {26888#true} is VALID [2022-04-28 14:09:54,131 INFO L290 TraceCheckUtils]: 61: Hoare triple {26888#true} assume !(0 == ~cond); {26888#true} is VALID [2022-04-28 14:09:54,131 INFO L290 TraceCheckUtils]: 60: Hoare triple {26888#true} ~cond := #in~cond; {26888#true} is VALID [2022-04-28 14:09:54,131 INFO L272 TraceCheckUtils]: 59: Hoare triple {27634#(< ~counter~0 91)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {26888#true} is VALID [2022-04-28 14:09:54,132 INFO L290 TraceCheckUtils]: 58: Hoare triple {27634#(< ~counter~0 91)} assume !!(#t~post6 < 100);havoc #t~post6; {27634#(< ~counter~0 91)} is VALID [2022-04-28 14:09:54,132 INFO L290 TraceCheckUtils]: 57: Hoare triple {27662#(< ~counter~0 90)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {27634#(< ~counter~0 91)} is VALID [2022-04-28 14:09:54,133 INFO L290 TraceCheckUtils]: 56: Hoare triple {27662#(< ~counter~0 90)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {27662#(< ~counter~0 90)} is VALID [2022-04-28 14:09:54,133 INFO L290 TraceCheckUtils]: 55: Hoare triple {27662#(< ~counter~0 90)} assume !!(0 != ~a~0 && 0 != ~b~0); {27662#(< ~counter~0 90)} is VALID [2022-04-28 14:09:54,134 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {26888#true} {27662#(< ~counter~0 90)} #71#return; {27662#(< ~counter~0 90)} is VALID [2022-04-28 14:09:54,134 INFO L290 TraceCheckUtils]: 53: Hoare triple {26888#true} assume true; {26888#true} is VALID [2022-04-28 14:09:54,134 INFO L290 TraceCheckUtils]: 52: Hoare triple {26888#true} assume !(0 == ~cond); {26888#true} is VALID [2022-04-28 14:09:54,134 INFO L290 TraceCheckUtils]: 51: Hoare triple {26888#true} ~cond := #in~cond; {26888#true} is VALID [2022-04-28 14:09:54,134 INFO L272 TraceCheckUtils]: 50: Hoare triple {27662#(< ~counter~0 90)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {26888#true} is VALID [2022-04-28 14:09:54,134 INFO L290 TraceCheckUtils]: 49: Hoare triple {27662#(< ~counter~0 90)} assume !!(#t~post6 < 100);havoc #t~post6; {27662#(< ~counter~0 90)} is VALID [2022-04-28 14:09:54,135 INFO L290 TraceCheckUtils]: 48: Hoare triple {27690#(< ~counter~0 89)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {27662#(< ~counter~0 90)} is VALID [2022-04-28 14:09:54,135 INFO L290 TraceCheckUtils]: 47: Hoare triple {27690#(< ~counter~0 89)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {27690#(< ~counter~0 89)} is VALID [2022-04-28 14:09:54,136 INFO L290 TraceCheckUtils]: 46: Hoare triple {27690#(< ~counter~0 89)} assume !!(0 != ~a~0 && 0 != ~b~0); {27690#(< ~counter~0 89)} is VALID [2022-04-28 14:09:54,136 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {26888#true} {27690#(< ~counter~0 89)} #71#return; {27690#(< ~counter~0 89)} is VALID [2022-04-28 14:09:54,136 INFO L290 TraceCheckUtils]: 44: Hoare triple {26888#true} assume true; {26888#true} is VALID [2022-04-28 14:09:54,136 INFO L290 TraceCheckUtils]: 43: Hoare triple {26888#true} assume !(0 == ~cond); {26888#true} is VALID [2022-04-28 14:09:54,137 INFO L290 TraceCheckUtils]: 42: Hoare triple {26888#true} ~cond := #in~cond; {26888#true} is VALID [2022-04-28 14:09:54,137 INFO L272 TraceCheckUtils]: 41: Hoare triple {27690#(< ~counter~0 89)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {26888#true} is VALID [2022-04-28 14:09:54,137 INFO L290 TraceCheckUtils]: 40: Hoare triple {27690#(< ~counter~0 89)} assume !!(#t~post6 < 100);havoc #t~post6; {27690#(< ~counter~0 89)} is VALID [2022-04-28 14:09:54,138 INFO L290 TraceCheckUtils]: 39: Hoare triple {27718#(< ~counter~0 88)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {27690#(< ~counter~0 89)} is VALID [2022-04-28 14:09:54,138 INFO L290 TraceCheckUtils]: 38: Hoare triple {27718#(< ~counter~0 88)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {27718#(< ~counter~0 88)} is VALID [2022-04-28 14:09:54,138 INFO L290 TraceCheckUtils]: 37: Hoare triple {27718#(< ~counter~0 88)} assume !!(0 != ~a~0 && 0 != ~b~0); {27718#(< ~counter~0 88)} is VALID [2022-04-28 14:09:54,139 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {26888#true} {27718#(< ~counter~0 88)} #71#return; {27718#(< ~counter~0 88)} is VALID [2022-04-28 14:09:54,139 INFO L290 TraceCheckUtils]: 35: Hoare triple {26888#true} assume true; {26888#true} is VALID [2022-04-28 14:09:54,139 INFO L290 TraceCheckUtils]: 34: Hoare triple {26888#true} assume !(0 == ~cond); {26888#true} is VALID [2022-04-28 14:09:54,139 INFO L290 TraceCheckUtils]: 33: Hoare triple {26888#true} ~cond := #in~cond; {26888#true} is VALID [2022-04-28 14:09:54,139 INFO L272 TraceCheckUtils]: 32: Hoare triple {27718#(< ~counter~0 88)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {26888#true} is VALID [2022-04-28 14:09:54,140 INFO L290 TraceCheckUtils]: 31: Hoare triple {27718#(< ~counter~0 88)} assume !!(#t~post6 < 100);havoc #t~post6; {27718#(< ~counter~0 88)} is VALID [2022-04-28 14:09:54,140 INFO L290 TraceCheckUtils]: 30: Hoare triple {27746#(< ~counter~0 87)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {27718#(< ~counter~0 88)} is VALID [2022-04-28 14:09:54,141 INFO L290 TraceCheckUtils]: 29: Hoare triple {27746#(< ~counter~0 87)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {27746#(< ~counter~0 87)} is VALID [2022-04-28 14:09:54,141 INFO L290 TraceCheckUtils]: 28: Hoare triple {27746#(< ~counter~0 87)} assume !!(0 != ~a~0 && 0 != ~b~0); {27746#(< ~counter~0 87)} is VALID [2022-04-28 14:09:54,142 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {26888#true} {27746#(< ~counter~0 87)} #71#return; {27746#(< ~counter~0 87)} is VALID [2022-04-28 14:09:54,142 INFO L290 TraceCheckUtils]: 26: Hoare triple {26888#true} assume true; {26888#true} is VALID [2022-04-28 14:09:54,142 INFO L290 TraceCheckUtils]: 25: Hoare triple {26888#true} assume !(0 == ~cond); {26888#true} is VALID [2022-04-28 14:09:54,142 INFO L290 TraceCheckUtils]: 24: Hoare triple {26888#true} ~cond := #in~cond; {26888#true} is VALID [2022-04-28 14:09:54,142 INFO L272 TraceCheckUtils]: 23: Hoare triple {27746#(< ~counter~0 87)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {26888#true} is VALID [2022-04-28 14:09:54,142 INFO L290 TraceCheckUtils]: 22: Hoare triple {27746#(< ~counter~0 87)} assume !!(#t~post6 < 100);havoc #t~post6; {27746#(< ~counter~0 87)} is VALID [2022-04-28 14:09:54,143 INFO L290 TraceCheckUtils]: 21: Hoare triple {27774#(< ~counter~0 86)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {27746#(< ~counter~0 87)} is VALID [2022-04-28 14:09:54,143 INFO L290 TraceCheckUtils]: 20: Hoare triple {27774#(< ~counter~0 86)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {27774#(< ~counter~0 86)} is VALID [2022-04-28 14:09:54,144 INFO L290 TraceCheckUtils]: 19: Hoare triple {27774#(< ~counter~0 86)} assume !!(0 != ~a~0 && 0 != ~b~0); {27774#(< ~counter~0 86)} is VALID [2022-04-28 14:09:54,144 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {26888#true} {27774#(< ~counter~0 86)} #71#return; {27774#(< ~counter~0 86)} is VALID [2022-04-28 14:09:54,144 INFO L290 TraceCheckUtils]: 17: Hoare triple {26888#true} assume true; {26888#true} is VALID [2022-04-28 14:09:54,144 INFO L290 TraceCheckUtils]: 16: Hoare triple {26888#true} assume !(0 == ~cond); {26888#true} is VALID [2022-04-28 14:09:54,145 INFO L290 TraceCheckUtils]: 15: Hoare triple {26888#true} ~cond := #in~cond; {26888#true} is VALID [2022-04-28 14:09:54,145 INFO L272 TraceCheckUtils]: 14: Hoare triple {27774#(< ~counter~0 86)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {26888#true} is VALID [2022-04-28 14:09:54,145 INFO L290 TraceCheckUtils]: 13: Hoare triple {27774#(< ~counter~0 86)} assume !!(#t~post6 < 100);havoc #t~post6; {27774#(< ~counter~0 86)} is VALID [2022-04-28 14:09:54,145 INFO L290 TraceCheckUtils]: 12: Hoare triple {27802#(< ~counter~0 85)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {27774#(< ~counter~0 86)} is VALID [2022-04-28 14:09:54,146 INFO L290 TraceCheckUtils]: 11: Hoare triple {27802#(< ~counter~0 85)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {27802#(< ~counter~0 85)} is VALID [2022-04-28 14:09:54,146 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {26888#true} {27802#(< ~counter~0 85)} #69#return; {27802#(< ~counter~0 85)} is VALID [2022-04-28 14:09:54,146 INFO L290 TraceCheckUtils]: 9: Hoare triple {26888#true} assume true; {26888#true} is VALID [2022-04-28 14:09:54,146 INFO L290 TraceCheckUtils]: 8: Hoare triple {26888#true} assume !(0 == ~cond); {26888#true} is VALID [2022-04-28 14:09:54,146 INFO L290 TraceCheckUtils]: 7: Hoare triple {26888#true} ~cond := #in~cond; {26888#true} is VALID [2022-04-28 14:09:54,147 INFO L272 TraceCheckUtils]: 6: Hoare triple {27802#(< ~counter~0 85)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {26888#true} is VALID [2022-04-28 14:09:54,147 INFO L290 TraceCheckUtils]: 5: Hoare triple {27802#(< ~counter~0 85)} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {27802#(< ~counter~0 85)} is VALID [2022-04-28 14:09:54,147 INFO L272 TraceCheckUtils]: 4: Hoare triple {27802#(< ~counter~0 85)} call #t~ret7 := main(); {27802#(< ~counter~0 85)} is VALID [2022-04-28 14:09:54,148 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {27802#(< ~counter~0 85)} {26888#true} #77#return; {27802#(< ~counter~0 85)} is VALID [2022-04-28 14:09:54,148 INFO L290 TraceCheckUtils]: 2: Hoare triple {27802#(< ~counter~0 85)} assume true; {27802#(< ~counter~0 85)} is VALID [2022-04-28 14:09:54,148 INFO L290 TraceCheckUtils]: 1: Hoare triple {26888#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(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {27802#(< ~counter~0 85)} is VALID [2022-04-28 14:09:54,149 INFO L272 TraceCheckUtils]: 0: Hoare triple {26888#true} call ULTIMATE.init(); {26888#true} is VALID [2022-04-28 14:09:54,149 INFO L134 CoverageAnalysis]: Checked inductivity of 1005 backedges. 30 proven. 555 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2022-04-28 14:09:54,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:09:54,150 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2011769902] [2022-04-28 14:09:54,150 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 14:09:54,150 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [867717584] [2022-04-28 14:09:54,150 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [867717584] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 14:09:54,150 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 14:09:54,150 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 36 [2022-04-28 14:09:54,150 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:09:54,150 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [702823841] [2022-04-28 14:09:54,150 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [702823841] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:09:54,150 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:09:54,150 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-04-28 14:09:54,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1809059304] [2022-04-28 14:09:54,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:09:54,151 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 6.157894736842105) internal successors, (117), 18 states have internal predecessors, (117), 18 states have call successors, (19), 18 states have call predecessors, (19), 16 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) Word has length 153 [2022-04-28 14:09:54,151 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:09:54,151 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 19 states, 19 states have (on average 6.157894736842105) internal successors, (117), 18 states have internal predecessors, (117), 18 states have call successors, (19), 18 states have call predecessors, (19), 16 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-28 14:09:54,296 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 153 edges. 153 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:09:54,297 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-04-28 14:09:54,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:09:54,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-04-28 14:09:54,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=566, Invalid=694, Unknown=0, NotChecked=0, Total=1260 [2022-04-28 14:09:54,298 INFO L87 Difference]: Start difference. First operand 197 states and 244 transitions. Second operand has 19 states, 19 states have (on average 6.157894736842105) internal successors, (117), 18 states have internal predecessors, (117), 18 states have call successors, (19), 18 states have call predecessors, (19), 16 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-28 14:09:55,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:09:55,265 INFO L93 Difference]: Finished difference Result 216 states and 267 transitions. [2022-04-28 14:09:55,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-04-28 14:09:55,266 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 6.157894736842105) internal successors, (117), 18 states have internal predecessors, (117), 18 states have call successors, (19), 18 states have call predecessors, (19), 16 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) Word has length 153 [2022-04-28 14:09:55,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:09:55,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 6.157894736842105) internal successors, (117), 18 states have internal predecessors, (117), 18 states have call successors, (19), 18 states have call predecessors, (19), 16 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-28 14:09:55,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 253 transitions. [2022-04-28 14:09:55,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 6.157894736842105) internal successors, (117), 18 states have internal predecessors, (117), 18 states have call successors, (19), 18 states have call predecessors, (19), 16 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-28 14:09:55,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 253 transitions. [2022-04-28 14:09:55,273 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 34 states and 253 transitions. [2022-04-28 14:09:55,498 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 253 edges. 253 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:09:55,502 INFO L225 Difference]: With dead ends: 216 [2022-04-28 14:09:55,502 INFO L226 Difference]: Without dead ends: 208 [2022-04-28 14:09:55,503 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 320 GetRequests, 271 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 151 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=1091, Invalid=1459, Unknown=0, NotChecked=0, Total=2550 [2022-04-28 14:09:55,503 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 194 mSDsluCounter, 237 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 194 SdHoareTripleChecker+Valid, 282 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 14:09:55,503 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [194 Valid, 282 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 14:09:55,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2022-04-28 14:09:55,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 208. [2022-04-28 14:09:55,899 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:09:55,899 INFO L82 GeneralOperation]: Start isEquivalent. First operand 208 states. Second operand has 208 states, 165 states have (on average 1.309090909090909) internal successors, (216), 166 states have internal predecessors, (216), 22 states have call successors, (22), 21 states have call predecessors, (22), 20 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2022-04-28 14:09:55,899 INFO L74 IsIncluded]: Start isIncluded. First operand 208 states. Second operand has 208 states, 165 states have (on average 1.309090909090909) internal successors, (216), 166 states have internal predecessors, (216), 22 states have call successors, (22), 21 states have call predecessors, (22), 20 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2022-04-28 14:09:55,899 INFO L87 Difference]: Start difference. First operand 208 states. Second operand has 208 states, 165 states have (on average 1.309090909090909) internal successors, (216), 166 states have internal predecessors, (216), 22 states have call successors, (22), 21 states have call predecessors, (22), 20 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2022-04-28 14:09:55,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:09:55,902 INFO L93 Difference]: Finished difference Result 208 states and 258 transitions. [2022-04-28 14:09:55,902 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 258 transitions. [2022-04-28 14:09:55,903 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:09:55,903 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:09:55,904 INFO L74 IsIncluded]: Start isIncluded. First operand has 208 states, 165 states have (on average 1.309090909090909) internal successors, (216), 166 states have internal predecessors, (216), 22 states have call successors, (22), 21 states have call predecessors, (22), 20 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand 208 states. [2022-04-28 14:09:55,904 INFO L87 Difference]: Start difference. First operand has 208 states, 165 states have (on average 1.309090909090909) internal successors, (216), 166 states have internal predecessors, (216), 22 states have call successors, (22), 21 states have call predecessors, (22), 20 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand 208 states. [2022-04-28 14:09:55,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:09:55,907 INFO L93 Difference]: Finished difference Result 208 states and 258 transitions. [2022-04-28 14:09:55,907 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 258 transitions. [2022-04-28 14:09:55,907 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:09:55,907 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:09:55,907 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:09:55,907 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:09:55,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 165 states have (on average 1.309090909090909) internal successors, (216), 166 states have internal predecessors, (216), 22 states have call successors, (22), 21 states have call predecessors, (22), 20 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2022-04-28 14:09:55,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 258 transitions. [2022-04-28 14:09:55,911 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 258 transitions. Word has length 153 [2022-04-28 14:09:55,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:09:55,911 INFO L495 AbstractCegarLoop]: Abstraction has 208 states and 258 transitions. [2022-04-28 14:09:55,911 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 6.157894736842105) internal successors, (117), 18 states have internal predecessors, (117), 18 states have call successors, (19), 18 states have call predecessors, (19), 16 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-28 14:09:55,912 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 208 states and 258 transitions. [2022-04-28 14:10:28,623 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 258 edges. 243 inductive. 0 not inductive. 15 times theorem prover too weak to decide inductivity. [2022-04-28 14:10:28,623 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 258 transitions. [2022-04-28 14:10:28,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2022-04-28 14:10:28,624 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:10:28,624 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 16, 16, 16, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 14:10:28,653 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Forceful destruction successful, exit code 0 [2022-04-28 14:10:28,825 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2022-04-28 14:10:28,825 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:10:28,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:10:28,825 INFO L85 PathProgramCache]: Analyzing trace with hash 1002092794, now seen corresponding path program 31 times [2022-04-28 14:10:28,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:10:28,826 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1081680568] [2022-04-28 14:10:34,875 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 14:10:34,875 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 14:10:34,875 INFO L85 PathProgramCache]: Analyzing trace with hash 1002092794, now seen corresponding path program 32 times [2022-04-28 14:10:34,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:10:34,875 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1759574834] [2022-04-28 14:10:34,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:10:34,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:10:34,901 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 14:10:34,901 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1355403990] [2022-04-28 14:10:34,901 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 14:10:34,901 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 14:10:34,901 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 14:10:34,903 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 14:10:34,926 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2022-04-28 14:10:35,001 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 14:10:35,001 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 14:10:35,002 INFO L263 TraceCheckSpWp]: Trace formula consists of 502 conjuncts, 37 conjunts are in the unsatisfiable core [2022-04-28 14:10:35,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:10:35,032 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 14:10:35,822 INFO L272 TraceCheckUtils]: 0: Hoare triple {29135#true} call ULTIMATE.init(); {29135#true} is VALID [2022-04-28 14:10:35,822 INFO L290 TraceCheckUtils]: 1: Hoare triple {29135#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(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {29143#(<= ~counter~0 0)} is VALID [2022-04-28 14:10:35,823 INFO L290 TraceCheckUtils]: 2: Hoare triple {29143#(<= ~counter~0 0)} assume true; {29143#(<= ~counter~0 0)} is VALID [2022-04-28 14:10:35,823 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29143#(<= ~counter~0 0)} {29135#true} #77#return; {29143#(<= ~counter~0 0)} is VALID [2022-04-28 14:10:35,823 INFO L272 TraceCheckUtils]: 4: Hoare triple {29143#(<= ~counter~0 0)} call #t~ret7 := main(); {29143#(<= ~counter~0 0)} is VALID [2022-04-28 14:10:35,824 INFO L290 TraceCheckUtils]: 5: Hoare triple {29143#(<= ~counter~0 0)} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {29143#(<= ~counter~0 0)} is VALID [2022-04-28 14:10:35,824 INFO L272 TraceCheckUtils]: 6: Hoare triple {29143#(<= ~counter~0 0)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {29143#(<= ~counter~0 0)} is VALID [2022-04-28 14:10:35,824 INFO L290 TraceCheckUtils]: 7: Hoare triple {29143#(<= ~counter~0 0)} ~cond := #in~cond; {29143#(<= ~counter~0 0)} is VALID [2022-04-28 14:10:35,824 INFO L290 TraceCheckUtils]: 8: Hoare triple {29143#(<= ~counter~0 0)} assume !(0 == ~cond); {29143#(<= ~counter~0 0)} is VALID [2022-04-28 14:10:35,825 INFO L290 TraceCheckUtils]: 9: Hoare triple {29143#(<= ~counter~0 0)} assume true; {29143#(<= ~counter~0 0)} is VALID [2022-04-28 14:10:35,825 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {29143#(<= ~counter~0 0)} {29143#(<= ~counter~0 0)} #69#return; {29143#(<= ~counter~0 0)} is VALID [2022-04-28 14:10:35,825 INFO L290 TraceCheckUtils]: 11: Hoare triple {29143#(<= ~counter~0 0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {29143#(<= ~counter~0 0)} is VALID [2022-04-28 14:10:35,826 INFO L290 TraceCheckUtils]: 12: Hoare triple {29143#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {29177#(<= ~counter~0 1)} is VALID [2022-04-28 14:10:35,826 INFO L290 TraceCheckUtils]: 13: Hoare triple {29177#(<= ~counter~0 1)} assume !!(#t~post6 < 100);havoc #t~post6; {29177#(<= ~counter~0 1)} is VALID [2022-04-28 14:10:35,827 INFO L272 TraceCheckUtils]: 14: Hoare triple {29177#(<= ~counter~0 1)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {29177#(<= ~counter~0 1)} is VALID [2022-04-28 14:10:35,827 INFO L290 TraceCheckUtils]: 15: Hoare triple {29177#(<= ~counter~0 1)} ~cond := #in~cond; {29177#(<= ~counter~0 1)} is VALID [2022-04-28 14:10:35,827 INFO L290 TraceCheckUtils]: 16: Hoare triple {29177#(<= ~counter~0 1)} assume !(0 == ~cond); {29177#(<= ~counter~0 1)} is VALID [2022-04-28 14:10:35,828 INFO L290 TraceCheckUtils]: 17: Hoare triple {29177#(<= ~counter~0 1)} assume true; {29177#(<= ~counter~0 1)} is VALID [2022-04-28 14:10:35,828 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {29177#(<= ~counter~0 1)} {29177#(<= ~counter~0 1)} #71#return; {29177#(<= ~counter~0 1)} is VALID [2022-04-28 14:10:35,828 INFO L290 TraceCheckUtils]: 19: Hoare triple {29177#(<= ~counter~0 1)} assume !!(0 != ~a~0 && 0 != ~b~0); {29177#(<= ~counter~0 1)} is VALID [2022-04-28 14:10:35,829 INFO L290 TraceCheckUtils]: 20: Hoare triple {29177#(<= ~counter~0 1)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {29177#(<= ~counter~0 1)} is VALID [2022-04-28 14:10:35,829 INFO L290 TraceCheckUtils]: 21: Hoare triple {29177#(<= ~counter~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {29205#(<= ~counter~0 2)} is VALID [2022-04-28 14:10:35,829 INFO L290 TraceCheckUtils]: 22: Hoare triple {29205#(<= ~counter~0 2)} assume !!(#t~post6 < 100);havoc #t~post6; {29205#(<= ~counter~0 2)} is VALID [2022-04-28 14:10:35,830 INFO L272 TraceCheckUtils]: 23: Hoare triple {29205#(<= ~counter~0 2)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {29205#(<= ~counter~0 2)} is VALID [2022-04-28 14:10:35,830 INFO L290 TraceCheckUtils]: 24: Hoare triple {29205#(<= ~counter~0 2)} ~cond := #in~cond; {29205#(<= ~counter~0 2)} is VALID [2022-04-28 14:10:35,830 INFO L290 TraceCheckUtils]: 25: Hoare triple {29205#(<= ~counter~0 2)} assume !(0 == ~cond); {29205#(<= ~counter~0 2)} is VALID [2022-04-28 14:10:35,831 INFO L290 TraceCheckUtils]: 26: Hoare triple {29205#(<= ~counter~0 2)} assume true; {29205#(<= ~counter~0 2)} is VALID [2022-04-28 14:10:35,831 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {29205#(<= ~counter~0 2)} {29205#(<= ~counter~0 2)} #71#return; {29205#(<= ~counter~0 2)} is VALID [2022-04-28 14:10:35,832 INFO L290 TraceCheckUtils]: 28: Hoare triple {29205#(<= ~counter~0 2)} assume !!(0 != ~a~0 && 0 != ~b~0); {29205#(<= ~counter~0 2)} is VALID [2022-04-28 14:10:35,832 INFO L290 TraceCheckUtils]: 29: Hoare triple {29205#(<= ~counter~0 2)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {29205#(<= ~counter~0 2)} is VALID [2022-04-28 14:10:35,832 INFO L290 TraceCheckUtils]: 30: Hoare triple {29205#(<= ~counter~0 2)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {29233#(<= ~counter~0 3)} is VALID [2022-04-28 14:10:35,833 INFO L290 TraceCheckUtils]: 31: Hoare triple {29233#(<= ~counter~0 3)} assume !!(#t~post6 < 100);havoc #t~post6; {29233#(<= ~counter~0 3)} is VALID [2022-04-28 14:10:35,833 INFO L272 TraceCheckUtils]: 32: Hoare triple {29233#(<= ~counter~0 3)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {29233#(<= ~counter~0 3)} is VALID [2022-04-28 14:10:35,833 INFO L290 TraceCheckUtils]: 33: Hoare triple {29233#(<= ~counter~0 3)} ~cond := #in~cond; {29233#(<= ~counter~0 3)} is VALID [2022-04-28 14:10:35,834 INFO L290 TraceCheckUtils]: 34: Hoare triple {29233#(<= ~counter~0 3)} assume !(0 == ~cond); {29233#(<= ~counter~0 3)} is VALID [2022-04-28 14:10:35,834 INFO L290 TraceCheckUtils]: 35: Hoare triple {29233#(<= ~counter~0 3)} assume true; {29233#(<= ~counter~0 3)} is VALID [2022-04-28 14:10:35,834 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {29233#(<= ~counter~0 3)} {29233#(<= ~counter~0 3)} #71#return; {29233#(<= ~counter~0 3)} is VALID [2022-04-28 14:10:35,835 INFO L290 TraceCheckUtils]: 37: Hoare triple {29233#(<= ~counter~0 3)} assume !!(0 != ~a~0 && 0 != ~b~0); {29233#(<= ~counter~0 3)} is VALID [2022-04-28 14:10:35,835 INFO L290 TraceCheckUtils]: 38: Hoare triple {29233#(<= ~counter~0 3)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {29233#(<= ~counter~0 3)} is VALID [2022-04-28 14:10:35,835 INFO L290 TraceCheckUtils]: 39: Hoare triple {29233#(<= ~counter~0 3)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {29261#(<= ~counter~0 4)} is VALID [2022-04-28 14:10:35,836 INFO L290 TraceCheckUtils]: 40: Hoare triple {29261#(<= ~counter~0 4)} assume !!(#t~post6 < 100);havoc #t~post6; {29261#(<= ~counter~0 4)} is VALID [2022-04-28 14:10:35,836 INFO L272 TraceCheckUtils]: 41: Hoare triple {29261#(<= ~counter~0 4)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {29261#(<= ~counter~0 4)} is VALID [2022-04-28 14:10:35,837 INFO L290 TraceCheckUtils]: 42: Hoare triple {29261#(<= ~counter~0 4)} ~cond := #in~cond; {29261#(<= ~counter~0 4)} is VALID [2022-04-28 14:10:35,837 INFO L290 TraceCheckUtils]: 43: Hoare triple {29261#(<= ~counter~0 4)} assume !(0 == ~cond); {29261#(<= ~counter~0 4)} is VALID [2022-04-28 14:10:35,837 INFO L290 TraceCheckUtils]: 44: Hoare triple {29261#(<= ~counter~0 4)} assume true; {29261#(<= ~counter~0 4)} is VALID [2022-04-28 14:10:35,838 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {29261#(<= ~counter~0 4)} {29261#(<= ~counter~0 4)} #71#return; {29261#(<= ~counter~0 4)} is VALID [2022-04-28 14:10:35,838 INFO L290 TraceCheckUtils]: 46: Hoare triple {29261#(<= ~counter~0 4)} assume !!(0 != ~a~0 && 0 != ~b~0); {29261#(<= ~counter~0 4)} is VALID [2022-04-28 14:10:35,838 INFO L290 TraceCheckUtils]: 47: Hoare triple {29261#(<= ~counter~0 4)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {29261#(<= ~counter~0 4)} is VALID [2022-04-28 14:10:35,839 INFO L290 TraceCheckUtils]: 48: Hoare triple {29261#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {29289#(<= ~counter~0 5)} is VALID [2022-04-28 14:10:35,839 INFO L290 TraceCheckUtils]: 49: Hoare triple {29289#(<= ~counter~0 5)} assume !!(#t~post6 < 100);havoc #t~post6; {29289#(<= ~counter~0 5)} is VALID [2022-04-28 14:10:35,840 INFO L272 TraceCheckUtils]: 50: Hoare triple {29289#(<= ~counter~0 5)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {29289#(<= ~counter~0 5)} is VALID [2022-04-28 14:10:35,840 INFO L290 TraceCheckUtils]: 51: Hoare triple {29289#(<= ~counter~0 5)} ~cond := #in~cond; {29289#(<= ~counter~0 5)} is VALID [2022-04-28 14:10:35,840 INFO L290 TraceCheckUtils]: 52: Hoare triple {29289#(<= ~counter~0 5)} assume !(0 == ~cond); {29289#(<= ~counter~0 5)} is VALID [2022-04-28 14:10:35,840 INFO L290 TraceCheckUtils]: 53: Hoare triple {29289#(<= ~counter~0 5)} assume true; {29289#(<= ~counter~0 5)} is VALID [2022-04-28 14:10:35,841 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {29289#(<= ~counter~0 5)} {29289#(<= ~counter~0 5)} #71#return; {29289#(<= ~counter~0 5)} is VALID [2022-04-28 14:10:35,841 INFO L290 TraceCheckUtils]: 55: Hoare triple {29289#(<= ~counter~0 5)} assume !!(0 != ~a~0 && 0 != ~b~0); {29289#(<= ~counter~0 5)} is VALID [2022-04-28 14:10:35,842 INFO L290 TraceCheckUtils]: 56: Hoare triple {29289#(<= ~counter~0 5)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {29289#(<= ~counter~0 5)} is VALID [2022-04-28 14:10:35,842 INFO L290 TraceCheckUtils]: 57: Hoare triple {29289#(<= ~counter~0 5)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {29317#(<= ~counter~0 6)} is VALID [2022-04-28 14:10:35,842 INFO L290 TraceCheckUtils]: 58: Hoare triple {29317#(<= ~counter~0 6)} assume !!(#t~post6 < 100);havoc #t~post6; {29317#(<= ~counter~0 6)} is VALID [2022-04-28 14:10:35,843 INFO L272 TraceCheckUtils]: 59: Hoare triple {29317#(<= ~counter~0 6)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {29317#(<= ~counter~0 6)} is VALID [2022-04-28 14:10:35,843 INFO L290 TraceCheckUtils]: 60: Hoare triple {29317#(<= ~counter~0 6)} ~cond := #in~cond; {29317#(<= ~counter~0 6)} is VALID [2022-04-28 14:10:35,843 INFO L290 TraceCheckUtils]: 61: Hoare triple {29317#(<= ~counter~0 6)} assume !(0 == ~cond); {29317#(<= ~counter~0 6)} is VALID [2022-04-28 14:10:35,844 INFO L290 TraceCheckUtils]: 62: Hoare triple {29317#(<= ~counter~0 6)} assume true; {29317#(<= ~counter~0 6)} is VALID [2022-04-28 14:10:35,844 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {29317#(<= ~counter~0 6)} {29317#(<= ~counter~0 6)} #71#return; {29317#(<= ~counter~0 6)} is VALID [2022-04-28 14:10:35,844 INFO L290 TraceCheckUtils]: 64: Hoare triple {29317#(<= ~counter~0 6)} assume !!(0 != ~a~0 && 0 != ~b~0); {29317#(<= ~counter~0 6)} is VALID [2022-04-28 14:10:35,845 INFO L290 TraceCheckUtils]: 65: Hoare triple {29317#(<= ~counter~0 6)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {29317#(<= ~counter~0 6)} is VALID [2022-04-28 14:10:35,845 INFO L290 TraceCheckUtils]: 66: Hoare triple {29317#(<= ~counter~0 6)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {29345#(<= ~counter~0 7)} is VALID [2022-04-28 14:10:35,845 INFO L290 TraceCheckUtils]: 67: Hoare triple {29345#(<= ~counter~0 7)} assume !!(#t~post6 < 100);havoc #t~post6; {29345#(<= ~counter~0 7)} is VALID [2022-04-28 14:10:35,846 INFO L272 TraceCheckUtils]: 68: Hoare triple {29345#(<= ~counter~0 7)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {29345#(<= ~counter~0 7)} is VALID [2022-04-28 14:10:35,846 INFO L290 TraceCheckUtils]: 69: Hoare triple {29345#(<= ~counter~0 7)} ~cond := #in~cond; {29345#(<= ~counter~0 7)} is VALID [2022-04-28 14:10:35,846 INFO L290 TraceCheckUtils]: 70: Hoare triple {29345#(<= ~counter~0 7)} assume !(0 == ~cond); {29345#(<= ~counter~0 7)} is VALID [2022-04-28 14:10:35,847 INFO L290 TraceCheckUtils]: 71: Hoare triple {29345#(<= ~counter~0 7)} assume true; {29345#(<= ~counter~0 7)} is VALID [2022-04-28 14:10:35,847 INFO L284 TraceCheckUtils]: 72: Hoare quadruple {29345#(<= ~counter~0 7)} {29345#(<= ~counter~0 7)} #71#return; {29345#(<= ~counter~0 7)} is VALID [2022-04-28 14:10:35,848 INFO L290 TraceCheckUtils]: 73: Hoare triple {29345#(<= ~counter~0 7)} assume !!(0 != ~a~0 && 0 != ~b~0); {29345#(<= ~counter~0 7)} is VALID [2022-04-28 14:10:35,848 INFO L290 TraceCheckUtils]: 74: Hoare triple {29345#(<= ~counter~0 7)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {29345#(<= ~counter~0 7)} is VALID [2022-04-28 14:10:35,849 INFO L290 TraceCheckUtils]: 75: Hoare triple {29345#(<= ~counter~0 7)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {29373#(<= ~counter~0 8)} is VALID [2022-04-28 14:10:35,849 INFO L290 TraceCheckUtils]: 76: Hoare triple {29373#(<= ~counter~0 8)} assume !!(#t~post6 < 100);havoc #t~post6; {29373#(<= ~counter~0 8)} is VALID [2022-04-28 14:10:35,849 INFO L272 TraceCheckUtils]: 77: Hoare triple {29373#(<= ~counter~0 8)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {29373#(<= ~counter~0 8)} is VALID [2022-04-28 14:10:35,850 INFO L290 TraceCheckUtils]: 78: Hoare triple {29373#(<= ~counter~0 8)} ~cond := #in~cond; {29373#(<= ~counter~0 8)} is VALID [2022-04-28 14:10:35,850 INFO L290 TraceCheckUtils]: 79: Hoare triple {29373#(<= ~counter~0 8)} assume !(0 == ~cond); {29373#(<= ~counter~0 8)} is VALID [2022-04-28 14:10:35,850 INFO L290 TraceCheckUtils]: 80: Hoare triple {29373#(<= ~counter~0 8)} assume true; {29373#(<= ~counter~0 8)} is VALID [2022-04-28 14:10:35,851 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {29373#(<= ~counter~0 8)} {29373#(<= ~counter~0 8)} #71#return; {29373#(<= ~counter~0 8)} is VALID [2022-04-28 14:10:35,851 INFO L290 TraceCheckUtils]: 82: Hoare triple {29373#(<= ~counter~0 8)} assume !!(0 != ~a~0 && 0 != ~b~0); {29373#(<= ~counter~0 8)} is VALID [2022-04-28 14:10:35,851 INFO L290 TraceCheckUtils]: 83: Hoare triple {29373#(<= ~counter~0 8)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {29373#(<= ~counter~0 8)} is VALID [2022-04-28 14:10:35,852 INFO L290 TraceCheckUtils]: 84: Hoare triple {29373#(<= ~counter~0 8)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {29401#(<= ~counter~0 9)} is VALID [2022-04-28 14:10:35,852 INFO L290 TraceCheckUtils]: 85: Hoare triple {29401#(<= ~counter~0 9)} assume !!(#t~post6 < 100);havoc #t~post6; {29401#(<= ~counter~0 9)} is VALID [2022-04-28 14:10:35,853 INFO L272 TraceCheckUtils]: 86: Hoare triple {29401#(<= ~counter~0 9)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {29401#(<= ~counter~0 9)} is VALID [2022-04-28 14:10:35,853 INFO L290 TraceCheckUtils]: 87: Hoare triple {29401#(<= ~counter~0 9)} ~cond := #in~cond; {29401#(<= ~counter~0 9)} is VALID [2022-04-28 14:10:35,853 INFO L290 TraceCheckUtils]: 88: Hoare triple {29401#(<= ~counter~0 9)} assume !(0 == ~cond); {29401#(<= ~counter~0 9)} is VALID [2022-04-28 14:10:35,853 INFO L290 TraceCheckUtils]: 89: Hoare triple {29401#(<= ~counter~0 9)} assume true; {29401#(<= ~counter~0 9)} is VALID [2022-04-28 14:10:35,854 INFO L284 TraceCheckUtils]: 90: Hoare quadruple {29401#(<= ~counter~0 9)} {29401#(<= ~counter~0 9)} #71#return; {29401#(<= ~counter~0 9)} is VALID [2022-04-28 14:10:35,854 INFO L290 TraceCheckUtils]: 91: Hoare triple {29401#(<= ~counter~0 9)} assume !!(0 != ~a~0 && 0 != ~b~0); {29401#(<= ~counter~0 9)} is VALID [2022-04-28 14:10:35,854 INFO L290 TraceCheckUtils]: 92: Hoare triple {29401#(<= ~counter~0 9)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {29401#(<= ~counter~0 9)} is VALID [2022-04-28 14:10:35,855 INFO L290 TraceCheckUtils]: 93: Hoare triple {29401#(<= ~counter~0 9)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {29429#(<= ~counter~0 10)} is VALID [2022-04-28 14:10:35,855 INFO L290 TraceCheckUtils]: 94: Hoare triple {29429#(<= ~counter~0 10)} assume !!(#t~post6 < 100);havoc #t~post6; {29429#(<= ~counter~0 10)} is VALID [2022-04-28 14:10:35,856 INFO L272 TraceCheckUtils]: 95: Hoare triple {29429#(<= ~counter~0 10)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {29429#(<= ~counter~0 10)} is VALID [2022-04-28 14:10:35,856 INFO L290 TraceCheckUtils]: 96: Hoare triple {29429#(<= ~counter~0 10)} ~cond := #in~cond; {29429#(<= ~counter~0 10)} is VALID [2022-04-28 14:10:35,856 INFO L290 TraceCheckUtils]: 97: Hoare triple {29429#(<= ~counter~0 10)} assume !(0 == ~cond); {29429#(<= ~counter~0 10)} is VALID [2022-04-28 14:10:35,856 INFO L290 TraceCheckUtils]: 98: Hoare triple {29429#(<= ~counter~0 10)} assume true; {29429#(<= ~counter~0 10)} is VALID [2022-04-28 14:10:35,857 INFO L284 TraceCheckUtils]: 99: Hoare quadruple {29429#(<= ~counter~0 10)} {29429#(<= ~counter~0 10)} #71#return; {29429#(<= ~counter~0 10)} is VALID [2022-04-28 14:10:35,857 INFO L290 TraceCheckUtils]: 100: Hoare triple {29429#(<= ~counter~0 10)} assume !!(0 != ~a~0 && 0 != ~b~0); {29429#(<= ~counter~0 10)} is VALID [2022-04-28 14:10:35,857 INFO L290 TraceCheckUtils]: 101: Hoare triple {29429#(<= ~counter~0 10)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {29429#(<= ~counter~0 10)} is VALID [2022-04-28 14:10:35,858 INFO L290 TraceCheckUtils]: 102: Hoare triple {29429#(<= ~counter~0 10)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {29457#(<= ~counter~0 11)} is VALID [2022-04-28 14:10:35,858 INFO L290 TraceCheckUtils]: 103: Hoare triple {29457#(<= ~counter~0 11)} assume !!(#t~post6 < 100);havoc #t~post6; {29457#(<= ~counter~0 11)} is VALID [2022-04-28 14:10:35,859 INFO L272 TraceCheckUtils]: 104: Hoare triple {29457#(<= ~counter~0 11)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {29457#(<= ~counter~0 11)} is VALID [2022-04-28 14:10:35,859 INFO L290 TraceCheckUtils]: 105: Hoare triple {29457#(<= ~counter~0 11)} ~cond := #in~cond; {29457#(<= ~counter~0 11)} is VALID [2022-04-28 14:10:35,859 INFO L290 TraceCheckUtils]: 106: Hoare triple {29457#(<= ~counter~0 11)} assume !(0 == ~cond); {29457#(<= ~counter~0 11)} is VALID [2022-04-28 14:10:35,860 INFO L290 TraceCheckUtils]: 107: Hoare triple {29457#(<= ~counter~0 11)} assume true; {29457#(<= ~counter~0 11)} is VALID [2022-04-28 14:10:35,860 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {29457#(<= ~counter~0 11)} {29457#(<= ~counter~0 11)} #71#return; {29457#(<= ~counter~0 11)} is VALID [2022-04-28 14:10:35,875 INFO L290 TraceCheckUtils]: 109: Hoare triple {29457#(<= ~counter~0 11)} assume !!(0 != ~a~0 && 0 != ~b~0); {29457#(<= ~counter~0 11)} is VALID [2022-04-28 14:10:35,876 INFO L290 TraceCheckUtils]: 110: Hoare triple {29457#(<= ~counter~0 11)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {29457#(<= ~counter~0 11)} is VALID [2022-04-28 14:10:35,877 INFO L290 TraceCheckUtils]: 111: Hoare triple {29457#(<= ~counter~0 11)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {29485#(<= ~counter~0 12)} is VALID [2022-04-28 14:10:35,877 INFO L290 TraceCheckUtils]: 112: Hoare triple {29485#(<= ~counter~0 12)} assume !!(#t~post6 < 100);havoc #t~post6; {29485#(<= ~counter~0 12)} is VALID [2022-04-28 14:10:35,878 INFO L272 TraceCheckUtils]: 113: Hoare triple {29485#(<= ~counter~0 12)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {29485#(<= ~counter~0 12)} is VALID [2022-04-28 14:10:35,878 INFO L290 TraceCheckUtils]: 114: Hoare triple {29485#(<= ~counter~0 12)} ~cond := #in~cond; {29485#(<= ~counter~0 12)} is VALID [2022-04-28 14:10:35,878 INFO L290 TraceCheckUtils]: 115: Hoare triple {29485#(<= ~counter~0 12)} assume !(0 == ~cond); {29485#(<= ~counter~0 12)} is VALID [2022-04-28 14:10:35,878 INFO L290 TraceCheckUtils]: 116: Hoare triple {29485#(<= ~counter~0 12)} assume true; {29485#(<= ~counter~0 12)} is VALID [2022-04-28 14:10:35,879 INFO L284 TraceCheckUtils]: 117: Hoare quadruple {29485#(<= ~counter~0 12)} {29485#(<= ~counter~0 12)} #71#return; {29485#(<= ~counter~0 12)} is VALID [2022-04-28 14:10:35,879 INFO L290 TraceCheckUtils]: 118: Hoare triple {29485#(<= ~counter~0 12)} assume !!(0 != ~a~0 && 0 != ~b~0); {29485#(<= ~counter~0 12)} is VALID [2022-04-28 14:10:35,880 INFO L290 TraceCheckUtils]: 119: Hoare triple {29485#(<= ~counter~0 12)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {29485#(<= ~counter~0 12)} is VALID [2022-04-28 14:10:35,880 INFO L290 TraceCheckUtils]: 120: Hoare triple {29485#(<= ~counter~0 12)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {29513#(<= ~counter~0 13)} is VALID [2022-04-28 14:10:35,880 INFO L290 TraceCheckUtils]: 121: Hoare triple {29513#(<= ~counter~0 13)} assume !!(#t~post6 < 100);havoc #t~post6; {29513#(<= ~counter~0 13)} is VALID [2022-04-28 14:10:35,881 INFO L272 TraceCheckUtils]: 122: Hoare triple {29513#(<= ~counter~0 13)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {29513#(<= ~counter~0 13)} is VALID [2022-04-28 14:10:35,881 INFO L290 TraceCheckUtils]: 123: Hoare triple {29513#(<= ~counter~0 13)} ~cond := #in~cond; {29513#(<= ~counter~0 13)} is VALID [2022-04-28 14:10:35,881 INFO L290 TraceCheckUtils]: 124: Hoare triple {29513#(<= ~counter~0 13)} assume !(0 == ~cond); {29513#(<= ~counter~0 13)} is VALID [2022-04-28 14:10:35,882 INFO L290 TraceCheckUtils]: 125: Hoare triple {29513#(<= ~counter~0 13)} assume true; {29513#(<= ~counter~0 13)} is VALID [2022-04-28 14:10:35,882 INFO L284 TraceCheckUtils]: 126: Hoare quadruple {29513#(<= ~counter~0 13)} {29513#(<= ~counter~0 13)} #71#return; {29513#(<= ~counter~0 13)} is VALID [2022-04-28 14:10:35,882 INFO L290 TraceCheckUtils]: 127: Hoare triple {29513#(<= ~counter~0 13)} assume !!(0 != ~a~0 && 0 != ~b~0); {29513#(<= ~counter~0 13)} is VALID [2022-04-28 14:10:35,883 INFO L290 TraceCheckUtils]: 128: Hoare triple {29513#(<= ~counter~0 13)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {29513#(<= ~counter~0 13)} is VALID [2022-04-28 14:10:35,883 INFO L290 TraceCheckUtils]: 129: Hoare triple {29513#(<= ~counter~0 13)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {29541#(<= ~counter~0 14)} is VALID [2022-04-28 14:10:35,883 INFO L290 TraceCheckUtils]: 130: Hoare triple {29541#(<= ~counter~0 14)} assume !!(#t~post6 < 100);havoc #t~post6; {29541#(<= ~counter~0 14)} is VALID [2022-04-28 14:10:35,884 INFO L272 TraceCheckUtils]: 131: Hoare triple {29541#(<= ~counter~0 14)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {29541#(<= ~counter~0 14)} is VALID [2022-04-28 14:10:35,884 INFO L290 TraceCheckUtils]: 132: Hoare triple {29541#(<= ~counter~0 14)} ~cond := #in~cond; {29541#(<= ~counter~0 14)} is VALID [2022-04-28 14:10:35,884 INFO L290 TraceCheckUtils]: 133: Hoare triple {29541#(<= ~counter~0 14)} assume !(0 == ~cond); {29541#(<= ~counter~0 14)} is VALID [2022-04-28 14:10:35,885 INFO L290 TraceCheckUtils]: 134: Hoare triple {29541#(<= ~counter~0 14)} assume true; {29541#(<= ~counter~0 14)} is VALID [2022-04-28 14:10:35,885 INFO L284 TraceCheckUtils]: 135: Hoare quadruple {29541#(<= ~counter~0 14)} {29541#(<= ~counter~0 14)} #71#return; {29541#(<= ~counter~0 14)} is VALID [2022-04-28 14:10:35,885 INFO L290 TraceCheckUtils]: 136: Hoare triple {29541#(<= ~counter~0 14)} assume !!(0 != ~a~0 && 0 != ~b~0); {29541#(<= ~counter~0 14)} is VALID [2022-04-28 14:10:35,886 INFO L290 TraceCheckUtils]: 137: Hoare triple {29541#(<= ~counter~0 14)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {29541#(<= ~counter~0 14)} is VALID [2022-04-28 14:10:35,886 INFO L290 TraceCheckUtils]: 138: Hoare triple {29541#(<= ~counter~0 14)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {29569#(<= ~counter~0 15)} is VALID [2022-04-28 14:10:35,886 INFO L290 TraceCheckUtils]: 139: Hoare triple {29569#(<= ~counter~0 15)} assume !!(#t~post6 < 100);havoc #t~post6; {29569#(<= ~counter~0 15)} is VALID [2022-04-28 14:10:35,887 INFO L272 TraceCheckUtils]: 140: Hoare triple {29569#(<= ~counter~0 15)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {29569#(<= ~counter~0 15)} is VALID [2022-04-28 14:10:35,887 INFO L290 TraceCheckUtils]: 141: Hoare triple {29569#(<= ~counter~0 15)} ~cond := #in~cond; {29569#(<= ~counter~0 15)} is VALID [2022-04-28 14:10:35,888 INFO L290 TraceCheckUtils]: 142: Hoare triple {29569#(<= ~counter~0 15)} assume !(0 == ~cond); {29569#(<= ~counter~0 15)} is VALID [2022-04-28 14:10:35,888 INFO L290 TraceCheckUtils]: 143: Hoare triple {29569#(<= ~counter~0 15)} assume true; {29569#(<= ~counter~0 15)} is VALID [2022-04-28 14:10:35,888 INFO L284 TraceCheckUtils]: 144: Hoare quadruple {29569#(<= ~counter~0 15)} {29569#(<= ~counter~0 15)} #71#return; {29569#(<= ~counter~0 15)} is VALID [2022-04-28 14:10:35,889 INFO L290 TraceCheckUtils]: 145: Hoare triple {29569#(<= ~counter~0 15)} assume !!(0 != ~a~0 && 0 != ~b~0); {29569#(<= ~counter~0 15)} is VALID [2022-04-28 14:10:35,889 INFO L290 TraceCheckUtils]: 146: Hoare triple {29569#(<= ~counter~0 15)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {29569#(<= ~counter~0 15)} is VALID [2022-04-28 14:10:35,889 INFO L290 TraceCheckUtils]: 147: Hoare triple {29569#(<= ~counter~0 15)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {29597#(<= ~counter~0 16)} is VALID [2022-04-28 14:10:35,890 INFO L290 TraceCheckUtils]: 148: Hoare triple {29597#(<= ~counter~0 16)} assume !!(#t~post6 < 100);havoc #t~post6; {29597#(<= ~counter~0 16)} is VALID [2022-04-28 14:10:35,890 INFO L272 TraceCheckUtils]: 149: Hoare triple {29597#(<= ~counter~0 16)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {29597#(<= ~counter~0 16)} is VALID [2022-04-28 14:10:35,890 INFO L290 TraceCheckUtils]: 150: Hoare triple {29597#(<= ~counter~0 16)} ~cond := #in~cond; {29597#(<= ~counter~0 16)} is VALID [2022-04-28 14:10:35,891 INFO L290 TraceCheckUtils]: 151: Hoare triple {29597#(<= ~counter~0 16)} assume !(0 == ~cond); {29597#(<= ~counter~0 16)} is VALID [2022-04-28 14:10:35,891 INFO L290 TraceCheckUtils]: 152: Hoare triple {29597#(<= ~counter~0 16)} assume true; {29597#(<= ~counter~0 16)} is VALID [2022-04-28 14:10:35,891 INFO L284 TraceCheckUtils]: 153: Hoare quadruple {29597#(<= ~counter~0 16)} {29597#(<= ~counter~0 16)} #71#return; {29597#(<= ~counter~0 16)} is VALID [2022-04-28 14:10:35,892 INFO L290 TraceCheckUtils]: 154: Hoare triple {29597#(<= ~counter~0 16)} assume !!(0 != ~a~0 && 0 != ~b~0); {29597#(<= ~counter~0 16)} is VALID [2022-04-28 14:10:35,892 INFO L290 TraceCheckUtils]: 155: Hoare triple {29597#(<= ~counter~0 16)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {29597#(<= ~counter~0 16)} is VALID [2022-04-28 14:10:35,892 INFO L290 TraceCheckUtils]: 156: Hoare triple {29597#(<= ~counter~0 16)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {29625#(<= |main_#t~post6| 16)} is VALID [2022-04-28 14:10:35,893 INFO L290 TraceCheckUtils]: 157: Hoare triple {29625#(<= |main_#t~post6| 16)} assume !(#t~post6 < 100);havoc #t~post6; {29136#false} is VALID [2022-04-28 14:10:35,893 INFO L272 TraceCheckUtils]: 158: Hoare triple {29136#false} call __VERIFIER_assert((if ~q~0 == ~x~0 * ~y~0 then 1 else 0)); {29136#false} is VALID [2022-04-28 14:10:35,893 INFO L290 TraceCheckUtils]: 159: Hoare triple {29136#false} ~cond := #in~cond; {29136#false} is VALID [2022-04-28 14:10:35,893 INFO L290 TraceCheckUtils]: 160: Hoare triple {29136#false} assume 0 == ~cond; {29136#false} is VALID [2022-04-28 14:10:35,893 INFO L290 TraceCheckUtils]: 161: Hoare triple {29136#false} assume !false; {29136#false} is VALID [2022-04-28 14:10:35,893 INFO L134 CoverageAnalysis]: Checked inductivity of 1144 backedges. 32 proven. 1112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 14:10:35,894 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 14:10:36,860 INFO L290 TraceCheckUtils]: 161: Hoare triple {29136#false} assume !false; {29136#false} is VALID [2022-04-28 14:10:36,861 INFO L290 TraceCheckUtils]: 160: Hoare triple {29136#false} assume 0 == ~cond; {29136#false} is VALID [2022-04-28 14:10:36,861 INFO L290 TraceCheckUtils]: 159: Hoare triple {29136#false} ~cond := #in~cond; {29136#false} is VALID [2022-04-28 14:10:36,861 INFO L272 TraceCheckUtils]: 158: Hoare triple {29136#false} call __VERIFIER_assert((if ~q~0 == ~x~0 * ~y~0 then 1 else 0)); {29136#false} is VALID [2022-04-28 14:10:36,861 INFO L290 TraceCheckUtils]: 157: Hoare triple {29653#(< |main_#t~post6| 100)} assume !(#t~post6 < 100);havoc #t~post6; {29136#false} is VALID [2022-04-28 14:10:36,861 INFO L290 TraceCheckUtils]: 156: Hoare triple {29657#(< ~counter~0 100)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {29653#(< |main_#t~post6| 100)} is VALID [2022-04-28 14:10:36,862 INFO L290 TraceCheckUtils]: 155: Hoare triple {29657#(< ~counter~0 100)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {29657#(< ~counter~0 100)} is VALID [2022-04-28 14:10:36,862 INFO L290 TraceCheckUtils]: 154: Hoare triple {29657#(< ~counter~0 100)} assume !!(0 != ~a~0 && 0 != ~b~0); {29657#(< ~counter~0 100)} is VALID [2022-04-28 14:10:36,862 INFO L284 TraceCheckUtils]: 153: Hoare quadruple {29135#true} {29657#(< ~counter~0 100)} #71#return; {29657#(< ~counter~0 100)} is VALID [2022-04-28 14:10:36,862 INFO L290 TraceCheckUtils]: 152: Hoare triple {29135#true} assume true; {29135#true} is VALID [2022-04-28 14:10:36,862 INFO L290 TraceCheckUtils]: 151: Hoare triple {29135#true} assume !(0 == ~cond); {29135#true} is VALID [2022-04-28 14:10:36,862 INFO L290 TraceCheckUtils]: 150: Hoare triple {29135#true} ~cond := #in~cond; {29135#true} is VALID [2022-04-28 14:10:36,863 INFO L272 TraceCheckUtils]: 149: Hoare triple {29657#(< ~counter~0 100)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {29135#true} is VALID [2022-04-28 14:10:36,863 INFO L290 TraceCheckUtils]: 148: Hoare triple {29657#(< ~counter~0 100)} assume !!(#t~post6 < 100);havoc #t~post6; {29657#(< ~counter~0 100)} is VALID [2022-04-28 14:10:36,864 INFO L290 TraceCheckUtils]: 147: Hoare triple {29685#(< ~counter~0 99)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {29657#(< ~counter~0 100)} is VALID [2022-04-28 14:10:36,864 INFO L290 TraceCheckUtils]: 146: Hoare triple {29685#(< ~counter~0 99)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {29685#(< ~counter~0 99)} is VALID [2022-04-28 14:10:36,864 INFO L290 TraceCheckUtils]: 145: Hoare triple {29685#(< ~counter~0 99)} assume !!(0 != ~a~0 && 0 != ~b~0); {29685#(< ~counter~0 99)} is VALID [2022-04-28 14:10:36,865 INFO L284 TraceCheckUtils]: 144: Hoare quadruple {29135#true} {29685#(< ~counter~0 99)} #71#return; {29685#(< ~counter~0 99)} is VALID [2022-04-28 14:10:36,865 INFO L290 TraceCheckUtils]: 143: Hoare triple {29135#true} assume true; {29135#true} is VALID [2022-04-28 14:10:36,865 INFO L290 TraceCheckUtils]: 142: Hoare triple {29135#true} assume !(0 == ~cond); {29135#true} is VALID [2022-04-28 14:10:36,865 INFO L290 TraceCheckUtils]: 141: Hoare triple {29135#true} ~cond := #in~cond; {29135#true} is VALID [2022-04-28 14:10:36,865 INFO L272 TraceCheckUtils]: 140: Hoare triple {29685#(< ~counter~0 99)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {29135#true} is VALID [2022-04-28 14:10:36,865 INFO L290 TraceCheckUtils]: 139: Hoare triple {29685#(< ~counter~0 99)} assume !!(#t~post6 < 100);havoc #t~post6; {29685#(< ~counter~0 99)} is VALID [2022-04-28 14:10:36,866 INFO L290 TraceCheckUtils]: 138: Hoare triple {29713#(< ~counter~0 98)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {29685#(< ~counter~0 99)} is VALID [2022-04-28 14:10:36,866 INFO L290 TraceCheckUtils]: 137: Hoare triple {29713#(< ~counter~0 98)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {29713#(< ~counter~0 98)} is VALID [2022-04-28 14:10:36,866 INFO L290 TraceCheckUtils]: 136: Hoare triple {29713#(< ~counter~0 98)} assume !!(0 != ~a~0 && 0 != ~b~0); {29713#(< ~counter~0 98)} is VALID [2022-04-28 14:10:36,867 INFO L284 TraceCheckUtils]: 135: Hoare quadruple {29135#true} {29713#(< ~counter~0 98)} #71#return; {29713#(< ~counter~0 98)} is VALID [2022-04-28 14:10:36,867 INFO L290 TraceCheckUtils]: 134: Hoare triple {29135#true} assume true; {29135#true} is VALID [2022-04-28 14:10:36,867 INFO L290 TraceCheckUtils]: 133: Hoare triple {29135#true} assume !(0 == ~cond); {29135#true} is VALID [2022-04-28 14:10:36,867 INFO L290 TraceCheckUtils]: 132: Hoare triple {29135#true} ~cond := #in~cond; {29135#true} is VALID [2022-04-28 14:10:36,867 INFO L272 TraceCheckUtils]: 131: Hoare triple {29713#(< ~counter~0 98)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {29135#true} is VALID [2022-04-28 14:10:36,867 INFO L290 TraceCheckUtils]: 130: Hoare triple {29713#(< ~counter~0 98)} assume !!(#t~post6 < 100);havoc #t~post6; {29713#(< ~counter~0 98)} is VALID [2022-04-28 14:10:36,868 INFO L290 TraceCheckUtils]: 129: Hoare triple {29741#(< ~counter~0 97)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {29713#(< ~counter~0 98)} is VALID [2022-04-28 14:10:36,868 INFO L290 TraceCheckUtils]: 128: Hoare triple {29741#(< ~counter~0 97)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {29741#(< ~counter~0 97)} is VALID [2022-04-28 14:10:36,869 INFO L290 TraceCheckUtils]: 127: Hoare triple {29741#(< ~counter~0 97)} assume !!(0 != ~a~0 && 0 != ~b~0); {29741#(< ~counter~0 97)} is VALID [2022-04-28 14:10:36,869 INFO L284 TraceCheckUtils]: 126: Hoare quadruple {29135#true} {29741#(< ~counter~0 97)} #71#return; {29741#(< ~counter~0 97)} is VALID [2022-04-28 14:10:36,869 INFO L290 TraceCheckUtils]: 125: Hoare triple {29135#true} assume true; {29135#true} is VALID [2022-04-28 14:10:36,869 INFO L290 TraceCheckUtils]: 124: Hoare triple {29135#true} assume !(0 == ~cond); {29135#true} is VALID [2022-04-28 14:10:36,869 INFO L290 TraceCheckUtils]: 123: Hoare triple {29135#true} ~cond := #in~cond; {29135#true} is VALID [2022-04-28 14:10:36,869 INFO L272 TraceCheckUtils]: 122: Hoare triple {29741#(< ~counter~0 97)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {29135#true} is VALID [2022-04-28 14:10:36,870 INFO L290 TraceCheckUtils]: 121: Hoare triple {29741#(< ~counter~0 97)} assume !!(#t~post6 < 100);havoc #t~post6; {29741#(< ~counter~0 97)} is VALID [2022-04-28 14:10:36,870 INFO L290 TraceCheckUtils]: 120: Hoare triple {29769#(< ~counter~0 96)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {29741#(< ~counter~0 97)} is VALID [2022-04-28 14:10:36,870 INFO L290 TraceCheckUtils]: 119: Hoare triple {29769#(< ~counter~0 96)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {29769#(< ~counter~0 96)} is VALID [2022-04-28 14:10:36,871 INFO L290 TraceCheckUtils]: 118: Hoare triple {29769#(< ~counter~0 96)} assume !!(0 != ~a~0 && 0 != ~b~0); {29769#(< ~counter~0 96)} is VALID [2022-04-28 14:10:36,871 INFO L284 TraceCheckUtils]: 117: Hoare quadruple {29135#true} {29769#(< ~counter~0 96)} #71#return; {29769#(< ~counter~0 96)} is VALID [2022-04-28 14:10:36,871 INFO L290 TraceCheckUtils]: 116: Hoare triple {29135#true} assume true; {29135#true} is VALID [2022-04-28 14:10:36,871 INFO L290 TraceCheckUtils]: 115: Hoare triple {29135#true} assume !(0 == ~cond); {29135#true} is VALID [2022-04-28 14:10:36,871 INFO L290 TraceCheckUtils]: 114: Hoare triple {29135#true} ~cond := #in~cond; {29135#true} is VALID [2022-04-28 14:10:36,871 INFO L272 TraceCheckUtils]: 113: Hoare triple {29769#(< ~counter~0 96)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {29135#true} is VALID [2022-04-28 14:10:36,872 INFO L290 TraceCheckUtils]: 112: Hoare triple {29769#(< ~counter~0 96)} assume !!(#t~post6 < 100);havoc #t~post6; {29769#(< ~counter~0 96)} is VALID [2022-04-28 14:10:36,872 INFO L290 TraceCheckUtils]: 111: Hoare triple {29797#(< ~counter~0 95)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {29769#(< ~counter~0 96)} is VALID [2022-04-28 14:10:36,872 INFO L290 TraceCheckUtils]: 110: Hoare triple {29797#(< ~counter~0 95)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {29797#(< ~counter~0 95)} is VALID [2022-04-28 14:10:36,873 INFO L290 TraceCheckUtils]: 109: Hoare triple {29797#(< ~counter~0 95)} assume !!(0 != ~a~0 && 0 != ~b~0); {29797#(< ~counter~0 95)} is VALID [2022-04-28 14:10:36,873 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {29135#true} {29797#(< ~counter~0 95)} #71#return; {29797#(< ~counter~0 95)} is VALID [2022-04-28 14:10:36,873 INFO L290 TraceCheckUtils]: 107: Hoare triple {29135#true} assume true; {29135#true} is VALID [2022-04-28 14:10:36,873 INFO L290 TraceCheckUtils]: 106: Hoare triple {29135#true} assume !(0 == ~cond); {29135#true} is VALID [2022-04-28 14:10:36,873 INFO L290 TraceCheckUtils]: 105: Hoare triple {29135#true} ~cond := #in~cond; {29135#true} is VALID [2022-04-28 14:10:36,873 INFO L272 TraceCheckUtils]: 104: Hoare triple {29797#(< ~counter~0 95)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {29135#true} is VALID [2022-04-28 14:10:36,874 INFO L290 TraceCheckUtils]: 103: Hoare triple {29797#(< ~counter~0 95)} assume !!(#t~post6 < 100);havoc #t~post6; {29797#(< ~counter~0 95)} is VALID [2022-04-28 14:10:36,874 INFO L290 TraceCheckUtils]: 102: Hoare triple {29825#(< ~counter~0 94)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {29797#(< ~counter~0 95)} is VALID [2022-04-28 14:10:36,875 INFO L290 TraceCheckUtils]: 101: Hoare triple {29825#(< ~counter~0 94)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {29825#(< ~counter~0 94)} is VALID [2022-04-28 14:10:36,875 INFO L290 TraceCheckUtils]: 100: Hoare triple {29825#(< ~counter~0 94)} assume !!(0 != ~a~0 && 0 != ~b~0); {29825#(< ~counter~0 94)} is VALID [2022-04-28 14:10:36,876 INFO L284 TraceCheckUtils]: 99: Hoare quadruple {29135#true} {29825#(< ~counter~0 94)} #71#return; {29825#(< ~counter~0 94)} is VALID [2022-04-28 14:10:36,876 INFO L290 TraceCheckUtils]: 98: Hoare triple {29135#true} assume true; {29135#true} is VALID [2022-04-28 14:10:36,876 INFO L290 TraceCheckUtils]: 97: Hoare triple {29135#true} assume !(0 == ~cond); {29135#true} is VALID [2022-04-28 14:10:36,876 INFO L290 TraceCheckUtils]: 96: Hoare triple {29135#true} ~cond := #in~cond; {29135#true} is VALID [2022-04-28 14:10:36,876 INFO L272 TraceCheckUtils]: 95: Hoare triple {29825#(< ~counter~0 94)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {29135#true} is VALID [2022-04-28 14:10:36,876 INFO L290 TraceCheckUtils]: 94: Hoare triple {29825#(< ~counter~0 94)} assume !!(#t~post6 < 100);havoc #t~post6; {29825#(< ~counter~0 94)} is VALID [2022-04-28 14:10:36,877 INFO L290 TraceCheckUtils]: 93: Hoare triple {29853#(< ~counter~0 93)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {29825#(< ~counter~0 94)} is VALID [2022-04-28 14:10:36,877 INFO L290 TraceCheckUtils]: 92: Hoare triple {29853#(< ~counter~0 93)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {29853#(< ~counter~0 93)} is VALID [2022-04-28 14:10:36,877 INFO L290 TraceCheckUtils]: 91: Hoare triple {29853#(< ~counter~0 93)} assume !!(0 != ~a~0 && 0 != ~b~0); {29853#(< ~counter~0 93)} is VALID [2022-04-28 14:10:36,878 INFO L284 TraceCheckUtils]: 90: Hoare quadruple {29135#true} {29853#(< ~counter~0 93)} #71#return; {29853#(< ~counter~0 93)} is VALID [2022-04-28 14:10:36,878 INFO L290 TraceCheckUtils]: 89: Hoare triple {29135#true} assume true; {29135#true} is VALID [2022-04-28 14:10:36,878 INFO L290 TraceCheckUtils]: 88: Hoare triple {29135#true} assume !(0 == ~cond); {29135#true} is VALID [2022-04-28 14:10:36,878 INFO L290 TraceCheckUtils]: 87: Hoare triple {29135#true} ~cond := #in~cond; {29135#true} is VALID [2022-04-28 14:10:36,878 INFO L272 TraceCheckUtils]: 86: Hoare triple {29853#(< ~counter~0 93)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {29135#true} is VALID [2022-04-28 14:10:36,878 INFO L290 TraceCheckUtils]: 85: Hoare triple {29853#(< ~counter~0 93)} assume !!(#t~post6 < 100);havoc #t~post6; {29853#(< ~counter~0 93)} is VALID [2022-04-28 14:10:36,879 INFO L290 TraceCheckUtils]: 84: Hoare triple {29881#(< ~counter~0 92)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {29853#(< ~counter~0 93)} is VALID [2022-04-28 14:10:36,879 INFO L290 TraceCheckUtils]: 83: Hoare triple {29881#(< ~counter~0 92)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {29881#(< ~counter~0 92)} is VALID [2022-04-28 14:10:36,879 INFO L290 TraceCheckUtils]: 82: Hoare triple {29881#(< ~counter~0 92)} assume !!(0 != ~a~0 && 0 != ~b~0); {29881#(< ~counter~0 92)} is VALID [2022-04-28 14:10:36,880 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {29135#true} {29881#(< ~counter~0 92)} #71#return; {29881#(< ~counter~0 92)} is VALID [2022-04-28 14:10:36,880 INFO L290 TraceCheckUtils]: 80: Hoare triple {29135#true} assume true; {29135#true} is VALID [2022-04-28 14:10:36,880 INFO L290 TraceCheckUtils]: 79: Hoare triple {29135#true} assume !(0 == ~cond); {29135#true} is VALID [2022-04-28 14:10:36,880 INFO L290 TraceCheckUtils]: 78: Hoare triple {29135#true} ~cond := #in~cond; {29135#true} is VALID [2022-04-28 14:10:36,880 INFO L272 TraceCheckUtils]: 77: Hoare triple {29881#(< ~counter~0 92)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {29135#true} is VALID [2022-04-28 14:10:36,880 INFO L290 TraceCheckUtils]: 76: Hoare triple {29881#(< ~counter~0 92)} assume !!(#t~post6 < 100);havoc #t~post6; {29881#(< ~counter~0 92)} is VALID [2022-04-28 14:10:36,881 INFO L290 TraceCheckUtils]: 75: Hoare triple {29909#(< ~counter~0 91)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {29881#(< ~counter~0 92)} is VALID [2022-04-28 14:10:36,881 INFO L290 TraceCheckUtils]: 74: Hoare triple {29909#(< ~counter~0 91)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {29909#(< ~counter~0 91)} is VALID [2022-04-28 14:10:36,881 INFO L290 TraceCheckUtils]: 73: Hoare triple {29909#(< ~counter~0 91)} assume !!(0 != ~a~0 && 0 != ~b~0); {29909#(< ~counter~0 91)} is VALID [2022-04-28 14:10:36,882 INFO L284 TraceCheckUtils]: 72: Hoare quadruple {29135#true} {29909#(< ~counter~0 91)} #71#return; {29909#(< ~counter~0 91)} is VALID [2022-04-28 14:10:36,882 INFO L290 TraceCheckUtils]: 71: Hoare triple {29135#true} assume true; {29135#true} is VALID [2022-04-28 14:10:36,882 INFO L290 TraceCheckUtils]: 70: Hoare triple {29135#true} assume !(0 == ~cond); {29135#true} is VALID [2022-04-28 14:10:36,882 INFO L290 TraceCheckUtils]: 69: Hoare triple {29135#true} ~cond := #in~cond; {29135#true} is VALID [2022-04-28 14:10:36,882 INFO L272 TraceCheckUtils]: 68: Hoare triple {29909#(< ~counter~0 91)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {29135#true} is VALID [2022-04-28 14:10:36,882 INFO L290 TraceCheckUtils]: 67: Hoare triple {29909#(< ~counter~0 91)} assume !!(#t~post6 < 100);havoc #t~post6; {29909#(< ~counter~0 91)} is VALID [2022-04-28 14:10:36,883 INFO L290 TraceCheckUtils]: 66: Hoare triple {29937#(< ~counter~0 90)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {29909#(< ~counter~0 91)} is VALID [2022-04-28 14:10:36,883 INFO L290 TraceCheckUtils]: 65: Hoare triple {29937#(< ~counter~0 90)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {29937#(< ~counter~0 90)} is VALID [2022-04-28 14:10:36,883 INFO L290 TraceCheckUtils]: 64: Hoare triple {29937#(< ~counter~0 90)} assume !!(0 != ~a~0 && 0 != ~b~0); {29937#(< ~counter~0 90)} is VALID [2022-04-28 14:10:36,884 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {29135#true} {29937#(< ~counter~0 90)} #71#return; {29937#(< ~counter~0 90)} is VALID [2022-04-28 14:10:36,884 INFO L290 TraceCheckUtils]: 62: Hoare triple {29135#true} assume true; {29135#true} is VALID [2022-04-28 14:10:36,884 INFO L290 TraceCheckUtils]: 61: Hoare triple {29135#true} assume !(0 == ~cond); {29135#true} is VALID [2022-04-28 14:10:36,884 INFO L290 TraceCheckUtils]: 60: Hoare triple {29135#true} ~cond := #in~cond; {29135#true} is VALID [2022-04-28 14:10:36,884 INFO L272 TraceCheckUtils]: 59: Hoare triple {29937#(< ~counter~0 90)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {29135#true} is VALID [2022-04-28 14:10:36,884 INFO L290 TraceCheckUtils]: 58: Hoare triple {29937#(< ~counter~0 90)} assume !!(#t~post6 < 100);havoc #t~post6; {29937#(< ~counter~0 90)} is VALID [2022-04-28 14:10:36,885 INFO L290 TraceCheckUtils]: 57: Hoare triple {29965#(< ~counter~0 89)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {29937#(< ~counter~0 90)} is VALID [2022-04-28 14:10:36,885 INFO L290 TraceCheckUtils]: 56: Hoare triple {29965#(< ~counter~0 89)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {29965#(< ~counter~0 89)} is VALID [2022-04-28 14:10:36,885 INFO L290 TraceCheckUtils]: 55: Hoare triple {29965#(< ~counter~0 89)} assume !!(0 != ~a~0 && 0 != ~b~0); {29965#(< ~counter~0 89)} is VALID [2022-04-28 14:10:36,886 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {29135#true} {29965#(< ~counter~0 89)} #71#return; {29965#(< ~counter~0 89)} is VALID [2022-04-28 14:10:36,886 INFO L290 TraceCheckUtils]: 53: Hoare triple {29135#true} assume true; {29135#true} is VALID [2022-04-28 14:10:36,886 INFO L290 TraceCheckUtils]: 52: Hoare triple {29135#true} assume !(0 == ~cond); {29135#true} is VALID [2022-04-28 14:10:36,886 INFO L290 TraceCheckUtils]: 51: Hoare triple {29135#true} ~cond := #in~cond; {29135#true} is VALID [2022-04-28 14:10:36,886 INFO L272 TraceCheckUtils]: 50: Hoare triple {29965#(< ~counter~0 89)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {29135#true} is VALID [2022-04-28 14:10:36,886 INFO L290 TraceCheckUtils]: 49: Hoare triple {29965#(< ~counter~0 89)} assume !!(#t~post6 < 100);havoc #t~post6; {29965#(< ~counter~0 89)} is VALID [2022-04-28 14:10:36,887 INFO L290 TraceCheckUtils]: 48: Hoare triple {29993#(< ~counter~0 88)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {29965#(< ~counter~0 89)} is VALID [2022-04-28 14:10:36,887 INFO L290 TraceCheckUtils]: 47: Hoare triple {29993#(< ~counter~0 88)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {29993#(< ~counter~0 88)} is VALID [2022-04-28 14:10:36,887 INFO L290 TraceCheckUtils]: 46: Hoare triple {29993#(< ~counter~0 88)} assume !!(0 != ~a~0 && 0 != ~b~0); {29993#(< ~counter~0 88)} is VALID [2022-04-28 14:10:36,888 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {29135#true} {29993#(< ~counter~0 88)} #71#return; {29993#(< ~counter~0 88)} is VALID [2022-04-28 14:10:36,888 INFO L290 TraceCheckUtils]: 44: Hoare triple {29135#true} assume true; {29135#true} is VALID [2022-04-28 14:10:36,888 INFO L290 TraceCheckUtils]: 43: Hoare triple {29135#true} assume !(0 == ~cond); {29135#true} is VALID [2022-04-28 14:10:36,888 INFO L290 TraceCheckUtils]: 42: Hoare triple {29135#true} ~cond := #in~cond; {29135#true} is VALID [2022-04-28 14:10:36,888 INFO L272 TraceCheckUtils]: 41: Hoare triple {29993#(< ~counter~0 88)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {29135#true} is VALID [2022-04-28 14:10:36,888 INFO L290 TraceCheckUtils]: 40: Hoare triple {29993#(< ~counter~0 88)} assume !!(#t~post6 < 100);havoc #t~post6; {29993#(< ~counter~0 88)} is VALID [2022-04-28 14:10:36,889 INFO L290 TraceCheckUtils]: 39: Hoare triple {30021#(< ~counter~0 87)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {29993#(< ~counter~0 88)} is VALID [2022-04-28 14:10:36,889 INFO L290 TraceCheckUtils]: 38: Hoare triple {30021#(< ~counter~0 87)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {30021#(< ~counter~0 87)} is VALID [2022-04-28 14:10:36,889 INFO L290 TraceCheckUtils]: 37: Hoare triple {30021#(< ~counter~0 87)} assume !!(0 != ~a~0 && 0 != ~b~0); {30021#(< ~counter~0 87)} is VALID [2022-04-28 14:10:36,890 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {29135#true} {30021#(< ~counter~0 87)} #71#return; {30021#(< ~counter~0 87)} is VALID [2022-04-28 14:10:36,890 INFO L290 TraceCheckUtils]: 35: Hoare triple {29135#true} assume true; {29135#true} is VALID [2022-04-28 14:10:36,890 INFO L290 TraceCheckUtils]: 34: Hoare triple {29135#true} assume !(0 == ~cond); {29135#true} is VALID [2022-04-28 14:10:36,890 INFO L290 TraceCheckUtils]: 33: Hoare triple {29135#true} ~cond := #in~cond; {29135#true} is VALID [2022-04-28 14:10:36,890 INFO L272 TraceCheckUtils]: 32: Hoare triple {30021#(< ~counter~0 87)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {29135#true} is VALID [2022-04-28 14:10:36,890 INFO L290 TraceCheckUtils]: 31: Hoare triple {30021#(< ~counter~0 87)} assume !!(#t~post6 < 100);havoc #t~post6; {30021#(< ~counter~0 87)} is VALID [2022-04-28 14:10:36,891 INFO L290 TraceCheckUtils]: 30: Hoare triple {30049#(< ~counter~0 86)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {30021#(< ~counter~0 87)} is VALID [2022-04-28 14:10:36,891 INFO L290 TraceCheckUtils]: 29: Hoare triple {30049#(< ~counter~0 86)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {30049#(< ~counter~0 86)} is VALID [2022-04-28 14:10:36,891 INFO L290 TraceCheckUtils]: 28: Hoare triple {30049#(< ~counter~0 86)} assume !!(0 != ~a~0 && 0 != ~b~0); {30049#(< ~counter~0 86)} is VALID [2022-04-28 14:10:36,892 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {29135#true} {30049#(< ~counter~0 86)} #71#return; {30049#(< ~counter~0 86)} is VALID [2022-04-28 14:10:36,892 INFO L290 TraceCheckUtils]: 26: Hoare triple {29135#true} assume true; {29135#true} is VALID [2022-04-28 14:10:36,892 INFO L290 TraceCheckUtils]: 25: Hoare triple {29135#true} assume !(0 == ~cond); {29135#true} is VALID [2022-04-28 14:10:36,892 INFO L290 TraceCheckUtils]: 24: Hoare triple {29135#true} ~cond := #in~cond; {29135#true} is VALID [2022-04-28 14:10:36,892 INFO L272 TraceCheckUtils]: 23: Hoare triple {30049#(< ~counter~0 86)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {29135#true} is VALID [2022-04-28 14:10:36,892 INFO L290 TraceCheckUtils]: 22: Hoare triple {30049#(< ~counter~0 86)} assume !!(#t~post6 < 100);havoc #t~post6; {30049#(< ~counter~0 86)} is VALID [2022-04-28 14:10:36,893 INFO L290 TraceCheckUtils]: 21: Hoare triple {30077#(< ~counter~0 85)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {30049#(< ~counter~0 86)} is VALID [2022-04-28 14:10:36,893 INFO L290 TraceCheckUtils]: 20: Hoare triple {30077#(< ~counter~0 85)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {30077#(< ~counter~0 85)} is VALID [2022-04-28 14:10:36,893 INFO L290 TraceCheckUtils]: 19: Hoare triple {30077#(< ~counter~0 85)} assume !!(0 != ~a~0 && 0 != ~b~0); {30077#(< ~counter~0 85)} is VALID [2022-04-28 14:10:36,894 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {29135#true} {30077#(< ~counter~0 85)} #71#return; {30077#(< ~counter~0 85)} is VALID [2022-04-28 14:10:36,894 INFO L290 TraceCheckUtils]: 17: Hoare triple {29135#true} assume true; {29135#true} is VALID [2022-04-28 14:10:36,894 INFO L290 TraceCheckUtils]: 16: Hoare triple {29135#true} assume !(0 == ~cond); {29135#true} is VALID [2022-04-28 14:10:36,894 INFO L290 TraceCheckUtils]: 15: Hoare triple {29135#true} ~cond := #in~cond; {29135#true} is VALID [2022-04-28 14:10:36,894 INFO L272 TraceCheckUtils]: 14: Hoare triple {30077#(< ~counter~0 85)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {29135#true} is VALID [2022-04-28 14:10:36,894 INFO L290 TraceCheckUtils]: 13: Hoare triple {30077#(< ~counter~0 85)} assume !!(#t~post6 < 100);havoc #t~post6; {30077#(< ~counter~0 85)} is VALID [2022-04-28 14:10:36,895 INFO L290 TraceCheckUtils]: 12: Hoare triple {30105#(< ~counter~0 84)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {30077#(< ~counter~0 85)} is VALID [2022-04-28 14:10:36,895 INFO L290 TraceCheckUtils]: 11: Hoare triple {30105#(< ~counter~0 84)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {30105#(< ~counter~0 84)} is VALID [2022-04-28 14:10:36,895 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {29135#true} {30105#(< ~counter~0 84)} #69#return; {30105#(< ~counter~0 84)} is VALID [2022-04-28 14:10:36,895 INFO L290 TraceCheckUtils]: 9: Hoare triple {29135#true} assume true; {29135#true} is VALID [2022-04-28 14:10:36,895 INFO L290 TraceCheckUtils]: 8: Hoare triple {29135#true} assume !(0 == ~cond); {29135#true} is VALID [2022-04-28 14:10:36,895 INFO L290 TraceCheckUtils]: 7: Hoare triple {29135#true} ~cond := #in~cond; {29135#true} is VALID [2022-04-28 14:10:36,896 INFO L272 TraceCheckUtils]: 6: Hoare triple {30105#(< ~counter~0 84)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {29135#true} is VALID [2022-04-28 14:10:36,896 INFO L290 TraceCheckUtils]: 5: Hoare triple {30105#(< ~counter~0 84)} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {30105#(< ~counter~0 84)} is VALID [2022-04-28 14:10:36,896 INFO L272 TraceCheckUtils]: 4: Hoare triple {30105#(< ~counter~0 84)} call #t~ret7 := main(); {30105#(< ~counter~0 84)} is VALID [2022-04-28 14:10:36,896 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {30105#(< ~counter~0 84)} {29135#true} #77#return; {30105#(< ~counter~0 84)} is VALID [2022-04-28 14:10:36,903 INFO L290 TraceCheckUtils]: 2: Hoare triple {30105#(< ~counter~0 84)} assume true; {30105#(< ~counter~0 84)} is VALID [2022-04-28 14:10:36,904 INFO L290 TraceCheckUtils]: 1: Hoare triple {29135#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(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {30105#(< ~counter~0 84)} is VALID [2022-04-28 14:10:36,904 INFO L272 TraceCheckUtils]: 0: Hoare triple {29135#true} call ULTIMATE.init(); {29135#true} is VALID [2022-04-28 14:10:36,905 INFO L134 CoverageAnalysis]: Checked inductivity of 1144 backedges. 32 proven. 632 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2022-04-28 14:10:36,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:10:36,905 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1759574834] [2022-04-28 14:10:36,905 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 14:10:36,905 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1355403990] [2022-04-28 14:10:36,905 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1355403990] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 14:10:36,905 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 14:10:36,905 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 38 [2022-04-28 14:10:36,905 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:10:36,906 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1081680568] [2022-04-28 14:10:36,906 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1081680568] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:10:36,906 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:10:36,906 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2022-04-28 14:10:36,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541780804] [2022-04-28 14:10:36,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:10:36,906 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 6.2) internal successors, (124), 19 states have internal predecessors, (124), 19 states have call successors, (20), 19 states have call predecessors, (20), 17 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) Word has length 162 [2022-04-28 14:10:36,907 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:10:36,907 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 20 states, 20 states have (on average 6.2) internal successors, (124), 19 states have internal predecessors, (124), 19 states have call successors, (20), 19 states have call predecessors, (20), 17 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-28 14:10:37,028 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 162 edges. 162 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:10:37,029 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-04-28 14:10:37,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:10:37,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-04-28 14:10:37,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=635, Invalid=771, Unknown=0, NotChecked=0, Total=1406 [2022-04-28 14:10:37,030 INFO L87 Difference]: Start difference. First operand 208 states and 258 transitions. Second operand has 20 states, 20 states have (on average 6.2) internal successors, (124), 19 states have internal predecessors, (124), 19 states have call successors, (20), 19 states have call predecessors, (20), 17 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-28 14:10:38,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:10:38,072 INFO L93 Difference]: Finished difference Result 227 states and 281 transitions. [2022-04-28 14:10:38,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-04-28 14:10:38,073 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 6.2) internal successors, (124), 19 states have internal predecessors, (124), 19 states have call successors, (20), 19 states have call predecessors, (20), 17 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) Word has length 162 [2022-04-28 14:10:38,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:10:38,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 6.2) internal successors, (124), 19 states have internal predecessors, (124), 19 states have call successors, (20), 19 states have call predecessors, (20), 17 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-28 14:10:38,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 267 transitions. [2022-04-28 14:10:38,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 6.2) internal successors, (124), 19 states have internal predecessors, (124), 19 states have call successors, (20), 19 states have call predecessors, (20), 17 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-28 14:10:38,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 267 transitions. [2022-04-28 14:10:38,081 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 36 states and 267 transitions. [2022-04-28 14:10:38,365 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 267 edges. 267 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:10:38,369 INFO L225 Difference]: With dead ends: 227 [2022-04-28 14:10:38,369 INFO L226 Difference]: Without dead ends: 219 [2022-04-28 14:10:38,370 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 339 GetRequests, 287 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 169 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=1227, Invalid=1635, Unknown=0, NotChecked=0, Total=2862 [2022-04-28 14:10:38,371 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 252 mSDsluCounter, 232 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 252 SdHoareTripleChecker+Valid, 278 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 14:10:38,371 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [252 Valid, 278 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 14:10:38,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2022-04-28 14:10:38,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 219. [2022-04-28 14:10:38,758 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:10:38,758 INFO L82 GeneralOperation]: Start isEquivalent. First operand 219 states. Second operand has 219 states, 174 states have (on average 1.3103448275862069) internal successors, (228), 175 states have internal predecessors, (228), 23 states have call successors, (23), 22 states have call predecessors, (23), 21 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-28 14:10:38,758 INFO L74 IsIncluded]: Start isIncluded. First operand 219 states. Second operand has 219 states, 174 states have (on average 1.3103448275862069) internal successors, (228), 175 states have internal predecessors, (228), 23 states have call successors, (23), 22 states have call predecessors, (23), 21 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-28 14:10:38,758 INFO L87 Difference]: Start difference. First operand 219 states. Second operand has 219 states, 174 states have (on average 1.3103448275862069) internal successors, (228), 175 states have internal predecessors, (228), 23 states have call successors, (23), 22 states have call predecessors, (23), 21 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-28 14:10:38,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:10:38,761 INFO L93 Difference]: Finished difference Result 219 states and 272 transitions. [2022-04-28 14:10:38,761 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 272 transitions. [2022-04-28 14:10:38,761 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:10:38,761 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:10:38,761 INFO L74 IsIncluded]: Start isIncluded. First operand has 219 states, 174 states have (on average 1.3103448275862069) internal successors, (228), 175 states have internal predecessors, (228), 23 states have call successors, (23), 22 states have call predecessors, (23), 21 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) Second operand 219 states. [2022-04-28 14:10:38,761 INFO L87 Difference]: Start difference. First operand has 219 states, 174 states have (on average 1.3103448275862069) internal successors, (228), 175 states have internal predecessors, (228), 23 states have call successors, (23), 22 states have call predecessors, (23), 21 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) Second operand 219 states. [2022-04-28 14:10:38,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:10:38,765 INFO L93 Difference]: Finished difference Result 219 states and 272 transitions. [2022-04-28 14:10:38,765 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 272 transitions. [2022-04-28 14:10:38,765 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:10:38,765 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:10:38,765 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:10:38,765 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:10:38,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 174 states have (on average 1.3103448275862069) internal successors, (228), 175 states have internal predecessors, (228), 23 states have call successors, (23), 22 states have call predecessors, (23), 21 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-28 14:10:38,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 272 transitions. [2022-04-28 14:10:38,769 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 272 transitions. Word has length 162 [2022-04-28 14:10:38,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:10:38,770 INFO L495 AbstractCegarLoop]: Abstraction has 219 states and 272 transitions. [2022-04-28 14:10:38,770 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 6.2) internal successors, (124), 19 states have internal predecessors, (124), 19 states have call successors, (20), 19 states have call predecessors, (20), 17 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-28 14:10:38,770 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 219 states and 272 transitions. [2022-04-28 14:11:13,561 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 272 edges. 256 inductive. 0 not inductive. 16 times theorem prover too weak to decide inductivity. [2022-04-28 14:11:13,561 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 272 transitions. [2022-04-28 14:11:13,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2022-04-28 14:11:13,562 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:11:13,562 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 17, 17, 17, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 14:11:13,579 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Forceful destruction successful, exit code 0 [2022-04-28 14:11:13,763 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 14:11:13,763 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:11:13,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:11:13,763 INFO L85 PathProgramCache]: Analyzing trace with hash 1155770690, now seen corresponding path program 33 times [2022-04-28 14:11:13,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:11:13,763 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [826903948] [2022-04-28 14:11:19,815 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 14:11:19,815 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 14:11:19,815 INFO L85 PathProgramCache]: Analyzing trace with hash 1155770690, now seen corresponding path program 34 times [2022-04-28 14:11:19,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:11:19,815 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [294116852] [2022-04-28 14:11:19,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:11:19,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:11:19,847 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 14:11:19,847 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1456452869] [2022-04-28 14:11:19,847 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 14:11:19,847 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 14:11:19,847 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 14:11:19,851 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 14:11:19,856 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2022-04-28 14:11:20,005 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 14:11:20,006 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 14:11:20,008 INFO L263 TraceCheckSpWp]: Trace formula consists of 528 conjuncts, 39 conjunts are in the unsatisfiable core [2022-04-28 14:11:20,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:11:20,042 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 14:11:20,931 INFO L272 TraceCheckUtils]: 0: Hoare triple {31506#true} call ULTIMATE.init(); {31506#true} is VALID [2022-04-28 14:11:20,931 INFO L290 TraceCheckUtils]: 1: Hoare triple {31506#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(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {31514#(<= ~counter~0 0)} is VALID [2022-04-28 14:11:20,932 INFO L290 TraceCheckUtils]: 2: Hoare triple {31514#(<= ~counter~0 0)} assume true; {31514#(<= ~counter~0 0)} is VALID [2022-04-28 14:11:20,932 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {31514#(<= ~counter~0 0)} {31506#true} #77#return; {31514#(<= ~counter~0 0)} is VALID [2022-04-28 14:11:20,932 INFO L272 TraceCheckUtils]: 4: Hoare triple {31514#(<= ~counter~0 0)} call #t~ret7 := main(); {31514#(<= ~counter~0 0)} is VALID [2022-04-28 14:11:20,933 INFO L290 TraceCheckUtils]: 5: Hoare triple {31514#(<= ~counter~0 0)} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {31514#(<= ~counter~0 0)} is VALID [2022-04-28 14:11:20,933 INFO L272 TraceCheckUtils]: 6: Hoare triple {31514#(<= ~counter~0 0)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {31514#(<= ~counter~0 0)} is VALID [2022-04-28 14:11:20,933 INFO L290 TraceCheckUtils]: 7: Hoare triple {31514#(<= ~counter~0 0)} ~cond := #in~cond; {31514#(<= ~counter~0 0)} is VALID [2022-04-28 14:11:20,933 INFO L290 TraceCheckUtils]: 8: Hoare triple {31514#(<= ~counter~0 0)} assume !(0 == ~cond); {31514#(<= ~counter~0 0)} is VALID [2022-04-28 14:11:20,934 INFO L290 TraceCheckUtils]: 9: Hoare triple {31514#(<= ~counter~0 0)} assume true; {31514#(<= ~counter~0 0)} is VALID [2022-04-28 14:11:20,934 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {31514#(<= ~counter~0 0)} {31514#(<= ~counter~0 0)} #69#return; {31514#(<= ~counter~0 0)} is VALID [2022-04-28 14:11:20,934 INFO L290 TraceCheckUtils]: 11: Hoare triple {31514#(<= ~counter~0 0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {31514#(<= ~counter~0 0)} is VALID [2022-04-28 14:11:20,935 INFO L290 TraceCheckUtils]: 12: Hoare triple {31514#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {31548#(<= ~counter~0 1)} is VALID [2022-04-28 14:11:20,935 INFO L290 TraceCheckUtils]: 13: Hoare triple {31548#(<= ~counter~0 1)} assume !!(#t~post6 < 100);havoc #t~post6; {31548#(<= ~counter~0 1)} is VALID [2022-04-28 14:11:20,936 INFO L272 TraceCheckUtils]: 14: Hoare triple {31548#(<= ~counter~0 1)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {31548#(<= ~counter~0 1)} is VALID [2022-04-28 14:11:20,936 INFO L290 TraceCheckUtils]: 15: Hoare triple {31548#(<= ~counter~0 1)} ~cond := #in~cond; {31548#(<= ~counter~0 1)} is VALID [2022-04-28 14:11:20,936 INFO L290 TraceCheckUtils]: 16: Hoare triple {31548#(<= ~counter~0 1)} assume !(0 == ~cond); {31548#(<= ~counter~0 1)} is VALID [2022-04-28 14:11:20,937 INFO L290 TraceCheckUtils]: 17: Hoare triple {31548#(<= ~counter~0 1)} assume true; {31548#(<= ~counter~0 1)} is VALID [2022-04-28 14:11:20,937 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {31548#(<= ~counter~0 1)} {31548#(<= ~counter~0 1)} #71#return; {31548#(<= ~counter~0 1)} is VALID [2022-04-28 14:11:20,938 INFO L290 TraceCheckUtils]: 19: Hoare triple {31548#(<= ~counter~0 1)} assume !!(0 != ~a~0 && 0 != ~b~0); {31548#(<= ~counter~0 1)} is VALID [2022-04-28 14:11:20,938 INFO L290 TraceCheckUtils]: 20: Hoare triple {31548#(<= ~counter~0 1)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {31548#(<= ~counter~0 1)} is VALID [2022-04-28 14:11:20,938 INFO L290 TraceCheckUtils]: 21: Hoare triple {31548#(<= ~counter~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {31576#(<= ~counter~0 2)} is VALID [2022-04-28 14:11:20,939 INFO L290 TraceCheckUtils]: 22: Hoare triple {31576#(<= ~counter~0 2)} assume !!(#t~post6 < 100);havoc #t~post6; {31576#(<= ~counter~0 2)} is VALID [2022-04-28 14:11:20,939 INFO L272 TraceCheckUtils]: 23: Hoare triple {31576#(<= ~counter~0 2)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {31576#(<= ~counter~0 2)} is VALID [2022-04-28 14:11:20,939 INFO L290 TraceCheckUtils]: 24: Hoare triple {31576#(<= ~counter~0 2)} ~cond := #in~cond; {31576#(<= ~counter~0 2)} is VALID [2022-04-28 14:11:20,940 INFO L290 TraceCheckUtils]: 25: Hoare triple {31576#(<= ~counter~0 2)} assume !(0 == ~cond); {31576#(<= ~counter~0 2)} is VALID [2022-04-28 14:11:20,940 INFO L290 TraceCheckUtils]: 26: Hoare triple {31576#(<= ~counter~0 2)} assume true; {31576#(<= ~counter~0 2)} is VALID [2022-04-28 14:11:20,940 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {31576#(<= ~counter~0 2)} {31576#(<= ~counter~0 2)} #71#return; {31576#(<= ~counter~0 2)} is VALID [2022-04-28 14:11:20,941 INFO L290 TraceCheckUtils]: 28: Hoare triple {31576#(<= ~counter~0 2)} assume !!(0 != ~a~0 && 0 != ~b~0); {31576#(<= ~counter~0 2)} is VALID [2022-04-28 14:11:20,941 INFO L290 TraceCheckUtils]: 29: Hoare triple {31576#(<= ~counter~0 2)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {31576#(<= ~counter~0 2)} is VALID [2022-04-28 14:11:20,941 INFO L290 TraceCheckUtils]: 30: Hoare triple {31576#(<= ~counter~0 2)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {31604#(<= ~counter~0 3)} is VALID [2022-04-28 14:11:20,942 INFO L290 TraceCheckUtils]: 31: Hoare triple {31604#(<= ~counter~0 3)} assume !!(#t~post6 < 100);havoc #t~post6; {31604#(<= ~counter~0 3)} is VALID [2022-04-28 14:11:20,942 INFO L272 TraceCheckUtils]: 32: Hoare triple {31604#(<= ~counter~0 3)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {31604#(<= ~counter~0 3)} is VALID [2022-04-28 14:11:20,942 INFO L290 TraceCheckUtils]: 33: Hoare triple {31604#(<= ~counter~0 3)} ~cond := #in~cond; {31604#(<= ~counter~0 3)} is VALID [2022-04-28 14:11:20,943 INFO L290 TraceCheckUtils]: 34: Hoare triple {31604#(<= ~counter~0 3)} assume !(0 == ~cond); {31604#(<= ~counter~0 3)} is VALID [2022-04-28 14:11:20,943 INFO L290 TraceCheckUtils]: 35: Hoare triple {31604#(<= ~counter~0 3)} assume true; {31604#(<= ~counter~0 3)} is VALID [2022-04-28 14:11:20,943 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {31604#(<= ~counter~0 3)} {31604#(<= ~counter~0 3)} #71#return; {31604#(<= ~counter~0 3)} is VALID [2022-04-28 14:11:20,944 INFO L290 TraceCheckUtils]: 37: Hoare triple {31604#(<= ~counter~0 3)} assume !!(0 != ~a~0 && 0 != ~b~0); {31604#(<= ~counter~0 3)} is VALID [2022-04-28 14:11:20,944 INFO L290 TraceCheckUtils]: 38: Hoare triple {31604#(<= ~counter~0 3)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {31604#(<= ~counter~0 3)} is VALID [2022-04-28 14:11:20,944 INFO L290 TraceCheckUtils]: 39: Hoare triple {31604#(<= ~counter~0 3)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {31632#(<= ~counter~0 4)} is VALID [2022-04-28 14:11:20,945 INFO L290 TraceCheckUtils]: 40: Hoare triple {31632#(<= ~counter~0 4)} assume !!(#t~post6 < 100);havoc #t~post6; {31632#(<= ~counter~0 4)} is VALID [2022-04-28 14:11:20,945 INFO L272 TraceCheckUtils]: 41: Hoare triple {31632#(<= ~counter~0 4)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {31632#(<= ~counter~0 4)} is VALID [2022-04-28 14:11:20,946 INFO L290 TraceCheckUtils]: 42: Hoare triple {31632#(<= ~counter~0 4)} ~cond := #in~cond; {31632#(<= ~counter~0 4)} is VALID [2022-04-28 14:11:20,946 INFO L290 TraceCheckUtils]: 43: Hoare triple {31632#(<= ~counter~0 4)} assume !(0 == ~cond); {31632#(<= ~counter~0 4)} is VALID [2022-04-28 14:11:20,946 INFO L290 TraceCheckUtils]: 44: Hoare triple {31632#(<= ~counter~0 4)} assume true; {31632#(<= ~counter~0 4)} is VALID [2022-04-28 14:11:20,947 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {31632#(<= ~counter~0 4)} {31632#(<= ~counter~0 4)} #71#return; {31632#(<= ~counter~0 4)} is VALID [2022-04-28 14:11:20,947 INFO L290 TraceCheckUtils]: 46: Hoare triple {31632#(<= ~counter~0 4)} assume !!(0 != ~a~0 && 0 != ~b~0); {31632#(<= ~counter~0 4)} is VALID [2022-04-28 14:11:20,947 INFO L290 TraceCheckUtils]: 47: Hoare triple {31632#(<= ~counter~0 4)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {31632#(<= ~counter~0 4)} is VALID [2022-04-28 14:11:20,948 INFO L290 TraceCheckUtils]: 48: Hoare triple {31632#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {31660#(<= ~counter~0 5)} is VALID [2022-04-28 14:11:20,948 INFO L290 TraceCheckUtils]: 49: Hoare triple {31660#(<= ~counter~0 5)} assume !!(#t~post6 < 100);havoc #t~post6; {31660#(<= ~counter~0 5)} is VALID [2022-04-28 14:11:20,948 INFO L272 TraceCheckUtils]: 50: Hoare triple {31660#(<= ~counter~0 5)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {31660#(<= ~counter~0 5)} is VALID [2022-04-28 14:11:20,949 INFO L290 TraceCheckUtils]: 51: Hoare triple {31660#(<= ~counter~0 5)} ~cond := #in~cond; {31660#(<= ~counter~0 5)} is VALID [2022-04-28 14:11:20,949 INFO L290 TraceCheckUtils]: 52: Hoare triple {31660#(<= ~counter~0 5)} assume !(0 == ~cond); {31660#(<= ~counter~0 5)} is VALID [2022-04-28 14:11:20,949 INFO L290 TraceCheckUtils]: 53: Hoare triple {31660#(<= ~counter~0 5)} assume true; {31660#(<= ~counter~0 5)} is VALID [2022-04-28 14:11:20,950 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {31660#(<= ~counter~0 5)} {31660#(<= ~counter~0 5)} #71#return; {31660#(<= ~counter~0 5)} is VALID [2022-04-28 14:11:20,950 INFO L290 TraceCheckUtils]: 55: Hoare triple {31660#(<= ~counter~0 5)} assume !!(0 != ~a~0 && 0 != ~b~0); {31660#(<= ~counter~0 5)} is VALID [2022-04-28 14:11:20,950 INFO L290 TraceCheckUtils]: 56: Hoare triple {31660#(<= ~counter~0 5)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {31660#(<= ~counter~0 5)} is VALID [2022-04-28 14:11:20,951 INFO L290 TraceCheckUtils]: 57: Hoare triple {31660#(<= ~counter~0 5)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {31688#(<= ~counter~0 6)} is VALID [2022-04-28 14:11:20,951 INFO L290 TraceCheckUtils]: 58: Hoare triple {31688#(<= ~counter~0 6)} assume !!(#t~post6 < 100);havoc #t~post6; {31688#(<= ~counter~0 6)} is VALID [2022-04-28 14:11:20,951 INFO L272 TraceCheckUtils]: 59: Hoare triple {31688#(<= ~counter~0 6)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {31688#(<= ~counter~0 6)} is VALID [2022-04-28 14:11:20,952 INFO L290 TraceCheckUtils]: 60: Hoare triple {31688#(<= ~counter~0 6)} ~cond := #in~cond; {31688#(<= ~counter~0 6)} is VALID [2022-04-28 14:11:20,952 INFO L290 TraceCheckUtils]: 61: Hoare triple {31688#(<= ~counter~0 6)} assume !(0 == ~cond); {31688#(<= ~counter~0 6)} is VALID [2022-04-28 14:11:20,952 INFO L290 TraceCheckUtils]: 62: Hoare triple {31688#(<= ~counter~0 6)} assume true; {31688#(<= ~counter~0 6)} is VALID [2022-04-28 14:11:20,953 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {31688#(<= ~counter~0 6)} {31688#(<= ~counter~0 6)} #71#return; {31688#(<= ~counter~0 6)} is VALID [2022-04-28 14:11:20,953 INFO L290 TraceCheckUtils]: 64: Hoare triple {31688#(<= ~counter~0 6)} assume !!(0 != ~a~0 && 0 != ~b~0); {31688#(<= ~counter~0 6)} is VALID [2022-04-28 14:11:20,953 INFO L290 TraceCheckUtils]: 65: Hoare triple {31688#(<= ~counter~0 6)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {31688#(<= ~counter~0 6)} is VALID [2022-04-28 14:11:20,954 INFO L290 TraceCheckUtils]: 66: Hoare triple {31688#(<= ~counter~0 6)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {31716#(<= ~counter~0 7)} is VALID [2022-04-28 14:11:20,954 INFO L290 TraceCheckUtils]: 67: Hoare triple {31716#(<= ~counter~0 7)} assume !!(#t~post6 < 100);havoc #t~post6; {31716#(<= ~counter~0 7)} is VALID [2022-04-28 14:11:20,955 INFO L272 TraceCheckUtils]: 68: Hoare triple {31716#(<= ~counter~0 7)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {31716#(<= ~counter~0 7)} is VALID [2022-04-28 14:11:20,955 INFO L290 TraceCheckUtils]: 69: Hoare triple {31716#(<= ~counter~0 7)} ~cond := #in~cond; {31716#(<= ~counter~0 7)} is VALID [2022-04-28 14:11:20,955 INFO L290 TraceCheckUtils]: 70: Hoare triple {31716#(<= ~counter~0 7)} assume !(0 == ~cond); {31716#(<= ~counter~0 7)} is VALID [2022-04-28 14:11:20,955 INFO L290 TraceCheckUtils]: 71: Hoare triple {31716#(<= ~counter~0 7)} assume true; {31716#(<= ~counter~0 7)} is VALID [2022-04-28 14:11:20,956 INFO L284 TraceCheckUtils]: 72: Hoare quadruple {31716#(<= ~counter~0 7)} {31716#(<= ~counter~0 7)} #71#return; {31716#(<= ~counter~0 7)} is VALID [2022-04-28 14:11:20,956 INFO L290 TraceCheckUtils]: 73: Hoare triple {31716#(<= ~counter~0 7)} assume !!(0 != ~a~0 && 0 != ~b~0); {31716#(<= ~counter~0 7)} is VALID [2022-04-28 14:11:20,956 INFO L290 TraceCheckUtils]: 74: Hoare triple {31716#(<= ~counter~0 7)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {31716#(<= ~counter~0 7)} is VALID [2022-04-28 14:11:20,957 INFO L290 TraceCheckUtils]: 75: Hoare triple {31716#(<= ~counter~0 7)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {31744#(<= ~counter~0 8)} is VALID [2022-04-28 14:11:20,957 INFO L290 TraceCheckUtils]: 76: Hoare triple {31744#(<= ~counter~0 8)} assume !!(#t~post6 < 100);havoc #t~post6; {31744#(<= ~counter~0 8)} is VALID [2022-04-28 14:11:20,958 INFO L272 TraceCheckUtils]: 77: Hoare triple {31744#(<= ~counter~0 8)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {31744#(<= ~counter~0 8)} is VALID [2022-04-28 14:11:20,958 INFO L290 TraceCheckUtils]: 78: Hoare triple {31744#(<= ~counter~0 8)} ~cond := #in~cond; {31744#(<= ~counter~0 8)} is VALID [2022-04-28 14:11:20,958 INFO L290 TraceCheckUtils]: 79: Hoare triple {31744#(<= ~counter~0 8)} assume !(0 == ~cond); {31744#(<= ~counter~0 8)} is VALID [2022-04-28 14:11:20,958 INFO L290 TraceCheckUtils]: 80: Hoare triple {31744#(<= ~counter~0 8)} assume true; {31744#(<= ~counter~0 8)} is VALID [2022-04-28 14:11:20,959 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {31744#(<= ~counter~0 8)} {31744#(<= ~counter~0 8)} #71#return; {31744#(<= ~counter~0 8)} is VALID [2022-04-28 14:11:20,959 INFO L290 TraceCheckUtils]: 82: Hoare triple {31744#(<= ~counter~0 8)} assume !!(0 != ~a~0 && 0 != ~b~0); {31744#(<= ~counter~0 8)} is VALID [2022-04-28 14:11:20,960 INFO L290 TraceCheckUtils]: 83: Hoare triple {31744#(<= ~counter~0 8)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {31744#(<= ~counter~0 8)} is VALID [2022-04-28 14:11:20,960 INFO L290 TraceCheckUtils]: 84: Hoare triple {31744#(<= ~counter~0 8)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {31772#(<= ~counter~0 9)} is VALID [2022-04-28 14:11:20,960 INFO L290 TraceCheckUtils]: 85: Hoare triple {31772#(<= ~counter~0 9)} assume !!(#t~post6 < 100);havoc #t~post6; {31772#(<= ~counter~0 9)} is VALID [2022-04-28 14:11:20,961 INFO L272 TraceCheckUtils]: 86: Hoare triple {31772#(<= ~counter~0 9)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {31772#(<= ~counter~0 9)} is VALID [2022-04-28 14:11:20,961 INFO L290 TraceCheckUtils]: 87: Hoare triple {31772#(<= ~counter~0 9)} ~cond := #in~cond; {31772#(<= ~counter~0 9)} is VALID [2022-04-28 14:11:20,961 INFO L290 TraceCheckUtils]: 88: Hoare triple {31772#(<= ~counter~0 9)} assume !(0 == ~cond); {31772#(<= ~counter~0 9)} is VALID [2022-04-28 14:11:20,962 INFO L290 TraceCheckUtils]: 89: Hoare triple {31772#(<= ~counter~0 9)} assume true; {31772#(<= ~counter~0 9)} is VALID [2022-04-28 14:11:20,962 INFO L284 TraceCheckUtils]: 90: Hoare quadruple {31772#(<= ~counter~0 9)} {31772#(<= ~counter~0 9)} #71#return; {31772#(<= ~counter~0 9)} is VALID [2022-04-28 14:11:20,962 INFO L290 TraceCheckUtils]: 91: Hoare triple {31772#(<= ~counter~0 9)} assume !!(0 != ~a~0 && 0 != ~b~0); {31772#(<= ~counter~0 9)} is VALID [2022-04-28 14:11:20,963 INFO L290 TraceCheckUtils]: 92: Hoare triple {31772#(<= ~counter~0 9)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {31772#(<= ~counter~0 9)} is VALID [2022-04-28 14:11:20,963 INFO L290 TraceCheckUtils]: 93: Hoare triple {31772#(<= ~counter~0 9)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {31800#(<= ~counter~0 10)} is VALID [2022-04-28 14:11:20,963 INFO L290 TraceCheckUtils]: 94: Hoare triple {31800#(<= ~counter~0 10)} assume !!(#t~post6 < 100);havoc #t~post6; {31800#(<= ~counter~0 10)} is VALID [2022-04-28 14:11:20,964 INFO L272 TraceCheckUtils]: 95: Hoare triple {31800#(<= ~counter~0 10)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {31800#(<= ~counter~0 10)} is VALID [2022-04-28 14:11:20,964 INFO L290 TraceCheckUtils]: 96: Hoare triple {31800#(<= ~counter~0 10)} ~cond := #in~cond; {31800#(<= ~counter~0 10)} is VALID [2022-04-28 14:11:20,964 INFO L290 TraceCheckUtils]: 97: Hoare triple {31800#(<= ~counter~0 10)} assume !(0 == ~cond); {31800#(<= ~counter~0 10)} is VALID [2022-04-28 14:11:20,965 INFO L290 TraceCheckUtils]: 98: Hoare triple {31800#(<= ~counter~0 10)} assume true; {31800#(<= ~counter~0 10)} is VALID [2022-04-28 14:11:20,965 INFO L284 TraceCheckUtils]: 99: Hoare quadruple {31800#(<= ~counter~0 10)} {31800#(<= ~counter~0 10)} #71#return; {31800#(<= ~counter~0 10)} is VALID [2022-04-28 14:11:20,965 INFO L290 TraceCheckUtils]: 100: Hoare triple {31800#(<= ~counter~0 10)} assume !!(0 != ~a~0 && 0 != ~b~0); {31800#(<= ~counter~0 10)} is VALID [2022-04-28 14:11:20,966 INFO L290 TraceCheckUtils]: 101: Hoare triple {31800#(<= ~counter~0 10)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {31800#(<= ~counter~0 10)} is VALID [2022-04-28 14:11:20,966 INFO L290 TraceCheckUtils]: 102: Hoare triple {31800#(<= ~counter~0 10)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {31828#(<= ~counter~0 11)} is VALID [2022-04-28 14:11:20,966 INFO L290 TraceCheckUtils]: 103: Hoare triple {31828#(<= ~counter~0 11)} assume !!(#t~post6 < 100);havoc #t~post6; {31828#(<= ~counter~0 11)} is VALID [2022-04-28 14:11:20,967 INFO L272 TraceCheckUtils]: 104: Hoare triple {31828#(<= ~counter~0 11)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {31828#(<= ~counter~0 11)} is VALID [2022-04-28 14:11:20,967 INFO L290 TraceCheckUtils]: 105: Hoare triple {31828#(<= ~counter~0 11)} ~cond := #in~cond; {31828#(<= ~counter~0 11)} is VALID [2022-04-28 14:11:20,968 INFO L290 TraceCheckUtils]: 106: Hoare triple {31828#(<= ~counter~0 11)} assume !(0 == ~cond); {31828#(<= ~counter~0 11)} is VALID [2022-04-28 14:11:20,968 INFO L290 TraceCheckUtils]: 107: Hoare triple {31828#(<= ~counter~0 11)} assume true; {31828#(<= ~counter~0 11)} is VALID [2022-04-28 14:11:20,968 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {31828#(<= ~counter~0 11)} {31828#(<= ~counter~0 11)} #71#return; {31828#(<= ~counter~0 11)} is VALID [2022-04-28 14:11:20,969 INFO L290 TraceCheckUtils]: 109: Hoare triple {31828#(<= ~counter~0 11)} assume !!(0 != ~a~0 && 0 != ~b~0); {31828#(<= ~counter~0 11)} is VALID [2022-04-28 14:11:20,969 INFO L290 TraceCheckUtils]: 110: Hoare triple {31828#(<= ~counter~0 11)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {31828#(<= ~counter~0 11)} is VALID [2022-04-28 14:11:20,969 INFO L290 TraceCheckUtils]: 111: Hoare triple {31828#(<= ~counter~0 11)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {31856#(<= ~counter~0 12)} is VALID [2022-04-28 14:11:20,970 INFO L290 TraceCheckUtils]: 112: Hoare triple {31856#(<= ~counter~0 12)} assume !!(#t~post6 < 100);havoc #t~post6; {31856#(<= ~counter~0 12)} is VALID [2022-04-28 14:11:20,970 INFO L272 TraceCheckUtils]: 113: Hoare triple {31856#(<= ~counter~0 12)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {31856#(<= ~counter~0 12)} is VALID [2022-04-28 14:11:20,970 INFO L290 TraceCheckUtils]: 114: Hoare triple {31856#(<= ~counter~0 12)} ~cond := #in~cond; {31856#(<= ~counter~0 12)} is VALID [2022-04-28 14:11:20,971 INFO L290 TraceCheckUtils]: 115: Hoare triple {31856#(<= ~counter~0 12)} assume !(0 == ~cond); {31856#(<= ~counter~0 12)} is VALID [2022-04-28 14:11:20,971 INFO L290 TraceCheckUtils]: 116: Hoare triple {31856#(<= ~counter~0 12)} assume true; {31856#(<= ~counter~0 12)} is VALID [2022-04-28 14:11:20,971 INFO L284 TraceCheckUtils]: 117: Hoare quadruple {31856#(<= ~counter~0 12)} {31856#(<= ~counter~0 12)} #71#return; {31856#(<= ~counter~0 12)} is VALID [2022-04-28 14:11:20,972 INFO L290 TraceCheckUtils]: 118: Hoare triple {31856#(<= ~counter~0 12)} assume !!(0 != ~a~0 && 0 != ~b~0); {31856#(<= ~counter~0 12)} is VALID [2022-04-28 14:11:20,972 INFO L290 TraceCheckUtils]: 119: Hoare triple {31856#(<= ~counter~0 12)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {31856#(<= ~counter~0 12)} is VALID [2022-04-28 14:11:20,972 INFO L290 TraceCheckUtils]: 120: Hoare triple {31856#(<= ~counter~0 12)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {31884#(<= ~counter~0 13)} is VALID [2022-04-28 14:11:20,973 INFO L290 TraceCheckUtils]: 121: Hoare triple {31884#(<= ~counter~0 13)} assume !!(#t~post6 < 100);havoc #t~post6; {31884#(<= ~counter~0 13)} is VALID [2022-04-28 14:11:20,973 INFO L272 TraceCheckUtils]: 122: Hoare triple {31884#(<= ~counter~0 13)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {31884#(<= ~counter~0 13)} is VALID [2022-04-28 14:11:20,974 INFO L290 TraceCheckUtils]: 123: Hoare triple {31884#(<= ~counter~0 13)} ~cond := #in~cond; {31884#(<= ~counter~0 13)} is VALID [2022-04-28 14:11:20,974 INFO L290 TraceCheckUtils]: 124: Hoare triple {31884#(<= ~counter~0 13)} assume !(0 == ~cond); {31884#(<= ~counter~0 13)} is VALID [2022-04-28 14:11:20,974 INFO L290 TraceCheckUtils]: 125: Hoare triple {31884#(<= ~counter~0 13)} assume true; {31884#(<= ~counter~0 13)} is VALID [2022-04-28 14:11:20,975 INFO L284 TraceCheckUtils]: 126: Hoare quadruple {31884#(<= ~counter~0 13)} {31884#(<= ~counter~0 13)} #71#return; {31884#(<= ~counter~0 13)} is VALID [2022-04-28 14:11:20,975 INFO L290 TraceCheckUtils]: 127: Hoare triple {31884#(<= ~counter~0 13)} assume !!(0 != ~a~0 && 0 != ~b~0); {31884#(<= ~counter~0 13)} is VALID [2022-04-28 14:11:20,975 INFO L290 TraceCheckUtils]: 128: Hoare triple {31884#(<= ~counter~0 13)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {31884#(<= ~counter~0 13)} is VALID [2022-04-28 14:11:20,976 INFO L290 TraceCheckUtils]: 129: Hoare triple {31884#(<= ~counter~0 13)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {31912#(<= ~counter~0 14)} is VALID [2022-04-28 14:11:20,976 INFO L290 TraceCheckUtils]: 130: Hoare triple {31912#(<= ~counter~0 14)} assume !!(#t~post6 < 100);havoc #t~post6; {31912#(<= ~counter~0 14)} is VALID [2022-04-28 14:11:20,976 INFO L272 TraceCheckUtils]: 131: Hoare triple {31912#(<= ~counter~0 14)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {31912#(<= ~counter~0 14)} is VALID [2022-04-28 14:11:20,977 INFO L290 TraceCheckUtils]: 132: Hoare triple {31912#(<= ~counter~0 14)} ~cond := #in~cond; {31912#(<= ~counter~0 14)} is VALID [2022-04-28 14:11:20,977 INFO L290 TraceCheckUtils]: 133: Hoare triple {31912#(<= ~counter~0 14)} assume !(0 == ~cond); {31912#(<= ~counter~0 14)} is VALID [2022-04-28 14:11:20,977 INFO L290 TraceCheckUtils]: 134: Hoare triple {31912#(<= ~counter~0 14)} assume true; {31912#(<= ~counter~0 14)} is VALID [2022-04-28 14:11:20,978 INFO L284 TraceCheckUtils]: 135: Hoare quadruple {31912#(<= ~counter~0 14)} {31912#(<= ~counter~0 14)} #71#return; {31912#(<= ~counter~0 14)} is VALID [2022-04-28 14:11:20,978 INFO L290 TraceCheckUtils]: 136: Hoare triple {31912#(<= ~counter~0 14)} assume !!(0 != ~a~0 && 0 != ~b~0); {31912#(<= ~counter~0 14)} is VALID [2022-04-28 14:11:20,978 INFO L290 TraceCheckUtils]: 137: Hoare triple {31912#(<= ~counter~0 14)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {31912#(<= ~counter~0 14)} is VALID [2022-04-28 14:11:20,979 INFO L290 TraceCheckUtils]: 138: Hoare triple {31912#(<= ~counter~0 14)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {31940#(<= ~counter~0 15)} is VALID [2022-04-28 14:11:20,979 INFO L290 TraceCheckUtils]: 139: Hoare triple {31940#(<= ~counter~0 15)} assume !!(#t~post6 < 100);havoc #t~post6; {31940#(<= ~counter~0 15)} is VALID [2022-04-28 14:11:20,980 INFO L272 TraceCheckUtils]: 140: Hoare triple {31940#(<= ~counter~0 15)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {31940#(<= ~counter~0 15)} is VALID [2022-04-28 14:11:20,980 INFO L290 TraceCheckUtils]: 141: Hoare triple {31940#(<= ~counter~0 15)} ~cond := #in~cond; {31940#(<= ~counter~0 15)} is VALID [2022-04-28 14:11:20,980 INFO L290 TraceCheckUtils]: 142: Hoare triple {31940#(<= ~counter~0 15)} assume !(0 == ~cond); {31940#(<= ~counter~0 15)} is VALID [2022-04-28 14:11:20,980 INFO L290 TraceCheckUtils]: 143: Hoare triple {31940#(<= ~counter~0 15)} assume true; {31940#(<= ~counter~0 15)} is VALID [2022-04-28 14:11:20,981 INFO L284 TraceCheckUtils]: 144: Hoare quadruple {31940#(<= ~counter~0 15)} {31940#(<= ~counter~0 15)} #71#return; {31940#(<= ~counter~0 15)} is VALID [2022-04-28 14:11:20,981 INFO L290 TraceCheckUtils]: 145: Hoare triple {31940#(<= ~counter~0 15)} assume !!(0 != ~a~0 && 0 != ~b~0); {31940#(<= ~counter~0 15)} is VALID [2022-04-28 14:11:20,981 INFO L290 TraceCheckUtils]: 146: Hoare triple {31940#(<= ~counter~0 15)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {31940#(<= ~counter~0 15)} is VALID [2022-04-28 14:11:20,982 INFO L290 TraceCheckUtils]: 147: Hoare triple {31940#(<= ~counter~0 15)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {31968#(<= ~counter~0 16)} is VALID [2022-04-28 14:11:20,982 INFO L290 TraceCheckUtils]: 148: Hoare triple {31968#(<= ~counter~0 16)} assume !!(#t~post6 < 100);havoc #t~post6; {31968#(<= ~counter~0 16)} is VALID [2022-04-28 14:11:20,983 INFO L272 TraceCheckUtils]: 149: Hoare triple {31968#(<= ~counter~0 16)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {31968#(<= ~counter~0 16)} is VALID [2022-04-28 14:11:20,983 INFO L290 TraceCheckUtils]: 150: Hoare triple {31968#(<= ~counter~0 16)} ~cond := #in~cond; {31968#(<= ~counter~0 16)} is VALID [2022-04-28 14:11:20,983 INFO L290 TraceCheckUtils]: 151: Hoare triple {31968#(<= ~counter~0 16)} assume !(0 == ~cond); {31968#(<= ~counter~0 16)} is VALID [2022-04-28 14:11:20,983 INFO L290 TraceCheckUtils]: 152: Hoare triple {31968#(<= ~counter~0 16)} assume true; {31968#(<= ~counter~0 16)} is VALID [2022-04-28 14:11:20,984 INFO L284 TraceCheckUtils]: 153: Hoare quadruple {31968#(<= ~counter~0 16)} {31968#(<= ~counter~0 16)} #71#return; {31968#(<= ~counter~0 16)} is VALID [2022-04-28 14:11:20,984 INFO L290 TraceCheckUtils]: 154: Hoare triple {31968#(<= ~counter~0 16)} assume !!(0 != ~a~0 && 0 != ~b~0); {31968#(<= ~counter~0 16)} is VALID [2022-04-28 14:11:20,984 INFO L290 TraceCheckUtils]: 155: Hoare triple {31968#(<= ~counter~0 16)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {31968#(<= ~counter~0 16)} is VALID [2022-04-28 14:11:20,985 INFO L290 TraceCheckUtils]: 156: Hoare triple {31968#(<= ~counter~0 16)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {31996#(<= ~counter~0 17)} is VALID [2022-04-28 14:11:20,985 INFO L290 TraceCheckUtils]: 157: Hoare triple {31996#(<= ~counter~0 17)} assume !!(#t~post6 < 100);havoc #t~post6; {31996#(<= ~counter~0 17)} is VALID [2022-04-28 14:11:20,986 INFO L272 TraceCheckUtils]: 158: Hoare triple {31996#(<= ~counter~0 17)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {31996#(<= ~counter~0 17)} is VALID [2022-04-28 14:11:20,986 INFO L290 TraceCheckUtils]: 159: Hoare triple {31996#(<= ~counter~0 17)} ~cond := #in~cond; {31996#(<= ~counter~0 17)} is VALID [2022-04-28 14:11:20,986 INFO L290 TraceCheckUtils]: 160: Hoare triple {31996#(<= ~counter~0 17)} assume !(0 == ~cond); {31996#(<= ~counter~0 17)} is VALID [2022-04-28 14:11:20,987 INFO L290 TraceCheckUtils]: 161: Hoare triple {31996#(<= ~counter~0 17)} assume true; {31996#(<= ~counter~0 17)} is VALID [2022-04-28 14:11:20,987 INFO L284 TraceCheckUtils]: 162: Hoare quadruple {31996#(<= ~counter~0 17)} {31996#(<= ~counter~0 17)} #71#return; {31996#(<= ~counter~0 17)} is VALID [2022-04-28 14:11:20,987 INFO L290 TraceCheckUtils]: 163: Hoare triple {31996#(<= ~counter~0 17)} assume !!(0 != ~a~0 && 0 != ~b~0); {31996#(<= ~counter~0 17)} is VALID [2022-04-28 14:11:20,988 INFO L290 TraceCheckUtils]: 164: Hoare triple {31996#(<= ~counter~0 17)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {31996#(<= ~counter~0 17)} is VALID [2022-04-28 14:11:20,988 INFO L290 TraceCheckUtils]: 165: Hoare triple {31996#(<= ~counter~0 17)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {32024#(<= |main_#t~post6| 17)} is VALID [2022-04-28 14:11:20,988 INFO L290 TraceCheckUtils]: 166: Hoare triple {32024#(<= |main_#t~post6| 17)} assume !(#t~post6 < 100);havoc #t~post6; {31507#false} is VALID [2022-04-28 14:11:20,988 INFO L272 TraceCheckUtils]: 167: Hoare triple {31507#false} call __VERIFIER_assert((if ~q~0 == ~x~0 * ~y~0 then 1 else 0)); {31507#false} is VALID [2022-04-28 14:11:20,988 INFO L290 TraceCheckUtils]: 168: Hoare triple {31507#false} ~cond := #in~cond; {31507#false} is VALID [2022-04-28 14:11:20,988 INFO L290 TraceCheckUtils]: 169: Hoare triple {31507#false} assume 0 == ~cond; {31507#false} is VALID [2022-04-28 14:11:20,988 INFO L290 TraceCheckUtils]: 170: Hoare triple {31507#false} assume !false; {31507#false} is VALID [2022-04-28 14:11:20,989 INFO L134 CoverageAnalysis]: Checked inductivity of 1292 backedges. 34 proven. 1258 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 14:11:20,989 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 14:11:22,018 INFO L290 TraceCheckUtils]: 170: Hoare triple {31507#false} assume !false; {31507#false} is VALID [2022-04-28 14:11:22,018 INFO L290 TraceCheckUtils]: 169: Hoare triple {31507#false} assume 0 == ~cond; {31507#false} is VALID [2022-04-28 14:11:22,018 INFO L290 TraceCheckUtils]: 168: Hoare triple {31507#false} ~cond := #in~cond; {31507#false} is VALID [2022-04-28 14:11:22,018 INFO L272 TraceCheckUtils]: 167: Hoare triple {31507#false} call __VERIFIER_assert((if ~q~0 == ~x~0 * ~y~0 then 1 else 0)); {31507#false} is VALID [2022-04-28 14:11:22,018 INFO L290 TraceCheckUtils]: 166: Hoare triple {32052#(< |main_#t~post6| 100)} assume !(#t~post6 < 100);havoc #t~post6; {31507#false} is VALID [2022-04-28 14:11:22,019 INFO L290 TraceCheckUtils]: 165: Hoare triple {32056#(< ~counter~0 100)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {32052#(< |main_#t~post6| 100)} is VALID [2022-04-28 14:11:22,019 INFO L290 TraceCheckUtils]: 164: Hoare triple {32056#(< ~counter~0 100)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {32056#(< ~counter~0 100)} is VALID [2022-04-28 14:11:22,019 INFO L290 TraceCheckUtils]: 163: Hoare triple {32056#(< ~counter~0 100)} assume !!(0 != ~a~0 && 0 != ~b~0); {32056#(< ~counter~0 100)} is VALID [2022-04-28 14:11:22,020 INFO L284 TraceCheckUtils]: 162: Hoare quadruple {31506#true} {32056#(< ~counter~0 100)} #71#return; {32056#(< ~counter~0 100)} is VALID [2022-04-28 14:11:22,020 INFO L290 TraceCheckUtils]: 161: Hoare triple {31506#true} assume true; {31506#true} is VALID [2022-04-28 14:11:22,020 INFO L290 TraceCheckUtils]: 160: Hoare triple {31506#true} assume !(0 == ~cond); {31506#true} is VALID [2022-04-28 14:11:22,020 INFO L290 TraceCheckUtils]: 159: Hoare triple {31506#true} ~cond := #in~cond; {31506#true} is VALID [2022-04-28 14:11:22,020 INFO L272 TraceCheckUtils]: 158: Hoare triple {32056#(< ~counter~0 100)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {31506#true} is VALID [2022-04-28 14:11:22,020 INFO L290 TraceCheckUtils]: 157: Hoare triple {32056#(< ~counter~0 100)} assume !!(#t~post6 < 100);havoc #t~post6; {32056#(< ~counter~0 100)} is VALID [2022-04-28 14:11:22,021 INFO L290 TraceCheckUtils]: 156: Hoare triple {32084#(< ~counter~0 99)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {32056#(< ~counter~0 100)} is VALID [2022-04-28 14:11:22,021 INFO L290 TraceCheckUtils]: 155: Hoare triple {32084#(< ~counter~0 99)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {32084#(< ~counter~0 99)} is VALID [2022-04-28 14:11:22,022 INFO L290 TraceCheckUtils]: 154: Hoare triple {32084#(< ~counter~0 99)} assume !!(0 != ~a~0 && 0 != ~b~0); {32084#(< ~counter~0 99)} is VALID [2022-04-28 14:11:22,022 INFO L284 TraceCheckUtils]: 153: Hoare quadruple {31506#true} {32084#(< ~counter~0 99)} #71#return; {32084#(< ~counter~0 99)} is VALID [2022-04-28 14:11:22,022 INFO L290 TraceCheckUtils]: 152: Hoare triple {31506#true} assume true; {31506#true} is VALID [2022-04-28 14:11:22,022 INFO L290 TraceCheckUtils]: 151: Hoare triple {31506#true} assume !(0 == ~cond); {31506#true} is VALID [2022-04-28 14:11:22,022 INFO L290 TraceCheckUtils]: 150: Hoare triple {31506#true} ~cond := #in~cond; {31506#true} is VALID [2022-04-28 14:11:22,022 INFO L272 TraceCheckUtils]: 149: Hoare triple {32084#(< ~counter~0 99)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {31506#true} is VALID [2022-04-28 14:11:22,023 INFO L290 TraceCheckUtils]: 148: Hoare triple {32084#(< ~counter~0 99)} assume !!(#t~post6 < 100);havoc #t~post6; {32084#(< ~counter~0 99)} is VALID [2022-04-28 14:11:22,023 INFO L290 TraceCheckUtils]: 147: Hoare triple {32112#(< ~counter~0 98)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {32084#(< ~counter~0 99)} is VALID [2022-04-28 14:11:22,023 INFO L290 TraceCheckUtils]: 146: Hoare triple {32112#(< ~counter~0 98)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {32112#(< ~counter~0 98)} is VALID [2022-04-28 14:11:22,024 INFO L290 TraceCheckUtils]: 145: Hoare triple {32112#(< ~counter~0 98)} assume !!(0 != ~a~0 && 0 != ~b~0); {32112#(< ~counter~0 98)} is VALID [2022-04-28 14:11:22,024 INFO L284 TraceCheckUtils]: 144: Hoare quadruple {31506#true} {32112#(< ~counter~0 98)} #71#return; {32112#(< ~counter~0 98)} is VALID [2022-04-28 14:11:22,024 INFO L290 TraceCheckUtils]: 143: Hoare triple {31506#true} assume true; {31506#true} is VALID [2022-04-28 14:11:22,024 INFO L290 TraceCheckUtils]: 142: Hoare triple {31506#true} assume !(0 == ~cond); {31506#true} is VALID [2022-04-28 14:11:22,024 INFO L290 TraceCheckUtils]: 141: Hoare triple {31506#true} ~cond := #in~cond; {31506#true} is VALID [2022-04-28 14:11:22,024 INFO L272 TraceCheckUtils]: 140: Hoare triple {32112#(< ~counter~0 98)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {31506#true} is VALID [2022-04-28 14:11:22,024 INFO L290 TraceCheckUtils]: 139: Hoare triple {32112#(< ~counter~0 98)} assume !!(#t~post6 < 100);havoc #t~post6; {32112#(< ~counter~0 98)} is VALID [2022-04-28 14:11:22,025 INFO L290 TraceCheckUtils]: 138: Hoare triple {32140#(< ~counter~0 97)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {32112#(< ~counter~0 98)} is VALID [2022-04-28 14:11:22,025 INFO L290 TraceCheckUtils]: 137: Hoare triple {32140#(< ~counter~0 97)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {32140#(< ~counter~0 97)} is VALID [2022-04-28 14:11:22,025 INFO L290 TraceCheckUtils]: 136: Hoare triple {32140#(< ~counter~0 97)} assume !!(0 != ~a~0 && 0 != ~b~0); {32140#(< ~counter~0 97)} is VALID [2022-04-28 14:11:22,026 INFO L284 TraceCheckUtils]: 135: Hoare quadruple {31506#true} {32140#(< ~counter~0 97)} #71#return; {32140#(< ~counter~0 97)} is VALID [2022-04-28 14:11:22,026 INFO L290 TraceCheckUtils]: 134: Hoare triple {31506#true} assume true; {31506#true} is VALID [2022-04-28 14:11:22,026 INFO L290 TraceCheckUtils]: 133: Hoare triple {31506#true} assume !(0 == ~cond); {31506#true} is VALID [2022-04-28 14:11:22,026 INFO L290 TraceCheckUtils]: 132: Hoare triple {31506#true} ~cond := #in~cond; {31506#true} is VALID [2022-04-28 14:11:22,026 INFO L272 TraceCheckUtils]: 131: Hoare triple {32140#(< ~counter~0 97)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {31506#true} is VALID [2022-04-28 14:11:22,026 INFO L290 TraceCheckUtils]: 130: Hoare triple {32140#(< ~counter~0 97)} assume !!(#t~post6 < 100);havoc #t~post6; {32140#(< ~counter~0 97)} is VALID [2022-04-28 14:11:22,027 INFO L290 TraceCheckUtils]: 129: Hoare triple {32168#(< ~counter~0 96)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {32140#(< ~counter~0 97)} is VALID [2022-04-28 14:11:22,027 INFO L290 TraceCheckUtils]: 128: Hoare triple {32168#(< ~counter~0 96)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {32168#(< ~counter~0 96)} is VALID [2022-04-28 14:11:22,027 INFO L290 TraceCheckUtils]: 127: Hoare triple {32168#(< ~counter~0 96)} assume !!(0 != ~a~0 && 0 != ~b~0); {32168#(< ~counter~0 96)} is VALID [2022-04-28 14:11:22,028 INFO L284 TraceCheckUtils]: 126: Hoare quadruple {31506#true} {32168#(< ~counter~0 96)} #71#return; {32168#(< ~counter~0 96)} is VALID [2022-04-28 14:11:22,028 INFO L290 TraceCheckUtils]: 125: Hoare triple {31506#true} assume true; {31506#true} is VALID [2022-04-28 14:11:22,028 INFO L290 TraceCheckUtils]: 124: Hoare triple {31506#true} assume !(0 == ~cond); {31506#true} is VALID [2022-04-28 14:11:22,028 INFO L290 TraceCheckUtils]: 123: Hoare triple {31506#true} ~cond := #in~cond; {31506#true} is VALID [2022-04-28 14:11:22,028 INFO L272 TraceCheckUtils]: 122: Hoare triple {32168#(< ~counter~0 96)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {31506#true} is VALID [2022-04-28 14:11:22,028 INFO L290 TraceCheckUtils]: 121: Hoare triple {32168#(< ~counter~0 96)} assume !!(#t~post6 < 100);havoc #t~post6; {32168#(< ~counter~0 96)} is VALID [2022-04-28 14:11:22,029 INFO L290 TraceCheckUtils]: 120: Hoare triple {32196#(< ~counter~0 95)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {32168#(< ~counter~0 96)} is VALID [2022-04-28 14:11:22,029 INFO L290 TraceCheckUtils]: 119: Hoare triple {32196#(< ~counter~0 95)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {32196#(< ~counter~0 95)} is VALID [2022-04-28 14:11:22,029 INFO L290 TraceCheckUtils]: 118: Hoare triple {32196#(< ~counter~0 95)} assume !!(0 != ~a~0 && 0 != ~b~0); {32196#(< ~counter~0 95)} is VALID [2022-04-28 14:11:22,030 INFO L284 TraceCheckUtils]: 117: Hoare quadruple {31506#true} {32196#(< ~counter~0 95)} #71#return; {32196#(< ~counter~0 95)} is VALID [2022-04-28 14:11:22,030 INFO L290 TraceCheckUtils]: 116: Hoare triple {31506#true} assume true; {31506#true} is VALID [2022-04-28 14:11:22,030 INFO L290 TraceCheckUtils]: 115: Hoare triple {31506#true} assume !(0 == ~cond); {31506#true} is VALID [2022-04-28 14:11:22,030 INFO L290 TraceCheckUtils]: 114: Hoare triple {31506#true} ~cond := #in~cond; {31506#true} is VALID [2022-04-28 14:11:22,030 INFO L272 TraceCheckUtils]: 113: Hoare triple {32196#(< ~counter~0 95)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {31506#true} is VALID [2022-04-28 14:11:22,030 INFO L290 TraceCheckUtils]: 112: Hoare triple {32196#(< ~counter~0 95)} assume !!(#t~post6 < 100);havoc #t~post6; {32196#(< ~counter~0 95)} is VALID [2022-04-28 14:11:22,031 INFO L290 TraceCheckUtils]: 111: Hoare triple {32224#(< ~counter~0 94)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {32196#(< ~counter~0 95)} is VALID [2022-04-28 14:11:22,031 INFO L290 TraceCheckUtils]: 110: Hoare triple {32224#(< ~counter~0 94)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {32224#(< ~counter~0 94)} is VALID [2022-04-28 14:11:22,031 INFO L290 TraceCheckUtils]: 109: Hoare triple {32224#(< ~counter~0 94)} assume !!(0 != ~a~0 && 0 != ~b~0); {32224#(< ~counter~0 94)} is VALID [2022-04-28 14:11:22,032 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {31506#true} {32224#(< ~counter~0 94)} #71#return; {32224#(< ~counter~0 94)} is VALID [2022-04-28 14:11:22,032 INFO L290 TraceCheckUtils]: 107: Hoare triple {31506#true} assume true; {31506#true} is VALID [2022-04-28 14:11:22,032 INFO L290 TraceCheckUtils]: 106: Hoare triple {31506#true} assume !(0 == ~cond); {31506#true} is VALID [2022-04-28 14:11:22,032 INFO L290 TraceCheckUtils]: 105: Hoare triple {31506#true} ~cond := #in~cond; {31506#true} is VALID [2022-04-28 14:11:22,032 INFO L272 TraceCheckUtils]: 104: Hoare triple {32224#(< ~counter~0 94)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {31506#true} is VALID [2022-04-28 14:11:22,032 INFO L290 TraceCheckUtils]: 103: Hoare triple {32224#(< ~counter~0 94)} assume !!(#t~post6 < 100);havoc #t~post6; {32224#(< ~counter~0 94)} is VALID [2022-04-28 14:11:22,033 INFO L290 TraceCheckUtils]: 102: Hoare triple {32252#(< ~counter~0 93)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {32224#(< ~counter~0 94)} is VALID [2022-04-28 14:11:22,033 INFO L290 TraceCheckUtils]: 101: Hoare triple {32252#(< ~counter~0 93)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {32252#(< ~counter~0 93)} is VALID [2022-04-28 14:11:22,033 INFO L290 TraceCheckUtils]: 100: Hoare triple {32252#(< ~counter~0 93)} assume !!(0 != ~a~0 && 0 != ~b~0); {32252#(< ~counter~0 93)} is VALID [2022-04-28 14:11:22,034 INFO L284 TraceCheckUtils]: 99: Hoare quadruple {31506#true} {32252#(< ~counter~0 93)} #71#return; {32252#(< ~counter~0 93)} is VALID [2022-04-28 14:11:22,034 INFO L290 TraceCheckUtils]: 98: Hoare triple {31506#true} assume true; {31506#true} is VALID [2022-04-28 14:11:22,034 INFO L290 TraceCheckUtils]: 97: Hoare triple {31506#true} assume !(0 == ~cond); {31506#true} is VALID [2022-04-28 14:11:22,034 INFO L290 TraceCheckUtils]: 96: Hoare triple {31506#true} ~cond := #in~cond; {31506#true} is VALID [2022-04-28 14:11:22,034 INFO L272 TraceCheckUtils]: 95: Hoare triple {32252#(< ~counter~0 93)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {31506#true} is VALID [2022-04-28 14:11:22,034 INFO L290 TraceCheckUtils]: 94: Hoare triple {32252#(< ~counter~0 93)} assume !!(#t~post6 < 100);havoc #t~post6; {32252#(< ~counter~0 93)} is VALID [2022-04-28 14:11:22,035 INFO L290 TraceCheckUtils]: 93: Hoare triple {32280#(< ~counter~0 92)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {32252#(< ~counter~0 93)} is VALID [2022-04-28 14:11:22,035 INFO L290 TraceCheckUtils]: 92: Hoare triple {32280#(< ~counter~0 92)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {32280#(< ~counter~0 92)} is VALID [2022-04-28 14:11:22,035 INFO L290 TraceCheckUtils]: 91: Hoare triple {32280#(< ~counter~0 92)} assume !!(0 != ~a~0 && 0 != ~b~0); {32280#(< ~counter~0 92)} is VALID [2022-04-28 14:11:22,036 INFO L284 TraceCheckUtils]: 90: Hoare quadruple {31506#true} {32280#(< ~counter~0 92)} #71#return; {32280#(< ~counter~0 92)} is VALID [2022-04-28 14:11:22,036 INFO L290 TraceCheckUtils]: 89: Hoare triple {31506#true} assume true; {31506#true} is VALID [2022-04-28 14:11:22,036 INFO L290 TraceCheckUtils]: 88: Hoare triple {31506#true} assume !(0 == ~cond); {31506#true} is VALID [2022-04-28 14:11:22,036 INFO L290 TraceCheckUtils]: 87: Hoare triple {31506#true} ~cond := #in~cond; {31506#true} is VALID [2022-04-28 14:11:22,036 INFO L272 TraceCheckUtils]: 86: Hoare triple {32280#(< ~counter~0 92)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {31506#true} is VALID [2022-04-28 14:11:22,036 INFO L290 TraceCheckUtils]: 85: Hoare triple {32280#(< ~counter~0 92)} assume !!(#t~post6 < 100);havoc #t~post6; {32280#(< ~counter~0 92)} is VALID [2022-04-28 14:11:22,037 INFO L290 TraceCheckUtils]: 84: Hoare triple {32308#(< ~counter~0 91)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {32280#(< ~counter~0 92)} is VALID [2022-04-28 14:11:22,037 INFO L290 TraceCheckUtils]: 83: Hoare triple {32308#(< ~counter~0 91)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {32308#(< ~counter~0 91)} is VALID [2022-04-28 14:11:22,037 INFO L290 TraceCheckUtils]: 82: Hoare triple {32308#(< ~counter~0 91)} assume !!(0 != ~a~0 && 0 != ~b~0); {32308#(< ~counter~0 91)} is VALID [2022-04-28 14:11:22,038 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {31506#true} {32308#(< ~counter~0 91)} #71#return; {32308#(< ~counter~0 91)} is VALID [2022-04-28 14:11:22,038 INFO L290 TraceCheckUtils]: 80: Hoare triple {31506#true} assume true; {31506#true} is VALID [2022-04-28 14:11:22,038 INFO L290 TraceCheckUtils]: 79: Hoare triple {31506#true} assume !(0 == ~cond); {31506#true} is VALID [2022-04-28 14:11:22,038 INFO L290 TraceCheckUtils]: 78: Hoare triple {31506#true} ~cond := #in~cond; {31506#true} is VALID [2022-04-28 14:11:22,038 INFO L272 TraceCheckUtils]: 77: Hoare triple {32308#(< ~counter~0 91)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {31506#true} is VALID [2022-04-28 14:11:22,038 INFO L290 TraceCheckUtils]: 76: Hoare triple {32308#(< ~counter~0 91)} assume !!(#t~post6 < 100);havoc #t~post6; {32308#(< ~counter~0 91)} is VALID [2022-04-28 14:11:22,039 INFO L290 TraceCheckUtils]: 75: Hoare triple {32336#(< ~counter~0 90)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {32308#(< ~counter~0 91)} is VALID [2022-04-28 14:11:22,039 INFO L290 TraceCheckUtils]: 74: Hoare triple {32336#(< ~counter~0 90)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {32336#(< ~counter~0 90)} is VALID [2022-04-28 14:11:22,039 INFO L290 TraceCheckUtils]: 73: Hoare triple {32336#(< ~counter~0 90)} assume !!(0 != ~a~0 && 0 != ~b~0); {32336#(< ~counter~0 90)} is VALID [2022-04-28 14:11:22,040 INFO L284 TraceCheckUtils]: 72: Hoare quadruple {31506#true} {32336#(< ~counter~0 90)} #71#return; {32336#(< ~counter~0 90)} is VALID [2022-04-28 14:11:22,040 INFO L290 TraceCheckUtils]: 71: Hoare triple {31506#true} assume true; {31506#true} is VALID [2022-04-28 14:11:22,040 INFO L290 TraceCheckUtils]: 70: Hoare triple {31506#true} assume !(0 == ~cond); {31506#true} is VALID [2022-04-28 14:11:22,040 INFO L290 TraceCheckUtils]: 69: Hoare triple {31506#true} ~cond := #in~cond; {31506#true} is VALID [2022-04-28 14:11:22,040 INFO L272 TraceCheckUtils]: 68: Hoare triple {32336#(< ~counter~0 90)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {31506#true} is VALID [2022-04-28 14:11:22,040 INFO L290 TraceCheckUtils]: 67: Hoare triple {32336#(< ~counter~0 90)} assume !!(#t~post6 < 100);havoc #t~post6; {32336#(< ~counter~0 90)} is VALID [2022-04-28 14:11:22,041 INFO L290 TraceCheckUtils]: 66: Hoare triple {32364#(< ~counter~0 89)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {32336#(< ~counter~0 90)} is VALID [2022-04-28 14:11:22,041 INFO L290 TraceCheckUtils]: 65: Hoare triple {32364#(< ~counter~0 89)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {32364#(< ~counter~0 89)} is VALID [2022-04-28 14:11:22,041 INFO L290 TraceCheckUtils]: 64: Hoare triple {32364#(< ~counter~0 89)} assume !!(0 != ~a~0 && 0 != ~b~0); {32364#(< ~counter~0 89)} is VALID [2022-04-28 14:11:22,042 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {31506#true} {32364#(< ~counter~0 89)} #71#return; {32364#(< ~counter~0 89)} is VALID [2022-04-28 14:11:22,042 INFO L290 TraceCheckUtils]: 62: Hoare triple {31506#true} assume true; {31506#true} is VALID [2022-04-28 14:11:22,042 INFO L290 TraceCheckUtils]: 61: Hoare triple {31506#true} assume !(0 == ~cond); {31506#true} is VALID [2022-04-28 14:11:22,042 INFO L290 TraceCheckUtils]: 60: Hoare triple {31506#true} ~cond := #in~cond; {31506#true} is VALID [2022-04-28 14:11:22,042 INFO L272 TraceCheckUtils]: 59: Hoare triple {32364#(< ~counter~0 89)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {31506#true} is VALID [2022-04-28 14:11:22,042 INFO L290 TraceCheckUtils]: 58: Hoare triple {32364#(< ~counter~0 89)} assume !!(#t~post6 < 100);havoc #t~post6; {32364#(< ~counter~0 89)} is VALID [2022-04-28 14:11:22,043 INFO L290 TraceCheckUtils]: 57: Hoare triple {32392#(< ~counter~0 88)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {32364#(< ~counter~0 89)} is VALID [2022-04-28 14:11:22,043 INFO L290 TraceCheckUtils]: 56: Hoare triple {32392#(< ~counter~0 88)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {32392#(< ~counter~0 88)} is VALID [2022-04-28 14:11:22,043 INFO L290 TraceCheckUtils]: 55: Hoare triple {32392#(< ~counter~0 88)} assume !!(0 != ~a~0 && 0 != ~b~0); {32392#(< ~counter~0 88)} is VALID [2022-04-28 14:11:22,044 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {31506#true} {32392#(< ~counter~0 88)} #71#return; {32392#(< ~counter~0 88)} is VALID [2022-04-28 14:11:22,044 INFO L290 TraceCheckUtils]: 53: Hoare triple {31506#true} assume true; {31506#true} is VALID [2022-04-28 14:11:22,044 INFO L290 TraceCheckUtils]: 52: Hoare triple {31506#true} assume !(0 == ~cond); {31506#true} is VALID [2022-04-28 14:11:22,044 INFO L290 TraceCheckUtils]: 51: Hoare triple {31506#true} ~cond := #in~cond; {31506#true} is VALID [2022-04-28 14:11:22,044 INFO L272 TraceCheckUtils]: 50: Hoare triple {32392#(< ~counter~0 88)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {31506#true} is VALID [2022-04-28 14:11:22,044 INFO L290 TraceCheckUtils]: 49: Hoare triple {32392#(< ~counter~0 88)} assume !!(#t~post6 < 100);havoc #t~post6; {32392#(< ~counter~0 88)} is VALID [2022-04-28 14:11:22,045 INFO L290 TraceCheckUtils]: 48: Hoare triple {32420#(< ~counter~0 87)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {32392#(< ~counter~0 88)} is VALID [2022-04-28 14:11:22,045 INFO L290 TraceCheckUtils]: 47: Hoare triple {32420#(< ~counter~0 87)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {32420#(< ~counter~0 87)} is VALID [2022-04-28 14:11:22,045 INFO L290 TraceCheckUtils]: 46: Hoare triple {32420#(< ~counter~0 87)} assume !!(0 != ~a~0 && 0 != ~b~0); {32420#(< ~counter~0 87)} is VALID [2022-04-28 14:11:22,046 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {31506#true} {32420#(< ~counter~0 87)} #71#return; {32420#(< ~counter~0 87)} is VALID [2022-04-28 14:11:22,046 INFO L290 TraceCheckUtils]: 44: Hoare triple {31506#true} assume true; {31506#true} is VALID [2022-04-28 14:11:22,046 INFO L290 TraceCheckUtils]: 43: Hoare triple {31506#true} assume !(0 == ~cond); {31506#true} is VALID [2022-04-28 14:11:22,046 INFO L290 TraceCheckUtils]: 42: Hoare triple {31506#true} ~cond := #in~cond; {31506#true} is VALID [2022-04-28 14:11:22,046 INFO L272 TraceCheckUtils]: 41: Hoare triple {32420#(< ~counter~0 87)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {31506#true} is VALID [2022-04-28 14:11:22,046 INFO L290 TraceCheckUtils]: 40: Hoare triple {32420#(< ~counter~0 87)} assume !!(#t~post6 < 100);havoc #t~post6; {32420#(< ~counter~0 87)} is VALID [2022-04-28 14:11:22,047 INFO L290 TraceCheckUtils]: 39: Hoare triple {32448#(< ~counter~0 86)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {32420#(< ~counter~0 87)} is VALID [2022-04-28 14:11:22,047 INFO L290 TraceCheckUtils]: 38: Hoare triple {32448#(< ~counter~0 86)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {32448#(< ~counter~0 86)} is VALID [2022-04-28 14:11:22,047 INFO L290 TraceCheckUtils]: 37: Hoare triple {32448#(< ~counter~0 86)} assume !!(0 != ~a~0 && 0 != ~b~0); {32448#(< ~counter~0 86)} is VALID [2022-04-28 14:11:22,048 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {31506#true} {32448#(< ~counter~0 86)} #71#return; {32448#(< ~counter~0 86)} is VALID [2022-04-28 14:11:22,048 INFO L290 TraceCheckUtils]: 35: Hoare triple {31506#true} assume true; {31506#true} is VALID [2022-04-28 14:11:22,048 INFO L290 TraceCheckUtils]: 34: Hoare triple {31506#true} assume !(0 == ~cond); {31506#true} is VALID [2022-04-28 14:11:22,048 INFO L290 TraceCheckUtils]: 33: Hoare triple {31506#true} ~cond := #in~cond; {31506#true} is VALID [2022-04-28 14:11:22,048 INFO L272 TraceCheckUtils]: 32: Hoare triple {32448#(< ~counter~0 86)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {31506#true} is VALID [2022-04-28 14:11:22,048 INFO L290 TraceCheckUtils]: 31: Hoare triple {32448#(< ~counter~0 86)} assume !!(#t~post6 < 100);havoc #t~post6; {32448#(< ~counter~0 86)} is VALID [2022-04-28 14:11:22,049 INFO L290 TraceCheckUtils]: 30: Hoare triple {32476#(< ~counter~0 85)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {32448#(< ~counter~0 86)} is VALID [2022-04-28 14:11:22,049 INFO L290 TraceCheckUtils]: 29: Hoare triple {32476#(< ~counter~0 85)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {32476#(< ~counter~0 85)} is VALID [2022-04-28 14:11:22,049 INFO L290 TraceCheckUtils]: 28: Hoare triple {32476#(< ~counter~0 85)} assume !!(0 != ~a~0 && 0 != ~b~0); {32476#(< ~counter~0 85)} is VALID [2022-04-28 14:11:22,050 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {31506#true} {32476#(< ~counter~0 85)} #71#return; {32476#(< ~counter~0 85)} is VALID [2022-04-28 14:11:22,050 INFO L290 TraceCheckUtils]: 26: Hoare triple {31506#true} assume true; {31506#true} is VALID [2022-04-28 14:11:22,050 INFO L290 TraceCheckUtils]: 25: Hoare triple {31506#true} assume !(0 == ~cond); {31506#true} is VALID [2022-04-28 14:11:22,050 INFO L290 TraceCheckUtils]: 24: Hoare triple {31506#true} ~cond := #in~cond; {31506#true} is VALID [2022-04-28 14:11:22,050 INFO L272 TraceCheckUtils]: 23: Hoare triple {32476#(< ~counter~0 85)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {31506#true} is VALID [2022-04-28 14:11:22,050 INFO L290 TraceCheckUtils]: 22: Hoare triple {32476#(< ~counter~0 85)} assume !!(#t~post6 < 100);havoc #t~post6; {32476#(< ~counter~0 85)} is VALID [2022-04-28 14:11:22,051 INFO L290 TraceCheckUtils]: 21: Hoare triple {32504#(< ~counter~0 84)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {32476#(< ~counter~0 85)} is VALID [2022-04-28 14:11:22,051 INFO L290 TraceCheckUtils]: 20: Hoare triple {32504#(< ~counter~0 84)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {32504#(< ~counter~0 84)} is VALID [2022-04-28 14:11:22,051 INFO L290 TraceCheckUtils]: 19: Hoare triple {32504#(< ~counter~0 84)} assume !!(0 != ~a~0 && 0 != ~b~0); {32504#(< ~counter~0 84)} is VALID [2022-04-28 14:11:22,052 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {31506#true} {32504#(< ~counter~0 84)} #71#return; {32504#(< ~counter~0 84)} is VALID [2022-04-28 14:11:22,052 INFO L290 TraceCheckUtils]: 17: Hoare triple {31506#true} assume true; {31506#true} is VALID [2022-04-28 14:11:22,052 INFO L290 TraceCheckUtils]: 16: Hoare triple {31506#true} assume !(0 == ~cond); {31506#true} is VALID [2022-04-28 14:11:22,052 INFO L290 TraceCheckUtils]: 15: Hoare triple {31506#true} ~cond := #in~cond; {31506#true} is VALID [2022-04-28 14:11:22,052 INFO L272 TraceCheckUtils]: 14: Hoare triple {32504#(< ~counter~0 84)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {31506#true} is VALID [2022-04-28 14:11:22,052 INFO L290 TraceCheckUtils]: 13: Hoare triple {32504#(< ~counter~0 84)} assume !!(#t~post6 < 100);havoc #t~post6; {32504#(< ~counter~0 84)} is VALID [2022-04-28 14:11:22,053 INFO L290 TraceCheckUtils]: 12: Hoare triple {32532#(< ~counter~0 83)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {32504#(< ~counter~0 84)} is VALID [2022-04-28 14:11:22,053 INFO L290 TraceCheckUtils]: 11: Hoare triple {32532#(< ~counter~0 83)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {32532#(< ~counter~0 83)} is VALID [2022-04-28 14:11:22,053 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {31506#true} {32532#(< ~counter~0 83)} #69#return; {32532#(< ~counter~0 83)} is VALID [2022-04-28 14:11:22,053 INFO L290 TraceCheckUtils]: 9: Hoare triple {31506#true} assume true; {31506#true} is VALID [2022-04-28 14:11:22,054 INFO L290 TraceCheckUtils]: 8: Hoare triple {31506#true} assume !(0 == ~cond); {31506#true} is VALID [2022-04-28 14:11:22,054 INFO L290 TraceCheckUtils]: 7: Hoare triple {31506#true} ~cond := #in~cond; {31506#true} is VALID [2022-04-28 14:11:22,054 INFO L272 TraceCheckUtils]: 6: Hoare triple {32532#(< ~counter~0 83)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {31506#true} is VALID [2022-04-28 14:11:22,054 INFO L290 TraceCheckUtils]: 5: Hoare triple {32532#(< ~counter~0 83)} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {32532#(< ~counter~0 83)} is VALID [2022-04-28 14:11:22,054 INFO L272 TraceCheckUtils]: 4: Hoare triple {32532#(< ~counter~0 83)} call #t~ret7 := main(); {32532#(< ~counter~0 83)} is VALID [2022-04-28 14:11:22,054 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32532#(< ~counter~0 83)} {31506#true} #77#return; {32532#(< ~counter~0 83)} is VALID [2022-04-28 14:11:22,055 INFO L290 TraceCheckUtils]: 2: Hoare triple {32532#(< ~counter~0 83)} assume true; {32532#(< ~counter~0 83)} is VALID [2022-04-28 14:11:22,055 INFO L290 TraceCheckUtils]: 1: Hoare triple {31506#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(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {32532#(< ~counter~0 83)} is VALID [2022-04-28 14:11:22,055 INFO L272 TraceCheckUtils]: 0: Hoare triple {31506#true} call ULTIMATE.init(); {31506#true} is VALID [2022-04-28 14:11:22,056 INFO L134 CoverageAnalysis]: Checked inductivity of 1292 backedges. 34 proven. 714 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2022-04-28 14:11:22,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:11:22,056 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [294116852] [2022-04-28 14:11:22,056 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 14:11:22,056 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1456452869] [2022-04-28 14:11:22,056 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1456452869] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 14:11:22,056 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 14:11:22,056 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 40 [2022-04-28 14:11:22,056 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:11:22,056 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [826903948] [2022-04-28 14:11:22,056 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [826903948] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:11:22,056 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:11:22,057 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2022-04-28 14:11:22,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1309399862] [2022-04-28 14:11:22,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:11:22,057 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 6.238095238095238) internal successors, (131), 20 states have internal predecessors, (131), 20 states have call successors, (21), 20 states have call predecessors, (21), 18 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) Word has length 171 [2022-04-28 14:11:22,057 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:11:22,057 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 21 states, 21 states have (on average 6.238095238095238) internal successors, (131), 20 states have internal predecessors, (131), 20 states have call successors, (21), 20 states have call predecessors, (21), 18 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-28 14:11:22,187 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 171 edges. 171 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:11:22,187 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-04-28 14:11:22,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:11:22,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-04-28 14:11:22,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=708, Invalid=852, Unknown=0, NotChecked=0, Total=1560 [2022-04-28 14:11:22,188 INFO L87 Difference]: Start difference. First operand 219 states and 272 transitions. Second operand has 21 states, 21 states have (on average 6.238095238095238) internal successors, (131), 20 states have internal predecessors, (131), 20 states have call successors, (21), 20 states have call predecessors, (21), 18 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-28 14:11:23,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:11:23,323 INFO L93 Difference]: Finished difference Result 238 states and 295 transitions. [2022-04-28 14:11:23,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-04-28 14:11:23,323 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 6.238095238095238) internal successors, (131), 20 states have internal predecessors, (131), 20 states have call successors, (21), 20 states have call predecessors, (21), 18 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) Word has length 171 [2022-04-28 14:11:23,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:11:23,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 6.238095238095238) internal successors, (131), 20 states have internal predecessors, (131), 20 states have call successors, (21), 20 states have call predecessors, (21), 18 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-28 14:11:23,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 281 transitions. [2022-04-28 14:11:23,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 6.238095238095238) internal successors, (131), 20 states have internal predecessors, (131), 20 states have call successors, (21), 20 states have call predecessors, (21), 18 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-28 14:11:23,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 281 transitions. [2022-04-28 14:11:23,329 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 38 states and 281 transitions. [2022-04-28 14:11:23,587 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 281 edges. 281 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:11:23,590 INFO L225 Difference]: With dead ends: 238 [2022-04-28 14:11:23,590 INFO L226 Difference]: Without dead ends: 230 [2022-04-28 14:11:23,591 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 358 GetRequests, 303 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 188 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=1371, Invalid=1821, Unknown=0, NotChecked=0, Total=3192 [2022-04-28 14:11:23,591 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 222 mSDsluCounter, 275 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 222 SdHoareTripleChecker+Valid, 322 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 14:11:23,591 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [222 Valid, 322 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 14:11:23,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2022-04-28 14:11:23,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 230. [2022-04-28 14:11:23,991 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:11:23,992 INFO L82 GeneralOperation]: Start isEquivalent. First operand 230 states. Second operand has 230 states, 183 states have (on average 1.3114754098360655) internal successors, (240), 184 states have internal predecessors, (240), 24 states have call successors, (24), 23 states have call predecessors, (24), 22 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2022-04-28 14:11:23,992 INFO L74 IsIncluded]: Start isIncluded. First operand 230 states. Second operand has 230 states, 183 states have (on average 1.3114754098360655) internal successors, (240), 184 states have internal predecessors, (240), 24 states have call successors, (24), 23 states have call predecessors, (24), 22 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2022-04-28 14:11:23,992 INFO L87 Difference]: Start difference. First operand 230 states. Second operand has 230 states, 183 states have (on average 1.3114754098360655) internal successors, (240), 184 states have internal predecessors, (240), 24 states have call successors, (24), 23 states have call predecessors, (24), 22 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2022-04-28 14:11:23,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:11:23,995 INFO L93 Difference]: Finished difference Result 230 states and 286 transitions. [2022-04-28 14:11:23,995 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 286 transitions. [2022-04-28 14:11:23,996 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:11:23,996 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:11:23,996 INFO L74 IsIncluded]: Start isIncluded. First operand has 230 states, 183 states have (on average 1.3114754098360655) internal successors, (240), 184 states have internal predecessors, (240), 24 states have call successors, (24), 23 states have call predecessors, (24), 22 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) Second operand 230 states. [2022-04-28 14:11:23,996 INFO L87 Difference]: Start difference. First operand has 230 states, 183 states have (on average 1.3114754098360655) internal successors, (240), 184 states have internal predecessors, (240), 24 states have call successors, (24), 23 states have call predecessors, (24), 22 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) Second operand 230 states. [2022-04-28 14:11:24,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:11:24,000 INFO L93 Difference]: Finished difference Result 230 states and 286 transitions. [2022-04-28 14:11:24,000 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 286 transitions. [2022-04-28 14:11:24,000 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:11:24,000 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:11:24,000 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:11:24,000 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:11:24,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 230 states, 183 states have (on average 1.3114754098360655) internal successors, (240), 184 states have internal predecessors, (240), 24 states have call successors, (24), 23 states have call predecessors, (24), 22 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2022-04-28 14:11:24,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 286 transitions. [2022-04-28 14:11:24,005 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 286 transitions. Word has length 171 [2022-04-28 14:11:24,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:11:24,005 INFO L495 AbstractCegarLoop]: Abstraction has 230 states and 286 transitions. [2022-04-28 14:11:24,005 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 6.238095238095238) internal successors, (131), 20 states have internal predecessors, (131), 20 states have call successors, (21), 20 states have call predecessors, (21), 18 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-28 14:11:24,006 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 230 states and 286 transitions. [2022-04-28 14:12:00,907 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 286 edges. 269 inductive. 0 not inductive. 17 times theorem prover too weak to decide inductivity. [2022-04-28 14:12:00,908 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 286 transitions. [2022-04-28 14:12:00,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2022-04-28 14:12:00,908 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:12:00,908 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 18, 18, 18, 18, 18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 14:12:00,927 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Forceful destruction successful, exit code 0 [2022-04-28 14:12:01,111 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable30 [2022-04-28 14:12:01,111 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:12:01,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:12:01,112 INFO L85 PathProgramCache]: Analyzing trace with hash -1754232326, now seen corresponding path program 35 times [2022-04-28 14:12:01,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:12:01,112 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [66666087] [2022-04-28 14:12:07,163 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 14:12:07,163 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 14:12:07,163 INFO L85 PathProgramCache]: Analyzing trace with hash -1754232326, now seen corresponding path program 36 times [2022-04-28 14:12:07,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:12:07,163 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [807033467] [2022-04-28 14:12:07,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:12:07,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:12:07,184 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 14:12:07,185 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [533508772] [2022-04-28 14:12:07,185 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 14:12:07,185 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 14:12:07,185 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 14:12:07,192 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 14:12:07,192 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2022-04-28 14:12:07,476 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 19 check-sat command(s) [2022-04-28 14:12:07,477 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 14:12:07,479 INFO L263 TraceCheckSpWp]: Trace formula consists of 554 conjuncts, 41 conjunts are in the unsatisfiable core [2022-04-28 14:12:07,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:12:07,512 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 14:12:08,486 INFO L272 TraceCheckUtils]: 0: Hoare triple {34001#true} call ULTIMATE.init(); {34001#true} is VALID [2022-04-28 14:12:08,487 INFO L290 TraceCheckUtils]: 1: Hoare triple {34001#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(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {34009#(<= ~counter~0 0)} is VALID [2022-04-28 14:12:08,487 INFO L290 TraceCheckUtils]: 2: Hoare triple {34009#(<= ~counter~0 0)} assume true; {34009#(<= ~counter~0 0)} is VALID [2022-04-28 14:12:08,487 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {34009#(<= ~counter~0 0)} {34001#true} #77#return; {34009#(<= ~counter~0 0)} is VALID [2022-04-28 14:12:08,487 INFO L272 TraceCheckUtils]: 4: Hoare triple {34009#(<= ~counter~0 0)} call #t~ret7 := main(); {34009#(<= ~counter~0 0)} is VALID [2022-04-28 14:12:08,488 INFO L290 TraceCheckUtils]: 5: Hoare triple {34009#(<= ~counter~0 0)} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {34009#(<= ~counter~0 0)} is VALID [2022-04-28 14:12:08,488 INFO L272 TraceCheckUtils]: 6: Hoare triple {34009#(<= ~counter~0 0)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {34009#(<= ~counter~0 0)} is VALID [2022-04-28 14:12:08,488 INFO L290 TraceCheckUtils]: 7: Hoare triple {34009#(<= ~counter~0 0)} ~cond := #in~cond; {34009#(<= ~counter~0 0)} is VALID [2022-04-28 14:12:08,489 INFO L290 TraceCheckUtils]: 8: Hoare triple {34009#(<= ~counter~0 0)} assume !(0 == ~cond); {34009#(<= ~counter~0 0)} is VALID [2022-04-28 14:12:08,489 INFO L290 TraceCheckUtils]: 9: Hoare triple {34009#(<= ~counter~0 0)} assume true; {34009#(<= ~counter~0 0)} is VALID [2022-04-28 14:12:08,489 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {34009#(<= ~counter~0 0)} {34009#(<= ~counter~0 0)} #69#return; {34009#(<= ~counter~0 0)} is VALID [2022-04-28 14:12:08,489 INFO L290 TraceCheckUtils]: 11: Hoare triple {34009#(<= ~counter~0 0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {34009#(<= ~counter~0 0)} is VALID [2022-04-28 14:12:08,490 INFO L290 TraceCheckUtils]: 12: Hoare triple {34009#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {34043#(<= ~counter~0 1)} is VALID [2022-04-28 14:12:08,490 INFO L290 TraceCheckUtils]: 13: Hoare triple {34043#(<= ~counter~0 1)} assume !!(#t~post6 < 100);havoc #t~post6; {34043#(<= ~counter~0 1)} is VALID [2022-04-28 14:12:08,491 INFO L272 TraceCheckUtils]: 14: Hoare triple {34043#(<= ~counter~0 1)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {34043#(<= ~counter~0 1)} is VALID [2022-04-28 14:12:08,491 INFO L290 TraceCheckUtils]: 15: Hoare triple {34043#(<= ~counter~0 1)} ~cond := #in~cond; {34043#(<= ~counter~0 1)} is VALID [2022-04-28 14:12:08,492 INFO L290 TraceCheckUtils]: 16: Hoare triple {34043#(<= ~counter~0 1)} assume !(0 == ~cond); {34043#(<= ~counter~0 1)} is VALID [2022-04-28 14:12:08,492 INFO L290 TraceCheckUtils]: 17: Hoare triple {34043#(<= ~counter~0 1)} assume true; {34043#(<= ~counter~0 1)} is VALID [2022-04-28 14:12:08,492 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {34043#(<= ~counter~0 1)} {34043#(<= ~counter~0 1)} #71#return; {34043#(<= ~counter~0 1)} is VALID [2022-04-28 14:12:08,493 INFO L290 TraceCheckUtils]: 19: Hoare triple {34043#(<= ~counter~0 1)} assume !!(0 != ~a~0 && 0 != ~b~0); {34043#(<= ~counter~0 1)} is VALID [2022-04-28 14:12:08,493 INFO L290 TraceCheckUtils]: 20: Hoare triple {34043#(<= ~counter~0 1)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {34043#(<= ~counter~0 1)} is VALID [2022-04-28 14:12:08,493 INFO L290 TraceCheckUtils]: 21: Hoare triple {34043#(<= ~counter~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {34071#(<= ~counter~0 2)} is VALID [2022-04-28 14:12:08,494 INFO L290 TraceCheckUtils]: 22: Hoare triple {34071#(<= ~counter~0 2)} assume !!(#t~post6 < 100);havoc #t~post6; {34071#(<= ~counter~0 2)} is VALID [2022-04-28 14:12:08,494 INFO L272 TraceCheckUtils]: 23: Hoare triple {34071#(<= ~counter~0 2)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {34071#(<= ~counter~0 2)} is VALID [2022-04-28 14:12:08,494 INFO L290 TraceCheckUtils]: 24: Hoare triple {34071#(<= ~counter~0 2)} ~cond := #in~cond; {34071#(<= ~counter~0 2)} is VALID [2022-04-28 14:12:08,495 INFO L290 TraceCheckUtils]: 25: Hoare triple {34071#(<= ~counter~0 2)} assume !(0 == ~cond); {34071#(<= ~counter~0 2)} is VALID [2022-04-28 14:12:08,495 INFO L290 TraceCheckUtils]: 26: Hoare triple {34071#(<= ~counter~0 2)} assume true; {34071#(<= ~counter~0 2)} is VALID [2022-04-28 14:12:08,495 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {34071#(<= ~counter~0 2)} {34071#(<= ~counter~0 2)} #71#return; {34071#(<= ~counter~0 2)} is VALID [2022-04-28 14:12:08,496 INFO L290 TraceCheckUtils]: 28: Hoare triple {34071#(<= ~counter~0 2)} assume !!(0 != ~a~0 && 0 != ~b~0); {34071#(<= ~counter~0 2)} is VALID [2022-04-28 14:12:08,496 INFO L290 TraceCheckUtils]: 29: Hoare triple {34071#(<= ~counter~0 2)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {34071#(<= ~counter~0 2)} is VALID [2022-04-28 14:12:08,496 INFO L290 TraceCheckUtils]: 30: Hoare triple {34071#(<= ~counter~0 2)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {34099#(<= ~counter~0 3)} is VALID [2022-04-28 14:12:08,497 INFO L290 TraceCheckUtils]: 31: Hoare triple {34099#(<= ~counter~0 3)} assume !!(#t~post6 < 100);havoc #t~post6; {34099#(<= ~counter~0 3)} is VALID [2022-04-28 14:12:08,497 INFO L272 TraceCheckUtils]: 32: Hoare triple {34099#(<= ~counter~0 3)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {34099#(<= ~counter~0 3)} is VALID [2022-04-28 14:12:08,497 INFO L290 TraceCheckUtils]: 33: Hoare triple {34099#(<= ~counter~0 3)} ~cond := #in~cond; {34099#(<= ~counter~0 3)} is VALID [2022-04-28 14:12:08,498 INFO L290 TraceCheckUtils]: 34: Hoare triple {34099#(<= ~counter~0 3)} assume !(0 == ~cond); {34099#(<= ~counter~0 3)} is VALID [2022-04-28 14:12:08,498 INFO L290 TraceCheckUtils]: 35: Hoare triple {34099#(<= ~counter~0 3)} assume true; {34099#(<= ~counter~0 3)} is VALID [2022-04-28 14:12:08,498 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {34099#(<= ~counter~0 3)} {34099#(<= ~counter~0 3)} #71#return; {34099#(<= ~counter~0 3)} is VALID [2022-04-28 14:12:08,499 INFO L290 TraceCheckUtils]: 37: Hoare triple {34099#(<= ~counter~0 3)} assume !!(0 != ~a~0 && 0 != ~b~0); {34099#(<= ~counter~0 3)} is VALID [2022-04-28 14:12:08,499 INFO L290 TraceCheckUtils]: 38: Hoare triple {34099#(<= ~counter~0 3)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {34099#(<= ~counter~0 3)} is VALID [2022-04-28 14:12:08,499 INFO L290 TraceCheckUtils]: 39: Hoare triple {34099#(<= ~counter~0 3)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {34127#(<= ~counter~0 4)} is VALID [2022-04-28 14:12:08,500 INFO L290 TraceCheckUtils]: 40: Hoare triple {34127#(<= ~counter~0 4)} assume !!(#t~post6 < 100);havoc #t~post6; {34127#(<= ~counter~0 4)} is VALID [2022-04-28 14:12:08,500 INFO L272 TraceCheckUtils]: 41: Hoare triple {34127#(<= ~counter~0 4)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {34127#(<= ~counter~0 4)} is VALID [2022-04-28 14:12:08,501 INFO L290 TraceCheckUtils]: 42: Hoare triple {34127#(<= ~counter~0 4)} ~cond := #in~cond; {34127#(<= ~counter~0 4)} is VALID [2022-04-28 14:12:08,501 INFO L290 TraceCheckUtils]: 43: Hoare triple {34127#(<= ~counter~0 4)} assume !(0 == ~cond); {34127#(<= ~counter~0 4)} is VALID [2022-04-28 14:12:08,501 INFO L290 TraceCheckUtils]: 44: Hoare triple {34127#(<= ~counter~0 4)} assume true; {34127#(<= ~counter~0 4)} is VALID [2022-04-28 14:12:08,502 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {34127#(<= ~counter~0 4)} {34127#(<= ~counter~0 4)} #71#return; {34127#(<= ~counter~0 4)} is VALID [2022-04-28 14:12:08,502 INFO L290 TraceCheckUtils]: 46: Hoare triple {34127#(<= ~counter~0 4)} assume !!(0 != ~a~0 && 0 != ~b~0); {34127#(<= ~counter~0 4)} is VALID [2022-04-28 14:12:08,502 INFO L290 TraceCheckUtils]: 47: Hoare triple {34127#(<= ~counter~0 4)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {34127#(<= ~counter~0 4)} is VALID [2022-04-28 14:12:08,503 INFO L290 TraceCheckUtils]: 48: Hoare triple {34127#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {34155#(<= ~counter~0 5)} is VALID [2022-04-28 14:12:08,503 INFO L290 TraceCheckUtils]: 49: Hoare triple {34155#(<= ~counter~0 5)} assume !!(#t~post6 < 100);havoc #t~post6; {34155#(<= ~counter~0 5)} is VALID [2022-04-28 14:12:08,503 INFO L272 TraceCheckUtils]: 50: Hoare triple {34155#(<= ~counter~0 5)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {34155#(<= ~counter~0 5)} is VALID [2022-04-28 14:12:08,504 INFO L290 TraceCheckUtils]: 51: Hoare triple {34155#(<= ~counter~0 5)} ~cond := #in~cond; {34155#(<= ~counter~0 5)} is VALID [2022-04-28 14:12:08,504 INFO L290 TraceCheckUtils]: 52: Hoare triple {34155#(<= ~counter~0 5)} assume !(0 == ~cond); {34155#(<= ~counter~0 5)} is VALID [2022-04-28 14:12:08,504 INFO L290 TraceCheckUtils]: 53: Hoare triple {34155#(<= ~counter~0 5)} assume true; {34155#(<= ~counter~0 5)} is VALID [2022-04-28 14:12:08,505 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {34155#(<= ~counter~0 5)} {34155#(<= ~counter~0 5)} #71#return; {34155#(<= ~counter~0 5)} is VALID [2022-04-28 14:12:08,505 INFO L290 TraceCheckUtils]: 55: Hoare triple {34155#(<= ~counter~0 5)} assume !!(0 != ~a~0 && 0 != ~b~0); {34155#(<= ~counter~0 5)} is VALID [2022-04-28 14:12:08,505 INFO L290 TraceCheckUtils]: 56: Hoare triple {34155#(<= ~counter~0 5)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {34155#(<= ~counter~0 5)} is VALID [2022-04-28 14:12:08,506 INFO L290 TraceCheckUtils]: 57: Hoare triple {34155#(<= ~counter~0 5)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {34183#(<= ~counter~0 6)} is VALID [2022-04-28 14:12:08,506 INFO L290 TraceCheckUtils]: 58: Hoare triple {34183#(<= ~counter~0 6)} assume !!(#t~post6 < 100);havoc #t~post6; {34183#(<= ~counter~0 6)} is VALID [2022-04-28 14:12:08,506 INFO L272 TraceCheckUtils]: 59: Hoare triple {34183#(<= ~counter~0 6)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {34183#(<= ~counter~0 6)} is VALID [2022-04-28 14:12:08,507 INFO L290 TraceCheckUtils]: 60: Hoare triple {34183#(<= ~counter~0 6)} ~cond := #in~cond; {34183#(<= ~counter~0 6)} is VALID [2022-04-28 14:12:08,507 INFO L290 TraceCheckUtils]: 61: Hoare triple {34183#(<= ~counter~0 6)} assume !(0 == ~cond); {34183#(<= ~counter~0 6)} is VALID [2022-04-28 14:12:08,507 INFO L290 TraceCheckUtils]: 62: Hoare triple {34183#(<= ~counter~0 6)} assume true; {34183#(<= ~counter~0 6)} is VALID [2022-04-28 14:12:08,508 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {34183#(<= ~counter~0 6)} {34183#(<= ~counter~0 6)} #71#return; {34183#(<= ~counter~0 6)} is VALID [2022-04-28 14:12:08,508 INFO L290 TraceCheckUtils]: 64: Hoare triple {34183#(<= ~counter~0 6)} assume !!(0 != ~a~0 && 0 != ~b~0); {34183#(<= ~counter~0 6)} is VALID [2022-04-28 14:12:08,508 INFO L290 TraceCheckUtils]: 65: Hoare triple {34183#(<= ~counter~0 6)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {34183#(<= ~counter~0 6)} is VALID [2022-04-28 14:12:08,509 INFO L290 TraceCheckUtils]: 66: Hoare triple {34183#(<= ~counter~0 6)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {34211#(<= ~counter~0 7)} is VALID [2022-04-28 14:12:08,509 INFO L290 TraceCheckUtils]: 67: Hoare triple {34211#(<= ~counter~0 7)} assume !!(#t~post6 < 100);havoc #t~post6; {34211#(<= ~counter~0 7)} is VALID [2022-04-28 14:12:08,510 INFO L272 TraceCheckUtils]: 68: Hoare triple {34211#(<= ~counter~0 7)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {34211#(<= ~counter~0 7)} is VALID [2022-04-28 14:12:08,510 INFO L290 TraceCheckUtils]: 69: Hoare triple {34211#(<= ~counter~0 7)} ~cond := #in~cond; {34211#(<= ~counter~0 7)} is VALID [2022-04-28 14:12:08,510 INFO L290 TraceCheckUtils]: 70: Hoare triple {34211#(<= ~counter~0 7)} assume !(0 == ~cond); {34211#(<= ~counter~0 7)} is VALID [2022-04-28 14:12:08,510 INFO L290 TraceCheckUtils]: 71: Hoare triple {34211#(<= ~counter~0 7)} assume true; {34211#(<= ~counter~0 7)} is VALID [2022-04-28 14:12:08,511 INFO L284 TraceCheckUtils]: 72: Hoare quadruple {34211#(<= ~counter~0 7)} {34211#(<= ~counter~0 7)} #71#return; {34211#(<= ~counter~0 7)} is VALID [2022-04-28 14:12:08,511 INFO L290 TraceCheckUtils]: 73: Hoare triple {34211#(<= ~counter~0 7)} assume !!(0 != ~a~0 && 0 != ~b~0); {34211#(<= ~counter~0 7)} is VALID [2022-04-28 14:12:08,511 INFO L290 TraceCheckUtils]: 74: Hoare triple {34211#(<= ~counter~0 7)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {34211#(<= ~counter~0 7)} is VALID [2022-04-28 14:12:08,512 INFO L290 TraceCheckUtils]: 75: Hoare triple {34211#(<= ~counter~0 7)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {34239#(<= ~counter~0 8)} is VALID [2022-04-28 14:12:08,512 INFO L290 TraceCheckUtils]: 76: Hoare triple {34239#(<= ~counter~0 8)} assume !!(#t~post6 < 100);havoc #t~post6; {34239#(<= ~counter~0 8)} is VALID [2022-04-28 14:12:08,513 INFO L272 TraceCheckUtils]: 77: Hoare triple {34239#(<= ~counter~0 8)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {34239#(<= ~counter~0 8)} is VALID [2022-04-28 14:12:08,513 INFO L290 TraceCheckUtils]: 78: Hoare triple {34239#(<= ~counter~0 8)} ~cond := #in~cond; {34239#(<= ~counter~0 8)} is VALID [2022-04-28 14:12:08,513 INFO L290 TraceCheckUtils]: 79: Hoare triple {34239#(<= ~counter~0 8)} assume !(0 == ~cond); {34239#(<= ~counter~0 8)} is VALID [2022-04-28 14:12:08,513 INFO L290 TraceCheckUtils]: 80: Hoare triple {34239#(<= ~counter~0 8)} assume true; {34239#(<= ~counter~0 8)} is VALID [2022-04-28 14:12:08,514 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {34239#(<= ~counter~0 8)} {34239#(<= ~counter~0 8)} #71#return; {34239#(<= ~counter~0 8)} is VALID [2022-04-28 14:12:08,514 INFO L290 TraceCheckUtils]: 82: Hoare triple {34239#(<= ~counter~0 8)} assume !!(0 != ~a~0 && 0 != ~b~0); {34239#(<= ~counter~0 8)} is VALID [2022-04-28 14:12:08,514 INFO L290 TraceCheckUtils]: 83: Hoare triple {34239#(<= ~counter~0 8)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {34239#(<= ~counter~0 8)} is VALID [2022-04-28 14:12:08,515 INFO L290 TraceCheckUtils]: 84: Hoare triple {34239#(<= ~counter~0 8)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {34267#(<= ~counter~0 9)} is VALID [2022-04-28 14:12:08,515 INFO L290 TraceCheckUtils]: 85: Hoare triple {34267#(<= ~counter~0 9)} assume !!(#t~post6 < 100);havoc #t~post6; {34267#(<= ~counter~0 9)} is VALID [2022-04-28 14:12:08,516 INFO L272 TraceCheckUtils]: 86: Hoare triple {34267#(<= ~counter~0 9)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {34267#(<= ~counter~0 9)} is VALID [2022-04-28 14:12:08,516 INFO L290 TraceCheckUtils]: 87: Hoare triple {34267#(<= ~counter~0 9)} ~cond := #in~cond; {34267#(<= ~counter~0 9)} is VALID [2022-04-28 14:12:08,516 INFO L290 TraceCheckUtils]: 88: Hoare triple {34267#(<= ~counter~0 9)} assume !(0 == ~cond); {34267#(<= ~counter~0 9)} is VALID [2022-04-28 14:12:08,516 INFO L290 TraceCheckUtils]: 89: Hoare triple {34267#(<= ~counter~0 9)} assume true; {34267#(<= ~counter~0 9)} is VALID [2022-04-28 14:12:08,517 INFO L284 TraceCheckUtils]: 90: Hoare quadruple {34267#(<= ~counter~0 9)} {34267#(<= ~counter~0 9)} #71#return; {34267#(<= ~counter~0 9)} is VALID [2022-04-28 14:12:08,517 INFO L290 TraceCheckUtils]: 91: Hoare triple {34267#(<= ~counter~0 9)} assume !!(0 != ~a~0 && 0 != ~b~0); {34267#(<= ~counter~0 9)} is VALID [2022-04-28 14:12:08,517 INFO L290 TraceCheckUtils]: 92: Hoare triple {34267#(<= ~counter~0 9)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {34267#(<= ~counter~0 9)} is VALID [2022-04-28 14:12:08,518 INFO L290 TraceCheckUtils]: 93: Hoare triple {34267#(<= ~counter~0 9)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {34295#(<= ~counter~0 10)} is VALID [2022-04-28 14:12:08,518 INFO L290 TraceCheckUtils]: 94: Hoare triple {34295#(<= ~counter~0 10)} assume !!(#t~post6 < 100);havoc #t~post6; {34295#(<= ~counter~0 10)} is VALID [2022-04-28 14:12:08,519 INFO L272 TraceCheckUtils]: 95: Hoare triple {34295#(<= ~counter~0 10)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {34295#(<= ~counter~0 10)} is VALID [2022-04-28 14:12:08,519 INFO L290 TraceCheckUtils]: 96: Hoare triple {34295#(<= ~counter~0 10)} ~cond := #in~cond; {34295#(<= ~counter~0 10)} is VALID [2022-04-28 14:12:08,519 INFO L290 TraceCheckUtils]: 97: Hoare triple {34295#(<= ~counter~0 10)} assume !(0 == ~cond); {34295#(<= ~counter~0 10)} is VALID [2022-04-28 14:12:08,520 INFO L290 TraceCheckUtils]: 98: Hoare triple {34295#(<= ~counter~0 10)} assume true; {34295#(<= ~counter~0 10)} is VALID [2022-04-28 14:12:08,520 INFO L284 TraceCheckUtils]: 99: Hoare quadruple {34295#(<= ~counter~0 10)} {34295#(<= ~counter~0 10)} #71#return; {34295#(<= ~counter~0 10)} is VALID [2022-04-28 14:12:08,520 INFO L290 TraceCheckUtils]: 100: Hoare triple {34295#(<= ~counter~0 10)} assume !!(0 != ~a~0 && 0 != ~b~0); {34295#(<= ~counter~0 10)} is VALID [2022-04-28 14:12:08,521 INFO L290 TraceCheckUtils]: 101: Hoare triple {34295#(<= ~counter~0 10)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {34295#(<= ~counter~0 10)} is VALID [2022-04-28 14:12:08,521 INFO L290 TraceCheckUtils]: 102: Hoare triple {34295#(<= ~counter~0 10)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {34323#(<= ~counter~0 11)} is VALID [2022-04-28 14:12:08,521 INFO L290 TraceCheckUtils]: 103: Hoare triple {34323#(<= ~counter~0 11)} assume !!(#t~post6 < 100);havoc #t~post6; {34323#(<= ~counter~0 11)} is VALID [2022-04-28 14:12:08,522 INFO L272 TraceCheckUtils]: 104: Hoare triple {34323#(<= ~counter~0 11)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {34323#(<= ~counter~0 11)} is VALID [2022-04-28 14:12:08,522 INFO L290 TraceCheckUtils]: 105: Hoare triple {34323#(<= ~counter~0 11)} ~cond := #in~cond; {34323#(<= ~counter~0 11)} is VALID [2022-04-28 14:12:08,522 INFO L290 TraceCheckUtils]: 106: Hoare triple {34323#(<= ~counter~0 11)} assume !(0 == ~cond); {34323#(<= ~counter~0 11)} is VALID [2022-04-28 14:12:08,523 INFO L290 TraceCheckUtils]: 107: Hoare triple {34323#(<= ~counter~0 11)} assume true; {34323#(<= ~counter~0 11)} is VALID [2022-04-28 14:12:08,523 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {34323#(<= ~counter~0 11)} {34323#(<= ~counter~0 11)} #71#return; {34323#(<= ~counter~0 11)} is VALID [2022-04-28 14:12:08,523 INFO L290 TraceCheckUtils]: 109: Hoare triple {34323#(<= ~counter~0 11)} assume !!(0 != ~a~0 && 0 != ~b~0); {34323#(<= ~counter~0 11)} is VALID [2022-04-28 14:12:08,524 INFO L290 TraceCheckUtils]: 110: Hoare triple {34323#(<= ~counter~0 11)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {34323#(<= ~counter~0 11)} is VALID [2022-04-28 14:12:08,524 INFO L290 TraceCheckUtils]: 111: Hoare triple {34323#(<= ~counter~0 11)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {34351#(<= ~counter~0 12)} is VALID [2022-04-28 14:12:08,524 INFO L290 TraceCheckUtils]: 112: Hoare triple {34351#(<= ~counter~0 12)} assume !!(#t~post6 < 100);havoc #t~post6; {34351#(<= ~counter~0 12)} is VALID [2022-04-28 14:12:08,525 INFO L272 TraceCheckUtils]: 113: Hoare triple {34351#(<= ~counter~0 12)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {34351#(<= ~counter~0 12)} is VALID [2022-04-28 14:12:08,525 INFO L290 TraceCheckUtils]: 114: Hoare triple {34351#(<= ~counter~0 12)} ~cond := #in~cond; {34351#(<= ~counter~0 12)} is VALID [2022-04-28 14:12:08,525 INFO L290 TraceCheckUtils]: 115: Hoare triple {34351#(<= ~counter~0 12)} assume !(0 == ~cond); {34351#(<= ~counter~0 12)} is VALID [2022-04-28 14:12:08,526 INFO L290 TraceCheckUtils]: 116: Hoare triple {34351#(<= ~counter~0 12)} assume true; {34351#(<= ~counter~0 12)} is VALID [2022-04-28 14:12:08,526 INFO L284 TraceCheckUtils]: 117: Hoare quadruple {34351#(<= ~counter~0 12)} {34351#(<= ~counter~0 12)} #71#return; {34351#(<= ~counter~0 12)} is VALID [2022-04-28 14:12:08,526 INFO L290 TraceCheckUtils]: 118: Hoare triple {34351#(<= ~counter~0 12)} assume !!(0 != ~a~0 && 0 != ~b~0); {34351#(<= ~counter~0 12)} is VALID [2022-04-28 14:12:08,527 INFO L290 TraceCheckUtils]: 119: Hoare triple {34351#(<= ~counter~0 12)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {34351#(<= ~counter~0 12)} is VALID [2022-04-28 14:12:08,527 INFO L290 TraceCheckUtils]: 120: Hoare triple {34351#(<= ~counter~0 12)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {34379#(<= ~counter~0 13)} is VALID [2022-04-28 14:12:08,527 INFO L290 TraceCheckUtils]: 121: Hoare triple {34379#(<= ~counter~0 13)} assume !!(#t~post6 < 100);havoc #t~post6; {34379#(<= ~counter~0 13)} is VALID [2022-04-28 14:12:08,528 INFO L272 TraceCheckUtils]: 122: Hoare triple {34379#(<= ~counter~0 13)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {34379#(<= ~counter~0 13)} is VALID [2022-04-28 14:12:08,528 INFO L290 TraceCheckUtils]: 123: Hoare triple {34379#(<= ~counter~0 13)} ~cond := #in~cond; {34379#(<= ~counter~0 13)} is VALID [2022-04-28 14:12:08,528 INFO L290 TraceCheckUtils]: 124: Hoare triple {34379#(<= ~counter~0 13)} assume !(0 == ~cond); {34379#(<= ~counter~0 13)} is VALID [2022-04-28 14:12:08,529 INFO L290 TraceCheckUtils]: 125: Hoare triple {34379#(<= ~counter~0 13)} assume true; {34379#(<= ~counter~0 13)} is VALID [2022-04-28 14:12:08,529 INFO L284 TraceCheckUtils]: 126: Hoare quadruple {34379#(<= ~counter~0 13)} {34379#(<= ~counter~0 13)} #71#return; {34379#(<= ~counter~0 13)} is VALID [2022-04-28 14:12:08,530 INFO L290 TraceCheckUtils]: 127: Hoare triple {34379#(<= ~counter~0 13)} assume !!(0 != ~a~0 && 0 != ~b~0); {34379#(<= ~counter~0 13)} is VALID [2022-04-28 14:12:08,530 INFO L290 TraceCheckUtils]: 128: Hoare triple {34379#(<= ~counter~0 13)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {34379#(<= ~counter~0 13)} is VALID [2022-04-28 14:12:08,530 INFO L290 TraceCheckUtils]: 129: Hoare triple {34379#(<= ~counter~0 13)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {34407#(<= ~counter~0 14)} is VALID [2022-04-28 14:12:08,531 INFO L290 TraceCheckUtils]: 130: Hoare triple {34407#(<= ~counter~0 14)} assume !!(#t~post6 < 100);havoc #t~post6; {34407#(<= ~counter~0 14)} is VALID [2022-04-28 14:12:08,531 INFO L272 TraceCheckUtils]: 131: Hoare triple {34407#(<= ~counter~0 14)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {34407#(<= ~counter~0 14)} is VALID [2022-04-28 14:12:08,531 INFO L290 TraceCheckUtils]: 132: Hoare triple {34407#(<= ~counter~0 14)} ~cond := #in~cond; {34407#(<= ~counter~0 14)} is VALID [2022-04-28 14:12:08,532 INFO L290 TraceCheckUtils]: 133: Hoare triple {34407#(<= ~counter~0 14)} assume !(0 == ~cond); {34407#(<= ~counter~0 14)} is VALID [2022-04-28 14:12:08,532 INFO L290 TraceCheckUtils]: 134: Hoare triple {34407#(<= ~counter~0 14)} assume true; {34407#(<= ~counter~0 14)} is VALID [2022-04-28 14:12:08,532 INFO L284 TraceCheckUtils]: 135: Hoare quadruple {34407#(<= ~counter~0 14)} {34407#(<= ~counter~0 14)} #71#return; {34407#(<= ~counter~0 14)} is VALID [2022-04-28 14:12:08,533 INFO L290 TraceCheckUtils]: 136: Hoare triple {34407#(<= ~counter~0 14)} assume !!(0 != ~a~0 && 0 != ~b~0); {34407#(<= ~counter~0 14)} is VALID [2022-04-28 14:12:08,533 INFO L290 TraceCheckUtils]: 137: Hoare triple {34407#(<= ~counter~0 14)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {34407#(<= ~counter~0 14)} is VALID [2022-04-28 14:12:08,533 INFO L290 TraceCheckUtils]: 138: Hoare triple {34407#(<= ~counter~0 14)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {34435#(<= ~counter~0 15)} is VALID [2022-04-28 14:12:08,534 INFO L290 TraceCheckUtils]: 139: Hoare triple {34435#(<= ~counter~0 15)} assume !!(#t~post6 < 100);havoc #t~post6; {34435#(<= ~counter~0 15)} is VALID [2022-04-28 14:12:08,534 INFO L272 TraceCheckUtils]: 140: Hoare triple {34435#(<= ~counter~0 15)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {34435#(<= ~counter~0 15)} is VALID [2022-04-28 14:12:08,534 INFO L290 TraceCheckUtils]: 141: Hoare triple {34435#(<= ~counter~0 15)} ~cond := #in~cond; {34435#(<= ~counter~0 15)} is VALID [2022-04-28 14:12:08,535 INFO L290 TraceCheckUtils]: 142: Hoare triple {34435#(<= ~counter~0 15)} assume !(0 == ~cond); {34435#(<= ~counter~0 15)} is VALID [2022-04-28 14:12:08,535 INFO L290 TraceCheckUtils]: 143: Hoare triple {34435#(<= ~counter~0 15)} assume true; {34435#(<= ~counter~0 15)} is VALID [2022-04-28 14:12:08,536 INFO L284 TraceCheckUtils]: 144: Hoare quadruple {34435#(<= ~counter~0 15)} {34435#(<= ~counter~0 15)} #71#return; {34435#(<= ~counter~0 15)} is VALID [2022-04-28 14:12:08,536 INFO L290 TraceCheckUtils]: 145: Hoare triple {34435#(<= ~counter~0 15)} assume !!(0 != ~a~0 && 0 != ~b~0); {34435#(<= ~counter~0 15)} is VALID [2022-04-28 14:12:08,536 INFO L290 TraceCheckUtils]: 146: Hoare triple {34435#(<= ~counter~0 15)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {34435#(<= ~counter~0 15)} is VALID [2022-04-28 14:12:08,536 INFO L290 TraceCheckUtils]: 147: Hoare triple {34435#(<= ~counter~0 15)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {34463#(<= ~counter~0 16)} is VALID [2022-04-28 14:12:08,537 INFO L290 TraceCheckUtils]: 148: Hoare triple {34463#(<= ~counter~0 16)} assume !!(#t~post6 < 100);havoc #t~post6; {34463#(<= ~counter~0 16)} is VALID [2022-04-28 14:12:08,537 INFO L272 TraceCheckUtils]: 149: Hoare triple {34463#(<= ~counter~0 16)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {34463#(<= ~counter~0 16)} is VALID [2022-04-28 14:12:08,538 INFO L290 TraceCheckUtils]: 150: Hoare triple {34463#(<= ~counter~0 16)} ~cond := #in~cond; {34463#(<= ~counter~0 16)} is VALID [2022-04-28 14:12:08,538 INFO L290 TraceCheckUtils]: 151: Hoare triple {34463#(<= ~counter~0 16)} assume !(0 == ~cond); {34463#(<= ~counter~0 16)} is VALID [2022-04-28 14:12:08,538 INFO L290 TraceCheckUtils]: 152: Hoare triple {34463#(<= ~counter~0 16)} assume true; {34463#(<= ~counter~0 16)} is VALID [2022-04-28 14:12:08,539 INFO L284 TraceCheckUtils]: 153: Hoare quadruple {34463#(<= ~counter~0 16)} {34463#(<= ~counter~0 16)} #71#return; {34463#(<= ~counter~0 16)} is VALID [2022-04-28 14:12:08,539 INFO L290 TraceCheckUtils]: 154: Hoare triple {34463#(<= ~counter~0 16)} assume !!(0 != ~a~0 && 0 != ~b~0); {34463#(<= ~counter~0 16)} is VALID [2022-04-28 14:12:08,539 INFO L290 TraceCheckUtils]: 155: Hoare triple {34463#(<= ~counter~0 16)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {34463#(<= ~counter~0 16)} is VALID [2022-04-28 14:12:08,540 INFO L290 TraceCheckUtils]: 156: Hoare triple {34463#(<= ~counter~0 16)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {34491#(<= ~counter~0 17)} is VALID [2022-04-28 14:12:08,540 INFO L290 TraceCheckUtils]: 157: Hoare triple {34491#(<= ~counter~0 17)} assume !!(#t~post6 < 100);havoc #t~post6; {34491#(<= ~counter~0 17)} is VALID [2022-04-28 14:12:08,540 INFO L272 TraceCheckUtils]: 158: Hoare triple {34491#(<= ~counter~0 17)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {34491#(<= ~counter~0 17)} is VALID [2022-04-28 14:12:08,541 INFO L290 TraceCheckUtils]: 159: Hoare triple {34491#(<= ~counter~0 17)} ~cond := #in~cond; {34491#(<= ~counter~0 17)} is VALID [2022-04-28 14:12:08,541 INFO L290 TraceCheckUtils]: 160: Hoare triple {34491#(<= ~counter~0 17)} assume !(0 == ~cond); {34491#(<= ~counter~0 17)} is VALID [2022-04-28 14:12:08,541 INFO L290 TraceCheckUtils]: 161: Hoare triple {34491#(<= ~counter~0 17)} assume true; {34491#(<= ~counter~0 17)} is VALID [2022-04-28 14:12:08,542 INFO L284 TraceCheckUtils]: 162: Hoare quadruple {34491#(<= ~counter~0 17)} {34491#(<= ~counter~0 17)} #71#return; {34491#(<= ~counter~0 17)} is VALID [2022-04-28 14:12:08,542 INFO L290 TraceCheckUtils]: 163: Hoare triple {34491#(<= ~counter~0 17)} assume !!(0 != ~a~0 && 0 != ~b~0); {34491#(<= ~counter~0 17)} is VALID [2022-04-28 14:12:08,542 INFO L290 TraceCheckUtils]: 164: Hoare triple {34491#(<= ~counter~0 17)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {34491#(<= ~counter~0 17)} is VALID [2022-04-28 14:12:08,543 INFO L290 TraceCheckUtils]: 165: Hoare triple {34491#(<= ~counter~0 17)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {34519#(<= ~counter~0 18)} is VALID [2022-04-28 14:12:08,543 INFO L290 TraceCheckUtils]: 166: Hoare triple {34519#(<= ~counter~0 18)} assume !!(#t~post6 < 100);havoc #t~post6; {34519#(<= ~counter~0 18)} is VALID [2022-04-28 14:12:08,544 INFO L272 TraceCheckUtils]: 167: Hoare triple {34519#(<= ~counter~0 18)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {34519#(<= ~counter~0 18)} is VALID [2022-04-28 14:12:08,544 INFO L290 TraceCheckUtils]: 168: Hoare triple {34519#(<= ~counter~0 18)} ~cond := #in~cond; {34519#(<= ~counter~0 18)} is VALID [2022-04-28 14:12:08,544 INFO L290 TraceCheckUtils]: 169: Hoare triple {34519#(<= ~counter~0 18)} assume !(0 == ~cond); {34519#(<= ~counter~0 18)} is VALID [2022-04-28 14:12:08,544 INFO L290 TraceCheckUtils]: 170: Hoare triple {34519#(<= ~counter~0 18)} assume true; {34519#(<= ~counter~0 18)} is VALID [2022-04-28 14:12:08,545 INFO L284 TraceCheckUtils]: 171: Hoare quadruple {34519#(<= ~counter~0 18)} {34519#(<= ~counter~0 18)} #71#return; {34519#(<= ~counter~0 18)} is VALID [2022-04-28 14:12:08,545 INFO L290 TraceCheckUtils]: 172: Hoare triple {34519#(<= ~counter~0 18)} assume !!(0 != ~a~0 && 0 != ~b~0); {34519#(<= ~counter~0 18)} is VALID [2022-04-28 14:12:08,545 INFO L290 TraceCheckUtils]: 173: Hoare triple {34519#(<= ~counter~0 18)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {34519#(<= ~counter~0 18)} is VALID [2022-04-28 14:12:08,546 INFO L290 TraceCheckUtils]: 174: Hoare triple {34519#(<= ~counter~0 18)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {34547#(<= |main_#t~post6| 18)} is VALID [2022-04-28 14:12:08,546 INFO L290 TraceCheckUtils]: 175: Hoare triple {34547#(<= |main_#t~post6| 18)} assume !(#t~post6 < 100);havoc #t~post6; {34002#false} is VALID [2022-04-28 14:12:08,546 INFO L272 TraceCheckUtils]: 176: Hoare triple {34002#false} call __VERIFIER_assert((if ~q~0 == ~x~0 * ~y~0 then 1 else 0)); {34002#false} is VALID [2022-04-28 14:12:08,546 INFO L290 TraceCheckUtils]: 177: Hoare triple {34002#false} ~cond := #in~cond; {34002#false} is VALID [2022-04-28 14:12:08,546 INFO L290 TraceCheckUtils]: 178: Hoare triple {34002#false} assume 0 == ~cond; {34002#false} is VALID [2022-04-28 14:12:08,546 INFO L290 TraceCheckUtils]: 179: Hoare triple {34002#false} assume !false; {34002#false} is VALID [2022-04-28 14:12:08,547 INFO L134 CoverageAnalysis]: Checked inductivity of 1449 backedges. 36 proven. 1413 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 14:12:08,547 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 14:12:09,683 INFO L290 TraceCheckUtils]: 179: Hoare triple {34002#false} assume !false; {34002#false} is VALID [2022-04-28 14:12:09,683 INFO L290 TraceCheckUtils]: 178: Hoare triple {34002#false} assume 0 == ~cond; {34002#false} is VALID [2022-04-28 14:12:09,683 INFO L290 TraceCheckUtils]: 177: Hoare triple {34002#false} ~cond := #in~cond; {34002#false} is VALID [2022-04-28 14:12:09,684 INFO L272 TraceCheckUtils]: 176: Hoare triple {34002#false} call __VERIFIER_assert((if ~q~0 == ~x~0 * ~y~0 then 1 else 0)); {34002#false} is VALID [2022-04-28 14:12:09,684 INFO L290 TraceCheckUtils]: 175: Hoare triple {34575#(< |main_#t~post6| 100)} assume !(#t~post6 < 100);havoc #t~post6; {34002#false} is VALID [2022-04-28 14:12:09,684 INFO L290 TraceCheckUtils]: 174: Hoare triple {34579#(< ~counter~0 100)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {34575#(< |main_#t~post6| 100)} is VALID [2022-04-28 14:12:09,684 INFO L290 TraceCheckUtils]: 173: Hoare triple {34579#(< ~counter~0 100)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {34579#(< ~counter~0 100)} is VALID [2022-04-28 14:12:09,685 INFO L290 TraceCheckUtils]: 172: Hoare triple {34579#(< ~counter~0 100)} assume !!(0 != ~a~0 && 0 != ~b~0); {34579#(< ~counter~0 100)} is VALID [2022-04-28 14:12:09,685 INFO L284 TraceCheckUtils]: 171: Hoare quadruple {34001#true} {34579#(< ~counter~0 100)} #71#return; {34579#(< ~counter~0 100)} is VALID [2022-04-28 14:12:09,685 INFO L290 TraceCheckUtils]: 170: Hoare triple {34001#true} assume true; {34001#true} is VALID [2022-04-28 14:12:09,685 INFO L290 TraceCheckUtils]: 169: Hoare triple {34001#true} assume !(0 == ~cond); {34001#true} is VALID [2022-04-28 14:12:09,685 INFO L290 TraceCheckUtils]: 168: Hoare triple {34001#true} ~cond := #in~cond; {34001#true} is VALID [2022-04-28 14:12:09,685 INFO L272 TraceCheckUtils]: 167: Hoare triple {34579#(< ~counter~0 100)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {34001#true} is VALID [2022-04-28 14:12:09,686 INFO L290 TraceCheckUtils]: 166: Hoare triple {34579#(< ~counter~0 100)} assume !!(#t~post6 < 100);havoc #t~post6; {34579#(< ~counter~0 100)} is VALID [2022-04-28 14:12:09,686 INFO L290 TraceCheckUtils]: 165: Hoare triple {34607#(< ~counter~0 99)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {34579#(< ~counter~0 100)} is VALID [2022-04-28 14:12:09,687 INFO L290 TraceCheckUtils]: 164: Hoare triple {34607#(< ~counter~0 99)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {34607#(< ~counter~0 99)} is VALID [2022-04-28 14:12:09,687 INFO L290 TraceCheckUtils]: 163: Hoare triple {34607#(< ~counter~0 99)} assume !!(0 != ~a~0 && 0 != ~b~0); {34607#(< ~counter~0 99)} is VALID [2022-04-28 14:12:09,687 INFO L284 TraceCheckUtils]: 162: Hoare quadruple {34001#true} {34607#(< ~counter~0 99)} #71#return; {34607#(< ~counter~0 99)} is VALID [2022-04-28 14:12:09,688 INFO L290 TraceCheckUtils]: 161: Hoare triple {34001#true} assume true; {34001#true} is VALID [2022-04-28 14:12:09,688 INFO L290 TraceCheckUtils]: 160: Hoare triple {34001#true} assume !(0 == ~cond); {34001#true} is VALID [2022-04-28 14:12:09,688 INFO L290 TraceCheckUtils]: 159: Hoare triple {34001#true} ~cond := #in~cond; {34001#true} is VALID [2022-04-28 14:12:09,688 INFO L272 TraceCheckUtils]: 158: Hoare triple {34607#(< ~counter~0 99)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {34001#true} is VALID [2022-04-28 14:12:09,688 INFO L290 TraceCheckUtils]: 157: Hoare triple {34607#(< ~counter~0 99)} assume !!(#t~post6 < 100);havoc #t~post6; {34607#(< ~counter~0 99)} is VALID [2022-04-28 14:12:09,688 INFO L290 TraceCheckUtils]: 156: Hoare triple {34635#(< ~counter~0 98)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {34607#(< ~counter~0 99)} is VALID [2022-04-28 14:12:09,689 INFO L290 TraceCheckUtils]: 155: Hoare triple {34635#(< ~counter~0 98)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {34635#(< ~counter~0 98)} is VALID [2022-04-28 14:12:09,689 INFO L290 TraceCheckUtils]: 154: Hoare triple {34635#(< ~counter~0 98)} assume !!(0 != ~a~0 && 0 != ~b~0); {34635#(< ~counter~0 98)} is VALID [2022-04-28 14:12:09,689 INFO L284 TraceCheckUtils]: 153: Hoare quadruple {34001#true} {34635#(< ~counter~0 98)} #71#return; {34635#(< ~counter~0 98)} is VALID [2022-04-28 14:12:09,689 INFO L290 TraceCheckUtils]: 152: Hoare triple {34001#true} assume true; {34001#true} is VALID [2022-04-28 14:12:09,690 INFO L290 TraceCheckUtils]: 151: Hoare triple {34001#true} assume !(0 == ~cond); {34001#true} is VALID [2022-04-28 14:12:09,690 INFO L290 TraceCheckUtils]: 150: Hoare triple {34001#true} ~cond := #in~cond; {34001#true} is VALID [2022-04-28 14:12:09,690 INFO L272 TraceCheckUtils]: 149: Hoare triple {34635#(< ~counter~0 98)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {34001#true} is VALID [2022-04-28 14:12:09,690 INFO L290 TraceCheckUtils]: 148: Hoare triple {34635#(< ~counter~0 98)} assume !!(#t~post6 < 100);havoc #t~post6; {34635#(< ~counter~0 98)} is VALID [2022-04-28 14:12:09,690 INFO L290 TraceCheckUtils]: 147: Hoare triple {34663#(< ~counter~0 97)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {34635#(< ~counter~0 98)} is VALID [2022-04-28 14:12:09,691 INFO L290 TraceCheckUtils]: 146: Hoare triple {34663#(< ~counter~0 97)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {34663#(< ~counter~0 97)} is VALID [2022-04-28 14:12:09,691 INFO L290 TraceCheckUtils]: 145: Hoare triple {34663#(< ~counter~0 97)} assume !!(0 != ~a~0 && 0 != ~b~0); {34663#(< ~counter~0 97)} is VALID [2022-04-28 14:12:09,691 INFO L284 TraceCheckUtils]: 144: Hoare quadruple {34001#true} {34663#(< ~counter~0 97)} #71#return; {34663#(< ~counter~0 97)} is VALID [2022-04-28 14:12:09,691 INFO L290 TraceCheckUtils]: 143: Hoare triple {34001#true} assume true; {34001#true} is VALID [2022-04-28 14:12:09,692 INFO L290 TraceCheckUtils]: 142: Hoare triple {34001#true} assume !(0 == ~cond); {34001#true} is VALID [2022-04-28 14:12:09,692 INFO L290 TraceCheckUtils]: 141: Hoare triple {34001#true} ~cond := #in~cond; {34001#true} is VALID [2022-04-28 14:12:09,692 INFO L272 TraceCheckUtils]: 140: Hoare triple {34663#(< ~counter~0 97)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {34001#true} is VALID [2022-04-28 14:12:09,692 INFO L290 TraceCheckUtils]: 139: Hoare triple {34663#(< ~counter~0 97)} assume !!(#t~post6 < 100);havoc #t~post6; {34663#(< ~counter~0 97)} is VALID [2022-04-28 14:12:09,692 INFO L290 TraceCheckUtils]: 138: Hoare triple {34691#(< ~counter~0 96)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {34663#(< ~counter~0 97)} is VALID [2022-04-28 14:12:09,693 INFO L290 TraceCheckUtils]: 137: Hoare triple {34691#(< ~counter~0 96)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {34691#(< ~counter~0 96)} is VALID [2022-04-28 14:12:09,693 INFO L290 TraceCheckUtils]: 136: Hoare triple {34691#(< ~counter~0 96)} assume !!(0 != ~a~0 && 0 != ~b~0); {34691#(< ~counter~0 96)} is VALID [2022-04-28 14:12:09,693 INFO L284 TraceCheckUtils]: 135: Hoare quadruple {34001#true} {34691#(< ~counter~0 96)} #71#return; {34691#(< ~counter~0 96)} is VALID [2022-04-28 14:12:09,693 INFO L290 TraceCheckUtils]: 134: Hoare triple {34001#true} assume true; {34001#true} is VALID [2022-04-28 14:12:09,693 INFO L290 TraceCheckUtils]: 133: Hoare triple {34001#true} assume !(0 == ~cond); {34001#true} is VALID [2022-04-28 14:12:09,694 INFO L290 TraceCheckUtils]: 132: Hoare triple {34001#true} ~cond := #in~cond; {34001#true} is VALID [2022-04-28 14:12:09,694 INFO L272 TraceCheckUtils]: 131: Hoare triple {34691#(< ~counter~0 96)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {34001#true} is VALID [2022-04-28 14:12:09,694 INFO L290 TraceCheckUtils]: 130: Hoare triple {34691#(< ~counter~0 96)} assume !!(#t~post6 < 100);havoc #t~post6; {34691#(< ~counter~0 96)} is VALID [2022-04-28 14:12:09,694 INFO L290 TraceCheckUtils]: 129: Hoare triple {34719#(< ~counter~0 95)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {34691#(< ~counter~0 96)} is VALID [2022-04-28 14:12:09,695 INFO L290 TraceCheckUtils]: 128: Hoare triple {34719#(< ~counter~0 95)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {34719#(< ~counter~0 95)} is VALID [2022-04-28 14:12:09,695 INFO L290 TraceCheckUtils]: 127: Hoare triple {34719#(< ~counter~0 95)} assume !!(0 != ~a~0 && 0 != ~b~0); {34719#(< ~counter~0 95)} is VALID [2022-04-28 14:12:09,695 INFO L284 TraceCheckUtils]: 126: Hoare quadruple {34001#true} {34719#(< ~counter~0 95)} #71#return; {34719#(< ~counter~0 95)} is VALID [2022-04-28 14:12:09,695 INFO L290 TraceCheckUtils]: 125: Hoare triple {34001#true} assume true; {34001#true} is VALID [2022-04-28 14:12:09,695 INFO L290 TraceCheckUtils]: 124: Hoare triple {34001#true} assume !(0 == ~cond); {34001#true} is VALID [2022-04-28 14:12:09,696 INFO L290 TraceCheckUtils]: 123: Hoare triple {34001#true} ~cond := #in~cond; {34001#true} is VALID [2022-04-28 14:12:09,696 INFO L272 TraceCheckUtils]: 122: Hoare triple {34719#(< ~counter~0 95)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {34001#true} is VALID [2022-04-28 14:12:09,696 INFO L290 TraceCheckUtils]: 121: Hoare triple {34719#(< ~counter~0 95)} assume !!(#t~post6 < 100);havoc #t~post6; {34719#(< ~counter~0 95)} is VALID [2022-04-28 14:12:09,696 INFO L290 TraceCheckUtils]: 120: Hoare triple {34747#(< ~counter~0 94)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {34719#(< ~counter~0 95)} is VALID [2022-04-28 14:12:09,697 INFO L290 TraceCheckUtils]: 119: Hoare triple {34747#(< ~counter~0 94)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {34747#(< ~counter~0 94)} is VALID [2022-04-28 14:12:09,697 INFO L290 TraceCheckUtils]: 118: Hoare triple {34747#(< ~counter~0 94)} assume !!(0 != ~a~0 && 0 != ~b~0); {34747#(< ~counter~0 94)} is VALID [2022-04-28 14:12:09,697 INFO L284 TraceCheckUtils]: 117: Hoare quadruple {34001#true} {34747#(< ~counter~0 94)} #71#return; {34747#(< ~counter~0 94)} is VALID [2022-04-28 14:12:09,697 INFO L290 TraceCheckUtils]: 116: Hoare triple {34001#true} assume true; {34001#true} is VALID [2022-04-28 14:12:09,697 INFO L290 TraceCheckUtils]: 115: Hoare triple {34001#true} assume !(0 == ~cond); {34001#true} is VALID [2022-04-28 14:12:09,697 INFO L290 TraceCheckUtils]: 114: Hoare triple {34001#true} ~cond := #in~cond; {34001#true} is VALID [2022-04-28 14:12:09,698 INFO L272 TraceCheckUtils]: 113: Hoare triple {34747#(< ~counter~0 94)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {34001#true} is VALID [2022-04-28 14:12:09,698 INFO L290 TraceCheckUtils]: 112: Hoare triple {34747#(< ~counter~0 94)} assume !!(#t~post6 < 100);havoc #t~post6; {34747#(< ~counter~0 94)} is VALID [2022-04-28 14:12:09,698 INFO L290 TraceCheckUtils]: 111: Hoare triple {34775#(< ~counter~0 93)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {34747#(< ~counter~0 94)} is VALID [2022-04-28 14:12:09,698 INFO L290 TraceCheckUtils]: 110: Hoare triple {34775#(< ~counter~0 93)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {34775#(< ~counter~0 93)} is VALID [2022-04-28 14:12:09,699 INFO L290 TraceCheckUtils]: 109: Hoare triple {34775#(< ~counter~0 93)} assume !!(0 != ~a~0 && 0 != ~b~0); {34775#(< ~counter~0 93)} is VALID [2022-04-28 14:12:09,699 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {34001#true} {34775#(< ~counter~0 93)} #71#return; {34775#(< ~counter~0 93)} is VALID [2022-04-28 14:12:09,699 INFO L290 TraceCheckUtils]: 107: Hoare triple {34001#true} assume true; {34001#true} is VALID [2022-04-28 14:12:09,699 INFO L290 TraceCheckUtils]: 106: Hoare triple {34001#true} assume !(0 == ~cond); {34001#true} is VALID [2022-04-28 14:12:09,699 INFO L290 TraceCheckUtils]: 105: Hoare triple {34001#true} ~cond := #in~cond; {34001#true} is VALID [2022-04-28 14:12:09,700 INFO L272 TraceCheckUtils]: 104: Hoare triple {34775#(< ~counter~0 93)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {34001#true} is VALID [2022-04-28 14:12:09,700 INFO L290 TraceCheckUtils]: 103: Hoare triple {34775#(< ~counter~0 93)} assume !!(#t~post6 < 100);havoc #t~post6; {34775#(< ~counter~0 93)} is VALID [2022-04-28 14:12:09,700 INFO L290 TraceCheckUtils]: 102: Hoare triple {34803#(< ~counter~0 92)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {34775#(< ~counter~0 93)} is VALID [2022-04-28 14:12:09,700 INFO L290 TraceCheckUtils]: 101: Hoare triple {34803#(< ~counter~0 92)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {34803#(< ~counter~0 92)} is VALID [2022-04-28 14:12:09,701 INFO L290 TraceCheckUtils]: 100: Hoare triple {34803#(< ~counter~0 92)} assume !!(0 != ~a~0 && 0 != ~b~0); {34803#(< ~counter~0 92)} is VALID [2022-04-28 14:12:09,701 INFO L284 TraceCheckUtils]: 99: Hoare quadruple {34001#true} {34803#(< ~counter~0 92)} #71#return; {34803#(< ~counter~0 92)} is VALID [2022-04-28 14:12:09,701 INFO L290 TraceCheckUtils]: 98: Hoare triple {34001#true} assume true; {34001#true} is VALID [2022-04-28 14:12:09,701 INFO L290 TraceCheckUtils]: 97: Hoare triple {34001#true} assume !(0 == ~cond); {34001#true} is VALID [2022-04-28 14:12:09,701 INFO L290 TraceCheckUtils]: 96: Hoare triple {34001#true} ~cond := #in~cond; {34001#true} is VALID [2022-04-28 14:12:09,701 INFO L272 TraceCheckUtils]: 95: Hoare triple {34803#(< ~counter~0 92)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {34001#true} is VALID [2022-04-28 14:12:09,707 INFO L290 TraceCheckUtils]: 94: Hoare triple {34803#(< ~counter~0 92)} assume !!(#t~post6 < 100);havoc #t~post6; {34803#(< ~counter~0 92)} is VALID [2022-04-28 14:12:09,708 INFO L290 TraceCheckUtils]: 93: Hoare triple {34831#(< ~counter~0 91)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {34803#(< ~counter~0 92)} is VALID [2022-04-28 14:12:09,708 INFO L290 TraceCheckUtils]: 92: Hoare triple {34831#(< ~counter~0 91)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {34831#(< ~counter~0 91)} is VALID [2022-04-28 14:12:09,708 INFO L290 TraceCheckUtils]: 91: Hoare triple {34831#(< ~counter~0 91)} assume !!(0 != ~a~0 && 0 != ~b~0); {34831#(< ~counter~0 91)} is VALID [2022-04-28 14:12:09,709 INFO L284 TraceCheckUtils]: 90: Hoare quadruple {34001#true} {34831#(< ~counter~0 91)} #71#return; {34831#(< ~counter~0 91)} is VALID [2022-04-28 14:12:09,709 INFO L290 TraceCheckUtils]: 89: Hoare triple {34001#true} assume true; {34001#true} is VALID [2022-04-28 14:12:09,709 INFO L290 TraceCheckUtils]: 88: Hoare triple {34001#true} assume !(0 == ~cond); {34001#true} is VALID [2022-04-28 14:12:09,709 INFO L290 TraceCheckUtils]: 87: Hoare triple {34001#true} ~cond := #in~cond; {34001#true} is VALID [2022-04-28 14:12:09,709 INFO L272 TraceCheckUtils]: 86: Hoare triple {34831#(< ~counter~0 91)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {34001#true} is VALID [2022-04-28 14:12:09,710 INFO L290 TraceCheckUtils]: 85: Hoare triple {34831#(< ~counter~0 91)} assume !!(#t~post6 < 100);havoc #t~post6; {34831#(< ~counter~0 91)} is VALID [2022-04-28 14:12:09,710 INFO L290 TraceCheckUtils]: 84: Hoare triple {34859#(< ~counter~0 90)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {34831#(< ~counter~0 91)} is VALID [2022-04-28 14:12:09,711 INFO L290 TraceCheckUtils]: 83: Hoare triple {34859#(< ~counter~0 90)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {34859#(< ~counter~0 90)} is VALID [2022-04-28 14:12:09,711 INFO L290 TraceCheckUtils]: 82: Hoare triple {34859#(< ~counter~0 90)} assume !!(0 != ~a~0 && 0 != ~b~0); {34859#(< ~counter~0 90)} is VALID [2022-04-28 14:12:09,712 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {34001#true} {34859#(< ~counter~0 90)} #71#return; {34859#(< ~counter~0 90)} is VALID [2022-04-28 14:12:09,712 INFO L290 TraceCheckUtils]: 80: Hoare triple {34001#true} assume true; {34001#true} is VALID [2022-04-28 14:12:09,712 INFO L290 TraceCheckUtils]: 79: Hoare triple {34001#true} assume !(0 == ~cond); {34001#true} is VALID [2022-04-28 14:12:09,712 INFO L290 TraceCheckUtils]: 78: Hoare triple {34001#true} ~cond := #in~cond; {34001#true} is VALID [2022-04-28 14:12:09,712 INFO L272 TraceCheckUtils]: 77: Hoare triple {34859#(< ~counter~0 90)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {34001#true} is VALID [2022-04-28 14:12:09,712 INFO L290 TraceCheckUtils]: 76: Hoare triple {34859#(< ~counter~0 90)} assume !!(#t~post6 < 100);havoc #t~post6; {34859#(< ~counter~0 90)} is VALID [2022-04-28 14:12:09,713 INFO L290 TraceCheckUtils]: 75: Hoare triple {34887#(< ~counter~0 89)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {34859#(< ~counter~0 90)} is VALID [2022-04-28 14:12:09,713 INFO L290 TraceCheckUtils]: 74: Hoare triple {34887#(< ~counter~0 89)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {34887#(< ~counter~0 89)} is VALID [2022-04-28 14:12:09,714 INFO L290 TraceCheckUtils]: 73: Hoare triple {34887#(< ~counter~0 89)} assume !!(0 != ~a~0 && 0 != ~b~0); {34887#(< ~counter~0 89)} is VALID [2022-04-28 14:12:09,714 INFO L284 TraceCheckUtils]: 72: Hoare quadruple {34001#true} {34887#(< ~counter~0 89)} #71#return; {34887#(< ~counter~0 89)} is VALID [2022-04-28 14:12:09,714 INFO L290 TraceCheckUtils]: 71: Hoare triple {34001#true} assume true; {34001#true} is VALID [2022-04-28 14:12:09,715 INFO L290 TraceCheckUtils]: 70: Hoare triple {34001#true} assume !(0 == ~cond); {34001#true} is VALID [2022-04-28 14:12:09,715 INFO L290 TraceCheckUtils]: 69: Hoare triple {34001#true} ~cond := #in~cond; {34001#true} is VALID [2022-04-28 14:12:09,715 INFO L272 TraceCheckUtils]: 68: Hoare triple {34887#(< ~counter~0 89)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {34001#true} is VALID [2022-04-28 14:12:09,715 INFO L290 TraceCheckUtils]: 67: Hoare triple {34887#(< ~counter~0 89)} assume !!(#t~post6 < 100);havoc #t~post6; {34887#(< ~counter~0 89)} is VALID [2022-04-28 14:12:09,716 INFO L290 TraceCheckUtils]: 66: Hoare triple {34915#(< ~counter~0 88)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {34887#(< ~counter~0 89)} is VALID [2022-04-28 14:12:09,716 INFO L290 TraceCheckUtils]: 65: Hoare triple {34915#(< ~counter~0 88)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {34915#(< ~counter~0 88)} is VALID [2022-04-28 14:12:09,716 INFO L290 TraceCheckUtils]: 64: Hoare triple {34915#(< ~counter~0 88)} assume !!(0 != ~a~0 && 0 != ~b~0); {34915#(< ~counter~0 88)} is VALID [2022-04-28 14:12:09,717 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {34001#true} {34915#(< ~counter~0 88)} #71#return; {34915#(< ~counter~0 88)} is VALID [2022-04-28 14:12:09,717 INFO L290 TraceCheckUtils]: 62: Hoare triple {34001#true} assume true; {34001#true} is VALID [2022-04-28 14:12:09,717 INFO L290 TraceCheckUtils]: 61: Hoare triple {34001#true} assume !(0 == ~cond); {34001#true} is VALID [2022-04-28 14:12:09,717 INFO L290 TraceCheckUtils]: 60: Hoare triple {34001#true} ~cond := #in~cond; {34001#true} is VALID [2022-04-28 14:12:09,717 INFO L272 TraceCheckUtils]: 59: Hoare triple {34915#(< ~counter~0 88)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {34001#true} is VALID [2022-04-28 14:12:09,718 INFO L290 TraceCheckUtils]: 58: Hoare triple {34915#(< ~counter~0 88)} assume !!(#t~post6 < 100);havoc #t~post6; {34915#(< ~counter~0 88)} is VALID [2022-04-28 14:12:09,718 INFO L290 TraceCheckUtils]: 57: Hoare triple {34943#(< ~counter~0 87)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {34915#(< ~counter~0 88)} is VALID [2022-04-28 14:12:09,719 INFO L290 TraceCheckUtils]: 56: Hoare triple {34943#(< ~counter~0 87)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {34943#(< ~counter~0 87)} is VALID [2022-04-28 14:12:09,719 INFO L290 TraceCheckUtils]: 55: Hoare triple {34943#(< ~counter~0 87)} assume !!(0 != ~a~0 && 0 != ~b~0); {34943#(< ~counter~0 87)} is VALID [2022-04-28 14:12:09,720 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {34001#true} {34943#(< ~counter~0 87)} #71#return; {34943#(< ~counter~0 87)} is VALID [2022-04-28 14:12:09,720 INFO L290 TraceCheckUtils]: 53: Hoare triple {34001#true} assume true; {34001#true} is VALID [2022-04-28 14:12:09,720 INFO L290 TraceCheckUtils]: 52: Hoare triple {34001#true} assume !(0 == ~cond); {34001#true} is VALID [2022-04-28 14:12:09,720 INFO L290 TraceCheckUtils]: 51: Hoare triple {34001#true} ~cond := #in~cond; {34001#true} is VALID [2022-04-28 14:12:09,720 INFO L272 TraceCheckUtils]: 50: Hoare triple {34943#(< ~counter~0 87)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {34001#true} is VALID [2022-04-28 14:12:09,720 INFO L290 TraceCheckUtils]: 49: Hoare triple {34943#(< ~counter~0 87)} assume !!(#t~post6 < 100);havoc #t~post6; {34943#(< ~counter~0 87)} is VALID [2022-04-28 14:12:09,721 INFO L290 TraceCheckUtils]: 48: Hoare triple {34971#(< ~counter~0 86)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {34943#(< ~counter~0 87)} is VALID [2022-04-28 14:12:09,721 INFO L290 TraceCheckUtils]: 47: Hoare triple {34971#(< ~counter~0 86)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {34971#(< ~counter~0 86)} is VALID [2022-04-28 14:12:09,722 INFO L290 TraceCheckUtils]: 46: Hoare triple {34971#(< ~counter~0 86)} assume !!(0 != ~a~0 && 0 != ~b~0); {34971#(< ~counter~0 86)} is VALID [2022-04-28 14:12:09,722 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {34001#true} {34971#(< ~counter~0 86)} #71#return; {34971#(< ~counter~0 86)} is VALID [2022-04-28 14:12:09,723 INFO L290 TraceCheckUtils]: 44: Hoare triple {34001#true} assume true; {34001#true} is VALID [2022-04-28 14:12:09,723 INFO L290 TraceCheckUtils]: 43: Hoare triple {34001#true} assume !(0 == ~cond); {34001#true} is VALID [2022-04-28 14:12:09,723 INFO L290 TraceCheckUtils]: 42: Hoare triple {34001#true} ~cond := #in~cond; {34001#true} is VALID [2022-04-28 14:12:09,723 INFO L272 TraceCheckUtils]: 41: Hoare triple {34971#(< ~counter~0 86)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {34001#true} is VALID [2022-04-28 14:12:09,723 INFO L290 TraceCheckUtils]: 40: Hoare triple {34971#(< ~counter~0 86)} assume !!(#t~post6 < 100);havoc #t~post6; {34971#(< ~counter~0 86)} is VALID [2022-04-28 14:12:09,724 INFO L290 TraceCheckUtils]: 39: Hoare triple {34999#(< ~counter~0 85)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {34971#(< ~counter~0 86)} is VALID [2022-04-28 14:12:09,724 INFO L290 TraceCheckUtils]: 38: Hoare triple {34999#(< ~counter~0 85)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {34999#(< ~counter~0 85)} is VALID [2022-04-28 14:12:09,724 INFO L290 TraceCheckUtils]: 37: Hoare triple {34999#(< ~counter~0 85)} assume !!(0 != ~a~0 && 0 != ~b~0); {34999#(< ~counter~0 85)} is VALID [2022-04-28 14:12:09,725 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {34001#true} {34999#(< ~counter~0 85)} #71#return; {34999#(< ~counter~0 85)} is VALID [2022-04-28 14:12:09,725 INFO L290 TraceCheckUtils]: 35: Hoare triple {34001#true} assume true; {34001#true} is VALID [2022-04-28 14:12:09,725 INFO L290 TraceCheckUtils]: 34: Hoare triple {34001#true} assume !(0 == ~cond); {34001#true} is VALID [2022-04-28 14:12:09,725 INFO L290 TraceCheckUtils]: 33: Hoare triple {34001#true} ~cond := #in~cond; {34001#true} is VALID [2022-04-28 14:12:09,725 INFO L272 TraceCheckUtils]: 32: Hoare triple {34999#(< ~counter~0 85)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {34001#true} is VALID [2022-04-28 14:12:09,726 INFO L290 TraceCheckUtils]: 31: Hoare triple {34999#(< ~counter~0 85)} assume !!(#t~post6 < 100);havoc #t~post6; {34999#(< ~counter~0 85)} is VALID [2022-04-28 14:12:09,726 INFO L290 TraceCheckUtils]: 30: Hoare triple {35027#(< ~counter~0 84)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {34999#(< ~counter~0 85)} is VALID [2022-04-28 14:12:09,727 INFO L290 TraceCheckUtils]: 29: Hoare triple {35027#(< ~counter~0 84)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {35027#(< ~counter~0 84)} is VALID [2022-04-28 14:12:09,727 INFO L290 TraceCheckUtils]: 28: Hoare triple {35027#(< ~counter~0 84)} assume !!(0 != ~a~0 && 0 != ~b~0); {35027#(< ~counter~0 84)} is VALID [2022-04-28 14:12:09,728 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {34001#true} {35027#(< ~counter~0 84)} #71#return; {35027#(< ~counter~0 84)} is VALID [2022-04-28 14:12:09,728 INFO L290 TraceCheckUtils]: 26: Hoare triple {34001#true} assume true; {34001#true} is VALID [2022-04-28 14:12:09,728 INFO L290 TraceCheckUtils]: 25: Hoare triple {34001#true} assume !(0 == ~cond); {34001#true} is VALID [2022-04-28 14:12:09,728 INFO L290 TraceCheckUtils]: 24: Hoare triple {34001#true} ~cond := #in~cond; {34001#true} is VALID [2022-04-28 14:12:09,728 INFO L272 TraceCheckUtils]: 23: Hoare triple {35027#(< ~counter~0 84)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {34001#true} is VALID [2022-04-28 14:12:09,728 INFO L290 TraceCheckUtils]: 22: Hoare triple {35027#(< ~counter~0 84)} assume !!(#t~post6 < 100);havoc #t~post6; {35027#(< ~counter~0 84)} is VALID [2022-04-28 14:12:09,729 INFO L290 TraceCheckUtils]: 21: Hoare triple {35055#(< ~counter~0 83)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {35027#(< ~counter~0 84)} is VALID [2022-04-28 14:12:09,729 INFO L290 TraceCheckUtils]: 20: Hoare triple {35055#(< ~counter~0 83)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {35055#(< ~counter~0 83)} is VALID [2022-04-28 14:12:09,729 INFO L290 TraceCheckUtils]: 19: Hoare triple {35055#(< ~counter~0 83)} assume !!(0 != ~a~0 && 0 != ~b~0); {35055#(< ~counter~0 83)} is VALID [2022-04-28 14:12:09,730 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {34001#true} {35055#(< ~counter~0 83)} #71#return; {35055#(< ~counter~0 83)} is VALID [2022-04-28 14:12:09,730 INFO L290 TraceCheckUtils]: 17: Hoare triple {34001#true} assume true; {34001#true} is VALID [2022-04-28 14:12:09,730 INFO L290 TraceCheckUtils]: 16: Hoare triple {34001#true} assume !(0 == ~cond); {34001#true} is VALID [2022-04-28 14:12:09,730 INFO L290 TraceCheckUtils]: 15: Hoare triple {34001#true} ~cond := #in~cond; {34001#true} is VALID [2022-04-28 14:12:09,730 INFO L272 TraceCheckUtils]: 14: Hoare triple {35055#(< ~counter~0 83)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {34001#true} is VALID [2022-04-28 14:12:09,731 INFO L290 TraceCheckUtils]: 13: Hoare triple {35055#(< ~counter~0 83)} assume !!(#t~post6 < 100);havoc #t~post6; {35055#(< ~counter~0 83)} is VALID [2022-04-28 14:12:09,731 INFO L290 TraceCheckUtils]: 12: Hoare triple {35083#(< ~counter~0 82)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {35055#(< ~counter~0 83)} is VALID [2022-04-28 14:12:09,732 INFO L290 TraceCheckUtils]: 11: Hoare triple {35083#(< ~counter~0 82)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {35083#(< ~counter~0 82)} is VALID [2022-04-28 14:12:09,732 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {34001#true} {35083#(< ~counter~0 82)} #69#return; {35083#(< ~counter~0 82)} is VALID [2022-04-28 14:12:09,732 INFO L290 TraceCheckUtils]: 9: Hoare triple {34001#true} assume true; {34001#true} is VALID [2022-04-28 14:12:09,732 INFO L290 TraceCheckUtils]: 8: Hoare triple {34001#true} assume !(0 == ~cond); {34001#true} is VALID [2022-04-28 14:12:09,732 INFO L290 TraceCheckUtils]: 7: Hoare triple {34001#true} ~cond := #in~cond; {34001#true} is VALID [2022-04-28 14:12:09,732 INFO L272 TraceCheckUtils]: 6: Hoare triple {35083#(< ~counter~0 82)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {34001#true} is VALID [2022-04-28 14:12:09,733 INFO L290 TraceCheckUtils]: 5: Hoare triple {35083#(< ~counter~0 82)} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {35083#(< ~counter~0 82)} is VALID [2022-04-28 14:12:09,733 INFO L272 TraceCheckUtils]: 4: Hoare triple {35083#(< ~counter~0 82)} call #t~ret7 := main(); {35083#(< ~counter~0 82)} is VALID [2022-04-28 14:12:09,733 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35083#(< ~counter~0 82)} {34001#true} #77#return; {35083#(< ~counter~0 82)} is VALID [2022-04-28 14:12:09,734 INFO L290 TraceCheckUtils]: 2: Hoare triple {35083#(< ~counter~0 82)} assume true; {35083#(< ~counter~0 82)} is VALID [2022-04-28 14:12:09,734 INFO L290 TraceCheckUtils]: 1: Hoare triple {34001#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(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {35083#(< ~counter~0 82)} is VALID [2022-04-28 14:12:09,734 INFO L272 TraceCheckUtils]: 0: Hoare triple {34001#true} call ULTIMATE.init(); {34001#true} is VALID [2022-04-28 14:12:09,735 INFO L134 CoverageAnalysis]: Checked inductivity of 1449 backedges. 36 proven. 801 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2022-04-28 14:12:09,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:12:09,735 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [807033467] [2022-04-28 14:12:09,736 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 14:12:09,736 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [533508772] [2022-04-28 14:12:09,736 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [533508772] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 14:12:09,736 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 14:12:09,736 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 42 [2022-04-28 14:12:09,736 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:12:09,736 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [66666087] [2022-04-28 14:12:09,737 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [66666087] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:12:09,737 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:12:09,737 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2022-04-28 14:12:09,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1482870396] [2022-04-28 14:12:09,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:12:09,739 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 6.2727272727272725) internal successors, (138), 21 states have internal predecessors, (138), 21 states have call successors, (22), 21 states have call predecessors, (22), 19 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) Word has length 180 [2022-04-28 14:12:09,739 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:12:09,739 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 22 states, 22 states have (on average 6.2727272727272725) internal successors, (138), 21 states have internal predecessors, (138), 21 states have call successors, (22), 21 states have call predecessors, (22), 19 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) [2022-04-28 14:12:09,891 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 180 edges. 180 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:12:09,891 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-04-28 14:12:09,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:12:09,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-04-28 14:12:09,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=785, Invalid=937, Unknown=0, NotChecked=0, Total=1722 [2022-04-28 14:12:09,892 INFO L87 Difference]: Start difference. First operand 230 states and 286 transitions. Second operand has 22 states, 22 states have (on average 6.2727272727272725) internal successors, (138), 21 states have internal predecessors, (138), 21 states have call successors, (22), 21 states have call predecessors, (22), 19 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) [2022-04-28 14:12:11,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:12:11,057 INFO L93 Difference]: Finished difference Result 249 states and 309 transitions. [2022-04-28 14:12:11,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-04-28 14:12:11,058 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 6.2727272727272725) internal successors, (138), 21 states have internal predecessors, (138), 21 states have call successors, (22), 21 states have call predecessors, (22), 19 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) Word has length 180 [2022-04-28 14:12:11,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:12:11,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 6.2727272727272725) internal successors, (138), 21 states have internal predecessors, (138), 21 states have call successors, (22), 21 states have call predecessors, (22), 19 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) [2022-04-28 14:12:11,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 295 transitions. [2022-04-28 14:12:11,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 6.2727272727272725) internal successors, (138), 21 states have internal predecessors, (138), 21 states have call successors, (22), 21 states have call predecessors, (22), 19 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) [2022-04-28 14:12:11,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 295 transitions. [2022-04-28 14:12:11,066 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 40 states and 295 transitions. [2022-04-28 14:12:11,387 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 295 edges. 295 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:12:11,390 INFO L225 Difference]: With dead ends: 249 [2022-04-28 14:12:11,390 INFO L226 Difference]: Without dead ends: 241 [2022-04-28 14:12:11,391 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 377 GetRequests, 319 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 208 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1523, Invalid=2017, Unknown=0, NotChecked=0, Total=3540 [2022-04-28 14:12:11,391 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 224 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 224 SdHoareTripleChecker+Valid, 318 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 14:12:11,391 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [224 Valid, 318 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 14:12:11,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2022-04-28 14:12:11,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 241. [2022-04-28 14:12:11,911 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:12:11,911 INFO L82 GeneralOperation]: Start isEquivalent. First operand 241 states. Second operand has 241 states, 192 states have (on average 1.3125) internal successors, (252), 193 states have internal predecessors, (252), 25 states have call successors, (25), 24 states have call predecessors, (25), 23 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-28 14:12:11,912 INFO L74 IsIncluded]: Start isIncluded. First operand 241 states. Second operand has 241 states, 192 states have (on average 1.3125) internal successors, (252), 193 states have internal predecessors, (252), 25 states have call successors, (25), 24 states have call predecessors, (25), 23 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-28 14:12:11,912 INFO L87 Difference]: Start difference. First operand 241 states. Second operand has 241 states, 192 states have (on average 1.3125) internal successors, (252), 193 states have internal predecessors, (252), 25 states have call successors, (25), 24 states have call predecessors, (25), 23 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-28 14:12:11,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:12:11,915 INFO L93 Difference]: Finished difference Result 241 states and 300 transitions. [2022-04-28 14:12:11,915 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 300 transitions. [2022-04-28 14:12:11,916 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:12:11,916 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:12:11,916 INFO L74 IsIncluded]: Start isIncluded. First operand has 241 states, 192 states have (on average 1.3125) internal successors, (252), 193 states have internal predecessors, (252), 25 states have call successors, (25), 24 states have call predecessors, (25), 23 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand 241 states. [2022-04-28 14:12:11,916 INFO L87 Difference]: Start difference. First operand has 241 states, 192 states have (on average 1.3125) internal successors, (252), 193 states have internal predecessors, (252), 25 states have call successors, (25), 24 states have call predecessors, (25), 23 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand 241 states. [2022-04-28 14:12:11,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:12:11,920 INFO L93 Difference]: Finished difference Result 241 states and 300 transitions. [2022-04-28 14:12:11,920 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 300 transitions. [2022-04-28 14:12:11,920 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:12:11,920 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:12:11,920 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:12:11,921 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:12:11,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 241 states, 192 states have (on average 1.3125) internal successors, (252), 193 states have internal predecessors, (252), 25 states have call successors, (25), 24 states have call predecessors, (25), 23 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-28 14:12:11,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 300 transitions. [2022-04-28 14:12:11,925 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 300 transitions. Word has length 180 [2022-04-28 14:12:11,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:12:11,926 INFO L495 AbstractCegarLoop]: Abstraction has 241 states and 300 transitions. [2022-04-28 14:12:11,926 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 6.2727272727272725) internal successors, (138), 21 states have internal predecessors, (138), 21 states have call successors, (22), 21 states have call predecessors, (22), 19 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) [2022-04-28 14:12:11,926 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 241 states and 300 transitions.