/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf -i ../../../trunk/examples/svcomp/nla-digbench-scaling/bresenham-ll_valuebound10.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-15 07:36:10,419 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-15 07:36:10,421 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-15 07:36:10,441 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-15 07:36:10,441 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-15 07:36:10,442 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-15 07:36:10,443 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-15 07:36:10,444 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-15 07:36:10,445 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-15 07:36:10,446 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-15 07:36:10,446 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-15 07:36:10,453 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-15 07:36:10,453 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-15 07:36:10,456 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-15 07:36:10,457 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-15 07:36:10,457 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-15 07:36:10,458 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-15 07:36:10,458 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-15 07:36:10,459 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-15 07:36:10,460 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-15 07:36:10,461 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-15 07:36:10,472 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-15 07:36:10,473 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-15 07:36:10,474 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-15 07:36:10,475 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-15 07:36:10,482 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-15 07:36:10,483 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-15 07:36:10,483 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-15 07:36:10,483 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-15 07:36:10,483 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-15 07:36:10,484 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-15 07:36:10,484 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-15 07:36:10,484 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-15 07:36:10,485 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-15 07:36:10,485 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-15 07:36:10,486 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-15 07:36:10,486 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-15 07:36:10,486 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-15 07:36:10,486 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-15 07:36:10,486 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-15 07:36:10,487 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-15 07:36:10,493 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-15 07:36:10,493 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-04-15 07:36:10,498 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-15 07:36:10,498 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-15 07:36:10,499 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-15 07:36:10,499 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-15 07:36:10,499 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-15 07:36:10,499 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-15 07:36:10,499 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-15 07:36:10,499 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-15 07:36:10,499 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-15 07:36:10,500 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-15 07:36:10,500 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-15 07:36:10,500 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-15 07:36:10,500 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-15 07:36:10,500 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-15 07:36:10,500 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-15 07:36:10,500 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-15 07:36:10,500 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-15 07:36:10,500 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-15 07:36:10,500 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 07:36:10,500 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-15 07:36:10,501 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-15 07:36:10,501 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-15 07:36:10,501 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-15 07:36:10,501 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-15 07:36:10,501 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-15 07:36:10,501 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-15 07:36:10,667 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-15 07:36:10,683 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-15 07:36:10,685 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-15 07:36:10,686 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-15 07:36:10,688 INFO L275 PluginConnector]: CDTParser initialized [2022-04-15 07:36:10,689 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/bresenham-ll_valuebound10.c [2022-04-15 07:36:10,734 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ab0532875/05184afe293d468fa14b0a0d3b1de267/FLAG3041940cc [2022-04-15 07:36:11,084 INFO L306 CDTParser]: Found 1 translation units. [2022-04-15 07:36:11,084 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/bresenham-ll_valuebound10.c [2022-04-15 07:36:11,089 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ab0532875/05184afe293d468fa14b0a0d3b1de267/FLAG3041940cc [2022-04-15 07:36:11,096 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ab0532875/05184afe293d468fa14b0a0d3b1de267 [2022-04-15 07:36:11,098 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-15 07:36:11,099 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-15 07:36:11,100 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-15 07:36:11,100 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-15 07:36:11,103 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-15 07:36:11,104 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 07:36:11" (1/1) ... [2022-04-15 07:36:11,105 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@174c759a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 07:36:11, skipping insertion in model container [2022-04-15 07:36:11,105 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 07:36:11" (1/1) ... [2022-04-15 07:36:11,109 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-15 07:36:11,119 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-15 07:36:11,221 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/bresenham-ll_valuebound10.c[597,610] [2022-04-15 07:36:11,243 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 07:36:11,251 INFO L203 MainTranslator]: Completed pre-run [2022-04-15 07:36:11,280 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/bresenham-ll_valuebound10.c[597,610] [2022-04-15 07:36:11,288 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 07:36:11,296 INFO L208 MainTranslator]: Completed translation [2022-04-15 07:36:11,296 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 07:36:11 WrapperNode [2022-04-15 07:36:11,297 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-15 07:36:11,297 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-15 07:36:11,297 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-15 07:36:11,297 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-15 07:36:11,303 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 07:36:11" (1/1) ... [2022-04-15 07:36:11,304 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 07:36:11" (1/1) ... [2022-04-15 07:36:11,307 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 07:36:11" (1/1) ... [2022-04-15 07:36:11,307 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 07:36:11" (1/1) ... [2022-04-15 07:36:11,311 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 07:36:11" (1/1) ... [2022-04-15 07:36:11,313 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 07:36:11" (1/1) ... [2022-04-15 07:36:11,314 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 07:36:11" (1/1) ... [2022-04-15 07:36:11,315 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-15 07:36:11,315 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-15 07:36:11,316 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-15 07:36:11,316 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-15 07:36:11,319 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 07:36:11" (1/1) ... [2022-04-15 07:36:11,327 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 07:36:11,334 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 07:36:11,344 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-15 07:36:11,359 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-15 07:36:11,369 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-15 07:36:11,369 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-15 07:36:11,370 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-15 07:36:11,370 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-15 07:36:11,370 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-15 07:36:11,370 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-15 07:36:11,370 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-15 07:36:11,370 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-15 07:36:11,370 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-15 07:36:11,370 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-15 07:36:11,370 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-15 07:36:11,371 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-15 07:36:11,371 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-15 07:36:11,371 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-15 07:36:11,371 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-15 07:36:11,371 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-15 07:36:11,371 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-15 07:36:11,371 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-15 07:36:11,371 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-15 07:36:11,371 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-15 07:36:11,421 INFO L234 CfgBuilder]: Building ICFG [2022-04-15 07:36:11,422 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-15 07:36:11,605 INFO L275 CfgBuilder]: Performing block encoding [2022-04-15 07:36:11,613 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-15 07:36:11,613 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-15 07:36:11,614 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 07:36:11 BoogieIcfgContainer [2022-04-15 07:36:11,615 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-15 07:36:11,616 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-15 07:36:11,616 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-15 07:36:11,618 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-15 07:36:11,618 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.04 07:36:11" (1/3) ... [2022-04-15 07:36:11,618 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52de3028 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 07:36:11, skipping insertion in model container [2022-04-15 07:36:11,618 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 07:36:11" (2/3) ... [2022-04-15 07:36:11,619 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52de3028 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 07:36:11, skipping insertion in model container [2022-04-15 07:36:11,619 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 07:36:11" (3/3) ... [2022-04-15 07:36:11,619 INFO L111 eAbstractionObserver]: Analyzing ICFG bresenham-ll_valuebound10.c [2022-04-15 07:36:11,622 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-15 07:36:11,622 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-15 07:36:11,649 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-15 07:36:11,653 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-15 07:36:11,653 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-15 07:36:11,663 INFO L276 IsEmpty]: Start isEmpty. Operand has 32 states, 20 states have (on average 1.35) internal successors, (27), 21 states have internal predecessors, (27), 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-15 07:36:11,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-15 07:36:11,668 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:36:11,669 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 07:36:11,669 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:36:11,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:36:11,679 INFO L85 PathProgramCache]: Analyzing trace with hash -1867489771, now seen corresponding path program 1 times [2022-04-15 07:36:11,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:36:11,685 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1872576041] [2022-04-15 07:36:11,696 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 07:36:11,697 INFO L85 PathProgramCache]: Analyzing trace with hash -1867489771, now seen corresponding path program 2 times [2022-04-15 07:36:11,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:36:11,699 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1826533679] [2022-04-15 07:36:11,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:36:11,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:36:11,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:36:11,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 07:36:11,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:36:11,857 INFO L290 TraceCheckUtils]: 0: Hoare triple {48#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {35#true} is VALID [2022-04-15 07:36:11,858 INFO L290 TraceCheckUtils]: 1: Hoare triple {35#true} assume true; {35#true} is VALID [2022-04-15 07:36:11,858 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {35#true} {35#true} #69#return; {35#true} is VALID [2022-04-15 07:36:11,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-15 07:36:11,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:36:11,870 INFO L290 TraceCheckUtils]: 0: Hoare triple {35#true} ~cond := #in~cond; {35#true} is VALID [2022-04-15 07:36:11,871 INFO L290 TraceCheckUtils]: 1: Hoare triple {35#true} assume 0 == ~cond;assume false; {36#false} is VALID [2022-04-15 07:36:11,871 INFO L290 TraceCheckUtils]: 2: Hoare triple {36#false} assume true; {36#false} is VALID [2022-04-15 07:36:11,871 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {36#false} {35#true} #61#return; {36#false} is VALID [2022-04-15 07:36:11,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-15 07:36:11,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:36:11,878 INFO L290 TraceCheckUtils]: 0: Hoare triple {35#true} ~cond := #in~cond; {35#true} is VALID [2022-04-15 07:36:11,878 INFO L290 TraceCheckUtils]: 1: Hoare triple {35#true} assume 0 == ~cond;assume false; {36#false} is VALID [2022-04-15 07:36:11,879 INFO L290 TraceCheckUtils]: 2: Hoare triple {36#false} assume true; {36#false} is VALID [2022-04-15 07:36:11,879 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {36#false} {36#false} #63#return; {36#false} is VALID [2022-04-15 07:36:11,880 INFO L272 TraceCheckUtils]: 0: Hoare triple {35#true} call ULTIMATE.init(); {48#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 07:36:11,880 INFO L290 TraceCheckUtils]: 1: Hoare triple {48#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {35#true} is VALID [2022-04-15 07:36:11,880 INFO L290 TraceCheckUtils]: 2: Hoare triple {35#true} assume true; {35#true} is VALID [2022-04-15 07:36:11,880 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35#true} {35#true} #69#return; {35#true} is VALID [2022-04-15 07:36:11,880 INFO L272 TraceCheckUtils]: 4: Hoare triple {35#true} call #t~ret8 := main(); {35#true} is VALID [2022-04-15 07:36:11,881 INFO L290 TraceCheckUtils]: 5: Hoare triple {35#true} havoc ~X~0;havoc ~Y~0;havoc ~x~0;havoc ~y~0;havoc ~v~0;havoc ~xy~0;havoc ~yx~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~X~0 := #t~nondet4;havoc #t~nondet4; {35#true} is VALID [2022-04-15 07:36:11,881 INFO L272 TraceCheckUtils]: 6: Hoare triple {35#true} call assume_abort_if_not((if ~X~0 >= 0 && ~X~0 <= 10 then 1 else 0)); {35#true} is VALID [2022-04-15 07:36:11,881 INFO L290 TraceCheckUtils]: 7: Hoare triple {35#true} ~cond := #in~cond; {35#true} is VALID [2022-04-15 07:36:11,882 INFO L290 TraceCheckUtils]: 8: Hoare triple {35#true} assume 0 == ~cond;assume false; {36#false} is VALID [2022-04-15 07:36:11,882 INFO L290 TraceCheckUtils]: 9: Hoare triple {36#false} assume true; {36#false} is VALID [2022-04-15 07:36:11,883 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {36#false} {35#true} #61#return; {36#false} is VALID [2022-04-15 07:36:11,883 INFO L290 TraceCheckUtils]: 11: Hoare triple {36#false} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~Y~0 := #t~nondet5;havoc #t~nondet5; {36#false} is VALID [2022-04-15 07:36:11,883 INFO L272 TraceCheckUtils]: 12: Hoare triple {36#false} call assume_abort_if_not((if ~Y~0 >= 0 && ~Y~0 <= 10 then 1 else 0)); {35#true} is VALID [2022-04-15 07:36:11,883 INFO L290 TraceCheckUtils]: 13: Hoare triple {35#true} ~cond := #in~cond; {35#true} is VALID [2022-04-15 07:36:11,884 INFO L290 TraceCheckUtils]: 14: Hoare triple {35#true} assume 0 == ~cond;assume false; {36#false} is VALID [2022-04-15 07:36:11,884 INFO L290 TraceCheckUtils]: 15: Hoare triple {36#false} assume true; {36#false} is VALID [2022-04-15 07:36:11,884 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {36#false} {36#false} #63#return; {36#false} is VALID [2022-04-15 07:36:11,884 INFO L290 TraceCheckUtils]: 17: Hoare triple {36#false} ~v~0 := 2 * ~Y~0 - ~X~0;~y~0 := 0;~x~0 := 0; {36#false} is VALID [2022-04-15 07:36:11,885 INFO L290 TraceCheckUtils]: 18: Hoare triple {36#false} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {36#false} is VALID [2022-04-15 07:36:11,885 INFO L272 TraceCheckUtils]: 19: Hoare triple {36#false} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {36#false} is VALID [2022-04-15 07:36:11,885 INFO L290 TraceCheckUtils]: 20: Hoare triple {36#false} ~cond := #in~cond; {36#false} is VALID [2022-04-15 07:36:11,885 INFO L290 TraceCheckUtils]: 21: Hoare triple {36#false} assume 0 == ~cond; {36#false} is VALID [2022-04-15 07:36:11,885 INFO L290 TraceCheckUtils]: 22: Hoare triple {36#false} assume !false; {36#false} is VALID [2022-04-15 07:36:11,886 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-15 07:36:11,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:36:11,887 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1826533679] [2022-04-15 07:36:11,888 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1826533679] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:36:11,888 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:36:11,888 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 07:36:11,890 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:36:11,890 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1872576041] [2022-04-15 07:36:11,890 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1872576041] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:36:11,891 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:36:11,891 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 07:36:11,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284428713] [2022-04-15 07:36:11,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:36:11,896 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (5), 3 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 23 [2022-04-15 07:36:11,897 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:36:11,899 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (5), 3 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-15 07:36:11,927 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:36:11,927 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-15 07:36:11,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:36:11,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-15 07:36:11,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-15 07:36:11,948 INFO L87 Difference]: Start difference. First operand has 32 states, 20 states have (on average 1.35) internal successors, (27), 21 states have internal predecessors, (27), 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 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (5), 3 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-15 07:36:12,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:36:12,064 INFO L93 Difference]: Finished difference Result 57 states and 74 transitions. [2022-04-15 07:36:12,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-15 07:36:12,065 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (5), 3 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 23 [2022-04-15 07:36:12,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:36:12,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (5), 3 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-15 07:36:12,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 74 transitions. [2022-04-15 07:36:12,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (5), 3 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-15 07:36:12,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 74 transitions. [2022-04-15 07:36:12,084 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 74 transitions. [2022-04-15 07:36:12,159 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:36:12,168 INFO L225 Difference]: With dead ends: 57 [2022-04-15 07:36:12,168 INFO L226 Difference]: Without dead ends: 27 [2022-04-15 07:36:12,171 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-15 07:36:12,174 INFO L913 BasicCegarLoop]: 31 mSDtfsCounter, 20 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 07:36:12,175 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [24 Valid, 34 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 07:36:12,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-04-15 07:36:12,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2022-04-15 07:36:12,208 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:36:12,209 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand has 27 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 18 states have internal predecessors, (20), 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-15 07:36:12,209 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand has 27 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 18 states have internal predecessors, (20), 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-15 07:36:12,209 INFO L87 Difference]: Start difference. First operand 27 states. Second operand has 27 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 18 states have internal predecessors, (20), 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-15 07:36:12,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:36:12,212 INFO L93 Difference]: Finished difference Result 27 states and 30 transitions. [2022-04-15 07:36:12,212 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2022-04-15 07:36:12,213 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:36:12,213 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:36:12,213 INFO L74 IsIncluded]: Start isIncluded. First operand has 27 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 18 states have internal predecessors, (20), 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 27 states. [2022-04-15 07:36:12,213 INFO L87 Difference]: Start difference. First operand has 27 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 18 states have internal predecessors, (20), 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 27 states. [2022-04-15 07:36:12,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:36:12,215 INFO L93 Difference]: Finished difference Result 27 states and 30 transitions. [2022-04-15 07:36:12,216 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2022-04-15 07:36:12,216 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:36:12,216 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:36:12,216 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:36:12,216 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:36:12,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 18 states have internal predecessors, (20), 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-15 07:36:12,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 30 transitions. [2022-04-15 07:36:12,219 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 30 transitions. Word has length 23 [2022-04-15 07:36:12,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:36:12,219 INFO L478 AbstractCegarLoop]: Abstraction has 27 states and 30 transitions. [2022-04-15 07:36:12,219 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (5), 3 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-15 07:36:12,219 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 27 states and 30 transitions. [2022-04-15 07:36:12,247 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:36:12,248 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2022-04-15 07:36:12,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-15 07:36:12,249 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:36:12,249 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 07:36:12,250 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-15 07:36:12,250 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:36:12,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:36:12,251 INFO L85 PathProgramCache]: Analyzing trace with hash 1827672217, now seen corresponding path program 1 times [2022-04-15 07:36:12,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:36:12,251 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1655176014] [2022-04-15 07:36:12,254 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 07:36:12,255 INFO L85 PathProgramCache]: Analyzing trace with hash 1827672217, now seen corresponding path program 2 times [2022-04-15 07:36:12,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:36:12,255 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1143819001] [2022-04-15 07:36:12,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:36:12,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:36:12,289 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 07:36:12,290 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1713155927] [2022-04-15 07:36:12,290 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 07:36:12,290 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 07:36:12,290 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 07:36:12,312 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 07:36:12,317 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-15 07:36:12,371 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-15 07:36:12,371 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 07:36:12,372 INFO L263 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-15 07:36:12,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:36:12,389 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 07:36:12,552 INFO L272 TraceCheckUtils]: 0: Hoare triple {273#true} call ULTIMATE.init(); {273#true} is VALID [2022-04-15 07:36:12,552 INFO L290 TraceCheckUtils]: 1: Hoare triple {273#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(15, 2);call #Ultimate.allocInit(12, 3); {273#true} is VALID [2022-04-15 07:36:12,552 INFO L290 TraceCheckUtils]: 2: Hoare triple {273#true} assume true; {273#true} is VALID [2022-04-15 07:36:12,553 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {273#true} {273#true} #69#return; {273#true} is VALID [2022-04-15 07:36:12,553 INFO L272 TraceCheckUtils]: 4: Hoare triple {273#true} call #t~ret8 := main(); {273#true} is VALID [2022-04-15 07:36:12,553 INFO L290 TraceCheckUtils]: 5: Hoare triple {273#true} havoc ~X~0;havoc ~Y~0;havoc ~x~0;havoc ~y~0;havoc ~v~0;havoc ~xy~0;havoc ~yx~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~X~0 := #t~nondet4;havoc #t~nondet4; {273#true} is VALID [2022-04-15 07:36:12,553 INFO L272 TraceCheckUtils]: 6: Hoare triple {273#true} call assume_abort_if_not((if ~X~0 >= 0 && ~X~0 <= 10 then 1 else 0)); {273#true} is VALID [2022-04-15 07:36:12,553 INFO L290 TraceCheckUtils]: 7: Hoare triple {273#true} ~cond := #in~cond; {273#true} is VALID [2022-04-15 07:36:12,553 INFO L290 TraceCheckUtils]: 8: Hoare triple {273#true} assume !(0 == ~cond); {273#true} is VALID [2022-04-15 07:36:12,553 INFO L290 TraceCheckUtils]: 9: Hoare triple {273#true} assume true; {273#true} is VALID [2022-04-15 07:36:12,554 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {273#true} {273#true} #61#return; {273#true} is VALID [2022-04-15 07:36:12,554 INFO L290 TraceCheckUtils]: 11: Hoare triple {273#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~Y~0 := #t~nondet5;havoc #t~nondet5; {273#true} is VALID [2022-04-15 07:36:12,554 INFO L272 TraceCheckUtils]: 12: Hoare triple {273#true} call assume_abort_if_not((if ~Y~0 >= 0 && ~Y~0 <= 10 then 1 else 0)); {273#true} is VALID [2022-04-15 07:36:12,554 INFO L290 TraceCheckUtils]: 13: Hoare triple {273#true} ~cond := #in~cond; {273#true} is VALID [2022-04-15 07:36:12,554 INFO L290 TraceCheckUtils]: 14: Hoare triple {273#true} assume !(0 == ~cond); {273#true} is VALID [2022-04-15 07:36:12,554 INFO L290 TraceCheckUtils]: 15: Hoare triple {273#true} assume true; {273#true} is VALID [2022-04-15 07:36:12,555 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {273#true} {273#true} #63#return; {273#true} is VALID [2022-04-15 07:36:12,561 INFO L290 TraceCheckUtils]: 17: Hoare triple {273#true} ~v~0 := 2 * ~Y~0 - ~X~0;~y~0 := 0;~x~0 := 0; {329#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (= main_~y~0 0))} is VALID [2022-04-15 07:36:12,562 INFO L290 TraceCheckUtils]: 18: Hoare triple {329#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (= main_~y~0 0))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {333#(and (= main_~xy~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (= main_~yx~0 0))} is VALID [2022-04-15 07:36:12,563 INFO L272 TraceCheckUtils]: 19: Hoare triple {333#(and (= main_~xy~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (= main_~yx~0 0))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {337#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 07:36:12,563 INFO L290 TraceCheckUtils]: 20: Hoare triple {337#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {341#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 07:36:12,563 INFO L290 TraceCheckUtils]: 21: Hoare triple {341#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {274#false} is VALID [2022-04-15 07:36:12,564 INFO L290 TraceCheckUtils]: 22: Hoare triple {274#false} assume !false; {274#false} is VALID [2022-04-15 07:36:12,564 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-15 07:36:12,564 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 07:36:12,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:36:12,564 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1143819001] [2022-04-15 07:36:12,564 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 07:36:12,565 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1713155927] [2022-04-15 07:36:12,565 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1713155927] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:36:12,565 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:36:12,565 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 07:36:12,565 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:36:12,566 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1655176014] [2022-04-15 07:36:12,566 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1655176014] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:36:12,566 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:36:12,566 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 07:36:12,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392351365] [2022-04-15 07:36:12,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:36:12,567 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 23 [2022-04-15 07:36:12,567 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:36:12,567 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-15 07:36:12,580 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:36:12,580 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 07:36:12,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:36:12,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 07:36:12,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-15 07:36:12,581 INFO L87 Difference]: Start difference. First operand 27 states and 30 transitions. Second operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-15 07:36:12,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:36:12,766 INFO L93 Difference]: Finished difference Result 39 states and 44 transitions. [2022-04-15 07:36:12,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-15 07:36:12,766 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 23 [2022-04-15 07:36:12,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:36:12,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-15 07:36:12,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 44 transitions. [2022-04-15 07:36:12,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-15 07:36:12,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 44 transitions. [2022-04-15 07:36:12,780 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 44 transitions. [2022-04-15 07:36:12,814 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:36:12,816 INFO L225 Difference]: With dead ends: 39 [2022-04-15 07:36:12,817 INFO L226 Difference]: Without dead ends: 35 [2022-04-15 07:36:12,818 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-04-15 07:36:12,819 INFO L913 BasicCegarLoop]: 22 mSDtfsCounter, 10 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 07:36:12,822 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 91 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 07:36:12,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-04-15 07:36:12,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 34. [2022-04-15 07:36:12,834 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:36:12,835 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand has 34 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-15 07:36:12,835 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand has 34 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-15 07:36:12,835 INFO L87 Difference]: Start difference. First operand 35 states. Second operand has 34 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-15 07:36:12,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:36:12,837 INFO L93 Difference]: Finished difference Result 35 states and 39 transitions. [2022-04-15 07:36:12,837 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2022-04-15 07:36:12,837 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:36:12,837 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:36:12,838 INFO L74 IsIncluded]: Start isIncluded. First operand has 34 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 35 states. [2022-04-15 07:36:12,838 INFO L87 Difference]: Start difference. First operand has 34 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 35 states. [2022-04-15 07:36:12,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:36:12,839 INFO L93 Difference]: Finished difference Result 35 states and 39 transitions. [2022-04-15 07:36:12,840 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2022-04-15 07:36:12,840 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:36:12,840 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:36:12,840 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:36:12,840 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:36:12,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-15 07:36:12,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 37 transitions. [2022-04-15 07:36:12,841 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 37 transitions. Word has length 23 [2022-04-15 07:36:12,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:36:12,842 INFO L478 AbstractCegarLoop]: Abstraction has 34 states and 37 transitions. [2022-04-15 07:36:12,842 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-15 07:36:12,842 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 34 states and 37 transitions. [2022-04-15 07:36:12,870 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:36:12,870 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 37 transitions. [2022-04-15 07:36:12,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-15 07:36:12,871 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:36:12,871 INFO L499 BasicCegarLoop]: trace histogram [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-15 07:36:12,890 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-15 07:36:13,091 WARN L460 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-15 07:36:13,092 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:36:13,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:36:13,092 INFO L85 PathProgramCache]: Analyzing trace with hash -1419291471, now seen corresponding path program 1 times [2022-04-15 07:36:13,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:36:13,092 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [697998191] [2022-04-15 07:36:13,093 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 07:36:13,093 INFO L85 PathProgramCache]: Analyzing trace with hash -1419291471, now seen corresponding path program 2 times [2022-04-15 07:36:13,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:36:13,093 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [565362338] [2022-04-15 07:36:13,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:36:13,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:36:13,110 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 07:36:13,111 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1591195384] [2022-04-15 07:36:13,111 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 07:36:13,111 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 07:36:13,111 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 07:36:13,112 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 07:36:13,113 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-15 07:36:13,147 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 07:36:13,148 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 07:36:13,148 INFO L263 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 24 conjunts are in the unsatisfiable core [2022-04-15 07:36:13,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:36:13,158 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 07:36:13,467 INFO L272 TraceCheckUtils]: 0: Hoare triple {567#true} call ULTIMATE.init(); {567#true} is VALID [2022-04-15 07:36:13,467 INFO L290 TraceCheckUtils]: 1: Hoare triple {567#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(15, 2);call #Ultimate.allocInit(12, 3); {567#true} is VALID [2022-04-15 07:36:13,468 INFO L290 TraceCheckUtils]: 2: Hoare triple {567#true} assume true; {567#true} is VALID [2022-04-15 07:36:13,468 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {567#true} {567#true} #69#return; {567#true} is VALID [2022-04-15 07:36:13,468 INFO L272 TraceCheckUtils]: 4: Hoare triple {567#true} call #t~ret8 := main(); {567#true} is VALID [2022-04-15 07:36:13,468 INFO L290 TraceCheckUtils]: 5: Hoare triple {567#true} havoc ~X~0;havoc ~Y~0;havoc ~x~0;havoc ~y~0;havoc ~v~0;havoc ~xy~0;havoc ~yx~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~X~0 := #t~nondet4;havoc #t~nondet4; {567#true} is VALID [2022-04-15 07:36:13,469 INFO L272 TraceCheckUtils]: 6: Hoare triple {567#true} call assume_abort_if_not((if ~X~0 >= 0 && ~X~0 <= 10 then 1 else 0)); {567#true} is VALID [2022-04-15 07:36:13,469 INFO L290 TraceCheckUtils]: 7: Hoare triple {567#true} ~cond := #in~cond; {567#true} is VALID [2022-04-15 07:36:13,470 INFO L290 TraceCheckUtils]: 8: Hoare triple {567#true} assume !(0 == ~cond); {567#true} is VALID [2022-04-15 07:36:13,470 INFO L290 TraceCheckUtils]: 9: Hoare triple {567#true} assume true; {567#true} is VALID [2022-04-15 07:36:13,470 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {567#true} {567#true} #61#return; {567#true} is VALID [2022-04-15 07:36:13,470 INFO L290 TraceCheckUtils]: 11: Hoare triple {567#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~Y~0 := #t~nondet5;havoc #t~nondet5; {567#true} is VALID [2022-04-15 07:36:13,470 INFO L272 TraceCheckUtils]: 12: Hoare triple {567#true} call assume_abort_if_not((if ~Y~0 >= 0 && ~Y~0 <= 10 then 1 else 0)); {567#true} is VALID [2022-04-15 07:36:13,471 INFO L290 TraceCheckUtils]: 13: Hoare triple {567#true} ~cond := #in~cond; {611#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-15 07:36:13,471 INFO L290 TraceCheckUtils]: 14: Hoare triple {611#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {615#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 07:36:13,471 INFO L290 TraceCheckUtils]: 15: Hoare triple {615#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {615#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 07:36:13,472 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {615#(not (= |assume_abort_if_not_#in~cond| 0))} {567#true} #63#return; {622#(and (<= 0 main_~Y~0) (<= main_~Y~0 10))} is VALID [2022-04-15 07:36:13,472 INFO L290 TraceCheckUtils]: 17: Hoare triple {622#(and (<= 0 main_~Y~0) (<= main_~Y~0 10))} ~v~0 := 2 * ~Y~0 - ~X~0;~y~0 := 0;~x~0 := 0; {626#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (<= 0 main_~Y~0) (= main_~y~0 0) (<= main_~Y~0 10))} is VALID [2022-04-15 07:36:13,473 INFO L290 TraceCheckUtils]: 18: Hoare triple {626#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (<= 0 main_~Y~0) (= main_~y~0 0) (<= main_~Y~0 10))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {626#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (<= 0 main_~Y~0) (= main_~y~0 0) (<= main_~Y~0 10))} is VALID [2022-04-15 07:36:13,473 INFO L272 TraceCheckUtils]: 19: Hoare triple {626#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (<= 0 main_~Y~0) (= main_~y~0 0) (<= main_~Y~0 10))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {567#true} is VALID [2022-04-15 07:36:13,474 INFO L290 TraceCheckUtils]: 20: Hoare triple {567#true} ~cond := #in~cond; {567#true} is VALID [2022-04-15 07:36:13,474 INFO L290 TraceCheckUtils]: 21: Hoare triple {567#true} assume !(0 == ~cond); {567#true} is VALID [2022-04-15 07:36:13,474 INFO L290 TraceCheckUtils]: 22: Hoare triple {567#true} assume true; {567#true} is VALID [2022-04-15 07:36:13,474 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {567#true} {626#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (<= 0 main_~Y~0) (= main_~y~0 0) (<= main_~Y~0 10))} #65#return; {626#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (<= 0 main_~Y~0) (= main_~y~0 0) (<= main_~Y~0 10))} is VALID [2022-04-15 07:36:13,475 INFO L290 TraceCheckUtils]: 24: Hoare triple {626#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (<= 0 main_~Y~0) (= main_~y~0 0) (<= main_~Y~0 10))} assume !!(~x~0 <= ~X~0); {626#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (<= 0 main_~Y~0) (= main_~y~0 0) (<= main_~Y~0 10))} is VALID [2022-04-15 07:36:13,476 INFO L290 TraceCheckUtils]: 25: Hoare triple {626#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (<= 0 main_~Y~0) (= main_~y~0 0) (<= main_~Y~0 10))} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {651#(and (= main_~x~0 0) (<= 0 main_~Y~0) (= main_~y~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) (+ main_~v~0 (* (- 2) main_~Y~0))) (<= main_~Y~0 10))} is VALID [2022-04-15 07:36:13,476 INFO L290 TraceCheckUtils]: 26: Hoare triple {651#(and (= main_~x~0 0) (<= 0 main_~Y~0) (= main_~y~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) (+ main_~v~0 (* (- 2) main_~Y~0))) (<= main_~Y~0 10))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {655#(and (= main_~x~0 1) (<= 0 main_~Y~0) (= main_~y~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) (+ main_~v~0 (* (- 2) main_~Y~0))) (<= main_~Y~0 10))} is VALID [2022-04-15 07:36:13,477 INFO L290 TraceCheckUtils]: 27: Hoare triple {655#(and (= main_~x~0 1) (<= 0 main_~Y~0) (= main_~y~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) (+ main_~v~0 (* (- 2) main_~Y~0))) (<= main_~Y~0 10))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {659#(and (= main_~xy~0 0) (<= 0 main_~Y~0) (= main_~Y~0 main_~yx~0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) (+ main_~v~0 (* (- 2) main_~Y~0))) (<= main_~Y~0 10))} is VALID [2022-04-15 07:36:13,478 INFO L272 TraceCheckUtils]: 28: Hoare triple {659#(and (= main_~xy~0 0) (<= 0 main_~Y~0) (= main_~Y~0 main_~yx~0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) (+ main_~v~0 (* (- 2) main_~Y~0))) (<= main_~Y~0 10))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {663#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 07:36:13,478 INFO L290 TraceCheckUtils]: 29: Hoare triple {663#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {667#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 07:36:13,478 INFO L290 TraceCheckUtils]: 30: Hoare triple {667#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {568#false} is VALID [2022-04-15 07:36:13,479 INFO L290 TraceCheckUtils]: 31: Hoare triple {568#false} assume !false; {568#false} is VALID [2022-04-15 07:36:13,480 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 07:36:13,480 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 07:36:13,699 INFO L290 TraceCheckUtils]: 31: Hoare triple {568#false} assume !false; {568#false} is VALID [2022-04-15 07:36:13,699 INFO L290 TraceCheckUtils]: 30: Hoare triple {667#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {568#false} is VALID [2022-04-15 07:36:13,700 INFO L290 TraceCheckUtils]: 29: Hoare triple {663#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {667#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 07:36:13,700 INFO L272 TraceCheckUtils]: 28: Hoare triple {683#(= (+ (* 2 main_~xy~0) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 main_~yx~0)))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {663#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 07:36:13,701 INFO L290 TraceCheckUtils]: 27: Hoare triple {687#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {683#(= (+ (* 2 main_~xy~0) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 main_~yx~0)))} is VALID [2022-04-15 07:36:13,702 INFO L290 TraceCheckUtils]: 26: Hoare triple {691#(= (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0))))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {687#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} is VALID [2022-04-15 07:36:13,703 INFO L290 TraceCheckUtils]: 25: Hoare triple {687#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {691#(= (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0))))} is VALID [2022-04-15 07:36:13,703 INFO L290 TraceCheckUtils]: 24: Hoare triple {687#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} assume !!(~x~0 <= ~X~0); {687#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} is VALID [2022-04-15 07:36:13,704 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {567#true} {687#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} #65#return; {687#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} is VALID [2022-04-15 07:36:13,704 INFO L290 TraceCheckUtils]: 22: Hoare triple {567#true} assume true; {567#true} is VALID [2022-04-15 07:36:13,704 INFO L290 TraceCheckUtils]: 21: Hoare triple {567#true} assume !(0 == ~cond); {567#true} is VALID [2022-04-15 07:36:13,704 INFO L290 TraceCheckUtils]: 20: Hoare triple {567#true} ~cond := #in~cond; {567#true} is VALID [2022-04-15 07:36:13,704 INFO L272 TraceCheckUtils]: 19: Hoare triple {687#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {567#true} is VALID [2022-04-15 07:36:13,706 INFO L290 TraceCheckUtils]: 18: Hoare triple {687#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {687#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} is VALID [2022-04-15 07:36:13,707 INFO L290 TraceCheckUtils]: 17: Hoare triple {567#true} ~v~0 := 2 * ~Y~0 - ~X~0;~y~0 := 0;~x~0 := 0; {687#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} is VALID [2022-04-15 07:36:13,707 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {567#true} {567#true} #63#return; {567#true} is VALID [2022-04-15 07:36:13,707 INFO L290 TraceCheckUtils]: 15: Hoare triple {567#true} assume true; {567#true} is VALID [2022-04-15 07:36:13,707 INFO L290 TraceCheckUtils]: 14: Hoare triple {567#true} assume !(0 == ~cond); {567#true} is VALID [2022-04-15 07:36:13,707 INFO L290 TraceCheckUtils]: 13: Hoare triple {567#true} ~cond := #in~cond; {567#true} is VALID [2022-04-15 07:36:13,707 INFO L272 TraceCheckUtils]: 12: Hoare triple {567#true} call assume_abort_if_not((if ~Y~0 >= 0 && ~Y~0 <= 10 then 1 else 0)); {567#true} is VALID [2022-04-15 07:36:13,708 INFO L290 TraceCheckUtils]: 11: Hoare triple {567#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~Y~0 := #t~nondet5;havoc #t~nondet5; {567#true} is VALID [2022-04-15 07:36:13,708 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {567#true} {567#true} #61#return; {567#true} is VALID [2022-04-15 07:36:13,708 INFO L290 TraceCheckUtils]: 9: Hoare triple {567#true} assume true; {567#true} is VALID [2022-04-15 07:36:13,708 INFO L290 TraceCheckUtils]: 8: Hoare triple {567#true} assume !(0 == ~cond); {567#true} is VALID [2022-04-15 07:36:13,708 INFO L290 TraceCheckUtils]: 7: Hoare triple {567#true} ~cond := #in~cond; {567#true} is VALID [2022-04-15 07:36:13,709 INFO L272 TraceCheckUtils]: 6: Hoare triple {567#true} call assume_abort_if_not((if ~X~0 >= 0 && ~X~0 <= 10 then 1 else 0)); {567#true} is VALID [2022-04-15 07:36:13,709 INFO L290 TraceCheckUtils]: 5: Hoare triple {567#true} havoc ~X~0;havoc ~Y~0;havoc ~x~0;havoc ~y~0;havoc ~v~0;havoc ~xy~0;havoc ~yx~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~X~0 := #t~nondet4;havoc #t~nondet4; {567#true} is VALID [2022-04-15 07:36:13,709 INFO L272 TraceCheckUtils]: 4: Hoare triple {567#true} call #t~ret8 := main(); {567#true} is VALID [2022-04-15 07:36:13,710 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {567#true} {567#true} #69#return; {567#true} is VALID [2022-04-15 07:36:13,711 INFO L290 TraceCheckUtils]: 2: Hoare triple {567#true} assume true; {567#true} is VALID [2022-04-15 07:36:13,719 INFO L290 TraceCheckUtils]: 1: Hoare triple {567#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(15, 2);call #Ultimate.allocInit(12, 3); {567#true} is VALID [2022-04-15 07:36:13,719 INFO L272 TraceCheckUtils]: 0: Hoare triple {567#true} call ULTIMATE.init(); {567#true} is VALID [2022-04-15 07:36:13,720 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-04-15 07:36:13,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:36:13,720 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [565362338] [2022-04-15 07:36:13,720 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 07:36:13,720 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1591195384] [2022-04-15 07:36:13,720 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1591195384] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 07:36:13,720 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 07:36:13,720 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7] total 14 [2022-04-15 07:36:13,721 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:36:13,721 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [697998191] [2022-04-15 07:36:13,721 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [697998191] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:36:13,721 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:36:13,721 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-15 07:36:13,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1380150170] [2022-04-15 07:36:13,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:36:13,722 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.2) internal successors, (22), 9 states have internal predecessors, (22), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 32 [2022-04-15 07:36:13,722 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:36:13,735 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 10 states have (on average 2.2) internal successors, (22), 9 states have internal predecessors, (22), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-15 07:36:13,758 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:36:13,758 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-15 07:36:13,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:36:13,759 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-15 07:36:13,759 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2022-04-15 07:36:13,759 INFO L87 Difference]: Start difference. First operand 34 states and 37 transitions. Second operand has 11 states, 10 states have (on average 2.2) internal successors, (22), 9 states have internal predecessors, (22), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-15 07:36:14,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:36:14,270 INFO L93 Difference]: Finished difference Result 48 states and 54 transitions. [2022-04-15 07:36:14,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-15 07:36:14,271 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.2) internal successors, (22), 9 states have internal predecessors, (22), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 32 [2022-04-15 07:36:14,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:36:14,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 2.2) internal successors, (22), 9 states have internal predecessors, (22), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-15 07:36:14,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 51 transitions. [2022-04-15 07:36:14,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 2.2) internal successors, (22), 9 states have internal predecessors, (22), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-15 07:36:14,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 51 transitions. [2022-04-15 07:36:14,275 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 51 transitions. [2022-04-15 07:36:14,318 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-15 07:36:14,319 INFO L225 Difference]: With dead ends: 48 [2022-04-15 07:36:14,319 INFO L226 Difference]: Without dead ends: 44 [2022-04-15 07:36:14,320 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 49 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=224, Unknown=0, NotChecked=0, Total=272 [2022-04-15 07:36:14,320 INFO L913 BasicCegarLoop]: 22 mSDtfsCounter, 22 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 211 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 222 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 211 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 07:36:14,321 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [23 Valid, 150 Invalid, 222 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 211 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 07:36:14,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-04-15 07:36:14,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 43. [2022-04-15 07:36:14,349 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:36:14,350 INFO L82 GeneralOperation]: Start isEquivalent. First operand 44 states. Second operand has 43 states, 29 states have (on average 1.1379310344827587) internal successors, (33), 30 states have internal predecessors, (33), 8 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-15 07:36:14,350 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand has 43 states, 29 states have (on average 1.1379310344827587) internal successors, (33), 30 states have internal predecessors, (33), 8 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-15 07:36:14,350 INFO L87 Difference]: Start difference. First operand 44 states. Second operand has 43 states, 29 states have (on average 1.1379310344827587) internal successors, (33), 30 states have internal predecessors, (33), 8 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-15 07:36:14,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:36:14,352 INFO L93 Difference]: Finished difference Result 44 states and 49 transitions. [2022-04-15 07:36:14,352 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 49 transitions. [2022-04-15 07:36:14,352 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:36:14,352 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:36:14,352 INFO L74 IsIncluded]: Start isIncluded. First operand has 43 states, 29 states have (on average 1.1379310344827587) internal successors, (33), 30 states have internal predecessors, (33), 8 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 44 states. [2022-04-15 07:36:14,353 INFO L87 Difference]: Start difference. First operand has 43 states, 29 states have (on average 1.1379310344827587) internal successors, (33), 30 states have internal predecessors, (33), 8 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 44 states. [2022-04-15 07:36:14,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:36:14,354 INFO L93 Difference]: Finished difference Result 44 states and 49 transitions. [2022-04-15 07:36:14,354 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 49 transitions. [2022-04-15 07:36:14,354 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:36:14,354 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:36:14,355 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:36:14,355 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:36:14,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 29 states have (on average 1.1379310344827587) internal successors, (33), 30 states have internal predecessors, (33), 8 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-15 07:36:14,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 47 transitions. [2022-04-15 07:36:14,356 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 47 transitions. Word has length 32 [2022-04-15 07:36:14,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:36:14,356 INFO L478 AbstractCegarLoop]: Abstraction has 43 states and 47 transitions. [2022-04-15 07:36:14,357 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.2) internal successors, (22), 9 states have internal predecessors, (22), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-15 07:36:14,357 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 43 states and 47 transitions. [2022-04-15 07:36:14,408 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:36:14,409 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2022-04-15 07:36:14,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-15 07:36:14,409 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:36:14,409 INFO L499 BasicCegarLoop]: trace histogram [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-15 07:36:14,434 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-15 07:36:14,634 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-04-15 07:36:14,635 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:36:14,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:36:14,635 INFO L85 PathProgramCache]: Analyzing trace with hash 355715891, now seen corresponding path program 1 times [2022-04-15 07:36:14,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:36:14,635 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [961540448] [2022-04-15 07:36:14,636 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 07:36:14,636 INFO L85 PathProgramCache]: Analyzing trace with hash 355715891, now seen corresponding path program 2 times [2022-04-15 07:36:14,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:36:14,636 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1806471118] [2022-04-15 07:36:14,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:36:14,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:36:14,646 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 07:36:14,647 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2002163345] [2022-04-15 07:36:14,647 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 07:36:14,647 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 07:36:14,647 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 07:36:14,648 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 07:36:14,649 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-15 07:36:14,681 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 07:36:14,681 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 07:36:14,682 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 24 conjunts are in the unsatisfiable core [2022-04-15 07:36:14,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:36:14,703 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 07:36:14,895 INFO L272 TraceCheckUtils]: 0: Hoare triple {1048#true} call ULTIMATE.init(); {1048#true} is VALID [2022-04-15 07:36:14,895 INFO L290 TraceCheckUtils]: 1: Hoare triple {1048#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(15, 2);call #Ultimate.allocInit(12, 3); {1048#true} is VALID [2022-04-15 07:36:14,895 INFO L290 TraceCheckUtils]: 2: Hoare triple {1048#true} assume true; {1048#true} is VALID [2022-04-15 07:36:14,896 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1048#true} {1048#true} #69#return; {1048#true} is VALID [2022-04-15 07:36:14,896 INFO L272 TraceCheckUtils]: 4: Hoare triple {1048#true} call #t~ret8 := main(); {1048#true} is VALID [2022-04-15 07:36:14,896 INFO L290 TraceCheckUtils]: 5: Hoare triple {1048#true} havoc ~X~0;havoc ~Y~0;havoc ~x~0;havoc ~y~0;havoc ~v~0;havoc ~xy~0;havoc ~yx~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~X~0 := #t~nondet4;havoc #t~nondet4; {1048#true} is VALID [2022-04-15 07:36:14,896 INFO L272 TraceCheckUtils]: 6: Hoare triple {1048#true} call assume_abort_if_not((if ~X~0 >= 0 && ~X~0 <= 10 then 1 else 0)); {1048#true} is VALID [2022-04-15 07:36:14,896 INFO L290 TraceCheckUtils]: 7: Hoare triple {1048#true} ~cond := #in~cond; {1048#true} is VALID [2022-04-15 07:36:14,896 INFO L290 TraceCheckUtils]: 8: Hoare triple {1048#true} assume !(0 == ~cond); {1048#true} is VALID [2022-04-15 07:36:14,896 INFO L290 TraceCheckUtils]: 9: Hoare triple {1048#true} assume true; {1048#true} is VALID [2022-04-15 07:36:14,896 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1048#true} {1048#true} #61#return; {1048#true} is VALID [2022-04-15 07:36:14,896 INFO L290 TraceCheckUtils]: 11: Hoare triple {1048#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~Y~0 := #t~nondet5;havoc #t~nondet5; {1048#true} is VALID [2022-04-15 07:36:14,897 INFO L272 TraceCheckUtils]: 12: Hoare triple {1048#true} call assume_abort_if_not((if ~Y~0 >= 0 && ~Y~0 <= 10 then 1 else 0)); {1048#true} is VALID [2022-04-15 07:36:14,897 INFO L290 TraceCheckUtils]: 13: Hoare triple {1048#true} ~cond := #in~cond; {1048#true} is VALID [2022-04-15 07:36:14,897 INFO L290 TraceCheckUtils]: 14: Hoare triple {1048#true} assume !(0 == ~cond); {1048#true} is VALID [2022-04-15 07:36:14,897 INFO L290 TraceCheckUtils]: 15: Hoare triple {1048#true} assume true; {1048#true} is VALID [2022-04-15 07:36:14,897 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {1048#true} {1048#true} #63#return; {1048#true} is VALID [2022-04-15 07:36:14,897 INFO L290 TraceCheckUtils]: 17: Hoare triple {1048#true} ~v~0 := 2 * ~Y~0 - ~X~0;~y~0 := 0;~x~0 := 0; {1104#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (= main_~y~0 0))} is VALID [2022-04-15 07:36:14,898 INFO L290 TraceCheckUtils]: 18: Hoare triple {1104#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (= main_~y~0 0))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {1104#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (= main_~y~0 0))} is VALID [2022-04-15 07:36:14,898 INFO L272 TraceCheckUtils]: 19: Hoare triple {1104#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {1048#true} is VALID [2022-04-15 07:36:14,898 INFO L290 TraceCheckUtils]: 20: Hoare triple {1048#true} ~cond := #in~cond; {1048#true} is VALID [2022-04-15 07:36:14,898 INFO L290 TraceCheckUtils]: 21: Hoare triple {1048#true} assume !(0 == ~cond); {1048#true} is VALID [2022-04-15 07:36:14,898 INFO L290 TraceCheckUtils]: 22: Hoare triple {1048#true} assume true; {1048#true} is VALID [2022-04-15 07:36:14,899 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {1048#true} {1104#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (= main_~y~0 0))} #65#return; {1104#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (= main_~y~0 0))} is VALID [2022-04-15 07:36:14,900 INFO L290 TraceCheckUtils]: 24: Hoare triple {1104#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (= main_~y~0 0))} assume !!(~x~0 <= ~X~0); {1126#(and (<= main_~x~0 main_~X~0) (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (= main_~y~0 0))} is VALID [2022-04-15 07:36:14,900 INFO L290 TraceCheckUtils]: 25: Hoare triple {1126#(and (<= main_~x~0 main_~X~0) (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (= main_~y~0 0))} assume !(~v~0 < 0);~v~0 := ~v~0 + 2 * (~Y~0 - ~X~0);#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {1130#(and (<= main_~x~0 main_~X~0) (= main_~x~0 0) (= main_~y~0 1) (= main_~v~0 (+ (* main_~X~0 (- 3)) (* main_~Y~0 4))))} is VALID [2022-04-15 07:36:14,901 INFO L290 TraceCheckUtils]: 26: Hoare triple {1130#(and (<= main_~x~0 main_~X~0) (= main_~x~0 0) (= main_~y~0 1) (= main_~v~0 (+ (* main_~X~0 (- 3)) (* main_~Y~0 4))))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {1134#(and (= (+ (- 1) main_~x~0) 0) (= main_~y~0 1) (= main_~v~0 (+ (* main_~X~0 (- 3)) (* main_~Y~0 4))) (<= main_~x~0 (+ main_~X~0 1)))} is VALID [2022-04-15 07:36:14,902 INFO L290 TraceCheckUtils]: 27: Hoare triple {1134#(and (= (+ (- 1) main_~x~0) 0) (= main_~y~0 1) (= main_~v~0 (+ (* main_~X~0 (- 3)) (* main_~Y~0 4))) (<= main_~x~0 (+ main_~X~0 1)))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {1138#(and (= main_~v~0 (+ (* main_~X~0 (- 3)) (* main_~Y~0 4))) (= main_~X~0 main_~xy~0) (<= 0 main_~X~0) (= main_~Y~0 main_~yx~0))} is VALID [2022-04-15 07:36:14,902 INFO L272 TraceCheckUtils]: 28: Hoare triple {1138#(and (= main_~v~0 (+ (* main_~X~0 (- 3)) (* main_~Y~0 4))) (= main_~X~0 main_~xy~0) (<= 0 main_~X~0) (= main_~Y~0 main_~yx~0))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {1142#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 07:36:14,903 INFO L290 TraceCheckUtils]: 29: Hoare triple {1142#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1146#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 07:36:14,903 INFO L290 TraceCheckUtils]: 30: Hoare triple {1146#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1049#false} is VALID [2022-04-15 07:36:14,903 INFO L290 TraceCheckUtils]: 31: Hoare triple {1049#false} assume !false; {1049#false} is VALID [2022-04-15 07:36:14,903 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-15 07:36:14,903 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 07:36:15,104 INFO L290 TraceCheckUtils]: 31: Hoare triple {1049#false} assume !false; {1049#false} is VALID [2022-04-15 07:36:15,104 INFO L290 TraceCheckUtils]: 30: Hoare triple {1146#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1049#false} is VALID [2022-04-15 07:36:15,104 INFO L290 TraceCheckUtils]: 29: Hoare triple {1142#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1146#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 07:36:15,105 INFO L272 TraceCheckUtils]: 28: Hoare triple {1162#(= (+ (* 2 main_~xy~0) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 main_~yx~0)))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {1142#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 07:36:15,106 INFO L290 TraceCheckUtils]: 27: Hoare triple {1166#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {1162#(= (+ (* 2 main_~xy~0) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 main_~yx~0)))} is VALID [2022-04-15 07:36:15,153 INFO L290 TraceCheckUtils]: 26: Hoare triple {1170#(= (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0))))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {1166#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} is VALID [2022-04-15 07:36:15,155 INFO L290 TraceCheckUtils]: 25: Hoare triple {1166#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} assume !(~v~0 < 0);~v~0 := ~v~0 + 2 * (~Y~0 - ~X~0);#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {1170#(= (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0))))} is VALID [2022-04-15 07:36:15,156 INFO L290 TraceCheckUtils]: 24: Hoare triple {1177#(or (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (not (<= main_~x~0 main_~X~0)))} assume !!(~x~0 <= ~X~0); {1166#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} is VALID [2022-04-15 07:36:15,156 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {1048#true} {1177#(or (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (not (<= main_~x~0 main_~X~0)))} #65#return; {1177#(or (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (not (<= main_~x~0 main_~X~0)))} is VALID [2022-04-15 07:36:15,156 INFO L290 TraceCheckUtils]: 22: Hoare triple {1048#true} assume true; {1048#true} is VALID [2022-04-15 07:36:15,157 INFO L290 TraceCheckUtils]: 21: Hoare triple {1048#true} assume !(0 == ~cond); {1048#true} is VALID [2022-04-15 07:36:15,157 INFO L290 TraceCheckUtils]: 20: Hoare triple {1048#true} ~cond := #in~cond; {1048#true} is VALID [2022-04-15 07:36:15,157 INFO L272 TraceCheckUtils]: 19: Hoare triple {1177#(or (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (not (<= main_~x~0 main_~X~0)))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {1048#true} is VALID [2022-04-15 07:36:15,157 INFO L290 TraceCheckUtils]: 18: Hoare triple {1177#(or (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (not (<= main_~x~0 main_~X~0)))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {1177#(or (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (not (<= main_~x~0 main_~X~0)))} is VALID [2022-04-15 07:36:15,158 INFO L290 TraceCheckUtils]: 17: Hoare triple {1048#true} ~v~0 := 2 * ~Y~0 - ~X~0;~y~0 := 0;~x~0 := 0; {1177#(or (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (not (<= main_~x~0 main_~X~0)))} is VALID [2022-04-15 07:36:15,158 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {1048#true} {1048#true} #63#return; {1048#true} is VALID [2022-04-15 07:36:15,158 INFO L290 TraceCheckUtils]: 15: Hoare triple {1048#true} assume true; {1048#true} is VALID [2022-04-15 07:36:15,158 INFO L290 TraceCheckUtils]: 14: Hoare triple {1048#true} assume !(0 == ~cond); {1048#true} is VALID [2022-04-15 07:36:15,158 INFO L290 TraceCheckUtils]: 13: Hoare triple {1048#true} ~cond := #in~cond; {1048#true} is VALID [2022-04-15 07:36:15,158 INFO L272 TraceCheckUtils]: 12: Hoare triple {1048#true} call assume_abort_if_not((if ~Y~0 >= 0 && ~Y~0 <= 10 then 1 else 0)); {1048#true} is VALID [2022-04-15 07:36:15,158 INFO L290 TraceCheckUtils]: 11: Hoare triple {1048#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~Y~0 := #t~nondet5;havoc #t~nondet5; {1048#true} is VALID [2022-04-15 07:36:15,159 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1048#true} {1048#true} #61#return; {1048#true} is VALID [2022-04-15 07:36:15,159 INFO L290 TraceCheckUtils]: 9: Hoare triple {1048#true} assume true; {1048#true} is VALID [2022-04-15 07:36:15,159 INFO L290 TraceCheckUtils]: 8: Hoare triple {1048#true} assume !(0 == ~cond); {1048#true} is VALID [2022-04-15 07:36:15,159 INFO L290 TraceCheckUtils]: 7: Hoare triple {1048#true} ~cond := #in~cond; {1048#true} is VALID [2022-04-15 07:36:15,159 INFO L272 TraceCheckUtils]: 6: Hoare triple {1048#true} call assume_abort_if_not((if ~X~0 >= 0 && ~X~0 <= 10 then 1 else 0)); {1048#true} is VALID [2022-04-15 07:36:15,159 INFO L290 TraceCheckUtils]: 5: Hoare triple {1048#true} havoc ~X~0;havoc ~Y~0;havoc ~x~0;havoc ~y~0;havoc ~v~0;havoc ~xy~0;havoc ~yx~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~X~0 := #t~nondet4;havoc #t~nondet4; {1048#true} is VALID [2022-04-15 07:36:15,159 INFO L272 TraceCheckUtils]: 4: Hoare triple {1048#true} call #t~ret8 := main(); {1048#true} is VALID [2022-04-15 07:36:15,159 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1048#true} {1048#true} #69#return; {1048#true} is VALID [2022-04-15 07:36:15,159 INFO L290 TraceCheckUtils]: 2: Hoare triple {1048#true} assume true; {1048#true} is VALID [2022-04-15 07:36:15,159 INFO L290 TraceCheckUtils]: 1: Hoare triple {1048#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(15, 2);call #Ultimate.allocInit(12, 3); {1048#true} is VALID [2022-04-15 07:36:15,160 INFO L272 TraceCheckUtils]: 0: Hoare triple {1048#true} call ULTIMATE.init(); {1048#true} is VALID [2022-04-15 07:36:15,160 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-15 07:36:15,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:36:15,160 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1806471118] [2022-04-15 07:36:15,160 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 07:36:15,160 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2002163345] [2022-04-15 07:36:15,160 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2002163345] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 07:36:15,160 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 07:36:15,160 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 13 [2022-04-15 07:36:15,161 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:36:15,161 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [961540448] [2022-04-15 07:36:15,161 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [961540448] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:36:15,161 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:36:15,161 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-15 07:36:15,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1821636802] [2022-04-15 07:36:15,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:36:15,161 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.375) internal successors, (19), 8 states have internal predecessors, (19), 3 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 32 [2022-04-15 07:36:15,162 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:36:15,162 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 8 states have (on average 2.375) internal successors, (19), 8 states have internal predecessors, (19), 3 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-15 07:36:15,184 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:36:15,184 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-15 07:36:15,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:36:15,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-15 07:36:15,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2022-04-15 07:36:15,185 INFO L87 Difference]: Start difference. First operand 43 states and 47 transitions. Second operand has 9 states, 8 states have (on average 2.375) internal successors, (19), 8 states have internal predecessors, (19), 3 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-15 07:36:15,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:36:15,539 INFO L93 Difference]: Finished difference Result 56 states and 62 transitions. [2022-04-15 07:36:15,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-15 07:36:15,540 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.375) internal successors, (19), 8 states have internal predecessors, (19), 3 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 32 [2022-04-15 07:36:15,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:36:15,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 2.375) internal successors, (19), 8 states have internal predecessors, (19), 3 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-15 07:36:15,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 51 transitions. [2022-04-15 07:36:15,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 2.375) internal successors, (19), 8 states have internal predecessors, (19), 3 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-15 07:36:15,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 51 transitions. [2022-04-15 07:36:15,542 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 51 transitions. [2022-04-15 07:36:15,585 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-15 07:36:15,586 INFO L225 Difference]: With dead ends: 56 [2022-04-15 07:36:15,586 INFO L226 Difference]: Without dead ends: 54 [2022-04-15 07:36:15,586 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 50 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2022-04-15 07:36:15,587 INFO L913 BasicCegarLoop]: 27 mSDtfsCounter, 11 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 07:36:15,587 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 138 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 07:36:15,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2022-04-15 07:36:15,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 50. [2022-04-15 07:36:15,636 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:36:15,637 INFO L82 GeneralOperation]: Start isEquivalent. First operand 54 states. Second operand has 50 states, 34 states have (on average 1.1176470588235294) internal successors, (38), 36 states have internal predecessors, (38), 9 states have call successors, (9), 7 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-15 07:36:15,637 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand has 50 states, 34 states have (on average 1.1176470588235294) internal successors, (38), 36 states have internal predecessors, (38), 9 states have call successors, (9), 7 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-15 07:36:15,637 INFO L87 Difference]: Start difference. First operand 54 states. Second operand has 50 states, 34 states have (on average 1.1176470588235294) internal successors, (38), 36 states have internal predecessors, (38), 9 states have call successors, (9), 7 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-15 07:36:15,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:36:15,639 INFO L93 Difference]: Finished difference Result 54 states and 60 transitions. [2022-04-15 07:36:15,639 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 60 transitions. [2022-04-15 07:36:15,639 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:36:15,639 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:36:15,640 INFO L74 IsIncluded]: Start isIncluded. First operand has 50 states, 34 states have (on average 1.1176470588235294) internal successors, (38), 36 states have internal predecessors, (38), 9 states have call successors, (9), 7 states have call predecessors, (9), 6 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) Second operand 54 states. [2022-04-15 07:36:15,640 INFO L87 Difference]: Start difference. First operand has 50 states, 34 states have (on average 1.1176470588235294) internal successors, (38), 36 states have internal predecessors, (38), 9 states have call successors, (9), 7 states have call predecessors, (9), 6 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) Second operand 54 states. [2022-04-15 07:36:15,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:36:15,641 INFO L93 Difference]: Finished difference Result 54 states and 60 transitions. [2022-04-15 07:36:15,641 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 60 transitions. [2022-04-15 07:36:15,642 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:36:15,642 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:36:15,642 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:36:15,642 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:36:15,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 34 states have (on average 1.1176470588235294) internal successors, (38), 36 states have internal predecessors, (38), 9 states have call successors, (9), 7 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-15 07:36:15,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 54 transitions. [2022-04-15 07:36:15,643 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 54 transitions. Word has length 32 [2022-04-15 07:36:15,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:36:15,644 INFO L478 AbstractCegarLoop]: Abstraction has 50 states and 54 transitions. [2022-04-15 07:36:15,644 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.375) internal successors, (19), 8 states have internal predecessors, (19), 3 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-15 07:36:15,644 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 50 states and 54 transitions. [2022-04-15 07:36:15,700 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:36:15,700 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2022-04-15 07:36:15,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-04-15 07:36:15,701 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:36:15,701 INFO L499 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 07:36:15,718 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-04-15 07:36:15,901 WARN L460 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-15 07:36:15,902 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:36:15,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:36:15,902 INFO L85 PathProgramCache]: Analyzing trace with hash 125050924, now seen corresponding path program 1 times [2022-04-15 07:36:15,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:36:15,902 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1774635990] [2022-04-15 07:36:15,903 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 07:36:15,903 INFO L85 PathProgramCache]: Analyzing trace with hash 125050924, now seen corresponding path program 2 times [2022-04-15 07:36:15,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:36:15,903 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1567855689] [2022-04-15 07:36:15,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:36:15,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:36:15,916 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 07:36:15,916 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1960884111] [2022-04-15 07:36:15,916 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 07:36:15,916 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 07:36:15,916 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 07:36:15,919 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 07:36:15,920 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-04-15 07:36:15,962 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 07:36:15,962 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 07:36:15,963 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 30 conjunts are in the unsatisfiable core [2022-04-15 07:36:15,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:36:15,971 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 07:36:26,997 WARN L914 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-15 07:36:31,285 WARN L914 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-15 07:36:37,304 WARN L914 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-15 07:36:42,258 INFO L272 TraceCheckUtils]: 0: Hoare triple {1576#true} call ULTIMATE.init(); {1576#true} is VALID [2022-04-15 07:36:42,259 INFO L290 TraceCheckUtils]: 1: Hoare triple {1576#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(15, 2);call #Ultimate.allocInit(12, 3); {1576#true} is VALID [2022-04-15 07:36:42,259 INFO L290 TraceCheckUtils]: 2: Hoare triple {1576#true} assume true; {1576#true} is VALID [2022-04-15 07:36:42,259 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1576#true} {1576#true} #69#return; {1576#true} is VALID [2022-04-15 07:36:42,259 INFO L272 TraceCheckUtils]: 4: Hoare triple {1576#true} call #t~ret8 := main(); {1576#true} is VALID [2022-04-15 07:36:42,259 INFO L290 TraceCheckUtils]: 5: Hoare triple {1576#true} havoc ~X~0;havoc ~Y~0;havoc ~x~0;havoc ~y~0;havoc ~v~0;havoc ~xy~0;havoc ~yx~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~X~0 := #t~nondet4;havoc #t~nondet4; {1576#true} is VALID [2022-04-15 07:36:42,260 INFO L272 TraceCheckUtils]: 6: Hoare triple {1576#true} call assume_abort_if_not((if ~X~0 >= 0 && ~X~0 <= 10 then 1 else 0)); {1576#true} is VALID [2022-04-15 07:36:42,260 INFO L290 TraceCheckUtils]: 7: Hoare triple {1576#true} ~cond := #in~cond; {1576#true} is VALID [2022-04-15 07:36:42,260 INFO L290 TraceCheckUtils]: 8: Hoare triple {1576#true} assume !(0 == ~cond); {1576#true} is VALID [2022-04-15 07:36:42,260 INFO L290 TraceCheckUtils]: 9: Hoare triple {1576#true} assume true; {1576#true} is VALID [2022-04-15 07:36:42,260 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1576#true} {1576#true} #61#return; {1576#true} is VALID [2022-04-15 07:36:42,260 INFO L290 TraceCheckUtils]: 11: Hoare triple {1576#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~Y~0 := #t~nondet5;havoc #t~nondet5; {1576#true} is VALID [2022-04-15 07:36:42,260 INFO L272 TraceCheckUtils]: 12: Hoare triple {1576#true} call assume_abort_if_not((if ~Y~0 >= 0 && ~Y~0 <= 10 then 1 else 0)); {1576#true} is VALID [2022-04-15 07:36:42,260 INFO L290 TraceCheckUtils]: 13: Hoare triple {1576#true} ~cond := #in~cond; {1576#true} is VALID [2022-04-15 07:36:42,260 INFO L290 TraceCheckUtils]: 14: Hoare triple {1576#true} assume !(0 == ~cond); {1576#true} is VALID [2022-04-15 07:36:42,260 INFO L290 TraceCheckUtils]: 15: Hoare triple {1576#true} assume true; {1576#true} is VALID [2022-04-15 07:36:42,261 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {1576#true} {1576#true} #63#return; {1576#true} is VALID [2022-04-15 07:36:42,264 INFO L290 TraceCheckUtils]: 17: Hoare triple {1576#true} ~v~0 := 2 * ~Y~0 - ~X~0;~y~0 := 0;~x~0 := 0; {1632#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-15 07:36:42,264 INFO L290 TraceCheckUtils]: 18: Hoare triple {1632#(and (= main_~x~0 0) (= main_~y~0 0))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {1632#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-15 07:36:42,264 INFO L272 TraceCheckUtils]: 19: Hoare triple {1632#(and (= main_~x~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {1576#true} is VALID [2022-04-15 07:36:42,264 INFO L290 TraceCheckUtils]: 20: Hoare triple {1576#true} ~cond := #in~cond; {1642#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-15 07:36:42,265 INFO L290 TraceCheckUtils]: 21: Hoare triple {1642#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {1646#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:36:42,265 INFO L290 TraceCheckUtils]: 22: Hoare triple {1646#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {1646#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:36:42,266 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {1646#(not (= |__VERIFIER_assert_#in~cond| 0))} {1632#(and (= main_~x~0 0) (= main_~y~0 0))} #65#return; {1632#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-15 07:36:42,266 INFO L290 TraceCheckUtils]: 24: Hoare triple {1632#(and (= main_~x~0 0) (= main_~y~0 0))} assume !!(~x~0 <= ~X~0); {1656#(and (<= main_~x~0 main_~X~0) (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-15 07:36:42,266 INFO L290 TraceCheckUtils]: 25: Hoare triple {1656#(and (<= main_~x~0 main_~X~0) (= main_~x~0 0) (= main_~y~0 0))} assume !(~v~0 < 0);~v~0 := ~v~0 + 2 * (~Y~0 - ~X~0);#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {1660#(and (<= main_~x~0 main_~X~0) (= main_~x~0 0) (= (+ (- 1) main_~y~0) 0))} is VALID [2022-04-15 07:36:42,267 INFO L290 TraceCheckUtils]: 26: Hoare triple {1660#(and (<= main_~x~0 main_~X~0) (= main_~x~0 0) (= (+ (- 1) main_~y~0) 0))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {1664#(and (= (+ (- 1) main_~y~0) 0) (<= main_~x~0 1) (<= 0 main_~X~0))} is VALID [2022-04-15 07:36:42,267 INFO L290 TraceCheckUtils]: 27: Hoare triple {1664#(and (= (+ (- 1) main_~y~0) 0) (<= main_~x~0 1) (<= 0 main_~X~0))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {1668#(and (= (+ (- 1) main_~y~0) 0) (<= main_~x~0 1) (<= 0 main_~X~0) (= (* main_~X~0 main_~y~0) main_~xy~0) (= main_~yx~0 (* main_~Y~0 main_~x~0)))} is VALID [2022-04-15 07:36:42,267 INFO L272 TraceCheckUtils]: 28: Hoare triple {1668#(and (= (+ (- 1) main_~y~0) 0) (<= main_~x~0 1) (<= 0 main_~X~0) (= (* main_~X~0 main_~y~0) main_~xy~0) (= main_~yx~0 (* main_~Y~0 main_~x~0)))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {1576#true} is VALID [2022-04-15 07:36:42,268 INFO L290 TraceCheckUtils]: 29: Hoare triple {1576#true} ~cond := #in~cond; {1642#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-15 07:36:42,268 INFO L290 TraceCheckUtils]: 30: Hoare triple {1642#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {1646#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:36:42,268 INFO L290 TraceCheckUtils]: 31: Hoare triple {1646#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {1646#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:36:42,269 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {1646#(not (= |__VERIFIER_assert_#in~cond| 0))} {1668#(and (= (+ (- 1) main_~y~0) 0) (<= main_~x~0 1) (<= 0 main_~X~0) (= (* main_~X~0 main_~y~0) main_~xy~0) (= main_~yx~0 (* main_~Y~0 main_~x~0)))} #65#return; {1684#(and (= (+ (- 1) main_~y~0) 0) (<= main_~x~0 1) (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (<= 0 main_~X~0))} is VALID [2022-04-15 07:36:42,270 INFO L290 TraceCheckUtils]: 33: Hoare triple {1684#(and (= (+ (- 1) main_~y~0) 0) (<= main_~x~0 1) (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (<= 0 main_~X~0))} assume !(~x~0 <= ~X~0); {1688#(and (= (+ (- 1) main_~y~0) 0) (<= main_~x~0 1) (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (<= 0 main_~X~0) (not (<= main_~x~0 main_~X~0)))} is VALID [2022-04-15 07:36:42,276 INFO L290 TraceCheckUtils]: 34: Hoare triple {1688#(and (= (+ (- 1) main_~y~0) 0) (<= main_~x~0 1) (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (<= 0 main_~X~0) (not (<= main_~x~0 main_~X~0)))} ~xy~0 := ~x~0 * ~y~0;~yx~0 := ~Y~0 * ~x~0; {1692#(and (= (+ (- 1) main_~y~0) 0) (<= 0 main_~X~0) (or (and (= (mod (+ (* main_~X~0 main_~y~0 2) main_~X~0 main_~v~0) 2) 0) (< main_~X~0 (div main_~xy~0 main_~y~0)) (= main_~yx~0 0) (= 0 (+ (* main_~X~0 main_~y~0) (div (+ main_~X~0 main_~v~0) 2) (* (- 1) main_~Y~0))) (<= (div main_~xy~0 main_~y~0) 1) (= main_~Y~0 0)) (and (= (* main_~y~0 (div (+ (* main_~X~0 main_~y~0) (div (+ main_~X~0 main_~v~0) 2) (* (- 1) main_~Y~0)) main_~Y~0)) main_~xy~0) (= (mod (+ (* main_~X~0 main_~y~0) (div (+ main_~X~0 main_~v~0) 2) (* (- 1) main_~Y~0)) main_~Y~0) 0) (= (mod (+ (* main_~X~0 main_~y~0 2) main_~X~0 main_~v~0) 2) 0) (<= (div (+ (* main_~X~0 main_~y~0) (div (+ main_~X~0 main_~v~0) 2) (* (- 1) main_~Y~0)) main_~Y~0) 1) (not (<= (div (+ (* main_~X~0 main_~y~0) (div (+ main_~X~0 main_~v~0) 2) (* (- 1) main_~Y~0)) main_~Y~0) main_~X~0)) (not (= main_~Y~0 0)) (= main_~yx~0 (* main_~Y~0 (div (+ (* main_~X~0 main_~y~0) (div (+ main_~X~0 main_~v~0) 2) (* (- 1) main_~Y~0)) main_~Y~0))))))} is VALID [2022-04-15 07:36:42,277 INFO L272 TraceCheckUtils]: 35: Hoare triple {1692#(and (= (+ (- 1) main_~y~0) 0) (<= 0 main_~X~0) (or (and (= (mod (+ (* main_~X~0 main_~y~0 2) main_~X~0 main_~v~0) 2) 0) (< main_~X~0 (div main_~xy~0 main_~y~0)) (= main_~yx~0 0) (= 0 (+ (* main_~X~0 main_~y~0) (div (+ main_~X~0 main_~v~0) 2) (* (- 1) main_~Y~0))) (<= (div main_~xy~0 main_~y~0) 1) (= main_~Y~0 0)) (and (= (* main_~y~0 (div (+ (* main_~X~0 main_~y~0) (div (+ main_~X~0 main_~v~0) 2) (* (- 1) main_~Y~0)) main_~Y~0)) main_~xy~0) (= (mod (+ (* main_~X~0 main_~y~0) (div (+ main_~X~0 main_~v~0) 2) (* (- 1) main_~Y~0)) main_~Y~0) 0) (= (mod (+ (* main_~X~0 main_~y~0 2) main_~X~0 main_~v~0) 2) 0) (<= (div (+ (* main_~X~0 main_~y~0) (div (+ main_~X~0 main_~v~0) 2) (* (- 1) main_~Y~0)) main_~Y~0) 1) (not (<= (div (+ (* main_~X~0 main_~y~0) (div (+ main_~X~0 main_~v~0) 2) (* (- 1) main_~Y~0)) main_~Y~0) main_~X~0)) (not (= main_~Y~0 0)) (= main_~yx~0 (* main_~Y~0 (div (+ (* main_~X~0 main_~y~0) (div (+ main_~X~0 main_~v~0) 2) (* (- 1) main_~Y~0)) main_~Y~0))))))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 + 2 * ~y~0 then 1 else 0)); {1696#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 07:36:42,278 INFO L290 TraceCheckUtils]: 36: Hoare triple {1696#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1700#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 07:36:42,278 INFO L290 TraceCheckUtils]: 37: Hoare triple {1700#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1577#false} is VALID [2022-04-15 07:36:42,278 INFO L290 TraceCheckUtils]: 38: Hoare triple {1577#false} assume !false; {1577#false} is VALID [2022-04-15 07:36:42,278 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-04-15 07:36:42,278 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 07:36:52,284 INFO L290 TraceCheckUtils]: 38: Hoare triple {1577#false} assume !false; {1577#false} is VALID [2022-04-15 07:36:52,284 INFO L290 TraceCheckUtils]: 37: Hoare triple {1700#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1577#false} is VALID [2022-04-15 07:36:52,284 INFO L290 TraceCheckUtils]: 36: Hoare triple {1696#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1700#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 07:36:52,285 INFO L272 TraceCheckUtils]: 35: Hoare triple {1716#(= (+ (* main_~y~0 2) (* main_~Y~0 2) (* 2 main_~yx~0)) (+ (* 2 main_~xy~0) main_~X~0 main_~v~0))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 + 2 * ~y~0 then 1 else 0)); {1696#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 07:36:52,286 INFO L290 TraceCheckUtils]: 34: Hoare triple {1720#(= (+ (* 2 (* main_~y~0 main_~x~0)) main_~X~0 main_~v~0) (+ (* main_~y~0 2) (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))))} ~xy~0 := ~x~0 * ~y~0;~yx~0 := ~Y~0 * ~x~0; {1716#(= (+ (* main_~y~0 2) (* main_~Y~0 2) (* 2 main_~yx~0)) (+ (* 2 main_~xy~0) main_~X~0 main_~v~0))} is VALID [2022-04-15 07:36:52,286 INFO L290 TraceCheckUtils]: 33: Hoare triple {1724#(or (<= main_~x~0 main_~X~0) (= (+ (* 2 (* main_~y~0 main_~x~0)) main_~X~0 main_~v~0) (+ (* main_~y~0 2) (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0)))))} assume !(~x~0 <= ~X~0); {1720#(= (+ (* 2 (* main_~y~0 main_~x~0)) main_~X~0 main_~v~0) (+ (* main_~y~0 2) (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))))} is VALID [2022-04-15 07:36:52,288 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {1646#(not (= |__VERIFIER_assert_#in~cond| 0))} {1728#(or (<= main_~x~0 main_~X~0) (= (+ (* 2 (* main_~y~0 main_~x~0)) (* (- 2) main_~xy~0) (* main_~Y~0 2) (* 2 main_~yx~0)) (+ (* main_~y~0 2) (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0)))))} #65#return; {1724#(or (<= main_~x~0 main_~X~0) (= (+ (* 2 (* main_~y~0 main_~x~0)) main_~X~0 main_~v~0) (+ (* main_~y~0 2) (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0)))))} is VALID [2022-04-15 07:36:52,288 INFO L290 TraceCheckUtils]: 31: Hoare triple {1646#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {1646#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:36:52,288 INFO L290 TraceCheckUtils]: 30: Hoare triple {1738#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {1646#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:36:52,289 INFO L290 TraceCheckUtils]: 29: Hoare triple {1576#true} ~cond := #in~cond; {1738#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 07:36:52,289 INFO L272 TraceCheckUtils]: 28: Hoare triple {1728#(or (<= main_~x~0 main_~X~0) (= (+ (* 2 (* main_~y~0 main_~x~0)) (* (- 2) main_~xy~0) (* main_~Y~0 2) (* 2 main_~yx~0)) (+ (* main_~y~0 2) (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0)))))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {1576#true} is VALID [2022-04-15 07:36:52,289 INFO L290 TraceCheckUtils]: 27: Hoare triple {1745#(or (<= main_~x~0 main_~X~0) (= (+ (* 2 (* main_~y~0 main_~x~0)) (* main_~Y~0 2) (* (* main_~X~0 main_~y~0) (- 2)) (* 2 (* main_~Y~0 main_~x~0))) (+ (* main_~y~0 2) (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0)))))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {1728#(or (<= main_~x~0 main_~X~0) (= (+ (* 2 (* main_~y~0 main_~x~0)) (* (- 2) main_~xy~0) (* main_~Y~0 2) (* 2 main_~yx~0)) (+ (* main_~y~0 2) (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0)))))} is VALID [2022-04-15 07:36:52,290 INFO L290 TraceCheckUtils]: 26: Hoare triple {1749#(forall ((v_main_~x~0_16 Int)) (or (<= v_main_~x~0_16 main_~X~0) (not (<= v_main_~x~0_16 (+ main_~x~0 1))) (= (+ (* (* v_main_~x~0_16 main_~Y~0) 2) (* main_~y~0 2) (* main_~Y~0 2)) (+ (* 2 (* v_main_~x~0_16 main_~y~0)) (* (* v_main_~x~0_16 main_~Y~0) 2) (* main_~Y~0 2) (* (* main_~X~0 main_~y~0) (- 2))))))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {1745#(or (<= main_~x~0 main_~X~0) (= (+ (* 2 (* main_~y~0 main_~x~0)) (* main_~Y~0 2) (* (* main_~X~0 main_~y~0) (- 2)) (* 2 (* main_~Y~0 main_~x~0))) (+ (* main_~y~0 2) (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0)))))} is VALID [2022-04-15 07:36:52,293 INFO L290 TraceCheckUtils]: 25: Hoare triple {1753#(forall ((v_main_~x~0_16 Int)) (or (<= v_main_~x~0_16 main_~X~0) (not (<= v_main_~x~0_16 (+ main_~x~0 1))) (= (+ (* (* v_main_~x~0_16 main_~Y~0) 2) (* (* v_main_~x~0_16 (+ main_~y~0 1)) 2) (* main_~Y~0 2) (* (* main_~X~0 (+ main_~y~0 1)) (- 2))) (+ (* (* v_main_~x~0_16 main_~Y~0) 2) 2 (* main_~y~0 2) (* main_~Y~0 2)))))} assume !(~v~0 < 0);~v~0 := ~v~0 + 2 * (~Y~0 - ~X~0);#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {1749#(forall ((v_main_~x~0_16 Int)) (or (<= v_main_~x~0_16 main_~X~0) (not (<= v_main_~x~0_16 (+ main_~x~0 1))) (= (+ (* (* v_main_~x~0_16 main_~Y~0) 2) (* main_~y~0 2) (* main_~Y~0 2)) (+ (* 2 (* v_main_~x~0_16 main_~y~0)) (* (* v_main_~x~0_16 main_~Y~0) 2) (* main_~Y~0 2) (* (* main_~X~0 main_~y~0) (- 2))))))} is VALID [2022-04-15 07:36:52,294 INFO L290 TraceCheckUtils]: 24: Hoare triple {1576#true} assume !!(~x~0 <= ~X~0); {1753#(forall ((v_main_~x~0_16 Int)) (or (<= v_main_~x~0_16 main_~X~0) (not (<= v_main_~x~0_16 (+ main_~x~0 1))) (= (+ (* (* v_main_~x~0_16 main_~Y~0) 2) (* (* v_main_~x~0_16 (+ main_~y~0 1)) 2) (* main_~Y~0 2) (* (* main_~X~0 (+ main_~y~0 1)) (- 2))) (+ (* (* v_main_~x~0_16 main_~Y~0) 2) 2 (* main_~y~0 2) (* main_~Y~0 2)))))} is VALID [2022-04-15 07:36:52,294 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {1576#true} {1576#true} #65#return; {1576#true} is VALID [2022-04-15 07:36:52,294 INFO L290 TraceCheckUtils]: 22: Hoare triple {1576#true} assume true; {1576#true} is VALID [2022-04-15 07:36:52,294 INFO L290 TraceCheckUtils]: 21: Hoare triple {1576#true} assume !(0 == ~cond); {1576#true} is VALID [2022-04-15 07:36:52,294 INFO L290 TraceCheckUtils]: 20: Hoare triple {1576#true} ~cond := #in~cond; {1576#true} is VALID [2022-04-15 07:36:52,295 INFO L272 TraceCheckUtils]: 19: Hoare triple {1576#true} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {1576#true} is VALID [2022-04-15 07:36:52,295 INFO L290 TraceCheckUtils]: 18: Hoare triple {1576#true} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {1576#true} is VALID [2022-04-15 07:36:52,295 INFO L290 TraceCheckUtils]: 17: Hoare triple {1576#true} ~v~0 := 2 * ~Y~0 - ~X~0;~y~0 := 0;~x~0 := 0; {1576#true} is VALID [2022-04-15 07:36:52,295 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {1576#true} {1576#true} #63#return; {1576#true} is VALID [2022-04-15 07:36:52,295 INFO L290 TraceCheckUtils]: 15: Hoare triple {1576#true} assume true; {1576#true} is VALID [2022-04-15 07:36:52,295 INFO L290 TraceCheckUtils]: 14: Hoare triple {1576#true} assume !(0 == ~cond); {1576#true} is VALID [2022-04-15 07:36:52,295 INFO L290 TraceCheckUtils]: 13: Hoare triple {1576#true} ~cond := #in~cond; {1576#true} is VALID [2022-04-15 07:36:52,295 INFO L272 TraceCheckUtils]: 12: Hoare triple {1576#true} call assume_abort_if_not((if ~Y~0 >= 0 && ~Y~0 <= 10 then 1 else 0)); {1576#true} is VALID [2022-04-15 07:36:52,296 INFO L290 TraceCheckUtils]: 11: Hoare triple {1576#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~Y~0 := #t~nondet5;havoc #t~nondet5; {1576#true} is VALID [2022-04-15 07:36:52,296 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1576#true} {1576#true} #61#return; {1576#true} is VALID [2022-04-15 07:36:52,296 INFO L290 TraceCheckUtils]: 9: Hoare triple {1576#true} assume true; {1576#true} is VALID [2022-04-15 07:36:52,296 INFO L290 TraceCheckUtils]: 8: Hoare triple {1576#true} assume !(0 == ~cond); {1576#true} is VALID [2022-04-15 07:36:52,296 INFO L290 TraceCheckUtils]: 7: Hoare triple {1576#true} ~cond := #in~cond; {1576#true} is VALID [2022-04-15 07:36:52,296 INFO L272 TraceCheckUtils]: 6: Hoare triple {1576#true} call assume_abort_if_not((if ~X~0 >= 0 && ~X~0 <= 10 then 1 else 0)); {1576#true} is VALID [2022-04-15 07:36:52,296 INFO L290 TraceCheckUtils]: 5: Hoare triple {1576#true} havoc ~X~0;havoc ~Y~0;havoc ~x~0;havoc ~y~0;havoc ~v~0;havoc ~xy~0;havoc ~yx~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~X~0 := #t~nondet4;havoc #t~nondet4; {1576#true} is VALID [2022-04-15 07:36:52,296 INFO L272 TraceCheckUtils]: 4: Hoare triple {1576#true} call #t~ret8 := main(); {1576#true} is VALID [2022-04-15 07:36:52,297 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1576#true} {1576#true} #69#return; {1576#true} is VALID [2022-04-15 07:36:52,297 INFO L290 TraceCheckUtils]: 2: Hoare triple {1576#true} assume true; {1576#true} is VALID [2022-04-15 07:36:52,297 INFO L290 TraceCheckUtils]: 1: Hoare triple {1576#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(15, 2);call #Ultimate.allocInit(12, 3); {1576#true} is VALID [2022-04-15 07:36:52,297 INFO L272 TraceCheckUtils]: 0: Hoare triple {1576#true} call ULTIMATE.init(); {1576#true} is VALID [2022-04-15 07:36:52,297 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-04-15 07:36:52,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:36:52,298 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1567855689] [2022-04-15 07:36:52,298 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 07:36:52,298 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1960884111] [2022-04-15 07:36:52,298 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1960884111] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 07:36:52,298 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 07:36:52,298 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 22 [2022-04-15 07:36:52,298 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:36:52,298 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1774635990] [2022-04-15 07:36:52,299 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1774635990] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:36:52,299 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:36:52,299 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-15 07:36:52,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1974491774] [2022-04-15 07:36:52,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:36:52,299 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 1.75) internal successors, (21), 12 states have internal predecessors, (21), 4 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 39 [2022-04-15 07:36:52,300 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:36:52,300 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 12 states have (on average 1.75) internal successors, (21), 12 states have internal predecessors, (21), 4 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-15 07:36:52,335 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:36:52,335 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-15 07:36:52,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:36:52,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-15 07:36:52,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=388, Unknown=0, NotChecked=0, Total=462 [2022-04-15 07:36:52,336 INFO L87 Difference]: Start difference. First operand 50 states and 54 transitions. Second operand has 14 states, 12 states have (on average 1.75) internal successors, (21), 12 states have internal predecessors, (21), 4 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-15 07:36:53,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:36:53,690 INFO L93 Difference]: Finished difference Result 61 states and 66 transitions. [2022-04-15 07:36:53,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-15 07:36:53,690 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 1.75) internal successors, (21), 12 states have internal predecessors, (21), 4 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 39 [2022-04-15 07:36:53,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:36:53,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 12 states have (on average 1.75) internal successors, (21), 12 states have internal predecessors, (21), 4 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-15 07:36:53,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 53 transitions. [2022-04-15 07:36:53,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 12 states have (on average 1.75) internal successors, (21), 12 states have internal predecessors, (21), 4 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-15 07:36:53,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 53 transitions. [2022-04-15 07:36:53,694 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 53 transitions. [2022-04-15 07:36:53,750 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-15 07:36:53,752 INFO L225 Difference]: With dead ends: 61 [2022-04-15 07:36:53,752 INFO L226 Difference]: Without dead ends: 53 [2022-04-15 07:36:53,752 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 56 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=116, Invalid=586, Unknown=0, NotChecked=0, Total=702 [2022-04-15 07:36:53,753 INFO L913 BasicCegarLoop]: 23 mSDtfsCounter, 16 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 295 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 219 SdHoareTripleChecker+Invalid, 299 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 295 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-15 07:36:53,753 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [17 Valid, 219 Invalid, 299 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 295 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-15 07:36:53,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-04-15 07:36:53,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 43. [2022-04-15 07:36:53,802 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:36:53,803 INFO L82 GeneralOperation]: Start isEquivalent. First operand 53 states. Second operand has 43 states, 29 states have (on average 1.1379310344827587) internal successors, (33), 30 states have internal predecessors, (33), 8 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-15 07:36:53,803 INFO L74 IsIncluded]: Start isIncluded. First operand 53 states. Second operand has 43 states, 29 states have (on average 1.1379310344827587) internal successors, (33), 30 states have internal predecessors, (33), 8 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-15 07:36:53,804 INFO L87 Difference]: Start difference. First operand 53 states. Second operand has 43 states, 29 states have (on average 1.1379310344827587) internal successors, (33), 30 states have internal predecessors, (33), 8 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-15 07:36:53,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:36:53,806 INFO L93 Difference]: Finished difference Result 53 states and 58 transitions. [2022-04-15 07:36:53,806 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 58 transitions. [2022-04-15 07:36:53,809 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:36:53,809 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:36:53,809 INFO L74 IsIncluded]: Start isIncluded. First operand has 43 states, 29 states have (on average 1.1379310344827587) internal successors, (33), 30 states have internal predecessors, (33), 8 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 53 states. [2022-04-15 07:36:53,809 INFO L87 Difference]: Start difference. First operand has 43 states, 29 states have (on average 1.1379310344827587) internal successors, (33), 30 states have internal predecessors, (33), 8 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 53 states. [2022-04-15 07:36:53,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:36:53,819 INFO L93 Difference]: Finished difference Result 53 states and 58 transitions. [2022-04-15 07:36:53,819 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 58 transitions. [2022-04-15 07:36:53,819 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:36:53,819 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:36:53,819 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:36:53,819 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:36:53,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 29 states have (on average 1.1379310344827587) internal successors, (33), 30 states have internal predecessors, (33), 8 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-15 07:36:53,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 47 transitions. [2022-04-15 07:36:53,823 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 47 transitions. Word has length 39 [2022-04-15 07:36:53,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:36:53,823 INFO L478 AbstractCegarLoop]: Abstraction has 43 states and 47 transitions. [2022-04-15 07:36:53,823 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 1.75) internal successors, (21), 12 states have internal predecessors, (21), 4 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-15 07:36:53,823 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 43 states and 47 transitions. [2022-04-15 07:36:53,873 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:36:53,873 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2022-04-15 07:36:53,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-04-15 07:36:53,874 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:36:53,874 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 07:36:53,890 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-04-15 07:36:54,083 WARN L460 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-15 07:36:54,083 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:36:54,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:36:54,084 INFO L85 PathProgramCache]: Analyzing trace with hash 733948825, now seen corresponding path program 3 times [2022-04-15 07:36:54,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:36:54,084 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1889042084] [2022-04-15 07:36:54,084 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 07:36:54,084 INFO L85 PathProgramCache]: Analyzing trace with hash 733948825, now seen corresponding path program 4 times [2022-04-15 07:36:54,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:36:54,085 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273788130] [2022-04-15 07:36:54,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:36:54,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:36:54,109 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 07:36:54,109 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [311618394] [2022-04-15 07:36:54,109 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 07:36:54,110 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 07:36:54,110 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 07:36:54,111 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 07:36:54,112 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-04-15 07:36:54,150 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 07:36:54,151 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 07:36:54,152 INFO L263 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 39 conjunts are in the unsatisfiable core [2022-04-15 07:36:54,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:36:54,167 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 07:36:54,897 INFO L272 TraceCheckUtils]: 0: Hoare triple {2155#true} call ULTIMATE.init(); {2155#true} is VALID [2022-04-15 07:36:54,897 INFO L290 TraceCheckUtils]: 1: Hoare triple {2155#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(15, 2);call #Ultimate.allocInit(12, 3); {2155#true} is VALID [2022-04-15 07:36:54,897 INFO L290 TraceCheckUtils]: 2: Hoare triple {2155#true} assume true; {2155#true} is VALID [2022-04-15 07:36:54,897 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2155#true} {2155#true} #69#return; {2155#true} is VALID [2022-04-15 07:36:54,897 INFO L272 TraceCheckUtils]: 4: Hoare triple {2155#true} call #t~ret8 := main(); {2155#true} is VALID [2022-04-15 07:36:54,897 INFO L290 TraceCheckUtils]: 5: Hoare triple {2155#true} havoc ~X~0;havoc ~Y~0;havoc ~x~0;havoc ~y~0;havoc ~v~0;havoc ~xy~0;havoc ~yx~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~X~0 := #t~nondet4;havoc #t~nondet4; {2155#true} is VALID [2022-04-15 07:36:54,898 INFO L272 TraceCheckUtils]: 6: Hoare triple {2155#true} call assume_abort_if_not((if ~X~0 >= 0 && ~X~0 <= 10 then 1 else 0)); {2155#true} is VALID [2022-04-15 07:36:54,898 INFO L290 TraceCheckUtils]: 7: Hoare triple {2155#true} ~cond := #in~cond; {2181#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-15 07:36:54,898 INFO L290 TraceCheckUtils]: 8: Hoare triple {2181#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {2185#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 07:36:54,899 INFO L290 TraceCheckUtils]: 9: Hoare triple {2185#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {2185#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 07:36:54,899 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2185#(not (= |assume_abort_if_not_#in~cond| 0))} {2155#true} #61#return; {2192#(and (<= main_~X~0 10) (<= 0 main_~X~0))} is VALID [2022-04-15 07:36:54,900 INFO L290 TraceCheckUtils]: 11: Hoare triple {2192#(and (<= main_~X~0 10) (<= 0 main_~X~0))} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~Y~0 := #t~nondet5;havoc #t~nondet5; {2192#(and (<= main_~X~0 10) (<= 0 main_~X~0))} is VALID [2022-04-15 07:36:54,900 INFO L272 TraceCheckUtils]: 12: Hoare triple {2192#(and (<= main_~X~0 10) (<= 0 main_~X~0))} call assume_abort_if_not((if ~Y~0 >= 0 && ~Y~0 <= 10 then 1 else 0)); {2155#true} is VALID [2022-04-15 07:36:54,900 INFO L290 TraceCheckUtils]: 13: Hoare triple {2155#true} ~cond := #in~cond; {2181#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-15 07:36:54,901 INFO L290 TraceCheckUtils]: 14: Hoare triple {2181#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {2185#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 07:36:54,901 INFO L290 TraceCheckUtils]: 15: Hoare triple {2185#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {2185#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 07:36:54,902 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {2185#(not (= |assume_abort_if_not_#in~cond| 0))} {2192#(and (<= main_~X~0 10) (<= 0 main_~X~0))} #63#return; {2211#(and (<= main_~X~0 10) (<= 0 main_~Y~0) (<= 0 main_~X~0) (<= main_~Y~0 10))} is VALID [2022-04-15 07:36:54,902 INFO L290 TraceCheckUtils]: 17: Hoare triple {2211#(and (<= main_~X~0 10) (<= 0 main_~Y~0) (<= 0 main_~X~0) (<= main_~Y~0 10))} ~v~0 := 2 * ~Y~0 - ~X~0;~y~0 := 0;~x~0 := 0; {2215#(and (= main_~x~0 0) (<= main_~X~0 10) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (<= 0 main_~Y~0) (<= 0 main_~X~0) (= main_~y~0 0) (<= main_~Y~0 10))} is VALID [2022-04-15 07:36:54,903 INFO L290 TraceCheckUtils]: 18: Hoare triple {2215#(and (= main_~x~0 0) (<= main_~X~0 10) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (<= 0 main_~Y~0) (<= 0 main_~X~0) (= main_~y~0 0) (<= main_~Y~0 10))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {2219#(and (= main_~x~0 0) (<= main_~X~0 10) (<= (* main_~Y~0 main_~x~0) main_~yx~0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (<= 0 main_~Y~0) (<= 0 main_~X~0) (= main_~y~0 0) (<= main_~Y~0 10) (<= main_~xy~0 (* main_~X~0 main_~y~0)))} is VALID [2022-04-15 07:36:54,903 INFO L272 TraceCheckUtils]: 19: Hoare triple {2219#(and (= main_~x~0 0) (<= main_~X~0 10) (<= (* main_~Y~0 main_~x~0) main_~yx~0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (<= 0 main_~Y~0) (<= 0 main_~X~0) (= main_~y~0 0) (<= main_~Y~0 10) (<= main_~xy~0 (* main_~X~0 main_~y~0)))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {2155#true} is VALID [2022-04-15 07:36:54,903 INFO L290 TraceCheckUtils]: 20: Hoare triple {2155#true} ~cond := #in~cond; {2226#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-15 07:36:54,904 INFO L290 TraceCheckUtils]: 21: Hoare triple {2226#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {2230#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:36:54,904 INFO L290 TraceCheckUtils]: 22: Hoare triple {2230#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {2230#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:36:54,905 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {2230#(not (= |__VERIFIER_assert_#in~cond| 0))} {2219#(and (= main_~x~0 0) (<= main_~X~0 10) (<= (* main_~Y~0 main_~x~0) main_~yx~0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (<= 0 main_~Y~0) (<= 0 main_~X~0) (= main_~y~0 0) (<= main_~Y~0 10) (<= main_~xy~0 (* main_~X~0 main_~y~0)))} #65#return; {2215#(and (= main_~x~0 0) (<= main_~X~0 10) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (<= 0 main_~Y~0) (<= 0 main_~X~0) (= main_~y~0 0) (<= main_~Y~0 10))} is VALID [2022-04-15 07:36:54,906 INFO L290 TraceCheckUtils]: 24: Hoare triple {2215#(and (= main_~x~0 0) (<= main_~X~0 10) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (<= 0 main_~Y~0) (<= 0 main_~X~0) (= main_~y~0 0) (<= main_~Y~0 10))} assume !!(~x~0 <= ~X~0); {2215#(and (= main_~x~0 0) (<= main_~X~0 10) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (<= 0 main_~Y~0) (<= 0 main_~X~0) (= main_~y~0 0) (<= main_~Y~0 10))} is VALID [2022-04-15 07:36:54,907 INFO L290 TraceCheckUtils]: 25: Hoare triple {2215#(and (= main_~x~0 0) (<= main_~X~0 10) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (<= 0 main_~Y~0) (<= 0 main_~X~0) (= main_~y~0 0) (<= main_~Y~0 10))} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {2243#(and (= main_~x~0 0) (<= main_~X~0 10) (<= 0 main_~Y~0) (<= 0 main_~X~0) (= main_~y~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) (+ main_~v~0 (* (- 2) main_~Y~0))) (<= main_~Y~0 10))} is VALID [2022-04-15 07:36:54,907 INFO L290 TraceCheckUtils]: 26: Hoare triple {2243#(and (= main_~x~0 0) (<= main_~X~0 10) (<= 0 main_~Y~0) (<= 0 main_~X~0) (= main_~y~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) (+ main_~v~0 (* (- 2) main_~Y~0))) (<= main_~Y~0 10))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {2247#(and (<= main_~X~0 10) (= main_~x~0 1) (<= 0 main_~Y~0) (<= 0 main_~X~0) (= main_~y~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) (+ main_~v~0 (* (- 2) main_~Y~0))) (<= main_~Y~0 10))} is VALID [2022-04-15 07:36:54,908 INFO L290 TraceCheckUtils]: 27: Hoare triple {2247#(and (<= main_~X~0 10) (= main_~x~0 1) (<= 0 main_~Y~0) (<= 0 main_~X~0) (= main_~y~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) (+ main_~v~0 (* (- 2) main_~Y~0))) (<= main_~Y~0 10))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {2247#(and (<= main_~X~0 10) (= main_~x~0 1) (<= 0 main_~Y~0) (<= 0 main_~X~0) (= main_~y~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) (+ main_~v~0 (* (- 2) main_~Y~0))) (<= main_~Y~0 10))} is VALID [2022-04-15 07:36:54,908 INFO L272 TraceCheckUtils]: 28: Hoare triple {2247#(and (<= main_~X~0 10) (= main_~x~0 1) (<= 0 main_~Y~0) (<= 0 main_~X~0) (= main_~y~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) (+ main_~v~0 (* (- 2) main_~Y~0))) (<= main_~Y~0 10))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {2155#true} is VALID [2022-04-15 07:36:54,908 INFO L290 TraceCheckUtils]: 29: Hoare triple {2155#true} ~cond := #in~cond; {2155#true} is VALID [2022-04-15 07:36:54,908 INFO L290 TraceCheckUtils]: 30: Hoare triple {2155#true} assume !(0 == ~cond); {2155#true} is VALID [2022-04-15 07:36:54,909 INFO L290 TraceCheckUtils]: 31: Hoare triple {2155#true} assume true; {2155#true} is VALID [2022-04-15 07:36:54,909 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {2155#true} {2247#(and (<= main_~X~0 10) (= main_~x~0 1) (<= 0 main_~Y~0) (<= 0 main_~X~0) (= main_~y~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) (+ main_~v~0 (* (- 2) main_~Y~0))) (<= main_~Y~0 10))} #65#return; {2247#(and (<= main_~X~0 10) (= main_~x~0 1) (<= 0 main_~Y~0) (<= 0 main_~X~0) (= main_~y~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) (+ main_~v~0 (* (- 2) main_~Y~0))) (<= main_~Y~0 10))} is VALID [2022-04-15 07:36:54,910 INFO L290 TraceCheckUtils]: 33: Hoare triple {2247#(and (<= main_~X~0 10) (= main_~x~0 1) (<= 0 main_~Y~0) (<= 0 main_~X~0) (= main_~y~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) (+ main_~v~0 (* (- 2) main_~Y~0))) (<= main_~Y~0 10))} assume !!(~x~0 <= ~X~0); {2247#(and (<= main_~X~0 10) (= main_~x~0 1) (<= 0 main_~Y~0) (<= 0 main_~X~0) (= main_~y~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) (+ main_~v~0 (* (- 2) main_~Y~0))) (<= main_~Y~0 10))} is VALID [2022-04-15 07:36:54,910 INFO L290 TraceCheckUtils]: 34: Hoare triple {2247#(and (<= main_~X~0 10) (= main_~x~0 1) (<= 0 main_~Y~0) (<= 0 main_~X~0) (= main_~y~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) (+ main_~v~0 (* (- 2) main_~Y~0))) (<= main_~Y~0 10))} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {2272#(and (<= main_~X~0 10) (< main_~v~0 (* main_~Y~0 2)) (= main_~x~0 1) (<= 0 main_~Y~0) (= main_~y~0 0) (= (+ main_~X~0 main_~v~0) (* main_~Y~0 6)))} is VALID [2022-04-15 07:36:54,911 INFO L290 TraceCheckUtils]: 35: Hoare triple {2272#(and (<= main_~X~0 10) (< main_~v~0 (* main_~Y~0 2)) (= main_~x~0 1) (<= 0 main_~Y~0) (= main_~y~0 0) (= (+ main_~X~0 main_~v~0) (* main_~Y~0 6)))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {2276#(and (= (+ (- 1) main_~x~0) 1) (<= main_~X~0 10) (< main_~v~0 (* main_~Y~0 2)) (<= 0 main_~Y~0) (= main_~y~0 0) (= (+ main_~X~0 main_~v~0) (* main_~Y~0 6)))} is VALID [2022-04-15 07:36:54,911 INFO L290 TraceCheckUtils]: 36: Hoare triple {2276#(and (= (+ (- 1) main_~x~0) 1) (<= main_~X~0 10) (< main_~v~0 (* main_~Y~0 2)) (<= 0 main_~Y~0) (= main_~y~0 0) (= (+ main_~X~0 main_~v~0) (* main_~Y~0 6)))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {2280#(and (= main_~xy~0 0) (<= main_~X~0 10) (= (* main_~Y~0 2) main_~yx~0) (< main_~v~0 (* main_~Y~0 2)) (<= 0 main_~Y~0) (= (+ main_~X~0 main_~v~0) (* main_~Y~0 6)))} is VALID [2022-04-15 07:36:54,912 INFO L272 TraceCheckUtils]: 37: Hoare triple {2280#(and (= main_~xy~0 0) (<= main_~X~0 10) (= (* main_~Y~0 2) main_~yx~0) (< main_~v~0 (* main_~Y~0 2)) (<= 0 main_~Y~0) (= (+ main_~X~0 main_~v~0) (* main_~Y~0 6)))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {2284#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 07:36:54,913 INFO L290 TraceCheckUtils]: 38: Hoare triple {2284#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2288#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 07:36:54,914 INFO L290 TraceCheckUtils]: 39: Hoare triple {2288#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2156#false} is VALID [2022-04-15 07:36:54,914 INFO L290 TraceCheckUtils]: 40: Hoare triple {2156#false} assume !false; {2156#false} is VALID [2022-04-15 07:36:54,914 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 3 proven. 13 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-04-15 07:36:54,914 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 07:36:58,127 INFO L290 TraceCheckUtils]: 40: Hoare triple {2156#false} assume !false; {2156#false} is VALID [2022-04-15 07:36:58,127 INFO L290 TraceCheckUtils]: 39: Hoare triple {2288#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2156#false} is VALID [2022-04-15 07:36:58,129 INFO L290 TraceCheckUtils]: 38: Hoare triple {2284#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2288#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 07:36:58,130 INFO L272 TraceCheckUtils]: 37: Hoare triple {2304#(= (+ (* 2 main_~xy~0) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 main_~yx~0)))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {2284#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 07:36:58,131 INFO L290 TraceCheckUtils]: 36: Hoare triple {2308#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {2304#(= (+ (* 2 main_~xy~0) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 main_~yx~0)))} is VALID [2022-04-15 07:36:58,133 INFO L290 TraceCheckUtils]: 35: Hoare triple {2312#(= (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0))))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {2308#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} is VALID [2022-04-15 07:36:58,133 INFO L290 TraceCheckUtils]: 34: Hoare triple {2316#(or (not (< main_~v~0 0)) (= (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0 (* main_~Y~0 2)) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0)))))} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {2312#(= (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0))))} is VALID [2022-04-15 07:36:58,134 INFO L290 TraceCheckUtils]: 33: Hoare triple {2316#(or (not (< main_~v~0 0)) (= (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0 (* main_~Y~0 2)) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0)))))} assume !!(~x~0 <= ~X~0); {2316#(or (not (< main_~v~0 0)) (= (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0 (* main_~Y~0 2)) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0)))))} is VALID [2022-04-15 07:36:58,135 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {2155#true} {2316#(or (not (< main_~v~0 0)) (= (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0 (* main_~Y~0 2)) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0)))))} #65#return; {2316#(or (not (< main_~v~0 0)) (= (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0 (* main_~Y~0 2)) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0)))))} is VALID [2022-04-15 07:36:58,135 INFO L290 TraceCheckUtils]: 31: Hoare triple {2155#true} assume true; {2155#true} is VALID [2022-04-15 07:36:58,135 INFO L290 TraceCheckUtils]: 30: Hoare triple {2155#true} assume !(0 == ~cond); {2155#true} is VALID [2022-04-15 07:36:58,135 INFO L290 TraceCheckUtils]: 29: Hoare triple {2155#true} ~cond := #in~cond; {2155#true} is VALID [2022-04-15 07:36:58,135 INFO L272 TraceCheckUtils]: 28: Hoare triple {2316#(or (not (< main_~v~0 0)) (= (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0 (* main_~Y~0 2)) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0)))))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {2155#true} is VALID [2022-04-15 07:36:58,136 INFO L290 TraceCheckUtils]: 27: Hoare triple {2316#(or (not (< main_~v~0 0)) (= (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0 (* main_~Y~0 2)) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0)))))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {2316#(or (not (< main_~v~0 0)) (= (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0 (* main_~Y~0 2)) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0)))))} is VALID [2022-04-15 07:36:58,137 INFO L290 TraceCheckUtils]: 26: Hoare triple {2341#(or (not (< main_~v~0 0)) (= (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0 (* main_~Y~0 2)) (+ (* 2 (* main_~Y~0 (+ main_~x~0 2))) (* main_~Y~0 2))))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {2316#(or (not (< main_~v~0 0)) (= (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0 (* main_~Y~0 2)) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0)))))} is VALID [2022-04-15 07:36:58,138 INFO L290 TraceCheckUtils]: 25: Hoare triple {2345#(or (= (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0 (* main_~Y~0 4)) (+ (* 2 (* main_~Y~0 (+ main_~x~0 2))) (* main_~Y~0 2))) (not (< (+ main_~v~0 (* main_~Y~0 2)) 0)))} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {2341#(or (not (< main_~v~0 0)) (= (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0 (* main_~Y~0 2)) (+ (* 2 (* main_~Y~0 (+ main_~x~0 2))) (* main_~Y~0 2))))} is VALID [2022-04-15 07:36:58,139 INFO L290 TraceCheckUtils]: 24: Hoare triple {2345#(or (= (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0 (* main_~Y~0 4)) (+ (* 2 (* main_~Y~0 (+ main_~x~0 2))) (* main_~Y~0 2))) (not (< (+ main_~v~0 (* main_~Y~0 2)) 0)))} assume !!(~x~0 <= ~X~0); {2345#(or (= (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0 (* main_~Y~0 4)) (+ (* 2 (* main_~Y~0 (+ main_~x~0 2))) (* main_~Y~0 2))) (not (< (+ main_~v~0 (* main_~Y~0 2)) 0)))} is VALID [2022-04-15 07:36:58,140 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {2230#(not (= |__VERIFIER_assert_#in~cond| 0))} {2352#(or (= (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0 (* main_~Y~0 4)) (+ (* 2 (* main_~Y~0 (+ main_~x~0 2))) (* main_~Y~0 2))) (not (< (+ main_~v~0 (* main_~Y~0 2)) 0)) (not (= (+ (* 2 main_~xy~0) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 main_~yx~0)))))} #65#return; {2345#(or (= (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0 (* main_~Y~0 4)) (+ (* 2 (* main_~Y~0 (+ main_~x~0 2))) (* main_~Y~0 2))) (not (< (+ main_~v~0 (* main_~Y~0 2)) 0)))} is VALID [2022-04-15 07:36:58,140 INFO L290 TraceCheckUtils]: 22: Hoare triple {2230#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {2230#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:36:58,141 INFO L290 TraceCheckUtils]: 21: Hoare triple {2362#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {2230#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:36:58,141 INFO L290 TraceCheckUtils]: 20: Hoare triple {2155#true} ~cond := #in~cond; {2362#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 07:36:58,141 INFO L272 TraceCheckUtils]: 19: Hoare triple {2352#(or (= (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0 (* main_~Y~0 4)) (+ (* 2 (* main_~Y~0 (+ main_~x~0 2))) (* main_~Y~0 2))) (not (< (+ main_~v~0 (* main_~Y~0 2)) 0)) (not (= (+ (* 2 main_~xy~0) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 main_~yx~0)))))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {2155#true} is VALID [2022-04-15 07:36:58,142 INFO L290 TraceCheckUtils]: 18: Hoare triple {2369#(or (= (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0 (* main_~Y~0 4)) (+ (* 2 (* main_~Y~0 (+ main_~x~0 2))) (* main_~Y~0 2))) (not (< (+ main_~v~0 (* main_~Y~0 2)) 0)) (not (= (mod (+ main_~X~0 main_~v~0) 2) 0)) (< (* main_~X~0 main_~y~0) (+ main_~Y~0 (div (+ (* (- 1) main_~X~0) (* (- 1) main_~v~0)) 2) (* main_~Y~0 main_~x~0))))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {2352#(or (= (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0 (* main_~Y~0 4)) (+ (* 2 (* main_~Y~0 (+ main_~x~0 2))) (* main_~Y~0 2))) (not (< (+ main_~v~0 (* main_~Y~0 2)) 0)) (not (= (+ (* 2 main_~xy~0) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 main_~yx~0)))))} is VALID [2022-04-15 07:36:58,143 INFO L290 TraceCheckUtils]: 17: Hoare triple {2155#true} ~v~0 := 2 * ~Y~0 - ~X~0;~y~0 := 0;~x~0 := 0; {2369#(or (= (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0 (* main_~Y~0 4)) (+ (* 2 (* main_~Y~0 (+ main_~x~0 2))) (* main_~Y~0 2))) (not (< (+ main_~v~0 (* main_~Y~0 2)) 0)) (not (= (mod (+ main_~X~0 main_~v~0) 2) 0)) (< (* main_~X~0 main_~y~0) (+ main_~Y~0 (div (+ (* (- 1) main_~X~0) (* (- 1) main_~v~0)) 2) (* main_~Y~0 main_~x~0))))} is VALID [2022-04-15 07:36:58,143 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {2155#true} {2155#true} #63#return; {2155#true} is VALID [2022-04-15 07:36:58,148 INFO L290 TraceCheckUtils]: 15: Hoare triple {2155#true} assume true; {2155#true} is VALID [2022-04-15 07:36:58,148 INFO L290 TraceCheckUtils]: 14: Hoare triple {2155#true} assume !(0 == ~cond); {2155#true} is VALID [2022-04-15 07:36:58,149 INFO L290 TraceCheckUtils]: 13: Hoare triple {2155#true} ~cond := #in~cond; {2155#true} is VALID [2022-04-15 07:36:58,178 INFO L272 TraceCheckUtils]: 12: Hoare triple {2155#true} call assume_abort_if_not((if ~Y~0 >= 0 && ~Y~0 <= 10 then 1 else 0)); {2155#true} is VALID [2022-04-15 07:36:58,178 INFO L290 TraceCheckUtils]: 11: Hoare triple {2155#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~Y~0 := #t~nondet5;havoc #t~nondet5; {2155#true} is VALID [2022-04-15 07:36:58,178 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2155#true} {2155#true} #61#return; {2155#true} is VALID [2022-04-15 07:36:58,178 INFO L290 TraceCheckUtils]: 9: Hoare triple {2155#true} assume true; {2155#true} is VALID [2022-04-15 07:36:58,178 INFO L290 TraceCheckUtils]: 8: Hoare triple {2155#true} assume !(0 == ~cond); {2155#true} is VALID [2022-04-15 07:36:58,178 INFO L290 TraceCheckUtils]: 7: Hoare triple {2155#true} ~cond := #in~cond; {2155#true} is VALID [2022-04-15 07:36:58,178 INFO L272 TraceCheckUtils]: 6: Hoare triple {2155#true} call assume_abort_if_not((if ~X~0 >= 0 && ~X~0 <= 10 then 1 else 0)); {2155#true} is VALID [2022-04-15 07:36:58,179 INFO L290 TraceCheckUtils]: 5: Hoare triple {2155#true} havoc ~X~0;havoc ~Y~0;havoc ~x~0;havoc ~y~0;havoc ~v~0;havoc ~xy~0;havoc ~yx~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~X~0 := #t~nondet4;havoc #t~nondet4; {2155#true} is VALID [2022-04-15 07:36:58,179 INFO L272 TraceCheckUtils]: 4: Hoare triple {2155#true} call #t~ret8 := main(); {2155#true} is VALID [2022-04-15 07:36:58,180 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2155#true} {2155#true} #69#return; {2155#true} is VALID [2022-04-15 07:36:58,180 INFO L290 TraceCheckUtils]: 2: Hoare triple {2155#true} assume true; {2155#true} is VALID [2022-04-15 07:36:58,180 INFO L290 TraceCheckUtils]: 1: Hoare triple {2155#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(15, 2);call #Ultimate.allocInit(12, 3); {2155#true} is VALID [2022-04-15 07:36:58,180 INFO L272 TraceCheckUtils]: 0: Hoare triple {2155#true} call ULTIMATE.init(); {2155#true} is VALID [2022-04-15 07:36:58,180 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-04-15 07:36:58,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:36:58,181 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [273788130] [2022-04-15 07:36:58,181 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 07:36:58,181 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [311618394] [2022-04-15 07:36:58,181 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [311618394] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 07:36:58,181 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 07:36:58,181 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 14] total 26 [2022-04-15 07:36:58,181 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:36:58,181 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1889042084] [2022-04-15 07:36:58,181 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1889042084] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:36:58,181 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:36:58,182 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-04-15 07:36:58,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1161534732] [2022-04-15 07:36:58,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:36:58,183 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 15 states have internal predecessors, (26), 5 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) Word has length 41 [2022-04-15 07:36:58,185 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:36:58,186 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 17 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 15 states have internal predecessors, (26), 5 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-15 07:36:58,219 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-15 07:36:58,219 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-04-15 07:36:58,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:36:58,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-04-15 07:36:58,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=549, Unknown=0, NotChecked=0, Total=650 [2022-04-15 07:36:58,221 INFO L87 Difference]: Start difference. First operand 43 states and 47 transitions. Second operand has 17 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 15 states have internal predecessors, (26), 5 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-15 07:36:59,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:36:59,401 INFO L93 Difference]: Finished difference Result 61 states and 69 transitions. [2022-04-15 07:36:59,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-04-15 07:36:59,402 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 15 states have internal predecessors, (26), 5 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) Word has length 41 [2022-04-15 07:36:59,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:36:59,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 15 states have internal predecessors, (26), 5 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-15 07:36:59,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 58 transitions. [2022-04-15 07:36:59,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 15 states have internal predecessors, (26), 5 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-15 07:36:59,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 58 transitions. [2022-04-15 07:36:59,405 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 58 transitions. [2022-04-15 07:36:59,461 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:36:59,462 INFO L225 Difference]: With dead ends: 61 [2022-04-15 07:36:59,462 INFO L226 Difference]: Without dead ends: 57 [2022-04-15 07:36:59,462 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 55 SyntacticMatches, 2 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 182 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=130, Invalid=740, Unknown=0, NotChecked=0, Total=870 [2022-04-15 07:36:59,463 INFO L913 BasicCegarLoop]: 19 mSDtfsCounter, 40 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 399 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 422 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 399 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-15 07:36:59,463 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [43 Valid, 146 Invalid, 422 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 399 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-15 07:36:59,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2022-04-15 07:36:59,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 55. [2022-04-15 07:36:59,544 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:36:59,544 INFO L82 GeneralOperation]: Start isEquivalent. First operand 57 states. Second operand has 55 states, 38 states have (on average 1.131578947368421) internal successors, (43), 40 states have internal predecessors, (43), 10 states have call successors, (10), 7 states have call predecessors, (10), 6 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-15 07:36:59,544 INFO L74 IsIncluded]: Start isIncluded. First operand 57 states. Second operand has 55 states, 38 states have (on average 1.131578947368421) internal successors, (43), 40 states have internal predecessors, (43), 10 states have call successors, (10), 7 states have call predecessors, (10), 6 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-15 07:36:59,545 INFO L87 Difference]: Start difference. First operand 57 states. Second operand has 55 states, 38 states have (on average 1.131578947368421) internal successors, (43), 40 states have internal predecessors, (43), 10 states have call successors, (10), 7 states have call predecessors, (10), 6 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-15 07:36:59,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:36:59,548 INFO L93 Difference]: Finished difference Result 57 states and 64 transitions. [2022-04-15 07:36:59,548 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 64 transitions. [2022-04-15 07:36:59,549 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:36:59,549 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:36:59,549 INFO L74 IsIncluded]: Start isIncluded. First operand has 55 states, 38 states have (on average 1.131578947368421) internal successors, (43), 40 states have internal predecessors, (43), 10 states have call successors, (10), 7 states have call predecessors, (10), 6 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) Second operand 57 states. [2022-04-15 07:36:59,549 INFO L87 Difference]: Start difference. First operand has 55 states, 38 states have (on average 1.131578947368421) internal successors, (43), 40 states have internal predecessors, (43), 10 states have call successors, (10), 7 states have call predecessors, (10), 6 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) Second operand 57 states. [2022-04-15 07:36:59,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:36:59,552 INFO L93 Difference]: Finished difference Result 57 states and 64 transitions. [2022-04-15 07:36:59,552 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 64 transitions. [2022-04-15 07:36:59,552 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:36:59,552 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:36:59,552 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:36:59,552 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:36:59,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 38 states have (on average 1.131578947368421) internal successors, (43), 40 states have internal predecessors, (43), 10 states have call successors, (10), 7 states have call predecessors, (10), 6 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-15 07:36:59,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 61 transitions. [2022-04-15 07:36:59,556 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 61 transitions. Word has length 41 [2022-04-15 07:36:59,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:36:59,556 INFO L478 AbstractCegarLoop]: Abstraction has 55 states and 61 transitions. [2022-04-15 07:36:59,557 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 15 states have internal predecessors, (26), 5 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-15 07:36:59,557 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 55 states and 61 transitions. [2022-04-15 07:36:59,637 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:36:59,637 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 61 transitions. [2022-04-15 07:36:59,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-04-15 07:36:59,638 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:36:59,638 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 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-15 07:36:59,660 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-04-15 07:36:59,838 WARN L460 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-15 07:36:59,839 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:36:59,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:36:59,839 INFO L85 PathProgramCache]: Analyzing trace with hash -1786011109, now seen corresponding path program 1 times [2022-04-15 07:36:59,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:36:59,839 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [800876474] [2022-04-15 07:36:59,840 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 07:36:59,840 INFO L85 PathProgramCache]: Analyzing trace with hash -1786011109, now seen corresponding path program 2 times [2022-04-15 07:36:59,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:36:59,840 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1473727382] [2022-04-15 07:36:59,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:36:59,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:36:59,855 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 07:36:59,856 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [995175237] [2022-04-15 07:36:59,856 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 07:36:59,856 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 07:36:59,856 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 07:36:59,863 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 07:36:59,903 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-04-15 07:36:59,940 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 07:36:59,941 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 07:36:59,942 INFO L263 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 34 conjunts are in the unsatisfiable core [2022-04-15 07:36:59,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:36:59,959 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 07:37:00,275 INFO L272 TraceCheckUtils]: 0: Hoare triple {2780#true} call ULTIMATE.init(); {2780#true} is VALID [2022-04-15 07:37:00,275 INFO L290 TraceCheckUtils]: 1: Hoare triple {2780#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(15, 2);call #Ultimate.allocInit(12, 3); {2780#true} is VALID [2022-04-15 07:37:00,276 INFO L290 TraceCheckUtils]: 2: Hoare triple {2780#true} assume true; {2780#true} is VALID [2022-04-15 07:37:00,276 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2780#true} {2780#true} #69#return; {2780#true} is VALID [2022-04-15 07:37:00,276 INFO L272 TraceCheckUtils]: 4: Hoare triple {2780#true} call #t~ret8 := main(); {2780#true} is VALID [2022-04-15 07:37:00,276 INFO L290 TraceCheckUtils]: 5: Hoare triple {2780#true} havoc ~X~0;havoc ~Y~0;havoc ~x~0;havoc ~y~0;havoc ~v~0;havoc ~xy~0;havoc ~yx~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~X~0 := #t~nondet4;havoc #t~nondet4; {2780#true} is VALID [2022-04-15 07:37:00,276 INFO L272 TraceCheckUtils]: 6: Hoare triple {2780#true} call assume_abort_if_not((if ~X~0 >= 0 && ~X~0 <= 10 then 1 else 0)); {2780#true} is VALID [2022-04-15 07:37:00,276 INFO L290 TraceCheckUtils]: 7: Hoare triple {2780#true} ~cond := #in~cond; {2780#true} is VALID [2022-04-15 07:37:00,276 INFO L290 TraceCheckUtils]: 8: Hoare triple {2780#true} assume !(0 == ~cond); {2780#true} is VALID [2022-04-15 07:37:00,276 INFO L290 TraceCheckUtils]: 9: Hoare triple {2780#true} assume true; {2780#true} is VALID [2022-04-15 07:37:00,276 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2780#true} {2780#true} #61#return; {2780#true} is VALID [2022-04-15 07:37:00,276 INFO L290 TraceCheckUtils]: 11: Hoare triple {2780#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~Y~0 := #t~nondet5;havoc #t~nondet5; {2780#true} is VALID [2022-04-15 07:37:00,277 INFO L272 TraceCheckUtils]: 12: Hoare triple {2780#true} call assume_abort_if_not((if ~Y~0 >= 0 && ~Y~0 <= 10 then 1 else 0)); {2780#true} is VALID [2022-04-15 07:37:00,277 INFO L290 TraceCheckUtils]: 13: Hoare triple {2780#true} ~cond := #in~cond; {2780#true} is VALID [2022-04-15 07:37:00,277 INFO L290 TraceCheckUtils]: 14: Hoare triple {2780#true} assume !(0 == ~cond); {2780#true} is VALID [2022-04-15 07:37:00,277 INFO L290 TraceCheckUtils]: 15: Hoare triple {2780#true} assume true; {2780#true} is VALID [2022-04-15 07:37:00,277 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {2780#true} {2780#true} #63#return; {2780#true} is VALID [2022-04-15 07:37:00,277 INFO L290 TraceCheckUtils]: 17: Hoare triple {2780#true} ~v~0 := 2 * ~Y~0 - ~X~0;~y~0 := 0;~x~0 := 0; {2836#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (= main_~y~0 0))} is VALID [2022-04-15 07:37:00,278 INFO L290 TraceCheckUtils]: 18: Hoare triple {2836#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (= main_~y~0 0))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {2836#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (= main_~y~0 0))} is VALID [2022-04-15 07:37:00,278 INFO L272 TraceCheckUtils]: 19: Hoare triple {2836#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {2780#true} is VALID [2022-04-15 07:37:00,278 INFO L290 TraceCheckUtils]: 20: Hoare triple {2780#true} ~cond := #in~cond; {2780#true} is VALID [2022-04-15 07:37:00,278 INFO L290 TraceCheckUtils]: 21: Hoare triple {2780#true} assume !(0 == ~cond); {2780#true} is VALID [2022-04-15 07:37:00,278 INFO L290 TraceCheckUtils]: 22: Hoare triple {2780#true} assume true; {2780#true} is VALID [2022-04-15 07:37:00,279 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {2780#true} {2836#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (= main_~y~0 0))} #65#return; {2836#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (= main_~y~0 0))} is VALID [2022-04-15 07:37:00,280 INFO L290 TraceCheckUtils]: 24: Hoare triple {2836#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (= main_~y~0 0))} assume !!(~x~0 <= ~X~0); {2836#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (= main_~y~0 0))} is VALID [2022-04-15 07:37:00,280 INFO L290 TraceCheckUtils]: 25: Hoare triple {2836#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (= main_~y~0 0))} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {2861#(and (= main_~x~0 0) (= main_~v~0 (+ (* (- 1) main_~X~0) (* main_~Y~0 4))) (= main_~y~0 0))} is VALID [2022-04-15 07:37:00,281 INFO L290 TraceCheckUtils]: 26: Hoare triple {2861#(and (= main_~x~0 0) (= main_~v~0 (+ (* (- 1) main_~X~0) (* main_~Y~0 4))) (= main_~y~0 0))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {2865#(and (= (+ (- 1) main_~x~0) 0) (= main_~v~0 (+ (* (- 1) main_~X~0) (* main_~Y~0 4))) (= main_~y~0 0))} is VALID [2022-04-15 07:37:00,282 INFO L290 TraceCheckUtils]: 27: Hoare triple {2865#(and (= (+ (- 1) main_~x~0) 0) (= main_~v~0 (+ (* (- 1) main_~X~0) (* main_~Y~0 4))) (= main_~y~0 0))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {2869#(and (= (+ (- 1) main_~x~0) 0) (= main_~v~0 (+ (* (- 1) main_~X~0) (* main_~Y~0 4))) (= (* main_~X~0 main_~y~0) main_~xy~0) (= main_~y~0 0) (= main_~yx~0 (* main_~Y~0 main_~x~0)))} is VALID [2022-04-15 07:37:00,283 INFO L272 TraceCheckUtils]: 28: Hoare triple {2869#(and (= (+ (- 1) main_~x~0) 0) (= main_~v~0 (+ (* (- 1) main_~X~0) (* main_~Y~0 4))) (= (* main_~X~0 main_~y~0) main_~xy~0) (= main_~y~0 0) (= main_~yx~0 (* main_~Y~0 main_~x~0)))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {2780#true} is VALID [2022-04-15 07:37:00,288 INFO L290 TraceCheckUtils]: 29: Hoare triple {2780#true} ~cond := #in~cond; {2876#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-15 07:37:00,289 INFO L290 TraceCheckUtils]: 30: Hoare triple {2876#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {2880#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:37:00,290 INFO L290 TraceCheckUtils]: 31: Hoare triple {2880#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {2880#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:37:00,291 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {2880#(not (= |__VERIFIER_assert_#in~cond| 0))} {2869#(and (= (+ (- 1) main_~x~0) 0) (= main_~v~0 (+ (* (- 1) main_~X~0) (* main_~Y~0 4))) (= (* main_~X~0 main_~y~0) main_~xy~0) (= main_~y~0 0) (= main_~yx~0 (* main_~Y~0 main_~x~0)))} #65#return; {2865#(and (= (+ (- 1) main_~x~0) 0) (= main_~v~0 (+ (* (- 1) main_~X~0) (* main_~Y~0 4))) (= main_~y~0 0))} is VALID [2022-04-15 07:37:00,292 INFO L290 TraceCheckUtils]: 33: Hoare triple {2865#(and (= (+ (- 1) main_~x~0) 0) (= main_~v~0 (+ (* (- 1) main_~X~0) (* main_~Y~0 4))) (= main_~y~0 0))} assume !!(~x~0 <= ~X~0); {2865#(and (= (+ (- 1) main_~x~0) 0) (= main_~v~0 (+ (* (- 1) main_~X~0) (* main_~Y~0 4))) (= main_~y~0 0))} is VALID [2022-04-15 07:37:00,292 INFO L290 TraceCheckUtils]: 34: Hoare triple {2865#(and (= (+ (- 1) main_~x~0) 0) (= main_~v~0 (+ (* (- 1) main_~X~0) (* main_~Y~0 4))) (= main_~y~0 0))} assume !(~v~0 < 0);~v~0 := ~v~0 + 2 * (~Y~0 - ~X~0);#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {2893#(and (= (+ main_~v~0 (* main_~X~0 2) (* (- 2) main_~Y~0)) (+ (* (- 1) main_~X~0) (* main_~Y~0 4))) (= (+ (- 1) main_~x~0) 0) (= main_~y~0 1))} is VALID [2022-04-15 07:37:00,294 INFO L290 TraceCheckUtils]: 35: Hoare triple {2893#(and (= (+ main_~v~0 (* main_~X~0 2) (* (- 2) main_~Y~0)) (+ (* (- 1) main_~X~0) (* main_~Y~0 4))) (= (+ (- 1) main_~x~0) 0) (= main_~y~0 1))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {2897#(and (= (+ main_~v~0 (* main_~X~0 2) (* (- 2) main_~Y~0)) (+ (* (- 1) main_~X~0) (* main_~Y~0 4))) (= main_~y~0 1) (= main_~x~0 2))} is VALID [2022-04-15 07:37:00,295 INFO L290 TraceCheckUtils]: 36: Hoare triple {2897#(and (= (+ main_~v~0 (* main_~X~0 2) (* (- 2) main_~Y~0)) (+ (* (- 1) main_~X~0) (* main_~Y~0 4))) (= main_~y~0 1) (= main_~x~0 2))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {2901#(and (= (+ main_~v~0 (* main_~X~0 2) (* (- 2) main_~Y~0)) (+ (* (- 1) main_~X~0) (* main_~Y~0 4))) (= (* main_~Y~0 2) main_~yx~0) (= main_~X~0 main_~xy~0))} is VALID [2022-04-15 07:37:00,296 INFO L272 TraceCheckUtils]: 37: Hoare triple {2901#(and (= (+ main_~v~0 (* main_~X~0 2) (* (- 2) main_~Y~0)) (+ (* (- 1) main_~X~0) (* main_~Y~0 4))) (= (* main_~Y~0 2) main_~yx~0) (= main_~X~0 main_~xy~0))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {2905#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 07:37:00,299 INFO L290 TraceCheckUtils]: 38: Hoare triple {2905#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2909#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 07:37:00,299 INFO L290 TraceCheckUtils]: 39: Hoare triple {2909#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2781#false} is VALID [2022-04-15 07:37:00,299 INFO L290 TraceCheckUtils]: 40: Hoare triple {2781#false} assume !false; {2781#false} is VALID [2022-04-15 07:37:00,300 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-04-15 07:37:00,300 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 07:37:03,897 INFO L290 TraceCheckUtils]: 40: Hoare triple {2781#false} assume !false; {2781#false} is VALID [2022-04-15 07:37:03,897 INFO L290 TraceCheckUtils]: 39: Hoare triple {2909#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2781#false} is VALID [2022-04-15 07:37:03,897 INFO L290 TraceCheckUtils]: 38: Hoare triple {2905#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2909#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 07:37:03,898 INFO L272 TraceCheckUtils]: 37: Hoare triple {2925#(= (+ (* 2 main_~xy~0) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 main_~yx~0)))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {2905#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 07:37:03,899 INFO L290 TraceCheckUtils]: 36: Hoare triple {2929#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {2925#(= (+ (* 2 main_~xy~0) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 main_~yx~0)))} is VALID [2022-04-15 07:37:03,900 INFO L290 TraceCheckUtils]: 35: Hoare triple {2933#(= (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0))))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {2929#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} is VALID [2022-04-15 07:37:03,902 INFO L290 TraceCheckUtils]: 34: Hoare triple {2929#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} assume !(~v~0 < 0);~v~0 := ~v~0 + 2 * (~Y~0 - ~X~0);#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {2933#(= (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0))))} is VALID [2022-04-15 07:37:03,902 INFO L290 TraceCheckUtils]: 33: Hoare triple {2929#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} assume !!(~x~0 <= ~X~0); {2929#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} is VALID [2022-04-15 07:37:03,903 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {2880#(not (= |__VERIFIER_assert_#in~cond| 0))} {2943#(or (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (not (= (+ (* 2 main_~xy~0) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 main_~yx~0)))))} #65#return; {2929#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} is VALID [2022-04-15 07:37:03,903 INFO L290 TraceCheckUtils]: 31: Hoare triple {2880#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {2880#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:37:03,904 INFO L290 TraceCheckUtils]: 30: Hoare triple {2953#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {2880#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:37:03,904 INFO L290 TraceCheckUtils]: 29: Hoare triple {2780#true} ~cond := #in~cond; {2953#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 07:37:03,904 INFO L272 TraceCheckUtils]: 28: Hoare triple {2943#(or (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (not (= (+ (* 2 main_~xy~0) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 main_~yx~0)))))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {2780#true} is VALID [2022-04-15 07:37:03,905 INFO L290 TraceCheckUtils]: 27: Hoare triple {2780#true} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {2943#(or (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (not (= (+ (* 2 main_~xy~0) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 main_~yx~0)))))} is VALID [2022-04-15 07:37:03,905 INFO L290 TraceCheckUtils]: 26: Hoare triple {2780#true} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {2780#true} is VALID [2022-04-15 07:37:03,905 INFO L290 TraceCheckUtils]: 25: Hoare triple {2780#true} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {2780#true} is VALID [2022-04-15 07:37:03,905 INFO L290 TraceCheckUtils]: 24: Hoare triple {2780#true} assume !!(~x~0 <= ~X~0); {2780#true} is VALID [2022-04-15 07:37:03,905 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {2780#true} {2780#true} #65#return; {2780#true} is VALID [2022-04-15 07:37:03,905 INFO L290 TraceCheckUtils]: 22: Hoare triple {2780#true} assume true; {2780#true} is VALID [2022-04-15 07:37:03,905 INFO L290 TraceCheckUtils]: 21: Hoare triple {2780#true} assume !(0 == ~cond); {2780#true} is VALID [2022-04-15 07:37:03,905 INFO L290 TraceCheckUtils]: 20: Hoare triple {2780#true} ~cond := #in~cond; {2780#true} is VALID [2022-04-15 07:37:03,905 INFO L272 TraceCheckUtils]: 19: Hoare triple {2780#true} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {2780#true} is VALID [2022-04-15 07:37:03,906 INFO L290 TraceCheckUtils]: 18: Hoare triple {2780#true} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {2780#true} is VALID [2022-04-15 07:37:03,906 INFO L290 TraceCheckUtils]: 17: Hoare triple {2780#true} ~v~0 := 2 * ~Y~0 - ~X~0;~y~0 := 0;~x~0 := 0; {2780#true} is VALID [2022-04-15 07:37:03,906 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {2780#true} {2780#true} #63#return; {2780#true} is VALID [2022-04-15 07:37:03,906 INFO L290 TraceCheckUtils]: 15: Hoare triple {2780#true} assume true; {2780#true} is VALID [2022-04-15 07:37:03,906 INFO L290 TraceCheckUtils]: 14: Hoare triple {2780#true} assume !(0 == ~cond); {2780#true} is VALID [2022-04-15 07:37:03,906 INFO L290 TraceCheckUtils]: 13: Hoare triple {2780#true} ~cond := #in~cond; {2780#true} is VALID [2022-04-15 07:37:03,906 INFO L272 TraceCheckUtils]: 12: Hoare triple {2780#true} call assume_abort_if_not((if ~Y~0 >= 0 && ~Y~0 <= 10 then 1 else 0)); {2780#true} is VALID [2022-04-15 07:37:03,906 INFO L290 TraceCheckUtils]: 11: Hoare triple {2780#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~Y~0 := #t~nondet5;havoc #t~nondet5; {2780#true} is VALID [2022-04-15 07:37:03,906 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2780#true} {2780#true} #61#return; {2780#true} is VALID [2022-04-15 07:37:03,906 INFO L290 TraceCheckUtils]: 9: Hoare triple {2780#true} assume true; {2780#true} is VALID [2022-04-15 07:37:03,906 INFO L290 TraceCheckUtils]: 8: Hoare triple {2780#true} assume !(0 == ~cond); {2780#true} is VALID [2022-04-15 07:37:03,906 INFO L290 TraceCheckUtils]: 7: Hoare triple {2780#true} ~cond := #in~cond; {2780#true} is VALID [2022-04-15 07:37:03,906 INFO L272 TraceCheckUtils]: 6: Hoare triple {2780#true} call assume_abort_if_not((if ~X~0 >= 0 && ~X~0 <= 10 then 1 else 0)); {2780#true} is VALID [2022-04-15 07:37:03,907 INFO L290 TraceCheckUtils]: 5: Hoare triple {2780#true} havoc ~X~0;havoc ~Y~0;havoc ~x~0;havoc ~y~0;havoc ~v~0;havoc ~xy~0;havoc ~yx~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~X~0 := #t~nondet4;havoc #t~nondet4; {2780#true} is VALID [2022-04-15 07:37:03,907 INFO L272 TraceCheckUtils]: 4: Hoare triple {2780#true} call #t~ret8 := main(); {2780#true} is VALID [2022-04-15 07:37:03,907 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2780#true} {2780#true} #69#return; {2780#true} is VALID [2022-04-15 07:37:03,907 INFO L290 TraceCheckUtils]: 2: Hoare triple {2780#true} assume true; {2780#true} is VALID [2022-04-15 07:37:03,907 INFO L290 TraceCheckUtils]: 1: Hoare triple {2780#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(15, 2);call #Ultimate.allocInit(12, 3); {2780#true} is VALID [2022-04-15 07:37:03,907 INFO L272 TraceCheckUtils]: 0: Hoare triple {2780#true} call ULTIMATE.init(); {2780#true} is VALID [2022-04-15 07:37:03,907 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 13 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-15 07:37:03,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:37:03,907 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1473727382] [2022-04-15 07:37:03,907 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 07:37:03,908 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [995175237] [2022-04-15 07:37:03,908 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [995175237] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 07:37:03,908 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 07:37:03,908 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10] total 18 [2022-04-15 07:37:03,908 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:37:03,908 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [800876474] [2022-04-15 07:37:03,908 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [800876474] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:37:03,908 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:37:03,908 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-15 07:37:03,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [935993305] [2022-04-15 07:37:03,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:37:03,909 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 12 states have internal predecessors, (26), 4 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 41 [2022-04-15 07:37:03,909 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:37:03,909 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 12 states have internal predecessors, (26), 4 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-15 07:37:03,938 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-15 07:37:03,939 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-15 07:37:03,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:37:03,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-15 07:37:03,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=255, Unknown=0, NotChecked=0, Total=306 [2022-04-15 07:37:03,940 INFO L87 Difference]: Start difference. First operand 55 states and 61 transitions. Second operand has 13 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 12 states have internal predecessors, (26), 4 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-15 07:37:04,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:37:04,772 INFO L93 Difference]: Finished difference Result 72 states and 79 transitions. [2022-04-15 07:37:04,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-15 07:37:04,772 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 12 states have internal predecessors, (26), 4 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 41 [2022-04-15 07:37:04,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:37:04,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 12 states have internal predecessors, (26), 4 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-15 07:37:04,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 58 transitions. [2022-04-15 07:37:04,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 12 states have internal predecessors, (26), 4 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-15 07:37:04,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 58 transitions. [2022-04-15 07:37:04,775 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 58 transitions. [2022-04-15 07:37:04,816 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:37:04,818 INFO L225 Difference]: With dead ends: 72 [2022-04-15 07:37:04,818 INFO L226 Difference]: Without dead ends: 70 [2022-04-15 07:37:04,818 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 62 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=71, Invalid=349, Unknown=0, NotChecked=0, Total=420 [2022-04-15 07:37:04,819 INFO L913 BasicCegarLoop]: 23 mSDtfsCounter, 17 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 312 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 318 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 312 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-15 07:37:04,819 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [18 Valid, 170 Invalid, 318 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 312 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-15 07:37:04,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2022-04-15 07:37:04,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 59. [2022-04-15 07:37:04,900 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:37:04,900 INFO L82 GeneralOperation]: Start isEquivalent. First operand 70 states. Second operand has 59 states, 41 states have (on average 1.1219512195121952) internal successors, (46), 43 states have internal predecessors, (46), 10 states have call successors, (10), 8 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-15 07:37:04,900 INFO L74 IsIncluded]: Start isIncluded. First operand 70 states. Second operand has 59 states, 41 states have (on average 1.1219512195121952) internal successors, (46), 43 states have internal predecessors, (46), 10 states have call successors, (10), 8 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-15 07:37:04,901 INFO L87 Difference]: Start difference. First operand 70 states. Second operand has 59 states, 41 states have (on average 1.1219512195121952) internal successors, (46), 43 states have internal predecessors, (46), 10 states have call successors, (10), 8 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-15 07:37:04,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:37:04,902 INFO L93 Difference]: Finished difference Result 70 states and 77 transitions. [2022-04-15 07:37:04,902 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 77 transitions. [2022-04-15 07:37:04,902 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:37:04,903 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:37:04,903 INFO L74 IsIncluded]: Start isIncluded. First operand has 59 states, 41 states have (on average 1.1219512195121952) internal successors, (46), 43 states have internal predecessors, (46), 10 states have call successors, (10), 8 states have call predecessors, (10), 7 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) Second operand 70 states. [2022-04-15 07:37:04,903 INFO L87 Difference]: Start difference. First operand has 59 states, 41 states have (on average 1.1219512195121952) internal successors, (46), 43 states have internal predecessors, (46), 10 states have call successors, (10), 8 states have call predecessors, (10), 7 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) Second operand 70 states. [2022-04-15 07:37:04,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:37:04,905 INFO L93 Difference]: Finished difference Result 70 states and 77 transitions. [2022-04-15 07:37:04,905 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 77 transitions. [2022-04-15 07:37:04,905 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:37:04,905 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:37:04,905 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:37:04,905 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:37:04,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 41 states have (on average 1.1219512195121952) internal successors, (46), 43 states have internal predecessors, (46), 10 states have call successors, (10), 8 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-15 07:37:04,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 64 transitions. [2022-04-15 07:37:04,908 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 64 transitions. Word has length 41 [2022-04-15 07:37:04,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:37:04,908 INFO L478 AbstractCegarLoop]: Abstraction has 59 states and 64 transitions. [2022-04-15 07:37:04,908 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 12 states have internal predecessors, (26), 4 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-15 07:37:04,908 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 59 states and 64 transitions. [2022-04-15 07:37:04,989 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-15 07:37:04,990 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 64 transitions. [2022-04-15 07:37:04,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-04-15 07:37:04,990 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:37:04,990 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 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-15 07:37:05,017 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-04-15 07:37:05,190 WARN L460 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-15 07:37:05,191 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:37:05,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:37:05,191 INFO L85 PathProgramCache]: Analyzing trace with hash -287119529, now seen corresponding path program 3 times [2022-04-15 07:37:05,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:37:05,191 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1473314821] [2022-04-15 07:37:05,192 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 07:37:05,192 INFO L85 PathProgramCache]: Analyzing trace with hash -287119529, now seen corresponding path program 4 times [2022-04-15 07:37:05,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:37:05,192 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [95934965] [2022-04-15 07:37:05,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:37:05,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:37:05,202 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 07:37:05,202 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1061092257] [2022-04-15 07:37:05,202 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 07:37:05,202 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 07:37:05,202 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 07:37:05,203 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 07:37:05,204 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-04-15 07:37:05,235 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 07:37:05,235 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 07:37:05,236 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 30 conjunts are in the unsatisfiable core [2022-04-15 07:37:05,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:37:05,246 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 07:37:22,872 WARN L914 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-15 07:37:32,196 WARN L914 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-15 07:37:37,590 WARN L914 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-15 07:37:37,933 INFO L272 TraceCheckUtils]: 0: Hoare triple {3451#true} call ULTIMATE.init(); {3451#true} is VALID [2022-04-15 07:37:37,934 INFO L290 TraceCheckUtils]: 1: Hoare triple {3451#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(15, 2);call #Ultimate.allocInit(12, 3); {3451#true} is VALID [2022-04-15 07:37:37,934 INFO L290 TraceCheckUtils]: 2: Hoare triple {3451#true} assume true; {3451#true} is VALID [2022-04-15 07:37:37,934 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3451#true} {3451#true} #69#return; {3451#true} is VALID [2022-04-15 07:37:37,934 INFO L272 TraceCheckUtils]: 4: Hoare triple {3451#true} call #t~ret8 := main(); {3451#true} is VALID [2022-04-15 07:37:37,934 INFO L290 TraceCheckUtils]: 5: Hoare triple {3451#true} havoc ~X~0;havoc ~Y~0;havoc ~x~0;havoc ~y~0;havoc ~v~0;havoc ~xy~0;havoc ~yx~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~X~0 := #t~nondet4;havoc #t~nondet4; {3451#true} is VALID [2022-04-15 07:37:37,934 INFO L272 TraceCheckUtils]: 6: Hoare triple {3451#true} call assume_abort_if_not((if ~X~0 >= 0 && ~X~0 <= 10 then 1 else 0)); {3451#true} is VALID [2022-04-15 07:37:37,934 INFO L290 TraceCheckUtils]: 7: Hoare triple {3451#true} ~cond := #in~cond; {3451#true} is VALID [2022-04-15 07:37:37,934 INFO L290 TraceCheckUtils]: 8: Hoare triple {3451#true} assume !(0 == ~cond); {3451#true} is VALID [2022-04-15 07:37:37,934 INFO L290 TraceCheckUtils]: 9: Hoare triple {3451#true} assume true; {3451#true} is VALID [2022-04-15 07:37:37,934 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3451#true} {3451#true} #61#return; {3451#true} is VALID [2022-04-15 07:37:37,934 INFO L290 TraceCheckUtils]: 11: Hoare triple {3451#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~Y~0 := #t~nondet5;havoc #t~nondet5; {3451#true} is VALID [2022-04-15 07:37:37,934 INFO L272 TraceCheckUtils]: 12: Hoare triple {3451#true} call assume_abort_if_not((if ~Y~0 >= 0 && ~Y~0 <= 10 then 1 else 0)); {3451#true} is VALID [2022-04-15 07:37:37,935 INFO L290 TraceCheckUtils]: 13: Hoare triple {3451#true} ~cond := #in~cond; {3451#true} is VALID [2022-04-15 07:37:37,935 INFO L290 TraceCheckUtils]: 14: Hoare triple {3451#true} assume !(0 == ~cond); {3451#true} is VALID [2022-04-15 07:37:37,935 INFO L290 TraceCheckUtils]: 15: Hoare triple {3451#true} assume true; {3451#true} is VALID [2022-04-15 07:37:37,935 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {3451#true} {3451#true} #63#return; {3451#true} is VALID [2022-04-15 07:37:37,935 INFO L290 TraceCheckUtils]: 17: Hoare triple {3451#true} ~v~0 := 2 * ~Y~0 - ~X~0;~y~0 := 0;~x~0 := 0; {3507#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0))} is VALID [2022-04-15 07:37:37,936 INFO L290 TraceCheckUtils]: 18: Hoare triple {3507#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {3507#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0))} is VALID [2022-04-15 07:37:37,936 INFO L272 TraceCheckUtils]: 19: Hoare triple {3507#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {3451#true} is VALID [2022-04-15 07:37:37,936 INFO L290 TraceCheckUtils]: 20: Hoare triple {3451#true} ~cond := #in~cond; {3451#true} is VALID [2022-04-15 07:37:37,936 INFO L290 TraceCheckUtils]: 21: Hoare triple {3451#true} assume !(0 == ~cond); {3451#true} is VALID [2022-04-15 07:37:37,936 INFO L290 TraceCheckUtils]: 22: Hoare triple {3451#true} assume true; {3451#true} is VALID [2022-04-15 07:37:37,936 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {3451#true} {3507#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0))} #65#return; {3507#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0))} is VALID [2022-04-15 07:37:37,937 INFO L290 TraceCheckUtils]: 24: Hoare triple {3507#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0))} assume !!(~x~0 <= ~X~0); {3507#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0))} is VALID [2022-04-15 07:37:37,938 INFO L290 TraceCheckUtils]: 25: Hoare triple {3507#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0))} assume !(~v~0 < 0);~v~0 := ~v~0 + 2 * (~Y~0 - ~X~0);#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {3532#(and (= main_~x~0 0) (not (< (+ main_~v~0 (* main_~X~0 2)) (* main_~Y~0 2))) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) (+ main_~v~0 (* main_~X~0 2) (* (- 2) main_~Y~0))))} is VALID [2022-04-15 07:37:37,938 INFO L290 TraceCheckUtils]: 26: Hoare triple {3532#(and (= main_~x~0 0) (not (< (+ main_~v~0 (* main_~X~0 2)) (* main_~Y~0 2))) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) (+ main_~v~0 (* main_~X~0 2) (* (- 2) main_~Y~0))))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {3536#(and (= (+ (- 1) main_~x~0) 0) (not (< (+ main_~v~0 (* main_~X~0 2)) (* main_~Y~0 2))) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) (+ main_~v~0 (* main_~X~0 2) (* (- 2) main_~Y~0))))} is VALID [2022-04-15 07:37:37,939 INFO L290 TraceCheckUtils]: 27: Hoare triple {3536#(and (= (+ (- 1) main_~x~0) 0) (not (< (+ main_~v~0 (* main_~X~0 2)) (* main_~Y~0 2))) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) (+ main_~v~0 (* main_~X~0 2) (* (- 2) main_~Y~0))))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {3540#(and (= (+ (- 1) main_~x~0) 0) (not (< (+ main_~v~0 (* main_~X~0 2)) (* main_~Y~0 2))) (= (* main_~X~0 main_~y~0) main_~xy~0) (= main_~yx~0 (* main_~Y~0 main_~x~0)) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) (+ main_~v~0 (* main_~X~0 2) (* (- 2) main_~Y~0))))} is VALID [2022-04-15 07:37:37,939 INFO L272 TraceCheckUtils]: 28: Hoare triple {3540#(and (= (+ (- 1) main_~x~0) 0) (not (< (+ main_~v~0 (* main_~X~0 2)) (* main_~Y~0 2))) (= (* main_~X~0 main_~y~0) main_~xy~0) (= main_~yx~0 (* main_~Y~0 main_~x~0)) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) (+ main_~v~0 (* main_~X~0 2) (* (- 2) main_~Y~0))))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {3451#true} is VALID [2022-04-15 07:37:37,939 INFO L290 TraceCheckUtils]: 29: Hoare triple {3451#true} ~cond := #in~cond; {3547#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-15 07:37:37,939 INFO L290 TraceCheckUtils]: 30: Hoare triple {3547#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {3551#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:37:37,940 INFO L290 TraceCheckUtils]: 31: Hoare triple {3551#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {3551#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:37:37,941 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {3551#(not (= |__VERIFIER_assert_#in~cond| 0))} {3540#(and (= (+ (- 1) main_~x~0) 0) (not (< (+ main_~v~0 (* main_~X~0 2)) (* main_~Y~0 2))) (= (* main_~X~0 main_~y~0) main_~xy~0) (= main_~yx~0 (* main_~Y~0 main_~x~0)) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) (+ main_~v~0 (* main_~X~0 2) (* (- 2) main_~Y~0))))} #65#return; {3558#(and (= (+ (- 1) main_~x~0) 0) (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (not (< (+ main_~v~0 (* main_~X~0 2)) (* main_~Y~0 2))) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) (+ main_~v~0 (* main_~X~0 2) (* (- 2) main_~Y~0))))} is VALID [2022-04-15 07:37:37,942 INFO L290 TraceCheckUtils]: 33: Hoare triple {3558#(and (= (+ (- 1) main_~x~0) 0) (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (not (< (+ main_~v~0 (* main_~X~0 2)) (* main_~Y~0 2))) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) (+ main_~v~0 (* main_~X~0 2) (* (- 2) main_~Y~0))))} assume !!(~x~0 <= ~X~0); {3558#(and (= (+ (- 1) main_~x~0) 0) (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (not (< (+ main_~v~0 (* main_~X~0 2)) (* main_~Y~0 2))) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) (+ main_~v~0 (* main_~X~0 2) (* (- 2) main_~Y~0))))} is VALID [2022-04-15 07:37:37,942 INFO L290 TraceCheckUtils]: 34: Hoare triple {3558#(and (= (+ (- 1) main_~x~0) 0) (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (not (< (+ main_~v~0 (* main_~X~0 2)) (* main_~Y~0 2))) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) (+ main_~v~0 (* main_~X~0 2) (* (- 2) main_~Y~0))))} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {3565#(and (= (+ (- 1) main_~x~0) 0) (= main_~v~0 (+ (* main_~Y~0 main_~x~0 2) (* (- 1) main_~X~0) (* (- 2) main_~X~0 main_~y~0) (* main_~Y~0 4))) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) (+ (* main_~Y~0 main_~x~0 2) main_~X~0 (* (- 2) main_~X~0 main_~y~0))) (< (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0)) (not (< (+ main_~X~0 (* 2 (* main_~Y~0 main_~x~0))) (* (* main_~X~0 main_~y~0) 2))))} is VALID [2022-04-15 07:37:37,943 INFO L290 TraceCheckUtils]: 35: Hoare triple {3565#(and (= (+ (- 1) main_~x~0) 0) (= main_~v~0 (+ (* main_~Y~0 main_~x~0 2) (* (- 1) main_~X~0) (* (- 2) main_~X~0 main_~y~0) (* main_~Y~0 4))) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) (+ (* main_~Y~0 main_~x~0 2) main_~X~0 (* (- 2) main_~X~0 main_~y~0))) (< (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0)) (not (< (+ main_~X~0 (* 2 (* main_~Y~0 main_~x~0))) (* (* main_~X~0 main_~y~0) 2))))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {3569#(and (= (+ (- 2) main_~x~0) 0) (not (< (+ main_~X~0 (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) (* main_~Y~0 2)))) (= main_~v~0 (+ (* (- 1) main_~X~0) (* (- 2) main_~X~0 main_~y~0) (* main_~Y~0 4) (* (+ (- 1) main_~x~0) main_~Y~0 2))) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) (+ main_~X~0 (* (- 2) main_~X~0 main_~y~0) (* (+ (- 1) main_~x~0) main_~Y~0 2))) (< (* 2 (* main_~Y~0 main_~x~0)) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0)))} is VALID [2022-04-15 07:37:37,945 INFO L290 TraceCheckUtils]: 36: Hoare triple {3569#(and (= (+ (- 2) main_~x~0) 0) (not (< (+ main_~X~0 (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) (* main_~Y~0 2)))) (= main_~v~0 (+ (* (- 1) main_~X~0) (* (- 2) main_~X~0 main_~y~0) (* main_~Y~0 4) (* (+ (- 1) main_~x~0) main_~Y~0 2))) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) (+ main_~X~0 (* (- 2) main_~X~0 main_~y~0) (* (+ (- 1) main_~x~0) main_~Y~0 2))) (< (* 2 (* main_~Y~0 main_~x~0)) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0)))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {3573#(and (= (+ (* (* main_~X~0 (div main_~X~0 main_~X~0)) 2) main_~X~0 main_~v~0) (* main_~Y~0 6)) (= (* main_~X~0 (div main_~X~0 main_~X~0)) main_~xy~0) (= (* main_~Y~0 2) main_~yx~0) (<= (* (* main_~X~0 (div main_~X~0 main_~X~0)) 2) (+ main_~X~0 (* main_~Y~0 2))) (< (* main_~Y~0 4) (+ (* (* main_~X~0 (div main_~X~0 main_~X~0)) 2) main_~X~0)))} is VALID [2022-04-15 07:37:37,946 INFO L272 TraceCheckUtils]: 37: Hoare triple {3573#(and (= (+ (* (* main_~X~0 (div main_~X~0 main_~X~0)) 2) main_~X~0 main_~v~0) (* main_~Y~0 6)) (= (* main_~X~0 (div main_~X~0 main_~X~0)) main_~xy~0) (= (* main_~Y~0 2) main_~yx~0) (<= (* (* main_~X~0 (div main_~X~0 main_~X~0)) 2) (+ main_~X~0 (* main_~Y~0 2))) (< (* main_~Y~0 4) (+ (* (* main_~X~0 (div main_~X~0 main_~X~0)) 2) main_~X~0)))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {3577#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 07:37:37,946 INFO L290 TraceCheckUtils]: 38: Hoare triple {3577#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3581#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 07:37:37,947 INFO L290 TraceCheckUtils]: 39: Hoare triple {3581#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3452#false} is VALID [2022-04-15 07:37:37,947 INFO L290 TraceCheckUtils]: 40: Hoare triple {3452#false} assume !false; {3452#false} is VALID [2022-04-15 07:37:37,947 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-04-15 07:37:37,947 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 07:37:42,511 INFO L290 TraceCheckUtils]: 40: Hoare triple {3452#false} assume !false; {3452#false} is VALID [2022-04-15 07:37:42,512 INFO L290 TraceCheckUtils]: 39: Hoare triple {3581#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3452#false} is VALID [2022-04-15 07:37:42,513 INFO L290 TraceCheckUtils]: 38: Hoare triple {3577#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3581#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 07:37:42,514 INFO L272 TraceCheckUtils]: 37: Hoare triple {3597#(= (+ (* 2 main_~xy~0) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 main_~yx~0)))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {3577#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 07:37:42,514 INFO L290 TraceCheckUtils]: 36: Hoare triple {3601#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {3597#(= (+ (* 2 main_~xy~0) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 main_~yx~0)))} is VALID [2022-04-15 07:37:42,516 INFO L290 TraceCheckUtils]: 35: Hoare triple {3605#(= (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0))))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {3601#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} is VALID [2022-04-15 07:37:42,517 INFO L290 TraceCheckUtils]: 34: Hoare triple {3609#(or (not (< main_~v~0 0)) (= (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0 (* main_~Y~0 2)) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0)))))} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {3605#(= (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0))))} is VALID [2022-04-15 07:37:42,518 INFO L290 TraceCheckUtils]: 33: Hoare triple {3609#(or (not (< main_~v~0 0)) (= (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0 (* main_~Y~0 2)) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0)))))} assume !!(~x~0 <= ~X~0); {3609#(or (not (< main_~v~0 0)) (= (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0 (* main_~Y~0 2)) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0)))))} is VALID [2022-04-15 07:37:42,519 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {3551#(not (= |__VERIFIER_assert_#in~cond| 0))} {3616#(or (not (< main_~v~0 0)) (not (= (+ (* 2 main_~xy~0) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 main_~yx~0)))) (= (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0 (* main_~Y~0 2)) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0)))))} #65#return; {3609#(or (not (< main_~v~0 0)) (= (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0 (* main_~Y~0 2)) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0)))))} is VALID [2022-04-15 07:37:42,519 INFO L290 TraceCheckUtils]: 31: Hoare triple {3551#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {3551#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:37:42,519 INFO L290 TraceCheckUtils]: 30: Hoare triple {3626#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {3551#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:37:42,520 INFO L290 TraceCheckUtils]: 29: Hoare triple {3451#true} ~cond := #in~cond; {3626#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 07:37:42,520 INFO L272 TraceCheckUtils]: 28: Hoare triple {3616#(or (not (< main_~v~0 0)) (not (= (+ (* 2 main_~xy~0) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 main_~yx~0)))) (= (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0 (* main_~Y~0 2)) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0)))))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {3451#true} is VALID [2022-04-15 07:37:42,520 INFO L290 TraceCheckUtils]: 27: Hoare triple {3451#true} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {3616#(or (not (< main_~v~0 0)) (not (= (+ (* 2 main_~xy~0) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 main_~yx~0)))) (= (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0 (* main_~Y~0 2)) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0)))))} is VALID [2022-04-15 07:37:42,521 INFO L290 TraceCheckUtils]: 26: Hoare triple {3451#true} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {3451#true} is VALID [2022-04-15 07:37:42,521 INFO L290 TraceCheckUtils]: 25: Hoare triple {3451#true} assume !(~v~0 < 0);~v~0 := ~v~0 + 2 * (~Y~0 - ~X~0);#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {3451#true} is VALID [2022-04-15 07:37:42,521 INFO L290 TraceCheckUtils]: 24: Hoare triple {3451#true} assume !!(~x~0 <= ~X~0); {3451#true} is VALID [2022-04-15 07:37:42,521 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {3451#true} {3451#true} #65#return; {3451#true} is VALID [2022-04-15 07:37:42,521 INFO L290 TraceCheckUtils]: 22: Hoare triple {3451#true} assume true; {3451#true} is VALID [2022-04-15 07:37:42,521 INFO L290 TraceCheckUtils]: 21: Hoare triple {3451#true} assume !(0 == ~cond); {3451#true} is VALID [2022-04-15 07:37:42,521 INFO L290 TraceCheckUtils]: 20: Hoare triple {3451#true} ~cond := #in~cond; {3451#true} is VALID [2022-04-15 07:37:42,521 INFO L272 TraceCheckUtils]: 19: Hoare triple {3451#true} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {3451#true} is VALID [2022-04-15 07:37:42,521 INFO L290 TraceCheckUtils]: 18: Hoare triple {3451#true} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {3451#true} is VALID [2022-04-15 07:37:42,521 INFO L290 TraceCheckUtils]: 17: Hoare triple {3451#true} ~v~0 := 2 * ~Y~0 - ~X~0;~y~0 := 0;~x~0 := 0; {3451#true} is VALID [2022-04-15 07:37:42,521 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {3451#true} {3451#true} #63#return; {3451#true} is VALID [2022-04-15 07:37:42,521 INFO L290 TraceCheckUtils]: 15: Hoare triple {3451#true} assume true; {3451#true} is VALID [2022-04-15 07:37:42,522 INFO L290 TraceCheckUtils]: 14: Hoare triple {3451#true} assume !(0 == ~cond); {3451#true} is VALID [2022-04-15 07:37:42,522 INFO L290 TraceCheckUtils]: 13: Hoare triple {3451#true} ~cond := #in~cond; {3451#true} is VALID [2022-04-15 07:37:42,522 INFO L272 TraceCheckUtils]: 12: Hoare triple {3451#true} call assume_abort_if_not((if ~Y~0 >= 0 && ~Y~0 <= 10 then 1 else 0)); {3451#true} is VALID [2022-04-15 07:37:42,522 INFO L290 TraceCheckUtils]: 11: Hoare triple {3451#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~Y~0 := #t~nondet5;havoc #t~nondet5; {3451#true} is VALID [2022-04-15 07:37:42,522 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3451#true} {3451#true} #61#return; {3451#true} is VALID [2022-04-15 07:37:42,522 INFO L290 TraceCheckUtils]: 9: Hoare triple {3451#true} assume true; {3451#true} is VALID [2022-04-15 07:37:42,522 INFO L290 TraceCheckUtils]: 8: Hoare triple {3451#true} assume !(0 == ~cond); {3451#true} is VALID [2022-04-15 07:37:42,522 INFO L290 TraceCheckUtils]: 7: Hoare triple {3451#true} ~cond := #in~cond; {3451#true} is VALID [2022-04-15 07:37:42,522 INFO L272 TraceCheckUtils]: 6: Hoare triple {3451#true} call assume_abort_if_not((if ~X~0 >= 0 && ~X~0 <= 10 then 1 else 0)); {3451#true} is VALID [2022-04-15 07:37:42,522 INFO L290 TraceCheckUtils]: 5: Hoare triple {3451#true} havoc ~X~0;havoc ~Y~0;havoc ~x~0;havoc ~y~0;havoc ~v~0;havoc ~xy~0;havoc ~yx~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~X~0 := #t~nondet4;havoc #t~nondet4; {3451#true} is VALID [2022-04-15 07:37:42,522 INFO L272 TraceCheckUtils]: 4: Hoare triple {3451#true} call #t~ret8 := main(); {3451#true} is VALID [2022-04-15 07:37:42,523 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3451#true} {3451#true} #69#return; {3451#true} is VALID [2022-04-15 07:37:42,523 INFO L290 TraceCheckUtils]: 2: Hoare triple {3451#true} assume true; {3451#true} is VALID [2022-04-15 07:37:42,523 INFO L290 TraceCheckUtils]: 1: Hoare triple {3451#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(15, 2);call #Ultimate.allocInit(12, 3); {3451#true} is VALID [2022-04-15 07:37:42,523 INFO L272 TraceCheckUtils]: 0: Hoare triple {3451#true} call ULTIMATE.init(); {3451#true} is VALID [2022-04-15 07:37:42,523 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 13 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-15 07:37:42,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:37:42,523 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [95934965] [2022-04-15 07:37:42,523 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 07:37:42,523 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1061092257] [2022-04-15 07:37:42,523 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1061092257] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 07:37:42,524 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 07:37:42,524 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11] total 20 [2022-04-15 07:37:42,524 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:37:42,524 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1473314821] [2022-04-15 07:37:42,524 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1473314821] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:37:42,524 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:37:42,524 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-15 07:37:42,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2102081015] [2022-04-15 07:37:42,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:37:42,525 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 13 states have internal predecessors, (26), 4 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 41 [2022-04-15 07:37:42,525 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:37:42,525 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 13 states have internal predecessors, (26), 4 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-15 07:37:42,560 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-15 07:37:42,561 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-15 07:37:42,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:37:42,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-15 07:37:42,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=321, Unknown=0, NotChecked=0, Total=380 [2022-04-15 07:37:42,561 INFO L87 Difference]: Start difference. First operand 59 states and 64 transitions. Second operand has 14 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 13 states have internal predecessors, (26), 4 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-15 07:37:43,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:37:43,863 INFO L93 Difference]: Finished difference Result 86 states and 98 transitions. [2022-04-15 07:37:43,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-15 07:37:43,863 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 13 states have internal predecessors, (26), 4 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 41 [2022-04-15 07:37:43,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:37:43,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 13 states have internal predecessors, (26), 4 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-15 07:37:43,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 70 transitions. [2022-04-15 07:37:43,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 13 states have internal predecessors, (26), 4 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-15 07:37:43,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 70 transitions. [2022-04-15 07:37:43,866 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 70 transitions. [2022-04-15 07:37:43,934 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:37:43,935 INFO L225 Difference]: With dead ends: 86 [2022-04-15 07:37:43,935 INFO L226 Difference]: Without dead ends: 73 [2022-04-15 07:37:43,936 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 62 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=89, Invalid=463, Unknown=0, NotChecked=0, Total=552 [2022-04-15 07:37:43,936 INFO L913 BasicCegarLoop]: 26 mSDtfsCounter, 16 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 303 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 309 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 303 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-15 07:37:43,936 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [17 Valid, 184 Invalid, 309 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 303 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-15 07:37:43,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2022-04-15 07:37:44,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2022-04-15 07:37:44,042 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:37:44,042 INFO L82 GeneralOperation]: Start isEquivalent. First operand 73 states. Second operand has 73 states, 52 states have (on average 1.1153846153846154) internal successors, (58), 54 states have internal predecessors, (58), 12 states have call successors, (12), 9 states have call predecessors, (12), 8 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-15 07:37:44,043 INFO L74 IsIncluded]: Start isIncluded. First operand 73 states. Second operand has 73 states, 52 states have (on average 1.1153846153846154) internal successors, (58), 54 states have internal predecessors, (58), 12 states have call successors, (12), 9 states have call predecessors, (12), 8 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-15 07:37:44,043 INFO L87 Difference]: Start difference. First operand 73 states. Second operand has 73 states, 52 states have (on average 1.1153846153846154) internal successors, (58), 54 states have internal predecessors, (58), 12 states have call successors, (12), 9 states have call predecessors, (12), 8 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-15 07:37:44,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:37:44,046 INFO L93 Difference]: Finished difference Result 73 states and 80 transitions. [2022-04-15 07:37:44,046 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 80 transitions. [2022-04-15 07:37:44,046 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:37:44,046 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:37:44,047 INFO L74 IsIncluded]: Start isIncluded. First operand has 73 states, 52 states have (on average 1.1153846153846154) internal successors, (58), 54 states have internal predecessors, (58), 12 states have call successors, (12), 9 states have call predecessors, (12), 8 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) Second operand 73 states. [2022-04-15 07:37:44,047 INFO L87 Difference]: Start difference. First operand has 73 states, 52 states have (on average 1.1153846153846154) internal successors, (58), 54 states have internal predecessors, (58), 12 states have call successors, (12), 9 states have call predecessors, (12), 8 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) Second operand 73 states. [2022-04-15 07:37:44,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:37:44,049 INFO L93 Difference]: Finished difference Result 73 states and 80 transitions. [2022-04-15 07:37:44,049 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 80 transitions. [2022-04-15 07:37:44,049 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:37:44,049 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:37:44,049 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:37:44,049 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:37:44,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 52 states have (on average 1.1153846153846154) internal successors, (58), 54 states have internal predecessors, (58), 12 states have call successors, (12), 9 states have call predecessors, (12), 8 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-15 07:37:44,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 80 transitions. [2022-04-15 07:37:44,052 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 80 transitions. Word has length 41 [2022-04-15 07:37:44,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:37:44,052 INFO L478 AbstractCegarLoop]: Abstraction has 73 states and 80 transitions. [2022-04-15 07:37:44,052 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 13 states have internal predecessors, (26), 4 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-15 07:37:44,052 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 73 states and 80 transitions. [2022-04-15 07:37:44,167 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 80 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:37:44,167 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 80 transitions. [2022-04-15 07:37:44,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-04-15 07:37:44,168 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:37:44,168 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 07:37:44,186 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-04-15 07:37:44,384 WARN L460 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-15 07:37:44,384 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:37:44,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:37:44,385 INFO L85 PathProgramCache]: Analyzing trace with hash 1487887833, now seen corresponding path program 3 times [2022-04-15 07:37:44,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:37:44,385 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [371130089] [2022-04-15 07:37:44,386 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 07:37:44,386 INFO L85 PathProgramCache]: Analyzing trace with hash 1487887833, now seen corresponding path program 4 times [2022-04-15 07:37:44,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:37:44,386 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1898592806] [2022-04-15 07:37:44,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:37:44,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:37:44,396 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 07:37:44,397 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [458097914] [2022-04-15 07:37:44,397 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 07:37:44,397 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 07:37:44,397 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 07:37:44,400 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 07:37:44,401 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-04-15 07:37:44,441 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 07:37:44,441 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 07:37:44,442 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 29 conjunts are in the unsatisfiable core [2022-04-15 07:37:44,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:37:44,451 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 07:37:44,783 INFO L272 TraceCheckUtils]: 0: Hoare triple {4188#true} call ULTIMATE.init(); {4188#true} is VALID [2022-04-15 07:37:44,783 INFO L290 TraceCheckUtils]: 1: Hoare triple {4188#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(15, 2);call #Ultimate.allocInit(12, 3); {4188#true} is VALID [2022-04-15 07:37:44,784 INFO L290 TraceCheckUtils]: 2: Hoare triple {4188#true} assume true; {4188#true} is VALID [2022-04-15 07:37:44,784 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4188#true} {4188#true} #69#return; {4188#true} is VALID [2022-04-15 07:37:44,784 INFO L272 TraceCheckUtils]: 4: Hoare triple {4188#true} call #t~ret8 := main(); {4188#true} is VALID [2022-04-15 07:37:44,784 INFO L290 TraceCheckUtils]: 5: Hoare triple {4188#true} havoc ~X~0;havoc ~Y~0;havoc ~x~0;havoc ~y~0;havoc ~v~0;havoc ~xy~0;havoc ~yx~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~X~0 := #t~nondet4;havoc #t~nondet4; {4188#true} is VALID [2022-04-15 07:37:44,784 INFO L272 TraceCheckUtils]: 6: Hoare triple {4188#true} call assume_abort_if_not((if ~X~0 >= 0 && ~X~0 <= 10 then 1 else 0)); {4188#true} is VALID [2022-04-15 07:37:44,784 INFO L290 TraceCheckUtils]: 7: Hoare triple {4188#true} ~cond := #in~cond; {4188#true} is VALID [2022-04-15 07:37:44,784 INFO L290 TraceCheckUtils]: 8: Hoare triple {4188#true} assume !(0 == ~cond); {4188#true} is VALID [2022-04-15 07:37:44,784 INFO L290 TraceCheckUtils]: 9: Hoare triple {4188#true} assume true; {4188#true} is VALID [2022-04-15 07:37:44,784 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4188#true} {4188#true} #61#return; {4188#true} is VALID [2022-04-15 07:37:44,784 INFO L290 TraceCheckUtils]: 11: Hoare triple {4188#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~Y~0 := #t~nondet5;havoc #t~nondet5; {4188#true} is VALID [2022-04-15 07:37:44,784 INFO L272 TraceCheckUtils]: 12: Hoare triple {4188#true} call assume_abort_if_not((if ~Y~0 >= 0 && ~Y~0 <= 10 then 1 else 0)); {4188#true} is VALID [2022-04-15 07:37:44,784 INFO L290 TraceCheckUtils]: 13: Hoare triple {4188#true} ~cond := #in~cond; {4188#true} is VALID [2022-04-15 07:37:44,784 INFO L290 TraceCheckUtils]: 14: Hoare triple {4188#true} assume !(0 == ~cond); {4188#true} is VALID [2022-04-15 07:37:44,785 INFO L290 TraceCheckUtils]: 15: Hoare triple {4188#true} assume true; {4188#true} is VALID [2022-04-15 07:37:44,785 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {4188#true} {4188#true} #63#return; {4188#true} is VALID [2022-04-15 07:37:44,785 INFO L290 TraceCheckUtils]: 17: Hoare triple {4188#true} ~v~0 := 2 * ~Y~0 - ~X~0;~y~0 := 0;~x~0 := 0; {4244#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (= main_~y~0 0))} is VALID [2022-04-15 07:37:44,785 INFO L290 TraceCheckUtils]: 18: Hoare triple {4244#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (= main_~y~0 0))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {4244#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (= main_~y~0 0))} is VALID [2022-04-15 07:37:44,785 INFO L272 TraceCheckUtils]: 19: Hoare triple {4244#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {4188#true} is VALID [2022-04-15 07:37:44,786 INFO L290 TraceCheckUtils]: 20: Hoare triple {4188#true} ~cond := #in~cond; {4188#true} is VALID [2022-04-15 07:37:44,786 INFO L290 TraceCheckUtils]: 21: Hoare triple {4188#true} assume !(0 == ~cond); {4188#true} is VALID [2022-04-15 07:37:44,786 INFO L290 TraceCheckUtils]: 22: Hoare triple {4188#true} assume true; {4188#true} is VALID [2022-04-15 07:37:44,786 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {4188#true} {4244#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (= main_~y~0 0))} #65#return; {4244#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (= main_~y~0 0))} is VALID [2022-04-15 07:37:44,787 INFO L290 TraceCheckUtils]: 24: Hoare triple {4244#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (= main_~y~0 0))} assume !!(~x~0 <= ~X~0); {4244#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (= main_~y~0 0))} is VALID [2022-04-15 07:37:44,787 INFO L290 TraceCheckUtils]: 25: Hoare triple {4244#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (= main_~y~0 0))} assume !(~v~0 < 0);~v~0 := ~v~0 + 2 * (~Y~0 - ~X~0);#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {4269#(and (= main_~x~0 0) (= (+ (- 1) main_~y~0) 0) (not (< (+ main_~v~0 (* main_~X~0 2)) (* main_~Y~0 2))) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) (+ main_~v~0 (* main_~X~0 2) (* (- 2) main_~Y~0))))} is VALID [2022-04-15 07:37:44,788 INFO L290 TraceCheckUtils]: 26: Hoare triple {4269#(and (= main_~x~0 0) (= (+ (- 1) main_~y~0) 0) (not (< (+ main_~v~0 (* main_~X~0 2)) (* main_~Y~0 2))) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) (+ main_~v~0 (* main_~X~0 2) (* (- 2) main_~Y~0))))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {4273#(and (= (+ (- 1) main_~y~0) 0) (= main_~x~0 1) (not (< (+ main_~v~0 (* main_~X~0 2)) (* main_~Y~0 2))) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) (+ main_~v~0 (* main_~X~0 2) (* (- 2) main_~Y~0))))} is VALID [2022-04-15 07:37:44,788 INFO L290 TraceCheckUtils]: 27: Hoare triple {4273#(and (= (+ (- 1) main_~y~0) 0) (= main_~x~0 1) (not (< (+ main_~v~0 (* main_~X~0 2)) (* main_~Y~0 2))) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) (+ main_~v~0 (* main_~X~0 2) (* (- 2) main_~Y~0))))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {4273#(and (= (+ (- 1) main_~y~0) 0) (= main_~x~0 1) (not (< (+ main_~v~0 (* main_~X~0 2)) (* main_~Y~0 2))) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) (+ main_~v~0 (* main_~X~0 2) (* (- 2) main_~Y~0))))} is VALID [2022-04-15 07:37:44,788 INFO L272 TraceCheckUtils]: 28: Hoare triple {4273#(and (= (+ (- 1) main_~y~0) 0) (= main_~x~0 1) (not (< (+ main_~v~0 (* main_~X~0 2)) (* main_~Y~0 2))) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) (+ main_~v~0 (* main_~X~0 2) (* (- 2) main_~Y~0))))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {4188#true} is VALID [2022-04-15 07:37:44,788 INFO L290 TraceCheckUtils]: 29: Hoare triple {4188#true} ~cond := #in~cond; {4188#true} is VALID [2022-04-15 07:37:44,788 INFO L290 TraceCheckUtils]: 30: Hoare triple {4188#true} assume !(0 == ~cond); {4188#true} is VALID [2022-04-15 07:37:44,789 INFO L290 TraceCheckUtils]: 31: Hoare triple {4188#true} assume true; {4188#true} is VALID [2022-04-15 07:37:44,789 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {4188#true} {4273#(and (= (+ (- 1) main_~y~0) 0) (= main_~x~0 1) (not (< (+ main_~v~0 (* main_~X~0 2)) (* main_~Y~0 2))) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) (+ main_~v~0 (* main_~X~0 2) (* (- 2) main_~Y~0))))} #65#return; {4273#(and (= (+ (- 1) main_~y~0) 0) (= main_~x~0 1) (not (< (+ main_~v~0 (* main_~X~0 2)) (* main_~Y~0 2))) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) (+ main_~v~0 (* main_~X~0 2) (* (- 2) main_~Y~0))))} is VALID [2022-04-15 07:37:44,789 INFO L290 TraceCheckUtils]: 33: Hoare triple {4273#(and (= (+ (- 1) main_~y~0) 0) (= main_~x~0 1) (not (< (+ main_~v~0 (* main_~X~0 2)) (* main_~Y~0 2))) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) (+ main_~v~0 (* main_~X~0 2) (* (- 2) main_~Y~0))))} assume !!(~x~0 <= ~X~0); {4295#(and (<= main_~x~0 main_~X~0) (= (+ (- 1) main_~y~0) 0) (= main_~x~0 1) (not (< (+ main_~v~0 (* main_~X~0 2)) (* main_~Y~0 2))) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) (+ main_~v~0 (* main_~X~0 2) (* (- 2) main_~Y~0))))} is VALID [2022-04-15 07:37:44,790 INFO L290 TraceCheckUtils]: 34: Hoare triple {4295#(and (<= main_~x~0 main_~X~0) (= (+ (- 1) main_~y~0) 0) (= main_~x~0 1) (not (< (+ main_~v~0 (* main_~X~0 2)) (* main_~Y~0 2))) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) (+ main_~v~0 (* main_~X~0 2) (* (- 2) main_~Y~0))))} assume !(~v~0 < 0);~v~0 := ~v~0 + 2 * (~Y~0 - ~X~0);#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {4299#(and (= main_~v~0 (+ (* main_~Y~0 6) (* main_~X~0 (- 5)))) (<= main_~x~0 main_~X~0) (= (+ (- 2) main_~y~0) 0) (not (< (* main_~Y~0 2) main_~X~0)) (= main_~x~0 1))} is VALID [2022-04-15 07:37:44,791 INFO L290 TraceCheckUtils]: 35: Hoare triple {4299#(and (= main_~v~0 (+ (* main_~Y~0 6) (* main_~X~0 (- 5)))) (<= main_~x~0 main_~X~0) (= (+ (- 2) main_~y~0) 0) (not (< (* main_~Y~0 2) main_~X~0)) (= main_~x~0 1))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {4303#(and (= (+ (- 1) main_~x~0) 1) (= main_~v~0 (+ (* main_~Y~0 6) (* main_~X~0 (- 5)))) (= (+ (- 2) main_~y~0) 0) (not (< (* main_~Y~0 2) main_~X~0)) (<= main_~x~0 (+ main_~X~0 1)))} is VALID [2022-04-15 07:37:44,791 INFO L290 TraceCheckUtils]: 36: Hoare triple {4303#(and (= (+ (- 1) main_~x~0) 1) (= main_~v~0 (+ (* main_~Y~0 6) (* main_~X~0 (- 5)))) (= (+ (- 2) main_~y~0) 0) (not (< (* main_~Y~0 2) main_~X~0)) (<= main_~x~0 (+ main_~X~0 1)))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {4307#(and (= main_~v~0 (+ (* main_~Y~0 6) (* main_~X~0 (- 5)))) (= main_~xy~0 (* main_~X~0 2)) (not (< (* main_~Y~0 2) main_~X~0)) (= (* main_~Y~0 2) main_~yx~0) (<= 1 main_~X~0))} is VALID [2022-04-15 07:37:44,792 INFO L272 TraceCheckUtils]: 37: Hoare triple {4307#(and (= main_~v~0 (+ (* main_~Y~0 6) (* main_~X~0 (- 5)))) (= main_~xy~0 (* main_~X~0 2)) (not (< (* main_~Y~0 2) main_~X~0)) (= (* main_~Y~0 2) main_~yx~0) (<= 1 main_~X~0))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {4311#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 07:37:44,792 INFO L290 TraceCheckUtils]: 38: Hoare triple {4311#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4315#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 07:37:44,792 INFO L290 TraceCheckUtils]: 39: Hoare triple {4315#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4189#false} is VALID [2022-04-15 07:37:44,793 INFO L290 TraceCheckUtils]: 40: Hoare triple {4189#false} assume !false; {4189#false} is VALID [2022-04-15 07:37:44,793 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-04-15 07:37:44,793 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 07:37:45,155 INFO L290 TraceCheckUtils]: 40: Hoare triple {4189#false} assume !false; {4189#false} is VALID [2022-04-15 07:37:45,155 INFO L290 TraceCheckUtils]: 39: Hoare triple {4315#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4189#false} is VALID [2022-04-15 07:37:45,155 INFO L290 TraceCheckUtils]: 38: Hoare triple {4311#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4315#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 07:37:45,156 INFO L272 TraceCheckUtils]: 37: Hoare triple {4331#(= (+ (* 2 main_~xy~0) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 main_~yx~0)))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {4311#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 07:37:45,157 INFO L290 TraceCheckUtils]: 36: Hoare triple {4335#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {4331#(= (+ (* 2 main_~xy~0) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 main_~yx~0)))} is VALID [2022-04-15 07:37:45,158 INFO L290 TraceCheckUtils]: 35: Hoare triple {4339#(= (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0))))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {4335#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} is VALID [2022-04-15 07:37:45,160 INFO L290 TraceCheckUtils]: 34: Hoare triple {4335#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} assume !(~v~0 < 0);~v~0 := ~v~0 + 2 * (~Y~0 - ~X~0);#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {4339#(= (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0))))} is VALID [2022-04-15 07:37:45,160 INFO L290 TraceCheckUtils]: 33: Hoare triple {4346#(or (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (not (<= main_~x~0 main_~X~0)))} assume !!(~x~0 <= ~X~0); {4335#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} is VALID [2022-04-15 07:37:45,161 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {4188#true} {4346#(or (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (not (<= main_~x~0 main_~X~0)))} #65#return; {4346#(or (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (not (<= main_~x~0 main_~X~0)))} is VALID [2022-04-15 07:37:45,161 INFO L290 TraceCheckUtils]: 31: Hoare triple {4188#true} assume true; {4188#true} is VALID [2022-04-15 07:37:45,161 INFO L290 TraceCheckUtils]: 30: Hoare triple {4188#true} assume !(0 == ~cond); {4188#true} is VALID [2022-04-15 07:37:45,161 INFO L290 TraceCheckUtils]: 29: Hoare triple {4188#true} ~cond := #in~cond; {4188#true} is VALID [2022-04-15 07:37:45,161 INFO L272 TraceCheckUtils]: 28: Hoare triple {4346#(or (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (not (<= main_~x~0 main_~X~0)))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {4188#true} is VALID [2022-04-15 07:37:45,161 INFO L290 TraceCheckUtils]: 27: Hoare triple {4346#(or (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (not (<= main_~x~0 main_~X~0)))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {4346#(or (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (not (<= main_~x~0 main_~X~0)))} is VALID [2022-04-15 07:37:45,163 INFO L290 TraceCheckUtils]: 26: Hoare triple {4368#(or (not (<= (+ main_~x~0 1) main_~X~0)) (= (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0)))))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {4346#(or (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (not (<= main_~x~0 main_~X~0)))} is VALID [2022-04-15 07:37:45,164 INFO L290 TraceCheckUtils]: 25: Hoare triple {4372#(or (< main_~v~0 0) (= (+ main_~v~0 (* (- 1) main_~X~0) (* main_~Y~0 2) (* (* main_~X~0 (+ main_~y~0 1)) 2)) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0)))) (not (<= (+ main_~x~0 1) main_~X~0)))} assume !(~v~0 < 0);~v~0 := ~v~0 + 2 * (~Y~0 - ~X~0);#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {4368#(or (not (<= (+ main_~x~0 1) main_~X~0)) (= (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0)))))} is VALID [2022-04-15 07:37:45,165 INFO L290 TraceCheckUtils]: 24: Hoare triple {4372#(or (< main_~v~0 0) (= (+ main_~v~0 (* (- 1) main_~X~0) (* main_~Y~0 2) (* (* main_~X~0 (+ main_~y~0 1)) 2)) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0)))) (not (<= (+ main_~x~0 1) main_~X~0)))} assume !!(~x~0 <= ~X~0); {4372#(or (< main_~v~0 0) (= (+ main_~v~0 (* (- 1) main_~X~0) (* main_~Y~0 2) (* (* main_~X~0 (+ main_~y~0 1)) 2)) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0)))) (not (<= (+ main_~x~0 1) main_~X~0)))} is VALID [2022-04-15 07:37:45,165 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {4188#true} {4372#(or (< main_~v~0 0) (= (+ main_~v~0 (* (- 1) main_~X~0) (* main_~Y~0 2) (* (* main_~X~0 (+ main_~y~0 1)) 2)) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0)))) (not (<= (+ main_~x~0 1) main_~X~0)))} #65#return; {4372#(or (< main_~v~0 0) (= (+ main_~v~0 (* (- 1) main_~X~0) (* main_~Y~0 2) (* (* main_~X~0 (+ main_~y~0 1)) 2)) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0)))) (not (<= (+ main_~x~0 1) main_~X~0)))} is VALID [2022-04-15 07:37:45,165 INFO L290 TraceCheckUtils]: 22: Hoare triple {4188#true} assume true; {4188#true} is VALID [2022-04-15 07:37:45,165 INFO L290 TraceCheckUtils]: 21: Hoare triple {4188#true} assume !(0 == ~cond); {4188#true} is VALID [2022-04-15 07:37:45,165 INFO L290 TraceCheckUtils]: 20: Hoare triple {4188#true} ~cond := #in~cond; {4188#true} is VALID [2022-04-15 07:37:45,165 INFO L272 TraceCheckUtils]: 19: Hoare triple {4372#(or (< main_~v~0 0) (= (+ main_~v~0 (* (- 1) main_~X~0) (* main_~Y~0 2) (* (* main_~X~0 (+ main_~y~0 1)) 2)) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0)))) (not (<= (+ main_~x~0 1) main_~X~0)))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {4188#true} is VALID [2022-04-15 07:37:45,166 INFO L290 TraceCheckUtils]: 18: Hoare triple {4372#(or (< main_~v~0 0) (= (+ main_~v~0 (* (- 1) main_~X~0) (* main_~Y~0 2) (* (* main_~X~0 (+ main_~y~0 1)) 2)) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0)))) (not (<= (+ main_~x~0 1) main_~X~0)))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {4372#(or (< main_~v~0 0) (= (+ main_~v~0 (* (- 1) main_~X~0) (* main_~Y~0 2) (* (* main_~X~0 (+ main_~y~0 1)) 2)) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0)))) (not (<= (+ main_~x~0 1) main_~X~0)))} is VALID [2022-04-15 07:37:45,166 INFO L290 TraceCheckUtils]: 17: Hoare triple {4188#true} ~v~0 := 2 * ~Y~0 - ~X~0;~y~0 := 0;~x~0 := 0; {4372#(or (< main_~v~0 0) (= (+ main_~v~0 (* (- 1) main_~X~0) (* main_~Y~0 2) (* (* main_~X~0 (+ main_~y~0 1)) 2)) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0)))) (not (<= (+ main_~x~0 1) main_~X~0)))} is VALID [2022-04-15 07:37:45,166 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {4188#true} {4188#true} #63#return; {4188#true} is VALID [2022-04-15 07:37:45,166 INFO L290 TraceCheckUtils]: 15: Hoare triple {4188#true} assume true; {4188#true} is VALID [2022-04-15 07:37:45,167 INFO L290 TraceCheckUtils]: 14: Hoare triple {4188#true} assume !(0 == ~cond); {4188#true} is VALID [2022-04-15 07:37:45,167 INFO L290 TraceCheckUtils]: 13: Hoare triple {4188#true} ~cond := #in~cond; {4188#true} is VALID [2022-04-15 07:37:45,167 INFO L272 TraceCheckUtils]: 12: Hoare triple {4188#true} call assume_abort_if_not((if ~Y~0 >= 0 && ~Y~0 <= 10 then 1 else 0)); {4188#true} is VALID [2022-04-15 07:37:45,167 INFO L290 TraceCheckUtils]: 11: Hoare triple {4188#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~Y~0 := #t~nondet5;havoc #t~nondet5; {4188#true} is VALID [2022-04-15 07:37:45,167 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4188#true} {4188#true} #61#return; {4188#true} is VALID [2022-04-15 07:37:45,167 INFO L290 TraceCheckUtils]: 9: Hoare triple {4188#true} assume true; {4188#true} is VALID [2022-04-15 07:37:45,167 INFO L290 TraceCheckUtils]: 8: Hoare triple {4188#true} assume !(0 == ~cond); {4188#true} is VALID [2022-04-15 07:37:45,167 INFO L290 TraceCheckUtils]: 7: Hoare triple {4188#true} ~cond := #in~cond; {4188#true} is VALID [2022-04-15 07:37:45,167 INFO L272 TraceCheckUtils]: 6: Hoare triple {4188#true} call assume_abort_if_not((if ~X~0 >= 0 && ~X~0 <= 10 then 1 else 0)); {4188#true} is VALID [2022-04-15 07:37:45,167 INFO L290 TraceCheckUtils]: 5: Hoare triple {4188#true} havoc ~X~0;havoc ~Y~0;havoc ~x~0;havoc ~y~0;havoc ~v~0;havoc ~xy~0;havoc ~yx~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~X~0 := #t~nondet4;havoc #t~nondet4; {4188#true} is VALID [2022-04-15 07:37:45,167 INFO L272 TraceCheckUtils]: 4: Hoare triple {4188#true} call #t~ret8 := main(); {4188#true} is VALID [2022-04-15 07:37:45,167 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4188#true} {4188#true} #69#return; {4188#true} is VALID [2022-04-15 07:37:45,167 INFO L290 TraceCheckUtils]: 2: Hoare triple {4188#true} assume true; {4188#true} is VALID [2022-04-15 07:37:45,168 INFO L290 TraceCheckUtils]: 1: Hoare triple {4188#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(15, 2);call #Ultimate.allocInit(12, 3); {4188#true} is VALID [2022-04-15 07:37:45,168 INFO L272 TraceCheckUtils]: 0: Hoare triple {4188#true} call ULTIMATE.init(); {4188#true} is VALID [2022-04-15 07:37:45,168 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-04-15 07:37:45,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:37:45,168 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1898592806] [2022-04-15 07:37:45,168 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 07:37:45,168 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [458097914] [2022-04-15 07:37:45,168 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [458097914] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 07:37:45,168 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 07:37:45,168 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 17 [2022-04-15 07:37:45,169 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:37:45,169 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [371130089] [2022-04-15 07:37:45,169 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [371130089] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:37:45,169 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:37:45,169 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-15 07:37:45,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1005543632] [2022-04-15 07:37:45,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:37:45,169 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 4 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 41 [2022-04-15 07:37:45,169 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:37:45,170 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 4 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-15 07:37:45,203 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:37:45,203 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-15 07:37:45,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:37:45,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-15 07:37:45,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=219, Unknown=0, NotChecked=0, Total=272 [2022-04-15 07:37:45,204 INFO L87 Difference]: Start difference. First operand 73 states and 80 transitions. Second operand has 11 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 4 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-15 07:37:45,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:37:45,931 INFO L93 Difference]: Finished difference Result 86 states and 95 transitions. [2022-04-15 07:37:45,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-15 07:37:45,931 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 4 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 41 [2022-04-15 07:37:45,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:37:45,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 4 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-15 07:37:45,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 58 transitions. [2022-04-15 07:37:45,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 4 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-15 07:37:45,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 58 transitions. [2022-04-15 07:37:45,934 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 58 transitions. [2022-04-15 07:37:45,981 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:37:45,982 INFO L225 Difference]: With dead ends: 86 [2022-04-15 07:37:45,982 INFO L226 Difference]: Without dead ends: 84 [2022-04-15 07:37:45,982 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 62 SyntacticMatches, 4 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=65, Invalid=277, Unknown=0, NotChecked=0, Total=342 [2022-04-15 07:37:45,983 INFO L913 BasicCegarLoop]: 32 mSDtfsCounter, 11 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 254 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 07:37:45,983 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 184 Invalid, 257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 254 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 07:37:45,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2022-04-15 07:37:46,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 73. [2022-04-15 07:37:46,103 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:37:46,103 INFO L82 GeneralOperation]: Start isEquivalent. First operand 84 states. Second operand has 73 states, 52 states have (on average 1.1153846153846154) internal successors, (58), 54 states have internal predecessors, (58), 12 states have call successors, (12), 9 states have call predecessors, (12), 8 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-15 07:37:46,104 INFO L74 IsIncluded]: Start isIncluded. First operand 84 states. Second operand has 73 states, 52 states have (on average 1.1153846153846154) internal successors, (58), 54 states have internal predecessors, (58), 12 states have call successors, (12), 9 states have call predecessors, (12), 8 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-15 07:37:46,104 INFO L87 Difference]: Start difference. First operand 84 states. Second operand has 73 states, 52 states have (on average 1.1153846153846154) internal successors, (58), 54 states have internal predecessors, (58), 12 states have call successors, (12), 9 states have call predecessors, (12), 8 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-15 07:37:46,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:37:46,105 INFO L93 Difference]: Finished difference Result 84 states and 93 transitions. [2022-04-15 07:37:46,106 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 93 transitions. [2022-04-15 07:37:46,106 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:37:46,106 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:37:46,106 INFO L74 IsIncluded]: Start isIncluded. First operand has 73 states, 52 states have (on average 1.1153846153846154) internal successors, (58), 54 states have internal predecessors, (58), 12 states have call successors, (12), 9 states have call predecessors, (12), 8 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) Second operand 84 states. [2022-04-15 07:37:46,106 INFO L87 Difference]: Start difference. First operand has 73 states, 52 states have (on average 1.1153846153846154) internal successors, (58), 54 states have internal predecessors, (58), 12 states have call successors, (12), 9 states have call predecessors, (12), 8 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) Second operand 84 states. [2022-04-15 07:37:46,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:37:46,108 INFO L93 Difference]: Finished difference Result 84 states and 93 transitions. [2022-04-15 07:37:46,108 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 93 transitions. [2022-04-15 07:37:46,108 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:37:46,108 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:37:46,108 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:37:46,108 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:37:46,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 52 states have (on average 1.1153846153846154) internal successors, (58), 54 states have internal predecessors, (58), 12 states have call successors, (12), 9 states have call predecessors, (12), 8 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-15 07:37:46,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 80 transitions. [2022-04-15 07:37:46,110 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 80 transitions. Word has length 41 [2022-04-15 07:37:46,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:37:46,110 INFO L478 AbstractCegarLoop]: Abstraction has 73 states and 80 transitions. [2022-04-15 07:37:46,111 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 4 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-15 07:37:46,111 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 73 states and 80 transitions. [2022-04-15 07:37:46,228 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 80 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:37:46,228 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 80 transitions. [2022-04-15 07:37:46,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-04-15 07:37:46,228 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:37:46,228 INFO L499 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 07:37:46,244 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-15 07:37:46,435 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2022-04-15 07:37:46,435 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:37:46,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:37:46,436 INFO L85 PathProgramCache]: Analyzing trace with hash 651179076, now seen corresponding path program 1 times [2022-04-15 07:37:46,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:37:46,436 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [899410996] [2022-04-15 07:37:46,436 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 07:37:46,436 INFO L85 PathProgramCache]: Analyzing trace with hash 651179076, now seen corresponding path program 2 times [2022-04-15 07:37:46,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:37:46,436 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1524939451] [2022-04-15 07:37:46,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:37:46,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:37:46,451 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 07:37:46,452 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [283761894] [2022-04-15 07:37:46,452 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 07:37:46,452 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 07:37:46,452 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 07:37:46,453 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 07:37:46,454 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-04-15 07:37:46,490 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 07:37:46,490 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 07:37:46,490 INFO L263 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-15 07:37:46,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:37:46,502 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 07:37:47,185 INFO L272 TraceCheckUtils]: 0: Hoare triple {4940#true} call ULTIMATE.init(); {4940#true} is VALID [2022-04-15 07:37:47,185 INFO L290 TraceCheckUtils]: 1: Hoare triple {4940#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(15, 2);call #Ultimate.allocInit(12, 3); {4940#true} is VALID [2022-04-15 07:37:47,185 INFO L290 TraceCheckUtils]: 2: Hoare triple {4940#true} assume true; {4940#true} is VALID [2022-04-15 07:37:47,185 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4940#true} {4940#true} #69#return; {4940#true} is VALID [2022-04-15 07:37:47,186 INFO L272 TraceCheckUtils]: 4: Hoare triple {4940#true} call #t~ret8 := main(); {4940#true} is VALID [2022-04-15 07:37:47,186 INFO L290 TraceCheckUtils]: 5: Hoare triple {4940#true} havoc ~X~0;havoc ~Y~0;havoc ~x~0;havoc ~y~0;havoc ~v~0;havoc ~xy~0;havoc ~yx~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~X~0 := #t~nondet4;havoc #t~nondet4; {4940#true} is VALID [2022-04-15 07:37:47,186 INFO L272 TraceCheckUtils]: 6: Hoare triple {4940#true} call assume_abort_if_not((if ~X~0 >= 0 && ~X~0 <= 10 then 1 else 0)); {4940#true} is VALID [2022-04-15 07:37:47,186 INFO L290 TraceCheckUtils]: 7: Hoare triple {4940#true} ~cond := #in~cond; {4940#true} is VALID [2022-04-15 07:37:47,186 INFO L290 TraceCheckUtils]: 8: Hoare triple {4940#true} assume !(0 == ~cond); {4940#true} is VALID [2022-04-15 07:37:47,186 INFO L290 TraceCheckUtils]: 9: Hoare triple {4940#true} assume true; {4940#true} is VALID [2022-04-15 07:37:47,186 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4940#true} {4940#true} #61#return; {4940#true} is VALID [2022-04-15 07:37:47,186 INFO L290 TraceCheckUtils]: 11: Hoare triple {4940#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~Y~0 := #t~nondet5;havoc #t~nondet5; {4940#true} is VALID [2022-04-15 07:37:47,186 INFO L272 TraceCheckUtils]: 12: Hoare triple {4940#true} call assume_abort_if_not((if ~Y~0 >= 0 && ~Y~0 <= 10 then 1 else 0)); {4940#true} is VALID [2022-04-15 07:37:47,186 INFO L290 TraceCheckUtils]: 13: Hoare triple {4940#true} ~cond := #in~cond; {4940#true} is VALID [2022-04-15 07:37:47,186 INFO L290 TraceCheckUtils]: 14: Hoare triple {4940#true} assume !(0 == ~cond); {4940#true} is VALID [2022-04-15 07:37:47,186 INFO L290 TraceCheckUtils]: 15: Hoare triple {4940#true} assume true; {4940#true} is VALID [2022-04-15 07:37:47,186 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {4940#true} {4940#true} #63#return; {4940#true} is VALID [2022-04-15 07:37:47,188 INFO L290 TraceCheckUtils]: 17: Hoare triple {4940#true} ~v~0 := 2 * ~Y~0 - ~X~0;~y~0 := 0;~x~0 := 0; {4996#(and (<= main_~x~0 0) (<= (* main_~Y~0 2) (+ main_~X~0 main_~v~0)))} is VALID [2022-04-15 07:37:47,189 INFO L290 TraceCheckUtils]: 18: Hoare triple {4996#(and (<= main_~x~0 0) (<= (* main_~Y~0 2) (+ main_~X~0 main_~v~0)))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {4996#(and (<= main_~x~0 0) (<= (* main_~Y~0 2) (+ main_~X~0 main_~v~0)))} is VALID [2022-04-15 07:37:47,189 INFO L272 TraceCheckUtils]: 19: Hoare triple {4996#(and (<= main_~x~0 0) (<= (* main_~Y~0 2) (+ main_~X~0 main_~v~0)))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {4940#true} is VALID [2022-04-15 07:37:47,189 INFO L290 TraceCheckUtils]: 20: Hoare triple {4940#true} ~cond := #in~cond; {4940#true} is VALID [2022-04-15 07:37:47,189 INFO L290 TraceCheckUtils]: 21: Hoare triple {4940#true} assume !(0 == ~cond); {4940#true} is VALID [2022-04-15 07:37:47,189 INFO L290 TraceCheckUtils]: 22: Hoare triple {4940#true} assume true; {4940#true} is VALID [2022-04-15 07:37:47,190 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {4940#true} {4996#(and (<= main_~x~0 0) (<= (* main_~Y~0 2) (+ main_~X~0 main_~v~0)))} #65#return; {4996#(and (<= main_~x~0 0) (<= (* main_~Y~0 2) (+ main_~X~0 main_~v~0)))} is VALID [2022-04-15 07:37:47,190 INFO L290 TraceCheckUtils]: 24: Hoare triple {4996#(and (<= main_~x~0 0) (<= (* main_~Y~0 2) (+ main_~X~0 main_~v~0)))} assume !!(~x~0 <= ~X~0); {4996#(and (<= main_~x~0 0) (<= (* main_~Y~0 2) (+ main_~X~0 main_~v~0)))} is VALID [2022-04-15 07:37:47,191 INFO L290 TraceCheckUtils]: 25: Hoare triple {4996#(and (<= main_~x~0 0) (<= (* main_~Y~0 2) (+ main_~X~0 main_~v~0)))} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {5021#(and (<= main_~x~0 0) (< (div (+ (- 1) (* (- 1) main_~v~0)) (- 2)) (+ (div (+ (- 1) main_~X~0) 2) 1)))} is VALID [2022-04-15 07:37:47,192 INFO L290 TraceCheckUtils]: 26: Hoare triple {5021#(and (<= main_~x~0 0) (< (div (+ (- 1) (* (- 1) main_~v~0)) (- 2)) (+ (div (+ (- 1) main_~X~0) 2) 1)))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {5025#(and (<= main_~x~0 1) (< (div (+ (- 1) (* (- 1) main_~v~0)) (- 2)) (+ (div (+ (- 1) main_~X~0) 2) 1)))} is VALID [2022-04-15 07:37:47,193 INFO L290 TraceCheckUtils]: 27: Hoare triple {5025#(and (<= main_~x~0 1) (< (div (+ (- 1) (* (- 1) main_~v~0)) (- 2)) (+ (div (+ (- 1) main_~X~0) 2) 1)))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {5025#(and (<= main_~x~0 1) (< (div (+ (- 1) (* (- 1) main_~v~0)) (- 2)) (+ (div (+ (- 1) main_~X~0) 2) 1)))} is VALID [2022-04-15 07:37:47,193 INFO L272 TraceCheckUtils]: 28: Hoare triple {5025#(and (<= main_~x~0 1) (< (div (+ (- 1) (* (- 1) main_~v~0)) (- 2)) (+ (div (+ (- 1) main_~X~0) 2) 1)))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {4940#true} is VALID [2022-04-15 07:37:47,193 INFO L290 TraceCheckUtils]: 29: Hoare triple {4940#true} ~cond := #in~cond; {4940#true} is VALID [2022-04-15 07:37:47,193 INFO L290 TraceCheckUtils]: 30: Hoare triple {4940#true} assume !(0 == ~cond); {4940#true} is VALID [2022-04-15 07:37:47,193 INFO L290 TraceCheckUtils]: 31: Hoare triple {4940#true} assume true; {4940#true} is VALID [2022-04-15 07:37:47,194 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {4940#true} {5025#(and (<= main_~x~0 1) (< (div (+ (- 1) (* (- 1) main_~v~0)) (- 2)) (+ (div (+ (- 1) main_~X~0) 2) 1)))} #65#return; {5025#(and (<= main_~x~0 1) (< (div (+ (- 1) (* (- 1) main_~v~0)) (- 2)) (+ (div (+ (- 1) main_~X~0) 2) 1)))} is VALID [2022-04-15 07:37:47,194 INFO L290 TraceCheckUtils]: 33: Hoare triple {5025#(and (<= main_~x~0 1) (< (div (+ (- 1) (* (- 1) main_~v~0)) (- 2)) (+ (div (+ (- 1) main_~X~0) 2) 1)))} assume !!(~x~0 <= ~X~0); {5025#(and (<= main_~x~0 1) (< (div (+ (- 1) (* (- 1) main_~v~0)) (- 2)) (+ (div (+ (- 1) main_~X~0) 2) 1)))} is VALID [2022-04-15 07:37:47,195 INFO L290 TraceCheckUtils]: 34: Hoare triple {5025#(and (<= main_~x~0 1) (< (div (+ (- 1) (* (- 1) main_~v~0)) (- 2)) (+ (div (+ (- 1) main_~X~0) 2) 1)))} assume !(~v~0 < 0);~v~0 := ~v~0 + 2 * (~Y~0 - ~X~0);#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {5050#(and (<= main_~x~0 1) (< 0 (div (+ (- 1) main_~X~0) 2)))} is VALID [2022-04-15 07:37:47,195 INFO L290 TraceCheckUtils]: 35: Hoare triple {5050#(and (<= main_~x~0 1) (< 0 (div (+ (- 1) main_~X~0) 2)))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {5054#(and (<= main_~x~0 2) (< 0 (div (+ (- 1) main_~X~0) 2)))} is VALID [2022-04-15 07:37:47,196 INFO L290 TraceCheckUtils]: 36: Hoare triple {5054#(and (<= main_~x~0 2) (< 0 (div (+ (- 1) main_~X~0) 2)))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {5054#(and (<= main_~x~0 2) (< 0 (div (+ (- 1) main_~X~0) 2)))} is VALID [2022-04-15 07:37:47,196 INFO L272 TraceCheckUtils]: 37: Hoare triple {5054#(and (<= main_~x~0 2) (< 0 (div (+ (- 1) main_~X~0) 2)))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {4940#true} is VALID [2022-04-15 07:37:47,196 INFO L290 TraceCheckUtils]: 38: Hoare triple {4940#true} ~cond := #in~cond; {4940#true} is VALID [2022-04-15 07:37:47,196 INFO L290 TraceCheckUtils]: 39: Hoare triple {4940#true} assume !(0 == ~cond); {4940#true} is VALID [2022-04-15 07:37:47,196 INFO L290 TraceCheckUtils]: 40: Hoare triple {4940#true} assume true; {4940#true} is VALID [2022-04-15 07:37:47,197 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {4940#true} {5054#(and (<= main_~x~0 2) (< 0 (div (+ (- 1) main_~X~0) 2)))} #65#return; {5054#(and (<= main_~x~0 2) (< 0 (div (+ (- 1) main_~X~0) 2)))} is VALID [2022-04-15 07:37:47,197 INFO L290 TraceCheckUtils]: 42: Hoare triple {5054#(and (<= main_~x~0 2) (< 0 (div (+ (- 1) main_~X~0) 2)))} assume !(~x~0 <= ~X~0); {4941#false} is VALID [2022-04-15 07:37:47,197 INFO L290 TraceCheckUtils]: 43: Hoare triple {4941#false} ~xy~0 := ~x~0 * ~y~0;~yx~0 := ~Y~0 * ~x~0; {4941#false} is VALID [2022-04-15 07:37:47,197 INFO L272 TraceCheckUtils]: 44: Hoare triple {4941#false} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 + 2 * ~y~0 then 1 else 0)); {4941#false} is VALID [2022-04-15 07:37:47,198 INFO L290 TraceCheckUtils]: 45: Hoare triple {4941#false} ~cond := #in~cond; {4941#false} is VALID [2022-04-15 07:37:47,198 INFO L290 TraceCheckUtils]: 46: Hoare triple {4941#false} assume 0 == ~cond; {4941#false} is VALID [2022-04-15 07:37:47,198 INFO L290 TraceCheckUtils]: 47: Hoare triple {4941#false} assume !false; {4941#false} is VALID [2022-04-15 07:37:47,198 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 6 proven. 11 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-04-15 07:37:47,198 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 07:37:47,471 INFO L290 TraceCheckUtils]: 47: Hoare triple {4941#false} assume !false; {4941#false} is VALID [2022-04-15 07:37:47,471 INFO L290 TraceCheckUtils]: 46: Hoare triple {4941#false} assume 0 == ~cond; {4941#false} is VALID [2022-04-15 07:37:47,471 INFO L290 TraceCheckUtils]: 45: Hoare triple {4941#false} ~cond := #in~cond; {4941#false} is VALID [2022-04-15 07:37:47,471 INFO L272 TraceCheckUtils]: 44: Hoare triple {4941#false} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 + 2 * ~y~0 then 1 else 0)); {4941#false} is VALID [2022-04-15 07:37:47,471 INFO L290 TraceCheckUtils]: 43: Hoare triple {4941#false} ~xy~0 := ~x~0 * ~y~0;~yx~0 := ~Y~0 * ~x~0; {4941#false} is VALID [2022-04-15 07:37:47,472 INFO L290 TraceCheckUtils]: 42: Hoare triple {5106#(<= main_~x~0 main_~X~0)} assume !(~x~0 <= ~X~0); {4941#false} is VALID [2022-04-15 07:37:47,472 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {4940#true} {5106#(<= main_~x~0 main_~X~0)} #65#return; {5106#(<= main_~x~0 main_~X~0)} is VALID [2022-04-15 07:37:47,472 INFO L290 TraceCheckUtils]: 40: Hoare triple {4940#true} assume true; {4940#true} is VALID [2022-04-15 07:37:47,472 INFO L290 TraceCheckUtils]: 39: Hoare triple {4940#true} assume !(0 == ~cond); {4940#true} is VALID [2022-04-15 07:37:47,472 INFO L290 TraceCheckUtils]: 38: Hoare triple {4940#true} ~cond := #in~cond; {4940#true} is VALID [2022-04-15 07:37:47,472 INFO L272 TraceCheckUtils]: 37: Hoare triple {5106#(<= main_~x~0 main_~X~0)} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {4940#true} is VALID [2022-04-15 07:37:47,473 INFO L290 TraceCheckUtils]: 36: Hoare triple {5106#(<= main_~x~0 main_~X~0)} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {5106#(<= main_~x~0 main_~X~0)} is VALID [2022-04-15 07:37:47,483 INFO L290 TraceCheckUtils]: 35: Hoare triple {5128#(<= (+ main_~x~0 1) main_~X~0)} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {5106#(<= main_~x~0 main_~X~0)} is VALID [2022-04-15 07:37:47,484 INFO L290 TraceCheckUtils]: 34: Hoare triple {5132#(or (< main_~v~0 0) (<= (+ main_~x~0 1) main_~X~0))} assume !(~v~0 < 0);~v~0 := ~v~0 + 2 * (~Y~0 - ~X~0);#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {5128#(<= (+ main_~x~0 1) main_~X~0)} is VALID [2022-04-15 07:37:47,484 INFO L290 TraceCheckUtils]: 33: Hoare triple {5132#(or (< main_~v~0 0) (<= (+ main_~x~0 1) main_~X~0))} assume !!(~x~0 <= ~X~0); {5132#(or (< main_~v~0 0) (<= (+ main_~x~0 1) main_~X~0))} is VALID [2022-04-15 07:37:47,485 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {4940#true} {5132#(or (< main_~v~0 0) (<= (+ main_~x~0 1) main_~X~0))} #65#return; {5132#(or (< main_~v~0 0) (<= (+ main_~x~0 1) main_~X~0))} is VALID [2022-04-15 07:37:47,485 INFO L290 TraceCheckUtils]: 31: Hoare triple {4940#true} assume true; {4940#true} is VALID [2022-04-15 07:37:47,485 INFO L290 TraceCheckUtils]: 30: Hoare triple {4940#true} assume !(0 == ~cond); {4940#true} is VALID [2022-04-15 07:37:47,485 INFO L290 TraceCheckUtils]: 29: Hoare triple {4940#true} ~cond := #in~cond; {4940#true} is VALID [2022-04-15 07:37:47,485 INFO L272 TraceCheckUtils]: 28: Hoare triple {5132#(or (< main_~v~0 0) (<= (+ main_~x~0 1) main_~X~0))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {4940#true} is VALID [2022-04-15 07:37:47,485 INFO L290 TraceCheckUtils]: 27: Hoare triple {5132#(or (< main_~v~0 0) (<= (+ main_~x~0 1) main_~X~0))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {5132#(or (< main_~v~0 0) (<= (+ main_~x~0 1) main_~X~0))} is VALID [2022-04-15 07:37:47,486 INFO L290 TraceCheckUtils]: 26: Hoare triple {5157#(or (<= (+ main_~x~0 2) main_~X~0) (< main_~v~0 0))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {5132#(or (< main_~v~0 0) (<= (+ main_~x~0 1) main_~X~0))} is VALID [2022-04-15 07:37:47,487 INFO L290 TraceCheckUtils]: 25: Hoare triple {5161#(or (<= (+ main_~x~0 2) main_~X~0) (< (+ main_~v~0 (* main_~Y~0 2)) 0) (not (< main_~v~0 0)))} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {5157#(or (<= (+ main_~x~0 2) main_~X~0) (< main_~v~0 0))} is VALID [2022-04-15 07:37:47,487 INFO L290 TraceCheckUtils]: 24: Hoare triple {5161#(or (<= (+ main_~x~0 2) main_~X~0) (< (+ main_~v~0 (* main_~Y~0 2)) 0) (not (< main_~v~0 0)))} assume !!(~x~0 <= ~X~0); {5161#(or (<= (+ main_~x~0 2) main_~X~0) (< (+ main_~v~0 (* main_~Y~0 2)) 0) (not (< main_~v~0 0)))} is VALID [2022-04-15 07:37:47,487 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {4940#true} {5161#(or (<= (+ main_~x~0 2) main_~X~0) (< (+ main_~v~0 (* main_~Y~0 2)) 0) (not (< main_~v~0 0)))} #65#return; {5161#(or (<= (+ main_~x~0 2) main_~X~0) (< (+ main_~v~0 (* main_~Y~0 2)) 0) (not (< main_~v~0 0)))} is VALID [2022-04-15 07:37:47,488 INFO L290 TraceCheckUtils]: 22: Hoare triple {4940#true} assume true; {4940#true} is VALID [2022-04-15 07:37:47,488 INFO L290 TraceCheckUtils]: 21: Hoare triple {4940#true} assume !(0 == ~cond); {4940#true} is VALID [2022-04-15 07:37:47,488 INFO L290 TraceCheckUtils]: 20: Hoare triple {4940#true} ~cond := #in~cond; {4940#true} is VALID [2022-04-15 07:37:47,488 INFO L272 TraceCheckUtils]: 19: Hoare triple {5161#(or (<= (+ main_~x~0 2) main_~X~0) (< (+ main_~v~0 (* main_~Y~0 2)) 0) (not (< main_~v~0 0)))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {4940#true} is VALID [2022-04-15 07:37:47,488 INFO L290 TraceCheckUtils]: 18: Hoare triple {5161#(or (<= (+ main_~x~0 2) main_~X~0) (< (+ main_~v~0 (* main_~Y~0 2)) 0) (not (< main_~v~0 0)))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {5161#(or (<= (+ main_~x~0 2) main_~X~0) (< (+ main_~v~0 (* main_~Y~0 2)) 0) (not (< main_~v~0 0)))} is VALID [2022-04-15 07:37:47,489 INFO L290 TraceCheckUtils]: 17: Hoare triple {4940#true} ~v~0 := 2 * ~Y~0 - ~X~0;~y~0 := 0;~x~0 := 0; {5161#(or (<= (+ main_~x~0 2) main_~X~0) (< (+ main_~v~0 (* main_~Y~0 2)) 0) (not (< main_~v~0 0)))} is VALID [2022-04-15 07:37:47,489 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {4940#true} {4940#true} #63#return; {4940#true} is VALID [2022-04-15 07:37:47,489 INFO L290 TraceCheckUtils]: 15: Hoare triple {4940#true} assume true; {4940#true} is VALID [2022-04-15 07:37:47,489 INFO L290 TraceCheckUtils]: 14: Hoare triple {4940#true} assume !(0 == ~cond); {4940#true} is VALID [2022-04-15 07:37:47,489 INFO L290 TraceCheckUtils]: 13: Hoare triple {4940#true} ~cond := #in~cond; {4940#true} is VALID [2022-04-15 07:37:47,489 INFO L272 TraceCheckUtils]: 12: Hoare triple {4940#true} call assume_abort_if_not((if ~Y~0 >= 0 && ~Y~0 <= 10 then 1 else 0)); {4940#true} is VALID [2022-04-15 07:37:47,489 INFO L290 TraceCheckUtils]: 11: Hoare triple {4940#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~Y~0 := #t~nondet5;havoc #t~nondet5; {4940#true} is VALID [2022-04-15 07:37:47,489 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4940#true} {4940#true} #61#return; {4940#true} is VALID [2022-04-15 07:37:47,489 INFO L290 TraceCheckUtils]: 9: Hoare triple {4940#true} assume true; {4940#true} is VALID [2022-04-15 07:37:47,490 INFO L290 TraceCheckUtils]: 8: Hoare triple {4940#true} assume !(0 == ~cond); {4940#true} is VALID [2022-04-15 07:37:47,490 INFO L290 TraceCheckUtils]: 7: Hoare triple {4940#true} ~cond := #in~cond; {4940#true} is VALID [2022-04-15 07:37:47,490 INFO L272 TraceCheckUtils]: 6: Hoare triple {4940#true} call assume_abort_if_not((if ~X~0 >= 0 && ~X~0 <= 10 then 1 else 0)); {4940#true} is VALID [2022-04-15 07:37:47,490 INFO L290 TraceCheckUtils]: 5: Hoare triple {4940#true} havoc ~X~0;havoc ~Y~0;havoc ~x~0;havoc ~y~0;havoc ~v~0;havoc ~xy~0;havoc ~yx~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~X~0 := #t~nondet4;havoc #t~nondet4; {4940#true} is VALID [2022-04-15 07:37:47,490 INFO L272 TraceCheckUtils]: 4: Hoare triple {4940#true} call #t~ret8 := main(); {4940#true} is VALID [2022-04-15 07:37:47,490 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4940#true} {4940#true} #69#return; {4940#true} is VALID [2022-04-15 07:37:47,490 INFO L290 TraceCheckUtils]: 2: Hoare triple {4940#true} assume true; {4940#true} is VALID [2022-04-15 07:37:47,490 INFO L290 TraceCheckUtils]: 1: Hoare triple {4940#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(15, 2);call #Ultimate.allocInit(12, 3); {4940#true} is VALID [2022-04-15 07:37:47,490 INFO L272 TraceCheckUtils]: 0: Hoare triple {4940#true} call ULTIMATE.init(); {4940#true} is VALID [2022-04-15 07:37:47,490 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 6 proven. 11 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-04-15 07:37:47,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:37:47,491 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1524939451] [2022-04-15 07:37:47,491 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 07:37:47,491 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [283761894] [2022-04-15 07:37:47,491 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [283761894] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 07:37:47,491 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 07:37:47,491 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2022-04-15 07:37:47,491 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:37:47,491 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [899410996] [2022-04-15 07:37:47,491 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [899410996] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:37:47,491 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:37:47,491 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-15 07:37:47,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1318390544] [2022-04-15 07:37:47,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:37:47,492 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 5 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) Word has length 48 [2022-04-15 07:37:47,492 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:37:47,492 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 5 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-15 07:37:47,519 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:37:47,519 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-15 07:37:47,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:37:47,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-15 07:37:47,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2022-04-15 07:37:47,519 INFO L87 Difference]: Start difference. First operand 73 states and 80 transitions. Second operand has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 5 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-15 07:37:47,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:37:47,884 INFO L93 Difference]: Finished difference Result 87 states and 96 transitions. [2022-04-15 07:37:47,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-15 07:37:47,884 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 5 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) Word has length 48 [2022-04-15 07:37:47,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:37:47,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 5 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-15 07:37:47,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 59 transitions. [2022-04-15 07:37:47,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 5 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-15 07:37:47,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 59 transitions. [2022-04-15 07:37:47,886 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 59 transitions. [2022-04-15 07:37:47,929 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:37:47,931 INFO L225 Difference]: With dead ends: 87 [2022-04-15 07:37:47,931 INFO L226 Difference]: Without dead ends: 79 [2022-04-15 07:37:47,931 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2022-04-15 07:37:47,932 INFO L913 BasicCegarLoop]: 31 mSDtfsCounter, 3 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 07:37:47,932 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [3 Valid, 102 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 07:37:47,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2022-04-15 07:37:48,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 76. [2022-04-15 07:37:48,060 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:37:48,060 INFO L82 GeneralOperation]: Start isEquivalent. First operand 79 states. Second operand has 76 states, 54 states have (on average 1.1111111111111112) internal successors, (60), 57 states have internal predecessors, (60), 13 states have call successors, (13), 9 states have call predecessors, (13), 8 states have return successors, (11), 9 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-15 07:37:48,060 INFO L74 IsIncluded]: Start isIncluded. First operand 79 states. Second operand has 76 states, 54 states have (on average 1.1111111111111112) internal successors, (60), 57 states have internal predecessors, (60), 13 states have call successors, (13), 9 states have call predecessors, (13), 8 states have return successors, (11), 9 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-15 07:37:48,060 INFO L87 Difference]: Start difference. First operand 79 states. Second operand has 76 states, 54 states have (on average 1.1111111111111112) internal successors, (60), 57 states have internal predecessors, (60), 13 states have call successors, (13), 9 states have call predecessors, (13), 8 states have return successors, (11), 9 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-15 07:37:48,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:37:48,063 INFO L93 Difference]: Finished difference Result 79 states and 88 transitions. [2022-04-15 07:37:48,063 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 88 transitions. [2022-04-15 07:37:48,063 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:37:48,063 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:37:48,063 INFO L74 IsIncluded]: Start isIncluded. First operand has 76 states, 54 states have (on average 1.1111111111111112) internal successors, (60), 57 states have internal predecessors, (60), 13 states have call successors, (13), 9 states have call predecessors, (13), 8 states have return successors, (11), 9 states have call predecessors, (11), 11 states have call successors, (11) Second operand 79 states. [2022-04-15 07:37:48,063 INFO L87 Difference]: Start difference. First operand has 76 states, 54 states have (on average 1.1111111111111112) internal successors, (60), 57 states have internal predecessors, (60), 13 states have call successors, (13), 9 states have call predecessors, (13), 8 states have return successors, (11), 9 states have call predecessors, (11), 11 states have call successors, (11) Second operand 79 states. [2022-04-15 07:37:48,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:37:48,064 INFO L93 Difference]: Finished difference Result 79 states and 88 transitions. [2022-04-15 07:37:48,065 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 88 transitions. [2022-04-15 07:37:48,065 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:37:48,065 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:37:48,065 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:37:48,065 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:37:48,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 54 states have (on average 1.1111111111111112) internal successors, (60), 57 states have internal predecessors, (60), 13 states have call successors, (13), 9 states have call predecessors, (13), 8 states have return successors, (11), 9 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-15 07:37:48,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 84 transitions. [2022-04-15 07:37:48,066 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 84 transitions. Word has length 48 [2022-04-15 07:37:48,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:37:48,066 INFO L478 AbstractCegarLoop]: Abstraction has 76 states and 84 transitions. [2022-04-15 07:37:48,067 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 5 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-15 07:37:48,067 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 76 states and 84 transitions. [2022-04-15 07:37:48,200 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-15 07:37:48,200 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 84 transitions. [2022-04-15 07:37:48,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-04-15 07:37:48,201 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:37:48,201 INFO L499 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 07:37:48,217 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-04-15 07:37:48,401 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-04-15 07:37:48,402 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:37:48,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:37:48,402 INFO L85 PathProgramCache]: Analyzing trace with hash -1154259258, now seen corresponding path program 3 times [2022-04-15 07:37:48,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:37:48,402 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [430349190] [2022-04-15 07:37:48,402 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 07:37:48,402 INFO L85 PathProgramCache]: Analyzing trace with hash -1154259258, now seen corresponding path program 4 times [2022-04-15 07:37:48,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:37:48,403 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1748138383] [2022-04-15 07:37:48,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:37:48,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:37:48,421 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 07:37:48,422 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1888691043] [2022-04-15 07:37:48,422 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 07:37:48,422 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 07:37:48,422 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 07:37:48,423 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 07:37:48,426 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-04-15 07:37:48,461 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 07:37:48,461 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 07:37:48,462 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 41 conjunts are in the unsatisfiable core [2022-04-15 07:37:48,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:37:48,471 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 07:37:49,117 INFO L272 TraceCheckUtils]: 0: Hoare triple {5723#true} call ULTIMATE.init(); {5723#true} is VALID [2022-04-15 07:37:49,117 INFO L290 TraceCheckUtils]: 1: Hoare triple {5723#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(15, 2);call #Ultimate.allocInit(12, 3); {5723#true} is VALID [2022-04-15 07:37:49,117 INFO L290 TraceCheckUtils]: 2: Hoare triple {5723#true} assume true; {5723#true} is VALID [2022-04-15 07:37:49,118 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5723#true} {5723#true} #69#return; {5723#true} is VALID [2022-04-15 07:37:49,118 INFO L272 TraceCheckUtils]: 4: Hoare triple {5723#true} call #t~ret8 := main(); {5723#true} is VALID [2022-04-15 07:37:49,118 INFO L290 TraceCheckUtils]: 5: Hoare triple {5723#true} havoc ~X~0;havoc ~Y~0;havoc ~x~0;havoc ~y~0;havoc ~v~0;havoc ~xy~0;havoc ~yx~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~X~0 := #t~nondet4;havoc #t~nondet4; {5723#true} is VALID [2022-04-15 07:37:49,118 INFO L272 TraceCheckUtils]: 6: Hoare triple {5723#true} call assume_abort_if_not((if ~X~0 >= 0 && ~X~0 <= 10 then 1 else 0)); {5723#true} is VALID [2022-04-15 07:37:49,118 INFO L290 TraceCheckUtils]: 7: Hoare triple {5723#true} ~cond := #in~cond; {5723#true} is VALID [2022-04-15 07:37:49,118 INFO L290 TraceCheckUtils]: 8: Hoare triple {5723#true} assume !(0 == ~cond); {5723#true} is VALID [2022-04-15 07:37:49,118 INFO L290 TraceCheckUtils]: 9: Hoare triple {5723#true} assume true; {5723#true} is VALID [2022-04-15 07:37:49,118 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {5723#true} {5723#true} #61#return; {5723#true} is VALID [2022-04-15 07:37:49,118 INFO L290 TraceCheckUtils]: 11: Hoare triple {5723#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~Y~0 := #t~nondet5;havoc #t~nondet5; {5723#true} is VALID [2022-04-15 07:37:49,118 INFO L272 TraceCheckUtils]: 12: Hoare triple {5723#true} call assume_abort_if_not((if ~Y~0 >= 0 && ~Y~0 <= 10 then 1 else 0)); {5723#true} is VALID [2022-04-15 07:37:49,118 INFO L290 TraceCheckUtils]: 13: Hoare triple {5723#true} ~cond := #in~cond; {5723#true} is VALID [2022-04-15 07:37:49,118 INFO L290 TraceCheckUtils]: 14: Hoare triple {5723#true} assume !(0 == ~cond); {5723#true} is VALID [2022-04-15 07:37:49,118 INFO L290 TraceCheckUtils]: 15: Hoare triple {5723#true} assume true; {5723#true} is VALID [2022-04-15 07:37:49,119 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {5723#true} {5723#true} #63#return; {5723#true} is VALID [2022-04-15 07:37:49,119 INFO L290 TraceCheckUtils]: 17: Hoare triple {5723#true} ~v~0 := 2 * ~Y~0 - ~X~0;~y~0 := 0;~x~0 := 0; {5779#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (= main_~y~0 0))} is VALID [2022-04-15 07:37:49,119 INFO L290 TraceCheckUtils]: 18: Hoare triple {5779#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (= main_~y~0 0))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {5779#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (= main_~y~0 0))} is VALID [2022-04-15 07:37:49,119 INFO L272 TraceCheckUtils]: 19: Hoare triple {5779#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {5723#true} is VALID [2022-04-15 07:37:49,119 INFO L290 TraceCheckUtils]: 20: Hoare triple {5723#true} ~cond := #in~cond; {5723#true} is VALID [2022-04-15 07:37:49,120 INFO L290 TraceCheckUtils]: 21: Hoare triple {5723#true} assume !(0 == ~cond); {5723#true} is VALID [2022-04-15 07:37:49,120 INFO L290 TraceCheckUtils]: 22: Hoare triple {5723#true} assume true; {5723#true} is VALID [2022-04-15 07:37:49,124 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {5723#true} {5779#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (= main_~y~0 0))} #65#return; {5779#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (= main_~y~0 0))} is VALID [2022-04-15 07:37:49,125 INFO L290 TraceCheckUtils]: 24: Hoare triple {5779#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (= main_~y~0 0))} assume !!(~x~0 <= ~X~0); {5779#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (= main_~y~0 0))} is VALID [2022-04-15 07:37:49,126 INFO L290 TraceCheckUtils]: 25: Hoare triple {5779#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (= main_~y~0 0))} assume !(~v~0 < 0);~v~0 := ~v~0 + 2 * (~Y~0 - ~X~0);#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {5804#(and (= main_~x~0 0) (= main_~y~0 1) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) (+ main_~v~0 (* main_~X~0 2) (* (- 2) main_~Y~0))))} is VALID [2022-04-15 07:37:49,126 INFO L290 TraceCheckUtils]: 26: Hoare triple {5804#(and (= main_~x~0 0) (= main_~y~0 1) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) (+ main_~v~0 (* main_~X~0 2) (* (- 2) main_~Y~0))))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {5808#(and (= main_~y~0 1) (= main_~x~0 1) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) (+ main_~v~0 (* main_~X~0 2) (* (- 2) main_~Y~0))))} is VALID [2022-04-15 07:37:49,126 INFO L290 TraceCheckUtils]: 27: Hoare triple {5808#(and (= main_~y~0 1) (= main_~x~0 1) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) (+ main_~v~0 (* main_~X~0 2) (* (- 2) main_~Y~0))))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {5808#(and (= main_~y~0 1) (= main_~x~0 1) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) (+ main_~v~0 (* main_~X~0 2) (* (- 2) main_~Y~0))))} is VALID [2022-04-15 07:37:49,127 INFO L272 TraceCheckUtils]: 28: Hoare triple {5808#(and (= main_~y~0 1) (= main_~x~0 1) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) (+ main_~v~0 (* main_~X~0 2) (* (- 2) main_~Y~0))))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {5723#true} is VALID [2022-04-15 07:37:49,127 INFO L290 TraceCheckUtils]: 29: Hoare triple {5723#true} ~cond := #in~cond; {5818#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-15 07:37:49,127 INFO L290 TraceCheckUtils]: 30: Hoare triple {5818#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {5822#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:37:49,128 INFO L290 TraceCheckUtils]: 31: Hoare triple {5822#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {5822#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:37:49,128 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {5822#(not (= |__VERIFIER_assert_#in~cond| 0))} {5808#(and (= main_~y~0 1) (= main_~x~0 1) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) (+ main_~v~0 (* main_~X~0 2) (* (- 2) main_~Y~0))))} #65#return; {5808#(and (= main_~y~0 1) (= main_~x~0 1) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) (+ main_~v~0 (* main_~X~0 2) (* (- 2) main_~Y~0))))} is VALID [2022-04-15 07:37:49,129 INFO L290 TraceCheckUtils]: 33: Hoare triple {5808#(and (= main_~y~0 1) (= main_~x~0 1) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) (+ main_~v~0 (* main_~X~0 2) (* (- 2) main_~Y~0))))} assume !!(~x~0 <= ~X~0); {5832#(and (<= main_~x~0 main_~X~0) (= main_~y~0 1) (= main_~x~0 1) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) (+ main_~v~0 (* main_~X~0 2) (* (- 2) main_~Y~0))))} is VALID [2022-04-15 07:37:49,129 INFO L290 TraceCheckUtils]: 34: Hoare triple {5832#(and (<= main_~x~0 main_~X~0) (= main_~y~0 1) (= main_~x~0 1) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) (+ main_~v~0 (* main_~X~0 2) (* (- 2) main_~Y~0))))} assume !(~v~0 < 0);~v~0 := ~v~0 + 2 * (~Y~0 - ~X~0);#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {5836#(and (= main_~y~0 2) (= main_~v~0 (+ (* main_~Y~0 6) (* main_~X~0 (- 5)))) (<= main_~x~0 main_~X~0) (= main_~x~0 1))} is VALID [2022-04-15 07:37:49,130 INFO L290 TraceCheckUtils]: 35: Hoare triple {5836#(and (= main_~y~0 2) (= main_~v~0 (+ (* main_~Y~0 6) (* main_~X~0 (- 5)))) (<= main_~x~0 main_~X~0) (= main_~x~0 1))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {5840#(and (= (+ (- 1) main_~x~0) 1) (= main_~y~0 2) (= main_~v~0 (+ (* main_~Y~0 6) (* main_~X~0 (- 5)))) (<= main_~x~0 (+ main_~X~0 1)))} is VALID [2022-04-15 07:37:49,130 INFO L290 TraceCheckUtils]: 36: Hoare triple {5840#(and (= (+ (- 1) main_~x~0) 1) (= main_~y~0 2) (= main_~v~0 (+ (* main_~Y~0 6) (* main_~X~0 (- 5)))) (<= main_~x~0 (+ main_~X~0 1)))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {5844#(and (= (+ (- 1) main_~x~0) 1) (= main_~y~0 2) (= main_~v~0 (+ (* main_~Y~0 6) (* main_~X~0 (- 5)))) (= (* main_~X~0 main_~y~0) main_~xy~0) (= main_~yx~0 (* main_~Y~0 main_~x~0)) (<= main_~x~0 (+ main_~X~0 1)))} is VALID [2022-04-15 07:37:49,131 INFO L272 TraceCheckUtils]: 37: Hoare triple {5844#(and (= (+ (- 1) main_~x~0) 1) (= main_~y~0 2) (= main_~v~0 (+ (* main_~Y~0 6) (* main_~X~0 (- 5)))) (= (* main_~X~0 main_~y~0) main_~xy~0) (= main_~yx~0 (* main_~Y~0 main_~x~0)) (<= main_~x~0 (+ main_~X~0 1)))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {5723#true} is VALID [2022-04-15 07:37:49,131 INFO L290 TraceCheckUtils]: 38: Hoare triple {5723#true} ~cond := #in~cond; {5818#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-15 07:37:49,131 INFO L290 TraceCheckUtils]: 39: Hoare triple {5818#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {5822#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:37:49,131 INFO L290 TraceCheckUtils]: 40: Hoare triple {5822#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {5822#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:37:49,132 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {5822#(not (= |__VERIFIER_assert_#in~cond| 0))} {5844#(and (= (+ (- 1) main_~x~0) 1) (= main_~y~0 2) (= main_~v~0 (+ (* main_~Y~0 6) (* main_~X~0 (- 5)))) (= (* main_~X~0 main_~y~0) main_~xy~0) (= main_~yx~0 (* main_~Y~0 main_~x~0)) (<= main_~x~0 (+ main_~X~0 1)))} #65#return; {5840#(and (= (+ (- 1) main_~x~0) 1) (= main_~y~0 2) (= main_~v~0 (+ (* main_~Y~0 6) (* main_~X~0 (- 5)))) (<= main_~x~0 (+ main_~X~0 1)))} is VALID [2022-04-15 07:37:49,133 INFO L290 TraceCheckUtils]: 42: Hoare triple {5840#(and (= (+ (- 1) main_~x~0) 1) (= main_~y~0 2) (= main_~v~0 (+ (* main_~Y~0 6) (* main_~X~0 (- 5)))) (<= main_~x~0 (+ main_~X~0 1)))} assume !(~x~0 <= ~X~0); {5863#(and (= (+ (- 1) main_~x~0) 1) (= main_~y~0 2) (= main_~v~0 (+ (* main_~Y~0 6) (* main_~X~0 (- 5)))) (not (<= main_~x~0 main_~X~0)) (<= main_~x~0 (+ main_~X~0 1)))} is VALID [2022-04-15 07:37:49,133 INFO L290 TraceCheckUtils]: 43: Hoare triple {5863#(and (= (+ (- 1) main_~x~0) 1) (= main_~y~0 2) (= main_~v~0 (+ (* main_~Y~0 6) (* main_~X~0 (- 5)))) (not (<= main_~x~0 main_~X~0)) (<= main_~x~0 (+ main_~X~0 1)))} ~xy~0 := ~x~0 * ~y~0;~yx~0 := ~Y~0 * ~x~0; {5867#(and (= main_~y~0 2) (= main_~v~0 (+ (* main_~Y~0 6) (* main_~X~0 (- 5)))) (= (* main_~y~0 2) main_~xy~0) (= (* main_~Y~0 2) main_~yx~0) (<= 1 main_~X~0) (not (<= 2 main_~X~0)))} is VALID [2022-04-15 07:37:49,134 INFO L272 TraceCheckUtils]: 44: Hoare triple {5867#(and (= main_~y~0 2) (= main_~v~0 (+ (* main_~Y~0 6) (* main_~X~0 (- 5)))) (= (* main_~y~0 2) main_~xy~0) (= (* main_~Y~0 2) main_~yx~0) (<= 1 main_~X~0) (not (<= 2 main_~X~0)))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 + 2 * ~y~0 then 1 else 0)); {5871#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 07:37:49,135 INFO L290 TraceCheckUtils]: 45: Hoare triple {5871#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {5875#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 07:37:49,135 INFO L290 TraceCheckUtils]: 46: Hoare triple {5875#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {5724#false} is VALID [2022-04-15 07:37:49,135 INFO L290 TraceCheckUtils]: 47: Hoare triple {5724#false} assume !false; {5724#false} is VALID [2022-04-15 07:37:49,135 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 10 proven. 13 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-15 07:37:49,135 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 07:37:49,731 INFO L290 TraceCheckUtils]: 47: Hoare triple {5724#false} assume !false; {5724#false} is VALID [2022-04-15 07:37:49,732 INFO L290 TraceCheckUtils]: 46: Hoare triple {5875#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {5724#false} is VALID [2022-04-15 07:37:49,732 INFO L290 TraceCheckUtils]: 45: Hoare triple {5871#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {5875#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 07:37:49,733 INFO L272 TraceCheckUtils]: 44: Hoare triple {5891#(= (+ (* main_~y~0 2) (* main_~Y~0 2) (* 2 main_~yx~0)) (+ (* 2 main_~xy~0) main_~X~0 main_~v~0))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 + 2 * ~y~0 then 1 else 0)); {5871#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 07:37:49,733 INFO L290 TraceCheckUtils]: 43: Hoare triple {5895#(= (+ (* 2 (* main_~y~0 main_~x~0)) main_~X~0 main_~v~0) (+ (* main_~y~0 2) (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))))} ~xy~0 := ~x~0 * ~y~0;~yx~0 := ~Y~0 * ~x~0; {5891#(= (+ (* main_~y~0 2) (* main_~Y~0 2) (* 2 main_~yx~0)) (+ (* 2 main_~xy~0) main_~X~0 main_~v~0))} is VALID [2022-04-15 07:37:49,734 INFO L290 TraceCheckUtils]: 42: Hoare triple {5899#(or (<= main_~x~0 main_~X~0) (= (+ (* 2 (* main_~y~0 main_~x~0)) main_~X~0 main_~v~0) (+ (* main_~y~0 2) (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0)))))} assume !(~x~0 <= ~X~0); {5895#(= (+ (* 2 (* main_~y~0 main_~x~0)) main_~X~0 main_~v~0) (+ (* main_~y~0 2) (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))))} is VALID [2022-04-15 07:37:49,735 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {5822#(not (= |__VERIFIER_assert_#in~cond| 0))} {5903#(or (<= main_~x~0 main_~X~0) (not (= (+ (* 2 main_~xy~0) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 main_~yx~0)))) (= (+ (* 2 (* main_~y~0 main_~x~0)) main_~X~0 main_~v~0) (+ (* main_~y~0 2) (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0)))))} #65#return; {5899#(or (<= main_~x~0 main_~X~0) (= (+ (* 2 (* main_~y~0 main_~x~0)) main_~X~0 main_~v~0) (+ (* main_~y~0 2) (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0)))))} is VALID [2022-04-15 07:37:49,735 INFO L290 TraceCheckUtils]: 40: Hoare triple {5822#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {5822#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:37:49,735 INFO L290 TraceCheckUtils]: 39: Hoare triple {5913#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {5822#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:37:49,736 INFO L290 TraceCheckUtils]: 38: Hoare triple {5723#true} ~cond := #in~cond; {5913#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 07:37:49,736 INFO L272 TraceCheckUtils]: 37: Hoare triple {5903#(or (<= main_~x~0 main_~X~0) (not (= (+ (* 2 main_~xy~0) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 main_~yx~0)))) (= (+ (* 2 (* main_~y~0 main_~x~0)) main_~X~0 main_~v~0) (+ (* main_~y~0 2) (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0)))))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {5723#true} is VALID [2022-04-15 07:37:49,736 INFO L290 TraceCheckUtils]: 36: Hoare triple {5920#(or (<= main_~x~0 main_~X~0) (not (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))) (= (+ (* 2 (* main_~y~0 main_~x~0)) main_~X~0 main_~v~0) (+ (* main_~y~0 2) (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0)))))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {5903#(or (<= main_~x~0 main_~X~0) (not (= (+ (* 2 main_~xy~0) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 main_~yx~0)))) (= (+ (* 2 (* main_~y~0 main_~x~0)) main_~X~0 main_~v~0) (+ (* main_~y~0 2) (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0)))))} is VALID [2022-04-15 07:37:49,755 INFO L290 TraceCheckUtils]: 35: Hoare triple {5924#(or (not (= (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0))))) (= (+ (* (* (+ main_~x~0 1) main_~y~0) 2) main_~X~0 main_~v~0) (+ (* main_~y~0 2) (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0)))) (<= (+ main_~x~0 1) main_~X~0))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {5920#(or (<= main_~x~0 main_~X~0) (not (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))) (= (+ (* 2 (* main_~y~0 main_~x~0)) main_~X~0 main_~v~0) (+ (* main_~y~0 2) (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0)))))} is VALID [2022-04-15 07:37:49,760 INFO L290 TraceCheckUtils]: 34: Hoare triple {5928#(or (<= (+ main_~x~0 1) main_~X~0) (not (= (+ main_~v~0 (* (- 1) main_~X~0) (* main_~Y~0 2) (* (* main_~X~0 (+ main_~y~0 1)) 2)) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0))))) (= (+ main_~v~0 (* (- 1) main_~X~0) (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) (+ main_~y~0 1)))) (+ 2 (* main_~y~0 2) (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0)))))} assume !(~v~0 < 0);~v~0 := ~v~0 + 2 * (~Y~0 - ~X~0);#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {5924#(or (not (= (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0))))) (= (+ (* (* (+ main_~x~0 1) main_~y~0) 2) main_~X~0 main_~v~0) (+ (* main_~y~0 2) (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0)))) (<= (+ main_~x~0 1) main_~X~0))} is VALID [2022-04-15 07:37:49,762 INFO L290 TraceCheckUtils]: 33: Hoare triple {5723#true} assume !!(~x~0 <= ~X~0); {5928#(or (<= (+ main_~x~0 1) main_~X~0) (not (= (+ main_~v~0 (* (- 1) main_~X~0) (* main_~Y~0 2) (* (* main_~X~0 (+ main_~y~0 1)) 2)) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0))))) (= (+ main_~v~0 (* (- 1) main_~X~0) (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) (+ main_~y~0 1)))) (+ 2 (* main_~y~0 2) (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0)))))} is VALID [2022-04-15 07:37:49,762 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {5723#true} {5723#true} #65#return; {5723#true} is VALID [2022-04-15 07:37:49,762 INFO L290 TraceCheckUtils]: 31: Hoare triple {5723#true} assume true; {5723#true} is VALID [2022-04-15 07:37:49,762 INFO L290 TraceCheckUtils]: 30: Hoare triple {5723#true} assume !(0 == ~cond); {5723#true} is VALID [2022-04-15 07:37:49,762 INFO L290 TraceCheckUtils]: 29: Hoare triple {5723#true} ~cond := #in~cond; {5723#true} is VALID [2022-04-15 07:37:49,762 INFO L272 TraceCheckUtils]: 28: Hoare triple {5723#true} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {5723#true} is VALID [2022-04-15 07:37:49,762 INFO L290 TraceCheckUtils]: 27: Hoare triple {5723#true} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {5723#true} is VALID [2022-04-15 07:37:49,763 INFO L290 TraceCheckUtils]: 26: Hoare triple {5723#true} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {5723#true} is VALID [2022-04-15 07:37:49,763 INFO L290 TraceCheckUtils]: 25: Hoare triple {5723#true} assume !(~v~0 < 0);~v~0 := ~v~0 + 2 * (~Y~0 - ~X~0);#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {5723#true} is VALID [2022-04-15 07:37:49,763 INFO L290 TraceCheckUtils]: 24: Hoare triple {5723#true} assume !!(~x~0 <= ~X~0); {5723#true} is VALID [2022-04-15 07:37:49,763 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {5723#true} {5723#true} #65#return; {5723#true} is VALID [2022-04-15 07:37:49,763 INFO L290 TraceCheckUtils]: 22: Hoare triple {5723#true} assume true; {5723#true} is VALID [2022-04-15 07:37:49,763 INFO L290 TraceCheckUtils]: 21: Hoare triple {5723#true} assume !(0 == ~cond); {5723#true} is VALID [2022-04-15 07:37:49,763 INFO L290 TraceCheckUtils]: 20: Hoare triple {5723#true} ~cond := #in~cond; {5723#true} is VALID [2022-04-15 07:37:49,763 INFO L272 TraceCheckUtils]: 19: Hoare triple {5723#true} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {5723#true} is VALID [2022-04-15 07:37:49,763 INFO L290 TraceCheckUtils]: 18: Hoare triple {5723#true} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {5723#true} is VALID [2022-04-15 07:37:49,763 INFO L290 TraceCheckUtils]: 17: Hoare triple {5723#true} ~v~0 := 2 * ~Y~0 - ~X~0;~y~0 := 0;~x~0 := 0; {5723#true} is VALID [2022-04-15 07:37:49,763 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {5723#true} {5723#true} #63#return; {5723#true} is VALID [2022-04-15 07:37:49,763 INFO L290 TraceCheckUtils]: 15: Hoare triple {5723#true} assume true; {5723#true} is VALID [2022-04-15 07:37:49,763 INFO L290 TraceCheckUtils]: 14: Hoare triple {5723#true} assume !(0 == ~cond); {5723#true} is VALID [2022-04-15 07:37:49,763 INFO L290 TraceCheckUtils]: 13: Hoare triple {5723#true} ~cond := #in~cond; {5723#true} is VALID [2022-04-15 07:37:49,764 INFO L272 TraceCheckUtils]: 12: Hoare triple {5723#true} call assume_abort_if_not((if ~Y~0 >= 0 && ~Y~0 <= 10 then 1 else 0)); {5723#true} is VALID [2022-04-15 07:37:49,764 INFO L290 TraceCheckUtils]: 11: Hoare triple {5723#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~Y~0 := #t~nondet5;havoc #t~nondet5; {5723#true} is VALID [2022-04-15 07:37:49,764 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {5723#true} {5723#true} #61#return; {5723#true} is VALID [2022-04-15 07:37:49,764 INFO L290 TraceCheckUtils]: 9: Hoare triple {5723#true} assume true; {5723#true} is VALID [2022-04-15 07:37:49,764 INFO L290 TraceCheckUtils]: 8: Hoare triple {5723#true} assume !(0 == ~cond); {5723#true} is VALID [2022-04-15 07:37:49,764 INFO L290 TraceCheckUtils]: 7: Hoare triple {5723#true} ~cond := #in~cond; {5723#true} is VALID [2022-04-15 07:37:49,764 INFO L272 TraceCheckUtils]: 6: Hoare triple {5723#true} call assume_abort_if_not((if ~X~0 >= 0 && ~X~0 <= 10 then 1 else 0)); {5723#true} is VALID [2022-04-15 07:37:49,764 INFO L290 TraceCheckUtils]: 5: Hoare triple {5723#true} havoc ~X~0;havoc ~Y~0;havoc ~x~0;havoc ~y~0;havoc ~v~0;havoc ~xy~0;havoc ~yx~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~X~0 := #t~nondet4;havoc #t~nondet4; {5723#true} is VALID [2022-04-15 07:37:49,764 INFO L272 TraceCheckUtils]: 4: Hoare triple {5723#true} call #t~ret8 := main(); {5723#true} is VALID [2022-04-15 07:37:49,764 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5723#true} {5723#true} #69#return; {5723#true} is VALID [2022-04-15 07:37:49,764 INFO L290 TraceCheckUtils]: 2: Hoare triple {5723#true} assume true; {5723#true} is VALID [2022-04-15 07:37:49,764 INFO L290 TraceCheckUtils]: 1: Hoare triple {5723#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(15, 2);call #Ultimate.allocInit(12, 3); {5723#true} is VALID [2022-04-15 07:37:49,764 INFO L272 TraceCheckUtils]: 0: Hoare triple {5723#true} call ULTIMATE.init(); {5723#true} is VALID [2022-04-15 07:37:49,765 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 19 proven. 1 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-04-15 07:37:49,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:37:49,765 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1748138383] [2022-04-15 07:37:49,765 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 07:37:49,765 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1888691043] [2022-04-15 07:37:49,765 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1888691043] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 07:37:49,765 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 07:37:49,765 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13] total 23 [2022-04-15 07:37:49,765 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:37:49,765 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [430349190] [2022-04-15 07:37:49,766 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [430349190] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:37:49,766 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:37:49,766 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-04-15 07:37:49,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1272431807] [2022-04-15 07:37:49,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:37:49,766 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 2.1538461538461537) internal successors, (28), 14 states have internal predecessors, (28), 5 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) Word has length 48 [2022-04-15 07:37:49,766 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:37:49,766 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 15 states, 13 states have (on average 2.1538461538461537) internal successors, (28), 14 states have internal predecessors, (28), 5 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-15 07:37:49,797 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:37:49,797 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-15 07:37:49,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:37:49,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-15 07:37:49,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=424, Unknown=0, NotChecked=0, Total=506 [2022-04-15 07:37:49,798 INFO L87 Difference]: Start difference. First operand 76 states and 84 transitions. Second operand has 15 states, 13 states have (on average 2.1538461538461537) internal successors, (28), 14 states have internal predecessors, (28), 5 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-15 07:37:50,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:37:50,991 INFO L93 Difference]: Finished difference Result 90 states and 98 transitions. [2022-04-15 07:37:50,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-15 07:37:50,991 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 2.1538461538461537) internal successors, (28), 14 states have internal predecessors, (28), 5 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) Word has length 48 [2022-04-15 07:37:50,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:37:50,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 13 states have (on average 2.1538461538461537) internal successors, (28), 14 states have internal predecessors, (28), 5 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-15 07:37:50,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 58 transitions. [2022-04-15 07:37:50,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 13 states have (on average 2.1538461538461537) internal successors, (28), 14 states have internal predecessors, (28), 5 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-15 07:37:50,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 58 transitions. [2022-04-15 07:37:50,993 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 58 transitions. [2022-04-15 07:37:51,036 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:37:51,037 INFO L225 Difference]: With dead ends: 90 [2022-04-15 07:37:51,037 INFO L226 Difference]: Without dead ends: 82 [2022-04-15 07:37:51,037 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 71 SyntacticMatches, 3 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=114, Invalid=588, Unknown=0, NotChecked=0, Total=702 [2022-04-15 07:37:51,038 INFO L913 BasicCegarLoop]: 24 mSDtfsCounter, 15 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 357 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 361 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 357 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-04-15 07:37:51,038 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [16 Valid, 192 Invalid, 361 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 357 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-15 07:37:51,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2022-04-15 07:37:51,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 73. [2022-04-15 07:37:51,156 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:37:51,156 INFO L82 GeneralOperation]: Start isEquivalent. First operand 82 states. Second operand has 73 states, 52 states have (on average 1.1153846153846154) internal successors, (58), 54 states have internal predecessors, (58), 12 states have call successors, (12), 9 states have call predecessors, (12), 8 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-15 07:37:51,156 INFO L74 IsIncluded]: Start isIncluded. First operand 82 states. Second operand has 73 states, 52 states have (on average 1.1153846153846154) internal successors, (58), 54 states have internal predecessors, (58), 12 states have call successors, (12), 9 states have call predecessors, (12), 8 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-15 07:37:51,156 INFO L87 Difference]: Start difference. First operand 82 states. Second operand has 73 states, 52 states have (on average 1.1153846153846154) internal successors, (58), 54 states have internal predecessors, (58), 12 states have call successors, (12), 9 states have call predecessors, (12), 8 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-15 07:37:51,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:37:51,158 INFO L93 Difference]: Finished difference Result 82 states and 90 transitions. [2022-04-15 07:37:51,158 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 90 transitions. [2022-04-15 07:37:51,158 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:37:51,158 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:37:51,158 INFO L74 IsIncluded]: Start isIncluded. First operand has 73 states, 52 states have (on average 1.1153846153846154) internal successors, (58), 54 states have internal predecessors, (58), 12 states have call successors, (12), 9 states have call predecessors, (12), 8 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) Second operand 82 states. [2022-04-15 07:37:51,158 INFO L87 Difference]: Start difference. First operand has 73 states, 52 states have (on average 1.1153846153846154) internal successors, (58), 54 states have internal predecessors, (58), 12 states have call successors, (12), 9 states have call predecessors, (12), 8 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) Second operand 82 states. [2022-04-15 07:37:51,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:37:51,160 INFO L93 Difference]: Finished difference Result 82 states and 90 transitions. [2022-04-15 07:37:51,160 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 90 transitions. [2022-04-15 07:37:51,160 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:37:51,160 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:37:51,160 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:37:51,160 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:37:51,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 52 states have (on average 1.1153846153846154) internal successors, (58), 54 states have internal predecessors, (58), 12 states have call successors, (12), 9 states have call predecessors, (12), 8 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-15 07:37:51,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 80 transitions. [2022-04-15 07:37:51,161 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 80 transitions. Word has length 48 [2022-04-15 07:37:51,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:37:51,161 INFO L478 AbstractCegarLoop]: Abstraction has 73 states and 80 transitions. [2022-04-15 07:37:51,161 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 2.1538461538461537) internal successors, (28), 14 states have internal predecessors, (28), 5 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-15 07:37:51,162 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 73 states and 80 transitions. [2022-04-15 07:37:51,297 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 80 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:37:51,298 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 80 transitions. [2022-04-15 07:37:51,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-04-15 07:37:51,298 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:37:51,298 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 07:37:51,316 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-15 07:37:51,498 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-04-15 07:37:51,499 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:37:51,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:37:51,499 INFO L85 PathProgramCache]: Analyzing trace with hash -463038031, now seen corresponding path program 5 times [2022-04-15 07:37:51,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:37:51,499 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [550842381] [2022-04-15 07:37:51,499 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 07:37:51,499 INFO L85 PathProgramCache]: Analyzing trace with hash -463038031, now seen corresponding path program 6 times [2022-04-15 07:37:51,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:37:51,500 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029526190] [2022-04-15 07:37:51,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:37:51,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:37:51,515 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 07:37:51,516 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2090270318] [2022-04-15 07:37:51,516 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 07:37:51,516 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 07:37:51,516 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 07:37:51,517 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 07:37:51,517 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-04-15 07:37:51,556 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-04-15 07:37:51,556 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 07:37:51,557 INFO L263 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 39 conjunts are in the unsatisfiable core [2022-04-15 07:37:51,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:37:51,571 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 07:37:56,608 WARN L914 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-15 07:38:02,185 INFO L272 TraceCheckUtils]: 0: Hoare triple {6531#true} call ULTIMATE.init(); {6531#true} is VALID [2022-04-15 07:38:02,186 INFO L290 TraceCheckUtils]: 1: Hoare triple {6531#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(15, 2);call #Ultimate.allocInit(12, 3); {6531#true} is VALID [2022-04-15 07:38:02,186 INFO L290 TraceCheckUtils]: 2: Hoare triple {6531#true} assume true; {6531#true} is VALID [2022-04-15 07:38:02,186 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6531#true} {6531#true} #69#return; {6531#true} is VALID [2022-04-15 07:38:02,186 INFO L272 TraceCheckUtils]: 4: Hoare triple {6531#true} call #t~ret8 := main(); {6531#true} is VALID [2022-04-15 07:38:02,186 INFO L290 TraceCheckUtils]: 5: Hoare triple {6531#true} havoc ~X~0;havoc ~Y~0;havoc ~x~0;havoc ~y~0;havoc ~v~0;havoc ~xy~0;havoc ~yx~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~X~0 := #t~nondet4;havoc #t~nondet4; {6531#true} is VALID [2022-04-15 07:38:02,186 INFO L272 TraceCheckUtils]: 6: Hoare triple {6531#true} call assume_abort_if_not((if ~X~0 >= 0 && ~X~0 <= 10 then 1 else 0)); {6531#true} is VALID [2022-04-15 07:38:02,186 INFO L290 TraceCheckUtils]: 7: Hoare triple {6531#true} ~cond := #in~cond; {6531#true} is VALID [2022-04-15 07:38:02,186 INFO L290 TraceCheckUtils]: 8: Hoare triple {6531#true} assume !(0 == ~cond); {6531#true} is VALID [2022-04-15 07:38:02,186 INFO L290 TraceCheckUtils]: 9: Hoare triple {6531#true} assume true; {6531#true} is VALID [2022-04-15 07:38:02,186 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {6531#true} {6531#true} #61#return; {6531#true} is VALID [2022-04-15 07:38:02,186 INFO L290 TraceCheckUtils]: 11: Hoare triple {6531#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~Y~0 := #t~nondet5;havoc #t~nondet5; {6531#true} is VALID [2022-04-15 07:38:02,186 INFO L272 TraceCheckUtils]: 12: Hoare triple {6531#true} call assume_abort_if_not((if ~Y~0 >= 0 && ~Y~0 <= 10 then 1 else 0)); {6531#true} is VALID [2022-04-15 07:38:02,187 INFO L290 TraceCheckUtils]: 13: Hoare triple {6531#true} ~cond := #in~cond; {6531#true} is VALID [2022-04-15 07:38:02,187 INFO L290 TraceCheckUtils]: 14: Hoare triple {6531#true} assume !(0 == ~cond); {6531#true} is VALID [2022-04-15 07:38:02,187 INFO L290 TraceCheckUtils]: 15: Hoare triple {6531#true} assume true; {6531#true} is VALID [2022-04-15 07:38:02,187 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {6531#true} {6531#true} #63#return; {6531#true} is VALID [2022-04-15 07:38:02,187 INFO L290 TraceCheckUtils]: 17: Hoare triple {6531#true} ~v~0 := 2 * ~Y~0 - ~X~0;~y~0 := 0;~x~0 := 0; {6587#(and (= (+ main_~X~0 main_~v~0) (* main_~Y~0 2)) (= main_~y~0 0))} is VALID [2022-04-15 07:38:02,188 INFO L290 TraceCheckUtils]: 18: Hoare triple {6587#(and (= (+ main_~X~0 main_~v~0) (* main_~Y~0 2)) (= main_~y~0 0))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {6587#(and (= (+ main_~X~0 main_~v~0) (* main_~Y~0 2)) (= main_~y~0 0))} is VALID [2022-04-15 07:38:02,188 INFO L272 TraceCheckUtils]: 19: Hoare triple {6587#(and (= (+ main_~X~0 main_~v~0) (* main_~Y~0 2)) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {6531#true} is VALID [2022-04-15 07:38:02,188 INFO L290 TraceCheckUtils]: 20: Hoare triple {6531#true} ~cond := #in~cond; {6531#true} is VALID [2022-04-15 07:38:02,188 INFO L290 TraceCheckUtils]: 21: Hoare triple {6531#true} assume !(0 == ~cond); {6531#true} is VALID [2022-04-15 07:38:02,188 INFO L290 TraceCheckUtils]: 22: Hoare triple {6531#true} assume true; {6531#true} is VALID [2022-04-15 07:38:02,188 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {6531#true} {6587#(and (= (+ main_~X~0 main_~v~0) (* main_~Y~0 2)) (= main_~y~0 0))} #65#return; {6587#(and (= (+ main_~X~0 main_~v~0) (* main_~Y~0 2)) (= main_~y~0 0))} is VALID [2022-04-15 07:38:02,189 INFO L290 TraceCheckUtils]: 24: Hoare triple {6587#(and (= (+ main_~X~0 main_~v~0) (* main_~Y~0 2)) (= main_~y~0 0))} assume !!(~x~0 <= ~X~0); {6587#(and (= (+ main_~X~0 main_~v~0) (* main_~Y~0 2)) (= main_~y~0 0))} is VALID [2022-04-15 07:38:02,189 INFO L290 TraceCheckUtils]: 25: Hoare triple {6587#(and (= (+ main_~X~0 main_~v~0) (* main_~Y~0 2)) (= main_~y~0 0))} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {6612#(and (= main_~y~0 0) (= (+ main_~X~0 main_~v~0 (* (- 2) main_~Y~0)) (* main_~Y~0 2)))} is VALID [2022-04-15 07:38:02,190 INFO L290 TraceCheckUtils]: 26: Hoare triple {6612#(and (= main_~y~0 0) (= (+ main_~X~0 main_~v~0 (* (- 2) main_~Y~0)) (* main_~Y~0 2)))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {6612#(and (= main_~y~0 0) (= (+ main_~X~0 main_~v~0 (* (- 2) main_~Y~0)) (* main_~Y~0 2)))} is VALID [2022-04-15 07:38:02,190 INFO L290 TraceCheckUtils]: 27: Hoare triple {6612#(and (= main_~y~0 0) (= (+ main_~X~0 main_~v~0 (* (- 2) main_~Y~0)) (* main_~Y~0 2)))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {6619#(and (= (* main_~X~0 main_~y~0) main_~xy~0) (= main_~y~0 0) (= (+ main_~X~0 main_~v~0 (* (- 2) main_~Y~0)) (* main_~Y~0 2)))} is VALID [2022-04-15 07:38:02,190 INFO L272 TraceCheckUtils]: 28: Hoare triple {6619#(and (= (* main_~X~0 main_~y~0) main_~xy~0) (= main_~y~0 0) (= (+ main_~X~0 main_~v~0 (* (- 2) main_~Y~0)) (* main_~Y~0 2)))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {6531#true} is VALID [2022-04-15 07:38:02,191 INFO L290 TraceCheckUtils]: 29: Hoare triple {6531#true} ~cond := #in~cond; {6626#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-15 07:38:02,191 INFO L290 TraceCheckUtils]: 30: Hoare triple {6626#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {6630#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:38:02,191 INFO L290 TraceCheckUtils]: 31: Hoare triple {6630#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {6630#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:38:02,192 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {6630#(not (= |__VERIFIER_assert_#in~cond| 0))} {6619#(and (= (* main_~X~0 main_~y~0) main_~xy~0) (= main_~y~0 0) (= (+ main_~X~0 main_~v~0 (* (- 2) main_~Y~0)) (* main_~Y~0 2)))} #65#return; {6612#(and (= main_~y~0 0) (= (+ main_~X~0 main_~v~0 (* (- 2) main_~Y~0)) (* main_~Y~0 2)))} is VALID [2022-04-15 07:38:02,192 INFO L290 TraceCheckUtils]: 33: Hoare triple {6612#(and (= main_~y~0 0) (= (+ main_~X~0 main_~v~0 (* (- 2) main_~Y~0)) (* main_~Y~0 2)))} assume !!(~x~0 <= ~X~0); {6612#(and (= main_~y~0 0) (= (+ main_~X~0 main_~v~0 (* (- 2) main_~Y~0)) (* main_~Y~0 2)))} is VALID [2022-04-15 07:38:02,193 INFO L290 TraceCheckUtils]: 34: Hoare triple {6612#(and (= main_~y~0 0) (= (+ main_~X~0 main_~v~0 (* (- 2) main_~Y~0)) (* main_~Y~0 2)))} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {6643#(and (= (+ (* (- 1) main_~X~0) (* main_~Y~0 6)) main_~v~0) (= main_~y~0 0))} is VALID [2022-04-15 07:38:02,193 INFO L290 TraceCheckUtils]: 35: Hoare triple {6643#(and (= (+ (* (- 1) main_~X~0) (* main_~Y~0 6)) main_~v~0) (= main_~y~0 0))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {6643#(and (= (+ (* (- 1) main_~X~0) (* main_~Y~0 6)) main_~v~0) (= main_~y~0 0))} is VALID [2022-04-15 07:38:02,194 INFO L290 TraceCheckUtils]: 36: Hoare triple {6643#(and (= (+ (* (- 1) main_~X~0) (* main_~Y~0 6)) main_~v~0) (= main_~y~0 0))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {6650#(and (= (+ (* (- 1) main_~X~0) (* main_~Y~0 6)) main_~v~0) (= (* main_~X~0 main_~y~0) main_~xy~0) (= main_~y~0 0) (= main_~yx~0 (* main_~Y~0 main_~x~0)))} is VALID [2022-04-15 07:38:02,194 INFO L272 TraceCheckUtils]: 37: Hoare triple {6650#(and (= (+ (* (- 1) main_~X~0) (* main_~Y~0 6)) main_~v~0) (= (* main_~X~0 main_~y~0) main_~xy~0) (= main_~y~0 0) (= main_~yx~0 (* main_~Y~0 main_~x~0)))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {6531#true} is VALID [2022-04-15 07:38:02,194 INFO L290 TraceCheckUtils]: 38: Hoare triple {6531#true} ~cond := #in~cond; {6626#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-15 07:38:02,194 INFO L290 TraceCheckUtils]: 39: Hoare triple {6626#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {6630#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:38:02,194 INFO L290 TraceCheckUtils]: 40: Hoare triple {6630#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {6630#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:38:02,195 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {6630#(not (= |__VERIFIER_assert_#in~cond| 0))} {6650#(and (= (+ (* (- 1) main_~X~0) (* main_~Y~0 6)) main_~v~0) (= (* main_~X~0 main_~y~0) main_~xy~0) (= main_~y~0 0) (= main_~yx~0 (* main_~Y~0 main_~x~0)))} #65#return; {6666#(and (= (+ (* (- 1) main_~X~0) (* main_~Y~0 6)) main_~v~0) (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (= main_~y~0 0))} is VALID [2022-04-15 07:38:02,196 INFO L290 TraceCheckUtils]: 42: Hoare triple {6666#(and (= (+ (* (- 1) main_~X~0) (* main_~Y~0 6)) main_~v~0) (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (= main_~y~0 0))} assume !!(~x~0 <= ~X~0); {6666#(and (= (+ (* (- 1) main_~X~0) (* main_~Y~0 6)) main_~v~0) (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (= main_~y~0 0))} is VALID [2022-04-15 07:38:02,197 INFO L290 TraceCheckUtils]: 43: Hoare triple {6666#(and (= (+ (* (- 1) main_~X~0) (* main_~Y~0 6)) main_~v~0) (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (= main_~y~0 0))} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {6673#(and (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) (* main_~Y~0 6))) (= main_~y~0 0) (= main_~v~0 (+ (* main_~Y~0 8) (* (- 1) main_~X~0))))} is VALID [2022-04-15 07:38:02,198 INFO L290 TraceCheckUtils]: 44: Hoare triple {6673#(and (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) (* main_~Y~0 6))) (= main_~y~0 0) (= main_~v~0 (+ (* main_~Y~0 8) (* (- 1) main_~X~0))))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {6677#(and (= main_~y~0 0) (= (+ (* main_~Y~0 2) (* 2 (* (+ (- 1) main_~x~0) main_~Y~0))) (+ (* (* main_~X~0 main_~y~0) 2) (* main_~Y~0 6))) (= main_~v~0 (+ (* main_~Y~0 8) (* (- 1) main_~X~0))))} is VALID [2022-04-15 07:38:02,200 INFO L290 TraceCheckUtils]: 45: Hoare triple {6677#(and (= main_~y~0 0) (= (+ (* main_~Y~0 2) (* 2 (* (+ (- 1) main_~x~0) main_~Y~0))) (+ (* (* main_~X~0 main_~y~0) 2) (* main_~Y~0 6))) (= main_~v~0 (+ (* main_~Y~0 8) (* (- 1) main_~X~0))))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {6681#(and (= main_~xy~0 0) (= (* main_~Y~0 (div (* main_~Y~0 3) main_~Y~0)) main_~yx~0) (= main_~v~0 (+ (* main_~Y~0 8) (* (- 1) main_~X~0))))} is VALID [2022-04-15 07:38:02,203 INFO L272 TraceCheckUtils]: 46: Hoare triple {6681#(and (= main_~xy~0 0) (= (* main_~Y~0 (div (* main_~Y~0 3) main_~Y~0)) main_~yx~0) (= main_~v~0 (+ (* main_~Y~0 8) (* (- 1) main_~X~0))))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {6685#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 07:38:02,203 INFO L290 TraceCheckUtils]: 47: Hoare triple {6685#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {6689#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 07:38:02,203 INFO L290 TraceCheckUtils]: 48: Hoare triple {6689#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {6532#false} is VALID [2022-04-15 07:38:02,203 INFO L290 TraceCheckUtils]: 49: Hoare triple {6532#false} assume !false; {6532#false} is VALID [2022-04-15 07:38:02,204 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 10 proven. 23 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-15 07:38:02,204 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 07:38:04,887 INFO L290 TraceCheckUtils]: 49: Hoare triple {6532#false} assume !false; {6532#false} is VALID [2022-04-15 07:38:04,887 INFO L290 TraceCheckUtils]: 48: Hoare triple {6689#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {6532#false} is VALID [2022-04-15 07:38:04,888 INFO L290 TraceCheckUtils]: 47: Hoare triple {6685#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {6689#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 07:38:04,889 INFO L272 TraceCheckUtils]: 46: Hoare triple {6705#(= (+ (* 2 main_~xy~0) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 main_~yx~0)))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {6685#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 07:38:04,889 INFO L290 TraceCheckUtils]: 45: Hoare triple {6709#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {6705#(= (+ (* 2 main_~xy~0) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 main_~yx~0)))} is VALID [2022-04-15 07:38:04,891 INFO L290 TraceCheckUtils]: 44: Hoare triple {6713#(= (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0))))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {6709#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} is VALID [2022-04-15 07:38:04,892 INFO L290 TraceCheckUtils]: 43: Hoare triple {6709#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {6713#(= (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0))))} is VALID [2022-04-15 07:38:04,892 INFO L290 TraceCheckUtils]: 42: Hoare triple {6709#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} assume !!(~x~0 <= ~X~0); {6709#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} is VALID [2022-04-15 07:38:04,893 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {6630#(not (= |__VERIFIER_assert_#in~cond| 0))} {6723#(or (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (not (= (+ (* 2 main_~xy~0) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 main_~yx~0)))))} #65#return; {6709#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} is VALID [2022-04-15 07:38:04,893 INFO L290 TraceCheckUtils]: 40: Hoare triple {6630#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {6630#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:38:04,894 INFO L290 TraceCheckUtils]: 39: Hoare triple {6733#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {6630#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:38:04,894 INFO L290 TraceCheckUtils]: 38: Hoare triple {6531#true} ~cond := #in~cond; {6733#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 07:38:04,894 INFO L272 TraceCheckUtils]: 37: Hoare triple {6723#(or (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (not (= (+ (* 2 main_~xy~0) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 main_~yx~0)))))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {6531#true} is VALID [2022-04-15 07:38:04,895 INFO L290 TraceCheckUtils]: 36: Hoare triple {6531#true} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {6723#(or (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (not (= (+ (* 2 main_~xy~0) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 main_~yx~0)))))} is VALID [2022-04-15 07:38:04,895 INFO L290 TraceCheckUtils]: 35: Hoare triple {6531#true} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {6531#true} is VALID [2022-04-15 07:38:04,895 INFO L290 TraceCheckUtils]: 34: Hoare triple {6531#true} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {6531#true} is VALID [2022-04-15 07:38:04,895 INFO L290 TraceCheckUtils]: 33: Hoare triple {6531#true} assume !!(~x~0 <= ~X~0); {6531#true} is VALID [2022-04-15 07:38:04,895 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {6531#true} {6531#true} #65#return; {6531#true} is VALID [2022-04-15 07:38:04,895 INFO L290 TraceCheckUtils]: 31: Hoare triple {6531#true} assume true; {6531#true} is VALID [2022-04-15 07:38:04,895 INFO L290 TraceCheckUtils]: 30: Hoare triple {6531#true} assume !(0 == ~cond); {6531#true} is VALID [2022-04-15 07:38:04,896 INFO L290 TraceCheckUtils]: 29: Hoare triple {6531#true} ~cond := #in~cond; {6531#true} is VALID [2022-04-15 07:38:04,896 INFO L272 TraceCheckUtils]: 28: Hoare triple {6531#true} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {6531#true} is VALID [2022-04-15 07:38:04,896 INFO L290 TraceCheckUtils]: 27: Hoare triple {6531#true} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {6531#true} is VALID [2022-04-15 07:38:04,896 INFO L290 TraceCheckUtils]: 26: Hoare triple {6531#true} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {6531#true} is VALID [2022-04-15 07:38:04,896 INFO L290 TraceCheckUtils]: 25: Hoare triple {6531#true} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {6531#true} is VALID [2022-04-15 07:38:04,896 INFO L290 TraceCheckUtils]: 24: Hoare triple {6531#true} assume !!(~x~0 <= ~X~0); {6531#true} is VALID [2022-04-15 07:38:04,896 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {6531#true} {6531#true} #65#return; {6531#true} is VALID [2022-04-15 07:38:04,896 INFO L290 TraceCheckUtils]: 22: Hoare triple {6531#true} assume true; {6531#true} is VALID [2022-04-15 07:38:04,896 INFO L290 TraceCheckUtils]: 21: Hoare triple {6531#true} assume !(0 == ~cond); {6531#true} is VALID [2022-04-15 07:38:04,896 INFO L290 TraceCheckUtils]: 20: Hoare triple {6531#true} ~cond := #in~cond; {6531#true} is VALID [2022-04-15 07:38:04,896 INFO L272 TraceCheckUtils]: 19: Hoare triple {6531#true} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {6531#true} is VALID [2022-04-15 07:38:04,896 INFO L290 TraceCheckUtils]: 18: Hoare triple {6531#true} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {6531#true} is VALID [2022-04-15 07:38:04,896 INFO L290 TraceCheckUtils]: 17: Hoare triple {6531#true} ~v~0 := 2 * ~Y~0 - ~X~0;~y~0 := 0;~x~0 := 0; {6531#true} is VALID [2022-04-15 07:38:04,897 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {6531#true} {6531#true} #63#return; {6531#true} is VALID [2022-04-15 07:38:04,897 INFO L290 TraceCheckUtils]: 15: Hoare triple {6531#true} assume true; {6531#true} is VALID [2022-04-15 07:38:04,897 INFO L290 TraceCheckUtils]: 14: Hoare triple {6531#true} assume !(0 == ~cond); {6531#true} is VALID [2022-04-15 07:38:04,897 INFO L290 TraceCheckUtils]: 13: Hoare triple {6531#true} ~cond := #in~cond; {6531#true} is VALID [2022-04-15 07:38:04,897 INFO L272 TraceCheckUtils]: 12: Hoare triple {6531#true} call assume_abort_if_not((if ~Y~0 >= 0 && ~Y~0 <= 10 then 1 else 0)); {6531#true} is VALID [2022-04-15 07:38:04,897 INFO L290 TraceCheckUtils]: 11: Hoare triple {6531#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~Y~0 := #t~nondet5;havoc #t~nondet5; {6531#true} is VALID [2022-04-15 07:38:04,897 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {6531#true} {6531#true} #61#return; {6531#true} is VALID [2022-04-15 07:38:04,897 INFO L290 TraceCheckUtils]: 9: Hoare triple {6531#true} assume true; {6531#true} is VALID [2022-04-15 07:38:04,897 INFO L290 TraceCheckUtils]: 8: Hoare triple {6531#true} assume !(0 == ~cond); {6531#true} is VALID [2022-04-15 07:38:04,897 INFO L290 TraceCheckUtils]: 7: Hoare triple {6531#true} ~cond := #in~cond; {6531#true} is VALID [2022-04-15 07:38:04,897 INFO L272 TraceCheckUtils]: 6: Hoare triple {6531#true} call assume_abort_if_not((if ~X~0 >= 0 && ~X~0 <= 10 then 1 else 0)); {6531#true} is VALID [2022-04-15 07:38:04,897 INFO L290 TraceCheckUtils]: 5: Hoare triple {6531#true} havoc ~X~0;havoc ~Y~0;havoc ~x~0;havoc ~y~0;havoc ~v~0;havoc ~xy~0;havoc ~yx~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~X~0 := #t~nondet4;havoc #t~nondet4; {6531#true} is VALID [2022-04-15 07:38:04,898 INFO L272 TraceCheckUtils]: 4: Hoare triple {6531#true} call #t~ret8 := main(); {6531#true} is VALID [2022-04-15 07:38:04,898 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6531#true} {6531#true} #69#return; {6531#true} is VALID [2022-04-15 07:38:04,898 INFO L290 TraceCheckUtils]: 2: Hoare triple {6531#true} assume true; {6531#true} is VALID [2022-04-15 07:38:04,898 INFO L290 TraceCheckUtils]: 1: Hoare triple {6531#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(15, 2);call #Ultimate.allocInit(12, 3); {6531#true} is VALID [2022-04-15 07:38:04,898 INFO L272 TraceCheckUtils]: 0: Hoare triple {6531#true} call ULTIMATE.init(); {6531#true} is VALID [2022-04-15 07:38:04,898 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 24 proven. 2 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-04-15 07:38:04,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:38:04,898 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1029526190] [2022-04-15 07:38:04,898 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 07:38:04,898 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2090270318] [2022-04-15 07:38:04,898 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2090270318] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 07:38:04,899 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 07:38:04,899 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 10] total 20 [2022-04-15 07:38:04,899 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:38:04,899 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [550842381] [2022-04-15 07:38:04,899 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [550842381] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:38:04,899 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:38:04,899 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-04-15 07:38:04,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1269010916] [2022-04-15 07:38:04,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:38:04,900 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 12 states have (on average 2.5) internal successors, (30), 14 states have internal predecessors, (30), 5 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) Word has length 50 [2022-04-15 07:38:04,900 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:38:04,900 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 15 states, 12 states have (on average 2.5) internal successors, (30), 14 states have internal predecessors, (30), 5 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-15 07:38:04,938 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:38:04,938 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-15 07:38:04,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:38:04,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-15 07:38:04,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=328, Unknown=0, NotChecked=0, Total=380 [2022-04-15 07:38:04,939 INFO L87 Difference]: Start difference. First operand 73 states and 80 transitions. Second operand has 15 states, 12 states have (on average 2.5) internal successors, (30), 14 states have internal predecessors, (30), 5 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-15 07:38:06,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:38:06,273 INFO L93 Difference]: Finished difference Result 88 states and 98 transitions. [2022-04-15 07:38:06,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-15 07:38:06,273 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 12 states have (on average 2.5) internal successors, (30), 14 states have internal predecessors, (30), 5 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) Word has length 50 [2022-04-15 07:38:06,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:38:06,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 12 states have (on average 2.5) internal successors, (30), 14 states have internal predecessors, (30), 5 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-15 07:38:06,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 65 transitions. [2022-04-15 07:38:06,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 12 states have (on average 2.5) internal successors, (30), 14 states have internal predecessors, (30), 5 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-15 07:38:06,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 65 transitions. [2022-04-15 07:38:06,275 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 65 transitions. [2022-04-15 07:38:06,334 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-15 07:38:06,336 INFO L225 Difference]: With dead ends: 88 [2022-04-15 07:38:06,336 INFO L226 Difference]: Without dead ends: 84 [2022-04-15 07:38:06,336 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 78 SyntacticMatches, 3 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=80, Invalid=472, Unknown=0, NotChecked=0, Total=552 [2022-04-15 07:38:06,337 INFO L913 BasicCegarLoop]: 29 mSDtfsCounter, 20 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 390 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 198 SdHoareTripleChecker+Invalid, 398 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 390 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-15 07:38:06,337 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 198 Invalid, 398 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 390 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-15 07:38:06,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2022-04-15 07:38:06,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 75. [2022-04-15 07:38:06,466 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:38:06,466 INFO L82 GeneralOperation]: Start isEquivalent. First operand 84 states. Second operand has 75 states, 54 states have (on average 1.1296296296296295) internal successors, (61), 55 states have internal predecessors, (61), 12 states have call successors, (12), 9 states have call predecessors, (12), 8 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-15 07:38:06,466 INFO L74 IsIncluded]: Start isIncluded. First operand 84 states. Second operand has 75 states, 54 states have (on average 1.1296296296296295) internal successors, (61), 55 states have internal predecessors, (61), 12 states have call successors, (12), 9 states have call predecessors, (12), 8 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-15 07:38:06,466 INFO L87 Difference]: Start difference. First operand 84 states. Second operand has 75 states, 54 states have (on average 1.1296296296296295) internal successors, (61), 55 states have internal predecessors, (61), 12 states have call successors, (12), 9 states have call predecessors, (12), 8 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-15 07:38:06,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:38:06,468 INFO L93 Difference]: Finished difference Result 84 states and 93 transitions. [2022-04-15 07:38:06,468 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 93 transitions. [2022-04-15 07:38:06,468 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:38:06,468 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:38:06,468 INFO L74 IsIncluded]: Start isIncluded. First operand has 75 states, 54 states have (on average 1.1296296296296295) internal successors, (61), 55 states have internal predecessors, (61), 12 states have call successors, (12), 9 states have call predecessors, (12), 8 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 84 states. [2022-04-15 07:38:06,469 INFO L87 Difference]: Start difference. First operand has 75 states, 54 states have (on average 1.1296296296296295) internal successors, (61), 55 states have internal predecessors, (61), 12 states have call successors, (12), 9 states have call predecessors, (12), 8 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 84 states. [2022-04-15 07:38:06,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:38:06,470 INFO L93 Difference]: Finished difference Result 84 states and 93 transitions. [2022-04-15 07:38:06,470 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 93 transitions. [2022-04-15 07:38:06,470 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:38:06,470 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:38:06,470 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:38:06,470 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:38:06,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 54 states have (on average 1.1296296296296295) internal successors, (61), 55 states have internal predecessors, (61), 12 states have call successors, (12), 9 states have call predecessors, (12), 8 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-15 07:38:06,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 83 transitions. [2022-04-15 07:38:06,472 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 83 transitions. Word has length 50 [2022-04-15 07:38:06,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:38:06,472 INFO L478 AbstractCegarLoop]: Abstraction has 75 states and 83 transitions. [2022-04-15 07:38:06,472 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 12 states have (on average 2.5) internal successors, (30), 14 states have internal predecessors, (30), 5 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-15 07:38:06,472 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 75 states and 83 transitions. [2022-04-15 07:38:06,638 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 83 edges. 83 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:38:06,638 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 83 transitions. [2022-04-15 07:38:06,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-04-15 07:38:06,639 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:38:06,639 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 07:38:06,657 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-04-15 07:38:06,839 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-04-15 07:38:06,839 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:38:06,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:38:06,840 INFO L85 PathProgramCache]: Analyzing trace with hash 1311969331, now seen corresponding path program 5 times [2022-04-15 07:38:06,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:38:06,840 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1719179880] [2022-04-15 07:38:06,842 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 07:38:06,842 INFO L85 PathProgramCache]: Analyzing trace with hash 1311969331, now seen corresponding path program 6 times [2022-04-15 07:38:06,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:38:06,842 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911009192] [2022-04-15 07:38:06,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:38:06,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:38:06,851 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 07:38:06,852 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1236541569] [2022-04-15 07:38:06,852 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 07:38:06,852 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 07:38:06,852 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 07:38:06,865 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-15 07:38:06,866 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-15 07:38:06,909 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-04-15 07:38:06,909 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 07:38:06,910 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 48 conjunts are in the unsatisfiable core [2022-04-15 07:38:06,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:38:06,922 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 07:38:07,660 INFO L272 TraceCheckUtils]: 0: Hoare triple {7352#true} call ULTIMATE.init(); {7352#true} is VALID [2022-04-15 07:38:07,660 INFO L290 TraceCheckUtils]: 1: Hoare triple {7352#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(15, 2);call #Ultimate.allocInit(12, 3); {7352#true} is VALID [2022-04-15 07:38:07,660 INFO L290 TraceCheckUtils]: 2: Hoare triple {7352#true} assume true; {7352#true} is VALID [2022-04-15 07:38:07,660 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7352#true} {7352#true} #69#return; {7352#true} is VALID [2022-04-15 07:38:07,660 INFO L272 TraceCheckUtils]: 4: Hoare triple {7352#true} call #t~ret8 := main(); {7352#true} is VALID [2022-04-15 07:38:07,660 INFO L290 TraceCheckUtils]: 5: Hoare triple {7352#true} havoc ~X~0;havoc ~Y~0;havoc ~x~0;havoc ~y~0;havoc ~v~0;havoc ~xy~0;havoc ~yx~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~X~0 := #t~nondet4;havoc #t~nondet4; {7352#true} is VALID [2022-04-15 07:38:07,660 INFO L272 TraceCheckUtils]: 6: Hoare triple {7352#true} call assume_abort_if_not((if ~X~0 >= 0 && ~X~0 <= 10 then 1 else 0)); {7352#true} is VALID [2022-04-15 07:38:07,661 INFO L290 TraceCheckUtils]: 7: Hoare triple {7352#true} ~cond := #in~cond; {7378#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-15 07:38:07,661 INFO L290 TraceCheckUtils]: 8: Hoare triple {7378#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {7382#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 07:38:07,661 INFO L290 TraceCheckUtils]: 9: Hoare triple {7382#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {7382#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 07:38:07,662 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {7382#(not (= |assume_abort_if_not_#in~cond| 0))} {7352#true} #61#return; {7389#(and (<= main_~X~0 10) (<= 0 main_~X~0))} is VALID [2022-04-15 07:38:07,662 INFO L290 TraceCheckUtils]: 11: Hoare triple {7389#(and (<= main_~X~0 10) (<= 0 main_~X~0))} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~Y~0 := #t~nondet5;havoc #t~nondet5; {7389#(and (<= main_~X~0 10) (<= 0 main_~X~0))} is VALID [2022-04-15 07:38:07,662 INFO L272 TraceCheckUtils]: 12: Hoare triple {7389#(and (<= main_~X~0 10) (<= 0 main_~X~0))} call assume_abort_if_not((if ~Y~0 >= 0 && ~Y~0 <= 10 then 1 else 0)); {7352#true} is VALID [2022-04-15 07:38:07,662 INFO L290 TraceCheckUtils]: 13: Hoare triple {7352#true} ~cond := #in~cond; {7352#true} is VALID [2022-04-15 07:38:07,662 INFO L290 TraceCheckUtils]: 14: Hoare triple {7352#true} assume !(0 == ~cond); {7352#true} is VALID [2022-04-15 07:38:07,662 INFO L290 TraceCheckUtils]: 15: Hoare triple {7352#true} assume true; {7352#true} is VALID [2022-04-15 07:38:07,663 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {7352#true} {7389#(and (<= main_~X~0 10) (<= 0 main_~X~0))} #63#return; {7389#(and (<= main_~X~0 10) (<= 0 main_~X~0))} is VALID [2022-04-15 07:38:07,663 INFO L290 TraceCheckUtils]: 17: Hoare triple {7389#(and (<= main_~X~0 10) (<= 0 main_~X~0))} ~v~0 := 2 * ~Y~0 - ~X~0;~y~0 := 0;~x~0 := 0; {7411#(and (= main_~x~0 0) (<= main_~X~0 10) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (<= 0 main_~X~0) (= main_~y~0 0))} is VALID [2022-04-15 07:38:07,664 INFO L290 TraceCheckUtils]: 18: Hoare triple {7411#(and (= main_~x~0 0) (<= main_~X~0 10) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (<= 0 main_~X~0) (= main_~y~0 0))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {7411#(and (= main_~x~0 0) (<= main_~X~0 10) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (<= 0 main_~X~0) (= main_~y~0 0))} is VALID [2022-04-15 07:38:07,664 INFO L272 TraceCheckUtils]: 19: Hoare triple {7411#(and (= main_~x~0 0) (<= main_~X~0 10) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (<= 0 main_~X~0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {7352#true} is VALID [2022-04-15 07:38:07,664 INFO L290 TraceCheckUtils]: 20: Hoare triple {7352#true} ~cond := #in~cond; {7352#true} is VALID [2022-04-15 07:38:07,664 INFO L290 TraceCheckUtils]: 21: Hoare triple {7352#true} assume !(0 == ~cond); {7352#true} is VALID [2022-04-15 07:38:07,664 INFO L290 TraceCheckUtils]: 22: Hoare triple {7352#true} assume true; {7352#true} is VALID [2022-04-15 07:38:07,664 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {7352#true} {7411#(and (= main_~x~0 0) (<= main_~X~0 10) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (<= 0 main_~X~0) (= main_~y~0 0))} #65#return; {7411#(and (= main_~x~0 0) (<= main_~X~0 10) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (<= 0 main_~X~0) (= main_~y~0 0))} is VALID [2022-04-15 07:38:07,665 INFO L290 TraceCheckUtils]: 24: Hoare triple {7411#(and (= main_~x~0 0) (<= main_~X~0 10) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (<= 0 main_~X~0) (= main_~y~0 0))} assume !!(~x~0 <= ~X~0); {7411#(and (= main_~x~0 0) (<= main_~X~0 10) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (<= 0 main_~X~0) (= main_~y~0 0))} is VALID [2022-04-15 07:38:07,666 INFO L290 TraceCheckUtils]: 25: Hoare triple {7411#(and (= main_~x~0 0) (<= main_~X~0 10) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (<= 0 main_~X~0) (= main_~y~0 0))} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {7436#(and (= main_~x~0 0) (<= main_~X~0 10) (= main_~v~0 (+ (* (- 1) main_~X~0) (* main_~Y~0 4))) (<= 0 main_~X~0) (= main_~y~0 0))} is VALID [2022-04-15 07:38:07,666 INFO L290 TraceCheckUtils]: 26: Hoare triple {7436#(and (= main_~x~0 0) (<= main_~X~0 10) (= main_~v~0 (+ (* (- 1) main_~X~0) (* main_~Y~0 4))) (<= 0 main_~X~0) (= main_~y~0 0))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {7440#(and (<= main_~X~0 10) (= main_~v~0 (+ (* (- 1) main_~X~0) (* main_~Y~0 4))) (= main_~x~0 1) (<= 0 main_~X~0) (= main_~y~0 0))} is VALID [2022-04-15 07:38:07,666 INFO L290 TraceCheckUtils]: 27: Hoare triple {7440#(and (<= main_~X~0 10) (= main_~v~0 (+ (* (- 1) main_~X~0) (* main_~Y~0 4))) (= main_~x~0 1) (<= 0 main_~X~0) (= main_~y~0 0))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {7440#(and (<= main_~X~0 10) (= main_~v~0 (+ (* (- 1) main_~X~0) (* main_~Y~0 4))) (= main_~x~0 1) (<= 0 main_~X~0) (= main_~y~0 0))} is VALID [2022-04-15 07:38:07,667 INFO L272 TraceCheckUtils]: 28: Hoare triple {7440#(and (<= main_~X~0 10) (= main_~v~0 (+ (* (- 1) main_~X~0) (* main_~Y~0 4))) (= main_~x~0 1) (<= 0 main_~X~0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {7352#true} is VALID [2022-04-15 07:38:07,667 INFO L290 TraceCheckUtils]: 29: Hoare triple {7352#true} ~cond := #in~cond; {7352#true} is VALID [2022-04-15 07:38:07,667 INFO L290 TraceCheckUtils]: 30: Hoare triple {7352#true} assume !(0 == ~cond); {7352#true} is VALID [2022-04-15 07:38:07,667 INFO L290 TraceCheckUtils]: 31: Hoare triple {7352#true} assume true; {7352#true} is VALID [2022-04-15 07:38:07,667 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {7352#true} {7440#(and (<= main_~X~0 10) (= main_~v~0 (+ (* (- 1) main_~X~0) (* main_~Y~0 4))) (= main_~x~0 1) (<= 0 main_~X~0) (= main_~y~0 0))} #65#return; {7440#(and (<= main_~X~0 10) (= main_~v~0 (+ (* (- 1) main_~X~0) (* main_~Y~0 4))) (= main_~x~0 1) (<= 0 main_~X~0) (= main_~y~0 0))} is VALID [2022-04-15 07:38:07,668 INFO L290 TraceCheckUtils]: 33: Hoare triple {7440#(and (<= main_~X~0 10) (= main_~v~0 (+ (* (- 1) main_~X~0) (* main_~Y~0 4))) (= main_~x~0 1) (<= 0 main_~X~0) (= main_~y~0 0))} assume !!(~x~0 <= ~X~0); {7440#(and (<= main_~X~0 10) (= main_~v~0 (+ (* (- 1) main_~X~0) (* main_~Y~0 4))) (= main_~x~0 1) (<= 0 main_~X~0) (= main_~y~0 0))} is VALID [2022-04-15 07:38:07,668 INFO L290 TraceCheckUtils]: 34: Hoare triple {7440#(and (<= main_~X~0 10) (= main_~v~0 (+ (* (- 1) main_~X~0) (* main_~Y~0 4))) (= main_~x~0 1) (<= 0 main_~X~0) (= main_~y~0 0))} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {7465#(and (<= main_~X~0 10) (< main_~v~0 (* main_~Y~0 2)) (= main_~x~0 1) (<= 0 main_~X~0) (= main_~y~0 0) (= (+ main_~v~0 (* (- 2) main_~Y~0)) (+ (* (- 1) main_~X~0) (* main_~Y~0 4))))} is VALID [2022-04-15 07:38:07,669 INFO L290 TraceCheckUtils]: 35: Hoare triple {7465#(and (<= main_~X~0 10) (< main_~v~0 (* main_~Y~0 2)) (= main_~x~0 1) (<= 0 main_~X~0) (= main_~y~0 0) (= (+ main_~v~0 (* (- 2) main_~Y~0)) (+ (* (- 1) main_~X~0) (* main_~Y~0 4))))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {7469#(and (<= main_~X~0 10) (< main_~v~0 (* main_~Y~0 2)) (<= 0 main_~X~0) (= main_~y~0 0) (= (+ main_~v~0 (* (- 2) main_~Y~0)) (+ (* (- 1) main_~X~0) (* main_~Y~0 4))) (= main_~x~0 2))} is VALID [2022-04-15 07:38:07,669 INFO L290 TraceCheckUtils]: 36: Hoare triple {7469#(and (<= main_~X~0 10) (< main_~v~0 (* main_~Y~0 2)) (<= 0 main_~X~0) (= main_~y~0 0) (= (+ main_~v~0 (* (- 2) main_~Y~0)) (+ (* (- 1) main_~X~0) (* main_~Y~0 4))) (= main_~x~0 2))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {7473#(and (<= main_~X~0 10) (< main_~v~0 (* main_~Y~0 2)) (<= 0 main_~X~0) (= (* main_~X~0 main_~y~0) main_~xy~0) (= main_~y~0 0) (= (+ main_~v~0 (* (- 2) main_~Y~0)) (+ (* (- 1) main_~X~0) (* main_~Y~0 4))) (= main_~yx~0 (* main_~Y~0 main_~x~0)) (= main_~x~0 2))} is VALID [2022-04-15 07:38:07,669 INFO L272 TraceCheckUtils]: 37: Hoare triple {7473#(and (<= main_~X~0 10) (< main_~v~0 (* main_~Y~0 2)) (<= 0 main_~X~0) (= (* main_~X~0 main_~y~0) main_~xy~0) (= main_~y~0 0) (= (+ main_~v~0 (* (- 2) main_~Y~0)) (+ (* (- 1) main_~X~0) (* main_~Y~0 4))) (= main_~yx~0 (* main_~Y~0 main_~x~0)) (= main_~x~0 2))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {7352#true} is VALID [2022-04-15 07:38:07,670 INFO L290 TraceCheckUtils]: 38: Hoare triple {7352#true} ~cond := #in~cond; {7480#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-15 07:38:07,670 INFO L290 TraceCheckUtils]: 39: Hoare triple {7480#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {7484#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:38:07,670 INFO L290 TraceCheckUtils]: 40: Hoare triple {7484#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {7484#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:38:07,671 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {7484#(not (= |__VERIFIER_assert_#in~cond| 0))} {7473#(and (<= main_~X~0 10) (< main_~v~0 (* main_~Y~0 2)) (<= 0 main_~X~0) (= (* main_~X~0 main_~y~0) main_~xy~0) (= main_~y~0 0) (= (+ main_~v~0 (* (- 2) main_~Y~0)) (+ (* (- 1) main_~X~0) (* main_~Y~0 4))) (= main_~yx~0 (* main_~Y~0 main_~x~0)) (= main_~x~0 2))} #65#return; {7469#(and (<= main_~X~0 10) (< main_~v~0 (* main_~Y~0 2)) (<= 0 main_~X~0) (= main_~y~0 0) (= (+ main_~v~0 (* (- 2) main_~Y~0)) (+ (* (- 1) main_~X~0) (* main_~Y~0 4))) (= main_~x~0 2))} is VALID [2022-04-15 07:38:07,672 INFO L290 TraceCheckUtils]: 42: Hoare triple {7469#(and (<= main_~X~0 10) (< main_~v~0 (* main_~Y~0 2)) (<= 0 main_~X~0) (= main_~y~0 0) (= (+ main_~v~0 (* (- 2) main_~Y~0)) (+ (* (- 1) main_~X~0) (* main_~Y~0 4))) (= main_~x~0 2))} assume !!(~x~0 <= ~X~0); {7494#(and (<= main_~x~0 main_~X~0) (<= main_~X~0 10) (< main_~v~0 (* main_~Y~0 2)) (= main_~y~0 0) (= main_~x~0 2) (= (+ main_~X~0 main_~v~0) (* main_~Y~0 6)))} is VALID [2022-04-15 07:38:07,672 INFO L290 TraceCheckUtils]: 43: Hoare triple {7494#(and (<= main_~x~0 main_~X~0) (<= main_~X~0 10) (< main_~v~0 (* main_~Y~0 2)) (= main_~y~0 0) (= main_~x~0 2) (= (+ main_~X~0 main_~v~0) (* main_~Y~0 6)))} assume !(~v~0 < 0);~v~0 := ~v~0 + 2 * (~Y~0 - ~X~0);#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {7498#(and (<= main_~X~0 10) (= main_~y~0 1) (< (+ main_~v~0 (* main_~X~0 2)) (* main_~Y~0 4)) (= (* main_~Y~0 8) (+ main_~v~0 (* main_~X~0 3))) (<= (* main_~Y~0 2) (+ main_~v~0 (* main_~X~0 2))) (= main_~x~0 2))} is VALID [2022-04-15 07:38:07,673 INFO L290 TraceCheckUtils]: 44: Hoare triple {7498#(and (<= main_~X~0 10) (= main_~y~0 1) (< (+ main_~v~0 (* main_~X~0 2)) (* main_~Y~0 4)) (= (* main_~Y~0 8) (+ main_~v~0 (* main_~X~0 3))) (<= (* main_~Y~0 2) (+ main_~v~0 (* main_~X~0 2))) (= main_~x~0 2))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {7502#(and (= main_~x~0 3) (<= main_~X~0 10) (= main_~y~0 1) (< (+ main_~v~0 (* main_~X~0 2)) (* main_~Y~0 4)) (= (* main_~Y~0 8) (+ main_~v~0 (* main_~X~0 3))) (<= (* main_~Y~0 2) (+ main_~v~0 (* main_~X~0 2))))} is VALID [2022-04-15 07:38:07,674 INFO L290 TraceCheckUtils]: 45: Hoare triple {7502#(and (= main_~x~0 3) (<= main_~X~0 10) (= main_~y~0 1) (< (+ main_~v~0 (* main_~X~0 2)) (* main_~Y~0 4)) (= (* main_~Y~0 8) (+ main_~v~0 (* main_~X~0 3))) (<= (* main_~Y~0 2) (+ main_~v~0 (* main_~X~0 2))))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {7506#(and (<= main_~X~0 10) (= (* main_~Y~0 3) main_~yx~0) (< (+ main_~v~0 (* main_~X~0 2)) (* main_~Y~0 4)) (= (* main_~Y~0 8) (+ main_~v~0 (* main_~X~0 3))) (= main_~X~0 main_~xy~0) (<= (* main_~Y~0 2) (+ main_~v~0 (* main_~X~0 2))))} is VALID [2022-04-15 07:38:07,675 INFO L272 TraceCheckUtils]: 46: Hoare triple {7506#(and (<= main_~X~0 10) (= (* main_~Y~0 3) main_~yx~0) (< (+ main_~v~0 (* main_~X~0 2)) (* main_~Y~0 4)) (= (* main_~Y~0 8) (+ main_~v~0 (* main_~X~0 3))) (= main_~X~0 main_~xy~0) (<= (* main_~Y~0 2) (+ main_~v~0 (* main_~X~0 2))))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {7510#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 07:38:07,675 INFO L290 TraceCheckUtils]: 47: Hoare triple {7510#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {7514#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 07:38:07,675 INFO L290 TraceCheckUtils]: 48: Hoare triple {7514#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {7353#false} is VALID [2022-04-15 07:38:07,675 INFO L290 TraceCheckUtils]: 49: Hoare triple {7353#false} assume !false; {7353#false} is VALID [2022-04-15 07:38:07,676 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 11 proven. 25 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-15 07:38:07,676 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 07:38:11,540 INFO L290 TraceCheckUtils]: 49: Hoare triple {7353#false} assume !false; {7353#false} is VALID [2022-04-15 07:38:11,541 INFO L290 TraceCheckUtils]: 48: Hoare triple {7514#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {7353#false} is VALID [2022-04-15 07:38:11,541 INFO L290 TraceCheckUtils]: 47: Hoare triple {7510#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {7514#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 07:38:11,542 INFO L272 TraceCheckUtils]: 46: Hoare triple {7530#(= (+ (* 2 main_~xy~0) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 main_~yx~0)))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {7510#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 07:38:11,543 INFO L290 TraceCheckUtils]: 45: Hoare triple {7534#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {7530#(= (+ (* 2 main_~xy~0) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 main_~yx~0)))} is VALID [2022-04-15 07:38:11,544 INFO L290 TraceCheckUtils]: 44: Hoare triple {7538#(= (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0))))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {7534#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} is VALID [2022-04-15 07:38:11,546 INFO L290 TraceCheckUtils]: 43: Hoare triple {7542#(or (< main_~v~0 0) (= (+ main_~v~0 (* (- 1) main_~X~0) (* main_~Y~0 2) (* (* main_~X~0 (+ main_~y~0 1)) 2)) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0)))))} assume !(~v~0 < 0);~v~0 := ~v~0 + 2 * (~Y~0 - ~X~0);#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {7538#(= (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0))))} is VALID [2022-04-15 07:38:11,546 INFO L290 TraceCheckUtils]: 42: Hoare triple {7546#(or (< main_~v~0 0) (= (+ main_~v~0 (* (- 1) main_~X~0) (* main_~Y~0 2) (* (* main_~X~0 (+ main_~y~0 1)) 2)) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0)))) (not (<= main_~x~0 main_~X~0)))} assume !!(~x~0 <= ~X~0); {7542#(or (< main_~v~0 0) (= (+ main_~v~0 (* (- 1) main_~X~0) (* main_~Y~0 2) (* (* main_~X~0 (+ main_~y~0 1)) 2)) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0)))))} is VALID [2022-04-15 07:38:11,547 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {7484#(not (= |__VERIFIER_assert_#in~cond| 0))} {7550#(or (< main_~v~0 0) (= (+ main_~v~0 (* (- 1) main_~X~0) (* main_~Y~0 2) (* (* main_~X~0 (+ main_~y~0 1)) 2)) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0)))) (not (= (+ (* 2 main_~xy~0) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 main_~yx~0)))) (not (<= main_~x~0 main_~X~0)))} #65#return; {7546#(or (< main_~v~0 0) (= (+ main_~v~0 (* (- 1) main_~X~0) (* main_~Y~0 2) (* (* main_~X~0 (+ main_~y~0 1)) 2)) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0)))) (not (<= main_~x~0 main_~X~0)))} is VALID [2022-04-15 07:38:11,547 INFO L290 TraceCheckUtils]: 40: Hoare triple {7484#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {7484#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:38:11,548 INFO L290 TraceCheckUtils]: 39: Hoare triple {7560#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {7484#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:38:11,548 INFO L290 TraceCheckUtils]: 38: Hoare triple {7352#true} ~cond := #in~cond; {7560#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 07:38:11,548 INFO L272 TraceCheckUtils]: 37: Hoare triple {7550#(or (< main_~v~0 0) (= (+ main_~v~0 (* (- 1) main_~X~0) (* main_~Y~0 2) (* (* main_~X~0 (+ main_~y~0 1)) 2)) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0)))) (not (= (+ (* 2 main_~xy~0) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 main_~yx~0)))) (not (<= main_~x~0 main_~X~0)))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {7352#true} is VALID [2022-04-15 07:38:11,549 INFO L290 TraceCheckUtils]: 36: Hoare triple {7352#true} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {7550#(or (< main_~v~0 0) (= (+ main_~v~0 (* (- 1) main_~X~0) (* main_~Y~0 2) (* (* main_~X~0 (+ main_~y~0 1)) 2)) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0)))) (not (= (+ (* 2 main_~xy~0) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 main_~yx~0)))) (not (<= main_~x~0 main_~X~0)))} is VALID [2022-04-15 07:38:11,549 INFO L290 TraceCheckUtils]: 35: Hoare triple {7352#true} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {7352#true} is VALID [2022-04-15 07:38:11,549 INFO L290 TraceCheckUtils]: 34: Hoare triple {7352#true} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {7352#true} is VALID [2022-04-15 07:38:11,549 INFO L290 TraceCheckUtils]: 33: Hoare triple {7352#true} assume !!(~x~0 <= ~X~0); {7352#true} is VALID [2022-04-15 07:38:11,549 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {7352#true} {7352#true} #65#return; {7352#true} is VALID [2022-04-15 07:38:11,549 INFO L290 TraceCheckUtils]: 31: Hoare triple {7352#true} assume true; {7352#true} is VALID [2022-04-15 07:38:11,549 INFO L290 TraceCheckUtils]: 30: Hoare triple {7352#true} assume !(0 == ~cond); {7352#true} is VALID [2022-04-15 07:38:11,549 INFO L290 TraceCheckUtils]: 29: Hoare triple {7352#true} ~cond := #in~cond; {7352#true} is VALID [2022-04-15 07:38:11,549 INFO L272 TraceCheckUtils]: 28: Hoare triple {7352#true} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {7352#true} is VALID [2022-04-15 07:38:11,549 INFO L290 TraceCheckUtils]: 27: Hoare triple {7352#true} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {7352#true} is VALID [2022-04-15 07:38:11,550 INFO L290 TraceCheckUtils]: 26: Hoare triple {7352#true} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {7352#true} is VALID [2022-04-15 07:38:11,550 INFO L290 TraceCheckUtils]: 25: Hoare triple {7352#true} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {7352#true} is VALID [2022-04-15 07:38:11,550 INFO L290 TraceCheckUtils]: 24: Hoare triple {7352#true} assume !!(~x~0 <= ~X~0); {7352#true} is VALID [2022-04-15 07:38:11,550 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {7352#true} {7352#true} #65#return; {7352#true} is VALID [2022-04-15 07:38:11,550 INFO L290 TraceCheckUtils]: 22: Hoare triple {7352#true} assume true; {7352#true} is VALID [2022-04-15 07:38:11,550 INFO L290 TraceCheckUtils]: 21: Hoare triple {7352#true} assume !(0 == ~cond); {7352#true} is VALID [2022-04-15 07:38:11,550 INFO L290 TraceCheckUtils]: 20: Hoare triple {7352#true} ~cond := #in~cond; {7352#true} is VALID [2022-04-15 07:38:11,550 INFO L272 TraceCheckUtils]: 19: Hoare triple {7352#true} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {7352#true} is VALID [2022-04-15 07:38:11,550 INFO L290 TraceCheckUtils]: 18: Hoare triple {7352#true} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {7352#true} is VALID [2022-04-15 07:38:11,550 INFO L290 TraceCheckUtils]: 17: Hoare triple {7352#true} ~v~0 := 2 * ~Y~0 - ~X~0;~y~0 := 0;~x~0 := 0; {7352#true} is VALID [2022-04-15 07:38:11,550 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {7352#true} {7352#true} #63#return; {7352#true} is VALID [2022-04-15 07:38:11,550 INFO L290 TraceCheckUtils]: 15: Hoare triple {7352#true} assume true; {7352#true} is VALID [2022-04-15 07:38:11,550 INFO L290 TraceCheckUtils]: 14: Hoare triple {7352#true} assume !(0 == ~cond); {7352#true} is VALID [2022-04-15 07:38:11,550 INFO L290 TraceCheckUtils]: 13: Hoare triple {7352#true} ~cond := #in~cond; {7352#true} is VALID [2022-04-15 07:38:11,551 INFO L272 TraceCheckUtils]: 12: Hoare triple {7352#true} call assume_abort_if_not((if ~Y~0 >= 0 && ~Y~0 <= 10 then 1 else 0)); {7352#true} is VALID [2022-04-15 07:38:11,551 INFO L290 TraceCheckUtils]: 11: Hoare triple {7352#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~Y~0 := #t~nondet5;havoc #t~nondet5; {7352#true} is VALID [2022-04-15 07:38:11,551 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {7352#true} {7352#true} #61#return; {7352#true} is VALID [2022-04-15 07:38:11,551 INFO L290 TraceCheckUtils]: 9: Hoare triple {7352#true} assume true; {7352#true} is VALID [2022-04-15 07:38:11,551 INFO L290 TraceCheckUtils]: 8: Hoare triple {7352#true} assume !(0 == ~cond); {7352#true} is VALID [2022-04-15 07:38:11,551 INFO L290 TraceCheckUtils]: 7: Hoare triple {7352#true} ~cond := #in~cond; {7352#true} is VALID [2022-04-15 07:38:11,551 INFO L272 TraceCheckUtils]: 6: Hoare triple {7352#true} call assume_abort_if_not((if ~X~0 >= 0 && ~X~0 <= 10 then 1 else 0)); {7352#true} is VALID [2022-04-15 07:38:11,551 INFO L290 TraceCheckUtils]: 5: Hoare triple {7352#true} havoc ~X~0;havoc ~Y~0;havoc ~x~0;havoc ~y~0;havoc ~v~0;havoc ~xy~0;havoc ~yx~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~X~0 := #t~nondet4;havoc #t~nondet4; {7352#true} is VALID [2022-04-15 07:38:11,551 INFO L272 TraceCheckUtils]: 4: Hoare triple {7352#true} call #t~ret8 := main(); {7352#true} is VALID [2022-04-15 07:38:11,551 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7352#true} {7352#true} #69#return; {7352#true} is VALID [2022-04-15 07:38:11,551 INFO L290 TraceCheckUtils]: 2: Hoare triple {7352#true} assume true; {7352#true} is VALID [2022-04-15 07:38:11,551 INFO L290 TraceCheckUtils]: 1: Hoare triple {7352#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(15, 2);call #Ultimate.allocInit(12, 3); {7352#true} is VALID [2022-04-15 07:38:11,551 INFO L272 TraceCheckUtils]: 0: Hoare triple {7352#true} call ULTIMATE.init(); {7352#true} is VALID [2022-04-15 07:38:11,552 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 24 proven. 2 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-04-15 07:38:11,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:38:11,552 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [911009192] [2022-04-15 07:38:11,552 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 07:38:11,552 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1236541569] [2022-04-15 07:38:11,552 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1236541569] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 07:38:11,552 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 07:38:11,552 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 12] total 26 [2022-04-15 07:38:11,553 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:38:11,553 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1719179880] [2022-04-15 07:38:11,553 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1719179880] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:38:11,553 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:38:11,553 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-04-15 07:38:11,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1018663353] [2022-04-15 07:38:11,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:38:11,553 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 18 states have internal predecessors, (33), 6 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) Word has length 50 [2022-04-15 07:38:11,553 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:38:11,554 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 19 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 18 states have internal predecessors, (33), 6 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-15 07:38:11,596 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:38:11,596 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-04-15 07:38:11,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:38:11,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-04-15 07:38:11,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=544, Unknown=0, NotChecked=0, Total=650 [2022-04-15 07:38:11,597 INFO L87 Difference]: Start difference. First operand 75 states and 83 transitions. Second operand has 19 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 18 states have internal predecessors, (33), 6 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-15 07:38:13,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:38:13,115 INFO L93 Difference]: Finished difference Result 101 states and 113 transitions. [2022-04-15 07:38:13,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-04-15 07:38:13,115 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 18 states have internal predecessors, (33), 6 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) Word has length 50 [2022-04-15 07:38:13,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:38:13,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 18 states have internal predecessors, (33), 6 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-15 07:38:13,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 77 transitions. [2022-04-15 07:38:13,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 18 states have internal predecessors, (33), 6 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-15 07:38:13,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 77 transitions. [2022-04-15 07:38:13,118 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 77 transitions. [2022-04-15 07:38:13,180 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-15 07:38:13,181 INFO L225 Difference]: With dead ends: 101 [2022-04-15 07:38:13,181 INFO L226 Difference]: Without dead ends: 88 [2022-04-15 07:38:13,181 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 73 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 193 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=144, Invalid=786, Unknown=0, NotChecked=0, Total=930 [2022-04-15 07:38:13,182 INFO L913 BasicCegarLoop]: 21 mSDtfsCounter, 28 mSDsluCounter, 188 mSDsCounter, 0 mSdLazyCounter, 639 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 209 SdHoareTripleChecker+Invalid, 652 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 639 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-04-15 07:38:13,182 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [30 Valid, 209 Invalid, 652 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 639 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-15 07:38:13,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2022-04-15 07:38:13,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2022-04-15 07:38:13,343 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:38:13,344 INFO L82 GeneralOperation]: Start isEquivalent. First operand 88 states. Second operand has 88 states, 64 states have (on average 1.109375) internal successors, (71), 65 states have internal predecessors, (71), 13 states have call successors, (13), 11 states have call predecessors, (13), 10 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-15 07:38:13,344 INFO L74 IsIncluded]: Start isIncluded. First operand 88 states. Second operand has 88 states, 64 states have (on average 1.109375) internal successors, (71), 65 states have internal predecessors, (71), 13 states have call successors, (13), 11 states have call predecessors, (13), 10 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-15 07:38:13,344 INFO L87 Difference]: Start difference. First operand 88 states. Second operand has 88 states, 64 states have (on average 1.109375) internal successors, (71), 65 states have internal predecessors, (71), 13 states have call successors, (13), 11 states have call predecessors, (13), 10 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-15 07:38:13,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:38:13,345 INFO L93 Difference]: Finished difference Result 88 states and 95 transitions. [2022-04-15 07:38:13,345 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 95 transitions. [2022-04-15 07:38:13,346 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:38:13,346 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:38:13,346 INFO L74 IsIncluded]: Start isIncluded. First operand has 88 states, 64 states have (on average 1.109375) internal successors, (71), 65 states have internal predecessors, (71), 13 states have call successors, (13), 11 states have call predecessors, (13), 10 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 88 states. [2022-04-15 07:38:13,346 INFO L87 Difference]: Start difference. First operand has 88 states, 64 states have (on average 1.109375) internal successors, (71), 65 states have internal predecessors, (71), 13 states have call successors, (13), 11 states have call predecessors, (13), 10 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 88 states. [2022-04-15 07:38:13,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:38:13,347 INFO L93 Difference]: Finished difference Result 88 states and 95 transitions. [2022-04-15 07:38:13,347 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 95 transitions. [2022-04-15 07:38:13,347 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:38:13,347 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:38:13,347 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:38:13,348 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:38:13,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 64 states have (on average 1.109375) internal successors, (71), 65 states have internal predecessors, (71), 13 states have call successors, (13), 11 states have call predecessors, (13), 10 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-15 07:38:13,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 95 transitions. [2022-04-15 07:38:13,349 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 95 transitions. Word has length 50 [2022-04-15 07:38:13,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:38:13,349 INFO L478 AbstractCegarLoop]: Abstraction has 88 states and 95 transitions. [2022-04-15 07:38:13,349 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 18 states have internal predecessors, (33), 6 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-15 07:38:13,349 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 88 states and 95 transitions. [2022-04-15 07:38:13,516 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 95 edges. 95 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:38:13,516 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 95 transitions. [2022-04-15 07:38:13,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-04-15 07:38:13,517 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:38:13,517 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 07:38:13,533 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2022-04-15 07:38:13,724 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-04-15 07:38:13,724 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:38:13,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:38:13,725 INFO L85 PathProgramCache]: Analyzing trace with hash -1484106385, now seen corresponding path program 7 times [2022-04-15 07:38:13,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:38:13,725 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1185885914] [2022-04-15 07:38:13,725 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 07:38:13,725 INFO L85 PathProgramCache]: Analyzing trace with hash -1484106385, now seen corresponding path program 8 times [2022-04-15 07:38:13,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:38:13,725 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1684460546] [2022-04-15 07:38:13,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:38:13,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:38:13,735 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 07:38:13,736 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [277995295] [2022-04-15 07:38:13,736 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 07:38:13,736 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 07:38:13,736 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 07:38:13,737 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-15 07:38:13,738 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-15 07:38:13,785 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 07:38:13,785 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 07:38:13,786 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 41 conjunts are in the unsatisfiable core [2022-04-15 07:38:13,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:38:13,798 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 07:38:28,746 WARN L914 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-15 07:38:33,824 WARN L914 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-15 07:38:38,474 WARN L914 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-15 07:38:47,322 INFO L272 TraceCheckUtils]: 0: Hoare triple {8241#true} call ULTIMATE.init(); {8241#true} is VALID [2022-04-15 07:38:47,322 INFO L290 TraceCheckUtils]: 1: Hoare triple {8241#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(15, 2);call #Ultimate.allocInit(12, 3); {8241#true} is VALID [2022-04-15 07:38:47,322 INFO L290 TraceCheckUtils]: 2: Hoare triple {8241#true} assume true; {8241#true} is VALID [2022-04-15 07:38:47,323 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8241#true} {8241#true} #69#return; {8241#true} is VALID [2022-04-15 07:38:47,323 INFO L272 TraceCheckUtils]: 4: Hoare triple {8241#true} call #t~ret8 := main(); {8241#true} is VALID [2022-04-15 07:38:47,323 INFO L290 TraceCheckUtils]: 5: Hoare triple {8241#true} havoc ~X~0;havoc ~Y~0;havoc ~x~0;havoc ~y~0;havoc ~v~0;havoc ~xy~0;havoc ~yx~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~X~0 := #t~nondet4;havoc #t~nondet4; {8241#true} is VALID [2022-04-15 07:38:47,323 INFO L272 TraceCheckUtils]: 6: Hoare triple {8241#true} call assume_abort_if_not((if ~X~0 >= 0 && ~X~0 <= 10 then 1 else 0)); {8241#true} is VALID [2022-04-15 07:38:47,323 INFO L290 TraceCheckUtils]: 7: Hoare triple {8241#true} ~cond := #in~cond; {8241#true} is VALID [2022-04-15 07:38:47,323 INFO L290 TraceCheckUtils]: 8: Hoare triple {8241#true} assume !(0 == ~cond); {8241#true} is VALID [2022-04-15 07:38:47,323 INFO L290 TraceCheckUtils]: 9: Hoare triple {8241#true} assume true; {8241#true} is VALID [2022-04-15 07:38:47,323 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {8241#true} {8241#true} #61#return; {8241#true} is VALID [2022-04-15 07:38:47,323 INFO L290 TraceCheckUtils]: 11: Hoare triple {8241#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~Y~0 := #t~nondet5;havoc #t~nondet5; {8241#true} is VALID [2022-04-15 07:38:47,323 INFO L272 TraceCheckUtils]: 12: Hoare triple {8241#true} call assume_abort_if_not((if ~Y~0 >= 0 && ~Y~0 <= 10 then 1 else 0)); {8241#true} is VALID [2022-04-15 07:38:47,323 INFO L290 TraceCheckUtils]: 13: Hoare triple {8241#true} ~cond := #in~cond; {8241#true} is VALID [2022-04-15 07:38:47,323 INFO L290 TraceCheckUtils]: 14: Hoare triple {8241#true} assume !(0 == ~cond); {8241#true} is VALID [2022-04-15 07:38:47,323 INFO L290 TraceCheckUtils]: 15: Hoare triple {8241#true} assume true; {8241#true} is VALID [2022-04-15 07:38:47,324 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {8241#true} {8241#true} #63#return; {8241#true} is VALID [2022-04-15 07:38:47,324 INFO L290 TraceCheckUtils]: 17: Hoare triple {8241#true} ~v~0 := 2 * ~Y~0 - ~X~0;~y~0 := 0;~x~0 := 0; {8297#(and (= (+ main_~X~0 main_~v~0) (* main_~Y~0 2)) (= main_~y~0 0))} is VALID [2022-04-15 07:38:47,324 INFO L290 TraceCheckUtils]: 18: Hoare triple {8297#(and (= (+ main_~X~0 main_~v~0) (* main_~Y~0 2)) (= main_~y~0 0))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {8297#(and (= (+ main_~X~0 main_~v~0) (* main_~Y~0 2)) (= main_~y~0 0))} is VALID [2022-04-15 07:38:47,324 INFO L272 TraceCheckUtils]: 19: Hoare triple {8297#(and (= (+ main_~X~0 main_~v~0) (* main_~Y~0 2)) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {8241#true} is VALID [2022-04-15 07:38:47,325 INFO L290 TraceCheckUtils]: 20: Hoare triple {8241#true} ~cond := #in~cond; {8241#true} is VALID [2022-04-15 07:38:47,325 INFO L290 TraceCheckUtils]: 21: Hoare triple {8241#true} assume !(0 == ~cond); {8241#true} is VALID [2022-04-15 07:38:47,325 INFO L290 TraceCheckUtils]: 22: Hoare triple {8241#true} assume true; {8241#true} is VALID [2022-04-15 07:38:47,325 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {8241#true} {8297#(and (= (+ main_~X~0 main_~v~0) (* main_~Y~0 2)) (= main_~y~0 0))} #65#return; {8297#(and (= (+ main_~X~0 main_~v~0) (* main_~Y~0 2)) (= main_~y~0 0))} is VALID [2022-04-15 07:38:47,326 INFO L290 TraceCheckUtils]: 24: Hoare triple {8297#(and (= (+ main_~X~0 main_~v~0) (* main_~Y~0 2)) (= main_~y~0 0))} assume !!(~x~0 <= ~X~0); {8297#(and (= (+ main_~X~0 main_~v~0) (* main_~Y~0 2)) (= main_~y~0 0))} is VALID [2022-04-15 07:38:47,327 INFO L290 TraceCheckUtils]: 25: Hoare triple {8297#(and (= (+ main_~X~0 main_~v~0) (* main_~Y~0 2)) (= main_~y~0 0))} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {8322#(and (= main_~v~0 (+ (* (- 1) main_~X~0) (* main_~Y~0 4))) (= main_~y~0 0))} is VALID [2022-04-15 07:38:47,327 INFO L290 TraceCheckUtils]: 26: Hoare triple {8322#(and (= main_~v~0 (+ (* (- 1) main_~X~0) (* main_~Y~0 4))) (= main_~y~0 0))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {8322#(and (= main_~v~0 (+ (* (- 1) main_~X~0) (* main_~Y~0 4))) (= main_~y~0 0))} is VALID [2022-04-15 07:38:47,328 INFO L290 TraceCheckUtils]: 27: Hoare triple {8322#(and (= main_~v~0 (+ (* (- 1) main_~X~0) (* main_~Y~0 4))) (= main_~y~0 0))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {8329#(and (= main_~xy~0 0) (= main_~v~0 (+ (* (- 1) main_~X~0) (* main_~Y~0 4))))} is VALID [2022-04-15 07:38:47,328 INFO L272 TraceCheckUtils]: 28: Hoare triple {8329#(and (= main_~xy~0 0) (= main_~v~0 (+ (* (- 1) main_~X~0) (* main_~Y~0 4))))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {8241#true} is VALID [2022-04-15 07:38:47,328 INFO L290 TraceCheckUtils]: 29: Hoare triple {8241#true} ~cond := #in~cond; {8336#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-15 07:38:47,328 INFO L290 TraceCheckUtils]: 30: Hoare triple {8336#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {8340#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:38:47,329 INFO L290 TraceCheckUtils]: 31: Hoare triple {8340#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {8340#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:38:47,330 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {8340#(not (= |__VERIFIER_assert_#in~cond| 0))} {8329#(and (= main_~xy~0 0) (= main_~v~0 (+ (* (- 1) main_~X~0) (* main_~Y~0 4))))} #65#return; {8347#(= (+ main_~X~0 main_~v~0) (* main_~Y~0 4))} is VALID [2022-04-15 07:38:47,330 INFO L290 TraceCheckUtils]: 33: Hoare triple {8347#(= (+ main_~X~0 main_~v~0) (* main_~Y~0 4))} assume !!(~x~0 <= ~X~0); {8347#(= (+ main_~X~0 main_~v~0) (* main_~Y~0 4))} is VALID [2022-04-15 07:38:47,331 INFO L290 TraceCheckUtils]: 34: Hoare triple {8347#(= (+ main_~X~0 main_~v~0) (* main_~Y~0 4))} assume !(~v~0 < 0);~v~0 := ~v~0 + 2 * (~Y~0 - ~X~0);#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {8354#(= (* main_~Y~0 4) (+ main_~v~0 (* main_~X~0 3) (* (- 2) main_~Y~0)))} is VALID [2022-04-15 07:38:47,331 INFO L290 TraceCheckUtils]: 35: Hoare triple {8354#(= (* main_~Y~0 4) (+ main_~v~0 (* main_~X~0 3) (* (- 2) main_~Y~0)))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {8354#(= (* main_~Y~0 4) (+ main_~v~0 (* main_~X~0 3) (* (- 2) main_~Y~0)))} is VALID [2022-04-15 07:38:47,332 INFO L290 TraceCheckUtils]: 36: Hoare triple {8354#(= (* main_~Y~0 4) (+ main_~v~0 (* main_~X~0 3) (* (- 2) main_~Y~0)))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {8361#(and (= (* main_~Y~0 4) (+ main_~v~0 (* main_~X~0 3) (* (- 2) main_~Y~0))) (= (* main_~X~0 main_~y~0) main_~xy~0) (= main_~yx~0 (* main_~Y~0 main_~x~0)))} is VALID [2022-04-15 07:38:47,332 INFO L272 TraceCheckUtils]: 37: Hoare triple {8361#(and (= (* main_~Y~0 4) (+ main_~v~0 (* main_~X~0 3) (* (- 2) main_~Y~0))) (= (* main_~X~0 main_~y~0) main_~xy~0) (= main_~yx~0 (* main_~Y~0 main_~x~0)))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {8241#true} is VALID [2022-04-15 07:38:47,332 INFO L290 TraceCheckUtils]: 38: Hoare triple {8241#true} ~cond := #in~cond; {8336#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-15 07:38:47,332 INFO L290 TraceCheckUtils]: 39: Hoare triple {8336#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {8340#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:38:47,333 INFO L290 TraceCheckUtils]: 40: Hoare triple {8340#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {8340#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:38:47,334 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {8340#(not (= |__VERIFIER_assert_#in~cond| 0))} {8361#(and (= (* main_~Y~0 4) (+ main_~v~0 (* main_~X~0 3) (* (- 2) main_~Y~0))) (= (* main_~X~0 main_~y~0) main_~xy~0) (= main_~yx~0 (* main_~Y~0 main_~x~0)))} #65#return; {8377#(and (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (= (* main_~Y~0 4) (+ main_~v~0 (* main_~X~0 3) (* (- 2) main_~Y~0))))} is VALID [2022-04-15 07:38:47,334 INFO L290 TraceCheckUtils]: 42: Hoare triple {8377#(and (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (= (* main_~Y~0 4) (+ main_~v~0 (* main_~X~0 3) (* (- 2) main_~Y~0))))} assume !!(~x~0 <= ~X~0); {8377#(and (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (= (* main_~Y~0 4) (+ main_~v~0 (* main_~X~0 3) (* (- 2) main_~Y~0))))} is VALID [2022-04-15 07:38:47,335 INFO L290 TraceCheckUtils]: 43: Hoare triple {8377#(and (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (= (* main_~Y~0 4) (+ main_~v~0 (* main_~X~0 3) (* (- 2) main_~Y~0))))} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {8384#(and (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) (* (- 2) main_~X~0) (* main_~Y~0 6))) (= main_~v~0 (+ (* main_~Y~0 8) (* main_~X~0 (- 3)))))} is VALID [2022-04-15 07:38:47,337 INFO L290 TraceCheckUtils]: 44: Hoare triple {8384#(and (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) (* (- 2) main_~X~0) (* main_~Y~0 6))) (= main_~v~0 (+ (* main_~Y~0 8) (* main_~X~0 (- 3)))))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {8388#(and (= main_~v~0 (+ (* main_~Y~0 8) (* main_~X~0 (- 3)))) (= (+ (* main_~Y~0 2) (* 2 (* (+ (- 1) main_~x~0) main_~Y~0))) (+ (* (* main_~X~0 main_~y~0) 2) (* (- 2) main_~X~0) (* main_~Y~0 6))))} is VALID [2022-04-15 07:38:49,339 WARN L290 TraceCheckUtils]: 45: Hoare triple {8388#(and (= main_~v~0 (+ (* main_~Y~0 8) (* main_~X~0 (- 3)))) (= (+ (* main_~Y~0 2) (* 2 (* (+ (- 1) main_~x~0) main_~Y~0))) (+ (* (* main_~X~0 main_~y~0) 2) (* (- 2) main_~X~0) (* main_~Y~0 6))))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {8392#(and (or (and (or (and (= (+ (* main_~Y~0 3) (* (div main_~xy~0 main_~X~0) main_~X~0) (* (- 1) main_~X~0)) 0) (= main_~yx~0 0)) (and (= (mod (+ (* main_~Y~0 3) (* (div main_~xy~0 main_~X~0) main_~X~0) (* (- 1) main_~X~0)) main_~Y~0) 0) (= (* (div (+ (* main_~Y~0 3) (* (div main_~xy~0 main_~X~0) main_~X~0) (* (- 1) main_~X~0)) main_~Y~0) main_~Y~0) main_~yx~0) (not (= main_~Y~0 0)))) (not (= main_~X~0 0)) (= (mod main_~xy~0 main_~X~0) 0)) (and (= main_~xy~0 0) (= main_~X~0 0) (or (and (= (* main_~Y~0 3) (+ (* (div main_~yx~0 main_~Y~0) main_~Y~0) main_~X~0)) (= (mod main_~yx~0 main_~Y~0) 0) (not (= main_~Y~0 0))) (and (= main_~yx~0 0) (= main_~Y~0 0))))) (= main_~v~0 (+ (* main_~Y~0 8) (* main_~X~0 (- 3)))))} is UNKNOWN [2022-04-15 07:38:49,342 INFO L272 TraceCheckUtils]: 46: Hoare triple {8392#(and (or (and (or (and (= (+ (* main_~Y~0 3) (* (div main_~xy~0 main_~X~0) main_~X~0) (* (- 1) main_~X~0)) 0) (= main_~yx~0 0)) (and (= (mod (+ (* main_~Y~0 3) (* (div main_~xy~0 main_~X~0) main_~X~0) (* (- 1) main_~X~0)) main_~Y~0) 0) (= (* (div (+ (* main_~Y~0 3) (* (div main_~xy~0 main_~X~0) main_~X~0) (* (- 1) main_~X~0)) main_~Y~0) main_~Y~0) main_~yx~0) (not (= main_~Y~0 0)))) (not (= main_~X~0 0)) (= (mod main_~xy~0 main_~X~0) 0)) (and (= main_~xy~0 0) (= main_~X~0 0) (or (and (= (* main_~Y~0 3) (+ (* (div main_~yx~0 main_~Y~0) main_~Y~0) main_~X~0)) (= (mod main_~yx~0 main_~Y~0) 0) (not (= main_~Y~0 0))) (and (= main_~yx~0 0) (= main_~Y~0 0))))) (= main_~v~0 (+ (* main_~Y~0 8) (* main_~X~0 (- 3)))))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {8396#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 07:38:49,342 INFO L290 TraceCheckUtils]: 47: Hoare triple {8396#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {8400#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 07:38:49,343 INFO L290 TraceCheckUtils]: 48: Hoare triple {8400#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {8242#false} is VALID [2022-04-15 07:38:49,343 INFO L290 TraceCheckUtils]: 49: Hoare triple {8242#false} assume !false; {8242#false} is VALID [2022-04-15 07:38:49,343 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 10 proven. 23 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-15 07:38:49,343 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 07:38:54,011 INFO L290 TraceCheckUtils]: 49: Hoare triple {8242#false} assume !false; {8242#false} is VALID [2022-04-15 07:38:54,011 INFO L290 TraceCheckUtils]: 48: Hoare triple {8400#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {8242#false} is VALID [2022-04-15 07:38:54,012 INFO L290 TraceCheckUtils]: 47: Hoare triple {8396#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {8400#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 07:38:54,012 INFO L272 TraceCheckUtils]: 46: Hoare triple {8416#(= (+ (* 2 main_~xy~0) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 main_~yx~0)))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {8396#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 07:38:54,013 INFO L290 TraceCheckUtils]: 45: Hoare triple {8420#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {8416#(= (+ (* 2 main_~xy~0) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 main_~yx~0)))} is VALID [2022-04-15 07:38:54,015 INFO L290 TraceCheckUtils]: 44: Hoare triple {8424#(= (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0))))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {8420#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} is VALID [2022-04-15 07:38:54,016 INFO L290 TraceCheckUtils]: 43: Hoare triple {8420#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {8424#(= (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0))))} is VALID [2022-04-15 07:38:54,016 INFO L290 TraceCheckUtils]: 42: Hoare triple {8420#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} assume !!(~x~0 <= ~X~0); {8420#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} is VALID [2022-04-15 07:38:54,017 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {8340#(not (= |__VERIFIER_assert_#in~cond| 0))} {8434#(or (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (not (= (+ (* 2 main_~xy~0) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 main_~yx~0)))))} #65#return; {8420#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} is VALID [2022-04-15 07:38:54,017 INFO L290 TraceCheckUtils]: 40: Hoare triple {8340#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {8340#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:38:54,017 INFO L290 TraceCheckUtils]: 39: Hoare triple {8444#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {8340#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:38:54,018 INFO L290 TraceCheckUtils]: 38: Hoare triple {8241#true} ~cond := #in~cond; {8444#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 07:38:54,018 INFO L272 TraceCheckUtils]: 37: Hoare triple {8434#(or (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (not (= (+ (* 2 main_~xy~0) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 main_~yx~0)))))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {8241#true} is VALID [2022-04-15 07:38:54,019 INFO L290 TraceCheckUtils]: 36: Hoare triple {8241#true} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {8434#(or (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (not (= (+ (* 2 main_~xy~0) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 main_~yx~0)))))} is VALID [2022-04-15 07:38:54,019 INFO L290 TraceCheckUtils]: 35: Hoare triple {8241#true} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {8241#true} is VALID [2022-04-15 07:38:54,019 INFO L290 TraceCheckUtils]: 34: Hoare triple {8241#true} assume !(~v~0 < 0);~v~0 := ~v~0 + 2 * (~Y~0 - ~X~0);#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {8241#true} is VALID [2022-04-15 07:38:54,019 INFO L290 TraceCheckUtils]: 33: Hoare triple {8241#true} assume !!(~x~0 <= ~X~0); {8241#true} is VALID [2022-04-15 07:38:54,019 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {8241#true} {8241#true} #65#return; {8241#true} is VALID [2022-04-15 07:38:54,019 INFO L290 TraceCheckUtils]: 31: Hoare triple {8241#true} assume true; {8241#true} is VALID [2022-04-15 07:38:54,019 INFO L290 TraceCheckUtils]: 30: Hoare triple {8241#true} assume !(0 == ~cond); {8241#true} is VALID [2022-04-15 07:38:54,019 INFO L290 TraceCheckUtils]: 29: Hoare triple {8241#true} ~cond := #in~cond; {8241#true} is VALID [2022-04-15 07:38:54,019 INFO L272 TraceCheckUtils]: 28: Hoare triple {8241#true} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {8241#true} is VALID [2022-04-15 07:38:54,019 INFO L290 TraceCheckUtils]: 27: Hoare triple {8241#true} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {8241#true} is VALID [2022-04-15 07:38:54,019 INFO L290 TraceCheckUtils]: 26: Hoare triple {8241#true} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {8241#true} is VALID [2022-04-15 07:38:54,020 INFO L290 TraceCheckUtils]: 25: Hoare triple {8241#true} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {8241#true} is VALID [2022-04-15 07:38:54,020 INFO L290 TraceCheckUtils]: 24: Hoare triple {8241#true} assume !!(~x~0 <= ~X~0); {8241#true} is VALID [2022-04-15 07:38:54,020 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {8241#true} {8241#true} #65#return; {8241#true} is VALID [2022-04-15 07:38:54,020 INFO L290 TraceCheckUtils]: 22: Hoare triple {8241#true} assume true; {8241#true} is VALID [2022-04-15 07:38:54,020 INFO L290 TraceCheckUtils]: 21: Hoare triple {8241#true} assume !(0 == ~cond); {8241#true} is VALID [2022-04-15 07:38:54,020 INFO L290 TraceCheckUtils]: 20: Hoare triple {8241#true} ~cond := #in~cond; {8241#true} is VALID [2022-04-15 07:38:54,020 INFO L272 TraceCheckUtils]: 19: Hoare triple {8241#true} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {8241#true} is VALID [2022-04-15 07:38:54,020 INFO L290 TraceCheckUtils]: 18: Hoare triple {8241#true} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {8241#true} is VALID [2022-04-15 07:38:54,020 INFO L290 TraceCheckUtils]: 17: Hoare triple {8241#true} ~v~0 := 2 * ~Y~0 - ~X~0;~y~0 := 0;~x~0 := 0; {8241#true} is VALID [2022-04-15 07:38:54,020 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {8241#true} {8241#true} #63#return; {8241#true} is VALID [2022-04-15 07:38:54,020 INFO L290 TraceCheckUtils]: 15: Hoare triple {8241#true} assume true; {8241#true} is VALID [2022-04-15 07:38:54,020 INFO L290 TraceCheckUtils]: 14: Hoare triple {8241#true} assume !(0 == ~cond); {8241#true} is VALID [2022-04-15 07:38:54,020 INFO L290 TraceCheckUtils]: 13: Hoare triple {8241#true} ~cond := #in~cond; {8241#true} is VALID [2022-04-15 07:38:54,021 INFO L272 TraceCheckUtils]: 12: Hoare triple {8241#true} call assume_abort_if_not((if ~Y~0 >= 0 && ~Y~0 <= 10 then 1 else 0)); {8241#true} is VALID [2022-04-15 07:38:54,021 INFO L290 TraceCheckUtils]: 11: Hoare triple {8241#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~Y~0 := #t~nondet5;havoc #t~nondet5; {8241#true} is VALID [2022-04-15 07:38:54,021 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {8241#true} {8241#true} #61#return; {8241#true} is VALID [2022-04-15 07:38:54,021 INFO L290 TraceCheckUtils]: 9: Hoare triple {8241#true} assume true; {8241#true} is VALID [2022-04-15 07:38:54,021 INFO L290 TraceCheckUtils]: 8: Hoare triple {8241#true} assume !(0 == ~cond); {8241#true} is VALID [2022-04-15 07:38:54,021 INFO L290 TraceCheckUtils]: 7: Hoare triple {8241#true} ~cond := #in~cond; {8241#true} is VALID [2022-04-15 07:38:54,021 INFO L272 TraceCheckUtils]: 6: Hoare triple {8241#true} call assume_abort_if_not((if ~X~0 >= 0 && ~X~0 <= 10 then 1 else 0)); {8241#true} is VALID [2022-04-15 07:38:54,021 INFO L290 TraceCheckUtils]: 5: Hoare triple {8241#true} havoc ~X~0;havoc ~Y~0;havoc ~x~0;havoc ~y~0;havoc ~v~0;havoc ~xy~0;havoc ~yx~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~X~0 := #t~nondet4;havoc #t~nondet4; {8241#true} is VALID [2022-04-15 07:38:54,021 INFO L272 TraceCheckUtils]: 4: Hoare triple {8241#true} call #t~ret8 := main(); {8241#true} is VALID [2022-04-15 07:38:54,021 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8241#true} {8241#true} #69#return; {8241#true} is VALID [2022-04-15 07:38:54,022 INFO L290 TraceCheckUtils]: 2: Hoare triple {8241#true} assume true; {8241#true} is VALID [2022-04-15 07:38:54,022 INFO L290 TraceCheckUtils]: 1: Hoare triple {8241#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(15, 2);call #Ultimate.allocInit(12, 3); {8241#true} is VALID [2022-04-15 07:38:54,022 INFO L272 TraceCheckUtils]: 0: Hoare triple {8241#true} call ULTIMATE.init(); {8241#true} is VALID [2022-04-15 07:38:54,022 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 24 proven. 2 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-04-15 07:38:54,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:38:54,022 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1684460546] [2022-04-15 07:38:54,022 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 07:38:54,022 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [277995295] [2022-04-15 07:38:54,022 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [277995295] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 07:38:54,023 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 07:38:54,023 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 10] total 21 [2022-04-15 07:38:54,023 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:38:54,023 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1185885914] [2022-04-15 07:38:54,023 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1185885914] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:38:54,023 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:38:54,023 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-04-15 07:38:54,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1796396869] [2022-04-15 07:38:54,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:38:54,024 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 15 states have internal predecessors, (30), 5 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) Word has length 50 [2022-04-15 07:38:54,024 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:38:54,024 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 16 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 15 states have internal predecessors, (30), 5 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-15 07:38:56,066 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-15 07:38:56,067 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-15 07:38:56,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:38:56,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-15 07:38:56,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=365, Unknown=0, NotChecked=0, Total=420 [2022-04-15 07:38:56,067 INFO L87 Difference]: Start difference. First operand 88 states and 95 transitions. Second operand has 16 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 15 states have internal predecessors, (30), 5 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-15 07:38:59,527 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-15 07:39:02,010 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-15 07:39:04,107 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-15 07:39:06,565 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-15 07:39:12,813 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-15 07:39:14,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:39:14,143 INFO L93 Difference]: Finished difference Result 106 states and 117 transitions. [2022-04-15 07:39:14,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-15 07:39:14,143 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 15 states have internal predecessors, (30), 5 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) Word has length 50 [2022-04-15 07:39:14,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:39:14,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 15 states have internal predecessors, (30), 5 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-15 07:39:14,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 65 transitions. [2022-04-15 07:39:14,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 15 states have internal predecessors, (30), 5 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-15 07:39:14,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 65 transitions. [2022-04-15 07:39:14,145 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 65 transitions. [2022-04-15 07:39:16,221 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 64 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-15 07:39:16,223 INFO L225 Difference]: With dead ends: 106 [2022-04-15 07:39:16,223 INFO L226 Difference]: Without dead ends: 104 [2022-04-15 07:39:16,223 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 78 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=88, Invalid=562, Unknown=0, NotChecked=0, Total=650 [2022-04-15 07:39:16,223 INFO L913 BasicCegarLoop]: 29 mSDtfsCounter, 21 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 425 mSolverCounterSat, 7 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 213 SdHoareTripleChecker+Invalid, 437 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 425 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.5s IncrementalHoareTripleChecker+Time [2022-04-15 07:39:16,224 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 213 Invalid, 437 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 425 Invalid, 5 Unknown, 0 Unchecked, 12.5s Time] [2022-04-15 07:39:16,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2022-04-15 07:39:16,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 100. [2022-04-15 07:39:16,403 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:39:16,404 INFO L82 GeneralOperation]: Start isEquivalent. First operand 104 states. Second operand has 100 states, 73 states have (on average 1.1095890410958904) internal successors, (81), 75 states have internal predecessors, (81), 15 states have call successors, (15), 12 states have call predecessors, (15), 11 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-15 07:39:16,404 INFO L74 IsIncluded]: Start isIncluded. First operand 104 states. Second operand has 100 states, 73 states have (on average 1.1095890410958904) internal successors, (81), 75 states have internal predecessors, (81), 15 states have call successors, (15), 12 states have call predecessors, (15), 11 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-15 07:39:16,404 INFO L87 Difference]: Start difference. First operand 104 states. Second operand has 100 states, 73 states have (on average 1.1095890410958904) internal successors, (81), 75 states have internal predecessors, (81), 15 states have call successors, (15), 12 states have call predecessors, (15), 11 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-15 07:39:16,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:39:16,405 INFO L93 Difference]: Finished difference Result 104 states and 115 transitions. [2022-04-15 07:39:16,406 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 115 transitions. [2022-04-15 07:39:16,406 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:39:16,406 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:39:16,406 INFO L74 IsIncluded]: Start isIncluded. First operand has 100 states, 73 states have (on average 1.1095890410958904) internal successors, (81), 75 states have internal predecessors, (81), 15 states have call successors, (15), 12 states have call predecessors, (15), 11 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) Second operand 104 states. [2022-04-15 07:39:16,406 INFO L87 Difference]: Start difference. First operand has 100 states, 73 states have (on average 1.1095890410958904) internal successors, (81), 75 states have internal predecessors, (81), 15 states have call successors, (15), 12 states have call predecessors, (15), 11 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) Second operand 104 states. [2022-04-15 07:39:16,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:39:16,408 INFO L93 Difference]: Finished difference Result 104 states and 115 transitions. [2022-04-15 07:39:16,408 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 115 transitions. [2022-04-15 07:39:16,408 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:39:16,408 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:39:16,408 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:39:16,408 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:39:16,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 73 states have (on average 1.1095890410958904) internal successors, (81), 75 states have internal predecessors, (81), 15 states have call successors, (15), 12 states have call predecessors, (15), 11 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-15 07:39:16,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 109 transitions. [2022-04-15 07:39:16,410 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 109 transitions. Word has length 50 [2022-04-15 07:39:16,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:39:16,410 INFO L478 AbstractCegarLoop]: Abstraction has 100 states and 109 transitions. [2022-04-15 07:39:16,410 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 15 states have internal predecessors, (30), 5 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-15 07:39:16,410 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 100 states and 109 transitions. [2022-04-15 07:39:18,626 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 109 edges. 108 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-15 07:39:18,626 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 109 transitions. [2022-04-15 07:39:18,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-04-15 07:39:18,626 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:39:18,626 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 07:39:18,642 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-15 07:39:18,827 WARN L460 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-15 07:39:18,827 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:39:18,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:39:18,828 INFO L85 PathProgramCache]: Analyzing trace with hash 290900977, now seen corresponding path program 9 times [2022-04-15 07:39:18,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:39:18,828 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [610708086] [2022-04-15 07:39:18,828 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 07:39:18,828 INFO L85 PathProgramCache]: Analyzing trace with hash 290900977, now seen corresponding path program 10 times [2022-04-15 07:39:18,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:39:18,828 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1142693575] [2022-04-15 07:39:18,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:39:18,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:39:18,838 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 07:39:18,839 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1434351790] [2022-04-15 07:39:18,839 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 07:39:18,839 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 07:39:18,839 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 07:39:18,840 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-15 07:39:18,843 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-15 07:39:18,875 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 07:39:18,875 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 07:39:18,876 INFO L263 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-15 07:39:18,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:39:18,884 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 07:39:19,161 INFO L272 TraceCheckUtils]: 0: Hoare triple {9191#true} call ULTIMATE.init(); {9191#true} is VALID [2022-04-15 07:39:19,162 INFO L290 TraceCheckUtils]: 1: Hoare triple {9191#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(15, 2);call #Ultimate.allocInit(12, 3); {9191#true} is VALID [2022-04-15 07:39:19,162 INFO L290 TraceCheckUtils]: 2: Hoare triple {9191#true} assume true; {9191#true} is VALID [2022-04-15 07:39:19,162 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9191#true} {9191#true} #69#return; {9191#true} is VALID [2022-04-15 07:39:19,162 INFO L272 TraceCheckUtils]: 4: Hoare triple {9191#true} call #t~ret8 := main(); {9191#true} is VALID [2022-04-15 07:39:19,162 INFO L290 TraceCheckUtils]: 5: Hoare triple {9191#true} havoc ~X~0;havoc ~Y~0;havoc ~x~0;havoc ~y~0;havoc ~v~0;havoc ~xy~0;havoc ~yx~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~X~0 := #t~nondet4;havoc #t~nondet4; {9191#true} is VALID [2022-04-15 07:39:19,162 INFO L272 TraceCheckUtils]: 6: Hoare triple {9191#true} call assume_abort_if_not((if ~X~0 >= 0 && ~X~0 <= 10 then 1 else 0)); {9191#true} is VALID [2022-04-15 07:39:19,162 INFO L290 TraceCheckUtils]: 7: Hoare triple {9191#true} ~cond := #in~cond; {9191#true} is VALID [2022-04-15 07:39:19,162 INFO L290 TraceCheckUtils]: 8: Hoare triple {9191#true} assume !(0 == ~cond); {9191#true} is VALID [2022-04-15 07:39:19,162 INFO L290 TraceCheckUtils]: 9: Hoare triple {9191#true} assume true; {9191#true} is VALID [2022-04-15 07:39:19,162 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {9191#true} {9191#true} #61#return; {9191#true} is VALID [2022-04-15 07:39:19,162 INFO L290 TraceCheckUtils]: 11: Hoare triple {9191#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~Y~0 := #t~nondet5;havoc #t~nondet5; {9191#true} is VALID [2022-04-15 07:39:19,162 INFO L272 TraceCheckUtils]: 12: Hoare triple {9191#true} call assume_abort_if_not((if ~Y~0 >= 0 && ~Y~0 <= 10 then 1 else 0)); {9191#true} is VALID [2022-04-15 07:39:19,163 INFO L290 TraceCheckUtils]: 13: Hoare triple {9191#true} ~cond := #in~cond; {9191#true} is VALID [2022-04-15 07:39:19,163 INFO L290 TraceCheckUtils]: 14: Hoare triple {9191#true} assume !(0 == ~cond); {9191#true} is VALID [2022-04-15 07:39:19,163 INFO L290 TraceCheckUtils]: 15: Hoare triple {9191#true} assume true; {9191#true} is VALID [2022-04-15 07:39:19,163 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {9191#true} {9191#true} #63#return; {9191#true} is VALID [2022-04-15 07:39:19,166 INFO L290 TraceCheckUtils]: 17: Hoare triple {9191#true} ~v~0 := 2 * ~Y~0 - ~X~0;~y~0 := 0;~x~0 := 0; {9247#(<= (* main_~Y~0 2) (+ main_~X~0 main_~v~0))} is VALID [2022-04-15 07:39:19,166 INFO L290 TraceCheckUtils]: 18: Hoare triple {9247#(<= (* main_~Y~0 2) (+ main_~X~0 main_~v~0))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {9247#(<= (* main_~Y~0 2) (+ main_~X~0 main_~v~0))} is VALID [2022-04-15 07:39:19,166 INFO L272 TraceCheckUtils]: 19: Hoare triple {9247#(<= (* main_~Y~0 2) (+ main_~X~0 main_~v~0))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {9191#true} is VALID [2022-04-15 07:39:19,166 INFO L290 TraceCheckUtils]: 20: Hoare triple {9191#true} ~cond := #in~cond; {9191#true} is VALID [2022-04-15 07:39:19,166 INFO L290 TraceCheckUtils]: 21: Hoare triple {9191#true} assume !(0 == ~cond); {9191#true} is VALID [2022-04-15 07:39:19,166 INFO L290 TraceCheckUtils]: 22: Hoare triple {9191#true} assume true; {9191#true} is VALID [2022-04-15 07:39:19,167 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {9191#true} {9247#(<= (* main_~Y~0 2) (+ main_~X~0 main_~v~0))} #65#return; {9247#(<= (* main_~Y~0 2) (+ main_~X~0 main_~v~0))} is VALID [2022-04-15 07:39:19,167 INFO L290 TraceCheckUtils]: 24: Hoare triple {9247#(<= (* main_~Y~0 2) (+ main_~X~0 main_~v~0))} assume !!(~x~0 <= ~X~0); {9247#(<= (* main_~Y~0 2) (+ main_~X~0 main_~v~0))} is VALID [2022-04-15 07:39:19,168 INFO L290 TraceCheckUtils]: 25: Hoare triple {9247#(<= (* main_~Y~0 2) (+ main_~X~0 main_~v~0))} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {9272#(and (< (* main_~Y~0 2) main_~X~0) (< main_~v~0 (* main_~Y~0 2)))} is VALID [2022-04-15 07:39:19,168 INFO L290 TraceCheckUtils]: 26: Hoare triple {9272#(and (< (* main_~Y~0 2) main_~X~0) (< main_~v~0 (* main_~Y~0 2)))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {9272#(and (< (* main_~Y~0 2) main_~X~0) (< main_~v~0 (* main_~Y~0 2)))} is VALID [2022-04-15 07:39:19,169 INFO L290 TraceCheckUtils]: 27: Hoare triple {9272#(and (< (* main_~Y~0 2) main_~X~0) (< main_~v~0 (* main_~Y~0 2)))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {9272#(and (< (* main_~Y~0 2) main_~X~0) (< main_~v~0 (* main_~Y~0 2)))} is VALID [2022-04-15 07:39:19,169 INFO L272 TraceCheckUtils]: 28: Hoare triple {9272#(and (< (* main_~Y~0 2) main_~X~0) (< main_~v~0 (* main_~Y~0 2)))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {9191#true} is VALID [2022-04-15 07:39:19,169 INFO L290 TraceCheckUtils]: 29: Hoare triple {9191#true} ~cond := #in~cond; {9191#true} is VALID [2022-04-15 07:39:19,169 INFO L290 TraceCheckUtils]: 30: Hoare triple {9191#true} assume !(0 == ~cond); {9191#true} is VALID [2022-04-15 07:39:19,169 INFO L290 TraceCheckUtils]: 31: Hoare triple {9191#true} assume true; {9191#true} is VALID [2022-04-15 07:39:19,170 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {9191#true} {9272#(and (< (* main_~Y~0 2) main_~X~0) (< main_~v~0 (* main_~Y~0 2)))} #65#return; {9272#(and (< (* main_~Y~0 2) main_~X~0) (< main_~v~0 (* main_~Y~0 2)))} is VALID [2022-04-15 07:39:19,170 INFO L290 TraceCheckUtils]: 33: Hoare triple {9272#(and (< (* main_~Y~0 2) main_~X~0) (< main_~v~0 (* main_~Y~0 2)))} assume !!(~x~0 <= ~X~0); {9272#(and (< (* main_~Y~0 2) main_~X~0) (< main_~v~0 (* main_~Y~0 2)))} is VALID [2022-04-15 07:39:19,171 INFO L290 TraceCheckUtils]: 34: Hoare triple {9272#(and (< (* main_~Y~0 2) main_~X~0) (< main_~v~0 (* main_~Y~0 2)))} assume !(~v~0 < 0);~v~0 := ~v~0 + 2 * (~Y~0 - ~X~0);#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {9300#(< 0 (div (+ (- 1) (* (- 1) main_~v~0)) 2))} is VALID [2022-04-15 07:39:19,171 INFO L290 TraceCheckUtils]: 35: Hoare triple {9300#(< 0 (div (+ (- 1) (* (- 1) main_~v~0)) 2))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {9300#(< 0 (div (+ (- 1) (* (- 1) main_~v~0)) 2))} is VALID [2022-04-15 07:39:19,171 INFO L290 TraceCheckUtils]: 36: Hoare triple {9300#(< 0 (div (+ (- 1) (* (- 1) main_~v~0)) 2))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {9300#(< 0 (div (+ (- 1) (* (- 1) main_~v~0)) 2))} is VALID [2022-04-15 07:39:19,172 INFO L272 TraceCheckUtils]: 37: Hoare triple {9300#(< 0 (div (+ (- 1) (* (- 1) main_~v~0)) 2))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {9191#true} is VALID [2022-04-15 07:39:19,172 INFO L290 TraceCheckUtils]: 38: Hoare triple {9191#true} ~cond := #in~cond; {9191#true} is VALID [2022-04-15 07:39:19,172 INFO L290 TraceCheckUtils]: 39: Hoare triple {9191#true} assume !(0 == ~cond); {9191#true} is VALID [2022-04-15 07:39:19,172 INFO L290 TraceCheckUtils]: 40: Hoare triple {9191#true} assume true; {9191#true} is VALID [2022-04-15 07:39:19,172 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {9191#true} {9300#(< 0 (div (+ (- 1) (* (- 1) main_~v~0)) 2))} #65#return; {9300#(< 0 (div (+ (- 1) (* (- 1) main_~v~0)) 2))} is VALID [2022-04-15 07:39:19,173 INFO L290 TraceCheckUtils]: 42: Hoare triple {9300#(< 0 (div (+ (- 1) (* (- 1) main_~v~0)) 2))} assume !!(~x~0 <= ~X~0); {9300#(< 0 (div (+ (- 1) (* (- 1) main_~v~0)) 2))} is VALID [2022-04-15 07:39:19,173 INFO L290 TraceCheckUtils]: 43: Hoare triple {9300#(< 0 (div (+ (- 1) (* (- 1) main_~v~0)) 2))} assume !(~v~0 < 0);~v~0 := ~v~0 + 2 * (~Y~0 - ~X~0);#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {9192#false} is VALID [2022-04-15 07:39:19,173 INFO L290 TraceCheckUtils]: 44: Hoare triple {9192#false} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {9192#false} is VALID [2022-04-15 07:39:19,174 INFO L290 TraceCheckUtils]: 45: Hoare triple {9192#false} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {9192#false} is VALID [2022-04-15 07:39:19,174 INFO L272 TraceCheckUtils]: 46: Hoare triple {9192#false} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {9192#false} is VALID [2022-04-15 07:39:19,174 INFO L290 TraceCheckUtils]: 47: Hoare triple {9192#false} ~cond := #in~cond; {9192#false} is VALID [2022-04-15 07:39:19,174 INFO L290 TraceCheckUtils]: 48: Hoare triple {9192#false} assume 0 == ~cond; {9192#false} is VALID [2022-04-15 07:39:19,174 INFO L290 TraceCheckUtils]: 49: Hoare triple {9192#false} assume !false; {9192#false} is VALID [2022-04-15 07:39:19,174 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 14 proven. 13 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-04-15 07:39:19,174 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 07:39:19,360 INFO L290 TraceCheckUtils]: 49: Hoare triple {9192#false} assume !false; {9192#false} is VALID [2022-04-15 07:39:19,360 INFO L290 TraceCheckUtils]: 48: Hoare triple {9192#false} assume 0 == ~cond; {9192#false} is VALID [2022-04-15 07:39:19,360 INFO L290 TraceCheckUtils]: 47: Hoare triple {9192#false} ~cond := #in~cond; {9192#false} is VALID [2022-04-15 07:39:19,360 INFO L272 TraceCheckUtils]: 46: Hoare triple {9192#false} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {9192#false} is VALID [2022-04-15 07:39:19,360 INFO L290 TraceCheckUtils]: 45: Hoare triple {9192#false} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {9192#false} is VALID [2022-04-15 07:39:19,361 INFO L290 TraceCheckUtils]: 44: Hoare triple {9192#false} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {9192#false} is VALID [2022-04-15 07:39:19,361 INFO L290 TraceCheckUtils]: 43: Hoare triple {9364#(< main_~v~0 0)} assume !(~v~0 < 0);~v~0 := ~v~0 + 2 * (~Y~0 - ~X~0);#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {9192#false} is VALID [2022-04-15 07:39:19,361 INFO L290 TraceCheckUtils]: 42: Hoare triple {9364#(< main_~v~0 0)} assume !!(~x~0 <= ~X~0); {9364#(< main_~v~0 0)} is VALID [2022-04-15 07:39:19,362 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {9191#true} {9364#(< main_~v~0 0)} #65#return; {9364#(< main_~v~0 0)} is VALID [2022-04-15 07:39:19,362 INFO L290 TraceCheckUtils]: 40: Hoare triple {9191#true} assume true; {9191#true} is VALID [2022-04-15 07:39:19,362 INFO L290 TraceCheckUtils]: 39: Hoare triple {9191#true} assume !(0 == ~cond); {9191#true} is VALID [2022-04-15 07:39:19,362 INFO L290 TraceCheckUtils]: 38: Hoare triple {9191#true} ~cond := #in~cond; {9191#true} is VALID [2022-04-15 07:39:19,362 INFO L272 TraceCheckUtils]: 37: Hoare triple {9364#(< main_~v~0 0)} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {9191#true} is VALID [2022-04-15 07:39:19,362 INFO L290 TraceCheckUtils]: 36: Hoare triple {9364#(< main_~v~0 0)} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {9364#(< main_~v~0 0)} is VALID [2022-04-15 07:39:19,363 INFO L290 TraceCheckUtils]: 35: Hoare triple {9364#(< main_~v~0 0)} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {9364#(< main_~v~0 0)} is VALID [2022-04-15 07:39:19,363 INFO L290 TraceCheckUtils]: 34: Hoare triple {9392#(< (+ main_~v~0 (* main_~Y~0 2)) (* main_~X~0 2))} assume !(~v~0 < 0);~v~0 := ~v~0 + 2 * (~Y~0 - ~X~0);#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {9364#(< main_~v~0 0)} is VALID [2022-04-15 07:39:19,364 INFO L290 TraceCheckUtils]: 33: Hoare triple {9392#(< (+ main_~v~0 (* main_~Y~0 2)) (* main_~X~0 2))} assume !!(~x~0 <= ~X~0); {9392#(< (+ main_~v~0 (* main_~Y~0 2)) (* main_~X~0 2))} is VALID [2022-04-15 07:39:19,364 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {9191#true} {9392#(< (+ main_~v~0 (* main_~Y~0 2)) (* main_~X~0 2))} #65#return; {9392#(< (+ main_~v~0 (* main_~Y~0 2)) (* main_~X~0 2))} is VALID [2022-04-15 07:39:19,364 INFO L290 TraceCheckUtils]: 31: Hoare triple {9191#true} assume true; {9191#true} is VALID [2022-04-15 07:39:19,364 INFO L290 TraceCheckUtils]: 30: Hoare triple {9191#true} assume !(0 == ~cond); {9191#true} is VALID [2022-04-15 07:39:19,364 INFO L290 TraceCheckUtils]: 29: Hoare triple {9191#true} ~cond := #in~cond; {9191#true} is VALID [2022-04-15 07:39:19,364 INFO L272 TraceCheckUtils]: 28: Hoare triple {9392#(< (+ main_~v~0 (* main_~Y~0 2)) (* main_~X~0 2))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {9191#true} is VALID [2022-04-15 07:39:19,365 INFO L290 TraceCheckUtils]: 27: Hoare triple {9392#(< (+ main_~v~0 (* main_~Y~0 2)) (* main_~X~0 2))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {9392#(< (+ main_~v~0 (* main_~Y~0 2)) (* main_~X~0 2))} is VALID [2022-04-15 07:39:19,365 INFO L290 TraceCheckUtils]: 26: Hoare triple {9392#(< (+ main_~v~0 (* main_~Y~0 2)) (* main_~X~0 2))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {9392#(< (+ main_~v~0 (* main_~Y~0 2)) (* main_~X~0 2))} is VALID [2022-04-15 07:39:19,365 INFO L290 TraceCheckUtils]: 25: Hoare triple {9420#(or (< (+ main_~v~0 (* main_~Y~0 4)) (* main_~X~0 2)) (not (< main_~v~0 0)))} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {9392#(< (+ main_~v~0 (* main_~Y~0 2)) (* main_~X~0 2))} is VALID [2022-04-15 07:39:19,366 INFO L290 TraceCheckUtils]: 24: Hoare triple {9420#(or (< (+ main_~v~0 (* main_~Y~0 4)) (* main_~X~0 2)) (not (< main_~v~0 0)))} assume !!(~x~0 <= ~X~0); {9420#(or (< (+ main_~v~0 (* main_~Y~0 4)) (* main_~X~0 2)) (not (< main_~v~0 0)))} is VALID [2022-04-15 07:39:19,366 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {9191#true} {9420#(or (< (+ main_~v~0 (* main_~Y~0 4)) (* main_~X~0 2)) (not (< main_~v~0 0)))} #65#return; {9420#(or (< (+ main_~v~0 (* main_~Y~0 4)) (* main_~X~0 2)) (not (< main_~v~0 0)))} is VALID [2022-04-15 07:39:19,366 INFO L290 TraceCheckUtils]: 22: Hoare triple {9191#true} assume true; {9191#true} is VALID [2022-04-15 07:39:19,366 INFO L290 TraceCheckUtils]: 21: Hoare triple {9191#true} assume !(0 == ~cond); {9191#true} is VALID [2022-04-15 07:39:19,367 INFO L290 TraceCheckUtils]: 20: Hoare triple {9191#true} ~cond := #in~cond; {9191#true} is VALID [2022-04-15 07:39:19,367 INFO L272 TraceCheckUtils]: 19: Hoare triple {9420#(or (< (+ main_~v~0 (* main_~Y~0 4)) (* main_~X~0 2)) (not (< main_~v~0 0)))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {9191#true} is VALID [2022-04-15 07:39:19,367 INFO L290 TraceCheckUtils]: 18: Hoare triple {9420#(or (< (+ main_~v~0 (* main_~Y~0 4)) (* main_~X~0 2)) (not (< main_~v~0 0)))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {9420#(or (< (+ main_~v~0 (* main_~Y~0 4)) (* main_~X~0 2)) (not (< main_~v~0 0)))} is VALID [2022-04-15 07:39:19,368 INFO L290 TraceCheckUtils]: 17: Hoare triple {9191#true} ~v~0 := 2 * ~Y~0 - ~X~0;~y~0 := 0;~x~0 := 0; {9420#(or (< (+ main_~v~0 (* main_~Y~0 4)) (* main_~X~0 2)) (not (< main_~v~0 0)))} is VALID [2022-04-15 07:39:19,368 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {9191#true} {9191#true} #63#return; {9191#true} is VALID [2022-04-15 07:39:19,368 INFO L290 TraceCheckUtils]: 15: Hoare triple {9191#true} assume true; {9191#true} is VALID [2022-04-15 07:39:19,368 INFO L290 TraceCheckUtils]: 14: Hoare triple {9191#true} assume !(0 == ~cond); {9191#true} is VALID [2022-04-15 07:39:19,368 INFO L290 TraceCheckUtils]: 13: Hoare triple {9191#true} ~cond := #in~cond; {9191#true} is VALID [2022-04-15 07:39:19,368 INFO L272 TraceCheckUtils]: 12: Hoare triple {9191#true} call assume_abort_if_not((if ~Y~0 >= 0 && ~Y~0 <= 10 then 1 else 0)); {9191#true} is VALID [2022-04-15 07:39:19,368 INFO L290 TraceCheckUtils]: 11: Hoare triple {9191#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~Y~0 := #t~nondet5;havoc #t~nondet5; {9191#true} is VALID [2022-04-15 07:39:19,368 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {9191#true} {9191#true} #61#return; {9191#true} is VALID [2022-04-15 07:39:19,368 INFO L290 TraceCheckUtils]: 9: Hoare triple {9191#true} assume true; {9191#true} is VALID [2022-04-15 07:39:19,368 INFO L290 TraceCheckUtils]: 8: Hoare triple {9191#true} assume !(0 == ~cond); {9191#true} is VALID [2022-04-15 07:39:19,368 INFO L290 TraceCheckUtils]: 7: Hoare triple {9191#true} ~cond := #in~cond; {9191#true} is VALID [2022-04-15 07:39:19,368 INFO L272 TraceCheckUtils]: 6: Hoare triple {9191#true} call assume_abort_if_not((if ~X~0 >= 0 && ~X~0 <= 10 then 1 else 0)); {9191#true} is VALID [2022-04-15 07:39:19,369 INFO L290 TraceCheckUtils]: 5: Hoare triple {9191#true} havoc ~X~0;havoc ~Y~0;havoc ~x~0;havoc ~y~0;havoc ~v~0;havoc ~xy~0;havoc ~yx~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~X~0 := #t~nondet4;havoc #t~nondet4; {9191#true} is VALID [2022-04-15 07:39:19,369 INFO L272 TraceCheckUtils]: 4: Hoare triple {9191#true} call #t~ret8 := main(); {9191#true} is VALID [2022-04-15 07:39:19,369 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9191#true} {9191#true} #69#return; {9191#true} is VALID [2022-04-15 07:39:19,369 INFO L290 TraceCheckUtils]: 2: Hoare triple {9191#true} assume true; {9191#true} is VALID [2022-04-15 07:39:19,369 INFO L290 TraceCheckUtils]: 1: Hoare triple {9191#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(15, 2);call #Ultimate.allocInit(12, 3); {9191#true} is VALID [2022-04-15 07:39:19,369 INFO L272 TraceCheckUtils]: 0: Hoare triple {9191#true} call ULTIMATE.init(); {9191#true} is VALID [2022-04-15 07:39:19,369 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 14 proven. 13 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-04-15 07:39:19,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:39:19,369 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1142693575] [2022-04-15 07:39:19,369 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 07:39:19,369 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1434351790] [2022-04-15 07:39:19,370 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1434351790] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 07:39:19,370 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 07:39:19,370 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2022-04-15 07:39:19,370 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:39:19,370 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [610708086] [2022-04-15 07:39:19,370 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [610708086] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:39:19,370 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:39:19,370 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 07:39:19,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1288956948] [2022-04-15 07:39:19,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:39:19,370 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 5 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) Word has length 50 [2022-04-15 07:39:19,371 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:39:19,371 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 5 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-15 07:39:19,399 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-15 07:39:19,399 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 07:39:19,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:39:19,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 07:39:19,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-04-15 07:39:19,399 INFO L87 Difference]: Start difference. First operand 100 states and 109 transitions. Second operand has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 5 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-15 07:39:19,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:39:19,850 INFO L93 Difference]: Finished difference Result 131 states and 149 transitions. [2022-04-15 07:39:19,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 07:39:19,850 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 5 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) Word has length 50 [2022-04-15 07:39:19,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:39:19,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 5 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-15 07:39:19,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 71 transitions. [2022-04-15 07:39:19,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 5 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-15 07:39:19,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 71 transitions. [2022-04-15 07:39:19,852 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 71 transitions. [2022-04-15 07:39:19,908 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:39:19,909 INFO L225 Difference]: With dead ends: 131 [2022-04-15 07:39:19,909 INFO L226 Difference]: Without dead ends: 118 [2022-04-15 07:39:19,909 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2022-04-15 07:39:19,910 INFO L913 BasicCegarLoop]: 34 mSDtfsCounter, 4 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 07:39:19,910 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 91 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 07:39:19,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2022-04-15 07:39:20,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 113. [2022-04-15 07:39:20,156 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:39:20,156 INFO L82 GeneralOperation]: Start isEquivalent. First operand 118 states. Second operand has 113 states, 83 states have (on average 1.1204819277108433) internal successors, (93), 85 states have internal predecessors, (93), 18 states have call successors, (18), 12 states have call predecessors, (18), 11 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-15 07:39:20,156 INFO L74 IsIncluded]: Start isIncluded. First operand 118 states. Second operand has 113 states, 83 states have (on average 1.1204819277108433) internal successors, (93), 85 states have internal predecessors, (93), 18 states have call successors, (18), 12 states have call predecessors, (18), 11 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-15 07:39:20,156 INFO L87 Difference]: Start difference. First operand 118 states. Second operand has 113 states, 83 states have (on average 1.1204819277108433) internal successors, (93), 85 states have internal predecessors, (93), 18 states have call successors, (18), 12 states have call predecessors, (18), 11 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-15 07:39:20,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:39:20,158 INFO L93 Difference]: Finished difference Result 118 states and 132 transitions. [2022-04-15 07:39:20,158 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 132 transitions. [2022-04-15 07:39:20,159 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:39:20,159 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:39:20,159 INFO L74 IsIncluded]: Start isIncluded. First operand has 113 states, 83 states have (on average 1.1204819277108433) internal successors, (93), 85 states have internal predecessors, (93), 18 states have call successors, (18), 12 states have call predecessors, (18), 11 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) Second operand 118 states. [2022-04-15 07:39:20,159 INFO L87 Difference]: Start difference. First operand has 113 states, 83 states have (on average 1.1204819277108433) internal successors, (93), 85 states have internal predecessors, (93), 18 states have call successors, (18), 12 states have call predecessors, (18), 11 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) Second operand 118 states. [2022-04-15 07:39:20,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:39:20,161 INFO L93 Difference]: Finished difference Result 118 states and 132 transitions. [2022-04-15 07:39:20,161 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 132 transitions. [2022-04-15 07:39:20,162 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:39:20,162 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:39:20,162 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:39:20,162 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:39:20,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 83 states have (on average 1.1204819277108433) internal successors, (93), 85 states have internal predecessors, (93), 18 states have call successors, (18), 12 states have call predecessors, (18), 11 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-15 07:39:20,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 127 transitions. [2022-04-15 07:39:20,164 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 127 transitions. Word has length 50 [2022-04-15 07:39:20,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:39:20,164 INFO L478 AbstractCegarLoop]: Abstraction has 113 states and 127 transitions. [2022-04-15 07:39:20,165 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 5 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-15 07:39:20,165 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 113 states and 127 transitions. [2022-04-15 07:39:22,441 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 127 edges. 126 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-15 07:39:22,441 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 127 transitions. [2022-04-15 07:39:22,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-04-15 07:39:22,441 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:39:22,442 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 07:39:22,457 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-04-15 07:39:22,643 WARN L460 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-15 07:39:22,643 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:39:22,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:39:22,644 INFO L85 PathProgramCache]: Analyzing trace with hash 1452517941, now seen corresponding path program 11 times [2022-04-15 07:39:22,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:39:22,644 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [13383108] [2022-04-15 07:39:22,644 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 07:39:22,644 INFO L85 PathProgramCache]: Analyzing trace with hash 1452517941, now seen corresponding path program 12 times [2022-04-15 07:39:22,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:39:22,644 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [535170694] [2022-04-15 07:39:22,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:39:22,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:39:22,653 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 07:39:22,653 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [535679625] [2022-04-15 07:39:22,653 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 07:39:22,654 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 07:39:22,654 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 07:39:22,654 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-15 07:39:22,655 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-15 07:39:22,698 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-04-15 07:39:22,698 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 07:39:22,699 INFO L263 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 37 conjunts are in the unsatisfiable core [2022-04-15 07:39:22,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:39:22,709 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 07:39:23,320 INFO L272 TraceCheckUtils]: 0: Hoare triple {10224#true} call ULTIMATE.init(); {10224#true} is VALID [2022-04-15 07:39:23,321 INFO L290 TraceCheckUtils]: 1: Hoare triple {10224#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(15, 2);call #Ultimate.allocInit(12, 3); {10224#true} is VALID [2022-04-15 07:39:23,321 INFO L290 TraceCheckUtils]: 2: Hoare triple {10224#true} assume true; {10224#true} is VALID [2022-04-15 07:39:23,321 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10224#true} {10224#true} #69#return; {10224#true} is VALID [2022-04-15 07:39:23,321 INFO L272 TraceCheckUtils]: 4: Hoare triple {10224#true} call #t~ret8 := main(); {10224#true} is VALID [2022-04-15 07:39:23,321 INFO L290 TraceCheckUtils]: 5: Hoare triple {10224#true} havoc ~X~0;havoc ~Y~0;havoc ~x~0;havoc ~y~0;havoc ~v~0;havoc ~xy~0;havoc ~yx~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~X~0 := #t~nondet4;havoc #t~nondet4; {10224#true} is VALID [2022-04-15 07:39:23,321 INFO L272 TraceCheckUtils]: 6: Hoare triple {10224#true} call assume_abort_if_not((if ~X~0 >= 0 && ~X~0 <= 10 then 1 else 0)); {10224#true} is VALID [2022-04-15 07:39:23,321 INFO L290 TraceCheckUtils]: 7: Hoare triple {10224#true} ~cond := #in~cond; {10224#true} is VALID [2022-04-15 07:39:23,321 INFO L290 TraceCheckUtils]: 8: Hoare triple {10224#true} assume !(0 == ~cond); {10224#true} is VALID [2022-04-15 07:39:23,321 INFO L290 TraceCheckUtils]: 9: Hoare triple {10224#true} assume true; {10224#true} is VALID [2022-04-15 07:39:23,321 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {10224#true} {10224#true} #61#return; {10224#true} is VALID [2022-04-15 07:39:23,321 INFO L290 TraceCheckUtils]: 11: Hoare triple {10224#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~Y~0 := #t~nondet5;havoc #t~nondet5; {10224#true} is VALID [2022-04-15 07:39:23,322 INFO L272 TraceCheckUtils]: 12: Hoare triple {10224#true} call assume_abort_if_not((if ~Y~0 >= 0 && ~Y~0 <= 10 then 1 else 0)); {10224#true} is VALID [2022-04-15 07:39:23,322 INFO L290 TraceCheckUtils]: 13: Hoare triple {10224#true} ~cond := #in~cond; {10268#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-15 07:39:23,322 INFO L290 TraceCheckUtils]: 14: Hoare triple {10268#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {10272#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 07:39:23,322 INFO L290 TraceCheckUtils]: 15: Hoare triple {10272#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {10272#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 07:39:23,323 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {10272#(not (= |assume_abort_if_not_#in~cond| 0))} {10224#true} #63#return; {10279#(and (<= 0 main_~Y~0) (<= main_~Y~0 10))} is VALID [2022-04-15 07:39:23,323 INFO L290 TraceCheckUtils]: 17: Hoare triple {10279#(and (<= 0 main_~Y~0) (<= main_~Y~0 10))} ~v~0 := 2 * ~Y~0 - ~X~0;~y~0 := 0;~x~0 := 0; {10283#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (<= 0 main_~Y~0) (= main_~y~0 0) (<= main_~Y~0 10))} is VALID [2022-04-15 07:39:23,327 INFO L290 TraceCheckUtils]: 18: Hoare triple {10283#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (<= 0 main_~Y~0) (= main_~y~0 0) (<= main_~Y~0 10))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {10283#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (<= 0 main_~Y~0) (= main_~y~0 0) (<= main_~Y~0 10))} is VALID [2022-04-15 07:39:23,327 INFO L272 TraceCheckUtils]: 19: Hoare triple {10283#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (<= 0 main_~Y~0) (= main_~y~0 0) (<= main_~Y~0 10))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {10224#true} is VALID [2022-04-15 07:39:23,327 INFO L290 TraceCheckUtils]: 20: Hoare triple {10224#true} ~cond := #in~cond; {10224#true} is VALID [2022-04-15 07:39:23,327 INFO L290 TraceCheckUtils]: 21: Hoare triple {10224#true} assume !(0 == ~cond); {10224#true} is VALID [2022-04-15 07:39:23,327 INFO L290 TraceCheckUtils]: 22: Hoare triple {10224#true} assume true; {10224#true} is VALID [2022-04-15 07:39:23,328 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {10224#true} {10283#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (<= 0 main_~Y~0) (= main_~y~0 0) (<= main_~Y~0 10))} #65#return; {10283#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (<= 0 main_~Y~0) (= main_~y~0 0) (<= main_~Y~0 10))} is VALID [2022-04-15 07:39:23,328 INFO L290 TraceCheckUtils]: 24: Hoare triple {10283#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (<= 0 main_~Y~0) (= main_~y~0 0) (<= main_~Y~0 10))} assume !!(~x~0 <= ~X~0); {10283#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (<= 0 main_~Y~0) (= main_~y~0 0) (<= main_~Y~0 10))} is VALID [2022-04-15 07:39:23,329 INFO L290 TraceCheckUtils]: 25: Hoare triple {10283#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (<= 0 main_~Y~0) (= main_~y~0 0) (<= main_~Y~0 10))} assume !(~v~0 < 0);~v~0 := ~v~0 + 2 * (~Y~0 - ~X~0);#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {10308#(and (= main_~x~0 0) (= (+ (- 1) main_~y~0) 0) (<= 0 main_~Y~0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) (+ main_~v~0 (* main_~X~0 2) (* (- 2) main_~Y~0))) (<= main_~Y~0 10))} is VALID [2022-04-15 07:39:23,329 INFO L290 TraceCheckUtils]: 26: Hoare triple {10308#(and (= main_~x~0 0) (= (+ (- 1) main_~y~0) 0) (<= 0 main_~Y~0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) (+ main_~v~0 (* main_~X~0 2) (* (- 2) main_~Y~0))) (<= main_~Y~0 10))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {10312#(and (= (+ (- 1) main_~x~0) 0) (= (+ (- 1) main_~y~0) 0) (<= 0 main_~Y~0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) (+ main_~v~0 (* main_~X~0 2) (* (- 2) main_~Y~0))) (<= main_~Y~0 10))} is VALID [2022-04-15 07:39:23,330 INFO L290 TraceCheckUtils]: 27: Hoare triple {10312#(and (= (+ (- 1) main_~x~0) 0) (= (+ (- 1) main_~y~0) 0) (<= 0 main_~Y~0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) (+ main_~v~0 (* main_~X~0 2) (* (- 2) main_~Y~0))) (<= main_~Y~0 10))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {10312#(and (= (+ (- 1) main_~x~0) 0) (= (+ (- 1) main_~y~0) 0) (<= 0 main_~Y~0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) (+ main_~v~0 (* main_~X~0 2) (* (- 2) main_~Y~0))) (<= main_~Y~0 10))} is VALID [2022-04-15 07:39:23,330 INFO L272 TraceCheckUtils]: 28: Hoare triple {10312#(and (= (+ (- 1) main_~x~0) 0) (= (+ (- 1) main_~y~0) 0) (<= 0 main_~Y~0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) (+ main_~v~0 (* main_~X~0 2) (* (- 2) main_~Y~0))) (<= main_~Y~0 10))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {10224#true} is VALID [2022-04-15 07:39:23,330 INFO L290 TraceCheckUtils]: 29: Hoare triple {10224#true} ~cond := #in~cond; {10224#true} is VALID [2022-04-15 07:39:23,330 INFO L290 TraceCheckUtils]: 30: Hoare triple {10224#true} assume !(0 == ~cond); {10224#true} is VALID [2022-04-15 07:39:23,330 INFO L290 TraceCheckUtils]: 31: Hoare triple {10224#true} assume true; {10224#true} is VALID [2022-04-15 07:39:23,331 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {10224#true} {10312#(and (= (+ (- 1) main_~x~0) 0) (= (+ (- 1) main_~y~0) 0) (<= 0 main_~Y~0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) (+ main_~v~0 (* main_~X~0 2) (* (- 2) main_~Y~0))) (<= main_~Y~0 10))} #65#return; {10312#(and (= (+ (- 1) main_~x~0) 0) (= (+ (- 1) main_~y~0) 0) (<= 0 main_~Y~0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) (+ main_~v~0 (* main_~X~0 2) (* (- 2) main_~Y~0))) (<= main_~Y~0 10))} is VALID [2022-04-15 07:39:23,331 INFO L290 TraceCheckUtils]: 33: Hoare triple {10312#(and (= (+ (- 1) main_~x~0) 0) (= (+ (- 1) main_~y~0) 0) (<= 0 main_~Y~0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) (+ main_~v~0 (* main_~X~0 2) (* (- 2) main_~Y~0))) (<= main_~Y~0 10))} assume !!(~x~0 <= ~X~0); {10312#(and (= (+ (- 1) main_~x~0) 0) (= (+ (- 1) main_~y~0) 0) (<= 0 main_~Y~0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) (+ main_~v~0 (* main_~X~0 2) (* (- 2) main_~Y~0))) (<= main_~Y~0 10))} is VALID [2022-04-15 07:39:23,332 INFO L290 TraceCheckUtils]: 34: Hoare triple {10312#(and (= (+ (- 1) main_~x~0) 0) (= (+ (- 1) main_~y~0) 0) (<= 0 main_~Y~0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) (+ main_~v~0 (* main_~X~0 2) (* (- 2) main_~Y~0))) (<= main_~Y~0 10))} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {10337#(and (< (* main_~Y~0 4) (* main_~X~0 3)) (= (+ (- 1) main_~x~0) 0) (= (+ (- 1) main_~y~0) 0) (= (+ (* main_~X~0 (- 3)) (* main_~Y~0 6)) main_~v~0) (<= 0 main_~Y~0) (<= main_~Y~0 10))} is VALID [2022-04-15 07:39:23,332 INFO L290 TraceCheckUtils]: 35: Hoare triple {10337#(and (< (* main_~Y~0 4) (* main_~X~0 3)) (= (+ (- 1) main_~x~0) 0) (= (+ (- 1) main_~y~0) 0) (= (+ (* main_~X~0 (- 3)) (* main_~Y~0 6)) main_~v~0) (<= 0 main_~Y~0) (<= main_~Y~0 10))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {10341#(and (< (* main_~Y~0 4) (* main_~X~0 3)) (= (+ (- 2) main_~x~0) 0) (= (+ (- 1) main_~y~0) 0) (= (+ (* main_~X~0 (- 3)) (* main_~Y~0 6)) main_~v~0) (<= 0 main_~Y~0) (<= main_~Y~0 10))} is VALID [2022-04-15 07:39:23,333 INFO L290 TraceCheckUtils]: 36: Hoare triple {10341#(and (< (* main_~Y~0 4) (* main_~X~0 3)) (= (+ (- 2) main_~x~0) 0) (= (+ (- 1) main_~y~0) 0) (= (+ (* main_~X~0 (- 3)) (* main_~Y~0 6)) main_~v~0) (<= 0 main_~Y~0) (<= main_~Y~0 10))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {10341#(and (< (* main_~Y~0 4) (* main_~X~0 3)) (= (+ (- 2) main_~x~0) 0) (= (+ (- 1) main_~y~0) 0) (= (+ (* main_~X~0 (- 3)) (* main_~Y~0 6)) main_~v~0) (<= 0 main_~Y~0) (<= main_~Y~0 10))} is VALID [2022-04-15 07:39:23,333 INFO L272 TraceCheckUtils]: 37: Hoare triple {10341#(and (< (* main_~Y~0 4) (* main_~X~0 3)) (= (+ (- 2) main_~x~0) 0) (= (+ (- 1) main_~y~0) 0) (= (+ (* main_~X~0 (- 3)) (* main_~Y~0 6)) main_~v~0) (<= 0 main_~Y~0) (<= main_~Y~0 10))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {10224#true} is VALID [2022-04-15 07:39:23,333 INFO L290 TraceCheckUtils]: 38: Hoare triple {10224#true} ~cond := #in~cond; {10224#true} is VALID [2022-04-15 07:39:23,333 INFO L290 TraceCheckUtils]: 39: Hoare triple {10224#true} assume !(0 == ~cond); {10224#true} is VALID [2022-04-15 07:39:23,333 INFO L290 TraceCheckUtils]: 40: Hoare triple {10224#true} assume true; {10224#true} is VALID [2022-04-15 07:39:23,334 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {10224#true} {10341#(and (< (* main_~Y~0 4) (* main_~X~0 3)) (= (+ (- 2) main_~x~0) 0) (= (+ (- 1) main_~y~0) 0) (= (+ (* main_~X~0 (- 3)) (* main_~Y~0 6)) main_~v~0) (<= 0 main_~Y~0) (<= main_~Y~0 10))} #65#return; {10341#(and (< (* main_~Y~0 4) (* main_~X~0 3)) (= (+ (- 2) main_~x~0) 0) (= (+ (- 1) main_~y~0) 0) (= (+ (* main_~X~0 (- 3)) (* main_~Y~0 6)) main_~v~0) (<= 0 main_~Y~0) (<= main_~Y~0 10))} is VALID [2022-04-15 07:39:23,334 INFO L290 TraceCheckUtils]: 42: Hoare triple {10341#(and (< (* main_~Y~0 4) (* main_~X~0 3)) (= (+ (- 2) main_~x~0) 0) (= (+ (- 1) main_~y~0) 0) (= (+ (* main_~X~0 (- 3)) (* main_~Y~0 6)) main_~v~0) (<= 0 main_~Y~0) (<= main_~Y~0 10))} assume !!(~x~0 <= ~X~0); {10341#(and (< (* main_~Y~0 4) (* main_~X~0 3)) (= (+ (- 2) main_~x~0) 0) (= (+ (- 1) main_~y~0) 0) (= (+ (* main_~X~0 (- 3)) (* main_~Y~0 6)) main_~v~0) (<= 0 main_~Y~0) (<= main_~Y~0 10))} is VALID [2022-04-15 07:39:23,335 INFO L290 TraceCheckUtils]: 43: Hoare triple {10341#(and (< (* main_~Y~0 4) (* main_~X~0 3)) (= (+ (- 2) main_~x~0) 0) (= (+ (- 1) main_~y~0) 0) (= (+ (* main_~X~0 (- 3)) (* main_~Y~0 6)) main_~v~0) (<= 0 main_~Y~0) (<= main_~Y~0 10))} assume !(~v~0 < 0);~v~0 := ~v~0 + 2 * (~Y~0 - ~X~0);#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {10366#(and (< (* main_~Y~0 4) (* main_~X~0 3)) (= (+ (- 2) main_~x~0) 0) (= (+ (- 2) main_~y~0) 0) (<= 0 main_~Y~0) (<= main_~Y~0 10) (= (+ (* main_~X~0 (- 3)) (* main_~Y~0 6)) (+ main_~v~0 (* main_~X~0 2) (* (- 2) main_~Y~0))))} is VALID [2022-04-15 07:39:23,335 INFO L290 TraceCheckUtils]: 44: Hoare triple {10366#(and (< (* main_~Y~0 4) (* main_~X~0 3)) (= (+ (- 2) main_~x~0) 0) (= (+ (- 2) main_~y~0) 0) (<= 0 main_~Y~0) (<= main_~Y~0 10) (= (+ (* main_~X~0 (- 3)) (* main_~Y~0 6)) (+ main_~v~0 (* main_~X~0 2) (* (- 2) main_~Y~0))))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {10370#(and (< (* main_~Y~0 4) (* main_~X~0 3)) (= (+ main_~x~0 (- 3)) 0) (= (+ (- 2) main_~y~0) 0) (<= 0 main_~Y~0) (<= main_~Y~0 10) (= (+ (* main_~X~0 (- 3)) (* main_~Y~0 6)) (+ main_~v~0 (* main_~X~0 2) (* (- 2) main_~Y~0))))} is VALID [2022-04-15 07:39:23,336 INFO L290 TraceCheckUtils]: 45: Hoare triple {10370#(and (< (* main_~Y~0 4) (* main_~X~0 3)) (= (+ main_~x~0 (- 3)) 0) (= (+ (- 2) main_~y~0) 0) (<= 0 main_~Y~0) (<= main_~Y~0 10) (= (+ (* main_~X~0 (- 3)) (* main_~Y~0 6)) (+ main_~v~0 (* main_~X~0 2) (* (- 2) main_~Y~0))))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {10374#(and (< (* main_~Y~0 4) (* main_~X~0 3)) (= main_~xy~0 (* main_~X~0 2)) (= (* main_~Y~0 3) main_~yx~0) (<= 0 main_~Y~0) (<= main_~Y~0 10) (= (+ (* main_~X~0 (- 3)) (* main_~Y~0 6)) (+ main_~v~0 (* main_~X~0 2) (* (- 2) main_~Y~0))))} is VALID [2022-04-15 07:39:23,337 INFO L272 TraceCheckUtils]: 46: Hoare triple {10374#(and (< (* main_~Y~0 4) (* main_~X~0 3)) (= main_~xy~0 (* main_~X~0 2)) (= (* main_~Y~0 3) main_~yx~0) (<= 0 main_~Y~0) (<= main_~Y~0 10) (= (+ (* main_~X~0 (- 3)) (* main_~Y~0 6)) (+ main_~v~0 (* main_~X~0 2) (* (- 2) main_~Y~0))))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {10378#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 07:39:23,337 INFO L290 TraceCheckUtils]: 47: Hoare triple {10378#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {10382#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 07:39:23,337 INFO L290 TraceCheckUtils]: 48: Hoare triple {10382#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {10225#false} is VALID [2022-04-15 07:39:23,338 INFO L290 TraceCheckUtils]: 49: Hoare triple {10225#false} assume !false; {10225#false} is VALID [2022-04-15 07:39:23,338 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 9 proven. 21 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-04-15 07:39:23,338 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 07:39:23,967 INFO L290 TraceCheckUtils]: 49: Hoare triple {10225#false} assume !false; {10225#false} is VALID [2022-04-15 07:39:23,968 INFO L290 TraceCheckUtils]: 48: Hoare triple {10382#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {10225#false} is VALID [2022-04-15 07:39:23,968 INFO L290 TraceCheckUtils]: 47: Hoare triple {10378#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {10382#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 07:39:23,969 INFO L272 TraceCheckUtils]: 46: Hoare triple {10398#(= (+ (* 2 main_~xy~0) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 main_~yx~0)))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {10378#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 07:39:23,970 INFO L290 TraceCheckUtils]: 45: Hoare triple {10402#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {10398#(= (+ (* 2 main_~xy~0) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 main_~yx~0)))} is VALID [2022-04-15 07:39:23,972 INFO L290 TraceCheckUtils]: 44: Hoare triple {10406#(= (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0))))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {10402#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} is VALID [2022-04-15 07:39:23,974 INFO L290 TraceCheckUtils]: 43: Hoare triple {10402#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} assume !(~v~0 < 0);~v~0 := ~v~0 + 2 * (~Y~0 - ~X~0);#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {10406#(= (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0))))} is VALID [2022-04-15 07:39:23,974 INFO L290 TraceCheckUtils]: 42: Hoare triple {10402#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} assume !!(~x~0 <= ~X~0); {10402#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} is VALID [2022-04-15 07:39:23,975 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {10224#true} {10402#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} #65#return; {10402#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} is VALID [2022-04-15 07:39:23,975 INFO L290 TraceCheckUtils]: 40: Hoare triple {10224#true} assume true; {10224#true} is VALID [2022-04-15 07:39:23,975 INFO L290 TraceCheckUtils]: 39: Hoare triple {10224#true} assume !(0 == ~cond); {10224#true} is VALID [2022-04-15 07:39:23,975 INFO L290 TraceCheckUtils]: 38: Hoare triple {10224#true} ~cond := #in~cond; {10224#true} is VALID [2022-04-15 07:39:23,975 INFO L272 TraceCheckUtils]: 37: Hoare triple {10402#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {10224#true} is VALID [2022-04-15 07:39:23,976 INFO L290 TraceCheckUtils]: 36: Hoare triple {10402#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {10402#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} is VALID [2022-04-15 07:39:23,977 INFO L290 TraceCheckUtils]: 35: Hoare triple {10406#(= (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0))))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {10402#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} is VALID [2022-04-15 07:39:23,978 INFO L290 TraceCheckUtils]: 34: Hoare triple {10437#(or (not (< main_~v~0 0)) (= (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0 (* main_~Y~0 2)) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0)))))} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {10406#(= (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0))))} is VALID [2022-04-15 07:39:23,978 INFO L290 TraceCheckUtils]: 33: Hoare triple {10437#(or (not (< main_~v~0 0)) (= (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0 (* main_~Y~0 2)) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0)))))} assume !!(~x~0 <= ~X~0); {10437#(or (not (< main_~v~0 0)) (= (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0 (* main_~Y~0 2)) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0)))))} is VALID [2022-04-15 07:39:23,979 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {10224#true} {10437#(or (not (< main_~v~0 0)) (= (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0 (* main_~Y~0 2)) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0)))))} #65#return; {10437#(or (not (< main_~v~0 0)) (= (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0 (* main_~Y~0 2)) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0)))))} is VALID [2022-04-15 07:39:23,979 INFO L290 TraceCheckUtils]: 31: Hoare triple {10224#true} assume true; {10224#true} is VALID [2022-04-15 07:39:23,979 INFO L290 TraceCheckUtils]: 30: Hoare triple {10224#true} assume !(0 == ~cond); {10224#true} is VALID [2022-04-15 07:39:23,979 INFO L290 TraceCheckUtils]: 29: Hoare triple {10224#true} ~cond := #in~cond; {10224#true} is VALID [2022-04-15 07:39:23,979 INFO L272 TraceCheckUtils]: 28: Hoare triple {10437#(or (not (< main_~v~0 0)) (= (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0 (* main_~Y~0 2)) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0)))))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {10224#true} is VALID [2022-04-15 07:39:23,980 INFO L290 TraceCheckUtils]: 27: Hoare triple {10437#(or (not (< main_~v~0 0)) (= (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0 (* main_~Y~0 2)) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0)))))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {10437#(or (not (< main_~v~0 0)) (= (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0 (* main_~Y~0 2)) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0)))))} is VALID [2022-04-15 07:39:23,981 INFO L290 TraceCheckUtils]: 26: Hoare triple {10462#(or (not (< main_~v~0 0)) (= (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0 (* main_~Y~0 2)) (+ (* 2 (* main_~Y~0 (+ main_~x~0 2))) (* main_~Y~0 2))))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {10437#(or (not (< main_~v~0 0)) (= (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0 (* main_~Y~0 2)) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0)))))} is VALID [2022-04-15 07:39:23,983 INFO L290 TraceCheckUtils]: 25: Hoare triple {10466#(or (= (+ main_~v~0 (* (- 1) main_~X~0) (* main_~Y~0 4) (* (* main_~X~0 (+ main_~y~0 1)) 2)) (+ (* 2 (* main_~Y~0 (+ main_~x~0 2))) (* main_~Y~0 2))) (not (< (+ main_~v~0 (* main_~Y~0 2)) (* main_~X~0 2))))} assume !(~v~0 < 0);~v~0 := ~v~0 + 2 * (~Y~0 - ~X~0);#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {10462#(or (not (< main_~v~0 0)) (= (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0 (* main_~Y~0 2)) (+ (* 2 (* main_~Y~0 (+ main_~x~0 2))) (* main_~Y~0 2))))} is VALID [2022-04-15 07:39:23,984 INFO L290 TraceCheckUtils]: 24: Hoare triple {10466#(or (= (+ main_~v~0 (* (- 1) main_~X~0) (* main_~Y~0 4) (* (* main_~X~0 (+ main_~y~0 1)) 2)) (+ (* 2 (* main_~Y~0 (+ main_~x~0 2))) (* main_~Y~0 2))) (not (< (+ main_~v~0 (* main_~Y~0 2)) (* main_~X~0 2))))} assume !!(~x~0 <= ~X~0); {10466#(or (= (+ main_~v~0 (* (- 1) main_~X~0) (* main_~Y~0 4) (* (* main_~X~0 (+ main_~y~0 1)) 2)) (+ (* 2 (* main_~Y~0 (+ main_~x~0 2))) (* main_~Y~0 2))) (not (< (+ main_~v~0 (* main_~Y~0 2)) (* main_~X~0 2))))} is VALID [2022-04-15 07:39:23,984 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {10224#true} {10466#(or (= (+ main_~v~0 (* (- 1) main_~X~0) (* main_~Y~0 4) (* (* main_~X~0 (+ main_~y~0 1)) 2)) (+ (* 2 (* main_~Y~0 (+ main_~x~0 2))) (* main_~Y~0 2))) (not (< (+ main_~v~0 (* main_~Y~0 2)) (* main_~X~0 2))))} #65#return; {10466#(or (= (+ main_~v~0 (* (- 1) main_~X~0) (* main_~Y~0 4) (* (* main_~X~0 (+ main_~y~0 1)) 2)) (+ (* 2 (* main_~Y~0 (+ main_~x~0 2))) (* main_~Y~0 2))) (not (< (+ main_~v~0 (* main_~Y~0 2)) (* main_~X~0 2))))} is VALID [2022-04-15 07:39:23,985 INFO L290 TraceCheckUtils]: 22: Hoare triple {10224#true} assume true; {10224#true} is VALID [2022-04-15 07:39:23,985 INFO L290 TraceCheckUtils]: 21: Hoare triple {10224#true} assume !(0 == ~cond); {10224#true} is VALID [2022-04-15 07:39:23,985 INFO L290 TraceCheckUtils]: 20: Hoare triple {10224#true} ~cond := #in~cond; {10224#true} is VALID [2022-04-15 07:39:23,985 INFO L272 TraceCheckUtils]: 19: Hoare triple {10466#(or (= (+ main_~v~0 (* (- 1) main_~X~0) (* main_~Y~0 4) (* (* main_~X~0 (+ main_~y~0 1)) 2)) (+ (* 2 (* main_~Y~0 (+ main_~x~0 2))) (* main_~Y~0 2))) (not (< (+ main_~v~0 (* main_~Y~0 2)) (* main_~X~0 2))))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {10224#true} is VALID [2022-04-15 07:39:23,985 INFO L290 TraceCheckUtils]: 18: Hoare triple {10466#(or (= (+ main_~v~0 (* (- 1) main_~X~0) (* main_~Y~0 4) (* (* main_~X~0 (+ main_~y~0 1)) 2)) (+ (* 2 (* main_~Y~0 (+ main_~x~0 2))) (* main_~Y~0 2))) (not (< (+ main_~v~0 (* main_~Y~0 2)) (* main_~X~0 2))))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {10466#(or (= (+ main_~v~0 (* (- 1) main_~X~0) (* main_~Y~0 4) (* (* main_~X~0 (+ main_~y~0 1)) 2)) (+ (* 2 (* main_~Y~0 (+ main_~x~0 2))) (* main_~Y~0 2))) (not (< (+ main_~v~0 (* main_~Y~0 2)) (* main_~X~0 2))))} is VALID [2022-04-15 07:39:23,986 INFO L290 TraceCheckUtils]: 17: Hoare triple {10224#true} ~v~0 := 2 * ~Y~0 - ~X~0;~y~0 := 0;~x~0 := 0; {10466#(or (= (+ main_~v~0 (* (- 1) main_~X~0) (* main_~Y~0 4) (* (* main_~X~0 (+ main_~y~0 1)) 2)) (+ (* 2 (* main_~Y~0 (+ main_~x~0 2))) (* main_~Y~0 2))) (not (< (+ main_~v~0 (* main_~Y~0 2)) (* main_~X~0 2))))} is VALID [2022-04-15 07:39:23,986 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {10224#true} {10224#true} #63#return; {10224#true} is VALID [2022-04-15 07:39:23,986 INFO L290 TraceCheckUtils]: 15: Hoare triple {10224#true} assume true; {10224#true} is VALID [2022-04-15 07:39:23,986 INFO L290 TraceCheckUtils]: 14: Hoare triple {10224#true} assume !(0 == ~cond); {10224#true} is VALID [2022-04-15 07:39:23,986 INFO L290 TraceCheckUtils]: 13: Hoare triple {10224#true} ~cond := #in~cond; {10224#true} is VALID [2022-04-15 07:39:23,986 INFO L272 TraceCheckUtils]: 12: Hoare triple {10224#true} call assume_abort_if_not((if ~Y~0 >= 0 && ~Y~0 <= 10 then 1 else 0)); {10224#true} is VALID [2022-04-15 07:39:23,986 INFO L290 TraceCheckUtils]: 11: Hoare triple {10224#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~Y~0 := #t~nondet5;havoc #t~nondet5; {10224#true} is VALID [2022-04-15 07:39:23,986 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {10224#true} {10224#true} #61#return; {10224#true} is VALID [2022-04-15 07:39:23,986 INFO L290 TraceCheckUtils]: 9: Hoare triple {10224#true} assume true; {10224#true} is VALID [2022-04-15 07:39:23,987 INFO L290 TraceCheckUtils]: 8: Hoare triple {10224#true} assume !(0 == ~cond); {10224#true} is VALID [2022-04-15 07:39:23,987 INFO L290 TraceCheckUtils]: 7: Hoare triple {10224#true} ~cond := #in~cond; {10224#true} is VALID [2022-04-15 07:39:23,987 INFO L272 TraceCheckUtils]: 6: Hoare triple {10224#true} call assume_abort_if_not((if ~X~0 >= 0 && ~X~0 <= 10 then 1 else 0)); {10224#true} is VALID [2022-04-15 07:39:23,987 INFO L290 TraceCheckUtils]: 5: Hoare triple {10224#true} havoc ~X~0;havoc ~Y~0;havoc ~x~0;havoc ~y~0;havoc ~v~0;havoc ~xy~0;havoc ~yx~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~X~0 := #t~nondet4;havoc #t~nondet4; {10224#true} is VALID [2022-04-15 07:39:23,987 INFO L272 TraceCheckUtils]: 4: Hoare triple {10224#true} call #t~ret8 := main(); {10224#true} is VALID [2022-04-15 07:39:23,987 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10224#true} {10224#true} #69#return; {10224#true} is VALID [2022-04-15 07:39:23,987 INFO L290 TraceCheckUtils]: 2: Hoare triple {10224#true} assume true; {10224#true} is VALID [2022-04-15 07:39:23,987 INFO L290 TraceCheckUtils]: 1: Hoare triple {10224#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(15, 2);call #Ultimate.allocInit(12, 3); {10224#true} is VALID [2022-04-15 07:39:23,987 INFO L272 TraceCheckUtils]: 0: Hoare triple {10224#true} call ULTIMATE.init(); {10224#true} is VALID [2022-04-15 07:39:23,987 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 18 proven. 7 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-04-15 07:39:23,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:39:23,988 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [535170694] [2022-04-15 07:39:23,988 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 07:39:23,988 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [535679625] [2022-04-15 07:39:23,988 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [535679625] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 07:39:23,988 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 07:39:23,988 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 10] total 21 [2022-04-15 07:39:23,988 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:39:23,988 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [13383108] [2022-04-15 07:39:23,988 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [13383108] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:39:23,989 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:39:23,989 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-04-15 07:39:23,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [224181677] [2022-04-15 07:39:23,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:39:23,990 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 2.142857142857143) internal successors, (30), 13 states have internal predecessors, (30), 5 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) Word has length 50 [2022-04-15 07:39:23,990 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:39:23,990 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 15 states, 14 states have (on average 2.142857142857143) internal successors, (30), 13 states have internal predecessors, (30), 5 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-15 07:39:24,029 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:39:24,029 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-15 07:39:24,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:39:24,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-15 07:39:24,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=351, Unknown=0, NotChecked=0, Total=420 [2022-04-15 07:39:24,030 INFO L87 Difference]: Start difference. First operand 113 states and 127 transitions. Second operand has 15 states, 14 states have (on average 2.142857142857143) internal successors, (30), 13 states have internal predecessors, (30), 5 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-15 07:39:25,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:39:25,357 INFO L93 Difference]: Finished difference Result 126 states and 142 transitions. [2022-04-15 07:39:25,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-15 07:39:25,357 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 2.142857142857143) internal successors, (30), 13 states have internal predecessors, (30), 5 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) Word has length 50 [2022-04-15 07:39:25,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:39:25,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 2.142857142857143) internal successors, (30), 13 states have internal predecessors, (30), 5 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-15 07:39:25,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 64 transitions. [2022-04-15 07:39:25,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 2.142857142857143) internal successors, (30), 13 states have internal predecessors, (30), 5 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-15 07:39:25,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 64 transitions. [2022-04-15 07:39:25,359 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 64 transitions. [2022-04-15 07:39:25,418 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-15 07:39:25,419 INFO L225 Difference]: With dead ends: 126 [2022-04-15 07:39:25,419 INFO L226 Difference]: Without dead ends: 124 [2022-04-15 07:39:25,420 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 78 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=86, Invalid=466, Unknown=0, NotChecked=0, Total=552 [2022-04-15 07:39:25,420 INFO L913 BasicCegarLoop]: 29 mSDtfsCounter, 22 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 466 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 187 SdHoareTripleChecker+Invalid, 475 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 466 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-15 07:39:25,420 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [23 Valid, 187 Invalid, 475 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 466 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-15 07:39:25,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2022-04-15 07:39:25,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 120. [2022-04-15 07:39:25,673 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:39:25,673 INFO L82 GeneralOperation]: Start isEquivalent. First operand 124 states. Second operand has 120 states, 88 states have (on average 1.1136363636363635) internal successors, (98), 91 states have internal predecessors, (98), 19 states have call successors, (19), 13 states have call predecessors, (19), 12 states have return successors, (17), 15 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-15 07:39:25,674 INFO L74 IsIncluded]: Start isIncluded. First operand 124 states. Second operand has 120 states, 88 states have (on average 1.1136363636363635) internal successors, (98), 91 states have internal predecessors, (98), 19 states have call successors, (19), 13 states have call predecessors, (19), 12 states have return successors, (17), 15 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-15 07:39:25,674 INFO L87 Difference]: Start difference. First operand 124 states. Second operand has 120 states, 88 states have (on average 1.1136363636363635) internal successors, (98), 91 states have internal predecessors, (98), 19 states have call successors, (19), 13 states have call predecessors, (19), 12 states have return successors, (17), 15 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-15 07:39:25,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:39:25,676 INFO L93 Difference]: Finished difference Result 124 states and 140 transitions. [2022-04-15 07:39:25,676 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 140 transitions. [2022-04-15 07:39:25,676 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:39:25,676 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:39:25,676 INFO L74 IsIncluded]: Start isIncluded. First operand has 120 states, 88 states have (on average 1.1136363636363635) internal successors, (98), 91 states have internal predecessors, (98), 19 states have call successors, (19), 13 states have call predecessors, (19), 12 states have return successors, (17), 15 states have call predecessors, (17), 17 states have call successors, (17) Second operand 124 states. [2022-04-15 07:39:25,677 INFO L87 Difference]: Start difference. First operand has 120 states, 88 states have (on average 1.1136363636363635) internal successors, (98), 91 states have internal predecessors, (98), 19 states have call successors, (19), 13 states have call predecessors, (19), 12 states have return successors, (17), 15 states have call predecessors, (17), 17 states have call successors, (17) Second operand 124 states. [2022-04-15 07:39:25,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:39:25,678 INFO L93 Difference]: Finished difference Result 124 states and 140 transitions. [2022-04-15 07:39:25,678 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 140 transitions. [2022-04-15 07:39:25,679 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:39:25,679 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:39:25,679 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:39:25,679 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:39:25,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 88 states have (on average 1.1136363636363635) internal successors, (98), 91 states have internal predecessors, (98), 19 states have call successors, (19), 13 states have call predecessors, (19), 12 states have return successors, (17), 15 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-15 07:39:25,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 134 transitions. [2022-04-15 07:39:25,681 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 134 transitions. Word has length 50 [2022-04-15 07:39:25,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:39:25,681 INFO L478 AbstractCegarLoop]: Abstraction has 120 states and 134 transitions. [2022-04-15 07:39:25,681 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 2.142857142857143) internal successors, (30), 13 states have internal predecessors, (30), 5 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-15 07:39:25,681 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 120 states and 134 transitions. [2022-04-15 07:39:27,968 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 134 edges. 133 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-15 07:39:27,968 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 134 transitions. [2022-04-15 07:39:27,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-04-15 07:39:27,968 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:39:27,969 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 07:39:27,988 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-15 07:39:28,169 WARN L460 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-15 07:39:28,169 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:39:28,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:39:28,170 INFO L85 PathProgramCache]: Analyzing trace with hash -1343557775, now seen corresponding path program 13 times [2022-04-15 07:39:28,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:39:28,170 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [476942859] [2022-04-15 07:39:28,170 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 07:39:28,170 INFO L85 PathProgramCache]: Analyzing trace with hash -1343557775, now seen corresponding path program 14 times [2022-04-15 07:39:28,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:39:28,170 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2053212941] [2022-04-15 07:39:28,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:39:28,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:39:28,180 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 07:39:28,181 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [923345397] [2022-04-15 07:39:28,181 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 07:39:28,181 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 07:39:28,181 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 07:39:28,183 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-15 07:39:28,199 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-15 07:39:28,229 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 07:39:28,229 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 07:39:28,231 INFO L263 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 41 conjunts are in the unsatisfiable core [2022-04-15 07:39:28,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:39:28,242 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 07:39:46,291 WARN L914 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-15 07:39:50,500 WARN L914 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-15 07:39:54,383 WARN L914 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-15 07:40:08,869 WARN L914 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-15 07:40:15,670 WARN L914 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-15 07:40:50,068 INFO L272 TraceCheckUtils]: 0: Hoare triple {11290#true} call ULTIMATE.init(); {11290#true} is VALID [2022-04-15 07:40:50,068 INFO L290 TraceCheckUtils]: 1: Hoare triple {11290#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(15, 2);call #Ultimate.allocInit(12, 3); {11290#true} is VALID [2022-04-15 07:40:50,068 INFO L290 TraceCheckUtils]: 2: Hoare triple {11290#true} assume true; {11290#true} is VALID [2022-04-15 07:40:50,068 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11290#true} {11290#true} #69#return; {11290#true} is VALID [2022-04-15 07:40:50,068 INFO L272 TraceCheckUtils]: 4: Hoare triple {11290#true} call #t~ret8 := main(); {11290#true} is VALID [2022-04-15 07:40:50,069 INFO L290 TraceCheckUtils]: 5: Hoare triple {11290#true} havoc ~X~0;havoc ~Y~0;havoc ~x~0;havoc ~y~0;havoc ~v~0;havoc ~xy~0;havoc ~yx~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~X~0 := #t~nondet4;havoc #t~nondet4; {11290#true} is VALID [2022-04-15 07:40:50,069 INFO L272 TraceCheckUtils]: 6: Hoare triple {11290#true} call assume_abort_if_not((if ~X~0 >= 0 && ~X~0 <= 10 then 1 else 0)); {11290#true} is VALID [2022-04-15 07:40:50,069 INFO L290 TraceCheckUtils]: 7: Hoare triple {11290#true} ~cond := #in~cond; {11290#true} is VALID [2022-04-15 07:40:50,069 INFO L290 TraceCheckUtils]: 8: Hoare triple {11290#true} assume !(0 == ~cond); {11290#true} is VALID [2022-04-15 07:40:50,069 INFO L290 TraceCheckUtils]: 9: Hoare triple {11290#true} assume true; {11290#true} is VALID [2022-04-15 07:40:50,069 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {11290#true} {11290#true} #61#return; {11290#true} is VALID [2022-04-15 07:40:50,069 INFO L290 TraceCheckUtils]: 11: Hoare triple {11290#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~Y~0 := #t~nondet5;havoc #t~nondet5; {11290#true} is VALID [2022-04-15 07:40:50,069 INFO L272 TraceCheckUtils]: 12: Hoare triple {11290#true} call assume_abort_if_not((if ~Y~0 >= 0 && ~Y~0 <= 10 then 1 else 0)); {11290#true} is VALID [2022-04-15 07:40:50,069 INFO L290 TraceCheckUtils]: 13: Hoare triple {11290#true} ~cond := #in~cond; {11290#true} is VALID [2022-04-15 07:40:50,069 INFO L290 TraceCheckUtils]: 14: Hoare triple {11290#true} assume !(0 == ~cond); {11290#true} is VALID [2022-04-15 07:40:50,069 INFO L290 TraceCheckUtils]: 15: Hoare triple {11290#true} assume true; {11290#true} is VALID [2022-04-15 07:40:50,069 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {11290#true} {11290#true} #63#return; {11290#true} is VALID [2022-04-15 07:40:50,070 INFO L290 TraceCheckUtils]: 17: Hoare triple {11290#true} ~v~0 := 2 * ~Y~0 - ~X~0;~y~0 := 0;~x~0 := 0; {11346#(= (+ main_~X~0 main_~v~0) (* main_~Y~0 2))} is VALID [2022-04-15 07:40:50,070 INFO L290 TraceCheckUtils]: 18: Hoare triple {11346#(= (+ main_~X~0 main_~v~0) (* main_~Y~0 2))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {11346#(= (+ main_~X~0 main_~v~0) (* main_~Y~0 2))} is VALID [2022-04-15 07:40:50,070 INFO L272 TraceCheckUtils]: 19: Hoare triple {11346#(= (+ main_~X~0 main_~v~0) (* main_~Y~0 2))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {11290#true} is VALID [2022-04-15 07:40:50,070 INFO L290 TraceCheckUtils]: 20: Hoare triple {11290#true} ~cond := #in~cond; {11290#true} is VALID [2022-04-15 07:40:50,070 INFO L290 TraceCheckUtils]: 21: Hoare triple {11290#true} assume !(0 == ~cond); {11290#true} is VALID [2022-04-15 07:40:50,070 INFO L290 TraceCheckUtils]: 22: Hoare triple {11290#true} assume true; {11290#true} is VALID [2022-04-15 07:40:50,071 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {11290#true} {11346#(= (+ main_~X~0 main_~v~0) (* main_~Y~0 2))} #65#return; {11346#(= (+ main_~X~0 main_~v~0) (* main_~Y~0 2))} is VALID [2022-04-15 07:40:50,071 INFO L290 TraceCheckUtils]: 24: Hoare triple {11346#(= (+ main_~X~0 main_~v~0) (* main_~Y~0 2))} assume !!(~x~0 <= ~X~0); {11346#(= (+ main_~X~0 main_~v~0) (* main_~Y~0 2))} is VALID [2022-04-15 07:40:50,072 INFO L290 TraceCheckUtils]: 25: Hoare triple {11346#(= (+ main_~X~0 main_~v~0) (* main_~Y~0 2))} assume !(~v~0 < 0);~v~0 := ~v~0 + 2 * (~Y~0 - ~X~0);#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {11371#(= (* main_~Y~0 2) (+ main_~v~0 (* main_~X~0 3) (* (- 2) main_~Y~0)))} is VALID [2022-04-15 07:40:50,072 INFO L290 TraceCheckUtils]: 26: Hoare triple {11371#(= (* main_~Y~0 2) (+ main_~v~0 (* main_~X~0 3) (* (- 2) main_~Y~0)))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {11371#(= (* main_~Y~0 2) (+ main_~v~0 (* main_~X~0 3) (* (- 2) main_~Y~0)))} is VALID [2022-04-15 07:40:52,074 WARN L290 TraceCheckUtils]: 27: Hoare triple {11371#(= (* main_~Y~0 2) (+ main_~v~0 (* main_~X~0 3) (* (- 2) main_~Y~0)))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {11378#(and (or (and (= (mod main_~yx~0 main_~Y~0) 0) (not (= main_~Y~0 0))) (= main_~yx~0 0)) (= (* main_~Y~0 2) (+ main_~v~0 (* main_~X~0 3) (* (- 2) main_~Y~0))))} is UNKNOWN [2022-04-15 07:40:52,075 INFO L272 TraceCheckUtils]: 28: Hoare triple {11378#(and (or (and (= (mod main_~yx~0 main_~Y~0) 0) (not (= main_~Y~0 0))) (= main_~yx~0 0)) (= (* main_~Y~0 2) (+ main_~v~0 (* main_~X~0 3) (* (- 2) main_~Y~0))))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {11290#true} is VALID [2022-04-15 07:40:52,075 INFO L290 TraceCheckUtils]: 29: Hoare triple {11290#true} ~cond := #in~cond; {11385#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-15 07:40:52,081 INFO L290 TraceCheckUtils]: 30: Hoare triple {11385#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {11389#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:40:52,082 INFO L290 TraceCheckUtils]: 31: Hoare triple {11389#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {11389#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:40:52,083 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {11389#(not (= |__VERIFIER_assert_#in~cond| 0))} {11378#(and (or (and (= (mod main_~yx~0 main_~Y~0) 0) (not (= main_~Y~0 0))) (= main_~yx~0 0)) (= (* main_~Y~0 2) (+ main_~v~0 (* main_~X~0 3) (* (- 2) main_~Y~0))))} #65#return; {11371#(= (* main_~Y~0 2) (+ main_~v~0 (* main_~X~0 3) (* (- 2) main_~Y~0)))} is VALID [2022-04-15 07:40:52,083 INFO L290 TraceCheckUtils]: 33: Hoare triple {11371#(= (* main_~Y~0 2) (+ main_~v~0 (* main_~X~0 3) (* (- 2) main_~Y~0)))} assume !!(~x~0 <= ~X~0); {11371#(= (* main_~Y~0 2) (+ main_~v~0 (* main_~X~0 3) (* (- 2) main_~Y~0)))} is VALID [2022-04-15 07:40:52,084 INFO L290 TraceCheckUtils]: 34: Hoare triple {11371#(= (* main_~Y~0 2) (+ main_~v~0 (* main_~X~0 3) (* (- 2) main_~Y~0)))} assume !(~v~0 < 0);~v~0 := ~v~0 + 2 * (~Y~0 - ~X~0);#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {11402#(= main_~v~0 (+ (* main_~Y~0 6) (* main_~X~0 (- 5))))} is VALID [2022-04-15 07:40:52,084 INFO L290 TraceCheckUtils]: 35: Hoare triple {11402#(= main_~v~0 (+ (* main_~Y~0 6) (* main_~X~0 (- 5))))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {11402#(= main_~v~0 (+ (* main_~Y~0 6) (* main_~X~0 (- 5))))} is VALID [2022-04-15 07:40:52,085 INFO L290 TraceCheckUtils]: 36: Hoare triple {11402#(= main_~v~0 (+ (* main_~Y~0 6) (* main_~X~0 (- 5))))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {11409#(and (= main_~v~0 (+ (* main_~Y~0 6) (* main_~X~0 (- 5)))) (= (* main_~X~0 main_~y~0) main_~xy~0) (= main_~yx~0 (* main_~Y~0 main_~x~0)))} is VALID [2022-04-15 07:40:52,085 INFO L272 TraceCheckUtils]: 37: Hoare triple {11409#(and (= main_~v~0 (+ (* main_~Y~0 6) (* main_~X~0 (- 5)))) (= (* main_~X~0 main_~y~0) main_~xy~0) (= main_~yx~0 (* main_~Y~0 main_~x~0)))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {11290#true} is VALID [2022-04-15 07:40:52,085 INFO L290 TraceCheckUtils]: 38: Hoare triple {11290#true} ~cond := #in~cond; {11385#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-15 07:40:52,085 INFO L290 TraceCheckUtils]: 39: Hoare triple {11385#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {11389#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:40:52,086 INFO L290 TraceCheckUtils]: 40: Hoare triple {11389#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {11389#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:40:52,087 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {11389#(not (= |__VERIFIER_assert_#in~cond| 0))} {11409#(and (= main_~v~0 (+ (* main_~Y~0 6) (* main_~X~0 (- 5)))) (= (* main_~X~0 main_~y~0) main_~xy~0) (= main_~yx~0 (* main_~Y~0 main_~x~0)))} #65#return; {11425#(and (= main_~v~0 (+ (* main_~Y~0 6) (* main_~X~0 (- 5)))) (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)))} is VALID [2022-04-15 07:40:52,087 INFO L290 TraceCheckUtils]: 42: Hoare triple {11425#(and (= main_~v~0 (+ (* main_~Y~0 6) (* main_~X~0 (- 5)))) (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)))} assume !!(~x~0 <= ~X~0); {11425#(and (= main_~v~0 (+ (* main_~Y~0 6) (* main_~X~0 (- 5)))) (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)))} is VALID [2022-04-15 07:40:52,088 INFO L290 TraceCheckUtils]: 43: Hoare triple {11425#(and (= main_~v~0 (+ (* main_~Y~0 6) (* main_~X~0 (- 5)))) (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)))} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {11432#(and (= (+ (* main_~Y~0 main_~x~0 2) (* (- 1) main_~X~0) (* main_~Y~0 2) (* (- 2) main_~X~0 main_~y~0)) (+ (* main_~Y~0 6) (* main_~X~0 (- 5)))) (= main_~v~0 (+ (* main_~Y~0 main_~x~0 2) (* (- 1) main_~X~0) (* (- 2) main_~X~0 main_~y~0) (* main_~Y~0 4))))} is VALID [2022-04-15 07:40:52,090 INFO L290 TraceCheckUtils]: 44: Hoare triple {11432#(and (= (+ (* main_~Y~0 main_~x~0 2) (* (- 1) main_~X~0) (* main_~Y~0 2) (* (- 2) main_~X~0 main_~y~0)) (+ (* main_~Y~0 6) (* main_~X~0 (- 5)))) (= main_~v~0 (+ (* main_~Y~0 main_~x~0 2) (* (- 1) main_~X~0) (* (- 2) main_~X~0 main_~y~0) (* main_~Y~0 4))))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {11436#(and (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2) (* (- 2) main_~X~0 main_~y~0) (* (+ (- 1) main_~x~0) main_~Y~0 2)) (+ (* main_~Y~0 6) (* main_~X~0 (- 5)))) (= main_~v~0 (+ (* (- 1) main_~X~0) (* (- 2) main_~X~0 main_~y~0) (* main_~Y~0 4) (* (+ (- 1) main_~x~0) main_~Y~0 2))))} is VALID [2022-04-15 07:40:54,093 WARN L290 TraceCheckUtils]: 45: Hoare triple {11436#(and (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2) (* (- 2) main_~X~0 main_~y~0) (* (+ (- 1) main_~x~0) main_~Y~0 2)) (+ (* main_~Y~0 6) (* main_~X~0 (- 5)))) (= main_~v~0 (+ (* (- 1) main_~X~0) (* (- 2) main_~X~0 main_~y~0) (* main_~Y~0 4) (* (+ (- 1) main_~x~0) main_~Y~0 2))))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {11440#(or (and (not (= main_~X~0 0)) (or (and (= (+ (* main_~Y~0 2 (+ (- 1) (div (+ (* (- 2) main_~X~0) (* main_~Y~0 3) (* (div main_~xy~0 main_~X~0) main_~X~0)) main_~Y~0))) (* (- 1) main_~X~0) (* main_~Y~0 4) (* (- 2) (div main_~xy~0 main_~X~0) main_~X~0)) main_~v~0) (= (mod (+ (* (- 2) main_~X~0) (* main_~Y~0 3) (* (div main_~xy~0 main_~X~0) main_~X~0)) main_~Y~0) 0) (= (* (div (+ (* (- 2) main_~X~0) (* main_~Y~0 3) (* (div main_~xy~0 main_~X~0) main_~X~0)) main_~Y~0) main_~Y~0) main_~yx~0) (not (= main_~Y~0 0))) (and (= main_~Y~0 (+ (* (div main_~xy~0 main_~X~0) main_~X~0) (div (+ (* (- 1) main_~X~0) (* (- 1) main_~v~0)) (- 2)))) (= (+ (* (- 2) main_~X~0) (* main_~Y~0 3) (* (div main_~xy~0 main_~X~0) main_~X~0)) 0) (= main_~yx~0 0) (= (mod (+ main_~X~0 main_~v~0 (* (- 2) (div main_~xy~0 main_~X~0) main_~X~0)) 2) 0))) (= (mod main_~xy~0 main_~X~0) 0)) (and (= main_~xy~0 0) (= main_~X~0 0) (or (and (exists ((main_~x~0 Int) (main_~y~0 Int)) (= main_~v~0 (+ (* (- 1) main_~X~0) (* (- 2) main_~X~0 main_~y~0) (* main_~Y~0 4) (* (+ (- 1) main_~x~0) main_~Y~0 2)))) (= main_~yx~0 0) (= main_~Y~0 0)) (and (= (+ (* (div main_~yx~0 main_~Y~0) main_~Y~0) (div (+ main_~X~0 main_~v~0) (- 2)) main_~Y~0) 0) (= (mod main_~yx~0 main_~Y~0) 0) (= (mod (+ (* (div main_~yx~0 main_~Y~0) (- 2) main_~Y~0) main_~X~0 main_~v~0) 2) 0) (= (* main_~Y~0 3) (+ (* (div main_~yx~0 main_~Y~0) main_~Y~0) (* main_~X~0 2))) (not (= main_~Y~0 0))))))} is UNKNOWN [2022-04-15 07:40:54,101 INFO L272 TraceCheckUtils]: 46: Hoare triple {11440#(or (and (not (= main_~X~0 0)) (or (and (= (+ (* main_~Y~0 2 (+ (- 1) (div (+ (* (- 2) main_~X~0) (* main_~Y~0 3) (* (div main_~xy~0 main_~X~0) main_~X~0)) main_~Y~0))) (* (- 1) main_~X~0) (* main_~Y~0 4) (* (- 2) (div main_~xy~0 main_~X~0) main_~X~0)) main_~v~0) (= (mod (+ (* (- 2) main_~X~0) (* main_~Y~0 3) (* (div main_~xy~0 main_~X~0) main_~X~0)) main_~Y~0) 0) (= (* (div (+ (* (- 2) main_~X~0) (* main_~Y~0 3) (* (div main_~xy~0 main_~X~0) main_~X~0)) main_~Y~0) main_~Y~0) main_~yx~0) (not (= main_~Y~0 0))) (and (= main_~Y~0 (+ (* (div main_~xy~0 main_~X~0) main_~X~0) (div (+ (* (- 1) main_~X~0) (* (- 1) main_~v~0)) (- 2)))) (= (+ (* (- 2) main_~X~0) (* main_~Y~0 3) (* (div main_~xy~0 main_~X~0) main_~X~0)) 0) (= main_~yx~0 0) (= (mod (+ main_~X~0 main_~v~0 (* (- 2) (div main_~xy~0 main_~X~0) main_~X~0)) 2) 0))) (= (mod main_~xy~0 main_~X~0) 0)) (and (= main_~xy~0 0) (= main_~X~0 0) (or (and (exists ((main_~x~0 Int) (main_~y~0 Int)) (= main_~v~0 (+ (* (- 1) main_~X~0) (* (- 2) main_~X~0 main_~y~0) (* main_~Y~0 4) (* (+ (- 1) main_~x~0) main_~Y~0 2)))) (= main_~yx~0 0) (= main_~Y~0 0)) (and (= (+ (* (div main_~yx~0 main_~Y~0) main_~Y~0) (div (+ main_~X~0 main_~v~0) (- 2)) main_~Y~0) 0) (= (mod main_~yx~0 main_~Y~0) 0) (= (mod (+ (* (div main_~yx~0 main_~Y~0) (- 2) main_~Y~0) main_~X~0 main_~v~0) 2) 0) (= (* main_~Y~0 3) (+ (* (div main_~yx~0 main_~Y~0) main_~Y~0) (* main_~X~0 2))) (not (= main_~Y~0 0))))))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {11444#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 07:40:54,101 INFO L290 TraceCheckUtils]: 47: Hoare triple {11444#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {11448#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 07:40:54,102 INFO L290 TraceCheckUtils]: 48: Hoare triple {11448#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {11291#false} is VALID [2022-04-15 07:40:54,102 INFO L290 TraceCheckUtils]: 49: Hoare triple {11291#false} assume !false; {11291#false} is VALID [2022-04-15 07:40:54,102 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 10 proven. 23 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-15 07:40:54,102 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 07:40:58,072 INFO L290 TraceCheckUtils]: 49: Hoare triple {11291#false} assume !false; {11291#false} is VALID [2022-04-15 07:40:58,072 INFO L290 TraceCheckUtils]: 48: Hoare triple {11448#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {11291#false} is VALID [2022-04-15 07:40:58,073 INFO L290 TraceCheckUtils]: 47: Hoare triple {11444#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {11448#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 07:40:58,073 INFO L272 TraceCheckUtils]: 46: Hoare triple {11464#(= (+ (* 2 main_~xy~0) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 main_~yx~0)))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {11444#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 07:40:58,074 INFO L290 TraceCheckUtils]: 45: Hoare triple {11468#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {11464#(= (+ (* 2 main_~xy~0) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 main_~yx~0)))} is VALID [2022-04-15 07:40:58,076 INFO L290 TraceCheckUtils]: 44: Hoare triple {11472#(= (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0))))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {11468#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} is VALID [2022-04-15 07:40:58,077 INFO L290 TraceCheckUtils]: 43: Hoare triple {11468#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {11472#(= (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0))))} is VALID [2022-04-15 07:40:58,077 INFO L290 TraceCheckUtils]: 42: Hoare triple {11468#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} assume !!(~x~0 <= ~X~0); {11468#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} is VALID [2022-04-15 07:40:58,078 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {11389#(not (= |__VERIFIER_assert_#in~cond| 0))} {11482#(or (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (not (= (+ (* 2 main_~xy~0) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 main_~yx~0)))))} #65#return; {11468#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} is VALID [2022-04-15 07:40:58,078 INFO L290 TraceCheckUtils]: 40: Hoare triple {11389#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {11389#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:40:58,078 INFO L290 TraceCheckUtils]: 39: Hoare triple {11492#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {11389#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:40:58,079 INFO L290 TraceCheckUtils]: 38: Hoare triple {11290#true} ~cond := #in~cond; {11492#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 07:40:58,079 INFO L272 TraceCheckUtils]: 37: Hoare triple {11482#(or (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (not (= (+ (* 2 main_~xy~0) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 main_~yx~0)))))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {11290#true} is VALID [2022-04-15 07:40:58,080 INFO L290 TraceCheckUtils]: 36: Hoare triple {11290#true} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {11482#(or (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (not (= (+ (* 2 main_~xy~0) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 main_~yx~0)))))} is VALID [2022-04-15 07:40:58,080 INFO L290 TraceCheckUtils]: 35: Hoare triple {11290#true} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {11290#true} is VALID [2022-04-15 07:40:58,080 INFO L290 TraceCheckUtils]: 34: Hoare triple {11290#true} assume !(~v~0 < 0);~v~0 := ~v~0 + 2 * (~Y~0 - ~X~0);#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {11290#true} is VALID [2022-04-15 07:40:58,080 INFO L290 TraceCheckUtils]: 33: Hoare triple {11290#true} assume !!(~x~0 <= ~X~0); {11290#true} is VALID [2022-04-15 07:40:58,080 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {11290#true} {11290#true} #65#return; {11290#true} is VALID [2022-04-15 07:40:58,080 INFO L290 TraceCheckUtils]: 31: Hoare triple {11290#true} assume true; {11290#true} is VALID [2022-04-15 07:40:58,080 INFO L290 TraceCheckUtils]: 30: Hoare triple {11290#true} assume !(0 == ~cond); {11290#true} is VALID [2022-04-15 07:40:58,080 INFO L290 TraceCheckUtils]: 29: Hoare triple {11290#true} ~cond := #in~cond; {11290#true} is VALID [2022-04-15 07:40:58,080 INFO L272 TraceCheckUtils]: 28: Hoare triple {11290#true} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {11290#true} is VALID [2022-04-15 07:40:58,080 INFO L290 TraceCheckUtils]: 27: Hoare triple {11290#true} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {11290#true} is VALID [2022-04-15 07:40:58,081 INFO L290 TraceCheckUtils]: 26: Hoare triple {11290#true} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {11290#true} is VALID [2022-04-15 07:40:58,081 INFO L290 TraceCheckUtils]: 25: Hoare triple {11290#true} assume !(~v~0 < 0);~v~0 := ~v~0 + 2 * (~Y~0 - ~X~0);#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {11290#true} is VALID [2022-04-15 07:40:58,081 INFO L290 TraceCheckUtils]: 24: Hoare triple {11290#true} assume !!(~x~0 <= ~X~0); {11290#true} is VALID [2022-04-15 07:40:58,081 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {11290#true} {11290#true} #65#return; {11290#true} is VALID [2022-04-15 07:40:58,081 INFO L290 TraceCheckUtils]: 22: Hoare triple {11290#true} assume true; {11290#true} is VALID [2022-04-15 07:40:58,081 INFO L290 TraceCheckUtils]: 21: Hoare triple {11290#true} assume !(0 == ~cond); {11290#true} is VALID [2022-04-15 07:40:58,081 INFO L290 TraceCheckUtils]: 20: Hoare triple {11290#true} ~cond := #in~cond; {11290#true} is VALID [2022-04-15 07:40:58,081 INFO L272 TraceCheckUtils]: 19: Hoare triple {11290#true} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {11290#true} is VALID [2022-04-15 07:40:58,081 INFO L290 TraceCheckUtils]: 18: Hoare triple {11290#true} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {11290#true} is VALID [2022-04-15 07:40:58,081 INFO L290 TraceCheckUtils]: 17: Hoare triple {11290#true} ~v~0 := 2 * ~Y~0 - ~X~0;~y~0 := 0;~x~0 := 0; {11290#true} is VALID [2022-04-15 07:40:58,081 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {11290#true} {11290#true} #63#return; {11290#true} is VALID [2022-04-15 07:40:58,081 INFO L290 TraceCheckUtils]: 15: Hoare triple {11290#true} assume true; {11290#true} is VALID [2022-04-15 07:40:58,081 INFO L290 TraceCheckUtils]: 14: Hoare triple {11290#true} assume !(0 == ~cond); {11290#true} is VALID [2022-04-15 07:40:58,081 INFO L290 TraceCheckUtils]: 13: Hoare triple {11290#true} ~cond := #in~cond; {11290#true} is VALID [2022-04-15 07:40:58,082 INFO L272 TraceCheckUtils]: 12: Hoare triple {11290#true} call assume_abort_if_not((if ~Y~0 >= 0 && ~Y~0 <= 10 then 1 else 0)); {11290#true} is VALID [2022-04-15 07:40:58,082 INFO L290 TraceCheckUtils]: 11: Hoare triple {11290#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~Y~0 := #t~nondet5;havoc #t~nondet5; {11290#true} is VALID [2022-04-15 07:40:58,082 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {11290#true} {11290#true} #61#return; {11290#true} is VALID [2022-04-15 07:40:58,082 INFO L290 TraceCheckUtils]: 9: Hoare triple {11290#true} assume true; {11290#true} is VALID [2022-04-15 07:40:58,082 INFO L290 TraceCheckUtils]: 8: Hoare triple {11290#true} assume !(0 == ~cond); {11290#true} is VALID [2022-04-15 07:40:58,082 INFO L290 TraceCheckUtils]: 7: Hoare triple {11290#true} ~cond := #in~cond; {11290#true} is VALID [2022-04-15 07:40:58,082 INFO L272 TraceCheckUtils]: 6: Hoare triple {11290#true} call assume_abort_if_not((if ~X~0 >= 0 && ~X~0 <= 10 then 1 else 0)); {11290#true} is VALID [2022-04-15 07:40:58,082 INFO L290 TraceCheckUtils]: 5: Hoare triple {11290#true} havoc ~X~0;havoc ~Y~0;havoc ~x~0;havoc ~y~0;havoc ~v~0;havoc ~xy~0;havoc ~yx~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~X~0 := #t~nondet4;havoc #t~nondet4; {11290#true} is VALID [2022-04-15 07:40:58,082 INFO L272 TraceCheckUtils]: 4: Hoare triple {11290#true} call #t~ret8 := main(); {11290#true} is VALID [2022-04-15 07:40:58,082 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11290#true} {11290#true} #69#return; {11290#true} is VALID [2022-04-15 07:40:58,082 INFO L290 TraceCheckUtils]: 2: Hoare triple {11290#true} assume true; {11290#true} is VALID [2022-04-15 07:40:58,082 INFO L290 TraceCheckUtils]: 1: Hoare triple {11290#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(15, 2);call #Ultimate.allocInit(12, 3); {11290#true} is VALID [2022-04-15 07:40:58,082 INFO L272 TraceCheckUtils]: 0: Hoare triple {11290#true} call ULTIMATE.init(); {11290#true} is VALID [2022-04-15 07:40:58,083 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 24 proven. 2 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-04-15 07:40:58,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:40:58,083 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2053212941] [2022-04-15 07:40:58,083 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 07:40:58,083 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [923345397] [2022-04-15 07:40:58,083 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [923345397] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 07:40:58,083 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 07:40:58,083 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 10] total 20 [2022-04-15 07:40:58,083 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:40:58,084 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [476942859] [2022-04-15 07:40:58,084 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [476942859] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:40:58,084 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:40:58,084 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-04-15 07:40:58,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630577311] [2022-04-15 07:40:58,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:40:58,084 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 12 states have (on average 2.5) internal successors, (30), 14 states have internal predecessors, (30), 5 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) Word has length 50 [2022-04-15 07:40:58,084 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:40:58,084 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 15 states, 12 states have (on average 2.5) internal successors, (30), 14 states have internal predecessors, (30), 5 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-15 07:41:02,131 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 42 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-15 07:41:02,131 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-15 07:41:02,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:41:02,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-15 07:41:02,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=327, Unknown=1, NotChecked=0, Total=380 [2022-04-15 07:41:02,132 INFO L87 Difference]: Start difference. First operand 120 states and 134 transitions. Second operand has 15 states, 12 states have (on average 2.5) internal successors, (30), 14 states have internal predecessors, (30), 5 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-15 07:41:06,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:41:06,696 INFO L93 Difference]: Finished difference Result 134 states and 151 transitions. [2022-04-15 07:41:06,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-15 07:41:06,697 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 12 states have (on average 2.5) internal successors, (30), 14 states have internal predecessors, (30), 5 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) Word has length 50 [2022-04-15 07:41:06,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:41:06,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 12 states have (on average 2.5) internal successors, (30), 14 states have internal predecessors, (30), 5 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-15 07:41:06,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 65 transitions. [2022-04-15 07:41:06,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 12 states have (on average 2.5) internal successors, (30), 14 states have internal predecessors, (30), 5 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-15 07:41:06,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 65 transitions. [2022-04-15 07:41:06,699 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 65 transitions. [2022-04-15 07:41:10,784 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 63 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-15 07:41:10,786 INFO L225 Difference]: With dead ends: 134 [2022-04-15 07:41:10,786 INFO L226 Difference]: Without dead ends: 132 [2022-04-15 07:41:10,787 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 78 SyntacticMatches, 3 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=80, Invalid=471, Unknown=1, NotChecked=0, Total=552 [2022-04-15 07:41:10,787 INFO L913 BasicCegarLoop]: 30 mSDtfsCounter, 18 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 354 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 211 SdHoareTripleChecker+Invalid, 402 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 354 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 45 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-04-15 07:41:10,787 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [20 Valid, 211 Invalid, 402 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 354 Invalid, 0 Unknown, 45 Unchecked, 1.1s Time] [2022-04-15 07:41:10,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2022-04-15 07:41:11,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 121. [2022-04-15 07:41:11,105 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:41:11,106 INFO L82 GeneralOperation]: Start isEquivalent. First operand 132 states. Second operand has 121 states, 89 states have (on average 1.1235955056179776) internal successors, (100), 92 states have internal predecessors, (100), 19 states have call successors, (19), 13 states have call predecessors, (19), 12 states have return successors, (17), 15 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-15 07:41:11,106 INFO L74 IsIncluded]: Start isIncluded. First operand 132 states. Second operand has 121 states, 89 states have (on average 1.1235955056179776) internal successors, (100), 92 states have internal predecessors, (100), 19 states have call successors, (19), 13 states have call predecessors, (19), 12 states have return successors, (17), 15 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-15 07:41:11,106 INFO L87 Difference]: Start difference. First operand 132 states. Second operand has 121 states, 89 states have (on average 1.1235955056179776) internal successors, (100), 92 states have internal predecessors, (100), 19 states have call successors, (19), 13 states have call predecessors, (19), 12 states have return successors, (17), 15 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-15 07:41:11,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:41:11,109 INFO L93 Difference]: Finished difference Result 132 states and 149 transitions. [2022-04-15 07:41:11,109 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 149 transitions. [2022-04-15 07:41:11,109 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:41:11,109 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:41:11,110 INFO L74 IsIncluded]: Start isIncluded. First operand has 121 states, 89 states have (on average 1.1235955056179776) internal successors, (100), 92 states have internal predecessors, (100), 19 states have call successors, (19), 13 states have call predecessors, (19), 12 states have return successors, (17), 15 states have call predecessors, (17), 17 states have call successors, (17) Second operand 132 states. [2022-04-15 07:41:11,110 INFO L87 Difference]: Start difference. First operand has 121 states, 89 states have (on average 1.1235955056179776) internal successors, (100), 92 states have internal predecessors, (100), 19 states have call successors, (19), 13 states have call predecessors, (19), 12 states have return successors, (17), 15 states have call predecessors, (17), 17 states have call successors, (17) Second operand 132 states. [2022-04-15 07:41:11,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:41:11,112 INFO L93 Difference]: Finished difference Result 132 states and 149 transitions. [2022-04-15 07:41:11,112 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 149 transitions. [2022-04-15 07:41:11,113 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:41:11,113 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:41:11,113 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:41:11,113 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:41:11,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 89 states have (on average 1.1235955056179776) internal successors, (100), 92 states have internal predecessors, (100), 19 states have call successors, (19), 13 states have call predecessors, (19), 12 states have return successors, (17), 15 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-15 07:41:11,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 136 transitions. [2022-04-15 07:41:11,115 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 136 transitions. Word has length 50 [2022-04-15 07:41:11,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:41:11,115 INFO L478 AbstractCegarLoop]: Abstraction has 121 states and 136 transitions. [2022-04-15 07:41:11,116 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 12 states have (on average 2.5) internal successors, (30), 14 states have internal predecessors, (30), 5 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-15 07:41:11,116 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 121 states and 136 transitions. [2022-04-15 07:41:15,453 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 136 edges. 134 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-15 07:41:15,453 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 136 transitions. [2022-04-15 07:41:15,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-04-15 07:41:15,453 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:41:15,453 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 07:41:15,470 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-04-15 07:41:15,663 WARN L460 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-15 07:41:15,663 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:41:15,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:41:15,664 INFO L85 PathProgramCache]: Analyzing trace with hash 431449587, now seen corresponding path program 5 times [2022-04-15 07:41:15,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:41:15,664 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [899196738] [2022-04-15 07:41:15,664 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 07:41:15,664 INFO L85 PathProgramCache]: Analyzing trace with hash 431449587, now seen corresponding path program 6 times [2022-04-15 07:41:15,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:41:15,665 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1182231932] [2022-04-15 07:41:15,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:41:15,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:41:15,690 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 07:41:15,690 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1155230109] [2022-04-15 07:41:15,691 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 07:41:15,691 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 07:41:15,691 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 07:41:15,693 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-15 07:41:15,693 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-15 07:41:15,742 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-04-15 07:41:15,743 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 07:41:15,744 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 50 conjunts are in the unsatisfiable core [2022-04-15 07:41:15,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:41:15,758 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 07:41:16,023 WARN L914 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-15 07:41:24,392 WARN L914 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-15 07:41:24,679 INFO L272 TraceCheckUtils]: 0: Hoare triple {12391#true} call ULTIMATE.init(); {12391#true} is VALID [2022-04-15 07:41:24,679 INFO L290 TraceCheckUtils]: 1: Hoare triple {12391#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(15, 2);call #Ultimate.allocInit(12, 3); {12391#true} is VALID [2022-04-15 07:41:24,679 INFO L290 TraceCheckUtils]: 2: Hoare triple {12391#true} assume true; {12391#true} is VALID [2022-04-15 07:41:24,679 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12391#true} {12391#true} #69#return; {12391#true} is VALID [2022-04-15 07:41:24,680 INFO L272 TraceCheckUtils]: 4: Hoare triple {12391#true} call #t~ret8 := main(); {12391#true} is VALID [2022-04-15 07:41:24,680 INFO L290 TraceCheckUtils]: 5: Hoare triple {12391#true} havoc ~X~0;havoc ~Y~0;havoc ~x~0;havoc ~y~0;havoc ~v~0;havoc ~xy~0;havoc ~yx~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~X~0 := #t~nondet4;havoc #t~nondet4; {12391#true} is VALID [2022-04-15 07:41:24,680 INFO L272 TraceCheckUtils]: 6: Hoare triple {12391#true} call assume_abort_if_not((if ~X~0 >= 0 && ~X~0 <= 10 then 1 else 0)); {12391#true} is VALID [2022-04-15 07:41:24,680 INFO L290 TraceCheckUtils]: 7: Hoare triple {12391#true} ~cond := #in~cond; {12391#true} is VALID [2022-04-15 07:41:24,680 INFO L290 TraceCheckUtils]: 8: Hoare triple {12391#true} assume !(0 == ~cond); {12391#true} is VALID [2022-04-15 07:41:24,680 INFO L290 TraceCheckUtils]: 9: Hoare triple {12391#true} assume true; {12391#true} is VALID [2022-04-15 07:41:24,680 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {12391#true} {12391#true} #61#return; {12391#true} is VALID [2022-04-15 07:41:24,680 INFO L290 TraceCheckUtils]: 11: Hoare triple {12391#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~Y~0 := #t~nondet5;havoc #t~nondet5; {12391#true} is VALID [2022-04-15 07:41:24,680 INFO L272 TraceCheckUtils]: 12: Hoare triple {12391#true} call assume_abort_if_not((if ~Y~0 >= 0 && ~Y~0 <= 10 then 1 else 0)); {12391#true} is VALID [2022-04-15 07:41:24,680 INFO L290 TraceCheckUtils]: 13: Hoare triple {12391#true} ~cond := #in~cond; {12391#true} is VALID [2022-04-15 07:41:24,681 INFO L290 TraceCheckUtils]: 14: Hoare triple {12391#true} assume !(0 == ~cond); {12391#true} is VALID [2022-04-15 07:41:24,681 INFO L290 TraceCheckUtils]: 15: Hoare triple {12391#true} assume true; {12391#true} is VALID [2022-04-15 07:41:24,681 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {12391#true} {12391#true} #63#return; {12391#true} is VALID [2022-04-15 07:41:24,681 INFO L290 TraceCheckUtils]: 17: Hoare triple {12391#true} ~v~0 := 2 * ~Y~0 - ~X~0;~y~0 := 0;~x~0 := 0; {12447#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (= main_~y~0 0))} is VALID [2022-04-15 07:41:24,682 INFO L290 TraceCheckUtils]: 18: Hoare triple {12447#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (= main_~y~0 0))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {12447#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (= main_~y~0 0))} is VALID [2022-04-15 07:41:24,682 INFO L272 TraceCheckUtils]: 19: Hoare triple {12447#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {12391#true} is VALID [2022-04-15 07:41:24,682 INFO L290 TraceCheckUtils]: 20: Hoare triple {12391#true} ~cond := #in~cond; {12391#true} is VALID [2022-04-15 07:41:24,682 INFO L290 TraceCheckUtils]: 21: Hoare triple {12391#true} assume !(0 == ~cond); {12391#true} is VALID [2022-04-15 07:41:24,682 INFO L290 TraceCheckUtils]: 22: Hoare triple {12391#true} assume true; {12391#true} is VALID [2022-04-15 07:41:24,683 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {12391#true} {12447#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (= main_~y~0 0))} #65#return; {12447#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (= main_~y~0 0))} is VALID [2022-04-15 07:41:24,683 INFO L290 TraceCheckUtils]: 24: Hoare triple {12447#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (= main_~y~0 0))} assume !!(~x~0 <= ~X~0); {12447#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (= main_~y~0 0))} is VALID [2022-04-15 07:41:24,684 INFO L290 TraceCheckUtils]: 25: Hoare triple {12447#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (= main_~y~0 0))} assume !(~v~0 < 0);~v~0 := ~v~0 + 2 * (~Y~0 - ~X~0);#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {12472#(and (= main_~x~0 0) (= main_~v~0 (+ (* main_~X~0 (- 3)) (* main_~Y~0 4))) (<= main_~y~0 1))} is VALID [2022-04-15 07:41:24,685 INFO L290 TraceCheckUtils]: 26: Hoare triple {12472#(and (= main_~x~0 0) (= main_~v~0 (+ (* main_~X~0 (- 3)) (* main_~Y~0 4))) (<= main_~y~0 1))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {12476#(and (= main_~x~0 1) (= main_~v~0 (+ (* main_~X~0 (- 3)) (* main_~Y~0 4))) (<= main_~y~0 1))} is VALID [2022-04-15 07:41:24,685 INFO L290 TraceCheckUtils]: 27: Hoare triple {12476#(and (= main_~x~0 1) (= main_~v~0 (+ (* main_~X~0 (- 3)) (* main_~Y~0 4))) (<= main_~y~0 1))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {12480#(and (= main_~x~0 1) (= main_~v~0 (+ (* main_~X~0 (- 3)) (* main_~Y~0 4))) (= (* main_~X~0 main_~y~0) main_~xy~0) (= main_~yx~0 (* main_~Y~0 main_~x~0)) (<= main_~y~0 1))} is VALID [2022-04-15 07:41:24,686 INFO L272 TraceCheckUtils]: 28: Hoare triple {12480#(and (= main_~x~0 1) (= main_~v~0 (+ (* main_~X~0 (- 3)) (* main_~Y~0 4))) (= (* main_~X~0 main_~y~0) main_~xy~0) (= main_~yx~0 (* main_~Y~0 main_~x~0)) (<= main_~y~0 1))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {12391#true} is VALID [2022-04-15 07:41:24,686 INFO L290 TraceCheckUtils]: 29: Hoare triple {12391#true} ~cond := #in~cond; {12487#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-15 07:41:24,686 INFO L290 TraceCheckUtils]: 30: Hoare triple {12487#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {12491#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:41:24,687 INFO L290 TraceCheckUtils]: 31: Hoare triple {12491#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {12491#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:41:24,688 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {12491#(not (= |__VERIFIER_assert_#in~cond| 0))} {12480#(and (= main_~x~0 1) (= main_~v~0 (+ (* main_~X~0 (- 3)) (* main_~Y~0 4))) (= (* main_~X~0 main_~y~0) main_~xy~0) (= main_~yx~0 (* main_~Y~0 main_~x~0)) (<= main_~y~0 1))} #65#return; {12498#(and (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (= main_~x~0 1) (= main_~v~0 (+ (* main_~X~0 (- 3)) (* main_~Y~0 4))) (<= main_~y~0 1))} is VALID [2022-04-15 07:41:24,689 INFO L290 TraceCheckUtils]: 33: Hoare triple {12498#(and (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (= main_~x~0 1) (= main_~v~0 (+ (* main_~X~0 (- 3)) (* main_~Y~0 4))) (<= main_~y~0 1))} assume !!(~x~0 <= ~X~0); {12498#(and (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (= main_~x~0 1) (= main_~v~0 (+ (* main_~X~0 (- 3)) (* main_~Y~0 4))) (<= main_~y~0 1))} is VALID [2022-04-15 07:41:24,690 INFO L290 TraceCheckUtils]: 34: Hoare triple {12498#(and (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (= main_~x~0 1) (= main_~v~0 (+ (* main_~X~0 (- 3)) (* main_~Y~0 4))) (<= main_~y~0 1))} assume !(~v~0 < 0);~v~0 := ~v~0 + 2 * (~Y~0 - ~X~0);#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {12505#(and (= main_~v~0 (+ (* main_~Y~0 6) (* main_~X~0 (- 5)))) (<= main_~y~0 2) (= main_~x~0 1))} is VALID [2022-04-15 07:41:24,690 INFO L290 TraceCheckUtils]: 35: Hoare triple {12505#(and (= main_~v~0 (+ (* main_~Y~0 6) (* main_~X~0 (- 5)))) (<= main_~y~0 2) (= main_~x~0 1))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {12509#(and (= (+ (- 1) main_~x~0) 1) (= main_~v~0 (+ (* main_~Y~0 6) (* main_~X~0 (- 5)))) (<= main_~y~0 2))} is VALID [2022-04-15 07:41:24,691 INFO L290 TraceCheckUtils]: 36: Hoare triple {12509#(and (= (+ (- 1) main_~x~0) 1) (= main_~v~0 (+ (* main_~Y~0 6) (* main_~X~0 (- 5)))) (<= main_~y~0 2))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {12513#(and (= (+ (- 1) main_~x~0) 1) (= main_~v~0 (+ (* main_~Y~0 6) (* main_~X~0 (- 5)))) (<= main_~y~0 2) (= (* main_~X~0 main_~y~0) main_~xy~0) (= main_~yx~0 (* main_~Y~0 main_~x~0)))} is VALID [2022-04-15 07:41:24,691 INFO L272 TraceCheckUtils]: 37: Hoare triple {12513#(and (= (+ (- 1) main_~x~0) 1) (= main_~v~0 (+ (* main_~Y~0 6) (* main_~X~0 (- 5)))) (<= main_~y~0 2) (= (* main_~X~0 main_~y~0) main_~xy~0) (= main_~yx~0 (* main_~Y~0 main_~x~0)))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {12391#true} is VALID [2022-04-15 07:41:24,691 INFO L290 TraceCheckUtils]: 38: Hoare triple {12391#true} ~cond := #in~cond; {12487#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-15 07:41:24,691 INFO L290 TraceCheckUtils]: 39: Hoare triple {12487#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {12491#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:41:24,692 INFO L290 TraceCheckUtils]: 40: Hoare triple {12491#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {12491#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:41:24,693 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {12491#(not (= |__VERIFIER_assert_#in~cond| 0))} {12513#(and (= (+ (- 1) main_~x~0) 1) (= main_~v~0 (+ (* main_~Y~0 6) (* main_~X~0 (- 5)))) (<= main_~y~0 2) (= (* main_~X~0 main_~y~0) main_~xy~0) (= main_~yx~0 (* main_~Y~0 main_~x~0)))} #65#return; {12529#(and (= (+ (- 1) main_~x~0) 1) (= main_~v~0 (+ (* main_~Y~0 6) (* main_~X~0 (- 5)))) (<= main_~y~0 2) (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)))} is VALID [2022-04-15 07:41:24,694 INFO L290 TraceCheckUtils]: 42: Hoare triple {12529#(and (= (+ (- 1) main_~x~0) 1) (= main_~v~0 (+ (* main_~Y~0 6) (* main_~X~0 (- 5)))) (<= main_~y~0 2) (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)))} assume !!(~x~0 <= ~X~0); {12533#(and (<= main_~x~0 main_~X~0) (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (= main_~x~0 2) (= (+ main_~v~0 (* 5 main_~X~0)) (* main_~Y~0 6)))} is VALID [2022-04-15 07:41:24,696 INFO L290 TraceCheckUtils]: 43: Hoare triple {12533#(and (<= main_~x~0 main_~X~0) (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (= main_~x~0 2) (= (+ main_~v~0 (* 5 main_~X~0)) (* main_~Y~0 6)))} assume !(~v~0 < 0);~v~0 := ~v~0 + 2 * (~Y~0 - ~X~0);#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {12537#(and (<= main_~x~0 main_~X~0) (= (+ (* main_~Y~0 8) (* main_~X~0 (- 7))) main_~v~0) (= main_~x~0 2) (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 (+ (- 1) main_~y~0)) 2) (* main_~Y~0 6) (* main_~X~0 (- 4)))))} is VALID [2022-04-15 07:41:24,697 INFO L290 TraceCheckUtils]: 44: Hoare triple {12537#(and (<= main_~x~0 main_~X~0) (= (+ (* main_~Y~0 8) (* main_~X~0 (- 7))) main_~v~0) (= main_~x~0 2) (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 (+ (- 1) main_~y~0)) 2) (* main_~Y~0 6) (* main_~X~0 (- 4)))))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {12541#(and (= (+ (* main_~Y~0 8) (* main_~X~0 (- 7))) main_~v~0) (= (+ (- 1) main_~x~0) 2) (<= main_~x~0 (+ main_~X~0 1)) (= (+ (* main_~Y~0 2) (* 2 (* (+ (- 1) main_~x~0) main_~Y~0))) (+ (* (* main_~X~0 (+ (- 1) main_~y~0)) 2) (* main_~Y~0 6) (* main_~X~0 (- 4)))))} is VALID [2022-04-15 07:41:24,700 INFO L290 TraceCheckUtils]: 45: Hoare triple {12541#(and (= (+ (* main_~Y~0 8) (* main_~X~0 (- 7))) main_~v~0) (= (+ (- 1) main_~x~0) 2) (<= main_~x~0 (+ main_~X~0 1)) (= (+ (* main_~Y~0 2) (* 2 (* (+ (- 1) main_~x~0) main_~Y~0))) (+ (* (* main_~X~0 (+ (- 1) main_~y~0)) 2) (* main_~Y~0 6) (* main_~X~0 (- 4)))))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {12545#(and (= (* main_~Y~0 8) (+ main_~v~0 (* 7 main_~X~0))) (= (* main_~Y~0 3) main_~yx~0) (<= 2 main_~X~0) (= (* main_~X~0 (div (* main_~X~0 3) main_~X~0)) main_~xy~0))} is VALID [2022-04-15 07:41:24,702 INFO L272 TraceCheckUtils]: 46: Hoare triple {12545#(and (= (* main_~Y~0 8) (+ main_~v~0 (* 7 main_~X~0))) (= (* main_~Y~0 3) main_~yx~0) (<= 2 main_~X~0) (= (* main_~X~0 (div (* main_~X~0 3) main_~X~0)) main_~xy~0))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {12549#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 07:41:24,703 INFO L290 TraceCheckUtils]: 47: Hoare triple {12549#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {12553#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 07:41:24,703 INFO L290 TraceCheckUtils]: 48: Hoare triple {12553#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {12392#false} is VALID [2022-04-15 07:41:24,703 INFO L290 TraceCheckUtils]: 49: Hoare triple {12392#false} assume !false; {12392#false} is VALID [2022-04-15 07:41:24,704 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 10 proven. 23 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-15 07:41:24,704 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 07:41:27,521 INFO L290 TraceCheckUtils]: 49: Hoare triple {12392#false} assume !false; {12392#false} is VALID [2022-04-15 07:41:27,521 INFO L290 TraceCheckUtils]: 48: Hoare triple {12553#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {12392#false} is VALID [2022-04-15 07:41:27,522 INFO L290 TraceCheckUtils]: 47: Hoare triple {12549#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {12553#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 07:41:27,522 INFO L272 TraceCheckUtils]: 46: Hoare triple {12569#(= (+ (* 2 main_~xy~0) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 main_~yx~0)))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {12549#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 07:41:27,523 INFO L290 TraceCheckUtils]: 45: Hoare triple {12573#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {12569#(= (+ (* 2 main_~xy~0) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 main_~yx~0)))} is VALID [2022-04-15 07:41:27,525 INFO L290 TraceCheckUtils]: 44: Hoare triple {12577#(= (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0))))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {12573#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} is VALID [2022-04-15 07:41:27,527 INFO L290 TraceCheckUtils]: 43: Hoare triple {12573#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} assume !(~v~0 < 0);~v~0 := ~v~0 + 2 * (~Y~0 - ~X~0);#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {12577#(= (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0))))} is VALID [2022-04-15 07:41:27,527 INFO L290 TraceCheckUtils]: 42: Hoare triple {12584#(or (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (not (<= main_~x~0 main_~X~0)))} assume !!(~x~0 <= ~X~0); {12573#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} is VALID [2022-04-15 07:41:27,528 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {12491#(not (= |__VERIFIER_assert_#in~cond| 0))} {12588#(or (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (not (= (+ (* 2 main_~xy~0) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 main_~yx~0)))) (not (<= main_~x~0 main_~X~0)))} #65#return; {12584#(or (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (not (<= main_~x~0 main_~X~0)))} is VALID [2022-04-15 07:41:27,528 INFO L290 TraceCheckUtils]: 40: Hoare triple {12491#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {12491#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:41:27,529 INFO L290 TraceCheckUtils]: 39: Hoare triple {12598#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {12491#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:41:27,529 INFO L290 TraceCheckUtils]: 38: Hoare triple {12391#true} ~cond := #in~cond; {12598#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 07:41:27,529 INFO L272 TraceCheckUtils]: 37: Hoare triple {12588#(or (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (not (= (+ (* 2 main_~xy~0) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 main_~yx~0)))) (not (<= main_~x~0 main_~X~0)))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {12391#true} is VALID [2022-04-15 07:41:27,530 INFO L290 TraceCheckUtils]: 36: Hoare triple {12391#true} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {12588#(or (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (not (= (+ (* 2 main_~xy~0) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 main_~yx~0)))) (not (<= main_~x~0 main_~X~0)))} is VALID [2022-04-15 07:41:27,530 INFO L290 TraceCheckUtils]: 35: Hoare triple {12391#true} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {12391#true} is VALID [2022-04-15 07:41:27,530 INFO L290 TraceCheckUtils]: 34: Hoare triple {12391#true} assume !(~v~0 < 0);~v~0 := ~v~0 + 2 * (~Y~0 - ~X~0);#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {12391#true} is VALID [2022-04-15 07:41:27,530 INFO L290 TraceCheckUtils]: 33: Hoare triple {12391#true} assume !!(~x~0 <= ~X~0); {12391#true} is VALID [2022-04-15 07:41:27,530 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {12391#true} {12391#true} #65#return; {12391#true} is VALID [2022-04-15 07:41:27,530 INFO L290 TraceCheckUtils]: 31: Hoare triple {12391#true} assume true; {12391#true} is VALID [2022-04-15 07:41:27,530 INFO L290 TraceCheckUtils]: 30: Hoare triple {12391#true} assume !(0 == ~cond); {12391#true} is VALID [2022-04-15 07:41:27,530 INFO L290 TraceCheckUtils]: 29: Hoare triple {12391#true} ~cond := #in~cond; {12391#true} is VALID [2022-04-15 07:41:27,530 INFO L272 TraceCheckUtils]: 28: Hoare triple {12391#true} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {12391#true} is VALID [2022-04-15 07:41:27,531 INFO L290 TraceCheckUtils]: 27: Hoare triple {12391#true} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {12391#true} is VALID [2022-04-15 07:41:27,531 INFO L290 TraceCheckUtils]: 26: Hoare triple {12391#true} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {12391#true} is VALID [2022-04-15 07:41:27,531 INFO L290 TraceCheckUtils]: 25: Hoare triple {12391#true} assume !(~v~0 < 0);~v~0 := ~v~0 + 2 * (~Y~0 - ~X~0);#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {12391#true} is VALID [2022-04-15 07:41:27,531 INFO L290 TraceCheckUtils]: 24: Hoare triple {12391#true} assume !!(~x~0 <= ~X~0); {12391#true} is VALID [2022-04-15 07:41:27,531 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {12391#true} {12391#true} #65#return; {12391#true} is VALID [2022-04-15 07:41:27,531 INFO L290 TraceCheckUtils]: 22: Hoare triple {12391#true} assume true; {12391#true} is VALID [2022-04-15 07:41:27,531 INFO L290 TraceCheckUtils]: 21: Hoare triple {12391#true} assume !(0 == ~cond); {12391#true} is VALID [2022-04-15 07:41:27,531 INFO L290 TraceCheckUtils]: 20: Hoare triple {12391#true} ~cond := #in~cond; {12391#true} is VALID [2022-04-15 07:41:27,531 INFO L272 TraceCheckUtils]: 19: Hoare triple {12391#true} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {12391#true} is VALID [2022-04-15 07:41:27,531 INFO L290 TraceCheckUtils]: 18: Hoare triple {12391#true} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {12391#true} is VALID [2022-04-15 07:41:27,531 INFO L290 TraceCheckUtils]: 17: Hoare triple {12391#true} ~v~0 := 2 * ~Y~0 - ~X~0;~y~0 := 0;~x~0 := 0; {12391#true} is VALID [2022-04-15 07:41:27,531 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {12391#true} {12391#true} #63#return; {12391#true} is VALID [2022-04-15 07:41:27,531 INFO L290 TraceCheckUtils]: 15: Hoare triple {12391#true} assume true; {12391#true} is VALID [2022-04-15 07:41:27,531 INFO L290 TraceCheckUtils]: 14: Hoare triple {12391#true} assume !(0 == ~cond); {12391#true} is VALID [2022-04-15 07:41:27,532 INFO L290 TraceCheckUtils]: 13: Hoare triple {12391#true} ~cond := #in~cond; {12391#true} is VALID [2022-04-15 07:41:27,532 INFO L272 TraceCheckUtils]: 12: Hoare triple {12391#true} call assume_abort_if_not((if ~Y~0 >= 0 && ~Y~0 <= 10 then 1 else 0)); {12391#true} is VALID [2022-04-15 07:41:27,532 INFO L290 TraceCheckUtils]: 11: Hoare triple {12391#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~Y~0 := #t~nondet5;havoc #t~nondet5; {12391#true} is VALID [2022-04-15 07:41:27,532 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {12391#true} {12391#true} #61#return; {12391#true} is VALID [2022-04-15 07:41:27,532 INFO L290 TraceCheckUtils]: 9: Hoare triple {12391#true} assume true; {12391#true} is VALID [2022-04-15 07:41:27,532 INFO L290 TraceCheckUtils]: 8: Hoare triple {12391#true} assume !(0 == ~cond); {12391#true} is VALID [2022-04-15 07:41:27,532 INFO L290 TraceCheckUtils]: 7: Hoare triple {12391#true} ~cond := #in~cond; {12391#true} is VALID [2022-04-15 07:41:27,532 INFO L272 TraceCheckUtils]: 6: Hoare triple {12391#true} call assume_abort_if_not((if ~X~0 >= 0 && ~X~0 <= 10 then 1 else 0)); {12391#true} is VALID [2022-04-15 07:41:27,532 INFO L290 TraceCheckUtils]: 5: Hoare triple {12391#true} havoc ~X~0;havoc ~Y~0;havoc ~x~0;havoc ~y~0;havoc ~v~0;havoc ~xy~0;havoc ~yx~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~X~0 := #t~nondet4;havoc #t~nondet4; {12391#true} is VALID [2022-04-15 07:41:27,532 INFO L272 TraceCheckUtils]: 4: Hoare triple {12391#true} call #t~ret8 := main(); {12391#true} is VALID [2022-04-15 07:41:27,532 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12391#true} {12391#true} #69#return; {12391#true} is VALID [2022-04-15 07:41:27,532 INFO L290 TraceCheckUtils]: 2: Hoare triple {12391#true} assume true; {12391#true} is VALID [2022-04-15 07:41:27,532 INFO L290 TraceCheckUtils]: 1: Hoare triple {12391#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(15, 2);call #Ultimate.allocInit(12, 3); {12391#true} is VALID [2022-04-15 07:41:27,532 INFO L272 TraceCheckUtils]: 0: Hoare triple {12391#true} call ULTIMATE.init(); {12391#true} is VALID [2022-04-15 07:41:27,533 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 24 proven. 2 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-04-15 07:41:27,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:41:27,533 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1182231932] [2022-04-15 07:41:27,533 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 07:41:27,533 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1155230109] [2022-04-15 07:41:27,533 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1155230109] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 07:41:27,533 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 07:41:27,533 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 11] total 25 [2022-04-15 07:41:27,534 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:41:27,534 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [899196738] [2022-04-15 07:41:27,534 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [899196738] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:41:27,534 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:41:27,534 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-04-15 07:41:27,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [319154939] [2022-04-15 07:41:27,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:41:27,534 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 16 states have (on average 1.875) internal successors, (30), 17 states have internal predecessors, (30), 5 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) Word has length 50 [2022-04-15 07:41:27,534 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:41:27,534 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 19 states, 16 states have (on average 1.875) internal successors, (30), 17 states have internal predecessors, (30), 5 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-15 07:41:27,575 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:41:27,576 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-04-15 07:41:27,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:41:27,576 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-04-15 07:41:27,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=521, Unknown=0, NotChecked=0, Total=600 [2022-04-15 07:41:27,576 INFO L87 Difference]: Start difference. First operand 121 states and 136 transitions. Second operand has 19 states, 16 states have (on average 1.875) internal successors, (30), 17 states have internal predecessors, (30), 5 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-15 07:41:31,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:41:31,626 INFO L93 Difference]: Finished difference Result 134 states and 151 transitions. [2022-04-15 07:41:31,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-04-15 07:41:31,626 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 16 states have (on average 1.875) internal successors, (30), 17 states have internal predecessors, (30), 5 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) Word has length 50 [2022-04-15 07:41:31,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:41:31,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 16 states have (on average 1.875) internal successors, (30), 17 states have internal predecessors, (30), 5 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-15 07:41:31,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 65 transitions. [2022-04-15 07:41:31,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 16 states have (on average 1.875) internal successors, (30), 17 states have internal predecessors, (30), 5 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-15 07:41:31,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 65 transitions. [2022-04-15 07:41:31,628 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 65 transitions. [2022-04-15 07:41:31,691 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-15 07:41:31,693 INFO L225 Difference]: With dead ends: 134 [2022-04-15 07:41:31,693 INFO L226 Difference]: Without dead ends: 132 [2022-04-15 07:41:31,694 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 74 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=129, Invalid=801, Unknown=0, NotChecked=0, Total=930 [2022-04-15 07:41:31,694 INFO L913 BasicCegarLoop]: 28 mSDtfsCounter, 20 mSDsluCounter, 228 mSDsCounter, 0 mSdLazyCounter, 626 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 256 SdHoareTripleChecker+Invalid, 630 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 626 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-04-15 07:41:31,694 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 256 Invalid, 630 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 626 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-04-15 07:41:31,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2022-04-15 07:41:31,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 121. [2022-04-15 07:41:31,987 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:41:31,987 INFO L82 GeneralOperation]: Start isEquivalent. First operand 132 states. Second operand has 121 states, 89 states have (on average 1.1235955056179776) internal successors, (100), 92 states have internal predecessors, (100), 19 states have call successors, (19), 13 states have call predecessors, (19), 12 states have return successors, (17), 15 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-15 07:41:31,987 INFO L74 IsIncluded]: Start isIncluded. First operand 132 states. Second operand has 121 states, 89 states have (on average 1.1235955056179776) internal successors, (100), 92 states have internal predecessors, (100), 19 states have call successors, (19), 13 states have call predecessors, (19), 12 states have return successors, (17), 15 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-15 07:41:31,987 INFO L87 Difference]: Start difference. First operand 132 states. Second operand has 121 states, 89 states have (on average 1.1235955056179776) internal successors, (100), 92 states have internal predecessors, (100), 19 states have call successors, (19), 13 states have call predecessors, (19), 12 states have return successors, (17), 15 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-15 07:41:31,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:41:31,989 INFO L93 Difference]: Finished difference Result 132 states and 149 transitions. [2022-04-15 07:41:31,989 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 149 transitions. [2022-04-15 07:41:31,991 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:41:31,991 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:41:31,991 INFO L74 IsIncluded]: Start isIncluded. First operand has 121 states, 89 states have (on average 1.1235955056179776) internal successors, (100), 92 states have internal predecessors, (100), 19 states have call successors, (19), 13 states have call predecessors, (19), 12 states have return successors, (17), 15 states have call predecessors, (17), 17 states have call successors, (17) Second operand 132 states. [2022-04-15 07:41:31,992 INFO L87 Difference]: Start difference. First operand has 121 states, 89 states have (on average 1.1235955056179776) internal successors, (100), 92 states have internal predecessors, (100), 19 states have call successors, (19), 13 states have call predecessors, (19), 12 states have return successors, (17), 15 states have call predecessors, (17), 17 states have call successors, (17) Second operand 132 states. [2022-04-15 07:41:31,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:41:31,993 INFO L93 Difference]: Finished difference Result 132 states and 149 transitions. [2022-04-15 07:41:31,993 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 149 transitions. [2022-04-15 07:41:31,994 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:41:31,994 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:41:31,994 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:41:31,994 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:41:31,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 89 states have (on average 1.1235955056179776) internal successors, (100), 92 states have internal predecessors, (100), 19 states have call successors, (19), 13 states have call predecessors, (19), 12 states have return successors, (17), 15 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-15 07:41:31,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 136 transitions. [2022-04-15 07:41:31,996 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 136 transitions. Word has length 50 [2022-04-15 07:41:31,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:41:31,996 INFO L478 AbstractCegarLoop]: Abstraction has 121 states and 136 transitions. [2022-04-15 07:41:31,996 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 16 states have (on average 1.875) internal successors, (30), 17 states have internal predecessors, (30), 5 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-15 07:41:31,996 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 121 states and 136 transitions. [2022-04-15 07:41:36,303 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 136 edges. 134 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-15 07:41:36,304 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 136 transitions. [2022-04-15 07:41:36,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-04-15 07:41:36,304 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:41:36,304 INFO L499 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 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] [2022-04-15 07:41:36,321 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-15 07:41:36,504 WARN L460 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-15 07:41:36,505 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:41:36,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:41:36,505 INFO L85 PathProgramCache]: Analyzing trace with hash 55892592, now seen corresponding path program 3 times [2022-04-15 07:41:36,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:41:36,505 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1699968610] [2022-04-15 07:41:36,506 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 07:41:36,506 INFO L85 PathProgramCache]: Analyzing trace with hash 55892592, now seen corresponding path program 4 times [2022-04-15 07:41:36,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:41:36,506 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1621348520] [2022-04-15 07:41:36,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:41:36,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:41:36,515 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 07:41:36,515 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [676293516] [2022-04-15 07:41:36,515 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 07:41:36,515 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 07:41:36,516 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 07:41:36,516 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-15 07:41:36,517 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-15 07:41:36,554 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 07:41:36,554 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 07:41:36,555 INFO L263 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-15 07:41:36,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:41:36,565 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 07:41:37,376 INFO L272 TraceCheckUtils]: 0: Hoare triple {13501#true} call ULTIMATE.init(); {13501#true} is VALID [2022-04-15 07:41:37,376 INFO L290 TraceCheckUtils]: 1: Hoare triple {13501#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(15, 2);call #Ultimate.allocInit(12, 3); {13501#true} is VALID [2022-04-15 07:41:37,376 INFO L290 TraceCheckUtils]: 2: Hoare triple {13501#true} assume true; {13501#true} is VALID [2022-04-15 07:41:37,376 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13501#true} {13501#true} #69#return; {13501#true} is VALID [2022-04-15 07:41:37,377 INFO L272 TraceCheckUtils]: 4: Hoare triple {13501#true} call #t~ret8 := main(); {13501#true} is VALID [2022-04-15 07:41:37,377 INFO L290 TraceCheckUtils]: 5: Hoare triple {13501#true} havoc ~X~0;havoc ~Y~0;havoc ~x~0;havoc ~y~0;havoc ~v~0;havoc ~xy~0;havoc ~yx~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~X~0 := #t~nondet4;havoc #t~nondet4; {13501#true} is VALID [2022-04-15 07:41:37,377 INFO L272 TraceCheckUtils]: 6: Hoare triple {13501#true} call assume_abort_if_not((if ~X~0 >= 0 && ~X~0 <= 10 then 1 else 0)); {13501#true} is VALID [2022-04-15 07:41:37,377 INFO L290 TraceCheckUtils]: 7: Hoare triple {13501#true} ~cond := #in~cond; {13501#true} is VALID [2022-04-15 07:41:37,377 INFO L290 TraceCheckUtils]: 8: Hoare triple {13501#true} assume !(0 == ~cond); {13501#true} is VALID [2022-04-15 07:41:37,377 INFO L290 TraceCheckUtils]: 9: Hoare triple {13501#true} assume true; {13501#true} is VALID [2022-04-15 07:41:37,377 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {13501#true} {13501#true} #61#return; {13501#true} is VALID [2022-04-15 07:41:37,377 INFO L290 TraceCheckUtils]: 11: Hoare triple {13501#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~Y~0 := #t~nondet5;havoc #t~nondet5; {13501#true} is VALID [2022-04-15 07:41:37,377 INFO L272 TraceCheckUtils]: 12: Hoare triple {13501#true} call assume_abort_if_not((if ~Y~0 >= 0 && ~Y~0 <= 10 then 1 else 0)); {13501#true} is VALID [2022-04-15 07:41:37,377 INFO L290 TraceCheckUtils]: 13: Hoare triple {13501#true} ~cond := #in~cond; {13501#true} is VALID [2022-04-15 07:41:37,377 INFO L290 TraceCheckUtils]: 14: Hoare triple {13501#true} assume !(0 == ~cond); {13501#true} is VALID [2022-04-15 07:41:37,377 INFO L290 TraceCheckUtils]: 15: Hoare triple {13501#true} assume true; {13501#true} is VALID [2022-04-15 07:41:37,377 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {13501#true} {13501#true} #63#return; {13501#true} is VALID [2022-04-15 07:41:37,378 INFO L290 TraceCheckUtils]: 17: Hoare triple {13501#true} ~v~0 := 2 * ~Y~0 - ~X~0;~y~0 := 0;~x~0 := 0; {13557#(and (<= main_~x~0 0) (<= (* main_~Y~0 2) (+ main_~X~0 main_~v~0)))} is VALID [2022-04-15 07:41:37,378 INFO L290 TraceCheckUtils]: 18: Hoare triple {13557#(and (<= main_~x~0 0) (<= (* main_~Y~0 2) (+ main_~X~0 main_~v~0)))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {13557#(and (<= main_~x~0 0) (<= (* main_~Y~0 2) (+ main_~X~0 main_~v~0)))} is VALID [2022-04-15 07:41:37,378 INFO L272 TraceCheckUtils]: 19: Hoare triple {13557#(and (<= main_~x~0 0) (<= (* main_~Y~0 2) (+ main_~X~0 main_~v~0)))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {13501#true} is VALID [2022-04-15 07:41:37,378 INFO L290 TraceCheckUtils]: 20: Hoare triple {13501#true} ~cond := #in~cond; {13501#true} is VALID [2022-04-15 07:41:37,378 INFO L290 TraceCheckUtils]: 21: Hoare triple {13501#true} assume !(0 == ~cond); {13501#true} is VALID [2022-04-15 07:41:37,378 INFO L290 TraceCheckUtils]: 22: Hoare triple {13501#true} assume true; {13501#true} is VALID [2022-04-15 07:41:37,379 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {13501#true} {13557#(and (<= main_~x~0 0) (<= (* main_~Y~0 2) (+ main_~X~0 main_~v~0)))} #65#return; {13557#(and (<= main_~x~0 0) (<= (* main_~Y~0 2) (+ main_~X~0 main_~v~0)))} is VALID [2022-04-15 07:41:37,379 INFO L290 TraceCheckUtils]: 24: Hoare triple {13557#(and (<= main_~x~0 0) (<= (* main_~Y~0 2) (+ main_~X~0 main_~v~0)))} assume !!(~x~0 <= ~X~0); {13557#(and (<= main_~x~0 0) (<= (* main_~Y~0 2) (+ main_~X~0 main_~v~0)))} is VALID [2022-04-15 07:41:37,380 INFO L290 TraceCheckUtils]: 25: Hoare triple {13557#(and (<= main_~x~0 0) (<= (* main_~Y~0 2) (+ main_~X~0 main_~v~0)))} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {13582#(and (<= main_~x~0 0) (< (div (+ (- 1) (* (- 1) main_~v~0)) (- 2)) (+ (div (+ (- 1) main_~X~0) 2) 1)))} is VALID [2022-04-15 07:41:37,382 INFO L290 TraceCheckUtils]: 26: Hoare triple {13582#(and (<= main_~x~0 0) (< (div (+ (- 1) (* (- 1) main_~v~0)) (- 2)) (+ (div (+ (- 1) main_~X~0) 2) 1)))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {13586#(and (<= main_~x~0 1) (< (div (+ (- 1) (* (- 1) main_~v~0)) (- 2)) (+ (div (+ (- 1) main_~X~0) 2) 1)))} is VALID [2022-04-15 07:41:37,382 INFO L290 TraceCheckUtils]: 27: Hoare triple {13586#(and (<= main_~x~0 1) (< (div (+ (- 1) (* (- 1) main_~v~0)) (- 2)) (+ (div (+ (- 1) main_~X~0) 2) 1)))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {13586#(and (<= main_~x~0 1) (< (div (+ (- 1) (* (- 1) main_~v~0)) (- 2)) (+ (div (+ (- 1) main_~X~0) 2) 1)))} is VALID [2022-04-15 07:41:37,382 INFO L272 TraceCheckUtils]: 28: Hoare triple {13586#(and (<= main_~x~0 1) (< (div (+ (- 1) (* (- 1) main_~v~0)) (- 2)) (+ (div (+ (- 1) main_~X~0) 2) 1)))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {13501#true} is VALID [2022-04-15 07:41:37,382 INFO L290 TraceCheckUtils]: 29: Hoare triple {13501#true} ~cond := #in~cond; {13501#true} is VALID [2022-04-15 07:41:37,382 INFO L290 TraceCheckUtils]: 30: Hoare triple {13501#true} assume !(0 == ~cond); {13501#true} is VALID [2022-04-15 07:41:37,382 INFO L290 TraceCheckUtils]: 31: Hoare triple {13501#true} assume true; {13501#true} is VALID [2022-04-15 07:41:37,383 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {13501#true} {13586#(and (<= main_~x~0 1) (< (div (+ (- 1) (* (- 1) main_~v~0)) (- 2)) (+ (div (+ (- 1) main_~X~0) 2) 1)))} #65#return; {13586#(and (<= main_~x~0 1) (< (div (+ (- 1) (* (- 1) main_~v~0)) (- 2)) (+ (div (+ (- 1) main_~X~0) 2) 1)))} is VALID [2022-04-15 07:41:37,383 INFO L290 TraceCheckUtils]: 33: Hoare triple {13586#(and (<= main_~x~0 1) (< (div (+ (- 1) (* (- 1) main_~v~0)) (- 2)) (+ (div (+ (- 1) main_~X~0) 2) 1)))} assume !!(~x~0 <= ~X~0); {13586#(and (<= main_~x~0 1) (< (div (+ (- 1) (* (- 1) main_~v~0)) (- 2)) (+ (div (+ (- 1) main_~X~0) 2) 1)))} is VALID [2022-04-15 07:41:37,384 INFO L290 TraceCheckUtils]: 34: Hoare triple {13586#(and (<= main_~x~0 1) (< (div (+ (- 1) (* (- 1) main_~v~0)) (- 2)) (+ (div (+ (- 1) main_~X~0) 2) 1)))} assume !(~v~0 < 0);~v~0 := ~v~0 + 2 * (~Y~0 - ~X~0);#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {13611#(and (<= main_~x~0 1) (< 0 (div (+ (- 1) main_~X~0) 2)))} is VALID [2022-04-15 07:41:37,385 INFO L290 TraceCheckUtils]: 35: Hoare triple {13611#(and (<= main_~x~0 1) (< 0 (div (+ (- 1) main_~X~0) 2)))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {13615#(and (<= main_~x~0 2) (< 0 (div (+ (- 1) main_~X~0) 2)))} is VALID [2022-04-15 07:41:37,385 INFO L290 TraceCheckUtils]: 36: Hoare triple {13615#(and (<= main_~x~0 2) (< 0 (div (+ (- 1) main_~X~0) 2)))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {13615#(and (<= main_~x~0 2) (< 0 (div (+ (- 1) main_~X~0) 2)))} is VALID [2022-04-15 07:41:37,385 INFO L272 TraceCheckUtils]: 37: Hoare triple {13615#(and (<= main_~x~0 2) (< 0 (div (+ (- 1) main_~X~0) 2)))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {13501#true} is VALID [2022-04-15 07:41:37,385 INFO L290 TraceCheckUtils]: 38: Hoare triple {13501#true} ~cond := #in~cond; {13501#true} is VALID [2022-04-15 07:41:37,385 INFO L290 TraceCheckUtils]: 39: Hoare triple {13501#true} assume !(0 == ~cond); {13501#true} is VALID [2022-04-15 07:41:37,385 INFO L290 TraceCheckUtils]: 40: Hoare triple {13501#true} assume true; {13501#true} is VALID [2022-04-15 07:41:37,386 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {13501#true} {13615#(and (<= main_~x~0 2) (< 0 (div (+ (- 1) main_~X~0) 2)))} #65#return; {13615#(and (<= main_~x~0 2) (< 0 (div (+ (- 1) main_~X~0) 2)))} is VALID [2022-04-15 07:41:37,386 INFO L290 TraceCheckUtils]: 42: Hoare triple {13615#(and (<= main_~x~0 2) (< 0 (div (+ (- 1) main_~X~0) 2)))} assume !!(~x~0 <= ~X~0); {13615#(and (<= main_~x~0 2) (< 0 (div (+ (- 1) main_~X~0) 2)))} is VALID [2022-04-15 07:41:37,387 INFO L290 TraceCheckUtils]: 43: Hoare triple {13615#(and (<= main_~x~0 2) (< 0 (div (+ (- 1) main_~X~0) 2)))} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {13615#(and (<= main_~x~0 2) (< 0 (div (+ (- 1) main_~X~0) 2)))} is VALID [2022-04-15 07:41:37,387 INFO L290 TraceCheckUtils]: 44: Hoare triple {13615#(and (<= main_~x~0 2) (< 0 (div (+ (- 1) main_~X~0) 2)))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {13643#(and (<= main_~x~0 3) (< 0 (div (+ (- 1) main_~X~0) 2)))} is VALID [2022-04-15 07:41:37,388 INFO L290 TraceCheckUtils]: 45: Hoare triple {13643#(and (<= main_~x~0 3) (< 0 (div (+ (- 1) main_~X~0) 2)))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {13643#(and (<= main_~x~0 3) (< 0 (div (+ (- 1) main_~X~0) 2)))} is VALID [2022-04-15 07:41:37,388 INFO L272 TraceCheckUtils]: 46: Hoare triple {13643#(and (<= main_~x~0 3) (< 0 (div (+ (- 1) main_~X~0) 2)))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {13501#true} is VALID [2022-04-15 07:41:37,388 INFO L290 TraceCheckUtils]: 47: Hoare triple {13501#true} ~cond := #in~cond; {13501#true} is VALID [2022-04-15 07:41:37,388 INFO L290 TraceCheckUtils]: 48: Hoare triple {13501#true} assume !(0 == ~cond); {13501#true} is VALID [2022-04-15 07:41:37,388 INFO L290 TraceCheckUtils]: 49: Hoare triple {13501#true} assume true; {13501#true} is VALID [2022-04-15 07:41:37,389 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {13501#true} {13643#(and (<= main_~x~0 3) (< 0 (div (+ (- 1) main_~X~0) 2)))} #65#return; {13643#(and (<= main_~x~0 3) (< 0 (div (+ (- 1) main_~X~0) 2)))} is VALID [2022-04-15 07:41:37,390 INFO L290 TraceCheckUtils]: 51: Hoare triple {13643#(and (<= main_~x~0 3) (< 0 (div (+ (- 1) main_~X~0) 2)))} assume !(~x~0 <= ~X~0); {13502#false} is VALID [2022-04-15 07:41:37,390 INFO L290 TraceCheckUtils]: 52: Hoare triple {13502#false} ~xy~0 := ~x~0 * ~y~0;~yx~0 := ~Y~0 * ~x~0; {13502#false} is VALID [2022-04-15 07:41:37,390 INFO L272 TraceCheckUtils]: 53: Hoare triple {13502#false} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 + 2 * ~y~0 then 1 else 0)); {13502#false} is VALID [2022-04-15 07:41:37,390 INFO L290 TraceCheckUtils]: 54: Hoare triple {13502#false} ~cond := #in~cond; {13502#false} is VALID [2022-04-15 07:41:37,390 INFO L290 TraceCheckUtils]: 55: Hoare triple {13502#false} assume 0 == ~cond; {13502#false} is VALID [2022-04-15 07:41:37,390 INFO L290 TraceCheckUtils]: 56: Hoare triple {13502#false} assume !false; {13502#false} is VALID [2022-04-15 07:41:37,390 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 8 proven. 24 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-04-15 07:41:37,390 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 07:41:37,698 INFO L290 TraceCheckUtils]: 56: Hoare triple {13502#false} assume !false; {13502#false} is VALID [2022-04-15 07:41:37,698 INFO L290 TraceCheckUtils]: 55: Hoare triple {13502#false} assume 0 == ~cond; {13502#false} is VALID [2022-04-15 07:41:37,698 INFO L290 TraceCheckUtils]: 54: Hoare triple {13502#false} ~cond := #in~cond; {13502#false} is VALID [2022-04-15 07:41:37,698 INFO L272 TraceCheckUtils]: 53: Hoare triple {13502#false} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 + 2 * ~y~0 then 1 else 0)); {13502#false} is VALID [2022-04-15 07:41:37,698 INFO L290 TraceCheckUtils]: 52: Hoare triple {13502#false} ~xy~0 := ~x~0 * ~y~0;~yx~0 := ~Y~0 * ~x~0; {13502#false} is VALID [2022-04-15 07:41:37,699 INFO L290 TraceCheckUtils]: 51: Hoare triple {13695#(<= main_~x~0 main_~X~0)} assume !(~x~0 <= ~X~0); {13502#false} is VALID [2022-04-15 07:41:37,699 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {13501#true} {13695#(<= main_~x~0 main_~X~0)} #65#return; {13695#(<= main_~x~0 main_~X~0)} is VALID [2022-04-15 07:41:37,699 INFO L290 TraceCheckUtils]: 49: Hoare triple {13501#true} assume true; {13501#true} is VALID [2022-04-15 07:41:37,699 INFO L290 TraceCheckUtils]: 48: Hoare triple {13501#true} assume !(0 == ~cond); {13501#true} is VALID [2022-04-15 07:41:37,700 INFO L290 TraceCheckUtils]: 47: Hoare triple {13501#true} ~cond := #in~cond; {13501#true} is VALID [2022-04-15 07:41:37,700 INFO L272 TraceCheckUtils]: 46: Hoare triple {13695#(<= main_~x~0 main_~X~0)} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {13501#true} is VALID [2022-04-15 07:41:37,700 INFO L290 TraceCheckUtils]: 45: Hoare triple {13695#(<= main_~x~0 main_~X~0)} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {13695#(<= main_~x~0 main_~X~0)} is VALID [2022-04-15 07:41:37,701 INFO L290 TraceCheckUtils]: 44: Hoare triple {13717#(<= (+ main_~x~0 1) main_~X~0)} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {13695#(<= main_~x~0 main_~X~0)} is VALID [2022-04-15 07:41:37,701 INFO L290 TraceCheckUtils]: 43: Hoare triple {13717#(<= (+ main_~x~0 1) main_~X~0)} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {13717#(<= (+ main_~x~0 1) main_~X~0)} is VALID [2022-04-15 07:41:37,702 INFO L290 TraceCheckUtils]: 42: Hoare triple {13717#(<= (+ main_~x~0 1) main_~X~0)} assume !!(~x~0 <= ~X~0); {13717#(<= (+ main_~x~0 1) main_~X~0)} is VALID [2022-04-15 07:41:37,702 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {13501#true} {13717#(<= (+ main_~x~0 1) main_~X~0)} #65#return; {13717#(<= (+ main_~x~0 1) main_~X~0)} is VALID [2022-04-15 07:41:37,702 INFO L290 TraceCheckUtils]: 40: Hoare triple {13501#true} assume true; {13501#true} is VALID [2022-04-15 07:41:37,702 INFO L290 TraceCheckUtils]: 39: Hoare triple {13501#true} assume !(0 == ~cond); {13501#true} is VALID [2022-04-15 07:41:37,702 INFO L290 TraceCheckUtils]: 38: Hoare triple {13501#true} ~cond := #in~cond; {13501#true} is VALID [2022-04-15 07:41:37,702 INFO L272 TraceCheckUtils]: 37: Hoare triple {13717#(<= (+ main_~x~0 1) main_~X~0)} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {13501#true} is VALID [2022-04-15 07:41:37,711 INFO L290 TraceCheckUtils]: 36: Hoare triple {13717#(<= (+ main_~x~0 1) main_~X~0)} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {13717#(<= (+ main_~x~0 1) main_~X~0)} is VALID [2022-04-15 07:41:37,712 INFO L290 TraceCheckUtils]: 35: Hoare triple {13745#(<= (+ main_~x~0 2) main_~X~0)} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {13717#(<= (+ main_~x~0 1) main_~X~0)} is VALID [2022-04-15 07:41:37,713 INFO L290 TraceCheckUtils]: 34: Hoare triple {13749#(or (<= (+ main_~x~0 2) main_~X~0) (< main_~v~0 0))} assume !(~v~0 < 0);~v~0 := ~v~0 + 2 * (~Y~0 - ~X~0);#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {13745#(<= (+ main_~x~0 2) main_~X~0)} is VALID [2022-04-15 07:41:37,713 INFO L290 TraceCheckUtils]: 33: Hoare triple {13749#(or (<= (+ main_~x~0 2) main_~X~0) (< main_~v~0 0))} assume !!(~x~0 <= ~X~0); {13749#(or (<= (+ main_~x~0 2) main_~X~0) (< main_~v~0 0))} is VALID [2022-04-15 07:41:37,713 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {13501#true} {13749#(or (<= (+ main_~x~0 2) main_~X~0) (< main_~v~0 0))} #65#return; {13749#(or (<= (+ main_~x~0 2) main_~X~0) (< main_~v~0 0))} is VALID [2022-04-15 07:41:37,714 INFO L290 TraceCheckUtils]: 31: Hoare triple {13501#true} assume true; {13501#true} is VALID [2022-04-15 07:41:37,714 INFO L290 TraceCheckUtils]: 30: Hoare triple {13501#true} assume !(0 == ~cond); {13501#true} is VALID [2022-04-15 07:41:37,714 INFO L290 TraceCheckUtils]: 29: Hoare triple {13501#true} ~cond := #in~cond; {13501#true} is VALID [2022-04-15 07:41:37,714 INFO L272 TraceCheckUtils]: 28: Hoare triple {13749#(or (<= (+ main_~x~0 2) main_~X~0) (< main_~v~0 0))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {13501#true} is VALID [2022-04-15 07:41:37,714 INFO L290 TraceCheckUtils]: 27: Hoare triple {13749#(or (<= (+ main_~x~0 2) main_~X~0) (< main_~v~0 0))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {13749#(or (<= (+ main_~x~0 2) main_~X~0) (< main_~v~0 0))} is VALID [2022-04-15 07:41:37,715 INFO L290 TraceCheckUtils]: 26: Hoare triple {13774#(or (< main_~v~0 0) (<= (+ main_~x~0 3) main_~X~0))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {13749#(or (<= (+ main_~x~0 2) main_~X~0) (< main_~v~0 0))} is VALID [2022-04-15 07:41:37,716 INFO L290 TraceCheckUtils]: 25: Hoare triple {13778#(or (< (+ main_~v~0 (* main_~Y~0 2)) 0) (not (< main_~v~0 0)) (<= (+ main_~x~0 3) main_~X~0))} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {13774#(or (< main_~v~0 0) (<= (+ main_~x~0 3) main_~X~0))} is VALID [2022-04-15 07:41:37,716 INFO L290 TraceCheckUtils]: 24: Hoare triple {13778#(or (< (+ main_~v~0 (* main_~Y~0 2)) 0) (not (< main_~v~0 0)) (<= (+ main_~x~0 3) main_~X~0))} assume !!(~x~0 <= ~X~0); {13778#(or (< (+ main_~v~0 (* main_~Y~0 2)) 0) (not (< main_~v~0 0)) (<= (+ main_~x~0 3) main_~X~0))} is VALID [2022-04-15 07:41:37,717 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {13501#true} {13778#(or (< (+ main_~v~0 (* main_~Y~0 2)) 0) (not (< main_~v~0 0)) (<= (+ main_~x~0 3) main_~X~0))} #65#return; {13778#(or (< (+ main_~v~0 (* main_~Y~0 2)) 0) (not (< main_~v~0 0)) (<= (+ main_~x~0 3) main_~X~0))} is VALID [2022-04-15 07:41:37,717 INFO L290 TraceCheckUtils]: 22: Hoare triple {13501#true} assume true; {13501#true} is VALID [2022-04-15 07:41:37,717 INFO L290 TraceCheckUtils]: 21: Hoare triple {13501#true} assume !(0 == ~cond); {13501#true} is VALID [2022-04-15 07:41:37,717 INFO L290 TraceCheckUtils]: 20: Hoare triple {13501#true} ~cond := #in~cond; {13501#true} is VALID [2022-04-15 07:41:37,717 INFO L272 TraceCheckUtils]: 19: Hoare triple {13778#(or (< (+ main_~v~0 (* main_~Y~0 2)) 0) (not (< main_~v~0 0)) (<= (+ main_~x~0 3) main_~X~0))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {13501#true} is VALID [2022-04-15 07:41:37,717 INFO L290 TraceCheckUtils]: 18: Hoare triple {13778#(or (< (+ main_~v~0 (* main_~Y~0 2)) 0) (not (< main_~v~0 0)) (<= (+ main_~x~0 3) main_~X~0))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {13778#(or (< (+ main_~v~0 (* main_~Y~0 2)) 0) (not (< main_~v~0 0)) (<= (+ main_~x~0 3) main_~X~0))} is VALID [2022-04-15 07:41:37,718 INFO L290 TraceCheckUtils]: 17: Hoare triple {13501#true} ~v~0 := 2 * ~Y~0 - ~X~0;~y~0 := 0;~x~0 := 0; {13778#(or (< (+ main_~v~0 (* main_~Y~0 2)) 0) (not (< main_~v~0 0)) (<= (+ main_~x~0 3) main_~X~0))} is VALID [2022-04-15 07:41:37,718 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {13501#true} {13501#true} #63#return; {13501#true} is VALID [2022-04-15 07:41:37,718 INFO L290 TraceCheckUtils]: 15: Hoare triple {13501#true} assume true; {13501#true} is VALID [2022-04-15 07:41:37,718 INFO L290 TraceCheckUtils]: 14: Hoare triple {13501#true} assume !(0 == ~cond); {13501#true} is VALID [2022-04-15 07:41:37,718 INFO L290 TraceCheckUtils]: 13: Hoare triple {13501#true} ~cond := #in~cond; {13501#true} is VALID [2022-04-15 07:41:37,719 INFO L272 TraceCheckUtils]: 12: Hoare triple {13501#true} call assume_abort_if_not((if ~Y~0 >= 0 && ~Y~0 <= 10 then 1 else 0)); {13501#true} is VALID [2022-04-15 07:41:37,719 INFO L290 TraceCheckUtils]: 11: Hoare triple {13501#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~Y~0 := #t~nondet5;havoc #t~nondet5; {13501#true} is VALID [2022-04-15 07:41:37,719 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {13501#true} {13501#true} #61#return; {13501#true} is VALID [2022-04-15 07:41:37,719 INFO L290 TraceCheckUtils]: 9: Hoare triple {13501#true} assume true; {13501#true} is VALID [2022-04-15 07:41:37,719 INFO L290 TraceCheckUtils]: 8: Hoare triple {13501#true} assume !(0 == ~cond); {13501#true} is VALID [2022-04-15 07:41:37,719 INFO L290 TraceCheckUtils]: 7: Hoare triple {13501#true} ~cond := #in~cond; {13501#true} is VALID [2022-04-15 07:41:37,719 INFO L272 TraceCheckUtils]: 6: Hoare triple {13501#true} call assume_abort_if_not((if ~X~0 >= 0 && ~X~0 <= 10 then 1 else 0)); {13501#true} is VALID [2022-04-15 07:41:37,719 INFO L290 TraceCheckUtils]: 5: Hoare triple {13501#true} havoc ~X~0;havoc ~Y~0;havoc ~x~0;havoc ~y~0;havoc ~v~0;havoc ~xy~0;havoc ~yx~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~X~0 := #t~nondet4;havoc #t~nondet4; {13501#true} is VALID [2022-04-15 07:41:37,719 INFO L272 TraceCheckUtils]: 4: Hoare triple {13501#true} call #t~ret8 := main(); {13501#true} is VALID [2022-04-15 07:41:37,719 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13501#true} {13501#true} #69#return; {13501#true} is VALID [2022-04-15 07:41:37,719 INFO L290 TraceCheckUtils]: 2: Hoare triple {13501#true} assume true; {13501#true} is VALID [2022-04-15 07:41:37,719 INFO L290 TraceCheckUtils]: 1: Hoare triple {13501#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(15, 2);call #Ultimate.allocInit(12, 3); {13501#true} is VALID [2022-04-15 07:41:37,719 INFO L272 TraceCheckUtils]: 0: Hoare triple {13501#true} call ULTIMATE.init(); {13501#true} is VALID [2022-04-15 07:41:37,720 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 8 proven. 24 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-04-15 07:41:37,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:41:37,720 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1621348520] [2022-04-15 07:41:37,720 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 07:41:37,720 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [676293516] [2022-04-15 07:41:37,720 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [676293516] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 07:41:37,720 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 07:41:37,720 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2022-04-15 07:41:37,720 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:41:37,720 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1699968610] [2022-04-15 07:41:37,720 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1699968610] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:41:37,721 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:41:37,721 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-15 07:41:37,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1140945641] [2022-04-15 07:41:37,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:41:37,721 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 6 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) Word has length 57 [2022-04-15 07:41:37,721 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:41:37,721 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 6 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2022-04-15 07:41:37,755 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-15 07:41:37,755 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-15 07:41:37,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:41:37,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-15 07:41:37,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2022-04-15 07:41:37,756 INFO L87 Difference]: Start difference. First operand 121 states and 136 transitions. Second operand has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 6 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2022-04-15 07:41:38,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:41:38,368 INFO L93 Difference]: Finished difference Result 133 states and 149 transitions. [2022-04-15 07:41:38,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-15 07:41:38,368 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 6 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) Word has length 57 [2022-04-15 07:41:38,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:41:38,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 6 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2022-04-15 07:41:38,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 65 transitions. [2022-04-15 07:41:38,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 6 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2022-04-15 07:41:38,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 65 transitions. [2022-04-15 07:41:38,371 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 65 transitions. [2022-04-15 07:41:38,456 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-15 07:41:38,458 INFO L225 Difference]: With dead ends: 133 [2022-04-15 07:41:38,458 INFO L226 Difference]: Without dead ends: 125 [2022-04-15 07:41:38,459 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2022-04-15 07:41:38,459 INFO L913 BasicCegarLoop]: 32 mSDtfsCounter, 5 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 07:41:38,460 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [5 Valid, 122 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 07:41:38,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2022-04-15 07:41:38,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 121. [2022-04-15 07:41:38,727 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:41:38,728 INFO L82 GeneralOperation]: Start isEquivalent. First operand 125 states. Second operand has 121 states, 89 states have (on average 1.1235955056179776) internal successors, (100), 92 states have internal predecessors, (100), 19 states have call successors, (19), 13 states have call predecessors, (19), 12 states have return successors, (17), 15 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-15 07:41:38,728 INFO L74 IsIncluded]: Start isIncluded. First operand 125 states. Second operand has 121 states, 89 states have (on average 1.1235955056179776) internal successors, (100), 92 states have internal predecessors, (100), 19 states have call successors, (19), 13 states have call predecessors, (19), 12 states have return successors, (17), 15 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-15 07:41:38,728 INFO L87 Difference]: Start difference. First operand 125 states. Second operand has 121 states, 89 states have (on average 1.1235955056179776) internal successors, (100), 92 states have internal predecessors, (100), 19 states have call successors, (19), 13 states have call predecessors, (19), 12 states have return successors, (17), 15 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-15 07:41:38,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:41:38,730 INFO L93 Difference]: Finished difference Result 125 states and 141 transitions. [2022-04-15 07:41:38,730 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 141 transitions. [2022-04-15 07:41:38,730 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:41:38,730 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:41:38,730 INFO L74 IsIncluded]: Start isIncluded. First operand has 121 states, 89 states have (on average 1.1235955056179776) internal successors, (100), 92 states have internal predecessors, (100), 19 states have call successors, (19), 13 states have call predecessors, (19), 12 states have return successors, (17), 15 states have call predecessors, (17), 17 states have call successors, (17) Second operand 125 states. [2022-04-15 07:41:38,731 INFO L87 Difference]: Start difference. First operand has 121 states, 89 states have (on average 1.1235955056179776) internal successors, (100), 92 states have internal predecessors, (100), 19 states have call successors, (19), 13 states have call predecessors, (19), 12 states have return successors, (17), 15 states have call predecessors, (17), 17 states have call successors, (17) Second operand 125 states. [2022-04-15 07:41:38,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:41:38,733 INFO L93 Difference]: Finished difference Result 125 states and 141 transitions. [2022-04-15 07:41:38,733 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 141 transitions. [2022-04-15 07:41:38,733 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:41:38,733 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:41:38,734 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:41:38,734 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:41:38,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 89 states have (on average 1.1235955056179776) internal successors, (100), 92 states have internal predecessors, (100), 19 states have call successors, (19), 13 states have call predecessors, (19), 12 states have return successors, (17), 15 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-15 07:41:38,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 136 transitions. [2022-04-15 07:41:38,737 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 136 transitions. Word has length 57 [2022-04-15 07:41:38,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:41:38,737 INFO L478 AbstractCegarLoop]: Abstraction has 121 states and 136 transitions. [2022-04-15 07:41:38,737 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 6 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2022-04-15 07:41:38,737 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 121 states and 136 transitions. [2022-04-15 07:41:43,087 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 136 edges. 134 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-15 07:41:43,087 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 136 transitions. [2022-04-15 07:41:43,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-04-15 07:41:43,087 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:41:43,087 INFO L499 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 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] [2022-04-15 07:41:43,107 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-15 07:41:43,288 WARN L460 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-15 07:41:43,288 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:41:43,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:41:43,288 INFO L85 PathProgramCache]: Analyzing trace with hash 1124973290, now seen corresponding path program 5 times [2022-04-15 07:41:43,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:41:43,289 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [771879738] [2022-04-15 07:41:43,289 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 07:41:43,289 INFO L85 PathProgramCache]: Analyzing trace with hash 1124973290, now seen corresponding path program 6 times [2022-04-15 07:41:43,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:41:43,289 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1632904972] [2022-04-15 07:41:43,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:41:43,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:41:43,299 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 07:41:43,299 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1277634283] [2022-04-15 07:41:43,299 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 07:41:43,299 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 07:41:43,299 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 07:41:43,300 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-15 07:41:43,308 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-15 07:41:43,343 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-04-15 07:41:43,344 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 07:41:43,344 INFO L263 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 27 conjunts are in the unsatisfiable core [2022-04-15 07:41:43,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:41:43,357 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 07:42:01,616 WARN L914 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-15 07:42:04,771 WARN L914 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-15 07:42:09,055 WARN L914 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-15 07:42:11,993 INFO L272 TraceCheckUtils]: 0: Hoare triple {14614#true} call ULTIMATE.init(); {14614#true} is VALID [2022-04-15 07:42:11,993 INFO L290 TraceCheckUtils]: 1: Hoare triple {14614#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(15, 2);call #Ultimate.allocInit(12, 3); {14614#true} is VALID [2022-04-15 07:42:11,993 INFO L290 TraceCheckUtils]: 2: Hoare triple {14614#true} assume true; {14614#true} is VALID [2022-04-15 07:42:11,993 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14614#true} {14614#true} #69#return; {14614#true} is VALID [2022-04-15 07:42:11,993 INFO L272 TraceCheckUtils]: 4: Hoare triple {14614#true} call #t~ret8 := main(); {14614#true} is VALID [2022-04-15 07:42:11,993 INFO L290 TraceCheckUtils]: 5: Hoare triple {14614#true} havoc ~X~0;havoc ~Y~0;havoc ~x~0;havoc ~y~0;havoc ~v~0;havoc ~xy~0;havoc ~yx~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~X~0 := #t~nondet4;havoc #t~nondet4; {14614#true} is VALID [2022-04-15 07:42:11,994 INFO L272 TraceCheckUtils]: 6: Hoare triple {14614#true} call assume_abort_if_not((if ~X~0 >= 0 && ~X~0 <= 10 then 1 else 0)); {14614#true} is VALID [2022-04-15 07:42:11,994 INFO L290 TraceCheckUtils]: 7: Hoare triple {14614#true} ~cond := #in~cond; {14614#true} is VALID [2022-04-15 07:42:11,994 INFO L290 TraceCheckUtils]: 8: Hoare triple {14614#true} assume !(0 == ~cond); {14614#true} is VALID [2022-04-15 07:42:11,994 INFO L290 TraceCheckUtils]: 9: Hoare triple {14614#true} assume true; {14614#true} is VALID [2022-04-15 07:42:11,994 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {14614#true} {14614#true} #61#return; {14614#true} is VALID [2022-04-15 07:42:11,994 INFO L290 TraceCheckUtils]: 11: Hoare triple {14614#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~Y~0 := #t~nondet5;havoc #t~nondet5; {14614#true} is VALID [2022-04-15 07:42:11,994 INFO L272 TraceCheckUtils]: 12: Hoare triple {14614#true} call assume_abort_if_not((if ~Y~0 >= 0 && ~Y~0 <= 10 then 1 else 0)); {14614#true} is VALID [2022-04-15 07:42:11,994 INFO L290 TraceCheckUtils]: 13: Hoare triple {14614#true} ~cond := #in~cond; {14614#true} is VALID [2022-04-15 07:42:11,994 INFO L290 TraceCheckUtils]: 14: Hoare triple {14614#true} assume !(0 == ~cond); {14614#true} is VALID [2022-04-15 07:42:11,994 INFO L290 TraceCheckUtils]: 15: Hoare triple {14614#true} assume true; {14614#true} is VALID [2022-04-15 07:42:11,994 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {14614#true} {14614#true} #63#return; {14614#true} is VALID [2022-04-15 07:42:11,995 INFO L290 TraceCheckUtils]: 17: Hoare triple {14614#true} ~v~0 := 2 * ~Y~0 - ~X~0;~y~0 := 0;~x~0 := 0; {14670#(and (<= 0 main_~x~0) (= main_~y~0 0))} is VALID [2022-04-15 07:42:11,995 INFO L290 TraceCheckUtils]: 18: Hoare triple {14670#(and (<= 0 main_~x~0) (= main_~y~0 0))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {14670#(and (<= 0 main_~x~0) (= main_~y~0 0))} is VALID [2022-04-15 07:42:11,995 INFO L272 TraceCheckUtils]: 19: Hoare triple {14670#(and (<= 0 main_~x~0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {14614#true} is VALID [2022-04-15 07:42:11,995 INFO L290 TraceCheckUtils]: 20: Hoare triple {14614#true} ~cond := #in~cond; {14614#true} is VALID [2022-04-15 07:42:11,995 INFO L290 TraceCheckUtils]: 21: Hoare triple {14614#true} assume !(0 == ~cond); {14614#true} is VALID [2022-04-15 07:42:11,995 INFO L290 TraceCheckUtils]: 22: Hoare triple {14614#true} assume true; {14614#true} is VALID [2022-04-15 07:42:11,996 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {14614#true} {14670#(and (<= 0 main_~x~0) (= main_~y~0 0))} #65#return; {14670#(and (<= 0 main_~x~0) (= main_~y~0 0))} is VALID [2022-04-15 07:42:11,997 INFO L290 TraceCheckUtils]: 24: Hoare triple {14670#(and (<= 0 main_~x~0) (= main_~y~0 0))} assume !!(~x~0 <= ~X~0); {14692#(and (<= 0 main_~X~0) (= main_~y~0 0))} is VALID [2022-04-15 07:42:11,997 INFO L290 TraceCheckUtils]: 25: Hoare triple {14692#(and (<= 0 main_~X~0) (= main_~y~0 0))} assume !(~v~0 < 0);~v~0 := ~v~0 + 2 * (~Y~0 - ~X~0);#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {14696#(and (= main_~y~0 1) (<= 0 main_~X~0))} is VALID [2022-04-15 07:42:11,997 INFO L290 TraceCheckUtils]: 26: Hoare triple {14696#(and (= main_~y~0 1) (<= 0 main_~X~0))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {14696#(and (= main_~y~0 1) (<= 0 main_~X~0))} is VALID [2022-04-15 07:42:11,998 INFO L290 TraceCheckUtils]: 27: Hoare triple {14696#(and (= main_~y~0 1) (<= 0 main_~X~0))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {14696#(and (= main_~y~0 1) (<= 0 main_~X~0))} is VALID [2022-04-15 07:42:11,998 INFO L272 TraceCheckUtils]: 28: Hoare triple {14696#(and (= main_~y~0 1) (<= 0 main_~X~0))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {14614#true} is VALID [2022-04-15 07:42:11,998 INFO L290 TraceCheckUtils]: 29: Hoare triple {14614#true} ~cond := #in~cond; {14614#true} is VALID [2022-04-15 07:42:11,998 INFO L290 TraceCheckUtils]: 30: Hoare triple {14614#true} assume !(0 == ~cond); {14614#true} is VALID [2022-04-15 07:42:11,998 INFO L290 TraceCheckUtils]: 31: Hoare triple {14614#true} assume true; {14614#true} is VALID [2022-04-15 07:42:11,998 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {14614#true} {14696#(and (= main_~y~0 1) (<= 0 main_~X~0))} #65#return; {14696#(and (= main_~y~0 1) (<= 0 main_~X~0))} is VALID [2022-04-15 07:42:11,999 INFO L290 TraceCheckUtils]: 33: Hoare triple {14696#(and (= main_~y~0 1) (<= 0 main_~X~0))} assume !!(~x~0 <= ~X~0); {14696#(and (= main_~y~0 1) (<= 0 main_~X~0))} is VALID [2022-04-15 07:42:11,999 INFO L290 TraceCheckUtils]: 34: Hoare triple {14696#(and (= main_~y~0 1) (<= 0 main_~X~0))} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {14696#(and (= main_~y~0 1) (<= 0 main_~X~0))} is VALID [2022-04-15 07:42:11,999 INFO L290 TraceCheckUtils]: 35: Hoare triple {14696#(and (= main_~y~0 1) (<= 0 main_~X~0))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {14696#(and (= main_~y~0 1) (<= 0 main_~X~0))} is VALID [2022-04-15 07:42:12,000 INFO L290 TraceCheckUtils]: 36: Hoare triple {14696#(and (= main_~y~0 1) (<= 0 main_~X~0))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {14696#(and (= main_~y~0 1) (<= 0 main_~X~0))} is VALID [2022-04-15 07:42:12,000 INFO L272 TraceCheckUtils]: 37: Hoare triple {14696#(and (= main_~y~0 1) (<= 0 main_~X~0))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {14614#true} is VALID [2022-04-15 07:42:12,000 INFO L290 TraceCheckUtils]: 38: Hoare triple {14614#true} ~cond := #in~cond; {14614#true} is VALID [2022-04-15 07:42:12,000 INFO L290 TraceCheckUtils]: 39: Hoare triple {14614#true} assume !(0 == ~cond); {14614#true} is VALID [2022-04-15 07:42:12,000 INFO L290 TraceCheckUtils]: 40: Hoare triple {14614#true} assume true; {14614#true} is VALID [2022-04-15 07:42:12,001 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {14614#true} {14696#(and (= main_~y~0 1) (<= 0 main_~X~0))} #65#return; {14696#(and (= main_~y~0 1) (<= 0 main_~X~0))} is VALID [2022-04-15 07:42:12,001 INFO L290 TraceCheckUtils]: 42: Hoare triple {14696#(and (= main_~y~0 1) (<= 0 main_~X~0))} assume !!(~x~0 <= ~X~0); {14748#(and (<= main_~x~0 main_~X~0) (= main_~y~0 1) (<= 0 main_~X~0))} is VALID [2022-04-15 07:42:12,001 INFO L290 TraceCheckUtils]: 43: Hoare triple {14748#(and (<= main_~x~0 main_~X~0) (= main_~y~0 1) (<= 0 main_~X~0))} assume !(~v~0 < 0);~v~0 := ~v~0 + 2 * (~Y~0 - ~X~0);#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {14752#(and (= main_~y~0 2) (<= main_~x~0 main_~X~0) (<= 0 main_~X~0))} is VALID [2022-04-15 07:42:12,002 INFO L290 TraceCheckUtils]: 44: Hoare triple {14752#(and (= main_~y~0 2) (<= main_~x~0 main_~X~0) (<= 0 main_~X~0))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {14756#(and (= main_~y~0 2) (<= 0 main_~X~0) (<= main_~x~0 (+ main_~X~0 1)))} is VALID [2022-04-15 07:42:12,002 INFO L290 TraceCheckUtils]: 45: Hoare triple {14756#(and (= main_~y~0 2) (<= 0 main_~X~0) (<= main_~x~0 (+ main_~X~0 1)))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {14760#(and (= main_~y~0 2) (<= 0 main_~X~0) (= (* main_~X~0 main_~y~0) main_~xy~0) (= main_~yx~0 (* main_~Y~0 main_~x~0)) (<= main_~x~0 (+ main_~X~0 1)))} is VALID [2022-04-15 07:42:12,002 INFO L272 TraceCheckUtils]: 46: Hoare triple {14760#(and (= main_~y~0 2) (<= 0 main_~X~0) (= (* main_~X~0 main_~y~0) main_~xy~0) (= main_~yx~0 (* main_~Y~0 main_~x~0)) (<= main_~x~0 (+ main_~X~0 1)))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {14614#true} is VALID [2022-04-15 07:42:12,003 INFO L290 TraceCheckUtils]: 47: Hoare triple {14614#true} ~cond := #in~cond; {14767#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-15 07:42:12,003 INFO L290 TraceCheckUtils]: 48: Hoare triple {14767#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {14771#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:42:12,003 INFO L290 TraceCheckUtils]: 49: Hoare triple {14771#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {14771#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:42:12,005 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {14771#(not (= |__VERIFIER_assert_#in~cond| 0))} {14760#(and (= main_~y~0 2) (<= 0 main_~X~0) (= (* main_~X~0 main_~y~0) main_~xy~0) (= main_~yx~0 (* main_~Y~0 main_~x~0)) (<= main_~x~0 (+ main_~X~0 1)))} #65#return; {14778#(and (= main_~y~0 2) (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (<= 0 main_~X~0) (<= main_~x~0 (+ main_~X~0 1)))} is VALID [2022-04-15 07:42:12,005 INFO L290 TraceCheckUtils]: 51: Hoare triple {14778#(and (= main_~y~0 2) (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (<= 0 main_~X~0) (<= main_~x~0 (+ main_~X~0 1)))} assume !(~x~0 <= ~X~0); {14782#(and (= main_~y~0 2) (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (<= 0 main_~X~0) (not (<= main_~x~0 main_~X~0)) (<= main_~x~0 (+ main_~X~0 1)))} is VALID [2022-04-15 07:42:14,007 WARN L290 TraceCheckUtils]: 52: Hoare triple {14782#(and (= main_~y~0 2) (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (<= 0 main_~X~0) (not (<= main_~x~0 main_~X~0)) (<= main_~x~0 (+ main_~X~0 1)))} ~xy~0 := ~x~0 * ~y~0;~yx~0 := ~Y~0 * ~x~0; {14786#(and (= main_~y~0 2) (or (and (= (* main_~y~0 (div (+ (* main_~X~0 main_~y~0) (div (+ main_~X~0 main_~v~0) 2) (* (- 1) main_~Y~0)) main_~Y~0)) main_~xy~0) (= (mod (+ (* main_~X~0 main_~y~0) (div (+ main_~X~0 main_~v~0) 2) (* (- 1) main_~Y~0)) main_~Y~0) 0) (<= (div (+ (* main_~X~0 main_~y~0) (div (+ main_~X~0 main_~v~0) 2) (* (- 1) main_~Y~0)) main_~Y~0) (+ main_~X~0 1)) (= (mod (+ (* main_~X~0 main_~y~0 2) main_~X~0 main_~v~0) 2) 0) (not (<= (div (+ (* main_~X~0 main_~y~0) (div (+ main_~X~0 main_~v~0) 2) (* (- 1) main_~Y~0)) main_~Y~0) main_~X~0)) (not (= main_~Y~0 0)) (= main_~yx~0 (* main_~Y~0 (div (+ (* main_~X~0 main_~y~0) (div (+ main_~X~0 main_~v~0) 2) (* (- 1) main_~Y~0)) main_~Y~0)))) (and (= (mod main_~xy~0 main_~y~0) 0) (= (mod (+ (* main_~X~0 main_~y~0 2) main_~X~0 main_~v~0) 2) 0) (<= (div main_~xy~0 main_~y~0) (+ main_~X~0 1)) (< main_~X~0 (div main_~xy~0 main_~y~0)) (= main_~yx~0 0) (= 0 (+ (* main_~X~0 main_~y~0) (div (+ main_~X~0 main_~v~0) 2) (* (- 1) main_~Y~0))) (= main_~Y~0 0))) (<= 0 main_~X~0))} is UNKNOWN [2022-04-15 07:42:14,009 INFO L272 TraceCheckUtils]: 53: Hoare triple {14786#(and (= main_~y~0 2) (or (and (= (* main_~y~0 (div (+ (* main_~X~0 main_~y~0) (div (+ main_~X~0 main_~v~0) 2) (* (- 1) main_~Y~0)) main_~Y~0)) main_~xy~0) (= (mod (+ (* main_~X~0 main_~y~0) (div (+ main_~X~0 main_~v~0) 2) (* (- 1) main_~Y~0)) main_~Y~0) 0) (<= (div (+ (* main_~X~0 main_~y~0) (div (+ main_~X~0 main_~v~0) 2) (* (- 1) main_~Y~0)) main_~Y~0) (+ main_~X~0 1)) (= (mod (+ (* main_~X~0 main_~y~0 2) main_~X~0 main_~v~0) 2) 0) (not (<= (div (+ (* main_~X~0 main_~y~0) (div (+ main_~X~0 main_~v~0) 2) (* (- 1) main_~Y~0)) main_~Y~0) main_~X~0)) (not (= main_~Y~0 0)) (= main_~yx~0 (* main_~Y~0 (div (+ (* main_~X~0 main_~y~0) (div (+ main_~X~0 main_~v~0) 2) (* (- 1) main_~Y~0)) main_~Y~0)))) (and (= (mod main_~xy~0 main_~y~0) 0) (= (mod (+ (* main_~X~0 main_~y~0 2) main_~X~0 main_~v~0) 2) 0) (<= (div main_~xy~0 main_~y~0) (+ main_~X~0 1)) (< main_~X~0 (div main_~xy~0 main_~y~0)) (= main_~yx~0 0) (= 0 (+ (* main_~X~0 main_~y~0) (div (+ main_~X~0 main_~v~0) 2) (* (- 1) main_~Y~0))) (= main_~Y~0 0))) (<= 0 main_~X~0))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 + 2 * ~y~0 then 1 else 0)); {14790#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 07:42:14,010 INFO L290 TraceCheckUtils]: 54: Hoare triple {14790#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {14794#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 07:42:14,010 INFO L290 TraceCheckUtils]: 55: Hoare triple {14794#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {14615#false} is VALID [2022-04-15 07:42:14,010 INFO L290 TraceCheckUtils]: 56: Hoare triple {14615#false} assume !false; {14615#false} is VALID [2022-04-15 07:42:14,010 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 17 proven. 20 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2022-04-15 07:42:14,010 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 07:42:22,035 INFO L290 TraceCheckUtils]: 56: Hoare triple {14615#false} assume !false; {14615#false} is VALID [2022-04-15 07:42:22,036 INFO L290 TraceCheckUtils]: 55: Hoare triple {14794#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {14615#false} is VALID [2022-04-15 07:42:22,036 INFO L290 TraceCheckUtils]: 54: Hoare triple {14790#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {14794#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 07:42:22,037 INFO L272 TraceCheckUtils]: 53: Hoare triple {14810#(= (+ (* main_~y~0 2) (* main_~Y~0 2) (* 2 main_~yx~0)) (+ (* 2 main_~xy~0) main_~X~0 main_~v~0))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 + 2 * ~y~0 then 1 else 0)); {14790#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 07:42:22,038 INFO L290 TraceCheckUtils]: 52: Hoare triple {14814#(= (+ (* 2 (* main_~y~0 main_~x~0)) main_~X~0 main_~v~0) (+ (* main_~y~0 2) (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))))} ~xy~0 := ~x~0 * ~y~0;~yx~0 := ~Y~0 * ~x~0; {14810#(= (+ (* main_~y~0 2) (* main_~Y~0 2) (* 2 main_~yx~0)) (+ (* 2 main_~xy~0) main_~X~0 main_~v~0))} is VALID [2022-04-15 07:42:22,038 INFO L290 TraceCheckUtils]: 51: Hoare triple {14818#(or (<= main_~x~0 main_~X~0) (= (+ (* 2 (* main_~y~0 main_~x~0)) main_~X~0 main_~v~0) (+ (* main_~y~0 2) (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0)))))} assume !(~x~0 <= ~X~0); {14814#(= (+ (* 2 (* main_~y~0 main_~x~0)) main_~X~0 main_~v~0) (+ (* main_~y~0 2) (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))))} is VALID [2022-04-15 07:42:22,040 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {14771#(not (= |__VERIFIER_assert_#in~cond| 0))} {14822#(or (<= main_~x~0 main_~X~0) (= (+ (* 2 (* main_~y~0 main_~x~0)) (* (- 2) main_~xy~0) (* main_~Y~0 2) (* 2 main_~yx~0)) (+ (* main_~y~0 2) (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0)))))} #65#return; {14818#(or (<= main_~x~0 main_~X~0) (= (+ (* 2 (* main_~y~0 main_~x~0)) main_~X~0 main_~v~0) (+ (* main_~y~0 2) (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0)))))} is VALID [2022-04-15 07:42:22,040 INFO L290 TraceCheckUtils]: 49: Hoare triple {14771#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {14771#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:42:22,040 INFO L290 TraceCheckUtils]: 48: Hoare triple {14832#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {14771#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:42:22,040 INFO L290 TraceCheckUtils]: 47: Hoare triple {14614#true} ~cond := #in~cond; {14832#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 07:42:22,041 INFO L272 TraceCheckUtils]: 46: Hoare triple {14822#(or (<= main_~x~0 main_~X~0) (= (+ (* 2 (* main_~y~0 main_~x~0)) (* (- 2) main_~xy~0) (* main_~Y~0 2) (* 2 main_~yx~0)) (+ (* main_~y~0 2) (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0)))))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {14614#true} is VALID [2022-04-15 07:42:22,042 INFO L290 TraceCheckUtils]: 45: Hoare triple {14839#(or (<= main_~x~0 main_~X~0) (forall ((main_~Y~0 Int)) (= (+ (* 2 (* main_~y~0 main_~x~0)) (* main_~Y~0 2) (* (* main_~X~0 main_~y~0) (- 2)) (* 2 (* main_~Y~0 main_~x~0))) (+ (* main_~y~0 2) (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))))))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {14822#(or (<= main_~x~0 main_~X~0) (= (+ (* 2 (* main_~y~0 main_~x~0)) (* (- 2) main_~xy~0) (* main_~Y~0 2) (* 2 main_~yx~0)) (+ (* main_~y~0 2) (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0)))))} is VALID [2022-04-15 07:42:22,043 INFO L290 TraceCheckUtils]: 44: Hoare triple {14843#(forall ((v_main_~x~0_74 Int)) (or (forall ((main_~Y~0 Int)) (= (+ (* (* v_main_~x~0_74 main_~y~0) 2) (* main_~Y~0 2) (* 2 (* v_main_~x~0_74 main_~Y~0)) (* (* main_~X~0 main_~y~0) (- 2))) (+ (* main_~y~0 2) (* main_~Y~0 2) (* 2 (* v_main_~x~0_74 main_~Y~0))))) (not (<= v_main_~x~0_74 (+ main_~x~0 1))) (<= v_main_~x~0_74 main_~X~0)))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {14839#(or (<= main_~x~0 main_~X~0) (forall ((main_~Y~0 Int)) (= (+ (* 2 (* main_~y~0 main_~x~0)) (* main_~Y~0 2) (* (* main_~X~0 main_~y~0) (- 2)) (* 2 (* main_~Y~0 main_~x~0))) (+ (* main_~y~0 2) (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))))))} is VALID [2022-04-15 07:42:22,046 INFO L290 TraceCheckUtils]: 43: Hoare triple {14847#(forall ((main_~Y~0 Int) (v_main_~x~0_74 Int)) (or (not (<= v_main_~x~0_74 (+ main_~x~0 1))) (= (+ (* 2 (* v_main_~x~0_74 (+ main_~y~0 1))) (* main_~Y~0 2) (* 2 (* v_main_~x~0_74 main_~Y~0)) (* (* main_~X~0 (+ main_~y~0 1)) (- 2))) (+ 2 (* main_~y~0 2) (* main_~Y~0 2) (* 2 (* v_main_~x~0_74 main_~Y~0)))) (<= v_main_~x~0_74 main_~X~0)))} assume !(~v~0 < 0);~v~0 := ~v~0 + 2 * (~Y~0 - ~X~0);#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {14843#(forall ((v_main_~x~0_74 Int)) (or (forall ((main_~Y~0 Int)) (= (+ (* (* v_main_~x~0_74 main_~y~0) 2) (* main_~Y~0 2) (* 2 (* v_main_~x~0_74 main_~Y~0)) (* (* main_~X~0 main_~y~0) (- 2))) (+ (* main_~y~0 2) (* main_~Y~0 2) (* 2 (* v_main_~x~0_74 main_~Y~0))))) (not (<= v_main_~x~0_74 (+ main_~x~0 1))) (<= v_main_~x~0_74 main_~X~0)))} is VALID [2022-04-15 07:42:22,048 INFO L290 TraceCheckUtils]: 42: Hoare triple {14614#true} assume !!(~x~0 <= ~X~0); {14847#(forall ((main_~Y~0 Int) (v_main_~x~0_74 Int)) (or (not (<= v_main_~x~0_74 (+ main_~x~0 1))) (= (+ (* 2 (* v_main_~x~0_74 (+ main_~y~0 1))) (* main_~Y~0 2) (* 2 (* v_main_~x~0_74 main_~Y~0)) (* (* main_~X~0 (+ main_~y~0 1)) (- 2))) (+ 2 (* main_~y~0 2) (* main_~Y~0 2) (* 2 (* v_main_~x~0_74 main_~Y~0)))) (<= v_main_~x~0_74 main_~X~0)))} is VALID [2022-04-15 07:42:22,048 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {14614#true} {14614#true} #65#return; {14614#true} is VALID [2022-04-15 07:42:22,048 INFO L290 TraceCheckUtils]: 40: Hoare triple {14614#true} assume true; {14614#true} is VALID [2022-04-15 07:42:22,048 INFO L290 TraceCheckUtils]: 39: Hoare triple {14614#true} assume !(0 == ~cond); {14614#true} is VALID [2022-04-15 07:42:22,048 INFO L290 TraceCheckUtils]: 38: Hoare triple {14614#true} ~cond := #in~cond; {14614#true} is VALID [2022-04-15 07:42:22,048 INFO L272 TraceCheckUtils]: 37: Hoare triple {14614#true} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {14614#true} is VALID [2022-04-15 07:42:22,048 INFO L290 TraceCheckUtils]: 36: Hoare triple {14614#true} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {14614#true} is VALID [2022-04-15 07:42:22,048 INFO L290 TraceCheckUtils]: 35: Hoare triple {14614#true} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {14614#true} is VALID [2022-04-15 07:42:22,048 INFO L290 TraceCheckUtils]: 34: Hoare triple {14614#true} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {14614#true} is VALID [2022-04-15 07:42:22,048 INFO L290 TraceCheckUtils]: 33: Hoare triple {14614#true} assume !!(~x~0 <= ~X~0); {14614#true} is VALID [2022-04-15 07:42:22,048 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {14614#true} {14614#true} #65#return; {14614#true} is VALID [2022-04-15 07:42:22,049 INFO L290 TraceCheckUtils]: 31: Hoare triple {14614#true} assume true; {14614#true} is VALID [2022-04-15 07:42:22,049 INFO L290 TraceCheckUtils]: 30: Hoare triple {14614#true} assume !(0 == ~cond); {14614#true} is VALID [2022-04-15 07:42:22,049 INFO L290 TraceCheckUtils]: 29: Hoare triple {14614#true} ~cond := #in~cond; {14614#true} is VALID [2022-04-15 07:42:22,049 INFO L272 TraceCheckUtils]: 28: Hoare triple {14614#true} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {14614#true} is VALID [2022-04-15 07:42:22,049 INFO L290 TraceCheckUtils]: 27: Hoare triple {14614#true} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {14614#true} is VALID [2022-04-15 07:42:22,049 INFO L290 TraceCheckUtils]: 26: Hoare triple {14614#true} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {14614#true} is VALID [2022-04-15 07:42:22,049 INFO L290 TraceCheckUtils]: 25: Hoare triple {14614#true} assume !(~v~0 < 0);~v~0 := ~v~0 + 2 * (~Y~0 - ~X~0);#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {14614#true} is VALID [2022-04-15 07:42:22,049 INFO L290 TraceCheckUtils]: 24: Hoare triple {14614#true} assume !!(~x~0 <= ~X~0); {14614#true} is VALID [2022-04-15 07:42:22,049 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {14614#true} {14614#true} #65#return; {14614#true} is VALID [2022-04-15 07:42:22,049 INFO L290 TraceCheckUtils]: 22: Hoare triple {14614#true} assume true; {14614#true} is VALID [2022-04-15 07:42:22,049 INFO L290 TraceCheckUtils]: 21: Hoare triple {14614#true} assume !(0 == ~cond); {14614#true} is VALID [2022-04-15 07:42:22,049 INFO L290 TraceCheckUtils]: 20: Hoare triple {14614#true} ~cond := #in~cond; {14614#true} is VALID [2022-04-15 07:42:22,049 INFO L272 TraceCheckUtils]: 19: Hoare triple {14614#true} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {14614#true} is VALID [2022-04-15 07:42:22,049 INFO L290 TraceCheckUtils]: 18: Hoare triple {14614#true} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {14614#true} is VALID [2022-04-15 07:42:22,050 INFO L290 TraceCheckUtils]: 17: Hoare triple {14614#true} ~v~0 := 2 * ~Y~0 - ~X~0;~y~0 := 0;~x~0 := 0; {14614#true} is VALID [2022-04-15 07:42:22,050 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {14614#true} {14614#true} #63#return; {14614#true} is VALID [2022-04-15 07:42:22,050 INFO L290 TraceCheckUtils]: 15: Hoare triple {14614#true} assume true; {14614#true} is VALID [2022-04-15 07:42:22,050 INFO L290 TraceCheckUtils]: 14: Hoare triple {14614#true} assume !(0 == ~cond); {14614#true} is VALID [2022-04-15 07:42:22,050 INFO L290 TraceCheckUtils]: 13: Hoare triple {14614#true} ~cond := #in~cond; {14614#true} is VALID [2022-04-15 07:42:22,050 INFO L272 TraceCheckUtils]: 12: Hoare triple {14614#true} call assume_abort_if_not((if ~Y~0 >= 0 && ~Y~0 <= 10 then 1 else 0)); {14614#true} is VALID [2022-04-15 07:42:22,050 INFO L290 TraceCheckUtils]: 11: Hoare triple {14614#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~Y~0 := #t~nondet5;havoc #t~nondet5; {14614#true} is VALID [2022-04-15 07:42:22,050 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {14614#true} {14614#true} #61#return; {14614#true} is VALID [2022-04-15 07:42:22,050 INFO L290 TraceCheckUtils]: 9: Hoare triple {14614#true} assume true; {14614#true} is VALID [2022-04-15 07:42:22,050 INFO L290 TraceCheckUtils]: 8: Hoare triple {14614#true} assume !(0 == ~cond); {14614#true} is VALID [2022-04-15 07:42:22,050 INFO L290 TraceCheckUtils]: 7: Hoare triple {14614#true} ~cond := #in~cond; {14614#true} is VALID [2022-04-15 07:42:22,050 INFO L272 TraceCheckUtils]: 6: Hoare triple {14614#true} call assume_abort_if_not((if ~X~0 >= 0 && ~X~0 <= 10 then 1 else 0)); {14614#true} is VALID [2022-04-15 07:42:22,050 INFO L290 TraceCheckUtils]: 5: Hoare triple {14614#true} havoc ~X~0;havoc ~Y~0;havoc ~x~0;havoc ~y~0;havoc ~v~0;havoc ~xy~0;havoc ~yx~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~X~0 := #t~nondet4;havoc #t~nondet4; {14614#true} is VALID [2022-04-15 07:42:22,050 INFO L272 TraceCheckUtils]: 4: Hoare triple {14614#true} call #t~ret8 := main(); {14614#true} is VALID [2022-04-15 07:42:22,051 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14614#true} {14614#true} #69#return; {14614#true} is VALID [2022-04-15 07:42:22,051 INFO L290 TraceCheckUtils]: 2: Hoare triple {14614#true} assume true; {14614#true} is VALID [2022-04-15 07:42:22,051 INFO L290 TraceCheckUtils]: 1: Hoare triple {14614#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(15, 2);call #Ultimate.allocInit(12, 3); {14614#true} is VALID [2022-04-15 07:42:22,051 INFO L272 TraceCheckUtils]: 0: Hoare triple {14614#true} call ULTIMATE.init(); {14614#true} is VALID [2022-04-15 07:42:22,051 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 29 proven. 1 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-04-15 07:42:22,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:42:22,051 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1632904972] [2022-04-15 07:42:22,051 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 07:42:22,051 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1277634283] [2022-04-15 07:42:22,051 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1277634283] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 07:42:22,051 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 07:42:22,052 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 13] total 24 [2022-04-15 07:42:22,052 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:42:22,052 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [771879738] [2022-04-15 07:42:22,052 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [771879738] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:42:22,052 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:42:22,052 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-04-15 07:42:22,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [904501027] [2022-04-15 07:42:22,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:42:22,052 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 2.142857142857143) internal successors, (30), 14 states have internal predecessors, (30), 5 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) Word has length 57 [2022-04-15 07:42:22,053 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:42:22,053 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 16 states, 14 states have (on average 2.142857142857143) internal successors, (30), 14 states have internal predecessors, (30), 5 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-15 07:42:24,094 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-15 07:42:24,094 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-15 07:42:24,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:42:24,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-15 07:42:24,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=472, Unknown=0, NotChecked=0, Total=552 [2022-04-15 07:42:24,095 INFO L87 Difference]: Start difference. First operand 121 states and 136 transitions. Second operand has 16 states, 14 states have (on average 2.142857142857143) internal successors, (30), 14 states have internal predecessors, (30), 5 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-15 07:42:29,659 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-15 07:42:34,293 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-15 07:42:36,111 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.29s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-15 07:42:38,211 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-15 07:42:40,613 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-15 07:42:42,932 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-15 07:42:44,935 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-15 07:42:46,938 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-15 07:42:47,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:42:47,504 INFO L93 Difference]: Finished difference Result 168 states and 199 transitions. [2022-04-15 07:42:47,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-04-15 07:42:47,505 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 2.142857142857143) internal successors, (30), 14 states have internal predecessors, (30), 5 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) Word has length 57 [2022-04-15 07:42:47,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:42:47,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 14 states have (on average 2.142857142857143) internal successors, (30), 14 states have internal predecessors, (30), 5 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-15 07:42:47,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 71 transitions. [2022-04-15 07:42:47,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 14 states have (on average 2.142857142857143) internal successors, (30), 14 states have internal predecessors, (30), 5 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-15 07:42:47,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 71 transitions. [2022-04-15 07:42:47,507 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 71 transitions. [2022-04-15 07:42:49,709 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:42:49,711 INFO L225 Difference]: With dead ends: 168 [2022-04-15 07:42:49,711 INFO L226 Difference]: Without dead ends: 160 [2022-04-15 07:42:49,712 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 90 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 161 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=151, Invalid=841, Unknown=0, NotChecked=0, Total=992 [2022-04-15 07:42:49,712 INFO L913 BasicCegarLoop]: 32 mSDtfsCounter, 25 mSDsluCounter, 237 mSDsCounter, 0 mSdLazyCounter, 536 mSolverCounterSat, 9 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 269 SdHoareTripleChecker+Invalid, 552 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 536 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 16.8s IncrementalHoareTripleChecker+Time [2022-04-15 07:42:49,713 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [26 Valid, 269 Invalid, 552 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 536 Invalid, 7 Unknown, 0 Unchecked, 16.8s Time] [2022-04-15 07:42:49,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2022-04-15 07:42:50,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 155. [2022-04-15 07:42:50,129 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:42:50,129 INFO L82 GeneralOperation]: Start isEquivalent. First operand 160 states. Second operand has 155 states, 116 states have (on average 1.1551724137931034) internal successors, (134), 119 states have internal predecessors, (134), 26 states have call successors, (26), 13 states have call predecessors, (26), 12 states have return successors, (24), 22 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-15 07:42:50,129 INFO L74 IsIncluded]: Start isIncluded. First operand 160 states. Second operand has 155 states, 116 states have (on average 1.1551724137931034) internal successors, (134), 119 states have internal predecessors, (134), 26 states have call successors, (26), 13 states have call predecessors, (26), 12 states have return successors, (24), 22 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-15 07:42:50,129 INFO L87 Difference]: Start difference. First operand 160 states. Second operand has 155 states, 116 states have (on average 1.1551724137931034) internal successors, (134), 119 states have internal predecessors, (134), 26 states have call successors, (26), 13 states have call predecessors, (26), 12 states have return successors, (24), 22 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-15 07:42:50,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:42:50,132 INFO L93 Difference]: Finished difference Result 160 states and 189 transitions. [2022-04-15 07:42:50,132 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 189 transitions. [2022-04-15 07:42:50,132 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:42:50,132 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:42:50,132 INFO L74 IsIncluded]: Start isIncluded. First operand has 155 states, 116 states have (on average 1.1551724137931034) internal successors, (134), 119 states have internal predecessors, (134), 26 states have call successors, (26), 13 states have call predecessors, (26), 12 states have return successors, (24), 22 states have call predecessors, (24), 24 states have call successors, (24) Second operand 160 states. [2022-04-15 07:42:50,133 INFO L87 Difference]: Start difference. First operand has 155 states, 116 states have (on average 1.1551724137931034) internal successors, (134), 119 states have internal predecessors, (134), 26 states have call successors, (26), 13 states have call predecessors, (26), 12 states have return successors, (24), 22 states have call predecessors, (24), 24 states have call successors, (24) Second operand 160 states. [2022-04-15 07:42:50,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:42:50,135 INFO L93 Difference]: Finished difference Result 160 states and 189 transitions. [2022-04-15 07:42:50,135 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 189 transitions. [2022-04-15 07:42:50,135 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:42:50,135 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:42:50,136 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:42:50,136 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:42:50,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 116 states have (on average 1.1551724137931034) internal successors, (134), 119 states have internal predecessors, (134), 26 states have call successors, (26), 13 states have call predecessors, (26), 12 states have return successors, (24), 22 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-15 07:42:50,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 184 transitions. [2022-04-15 07:42:50,139 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 184 transitions. Word has length 57 [2022-04-15 07:42:50,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:42:50,139 INFO L478 AbstractCegarLoop]: Abstraction has 155 states and 184 transitions. [2022-04-15 07:42:50,139 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 2.142857142857143) internal successors, (30), 14 states have internal predecessors, (30), 5 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-15 07:42:50,139 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 155 states and 184 transitions. [2022-04-15 07:42:52,619 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 184 edges. 183 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-15 07:42:52,619 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 184 transitions. [2022-04-15 07:42:52,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-04-15 07:42:52,620 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:42:52,620 INFO L499 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 07:42:52,636 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-15 07:42:52,827 WARN L460 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-15 07:42:52,827 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:42:52,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:42:52,828 INFO L85 PathProgramCache]: Analyzing trace with hash -680465044, now seen corresponding path program 5 times [2022-04-15 07:42:52,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:42:52,828 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [374942740] [2022-04-15 07:42:52,828 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 07:42:52,828 INFO L85 PathProgramCache]: Analyzing trace with hash -680465044, now seen corresponding path program 6 times [2022-04-15 07:42:52,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:42:52,828 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [510132018] [2022-04-15 07:42:52,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:42:52,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:42:52,837 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 07:42:52,837 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [887322776] [2022-04-15 07:42:52,837 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 07:42:52,837 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 07:42:52,837 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 07:42:52,838 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-15 07:42:52,838 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-15 07:42:53,066 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-04-15 07:42:53,066 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 07:42:53,068 INFO L263 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 26 conjunts are in the unsatisfiable core [2022-04-15 07:42:53,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:42:53,083 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 07:43:10,235 WARN L914 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-15 07:43:14,510 WARN L914 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-15 07:43:16,625 WARN L914 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-15 07:45:15,506 WARN L232 SmtUtils]: Spent 5.38s on a formula simplification. DAG size of input: 3 DAG size of output: 1 (called from [L1074] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-04-15 07:45:30,974 INFO L272 TraceCheckUtils]: 0: Hoare triple {15961#true} call ULTIMATE.init(); {15961#true} is VALID [2022-04-15 07:45:30,974 INFO L290 TraceCheckUtils]: 1: Hoare triple {15961#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(15, 2);call #Ultimate.allocInit(12, 3); {15961#true} is VALID [2022-04-15 07:45:30,974 INFO L290 TraceCheckUtils]: 2: Hoare triple {15961#true} assume true; {15961#true} is VALID [2022-04-15 07:45:30,974 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15961#true} {15961#true} #69#return; {15961#true} is VALID [2022-04-15 07:45:30,975 INFO L272 TraceCheckUtils]: 4: Hoare triple {15961#true} call #t~ret8 := main(); {15961#true} is VALID [2022-04-15 07:45:30,975 INFO L290 TraceCheckUtils]: 5: Hoare triple {15961#true} havoc ~X~0;havoc ~Y~0;havoc ~x~0;havoc ~y~0;havoc ~v~0;havoc ~xy~0;havoc ~yx~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~X~0 := #t~nondet4;havoc #t~nondet4; {15961#true} is VALID [2022-04-15 07:45:30,975 INFO L272 TraceCheckUtils]: 6: Hoare triple {15961#true} call assume_abort_if_not((if ~X~0 >= 0 && ~X~0 <= 10 then 1 else 0)); {15961#true} is VALID [2022-04-15 07:45:30,975 INFO L290 TraceCheckUtils]: 7: Hoare triple {15961#true} ~cond := #in~cond; {15987#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-15 07:45:30,976 INFO L290 TraceCheckUtils]: 8: Hoare triple {15987#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {15991#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 07:45:30,976 INFO L290 TraceCheckUtils]: 9: Hoare triple {15991#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {15991#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 07:45:30,977 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {15991#(not (= |assume_abort_if_not_#in~cond| 0))} {15961#true} #61#return; {15998#(and (<= main_~X~0 10) (<= 0 main_~X~0))} is VALID [2022-04-15 07:45:30,977 INFO L290 TraceCheckUtils]: 11: Hoare triple {15998#(and (<= main_~X~0 10) (<= 0 main_~X~0))} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~Y~0 := #t~nondet5;havoc #t~nondet5; {15998#(and (<= main_~X~0 10) (<= 0 main_~X~0))} is VALID [2022-04-15 07:45:30,977 INFO L272 TraceCheckUtils]: 12: Hoare triple {15998#(and (<= main_~X~0 10) (<= 0 main_~X~0))} call assume_abort_if_not((if ~Y~0 >= 0 && ~Y~0 <= 10 then 1 else 0)); {15961#true} is VALID [2022-04-15 07:45:30,977 INFO L290 TraceCheckUtils]: 13: Hoare triple {15961#true} ~cond := #in~cond; {15961#true} is VALID [2022-04-15 07:45:30,977 INFO L290 TraceCheckUtils]: 14: Hoare triple {15961#true} assume !(0 == ~cond); {15961#true} is VALID [2022-04-15 07:45:30,977 INFO L290 TraceCheckUtils]: 15: Hoare triple {15961#true} assume true; {15961#true} is VALID [2022-04-15 07:45:30,978 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {15961#true} {15998#(and (<= main_~X~0 10) (<= 0 main_~X~0))} #63#return; {15998#(and (<= main_~X~0 10) (<= 0 main_~X~0))} is VALID [2022-04-15 07:45:30,978 INFO L290 TraceCheckUtils]: 17: Hoare triple {15998#(and (<= main_~X~0 10) (<= 0 main_~X~0))} ~v~0 := 2 * ~Y~0 - ~X~0;~y~0 := 0;~x~0 := 0; {16020#(and (<= main_~X~0 10) (<= 0 main_~x~0) (<= 0 main_~X~0))} is VALID [2022-04-15 07:45:30,978 INFO L290 TraceCheckUtils]: 18: Hoare triple {16020#(and (<= main_~X~0 10) (<= 0 main_~x~0) (<= 0 main_~X~0))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {16020#(and (<= main_~X~0 10) (<= 0 main_~x~0) (<= 0 main_~X~0))} is VALID [2022-04-15 07:45:30,978 INFO L272 TraceCheckUtils]: 19: Hoare triple {16020#(and (<= main_~X~0 10) (<= 0 main_~x~0) (<= 0 main_~X~0))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {15961#true} is VALID [2022-04-15 07:45:30,979 INFO L290 TraceCheckUtils]: 20: Hoare triple {15961#true} ~cond := #in~cond; {15961#true} is VALID [2022-04-15 07:45:30,979 INFO L290 TraceCheckUtils]: 21: Hoare triple {15961#true} assume !(0 == ~cond); {15961#true} is VALID [2022-04-15 07:45:30,979 INFO L290 TraceCheckUtils]: 22: Hoare triple {15961#true} assume true; {15961#true} is VALID [2022-04-15 07:45:30,979 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {15961#true} {16020#(and (<= main_~X~0 10) (<= 0 main_~x~0) (<= 0 main_~X~0))} #65#return; {16020#(and (<= main_~X~0 10) (<= 0 main_~x~0) (<= 0 main_~X~0))} is VALID [2022-04-15 07:45:30,980 INFO L290 TraceCheckUtils]: 24: Hoare triple {16020#(and (<= main_~X~0 10) (<= 0 main_~x~0) (<= 0 main_~X~0))} assume !!(~x~0 <= ~X~0); {15998#(and (<= main_~X~0 10) (<= 0 main_~X~0))} is VALID [2022-04-15 07:45:30,980 INFO L290 TraceCheckUtils]: 25: Hoare triple {15998#(and (<= main_~X~0 10) (<= 0 main_~X~0))} assume !(~v~0 < 0);~v~0 := ~v~0 + 2 * (~Y~0 - ~X~0);#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {15998#(and (<= main_~X~0 10) (<= 0 main_~X~0))} is VALID [2022-04-15 07:45:30,980 INFO L290 TraceCheckUtils]: 26: Hoare triple {15998#(and (<= main_~X~0 10) (<= 0 main_~X~0))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {15998#(and (<= main_~X~0 10) (<= 0 main_~X~0))} is VALID [2022-04-15 07:45:30,981 INFO L290 TraceCheckUtils]: 27: Hoare triple {15998#(and (<= main_~X~0 10) (<= 0 main_~X~0))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {15998#(and (<= main_~X~0 10) (<= 0 main_~X~0))} is VALID [2022-04-15 07:45:30,981 INFO L272 TraceCheckUtils]: 28: Hoare triple {15998#(and (<= main_~X~0 10) (<= 0 main_~X~0))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {15961#true} is VALID [2022-04-15 07:45:30,981 INFO L290 TraceCheckUtils]: 29: Hoare triple {15961#true} ~cond := #in~cond; {15961#true} is VALID [2022-04-15 07:45:30,981 INFO L290 TraceCheckUtils]: 30: Hoare triple {15961#true} assume !(0 == ~cond); {15961#true} is VALID [2022-04-15 07:45:30,981 INFO L290 TraceCheckUtils]: 31: Hoare triple {15961#true} assume true; {15961#true} is VALID [2022-04-15 07:45:30,981 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {15961#true} {15998#(and (<= main_~X~0 10) (<= 0 main_~X~0))} #65#return; {15998#(and (<= main_~X~0 10) (<= 0 main_~X~0))} is VALID [2022-04-15 07:45:30,982 INFO L290 TraceCheckUtils]: 33: Hoare triple {15998#(and (<= main_~X~0 10) (<= 0 main_~X~0))} assume !!(~x~0 <= ~X~0); {15998#(and (<= main_~X~0 10) (<= 0 main_~X~0))} is VALID [2022-04-15 07:45:30,982 INFO L290 TraceCheckUtils]: 34: Hoare triple {15998#(and (<= main_~X~0 10) (<= 0 main_~X~0))} assume !(~v~0 < 0);~v~0 := ~v~0 + 2 * (~Y~0 - ~X~0);#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {15998#(and (<= main_~X~0 10) (<= 0 main_~X~0))} is VALID [2022-04-15 07:45:30,982 INFO L290 TraceCheckUtils]: 35: Hoare triple {15998#(and (<= main_~X~0 10) (<= 0 main_~X~0))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {15998#(and (<= main_~X~0 10) (<= 0 main_~X~0))} is VALID [2022-04-15 07:45:30,983 INFO L290 TraceCheckUtils]: 36: Hoare triple {15998#(and (<= main_~X~0 10) (<= 0 main_~X~0))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {15998#(and (<= main_~X~0 10) (<= 0 main_~X~0))} is VALID [2022-04-15 07:45:30,983 INFO L272 TraceCheckUtils]: 37: Hoare triple {15998#(and (<= main_~X~0 10) (<= 0 main_~X~0))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {15961#true} is VALID [2022-04-15 07:45:30,983 INFO L290 TraceCheckUtils]: 38: Hoare triple {15961#true} ~cond := #in~cond; {15961#true} is VALID [2022-04-15 07:45:30,983 INFO L290 TraceCheckUtils]: 39: Hoare triple {15961#true} assume !(0 == ~cond); {15961#true} is VALID [2022-04-15 07:45:30,983 INFO L290 TraceCheckUtils]: 40: Hoare triple {15961#true} assume true; {15961#true} is VALID [2022-04-15 07:45:30,984 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {15961#true} {15998#(and (<= main_~X~0 10) (<= 0 main_~X~0))} #65#return; {15998#(and (<= main_~X~0 10) (<= 0 main_~X~0))} is VALID [2022-04-15 07:45:30,984 INFO L290 TraceCheckUtils]: 42: Hoare triple {15998#(and (<= main_~X~0 10) (<= 0 main_~X~0))} assume !!(~x~0 <= ~X~0); {16096#(and (<= main_~x~0 main_~X~0) (<= main_~X~0 10) (<= 0 main_~X~0))} is VALID [2022-04-15 07:45:30,985 INFO L290 TraceCheckUtils]: 43: Hoare triple {16096#(and (<= main_~x~0 main_~X~0) (<= main_~X~0 10) (<= 0 main_~X~0))} assume !(~v~0 < 0);~v~0 := ~v~0 + 2 * (~Y~0 - ~X~0);#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {16096#(and (<= main_~x~0 main_~X~0) (<= main_~X~0 10) (<= 0 main_~X~0))} is VALID [2022-04-15 07:45:30,986 INFO L290 TraceCheckUtils]: 44: Hoare triple {16096#(and (<= main_~x~0 main_~X~0) (<= main_~X~0 10) (<= 0 main_~X~0))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {16103#(and (<= main_~X~0 10) (<= 0 main_~X~0) (<= main_~x~0 (+ main_~X~0 1)))} is VALID [2022-04-15 07:45:30,987 INFO L290 TraceCheckUtils]: 45: Hoare triple {16103#(and (<= main_~X~0 10) (<= 0 main_~X~0) (<= main_~x~0 (+ main_~X~0 1)))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {16107#(and (<= main_~X~0 10) (<= 0 main_~X~0) (= (* main_~X~0 main_~y~0) main_~xy~0) (= main_~yx~0 (* main_~Y~0 main_~x~0)) (<= main_~x~0 (+ main_~X~0 1)))} is VALID [2022-04-15 07:45:30,987 INFO L272 TraceCheckUtils]: 46: Hoare triple {16107#(and (<= main_~X~0 10) (<= 0 main_~X~0) (= (* main_~X~0 main_~y~0) main_~xy~0) (= main_~yx~0 (* main_~Y~0 main_~x~0)) (<= main_~x~0 (+ main_~X~0 1)))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {15961#true} is VALID [2022-04-15 07:45:30,987 INFO L290 TraceCheckUtils]: 47: Hoare triple {15961#true} ~cond := #in~cond; {16114#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-15 07:45:30,987 INFO L290 TraceCheckUtils]: 48: Hoare triple {16114#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {16118#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:45:30,988 INFO L290 TraceCheckUtils]: 49: Hoare triple {16118#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {16118#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:45:30,990 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {16118#(not (= |__VERIFIER_assert_#in~cond| 0))} {16107#(and (<= main_~X~0 10) (<= 0 main_~X~0) (= (* main_~X~0 main_~y~0) main_~xy~0) (= main_~yx~0 (* main_~Y~0 main_~x~0)) (<= main_~x~0 (+ main_~X~0 1)))} #65#return; {16125#(and (<= main_~X~0 10) (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (<= 0 main_~X~0) (<= main_~x~0 (+ main_~X~0 1)))} is VALID [2022-04-15 07:45:30,990 INFO L290 TraceCheckUtils]: 51: Hoare triple {16125#(and (<= main_~X~0 10) (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (<= 0 main_~X~0) (<= main_~x~0 (+ main_~X~0 1)))} assume !(~x~0 <= ~X~0); {16129#(and (<= main_~X~0 10) (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (<= 0 main_~X~0) (not (<= main_~x~0 main_~X~0)) (<= main_~x~0 (+ main_~X~0 1)))} is VALID [2022-04-15 07:45:31,031 INFO L290 TraceCheckUtils]: 52: Hoare triple {16129#(and (<= main_~X~0 10) (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (<= 0 main_~X~0) (not (<= main_~x~0 main_~X~0)) (<= main_~x~0 (+ main_~X~0 1)))} ~xy~0 := ~x~0 * ~y~0;~yx~0 := ~Y~0 * ~x~0; {16133#(and (<= main_~X~0 10) (<= 0 main_~X~0) (or (and (or (and (= (mod main_~xy~0 main_~y~0) 0) (not (= main_~y~0 0)) (<= (div main_~xy~0 main_~y~0) (+ main_~X~0 1)) (< main_~X~0 (div main_~xy~0 main_~y~0))) (and (= main_~xy~0 0) (= main_~y~0 0))) (= (mod (+ (* main_~X~0 main_~y~0 2) main_~X~0 main_~v~0) 2) 0) (= main_~yx~0 0) (= 0 (+ (* main_~X~0 main_~y~0) (div (+ main_~X~0 main_~v~0) 2) (* (- 1) main_~Y~0))) (= main_~Y~0 0)) (and (= (* main_~y~0 (div (+ (* main_~X~0 main_~y~0) (div (+ main_~X~0 main_~v~0) 2) (* (- 1) main_~Y~0)) main_~Y~0)) main_~xy~0) (= (mod (+ (* main_~X~0 main_~y~0) (div (+ main_~X~0 main_~v~0) 2) (* (- 1) main_~Y~0)) main_~Y~0) 0) (<= (div (+ (* main_~X~0 main_~y~0) (div (+ main_~X~0 main_~v~0) 2) (* (- 1) main_~Y~0)) main_~Y~0) (+ main_~X~0 1)) (= (mod (+ (* main_~X~0 main_~y~0 2) main_~X~0 main_~v~0) 2) 0) (not (<= (div (+ (* main_~X~0 main_~y~0) (div (+ main_~X~0 main_~v~0) 2) (* (- 1) main_~Y~0)) main_~Y~0) main_~X~0)) (not (= main_~Y~0 0)) (= main_~yx~0 (* main_~Y~0 (div (+ (* main_~X~0 main_~y~0) (div (+ main_~X~0 main_~v~0) 2) (* (- 1) main_~Y~0)) main_~Y~0))))))} is VALID [2022-04-15 07:45:31,047 INFO L272 TraceCheckUtils]: 53: Hoare triple {16133#(and (<= main_~X~0 10) (<= 0 main_~X~0) (or (and (or (and (= (mod main_~xy~0 main_~y~0) 0) (not (= main_~y~0 0)) (<= (div main_~xy~0 main_~y~0) (+ main_~X~0 1)) (< main_~X~0 (div main_~xy~0 main_~y~0))) (and (= main_~xy~0 0) (= main_~y~0 0))) (= (mod (+ (* main_~X~0 main_~y~0 2) main_~X~0 main_~v~0) 2) 0) (= main_~yx~0 0) (= 0 (+ (* main_~X~0 main_~y~0) (div (+ main_~X~0 main_~v~0) 2) (* (- 1) main_~Y~0))) (= main_~Y~0 0)) (and (= (* main_~y~0 (div (+ (* main_~X~0 main_~y~0) (div (+ main_~X~0 main_~v~0) 2) (* (- 1) main_~Y~0)) main_~Y~0)) main_~xy~0) (= (mod (+ (* main_~X~0 main_~y~0) (div (+ main_~X~0 main_~v~0) 2) (* (- 1) main_~Y~0)) main_~Y~0) 0) (<= (div (+ (* main_~X~0 main_~y~0) (div (+ main_~X~0 main_~v~0) 2) (* (- 1) main_~Y~0)) main_~Y~0) (+ main_~X~0 1)) (= (mod (+ (* main_~X~0 main_~y~0 2) main_~X~0 main_~v~0) 2) 0) (not (<= (div (+ (* main_~X~0 main_~y~0) (div (+ main_~X~0 main_~v~0) 2) (* (- 1) main_~Y~0)) main_~Y~0) main_~X~0)) (not (= main_~Y~0 0)) (= main_~yx~0 (* main_~Y~0 (div (+ (* main_~X~0 main_~y~0) (div (+ main_~X~0 main_~v~0) 2) (* (- 1) main_~Y~0)) main_~Y~0))))))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 + 2 * ~y~0 then 1 else 0)); {16137#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 07:45:31,048 INFO L290 TraceCheckUtils]: 54: Hoare triple {16137#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {16141#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 07:45:31,048 INFO L290 TraceCheckUtils]: 55: Hoare triple {16141#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {15962#false} is VALID [2022-04-15 07:45:31,048 INFO L290 TraceCheckUtils]: 56: Hoare triple {15962#false} assume !false; {15962#false} is VALID [2022-04-15 07:45:31,048 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 26 proven. 13 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-04-15 07:45:31,049 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 07:45:47,534 INFO L290 TraceCheckUtils]: 56: Hoare triple {15962#false} assume !false; {15962#false} is VALID [2022-04-15 07:45:47,534 INFO L290 TraceCheckUtils]: 55: Hoare triple {16141#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {15962#false} is VALID [2022-04-15 07:45:47,535 INFO L290 TraceCheckUtils]: 54: Hoare triple {16137#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {16141#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 07:45:47,535 INFO L272 TraceCheckUtils]: 53: Hoare triple {16157#(= (+ (* main_~y~0 2) (* main_~Y~0 2) (* 2 main_~yx~0)) (+ (* 2 main_~xy~0) main_~X~0 main_~v~0))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 + 2 * ~y~0 then 1 else 0)); {16137#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 07:45:47,537 INFO L290 TraceCheckUtils]: 52: Hoare triple {16161#(= (+ (* 2 (* main_~y~0 main_~x~0)) main_~X~0 main_~v~0) (+ (* main_~y~0 2) (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))))} ~xy~0 := ~x~0 * ~y~0;~yx~0 := ~Y~0 * ~x~0; {16157#(= (+ (* main_~y~0 2) (* main_~Y~0 2) (* 2 main_~yx~0)) (+ (* 2 main_~xy~0) main_~X~0 main_~v~0))} is VALID [2022-04-15 07:45:47,537 INFO L290 TraceCheckUtils]: 51: Hoare triple {16165#(or (<= main_~x~0 main_~X~0) (= (+ (* 2 (* main_~y~0 main_~x~0)) main_~X~0 main_~v~0) (+ (* main_~y~0 2) (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0)))))} assume !(~x~0 <= ~X~0); {16161#(= (+ (* 2 (* main_~y~0 main_~x~0)) main_~X~0 main_~v~0) (+ (* main_~y~0 2) (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))))} is VALID [2022-04-15 07:45:47,538 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {16118#(not (= |__VERIFIER_assert_#in~cond| 0))} {16169#(or (<= main_~x~0 main_~X~0) (= (+ (* 2 (* main_~y~0 main_~x~0)) (* (- 2) main_~xy~0) (* main_~Y~0 2) (* 2 main_~yx~0)) (+ (* main_~y~0 2) (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0)))))} #65#return; {16165#(or (<= main_~x~0 main_~X~0) (= (+ (* 2 (* main_~y~0 main_~x~0)) main_~X~0 main_~v~0) (+ (* main_~y~0 2) (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0)))))} is VALID [2022-04-15 07:45:47,538 INFO L290 TraceCheckUtils]: 49: Hoare triple {16118#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {16118#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:45:47,539 INFO L290 TraceCheckUtils]: 48: Hoare triple {16179#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {16118#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:45:47,539 INFO L290 TraceCheckUtils]: 47: Hoare triple {15961#true} ~cond := #in~cond; {16179#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 07:45:47,539 INFO L272 TraceCheckUtils]: 46: Hoare triple {16169#(or (<= main_~x~0 main_~X~0) (= (+ (* 2 (* main_~y~0 main_~x~0)) (* (- 2) main_~xy~0) (* main_~Y~0 2) (* 2 main_~yx~0)) (+ (* main_~y~0 2) (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0)))))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {15961#true} is VALID [2022-04-15 07:45:47,540 INFO L290 TraceCheckUtils]: 45: Hoare triple {16186#(or (<= main_~x~0 main_~X~0) (forall ((main_~y~0 Int) (main_~Y~0 Int)) (= (+ (* 2 (* main_~y~0 main_~x~0)) (* main_~Y~0 2) (* (* main_~X~0 main_~y~0) (- 2)) (* 2 (* main_~Y~0 main_~x~0))) (+ (* main_~y~0 2) (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))))))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {16169#(or (<= main_~x~0 main_~X~0) (= (+ (* 2 (* main_~y~0 main_~x~0)) (* (- 2) main_~xy~0) (* main_~Y~0 2) (* 2 main_~yx~0)) (+ (* main_~y~0 2) (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0)))))} is VALID [2022-04-15 07:45:47,543 INFO L290 TraceCheckUtils]: 44: Hoare triple {16190#(forall ((v_main_~x~0_76 Int)) (or (forall ((main_~y~0 Int) (main_~Y~0 Int)) (= (+ (* 2 (* v_main_~x~0_76 main_~Y~0)) (* main_~Y~0 2) (* (* main_~X~0 main_~y~0) (- 2)) (* (* v_main_~x~0_76 main_~y~0) 2)) (+ (* 2 (* v_main_~x~0_76 main_~Y~0)) (* main_~y~0 2) (* main_~Y~0 2)))) (not (<= v_main_~x~0_76 (+ main_~x~0 1))) (<= v_main_~x~0_76 main_~X~0)))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {16186#(or (<= main_~x~0 main_~X~0) (forall ((main_~y~0 Int) (main_~Y~0 Int)) (= (+ (* 2 (* main_~y~0 main_~x~0)) (* main_~Y~0 2) (* (* main_~X~0 main_~y~0) (- 2)) (* 2 (* main_~Y~0 main_~x~0))) (+ (* main_~y~0 2) (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))))))} is VALID [2022-04-15 07:45:47,545 INFO L290 TraceCheckUtils]: 43: Hoare triple {16190#(forall ((v_main_~x~0_76 Int)) (or (forall ((main_~y~0 Int) (main_~Y~0 Int)) (= (+ (* 2 (* v_main_~x~0_76 main_~Y~0)) (* main_~Y~0 2) (* (* main_~X~0 main_~y~0) (- 2)) (* (* v_main_~x~0_76 main_~y~0) 2)) (+ (* 2 (* v_main_~x~0_76 main_~Y~0)) (* main_~y~0 2) (* main_~Y~0 2)))) (not (<= v_main_~x~0_76 (+ main_~x~0 1))) (<= v_main_~x~0_76 main_~X~0)))} assume !(~v~0 < 0);~v~0 := ~v~0 + 2 * (~Y~0 - ~X~0);#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {16190#(forall ((v_main_~x~0_76 Int)) (or (forall ((main_~y~0 Int) (main_~Y~0 Int)) (= (+ (* 2 (* v_main_~x~0_76 main_~Y~0)) (* main_~Y~0 2) (* (* main_~X~0 main_~y~0) (- 2)) (* (* v_main_~x~0_76 main_~y~0) 2)) (+ (* 2 (* v_main_~x~0_76 main_~Y~0)) (* main_~y~0 2) (* main_~Y~0 2)))) (not (<= v_main_~x~0_76 (+ main_~x~0 1))) (<= v_main_~x~0_76 main_~X~0)))} is VALID [2022-04-15 07:45:47,547 INFO L290 TraceCheckUtils]: 42: Hoare triple {15961#true} assume !!(~x~0 <= ~X~0); {16190#(forall ((v_main_~x~0_76 Int)) (or (forall ((main_~y~0 Int) (main_~Y~0 Int)) (= (+ (* 2 (* v_main_~x~0_76 main_~Y~0)) (* main_~Y~0 2) (* (* main_~X~0 main_~y~0) (- 2)) (* (* v_main_~x~0_76 main_~y~0) 2)) (+ (* 2 (* v_main_~x~0_76 main_~Y~0)) (* main_~y~0 2) (* main_~Y~0 2)))) (not (<= v_main_~x~0_76 (+ main_~x~0 1))) (<= v_main_~x~0_76 main_~X~0)))} is VALID [2022-04-15 07:45:47,547 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {15961#true} {15961#true} #65#return; {15961#true} is VALID [2022-04-15 07:45:47,547 INFO L290 TraceCheckUtils]: 40: Hoare triple {15961#true} assume true; {15961#true} is VALID [2022-04-15 07:45:47,547 INFO L290 TraceCheckUtils]: 39: Hoare triple {15961#true} assume !(0 == ~cond); {15961#true} is VALID [2022-04-15 07:45:47,547 INFO L290 TraceCheckUtils]: 38: Hoare triple {15961#true} ~cond := #in~cond; {15961#true} is VALID [2022-04-15 07:45:47,547 INFO L272 TraceCheckUtils]: 37: Hoare triple {15961#true} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {15961#true} is VALID [2022-04-15 07:45:47,547 INFO L290 TraceCheckUtils]: 36: Hoare triple {15961#true} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {15961#true} is VALID [2022-04-15 07:45:47,547 INFO L290 TraceCheckUtils]: 35: Hoare triple {15961#true} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {15961#true} is VALID [2022-04-15 07:45:47,547 INFO L290 TraceCheckUtils]: 34: Hoare triple {15961#true} assume !(~v~0 < 0);~v~0 := ~v~0 + 2 * (~Y~0 - ~X~0);#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {15961#true} is VALID [2022-04-15 07:45:47,547 INFO L290 TraceCheckUtils]: 33: Hoare triple {15961#true} assume !!(~x~0 <= ~X~0); {15961#true} is VALID [2022-04-15 07:45:47,547 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {15961#true} {15961#true} #65#return; {15961#true} is VALID [2022-04-15 07:45:47,547 INFO L290 TraceCheckUtils]: 31: Hoare triple {15961#true} assume true; {15961#true} is VALID [2022-04-15 07:45:47,548 INFO L290 TraceCheckUtils]: 30: Hoare triple {15961#true} assume !(0 == ~cond); {15961#true} is VALID [2022-04-15 07:45:47,548 INFO L290 TraceCheckUtils]: 29: Hoare triple {15961#true} ~cond := #in~cond; {15961#true} is VALID [2022-04-15 07:45:47,548 INFO L272 TraceCheckUtils]: 28: Hoare triple {15961#true} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {15961#true} is VALID [2022-04-15 07:45:47,548 INFO L290 TraceCheckUtils]: 27: Hoare triple {15961#true} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {15961#true} is VALID [2022-04-15 07:45:47,548 INFO L290 TraceCheckUtils]: 26: Hoare triple {15961#true} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {15961#true} is VALID [2022-04-15 07:45:47,548 INFO L290 TraceCheckUtils]: 25: Hoare triple {15961#true} assume !(~v~0 < 0);~v~0 := ~v~0 + 2 * (~Y~0 - ~X~0);#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {15961#true} is VALID [2022-04-15 07:45:47,548 INFO L290 TraceCheckUtils]: 24: Hoare triple {15961#true} assume !!(~x~0 <= ~X~0); {15961#true} is VALID [2022-04-15 07:45:47,548 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {15961#true} {15961#true} #65#return; {15961#true} is VALID [2022-04-15 07:45:47,548 INFO L290 TraceCheckUtils]: 22: Hoare triple {15961#true} assume true; {15961#true} is VALID [2022-04-15 07:45:47,548 INFO L290 TraceCheckUtils]: 21: Hoare triple {15961#true} assume !(0 == ~cond); {15961#true} is VALID [2022-04-15 07:45:47,548 INFO L290 TraceCheckUtils]: 20: Hoare triple {15961#true} ~cond := #in~cond; {15961#true} is VALID [2022-04-15 07:45:47,548 INFO L272 TraceCheckUtils]: 19: Hoare triple {15961#true} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {15961#true} is VALID [2022-04-15 07:45:47,548 INFO L290 TraceCheckUtils]: 18: Hoare triple {15961#true} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {15961#true} is VALID [2022-04-15 07:45:47,548 INFO L290 TraceCheckUtils]: 17: Hoare triple {15961#true} ~v~0 := 2 * ~Y~0 - ~X~0;~y~0 := 0;~x~0 := 0; {15961#true} is VALID [2022-04-15 07:45:47,549 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {15961#true} {15961#true} #63#return; {15961#true} is VALID [2022-04-15 07:45:47,549 INFO L290 TraceCheckUtils]: 15: Hoare triple {15961#true} assume true; {15961#true} is VALID [2022-04-15 07:45:47,549 INFO L290 TraceCheckUtils]: 14: Hoare triple {15961#true} assume !(0 == ~cond); {15961#true} is VALID [2022-04-15 07:45:47,549 INFO L290 TraceCheckUtils]: 13: Hoare triple {15961#true} ~cond := #in~cond; {15961#true} is VALID [2022-04-15 07:45:47,549 INFO L272 TraceCheckUtils]: 12: Hoare triple {15961#true} call assume_abort_if_not((if ~Y~0 >= 0 && ~Y~0 <= 10 then 1 else 0)); {15961#true} is VALID [2022-04-15 07:45:47,549 INFO L290 TraceCheckUtils]: 11: Hoare triple {15961#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~Y~0 := #t~nondet5;havoc #t~nondet5; {15961#true} is VALID [2022-04-15 07:45:47,549 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {15961#true} {15961#true} #61#return; {15961#true} is VALID [2022-04-15 07:45:47,549 INFO L290 TraceCheckUtils]: 9: Hoare triple {15961#true} assume true; {15961#true} is VALID [2022-04-15 07:45:47,549 INFO L290 TraceCheckUtils]: 8: Hoare triple {15961#true} assume !(0 == ~cond); {15961#true} is VALID [2022-04-15 07:45:47,549 INFO L290 TraceCheckUtils]: 7: Hoare triple {15961#true} ~cond := #in~cond; {15961#true} is VALID [2022-04-15 07:45:47,549 INFO L272 TraceCheckUtils]: 6: Hoare triple {15961#true} call assume_abort_if_not((if ~X~0 >= 0 && ~X~0 <= 10 then 1 else 0)); {15961#true} is VALID [2022-04-15 07:45:47,549 INFO L290 TraceCheckUtils]: 5: Hoare triple {15961#true} havoc ~X~0;havoc ~Y~0;havoc ~x~0;havoc ~y~0;havoc ~v~0;havoc ~xy~0;havoc ~yx~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~X~0 := #t~nondet4;havoc #t~nondet4; {15961#true} is VALID [2022-04-15 07:45:47,549 INFO L272 TraceCheckUtils]: 4: Hoare triple {15961#true} call #t~ret8 := main(); {15961#true} is VALID [2022-04-15 07:45:47,549 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15961#true} {15961#true} #69#return; {15961#true} is VALID [2022-04-15 07:45:47,549 INFO L290 TraceCheckUtils]: 2: Hoare triple {15961#true} assume true; {15961#true} is VALID [2022-04-15 07:45:47,550 INFO L290 TraceCheckUtils]: 1: Hoare triple {15961#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(15, 2);call #Ultimate.allocInit(12, 3); {15961#true} is VALID [2022-04-15 07:45:47,550 INFO L272 TraceCheckUtils]: 0: Hoare triple {15961#true} call ULTIMATE.init(); {15961#true} is VALID [2022-04-15 07:45:47,550 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 29 proven. 1 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-04-15 07:45:47,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:45:47,550 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [510132018] [2022-04-15 07:45:47,550 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 07:45:47,550 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [887322776] [2022-04-15 07:45:47,550 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [887322776] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 07:45:47,550 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 07:45:47,550 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 12] total 23 [2022-04-15 07:45:47,551 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:45:47,551 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [374942740] [2022-04-15 07:45:47,551 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [374942740] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:45:47,551 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:45:47,551 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-04-15 07:45:47,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [927157143] [2022-04-15 07:45:47,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:45:47,551 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 14 states have internal predecessors, (32), 5 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) Word has length 57 [2022-04-15 07:45:47,552 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:45:47,552 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 16 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 14 states have internal predecessors, (32), 5 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-15 07:45:47,659 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:45:47,659 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-15 07:45:47,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:45:47,659 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-15 07:45:47,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=429, Unknown=0, NotChecked=0, Total=506 [2022-04-15 07:45:47,660 INFO L87 Difference]: Start difference. First operand 155 states and 184 transitions. Second operand has 16 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 14 states have internal predecessors, (32), 5 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-15 07:45:51,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:45:51,411 INFO L93 Difference]: Finished difference Result 163 states and 191 transitions. [2022-04-15 07:45:51,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-04-15 07:45:51,411 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 14 states have internal predecessors, (32), 5 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) Word has length 57 [2022-04-15 07:45:51,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:45:51,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 14 states have internal predecessors, (32), 5 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-15 07:45:51,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 40 transitions. [2022-04-15 07:45:51,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 14 states have internal predecessors, (32), 5 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-15 07:45:51,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 40 transitions. [2022-04-15 07:45:51,412 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 40 transitions. [2022-04-15 07:45:51,598 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:45:51,600 INFO L225 Difference]: With dead ends: 163 [2022-04-15 07:45:51,601 INFO L226 Difference]: Without dead ends: 155 [2022-04-15 07:45:51,601 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 91 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 226 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=206, Invalid=984, Unknown=0, NotChecked=0, Total=1190 [2022-04-15 07:45:51,601 INFO L913 BasicCegarLoop]: 15 mSDtfsCounter, 26 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 225 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-04-15 07:45:51,602 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [26 Valid, 140 Invalid, 225 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 209 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-04-15 07:45:51,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2022-04-15 07:45:51,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 117. [2022-04-15 07:45:51,904 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:45:51,905 INFO L82 GeneralOperation]: Start isEquivalent. First operand 155 states. Second operand has 117 states, 86 states have (on average 1.0930232558139534) internal successors, (94), 90 states have internal predecessors, (94), 18 states have call successors, (18), 13 states have call predecessors, (18), 12 states have return successors, (17), 13 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-15 07:45:51,905 INFO L74 IsIncluded]: Start isIncluded. First operand 155 states. Second operand has 117 states, 86 states have (on average 1.0930232558139534) internal successors, (94), 90 states have internal predecessors, (94), 18 states have call successors, (18), 13 states have call predecessors, (18), 12 states have return successors, (17), 13 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-15 07:45:51,905 INFO L87 Difference]: Start difference. First operand 155 states. Second operand has 117 states, 86 states have (on average 1.0930232558139534) internal successors, (94), 90 states have internal predecessors, (94), 18 states have call successors, (18), 13 states have call predecessors, (18), 12 states have return successors, (17), 13 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-15 07:45:51,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:45:51,908 INFO L93 Difference]: Finished difference Result 155 states and 178 transitions. [2022-04-15 07:45:51,908 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 178 transitions. [2022-04-15 07:45:51,908 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:45:51,908 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:45:51,908 INFO L74 IsIncluded]: Start isIncluded. First operand has 117 states, 86 states have (on average 1.0930232558139534) internal successors, (94), 90 states have internal predecessors, (94), 18 states have call successors, (18), 13 states have call predecessors, (18), 12 states have return successors, (17), 13 states have call predecessors, (17), 17 states have call successors, (17) Second operand 155 states. [2022-04-15 07:45:51,909 INFO L87 Difference]: Start difference. First operand has 117 states, 86 states have (on average 1.0930232558139534) internal successors, (94), 90 states have internal predecessors, (94), 18 states have call successors, (18), 13 states have call predecessors, (18), 12 states have return successors, (17), 13 states have call predecessors, (17), 17 states have call successors, (17) Second operand 155 states. [2022-04-15 07:45:51,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:45:51,911 INFO L93 Difference]: Finished difference Result 155 states and 178 transitions. [2022-04-15 07:45:51,911 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 178 transitions. [2022-04-15 07:45:51,911 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:45:51,911 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:45:51,911 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:45:51,911 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:45:51,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 86 states have (on average 1.0930232558139534) internal successors, (94), 90 states have internal predecessors, (94), 18 states have call successors, (18), 13 states have call predecessors, (18), 12 states have return successors, (17), 13 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-15 07:45:51,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 129 transitions. [2022-04-15 07:45:51,913 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 129 transitions. Word has length 57 [2022-04-15 07:45:51,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:45:51,913 INFO L478 AbstractCegarLoop]: Abstraction has 117 states and 129 transitions. [2022-04-15 07:45:51,914 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 14 states have internal predecessors, (32), 5 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-15 07:45:51,914 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 117 states and 129 transitions. [2022-04-15 07:45:53,197 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 129 edges. 129 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:45:53,197 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 129 transitions. [2022-04-15 07:45:53,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-04-15 07:45:53,198 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:45:53,198 INFO L499 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 07:45:53,203 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2022-04-15 07:45:53,403 WARN L460 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-15 07:45:53,403 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:45:53,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:45:53,403 INFO L85 PathProgramCache]: Analyzing trace with hash 1830651545, now seen corresponding path program 7 times [2022-04-15 07:45:53,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:45:53,403 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1714010759] [2022-04-15 07:45:53,404 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 07:45:53,404 INFO L85 PathProgramCache]: Analyzing trace with hash 1830651545, now seen corresponding path program 8 times [2022-04-15 07:45:53,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:45:53,404 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1647827484] [2022-04-15 07:45:53,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:45:53,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:45:53,413 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 07:45:53,413 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [402022057] [2022-04-15 07:45:53,413 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 07:45:53,413 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 07:45:53,414 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 07:45:53,414 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-15 07:45:53,415 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-15 07:45:53,464 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 07:45:53,464 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 07:45:53,465 INFO L263 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 66 conjunts are in the unsatisfiable core [2022-04-15 07:45:53,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:45:53,482 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 07:45:54,236 WARN L914 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-15 07:45:59,844 WARN L914 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-15 07:46:16,484 WARN L914 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-15 07:46:20,370 WARN L914 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-15 07:46:20,937 INFO L272 TraceCheckUtils]: 0: Hoare triple {17219#true} call ULTIMATE.init(); {17219#true} is VALID [2022-04-15 07:46:20,938 INFO L290 TraceCheckUtils]: 1: Hoare triple {17219#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(15, 2);call #Ultimate.allocInit(12, 3); {17219#true} is VALID [2022-04-15 07:46:20,938 INFO L290 TraceCheckUtils]: 2: Hoare triple {17219#true} assume true; {17219#true} is VALID [2022-04-15 07:46:20,938 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17219#true} {17219#true} #69#return; {17219#true} is VALID [2022-04-15 07:46:20,938 INFO L272 TraceCheckUtils]: 4: Hoare triple {17219#true} call #t~ret8 := main(); {17219#true} is VALID [2022-04-15 07:46:20,938 INFO L290 TraceCheckUtils]: 5: Hoare triple {17219#true} havoc ~X~0;havoc ~Y~0;havoc ~x~0;havoc ~y~0;havoc ~v~0;havoc ~xy~0;havoc ~yx~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~X~0 := #t~nondet4;havoc #t~nondet4; {17219#true} is VALID [2022-04-15 07:46:20,938 INFO L272 TraceCheckUtils]: 6: Hoare triple {17219#true} call assume_abort_if_not((if ~X~0 >= 0 && ~X~0 <= 10 then 1 else 0)); {17219#true} is VALID [2022-04-15 07:46:20,938 INFO L290 TraceCheckUtils]: 7: Hoare triple {17219#true} ~cond := #in~cond; {17245#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-15 07:46:20,939 INFO L290 TraceCheckUtils]: 8: Hoare triple {17245#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {17249#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 07:46:20,939 INFO L290 TraceCheckUtils]: 9: Hoare triple {17249#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {17249#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 07:46:20,939 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {17249#(not (= |assume_abort_if_not_#in~cond| 0))} {17219#true} #61#return; {17256#(and (<= main_~X~0 10) (<= 0 main_~X~0))} is VALID [2022-04-15 07:46:20,940 INFO L290 TraceCheckUtils]: 11: Hoare triple {17256#(and (<= main_~X~0 10) (<= 0 main_~X~0))} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~Y~0 := #t~nondet5;havoc #t~nondet5; {17256#(and (<= main_~X~0 10) (<= 0 main_~X~0))} is VALID [2022-04-15 07:46:20,940 INFO L272 TraceCheckUtils]: 12: Hoare triple {17256#(and (<= main_~X~0 10) (<= 0 main_~X~0))} call assume_abort_if_not((if ~Y~0 >= 0 && ~Y~0 <= 10 then 1 else 0)); {17219#true} is VALID [2022-04-15 07:46:20,940 INFO L290 TraceCheckUtils]: 13: Hoare triple {17219#true} ~cond := #in~cond; {17245#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-15 07:46:20,940 INFO L290 TraceCheckUtils]: 14: Hoare triple {17245#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {17249#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 07:46:20,941 INFO L290 TraceCheckUtils]: 15: Hoare triple {17249#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {17249#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 07:46:20,941 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {17249#(not (= |assume_abort_if_not_#in~cond| 0))} {17256#(and (<= main_~X~0 10) (<= 0 main_~X~0))} #63#return; {17275#(and (<= main_~X~0 10) (<= 0 main_~Y~0) (<= 0 main_~X~0) (<= main_~Y~0 10))} is VALID [2022-04-15 07:46:20,942 INFO L290 TraceCheckUtils]: 17: Hoare triple {17275#(and (<= main_~X~0 10) (<= 0 main_~Y~0) (<= 0 main_~X~0) (<= main_~Y~0 10))} ~v~0 := 2 * ~Y~0 - ~X~0;~y~0 := 0;~x~0 := 0; {17279#(and (= main_~x~0 0) (<= main_~X~0 10) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (<= 0 main_~Y~0) (<= 0 main_~X~0) (= main_~y~0 0) (<= main_~Y~0 10))} is VALID [2022-04-15 07:46:20,942 INFO L290 TraceCheckUtils]: 18: Hoare triple {17279#(and (= main_~x~0 0) (<= main_~X~0 10) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (<= 0 main_~Y~0) (<= 0 main_~X~0) (= main_~y~0 0) (<= main_~Y~0 10))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {17279#(and (= main_~x~0 0) (<= main_~X~0 10) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (<= 0 main_~Y~0) (<= 0 main_~X~0) (= main_~y~0 0) (<= main_~Y~0 10))} is VALID [2022-04-15 07:46:20,942 INFO L272 TraceCheckUtils]: 19: Hoare triple {17279#(and (= main_~x~0 0) (<= main_~X~0 10) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (<= 0 main_~Y~0) (<= 0 main_~X~0) (= main_~y~0 0) (<= main_~Y~0 10))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {17219#true} is VALID [2022-04-15 07:46:20,942 INFO L290 TraceCheckUtils]: 20: Hoare triple {17219#true} ~cond := #in~cond; {17219#true} is VALID [2022-04-15 07:46:20,942 INFO L290 TraceCheckUtils]: 21: Hoare triple {17219#true} assume !(0 == ~cond); {17219#true} is VALID [2022-04-15 07:46:20,942 INFO L290 TraceCheckUtils]: 22: Hoare triple {17219#true} assume true; {17219#true} is VALID [2022-04-15 07:46:20,943 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {17219#true} {17279#(and (= main_~x~0 0) (<= main_~X~0 10) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (<= 0 main_~Y~0) (<= 0 main_~X~0) (= main_~y~0 0) (<= main_~Y~0 10))} #65#return; {17279#(and (= main_~x~0 0) (<= main_~X~0 10) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (<= 0 main_~Y~0) (<= 0 main_~X~0) (= main_~y~0 0) (<= main_~Y~0 10))} is VALID [2022-04-15 07:46:20,943 INFO L290 TraceCheckUtils]: 24: Hoare triple {17279#(and (= main_~x~0 0) (<= main_~X~0 10) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (<= 0 main_~Y~0) (<= 0 main_~X~0) (= main_~y~0 0) (<= main_~Y~0 10))} assume !!(~x~0 <= ~X~0); {17279#(and (= main_~x~0 0) (<= main_~X~0 10) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (<= 0 main_~Y~0) (<= 0 main_~X~0) (= main_~y~0 0) (<= main_~Y~0 10))} is VALID [2022-04-15 07:46:20,944 INFO L290 TraceCheckUtils]: 25: Hoare triple {17279#(and (= main_~x~0 0) (<= main_~X~0 10) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (<= 0 main_~Y~0) (<= 0 main_~X~0) (= main_~y~0 0) (<= main_~Y~0 10))} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {17304#(and (= main_~x~0 0) (<= main_~X~0 10) (= main_~v~0 (+ (* (- 1) main_~X~0) (* main_~Y~0 4))) (<= 0 main_~Y~0) (<= 0 main_~X~0) (= main_~y~0 0) (<= main_~Y~0 10))} is VALID [2022-04-15 07:46:20,944 INFO L290 TraceCheckUtils]: 26: Hoare triple {17304#(and (= main_~x~0 0) (<= main_~X~0 10) (= main_~v~0 (+ (* (- 1) main_~X~0) (* main_~Y~0 4))) (<= 0 main_~Y~0) (<= 0 main_~X~0) (= main_~y~0 0) (<= main_~Y~0 10))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {17308#(and (<= main_~X~0 10) (<= 1 main_~x~0) (= main_~v~0 (+ (* (- 1) main_~X~0) (* main_~Y~0 4))) (<= 0 main_~Y~0) (<= 0 main_~X~0) (= main_~y~0 0) (<= main_~Y~0 10))} is VALID [2022-04-15 07:46:20,945 INFO L290 TraceCheckUtils]: 27: Hoare triple {17308#(and (<= main_~X~0 10) (<= 1 main_~x~0) (= main_~v~0 (+ (* (- 1) main_~X~0) (* main_~Y~0 4))) (<= 0 main_~Y~0) (<= 0 main_~X~0) (= main_~y~0 0) (<= main_~Y~0 10))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {17312#(and (<= main_~X~0 10) (<= 1 main_~x~0) (= main_~v~0 (+ (* (- 1) main_~X~0) (* main_~Y~0 4))) (<= 0 main_~Y~0) (<= 0 main_~X~0) (= (* main_~X~0 main_~y~0) main_~xy~0) (= main_~y~0 0) (= main_~yx~0 (* main_~Y~0 main_~x~0)) (<= main_~Y~0 10))} is VALID [2022-04-15 07:46:20,945 INFO L272 TraceCheckUtils]: 28: Hoare triple {17312#(and (<= main_~X~0 10) (<= 1 main_~x~0) (= main_~v~0 (+ (* (- 1) main_~X~0) (* main_~Y~0 4))) (<= 0 main_~Y~0) (<= 0 main_~X~0) (= (* main_~X~0 main_~y~0) main_~xy~0) (= main_~y~0 0) (= main_~yx~0 (* main_~Y~0 main_~x~0)) (<= main_~Y~0 10))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {17219#true} is VALID [2022-04-15 07:46:20,945 INFO L290 TraceCheckUtils]: 29: Hoare triple {17219#true} ~cond := #in~cond; {17319#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-15 07:46:20,945 INFO L290 TraceCheckUtils]: 30: Hoare triple {17319#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {17323#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:46:20,946 INFO L290 TraceCheckUtils]: 31: Hoare triple {17323#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {17323#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:46:20,947 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {17323#(not (= |__VERIFIER_assert_#in~cond| 0))} {17312#(and (<= main_~X~0 10) (<= 1 main_~x~0) (= main_~v~0 (+ (* (- 1) main_~X~0) (* main_~Y~0 4))) (<= 0 main_~Y~0) (<= 0 main_~X~0) (= (* main_~X~0 main_~y~0) main_~xy~0) (= main_~y~0 0) (= main_~yx~0 (* main_~Y~0 main_~x~0)) (<= main_~Y~0 10))} #65#return; {17330#(and (<= main_~X~0 10) (<= 1 main_~x~0) (= main_~v~0 (+ (* (- 1) main_~X~0) (* main_~Y~0 4))) (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (<= 0 main_~Y~0) (<= 0 main_~X~0) (= main_~y~0 0) (<= main_~Y~0 10))} is VALID [2022-04-15 07:46:20,948 INFO L290 TraceCheckUtils]: 33: Hoare triple {17330#(and (<= main_~X~0 10) (<= 1 main_~x~0) (= main_~v~0 (+ (* (- 1) main_~X~0) (* main_~Y~0 4))) (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (<= 0 main_~Y~0) (<= 0 main_~X~0) (= main_~y~0 0) (<= main_~Y~0 10))} assume !!(~x~0 <= ~X~0); {17330#(and (<= main_~X~0 10) (<= 1 main_~x~0) (= main_~v~0 (+ (* (- 1) main_~X~0) (* main_~Y~0 4))) (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (<= 0 main_~Y~0) (<= 0 main_~X~0) (= main_~y~0 0) (<= main_~Y~0 10))} is VALID [2022-04-15 07:46:20,949 INFO L290 TraceCheckUtils]: 34: Hoare triple {17330#(and (<= main_~X~0 10) (<= 1 main_~x~0) (= main_~v~0 (+ (* (- 1) main_~X~0) (* main_~Y~0 4))) (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (<= 0 main_~Y~0) (<= 0 main_~X~0) (= main_~y~0 0) (<= main_~Y~0 10))} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {17337#(and (<= main_~X~0 10) (<= 1 main_~x~0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 6)) main_~v~0) (<= 0 main_~Y~0) (<= 0 main_~X~0) (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) (* main_~Y~0 4))) (= main_~y~0 0) (<= main_~Y~0 10))} is VALID [2022-04-15 07:46:20,950 INFO L290 TraceCheckUtils]: 35: Hoare triple {17337#(and (<= main_~X~0 10) (<= 1 main_~x~0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 6)) main_~v~0) (<= 0 main_~Y~0) (<= 0 main_~X~0) (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) (* main_~Y~0 4))) (= main_~y~0 0) (<= main_~Y~0 10))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {17341#(and (<= main_~X~0 10) (<= 0 main_~Y~0) (<= 2 main_~x~0) (<= 0 main_~X~0) (= main_~y~0 0) (= (+ main_~X~0 main_~v~0) (* main_~Y~0 6)) (<= main_~Y~0 10))} is VALID [2022-04-15 07:46:20,950 INFO L290 TraceCheckUtils]: 36: Hoare triple {17341#(and (<= main_~X~0 10) (<= 0 main_~Y~0) (<= 2 main_~x~0) (<= 0 main_~X~0) (= main_~y~0 0) (= (+ main_~X~0 main_~v~0) (* main_~Y~0 6)) (<= main_~Y~0 10))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {17345#(and (<= main_~X~0 10) (<= 0 main_~Y~0) (<= 2 main_~x~0) (<= 0 main_~X~0) (= (* main_~X~0 main_~y~0) main_~xy~0) (= main_~y~0 0) (= main_~yx~0 (* main_~Y~0 main_~x~0)) (= (+ main_~X~0 main_~v~0) (* main_~Y~0 6)) (<= main_~Y~0 10))} is VALID [2022-04-15 07:46:20,950 INFO L272 TraceCheckUtils]: 37: Hoare triple {17345#(and (<= main_~X~0 10) (<= 0 main_~Y~0) (<= 2 main_~x~0) (<= 0 main_~X~0) (= (* main_~X~0 main_~y~0) main_~xy~0) (= main_~y~0 0) (= main_~yx~0 (* main_~Y~0 main_~x~0)) (= (+ main_~X~0 main_~v~0) (* main_~Y~0 6)) (<= main_~Y~0 10))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {17219#true} is VALID [2022-04-15 07:46:20,950 INFO L290 TraceCheckUtils]: 38: Hoare triple {17219#true} ~cond := #in~cond; {17319#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-15 07:46:20,951 INFO L290 TraceCheckUtils]: 39: Hoare triple {17319#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {17323#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:46:20,951 INFO L290 TraceCheckUtils]: 40: Hoare triple {17323#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {17323#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:46:20,952 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {17323#(not (= |__VERIFIER_assert_#in~cond| 0))} {17345#(and (<= main_~X~0 10) (<= 0 main_~Y~0) (<= 2 main_~x~0) (<= 0 main_~X~0) (= (* main_~X~0 main_~y~0) main_~xy~0) (= main_~y~0 0) (= main_~yx~0 (* main_~Y~0 main_~x~0)) (= (+ main_~X~0 main_~v~0) (* main_~Y~0 6)) (<= main_~Y~0 10))} #65#return; {17361#(and (<= main_~X~0 10) (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (<= 0 main_~Y~0) (<= 2 main_~x~0) (<= 0 main_~X~0) (= main_~y~0 0) (= (+ main_~X~0 main_~v~0) (* main_~Y~0 6)) (<= main_~Y~0 10))} is VALID [2022-04-15 07:46:20,952 INFO L290 TraceCheckUtils]: 42: Hoare triple {17361#(and (<= main_~X~0 10) (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (<= 0 main_~Y~0) (<= 2 main_~x~0) (<= 0 main_~X~0) (= main_~y~0 0) (= (+ main_~X~0 main_~v~0) (* main_~Y~0 6)) (<= main_~Y~0 10))} assume !!(~x~0 <= ~X~0); {17361#(and (<= main_~X~0 10) (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (<= 0 main_~Y~0) (<= 2 main_~x~0) (<= 0 main_~X~0) (= main_~y~0 0) (= (+ main_~X~0 main_~v~0) (* main_~Y~0 6)) (<= main_~Y~0 10))} is VALID [2022-04-15 07:46:20,953 INFO L290 TraceCheckUtils]: 43: Hoare triple {17361#(and (<= main_~X~0 10) (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (<= 0 main_~Y~0) (<= 2 main_~x~0) (<= 0 main_~X~0) (= main_~y~0 0) (= (+ main_~X~0 main_~v~0) (* main_~Y~0 6)) (<= main_~Y~0 10))} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {17368#(and (<= main_~X~0 10) (= (+ main_~X~0 main_~v~0 (* (- 2) main_~Y~0)) (* main_~Y~0 6)) (<= 0 main_~Y~0) (<= 2 main_~x~0) (<= 0 main_~X~0) (= main_~y~0 0) (<= main_~Y~0 10) (= (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0 (* (- 2) main_~Y~0)) (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0)))))} is VALID [2022-04-15 07:46:20,954 INFO L290 TraceCheckUtils]: 44: Hoare triple {17368#(and (<= main_~X~0 10) (= (+ main_~X~0 main_~v~0 (* (- 2) main_~Y~0)) (* main_~Y~0 6)) (<= 0 main_~Y~0) (<= 2 main_~x~0) (<= 0 main_~X~0) (= main_~y~0 0) (<= main_~Y~0 10) (= (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0 (* (- 2) main_~Y~0)) (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0)))))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {17372#(and (= (+ main_~X~0 main_~v~0) (* main_~Y~0 8)) (<= main_~X~0 10) (<= 0 main_~Y~0) (<= 0 main_~X~0) (= main_~y~0 0) (<= 3 main_~x~0) (<= main_~Y~0 10))} is VALID [2022-04-15 07:46:20,954 INFO L290 TraceCheckUtils]: 45: Hoare triple {17372#(and (= (+ main_~X~0 main_~v~0) (* main_~Y~0 8)) (<= main_~X~0 10) (<= 0 main_~Y~0) (<= 0 main_~X~0) (= main_~y~0 0) (<= 3 main_~x~0) (<= main_~Y~0 10))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {17376#(and (= (+ main_~X~0 main_~v~0) (* main_~Y~0 8)) (<= main_~X~0 10) (<= 0 main_~Y~0) (<= 0 main_~X~0) (= (* main_~X~0 main_~y~0) main_~xy~0) (= main_~y~0 0) (<= 3 main_~x~0) (= main_~yx~0 (* main_~Y~0 main_~x~0)) (<= main_~Y~0 10))} is VALID [2022-04-15 07:46:20,954 INFO L272 TraceCheckUtils]: 46: Hoare triple {17376#(and (= (+ main_~X~0 main_~v~0) (* main_~Y~0 8)) (<= main_~X~0 10) (<= 0 main_~Y~0) (<= 0 main_~X~0) (= (* main_~X~0 main_~y~0) main_~xy~0) (= main_~y~0 0) (<= 3 main_~x~0) (= main_~yx~0 (* main_~Y~0 main_~x~0)) (<= main_~Y~0 10))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {17219#true} is VALID [2022-04-15 07:46:20,955 INFO L290 TraceCheckUtils]: 47: Hoare triple {17219#true} ~cond := #in~cond; {17319#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-15 07:46:20,955 INFO L290 TraceCheckUtils]: 48: Hoare triple {17319#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {17323#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:46:20,955 INFO L290 TraceCheckUtils]: 49: Hoare triple {17323#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {17323#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:46:20,957 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {17323#(not (= |__VERIFIER_assert_#in~cond| 0))} {17376#(and (= (+ main_~X~0 main_~v~0) (* main_~Y~0 8)) (<= main_~X~0 10) (<= 0 main_~Y~0) (<= 0 main_~X~0) (= (* main_~X~0 main_~y~0) main_~xy~0) (= main_~y~0 0) (<= 3 main_~x~0) (= main_~yx~0 (* main_~Y~0 main_~x~0)) (<= main_~Y~0 10))} #65#return; {17392#(and (= (+ main_~X~0 main_~v~0) (* main_~Y~0 8)) (<= main_~X~0 10) (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (<= 0 main_~Y~0) (<= 0 main_~X~0) (= main_~y~0 0) (<= 3 main_~x~0) (<= main_~Y~0 10))} is VALID [2022-04-15 07:46:20,957 INFO L290 TraceCheckUtils]: 51: Hoare triple {17392#(and (= (+ main_~X~0 main_~v~0) (* main_~Y~0 8)) (<= main_~X~0 10) (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (<= 0 main_~Y~0) (<= 0 main_~X~0) (= main_~y~0 0) (<= 3 main_~x~0) (<= main_~Y~0 10))} assume !!(~x~0 <= ~X~0); {17392#(and (= (+ main_~X~0 main_~v~0) (* main_~Y~0 8)) (<= main_~X~0 10) (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (<= 0 main_~Y~0) (<= 0 main_~X~0) (= main_~y~0 0) (<= 3 main_~x~0) (<= main_~Y~0 10))} is VALID [2022-04-15 07:46:20,958 INFO L290 TraceCheckUtils]: 52: Hoare triple {17392#(and (= (+ main_~X~0 main_~v~0) (* main_~Y~0 8)) (<= main_~X~0 10) (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (<= 0 main_~Y~0) (<= 0 main_~X~0) (= main_~y~0 0) (<= 3 main_~x~0) (<= main_~Y~0 10))} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {17399#(and (<= main_~X~0 10) (< main_~v~0 (* main_~Y~0 2)) (<= 0 main_~Y~0) (= main_~y~0 0) (= (+ (* main_~Y~0 4) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (<= 3 main_~x~0))} is VALID [2022-04-15 07:46:20,960 INFO L290 TraceCheckUtils]: 53: Hoare triple {17399#(and (<= main_~X~0 10) (< main_~v~0 (* main_~Y~0 2)) (<= 0 main_~Y~0) (= main_~y~0 0) (= (+ (* main_~Y~0 4) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (<= 3 main_~x~0))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {17403#(and (<= main_~X~0 10) (< main_~v~0 (* main_~Y~0 2)) (<= 0 main_~Y~0) (= main_~y~0 0) (= (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0) (+ (* 2 (* (+ (- 1) main_~x~0) main_~Y~0)) (* main_~Y~0 4))) (<= 4 main_~x~0))} is VALID [2022-04-15 07:46:20,964 INFO L290 TraceCheckUtils]: 54: Hoare triple {17403#(and (<= main_~X~0 10) (< main_~v~0 (* main_~Y~0 2)) (<= 0 main_~Y~0) (= main_~y~0 0) (= (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0) (+ (* 2 (* (+ (- 1) main_~x~0) main_~Y~0)) (* main_~Y~0 4))) (<= 4 main_~x~0))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {17407#(and (or (and (= (mod (+ main_~X~0 main_~v~0) 2) 0) (= (+ (* (- 1) main_~Y~0) (div (+ (* (- 1) main_~X~0) (* (- 1) main_~v~0)) (- 2))) 0) (= main_~yx~0 0) (= main_~Y~0 0)) (and (= (* main_~Y~0 (div (+ (* (- 1) main_~Y~0) (div (+ (* (- 1) main_~X~0) (* (- 1) main_~v~0)) (- 2))) main_~Y~0)) main_~yx~0) (= (mod (+ main_~X~0 main_~v~0) 2) 0) (<= 4 (div (+ (* (- 1) main_~Y~0) (div (+ (* (- 1) main_~X~0) (* (- 1) main_~v~0)) (- 2))) main_~Y~0)) (not (= main_~Y~0 0)))) (= main_~xy~0 0) (<= main_~X~0 10) (< main_~v~0 (* main_~Y~0 2)) (<= 0 main_~Y~0))} is VALID [2022-04-15 07:46:20,967 INFO L272 TraceCheckUtils]: 55: Hoare triple {17407#(and (or (and (= (mod (+ main_~X~0 main_~v~0) 2) 0) (= (+ (* (- 1) main_~Y~0) (div (+ (* (- 1) main_~X~0) (* (- 1) main_~v~0)) (- 2))) 0) (= main_~yx~0 0) (= main_~Y~0 0)) (and (= (* main_~Y~0 (div (+ (* (- 1) main_~Y~0) (div (+ (* (- 1) main_~X~0) (* (- 1) main_~v~0)) (- 2))) main_~Y~0)) main_~yx~0) (= (mod (+ main_~X~0 main_~v~0) 2) 0) (<= 4 (div (+ (* (- 1) main_~Y~0) (div (+ (* (- 1) main_~X~0) (* (- 1) main_~v~0)) (- 2))) main_~Y~0)) (not (= main_~Y~0 0)))) (= main_~xy~0 0) (<= main_~X~0 10) (< main_~v~0 (* main_~Y~0 2)) (<= 0 main_~Y~0))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {17411#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 07:46:20,968 INFO L290 TraceCheckUtils]: 56: Hoare triple {17411#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {17415#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 07:46:20,968 INFO L290 TraceCheckUtils]: 57: Hoare triple {17415#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {17220#false} is VALID [2022-04-15 07:46:20,968 INFO L290 TraceCheckUtils]: 58: Hoare triple {17220#false} assume !false; {17220#false} is VALID [2022-04-15 07:46:20,968 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 14 proven. 41 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-04-15 07:46:20,968 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 07:46:25,705 INFO L290 TraceCheckUtils]: 58: Hoare triple {17220#false} assume !false; {17220#false} is VALID [2022-04-15 07:46:25,706 INFO L290 TraceCheckUtils]: 57: Hoare triple {17415#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {17220#false} is VALID [2022-04-15 07:46:25,706 INFO L290 TraceCheckUtils]: 56: Hoare triple {17411#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {17415#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 07:46:25,707 INFO L272 TraceCheckUtils]: 55: Hoare triple {17431#(= (+ (* 2 main_~xy~0) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 main_~yx~0)))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {17411#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 07:46:25,708 INFO L290 TraceCheckUtils]: 54: Hoare triple {17435#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {17431#(= (+ (* 2 main_~xy~0) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 main_~yx~0)))} is VALID [2022-04-15 07:46:25,710 INFO L290 TraceCheckUtils]: 53: Hoare triple {17439#(= (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0))))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {17435#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} is VALID [2022-04-15 07:46:25,711 INFO L290 TraceCheckUtils]: 52: Hoare triple {17443#(or (not (< main_~v~0 0)) (= (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0 (* main_~Y~0 2)) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0)))))} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {17439#(= (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0))))} is VALID [2022-04-15 07:46:25,711 INFO L290 TraceCheckUtils]: 51: Hoare triple {17443#(or (not (< main_~v~0 0)) (= (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0 (* main_~Y~0 2)) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0)))))} assume !!(~x~0 <= ~X~0); {17443#(or (not (< main_~v~0 0)) (= (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0 (* main_~Y~0 2)) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0)))))} is VALID [2022-04-15 07:46:25,712 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {17323#(not (= |__VERIFIER_assert_#in~cond| 0))} {17450#(or (not (< main_~v~0 0)) (not (= (+ (* 2 main_~xy~0) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 main_~yx~0)))) (= (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0 (* main_~Y~0 2)) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0)))))} #65#return; {17443#(or (not (< main_~v~0 0)) (= (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0 (* main_~Y~0 2)) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0)))))} is VALID [2022-04-15 07:46:25,712 INFO L290 TraceCheckUtils]: 49: Hoare triple {17323#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {17323#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:46:25,713 INFO L290 TraceCheckUtils]: 48: Hoare triple {17460#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {17323#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:46:25,713 INFO L290 TraceCheckUtils]: 47: Hoare triple {17219#true} ~cond := #in~cond; {17460#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 07:46:25,713 INFO L272 TraceCheckUtils]: 46: Hoare triple {17450#(or (not (< main_~v~0 0)) (not (= (+ (* 2 main_~xy~0) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 main_~yx~0)))) (= (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0 (* main_~Y~0 2)) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0)))))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {17219#true} is VALID [2022-04-15 07:46:25,714 INFO L290 TraceCheckUtils]: 45: Hoare triple {17219#true} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {17450#(or (not (< main_~v~0 0)) (not (= (+ (* 2 main_~xy~0) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 main_~yx~0)))) (= (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0 (* main_~Y~0 2)) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0)))))} is VALID [2022-04-15 07:46:25,714 INFO L290 TraceCheckUtils]: 44: Hoare triple {17219#true} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {17219#true} is VALID [2022-04-15 07:46:25,714 INFO L290 TraceCheckUtils]: 43: Hoare triple {17219#true} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {17219#true} is VALID [2022-04-15 07:46:25,714 INFO L290 TraceCheckUtils]: 42: Hoare triple {17219#true} assume !!(~x~0 <= ~X~0); {17219#true} is VALID [2022-04-15 07:46:25,714 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {17219#true} {17219#true} #65#return; {17219#true} is VALID [2022-04-15 07:46:25,714 INFO L290 TraceCheckUtils]: 40: Hoare triple {17219#true} assume true; {17219#true} is VALID [2022-04-15 07:46:25,714 INFO L290 TraceCheckUtils]: 39: Hoare triple {17219#true} assume !(0 == ~cond); {17219#true} is VALID [2022-04-15 07:46:25,715 INFO L290 TraceCheckUtils]: 38: Hoare triple {17219#true} ~cond := #in~cond; {17219#true} is VALID [2022-04-15 07:46:25,715 INFO L272 TraceCheckUtils]: 37: Hoare triple {17219#true} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {17219#true} is VALID [2022-04-15 07:46:25,715 INFO L290 TraceCheckUtils]: 36: Hoare triple {17219#true} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {17219#true} is VALID [2022-04-15 07:46:25,715 INFO L290 TraceCheckUtils]: 35: Hoare triple {17219#true} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {17219#true} is VALID [2022-04-15 07:46:25,715 INFO L290 TraceCheckUtils]: 34: Hoare triple {17219#true} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {17219#true} is VALID [2022-04-15 07:46:25,715 INFO L290 TraceCheckUtils]: 33: Hoare triple {17219#true} assume !!(~x~0 <= ~X~0); {17219#true} is VALID [2022-04-15 07:46:25,715 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {17219#true} {17219#true} #65#return; {17219#true} is VALID [2022-04-15 07:46:25,715 INFO L290 TraceCheckUtils]: 31: Hoare triple {17219#true} assume true; {17219#true} is VALID [2022-04-15 07:46:25,715 INFO L290 TraceCheckUtils]: 30: Hoare triple {17219#true} assume !(0 == ~cond); {17219#true} is VALID [2022-04-15 07:46:25,715 INFO L290 TraceCheckUtils]: 29: Hoare triple {17219#true} ~cond := #in~cond; {17219#true} is VALID [2022-04-15 07:46:25,715 INFO L272 TraceCheckUtils]: 28: Hoare triple {17219#true} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {17219#true} is VALID [2022-04-15 07:46:25,715 INFO L290 TraceCheckUtils]: 27: Hoare triple {17219#true} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {17219#true} is VALID [2022-04-15 07:46:25,715 INFO L290 TraceCheckUtils]: 26: Hoare triple {17219#true} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {17219#true} is VALID [2022-04-15 07:46:25,715 INFO L290 TraceCheckUtils]: 25: Hoare triple {17219#true} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {17219#true} is VALID [2022-04-15 07:46:25,716 INFO L290 TraceCheckUtils]: 24: Hoare triple {17219#true} assume !!(~x~0 <= ~X~0); {17219#true} is VALID [2022-04-15 07:46:25,716 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {17219#true} {17219#true} #65#return; {17219#true} is VALID [2022-04-15 07:46:25,716 INFO L290 TraceCheckUtils]: 22: Hoare triple {17219#true} assume true; {17219#true} is VALID [2022-04-15 07:46:25,716 INFO L290 TraceCheckUtils]: 21: Hoare triple {17219#true} assume !(0 == ~cond); {17219#true} is VALID [2022-04-15 07:46:25,716 INFO L290 TraceCheckUtils]: 20: Hoare triple {17219#true} ~cond := #in~cond; {17219#true} is VALID [2022-04-15 07:46:25,716 INFO L272 TraceCheckUtils]: 19: Hoare triple {17219#true} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {17219#true} is VALID [2022-04-15 07:46:25,716 INFO L290 TraceCheckUtils]: 18: Hoare triple {17219#true} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {17219#true} is VALID [2022-04-15 07:46:25,716 INFO L290 TraceCheckUtils]: 17: Hoare triple {17219#true} ~v~0 := 2 * ~Y~0 - ~X~0;~y~0 := 0;~x~0 := 0; {17219#true} is VALID [2022-04-15 07:46:25,716 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {17219#true} {17219#true} #63#return; {17219#true} is VALID [2022-04-15 07:46:25,716 INFO L290 TraceCheckUtils]: 15: Hoare triple {17219#true} assume true; {17219#true} is VALID [2022-04-15 07:46:25,716 INFO L290 TraceCheckUtils]: 14: Hoare triple {17219#true} assume !(0 == ~cond); {17219#true} is VALID [2022-04-15 07:46:25,716 INFO L290 TraceCheckUtils]: 13: Hoare triple {17219#true} ~cond := #in~cond; {17219#true} is VALID [2022-04-15 07:46:25,716 INFO L272 TraceCheckUtils]: 12: Hoare triple {17219#true} call assume_abort_if_not((if ~Y~0 >= 0 && ~Y~0 <= 10 then 1 else 0)); {17219#true} is VALID [2022-04-15 07:46:25,716 INFO L290 TraceCheckUtils]: 11: Hoare triple {17219#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~Y~0 := #t~nondet5;havoc #t~nondet5; {17219#true} is VALID [2022-04-15 07:46:25,717 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {17219#true} {17219#true} #61#return; {17219#true} is VALID [2022-04-15 07:46:25,717 INFO L290 TraceCheckUtils]: 9: Hoare triple {17219#true} assume true; {17219#true} is VALID [2022-04-15 07:46:25,717 INFO L290 TraceCheckUtils]: 8: Hoare triple {17219#true} assume !(0 == ~cond); {17219#true} is VALID [2022-04-15 07:46:25,717 INFO L290 TraceCheckUtils]: 7: Hoare triple {17219#true} ~cond := #in~cond; {17219#true} is VALID [2022-04-15 07:46:25,717 INFO L272 TraceCheckUtils]: 6: Hoare triple {17219#true} call assume_abort_if_not((if ~X~0 >= 0 && ~X~0 <= 10 then 1 else 0)); {17219#true} is VALID [2022-04-15 07:46:25,717 INFO L290 TraceCheckUtils]: 5: Hoare triple {17219#true} havoc ~X~0;havoc ~Y~0;havoc ~x~0;havoc ~y~0;havoc ~v~0;havoc ~xy~0;havoc ~yx~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~X~0 := #t~nondet4;havoc #t~nondet4; {17219#true} is VALID [2022-04-15 07:46:25,717 INFO L272 TraceCheckUtils]: 4: Hoare triple {17219#true} call #t~ret8 := main(); {17219#true} is VALID [2022-04-15 07:46:25,717 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17219#true} {17219#true} #69#return; {17219#true} is VALID [2022-04-15 07:46:25,717 INFO L290 TraceCheckUtils]: 2: Hoare triple {17219#true} assume true; {17219#true} is VALID [2022-04-15 07:46:25,717 INFO L290 TraceCheckUtils]: 1: Hoare triple {17219#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(15, 2);call #Ultimate.allocInit(12, 3); {17219#true} is VALID [2022-04-15 07:46:25,717 INFO L272 TraceCheckUtils]: 0: Hoare triple {17219#true} call ULTIMATE.init(); {17219#true} is VALID [2022-04-15 07:46:25,717 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 35 proven. 2 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2022-04-15 07:46:25,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:46:25,718 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1647827484] [2022-04-15 07:46:25,718 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 07:46:25,718 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [402022057] [2022-04-15 07:46:25,718 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [402022057] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 07:46:25,718 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 07:46:25,718 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 11] total 32 [2022-04-15 07:46:25,718 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:46:25,718 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1714010759] [2022-04-15 07:46:25,718 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1714010759] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:46:25,718 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:46:25,718 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2022-04-15 07:46:25,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1476944534] [2022-04-15 07:46:25,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:46:25,719 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 22 states have (on average 1.5454545454545454) internal successors, (34), 24 states have internal predecessors, (34), 7 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 6 states have call successors, (7) Word has length 59 [2022-04-15 07:46:25,719 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:46:25,719 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 26 states, 22 states have (on average 1.5454545454545454) internal successors, (34), 24 states have internal predecessors, (34), 7 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 6 states have call successors, (7) [2022-04-15 07:46:25,771 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:46:25,772 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-04-15 07:46:25,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:46:25,772 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-04-15 07:46:25,772 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=860, Unknown=0, NotChecked=0, Total=992 [2022-04-15 07:46:25,772 INFO L87 Difference]: Start difference. First operand 117 states and 129 transitions. Second operand has 26 states, 22 states have (on average 1.5454545454545454) internal successors, (34), 24 states have internal predecessors, (34), 7 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 6 states have call successors, (7) [2022-04-15 07:46:29,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:46:29,361 INFO L93 Difference]: Finished difference Result 153 states and 171 transitions. [2022-04-15 07:46:29,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-04-15 07:46:29,362 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 22 states have (on average 1.5454545454545454) internal successors, (34), 24 states have internal predecessors, (34), 7 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 6 states have call successors, (7) Word has length 59 [2022-04-15 07:46:29,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:46:29,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 22 states have (on average 1.5454545454545454) internal successors, (34), 24 states have internal predecessors, (34), 7 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 6 states have call successors, (7) [2022-04-15 07:46:29,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 84 transitions. [2022-04-15 07:46:29,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 22 states have (on average 1.5454545454545454) internal successors, (34), 24 states have internal predecessors, (34), 7 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 6 states have call successors, (7) [2022-04-15 07:46:29,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 84 transitions. [2022-04-15 07:46:29,364 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 24 states and 84 transitions. [2022-04-15 07:46:29,473 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-15 07:46:29,475 INFO L225 Difference]: With dead ends: 153 [2022-04-15 07:46:29,475 INFO L226 Difference]: Without dead ends: 132 [2022-04-15 07:46:29,475 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 86 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 324 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=219, Invalid=1341, Unknown=0, NotChecked=0, Total=1560 [2022-04-15 07:46:29,476 INFO L913 BasicCegarLoop]: 21 mSDtfsCounter, 44 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 744 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 808 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 744 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-04-15 07:46:29,476 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [46 Valid, 125 Invalid, 808 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 744 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-04-15 07:46:29,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2022-04-15 07:46:29,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 132. [2022-04-15 07:46:29,891 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:46:29,891 INFO L82 GeneralOperation]: Start isEquivalent. First operand 132 states. Second operand has 132 states, 98 states have (on average 1.0918367346938775) internal successors, (107), 101 states have internal predecessors, (107), 19 states have call successors, (19), 15 states have call predecessors, (19), 14 states have return successors, (18), 15 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-15 07:46:29,891 INFO L74 IsIncluded]: Start isIncluded. First operand 132 states. Second operand has 132 states, 98 states have (on average 1.0918367346938775) internal successors, (107), 101 states have internal predecessors, (107), 19 states have call successors, (19), 15 states have call predecessors, (19), 14 states have return successors, (18), 15 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-15 07:46:29,892 INFO L87 Difference]: Start difference. First operand 132 states. Second operand has 132 states, 98 states have (on average 1.0918367346938775) internal successors, (107), 101 states have internal predecessors, (107), 19 states have call successors, (19), 15 states have call predecessors, (19), 14 states have return successors, (18), 15 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-15 07:46:29,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:46:29,893 INFO L93 Difference]: Finished difference Result 132 states and 144 transitions. [2022-04-15 07:46:29,893 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 144 transitions. [2022-04-15 07:46:29,894 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:46:29,894 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:46:29,894 INFO L74 IsIncluded]: Start isIncluded. First operand has 132 states, 98 states have (on average 1.0918367346938775) internal successors, (107), 101 states have internal predecessors, (107), 19 states have call successors, (19), 15 states have call predecessors, (19), 14 states have return successors, (18), 15 states have call predecessors, (18), 18 states have call successors, (18) Second operand 132 states. [2022-04-15 07:46:29,894 INFO L87 Difference]: Start difference. First operand has 132 states, 98 states have (on average 1.0918367346938775) internal successors, (107), 101 states have internal predecessors, (107), 19 states have call successors, (19), 15 states have call predecessors, (19), 14 states have return successors, (18), 15 states have call predecessors, (18), 18 states have call successors, (18) Second operand 132 states. [2022-04-15 07:46:29,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:46:29,896 INFO L93 Difference]: Finished difference Result 132 states and 144 transitions. [2022-04-15 07:46:29,896 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 144 transitions. [2022-04-15 07:46:29,896 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:46:29,896 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:46:29,896 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:46:29,896 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:46:29,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 98 states have (on average 1.0918367346938775) internal successors, (107), 101 states have internal predecessors, (107), 19 states have call successors, (19), 15 states have call predecessors, (19), 14 states have return successors, (18), 15 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-15 07:46:29,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 144 transitions. [2022-04-15 07:46:29,898 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 144 transitions. Word has length 59 [2022-04-15 07:46:29,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:46:29,898 INFO L478 AbstractCegarLoop]: Abstraction has 132 states and 144 transitions. [2022-04-15 07:46:29,898 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 22 states have (on average 1.5454545454545454) internal successors, (34), 24 states have internal predecessors, (34), 7 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 6 states have call successors, (7) [2022-04-15 07:46:29,898 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 132 states and 144 transitions. [2022-04-15 07:46:31,066 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-15 07:46:31,066 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 144 transitions. [2022-04-15 07:46:31,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-04-15 07:46:31,066 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:46:31,066 INFO L499 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 07:46:31,082 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-15 07:46:31,267 WARN L460 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-15 07:46:31,267 INFO L403 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:46:31,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:46:31,267 INFO L85 PathProgramCache]: Analyzing trace with hash -689308389, now seen corresponding path program 15 times [2022-04-15 07:46:31,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:46:31,267 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [806545547] [2022-04-15 07:46:31,268 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 07:46:31,268 INFO L85 PathProgramCache]: Analyzing trace with hash -689308389, now seen corresponding path program 16 times [2022-04-15 07:46:31,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:46:31,268 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1995576265] [2022-04-15 07:46:31,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:46:31,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:46:31,276 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 07:46:31,276 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [17259544] [2022-04-15 07:46:31,276 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 07:46:31,276 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 07:46:31,276 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 07:46:31,277 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-15 07:46:31,278 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-15 07:46:31,318 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 07:46:31,318 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 07:46:31,318 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 52 conjunts are in the unsatisfiable core [2022-04-15 07:46:31,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:46:31,337 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 07:47:00,250 WARN L914 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-15 07:47:03,855 WARN L914 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-15 07:47:30,440 INFO L272 TraceCheckUtils]: 0: Hoare triple {18454#true} call ULTIMATE.init(); {18454#true} is VALID [2022-04-15 07:47:30,440 INFO L290 TraceCheckUtils]: 1: Hoare triple {18454#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(15, 2);call #Ultimate.allocInit(12, 3); {18454#true} is VALID [2022-04-15 07:47:30,440 INFO L290 TraceCheckUtils]: 2: Hoare triple {18454#true} assume true; {18454#true} is VALID [2022-04-15 07:47:30,440 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18454#true} {18454#true} #69#return; {18454#true} is VALID [2022-04-15 07:47:30,441 INFO L272 TraceCheckUtils]: 4: Hoare triple {18454#true} call #t~ret8 := main(); {18454#true} is VALID [2022-04-15 07:47:30,441 INFO L290 TraceCheckUtils]: 5: Hoare triple {18454#true} havoc ~X~0;havoc ~Y~0;havoc ~x~0;havoc ~y~0;havoc ~v~0;havoc ~xy~0;havoc ~yx~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~X~0 := #t~nondet4;havoc #t~nondet4; {18454#true} is VALID [2022-04-15 07:47:30,441 INFO L272 TraceCheckUtils]: 6: Hoare triple {18454#true} call assume_abort_if_not((if ~X~0 >= 0 && ~X~0 <= 10 then 1 else 0)); {18454#true} is VALID [2022-04-15 07:47:30,441 INFO L290 TraceCheckUtils]: 7: Hoare triple {18454#true} ~cond := #in~cond; {18454#true} is VALID [2022-04-15 07:47:30,441 INFO L290 TraceCheckUtils]: 8: Hoare triple {18454#true} assume !(0 == ~cond); {18454#true} is VALID [2022-04-15 07:47:30,441 INFO L290 TraceCheckUtils]: 9: Hoare triple {18454#true} assume true; {18454#true} is VALID [2022-04-15 07:47:30,441 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {18454#true} {18454#true} #61#return; {18454#true} is VALID [2022-04-15 07:47:30,441 INFO L290 TraceCheckUtils]: 11: Hoare triple {18454#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~Y~0 := #t~nondet5;havoc #t~nondet5; {18454#true} is VALID [2022-04-15 07:47:30,441 INFO L272 TraceCheckUtils]: 12: Hoare triple {18454#true} call assume_abort_if_not((if ~Y~0 >= 0 && ~Y~0 <= 10 then 1 else 0)); {18454#true} is VALID [2022-04-15 07:47:30,441 INFO L290 TraceCheckUtils]: 13: Hoare triple {18454#true} ~cond := #in~cond; {18454#true} is VALID [2022-04-15 07:47:30,441 INFO L290 TraceCheckUtils]: 14: Hoare triple {18454#true} assume !(0 == ~cond); {18454#true} is VALID [2022-04-15 07:47:30,441 INFO L290 TraceCheckUtils]: 15: Hoare triple {18454#true} assume true; {18454#true} is VALID [2022-04-15 07:47:30,441 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {18454#true} {18454#true} #63#return; {18454#true} is VALID [2022-04-15 07:47:30,442 INFO L290 TraceCheckUtils]: 17: Hoare triple {18454#true} ~v~0 := 2 * ~Y~0 - ~X~0;~y~0 := 0;~x~0 := 0; {18510#(and (= (+ main_~X~0 main_~v~0) (* main_~Y~0 2)) (= main_~y~0 0))} is VALID [2022-04-15 07:47:30,442 INFO L290 TraceCheckUtils]: 18: Hoare triple {18510#(and (= (+ main_~X~0 main_~v~0) (* main_~Y~0 2)) (= main_~y~0 0))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {18510#(and (= (+ main_~X~0 main_~v~0) (* main_~Y~0 2)) (= main_~y~0 0))} is VALID [2022-04-15 07:47:30,442 INFO L272 TraceCheckUtils]: 19: Hoare triple {18510#(and (= (+ main_~X~0 main_~v~0) (* main_~Y~0 2)) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {18454#true} is VALID [2022-04-15 07:47:30,442 INFO L290 TraceCheckUtils]: 20: Hoare triple {18454#true} ~cond := #in~cond; {18454#true} is VALID [2022-04-15 07:47:30,442 INFO L290 TraceCheckUtils]: 21: Hoare triple {18454#true} assume !(0 == ~cond); {18454#true} is VALID [2022-04-15 07:47:30,442 INFO L290 TraceCheckUtils]: 22: Hoare triple {18454#true} assume true; {18454#true} is VALID [2022-04-15 07:47:30,443 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {18454#true} {18510#(and (= (+ main_~X~0 main_~v~0) (* main_~Y~0 2)) (= main_~y~0 0))} #65#return; {18510#(and (= (+ main_~X~0 main_~v~0) (* main_~Y~0 2)) (= main_~y~0 0))} is VALID [2022-04-15 07:47:30,443 INFO L290 TraceCheckUtils]: 24: Hoare triple {18510#(and (= (+ main_~X~0 main_~v~0) (* main_~Y~0 2)) (= main_~y~0 0))} assume !!(~x~0 <= ~X~0); {18510#(and (= (+ main_~X~0 main_~v~0) (* main_~Y~0 2)) (= main_~y~0 0))} is VALID [2022-04-15 07:47:30,444 INFO L290 TraceCheckUtils]: 25: Hoare triple {18510#(and (= (+ main_~X~0 main_~v~0) (* main_~Y~0 2)) (= main_~y~0 0))} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {18535#(and (= main_~y~0 0) (= (+ main_~X~0 main_~v~0 (* (- 2) main_~Y~0)) (* main_~Y~0 2)))} is VALID [2022-04-15 07:47:30,445 INFO L290 TraceCheckUtils]: 26: Hoare triple {18535#(and (= main_~y~0 0) (= (+ main_~X~0 main_~v~0 (* (- 2) main_~Y~0)) (* main_~Y~0 2)))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {18535#(and (= main_~y~0 0) (= (+ main_~X~0 main_~v~0 (* (- 2) main_~Y~0)) (* main_~Y~0 2)))} is VALID [2022-04-15 07:47:32,448 WARN L290 TraceCheckUtils]: 27: Hoare triple {18535#(and (= main_~y~0 0) (= (+ main_~X~0 main_~v~0 (* (- 2) main_~Y~0)) (* main_~Y~0 2)))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {18542#(and (or (and (= (mod main_~yx~0 main_~Y~0) 0) (not (= main_~Y~0 0))) (= main_~yx~0 0)) (= (* main_~X~0 main_~y~0) main_~xy~0) (= main_~y~0 0) (= (+ main_~X~0 main_~v~0 (* (- 2) main_~Y~0)) (* main_~Y~0 2)))} is UNKNOWN [2022-04-15 07:47:32,448 INFO L272 TraceCheckUtils]: 28: Hoare triple {18542#(and (or (and (= (mod main_~yx~0 main_~Y~0) 0) (not (= main_~Y~0 0))) (= main_~yx~0 0)) (= (* main_~X~0 main_~y~0) main_~xy~0) (= main_~y~0 0) (= (+ main_~X~0 main_~v~0 (* (- 2) main_~Y~0)) (* main_~Y~0 2)))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {18454#true} is VALID [2022-04-15 07:47:32,448 INFO L290 TraceCheckUtils]: 29: Hoare triple {18454#true} ~cond := #in~cond; {18549#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-15 07:47:32,449 INFO L290 TraceCheckUtils]: 30: Hoare triple {18549#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {18553#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:47:32,449 INFO L290 TraceCheckUtils]: 31: Hoare triple {18553#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {18553#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:47:32,450 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {18553#(not (= |__VERIFIER_assert_#in~cond| 0))} {18542#(and (or (and (= (mod main_~yx~0 main_~Y~0) 0) (not (= main_~Y~0 0))) (= main_~yx~0 0)) (= (* main_~X~0 main_~y~0) main_~xy~0) (= main_~y~0 0) (= (+ main_~X~0 main_~v~0 (* (- 2) main_~Y~0)) (* main_~Y~0 2)))} #65#return; {18535#(and (= main_~y~0 0) (= (+ main_~X~0 main_~v~0 (* (- 2) main_~Y~0)) (* main_~Y~0 2)))} is VALID [2022-04-15 07:47:32,450 INFO L290 TraceCheckUtils]: 33: Hoare triple {18535#(and (= main_~y~0 0) (= (+ main_~X~0 main_~v~0 (* (- 2) main_~Y~0)) (* main_~Y~0 2)))} assume !!(~x~0 <= ~X~0); {18535#(and (= main_~y~0 0) (= (+ main_~X~0 main_~v~0 (* (- 2) main_~Y~0)) (* main_~Y~0 2)))} is VALID [2022-04-15 07:47:32,451 INFO L290 TraceCheckUtils]: 34: Hoare triple {18535#(and (= main_~y~0 0) (= (+ main_~X~0 main_~v~0 (* (- 2) main_~Y~0)) (* main_~Y~0 2)))} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {18566#(and (= (+ main_~X~0 main_~v~0 (* main_~Y~0 (- 4))) (* main_~Y~0 2)) (= main_~y~0 0))} is VALID [2022-04-15 07:47:32,451 INFO L290 TraceCheckUtils]: 35: Hoare triple {18566#(and (= (+ main_~X~0 main_~v~0 (* main_~Y~0 (- 4))) (* main_~Y~0 2)) (= main_~y~0 0))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {18566#(and (= (+ main_~X~0 main_~v~0 (* main_~Y~0 (- 4))) (* main_~Y~0 2)) (= main_~y~0 0))} is VALID [2022-04-15 07:47:34,454 WARN L290 TraceCheckUtils]: 36: Hoare triple {18566#(and (= (+ main_~X~0 main_~v~0 (* main_~Y~0 (- 4))) (* main_~Y~0 2)) (= main_~y~0 0))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {18573#(and (or (and (= (mod main_~yx~0 main_~Y~0) 0) (not (= main_~Y~0 0))) (= main_~yx~0 0)) (= (+ main_~X~0 main_~v~0 (* main_~Y~0 (- 4))) (* main_~Y~0 2)) (= (* main_~X~0 main_~y~0) main_~xy~0) (= main_~y~0 0))} is UNKNOWN [2022-04-15 07:47:34,454 INFO L272 TraceCheckUtils]: 37: Hoare triple {18573#(and (or (and (= (mod main_~yx~0 main_~Y~0) 0) (not (= main_~Y~0 0))) (= main_~yx~0 0)) (= (+ main_~X~0 main_~v~0 (* main_~Y~0 (- 4))) (* main_~Y~0 2)) (= (* main_~X~0 main_~y~0) main_~xy~0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {18454#true} is VALID [2022-04-15 07:47:34,454 INFO L290 TraceCheckUtils]: 38: Hoare triple {18454#true} ~cond := #in~cond; {18549#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-15 07:47:34,455 INFO L290 TraceCheckUtils]: 39: Hoare triple {18549#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {18553#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:47:34,455 INFO L290 TraceCheckUtils]: 40: Hoare triple {18553#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {18553#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:47:34,456 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {18553#(not (= |__VERIFIER_assert_#in~cond| 0))} {18573#(and (or (and (= (mod main_~yx~0 main_~Y~0) 0) (not (= main_~Y~0 0))) (= main_~yx~0 0)) (= (+ main_~X~0 main_~v~0 (* main_~Y~0 (- 4))) (* main_~Y~0 2)) (= (* main_~X~0 main_~y~0) main_~xy~0) (= main_~y~0 0))} #65#return; {18566#(and (= (+ main_~X~0 main_~v~0 (* main_~Y~0 (- 4))) (* main_~Y~0 2)) (= main_~y~0 0))} is VALID [2022-04-15 07:47:34,456 INFO L290 TraceCheckUtils]: 42: Hoare triple {18566#(and (= (+ main_~X~0 main_~v~0 (* main_~Y~0 (- 4))) (* main_~Y~0 2)) (= main_~y~0 0))} assume !!(~x~0 <= ~X~0); {18566#(and (= (+ main_~X~0 main_~v~0 (* main_~Y~0 (- 4))) (* main_~Y~0 2)) (= main_~y~0 0))} is VALID [2022-04-15 07:47:34,457 INFO L290 TraceCheckUtils]: 43: Hoare triple {18566#(and (= (+ main_~X~0 main_~v~0 (* main_~Y~0 (- 4))) (* main_~Y~0 2)) (= main_~y~0 0))} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {18595#(and (= main_~y~0 0) (= main_~v~0 (+ (* main_~Y~0 8) (* (- 1) main_~X~0))))} is VALID [2022-04-15 07:47:34,457 INFO L290 TraceCheckUtils]: 44: Hoare triple {18595#(and (= main_~y~0 0) (= main_~v~0 (+ (* main_~Y~0 8) (* (- 1) main_~X~0))))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {18595#(and (= main_~y~0 0) (= main_~v~0 (+ (* main_~Y~0 8) (* (- 1) main_~X~0))))} is VALID [2022-04-15 07:47:34,458 INFO L290 TraceCheckUtils]: 45: Hoare triple {18595#(and (= main_~y~0 0) (= main_~v~0 (+ (* main_~Y~0 8) (* (- 1) main_~X~0))))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {18602#(and (= (* main_~X~0 main_~y~0) main_~xy~0) (= main_~y~0 0) (= main_~yx~0 (* main_~Y~0 main_~x~0)) (= main_~v~0 (+ (* main_~Y~0 8) (* (- 1) main_~X~0))))} is VALID [2022-04-15 07:47:34,458 INFO L272 TraceCheckUtils]: 46: Hoare triple {18602#(and (= (* main_~X~0 main_~y~0) main_~xy~0) (= main_~y~0 0) (= main_~yx~0 (* main_~Y~0 main_~x~0)) (= main_~v~0 (+ (* main_~Y~0 8) (* (- 1) main_~X~0))))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {18454#true} is VALID [2022-04-15 07:47:34,458 INFO L290 TraceCheckUtils]: 47: Hoare triple {18454#true} ~cond := #in~cond; {18549#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-15 07:47:34,458 INFO L290 TraceCheckUtils]: 48: Hoare triple {18549#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {18553#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:47:34,458 INFO L290 TraceCheckUtils]: 49: Hoare triple {18553#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {18553#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:47:34,459 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {18553#(not (= |__VERIFIER_assert_#in~cond| 0))} {18602#(and (= (* main_~X~0 main_~y~0) main_~xy~0) (= main_~y~0 0) (= main_~yx~0 (* main_~Y~0 main_~x~0)) (= main_~v~0 (+ (* main_~Y~0 8) (* (- 1) main_~X~0))))} #65#return; {18618#(and (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (= main_~y~0 0) (= main_~v~0 (+ (* main_~Y~0 8) (* (- 1) main_~X~0))))} is VALID [2022-04-15 07:47:34,460 INFO L290 TraceCheckUtils]: 51: Hoare triple {18618#(and (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (= main_~y~0 0) (= main_~v~0 (+ (* main_~Y~0 8) (* (- 1) main_~X~0))))} assume !!(~x~0 <= ~X~0); {18618#(and (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (= main_~y~0 0) (= main_~v~0 (+ (* main_~Y~0 8) (* (- 1) main_~X~0))))} is VALID [2022-04-15 07:47:34,461 INFO L290 TraceCheckUtils]: 52: Hoare triple {18618#(and (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (= main_~y~0 0) (= main_~v~0 (+ (* main_~Y~0 8) (* (- 1) main_~X~0))))} assume !(~v~0 < 0);~v~0 := ~v~0 + 2 * (~Y~0 - ~X~0);#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {18625#(and (= main_~v~0 (+ (* main_~Y~0 main_~x~0 2) (* (- 1) main_~X~0) (* (- 2) main_~X~0 main_~y~0) (* main_~Y~0 4))) (= (+ (- 1) main_~y~0) 0) (= (+ (* main_~Y~0 main_~x~0 2) main_~X~0 (* main_~Y~0 2) (* (- 2) main_~X~0 main_~y~0)) (+ (* main_~Y~0 8) (* (- 1) main_~X~0))))} is VALID [2022-04-15 07:47:34,464 INFO L290 TraceCheckUtils]: 53: Hoare triple {18625#(and (= main_~v~0 (+ (* main_~Y~0 main_~x~0 2) (* (- 1) main_~X~0) (* (- 2) main_~X~0 main_~y~0) (* main_~Y~0 4))) (= (+ (- 1) main_~y~0) 0) (= (+ (* main_~Y~0 main_~x~0 2) main_~X~0 (* main_~Y~0 2) (* (- 2) main_~X~0 main_~y~0)) (+ (* main_~Y~0 8) (* (- 1) main_~X~0))))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {18629#(and (= (+ (- 1) main_~y~0) 0) (= main_~v~0 (+ (* (- 1) main_~X~0) (* (- 2) main_~X~0 main_~y~0) (* main_~Y~0 4) (* (+ (- 1) main_~x~0) main_~Y~0 2))) (= (+ main_~X~0 (* main_~Y~0 2) (* (- 2) main_~X~0 main_~y~0) (* (+ (- 1) main_~x~0) main_~Y~0 2)) (+ (* main_~Y~0 8) (* (- 1) main_~X~0))))} is VALID [2022-04-15 07:47:34,469 INFO L290 TraceCheckUtils]: 54: Hoare triple {18629#(and (= (+ (- 1) main_~y~0) 0) (= main_~v~0 (+ (* (- 1) main_~X~0) (* (- 2) main_~X~0 main_~y~0) (* main_~Y~0 4) (* (+ (- 1) main_~x~0) main_~Y~0 2))) (= (+ main_~X~0 (* main_~Y~0 2) (* (- 2) main_~X~0 main_~y~0) (* (+ (- 1) main_~x~0) main_~Y~0 2)) (+ (* main_~Y~0 8) (* (- 1) main_~X~0))))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {18633#(and (or (and (= (+ (div (+ (* main_~X~0 (- 3)) (* (- 1) main_~v~0)) (- 2)) (* (- 1) main_~Y~0)) 0) (= (mod (+ main_~X~0 main_~v~0) 2) 0) (= main_~yx~0 0) (= main_~Y~0 0)) (and (= (mod (+ main_~X~0 main_~v~0) 2) 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2 (+ (div (+ (div (+ (* main_~X~0 (- 3)) (* (- 1) main_~v~0)) (- 2)) (* (- 1) main_~Y~0)) main_~Y~0) (- 1))) (* main_~Y~0 2)) (+ (* main_~Y~0 8) (* (- 1) main_~X~0))) (= (* (div (+ (div (+ (* main_~X~0 (- 3)) (* (- 1) main_~v~0)) (- 2)) (* (- 1) main_~Y~0)) main_~Y~0) main_~Y~0) main_~yx~0) (not (= main_~Y~0 0)) (= (mod (+ (div (+ (* main_~X~0 (- 3)) (* (- 1) main_~v~0)) (- 2)) (* (- 1) main_~Y~0)) main_~Y~0) 0))) (= main_~X~0 main_~xy~0))} is VALID [2022-04-15 07:47:34,471 INFO L272 TraceCheckUtils]: 55: Hoare triple {18633#(and (or (and (= (+ (div (+ (* main_~X~0 (- 3)) (* (- 1) main_~v~0)) (- 2)) (* (- 1) main_~Y~0)) 0) (= (mod (+ main_~X~0 main_~v~0) 2) 0) (= main_~yx~0 0) (= main_~Y~0 0)) (and (= (mod (+ main_~X~0 main_~v~0) 2) 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2 (+ (div (+ (div (+ (* main_~X~0 (- 3)) (* (- 1) main_~v~0)) (- 2)) (* (- 1) main_~Y~0)) main_~Y~0) (- 1))) (* main_~Y~0 2)) (+ (* main_~Y~0 8) (* (- 1) main_~X~0))) (= (* (div (+ (div (+ (* main_~X~0 (- 3)) (* (- 1) main_~v~0)) (- 2)) (* (- 1) main_~Y~0)) main_~Y~0) main_~Y~0) main_~yx~0) (not (= main_~Y~0 0)) (= (mod (+ (div (+ (* main_~X~0 (- 3)) (* (- 1) main_~v~0)) (- 2)) (* (- 1) main_~Y~0)) main_~Y~0) 0))) (= main_~X~0 main_~xy~0))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {18637#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 07:47:34,472 INFO L290 TraceCheckUtils]: 56: Hoare triple {18637#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {18641#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 07:47:34,472 INFO L290 TraceCheckUtils]: 57: Hoare triple {18641#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {18455#false} is VALID [2022-04-15 07:47:34,472 INFO L290 TraceCheckUtils]: 58: Hoare triple {18455#false} assume !false; {18455#false} is VALID [2022-04-15 07:47:34,472 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 14 proven. 41 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-04-15 07:47:34,472 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 07:47:41,192 INFO L290 TraceCheckUtils]: 58: Hoare triple {18455#false} assume !false; {18455#false} is VALID [2022-04-15 07:47:41,193 INFO L290 TraceCheckUtils]: 57: Hoare triple {18641#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {18455#false} is VALID [2022-04-15 07:47:41,193 INFO L290 TraceCheckUtils]: 56: Hoare triple {18637#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {18641#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 07:47:41,194 INFO L272 TraceCheckUtils]: 55: Hoare triple {18657#(= (+ (* 2 main_~xy~0) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 main_~yx~0)))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {18637#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 07:47:41,194 INFO L290 TraceCheckUtils]: 54: Hoare triple {18661#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {18657#(= (+ (* 2 main_~xy~0) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 main_~yx~0)))} is VALID [2022-04-15 07:47:41,197 INFO L290 TraceCheckUtils]: 53: Hoare triple {18665#(= (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0))))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {18661#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} is VALID [2022-04-15 07:47:41,199 INFO L290 TraceCheckUtils]: 52: Hoare triple {18661#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} assume !(~v~0 < 0);~v~0 := ~v~0 + 2 * (~Y~0 - ~X~0);#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {18665#(= (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0))))} is VALID [2022-04-15 07:47:41,199 INFO L290 TraceCheckUtils]: 51: Hoare triple {18661#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} assume !!(~x~0 <= ~X~0); {18661#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} is VALID [2022-04-15 07:47:41,200 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {18553#(not (= |__VERIFIER_assert_#in~cond| 0))} {18675#(or (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (not (= (+ (* 2 main_~xy~0) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 main_~yx~0)))))} #65#return; {18661#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} is VALID [2022-04-15 07:47:41,200 INFO L290 TraceCheckUtils]: 49: Hoare triple {18553#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {18553#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:47:41,200 INFO L290 TraceCheckUtils]: 48: Hoare triple {18685#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {18553#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:47:41,201 INFO L290 TraceCheckUtils]: 47: Hoare triple {18454#true} ~cond := #in~cond; {18685#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 07:47:41,201 INFO L272 TraceCheckUtils]: 46: Hoare triple {18675#(or (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (not (= (+ (* 2 main_~xy~0) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 main_~yx~0)))))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {18454#true} is VALID [2022-04-15 07:47:41,202 INFO L290 TraceCheckUtils]: 45: Hoare triple {18454#true} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {18675#(or (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (not (= (+ (* 2 main_~xy~0) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 main_~yx~0)))))} is VALID [2022-04-15 07:47:41,202 INFO L290 TraceCheckUtils]: 44: Hoare triple {18454#true} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {18454#true} is VALID [2022-04-15 07:47:41,202 INFO L290 TraceCheckUtils]: 43: Hoare triple {18454#true} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {18454#true} is VALID [2022-04-15 07:47:41,202 INFO L290 TraceCheckUtils]: 42: Hoare triple {18454#true} assume !!(~x~0 <= ~X~0); {18454#true} is VALID [2022-04-15 07:47:41,202 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {18454#true} {18454#true} #65#return; {18454#true} is VALID [2022-04-15 07:47:41,202 INFO L290 TraceCheckUtils]: 40: Hoare triple {18454#true} assume true; {18454#true} is VALID [2022-04-15 07:47:41,202 INFO L290 TraceCheckUtils]: 39: Hoare triple {18454#true} assume !(0 == ~cond); {18454#true} is VALID [2022-04-15 07:47:41,202 INFO L290 TraceCheckUtils]: 38: Hoare triple {18454#true} ~cond := #in~cond; {18454#true} is VALID [2022-04-15 07:47:41,202 INFO L272 TraceCheckUtils]: 37: Hoare triple {18454#true} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {18454#true} is VALID [2022-04-15 07:47:41,202 INFO L290 TraceCheckUtils]: 36: Hoare triple {18454#true} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {18454#true} is VALID [2022-04-15 07:47:41,202 INFO L290 TraceCheckUtils]: 35: Hoare triple {18454#true} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {18454#true} is VALID [2022-04-15 07:47:41,202 INFO L290 TraceCheckUtils]: 34: Hoare triple {18454#true} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {18454#true} is VALID [2022-04-15 07:47:41,202 INFO L290 TraceCheckUtils]: 33: Hoare triple {18454#true} assume !!(~x~0 <= ~X~0); {18454#true} is VALID [2022-04-15 07:47:41,202 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {18454#true} {18454#true} #65#return; {18454#true} is VALID [2022-04-15 07:47:41,203 INFO L290 TraceCheckUtils]: 31: Hoare triple {18454#true} assume true; {18454#true} is VALID [2022-04-15 07:47:41,203 INFO L290 TraceCheckUtils]: 30: Hoare triple {18454#true} assume !(0 == ~cond); {18454#true} is VALID [2022-04-15 07:47:41,203 INFO L290 TraceCheckUtils]: 29: Hoare triple {18454#true} ~cond := #in~cond; {18454#true} is VALID [2022-04-15 07:47:41,203 INFO L272 TraceCheckUtils]: 28: Hoare triple {18454#true} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {18454#true} is VALID [2022-04-15 07:47:41,203 INFO L290 TraceCheckUtils]: 27: Hoare triple {18454#true} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {18454#true} is VALID [2022-04-15 07:47:41,203 INFO L290 TraceCheckUtils]: 26: Hoare triple {18454#true} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {18454#true} is VALID [2022-04-15 07:47:41,203 INFO L290 TraceCheckUtils]: 25: Hoare triple {18454#true} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {18454#true} is VALID [2022-04-15 07:47:41,203 INFO L290 TraceCheckUtils]: 24: Hoare triple {18454#true} assume !!(~x~0 <= ~X~0); {18454#true} is VALID [2022-04-15 07:47:41,203 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {18454#true} {18454#true} #65#return; {18454#true} is VALID [2022-04-15 07:47:41,203 INFO L290 TraceCheckUtils]: 22: Hoare triple {18454#true} assume true; {18454#true} is VALID [2022-04-15 07:47:41,203 INFO L290 TraceCheckUtils]: 21: Hoare triple {18454#true} assume !(0 == ~cond); {18454#true} is VALID [2022-04-15 07:47:41,203 INFO L290 TraceCheckUtils]: 20: Hoare triple {18454#true} ~cond := #in~cond; {18454#true} is VALID [2022-04-15 07:47:41,203 INFO L272 TraceCheckUtils]: 19: Hoare triple {18454#true} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {18454#true} is VALID [2022-04-15 07:47:41,203 INFO L290 TraceCheckUtils]: 18: Hoare triple {18454#true} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {18454#true} is VALID [2022-04-15 07:47:41,204 INFO L290 TraceCheckUtils]: 17: Hoare triple {18454#true} ~v~0 := 2 * ~Y~0 - ~X~0;~y~0 := 0;~x~0 := 0; {18454#true} is VALID [2022-04-15 07:47:41,204 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {18454#true} {18454#true} #63#return; {18454#true} is VALID [2022-04-15 07:47:41,204 INFO L290 TraceCheckUtils]: 15: Hoare triple {18454#true} assume true; {18454#true} is VALID [2022-04-15 07:47:41,204 INFO L290 TraceCheckUtils]: 14: Hoare triple {18454#true} assume !(0 == ~cond); {18454#true} is VALID [2022-04-15 07:47:41,204 INFO L290 TraceCheckUtils]: 13: Hoare triple {18454#true} ~cond := #in~cond; {18454#true} is VALID [2022-04-15 07:47:41,204 INFO L272 TraceCheckUtils]: 12: Hoare triple {18454#true} call assume_abort_if_not((if ~Y~0 >= 0 && ~Y~0 <= 10 then 1 else 0)); {18454#true} is VALID [2022-04-15 07:47:41,204 INFO L290 TraceCheckUtils]: 11: Hoare triple {18454#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~Y~0 := #t~nondet5;havoc #t~nondet5; {18454#true} is VALID [2022-04-15 07:47:41,204 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {18454#true} {18454#true} #61#return; {18454#true} is VALID [2022-04-15 07:47:41,204 INFO L290 TraceCheckUtils]: 9: Hoare triple {18454#true} assume true; {18454#true} is VALID [2022-04-15 07:47:41,204 INFO L290 TraceCheckUtils]: 8: Hoare triple {18454#true} assume !(0 == ~cond); {18454#true} is VALID [2022-04-15 07:47:41,204 INFO L290 TraceCheckUtils]: 7: Hoare triple {18454#true} ~cond := #in~cond; {18454#true} is VALID [2022-04-15 07:47:41,204 INFO L272 TraceCheckUtils]: 6: Hoare triple {18454#true} call assume_abort_if_not((if ~X~0 >= 0 && ~X~0 <= 10 then 1 else 0)); {18454#true} is VALID [2022-04-15 07:47:41,204 INFO L290 TraceCheckUtils]: 5: Hoare triple {18454#true} havoc ~X~0;havoc ~Y~0;havoc ~x~0;havoc ~y~0;havoc ~v~0;havoc ~xy~0;havoc ~yx~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~X~0 := #t~nondet4;havoc #t~nondet4; {18454#true} is VALID [2022-04-15 07:47:41,204 INFO L272 TraceCheckUtils]: 4: Hoare triple {18454#true} call #t~ret8 := main(); {18454#true} is VALID [2022-04-15 07:47:41,205 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18454#true} {18454#true} #69#return; {18454#true} is VALID [2022-04-15 07:47:41,205 INFO L290 TraceCheckUtils]: 2: Hoare triple {18454#true} assume true; {18454#true} is VALID [2022-04-15 07:47:41,205 INFO L290 TraceCheckUtils]: 1: Hoare triple {18454#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(15, 2);call #Ultimate.allocInit(12, 3); {18454#true} is VALID [2022-04-15 07:47:41,205 INFO L272 TraceCheckUtils]: 0: Hoare triple {18454#true} call ULTIMATE.init(); {18454#true} is VALID [2022-04-15 07:47:41,205 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 35 proven. 2 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2022-04-15 07:47:41,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:47:41,205 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1995576265] [2022-04-15 07:47:41,205 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 07:47:41,205 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [17259544] [2022-04-15 07:47:41,205 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [17259544] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 07:47:41,205 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 07:47:41,206 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 10] total 22 [2022-04-15 07:47:41,206 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:47:41,206 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [806545547] [2022-04-15 07:47:41,206 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [806545547] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:47:41,206 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:47:41,206 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-04-15 07:47:41,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1838636725] [2022-04-15 07:47:41,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:47:41,206 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 16 states have internal predecessors, (34), 6 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) Word has length 59 [2022-04-15 07:47:41,206 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:47:41,207 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 17 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 16 states have internal predecessors, (34), 6 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2022-04-15 07:47:45,278 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 48 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-15 07:47:45,279 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-04-15 07:47:45,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:47:45,279 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-04-15 07:47:45,279 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=405, Unknown=0, NotChecked=0, Total=462 [2022-04-15 07:47:45,279 INFO L87 Difference]: Start difference. First operand 132 states and 144 transitions. Second operand has 17 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 16 states have internal predecessors, (34), 6 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2022-04-15 07:47:48,510 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-15 07:47:51,061 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-15 07:47:52,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:47:52,438 INFO L93 Difference]: Finished difference Result 143 states and 155 transitions. [2022-04-15 07:47:52,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-04-15 07:47:52,438 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 16 states have internal predecessors, (34), 6 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) Word has length 59 [2022-04-15 07:47:52,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:47:52,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 16 states have internal predecessors, (34), 6 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2022-04-15 07:47:52,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 65 transitions. [2022-04-15 07:47:52,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 16 states have internal predecessors, (34), 6 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2022-04-15 07:47:52,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 65 transitions. [2022-04-15 07:47:52,440 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 65 transitions. [2022-04-15 07:47:56,547 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 63 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-15 07:47:56,549 INFO L225 Difference]: With dead ends: 143 [2022-04-15 07:47:56,549 INFO L226 Difference]: Without dead ends: 141 [2022-04-15 07:47:56,549 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 93 SyntacticMatches, 4 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=85, Invalid=565, Unknown=0, NotChecked=0, Total=650 [2022-04-15 07:47:56,549 INFO L913 BasicCegarLoop]: 27 mSDtfsCounter, 19 mSDsluCounter, 214 mSDsCounter, 0 mSdLazyCounter, 505 mSolverCounterSat, 5 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 241 SdHoareTripleChecker+Invalid, 512 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 505 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.0s IncrementalHoareTripleChecker+Time [2022-04-15 07:47:56,549 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 241 Invalid, 512 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 505 Invalid, 2 Unknown, 0 Unchecked, 5.0s Time] [2022-04-15 07:47:56,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2022-04-15 07:47:56,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 132. [2022-04-15 07:47:56,880 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:47:56,880 INFO L82 GeneralOperation]: Start isEquivalent. First operand 141 states. Second operand has 132 states, 98 states have (on average 1.0918367346938775) internal successors, (107), 101 states have internal predecessors, (107), 19 states have call successors, (19), 15 states have call predecessors, (19), 14 states have return successors, (18), 15 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-15 07:47:56,881 INFO L74 IsIncluded]: Start isIncluded. First operand 141 states. Second operand has 132 states, 98 states have (on average 1.0918367346938775) internal successors, (107), 101 states have internal predecessors, (107), 19 states have call successors, (19), 15 states have call predecessors, (19), 14 states have return successors, (18), 15 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-15 07:47:56,881 INFO L87 Difference]: Start difference. First operand 141 states. Second operand has 132 states, 98 states have (on average 1.0918367346938775) internal successors, (107), 101 states have internal predecessors, (107), 19 states have call successors, (19), 15 states have call predecessors, (19), 14 states have return successors, (18), 15 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-15 07:47:56,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:47:56,883 INFO L93 Difference]: Finished difference Result 141 states and 153 transitions. [2022-04-15 07:47:56,883 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 153 transitions. [2022-04-15 07:47:56,883 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:47:56,883 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:47:56,883 INFO L74 IsIncluded]: Start isIncluded. First operand has 132 states, 98 states have (on average 1.0918367346938775) internal successors, (107), 101 states have internal predecessors, (107), 19 states have call successors, (19), 15 states have call predecessors, (19), 14 states have return successors, (18), 15 states have call predecessors, (18), 18 states have call successors, (18) Second operand 141 states. [2022-04-15 07:47:56,883 INFO L87 Difference]: Start difference. First operand has 132 states, 98 states have (on average 1.0918367346938775) internal successors, (107), 101 states have internal predecessors, (107), 19 states have call successors, (19), 15 states have call predecessors, (19), 14 states have return successors, (18), 15 states have call predecessors, (18), 18 states have call successors, (18) Second operand 141 states. [2022-04-15 07:47:56,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:47:56,885 INFO L93 Difference]: Finished difference Result 141 states and 153 transitions. [2022-04-15 07:47:56,885 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 153 transitions. [2022-04-15 07:47:56,885 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:47:56,885 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:47:56,885 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:47:56,885 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:47:56,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 98 states have (on average 1.0918367346938775) internal successors, (107), 101 states have internal predecessors, (107), 19 states have call successors, (19), 15 states have call predecessors, (19), 14 states have return successors, (18), 15 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-15 07:47:56,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 144 transitions. [2022-04-15 07:47:56,887 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 144 transitions. Word has length 59 [2022-04-15 07:47:56,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:47:56,887 INFO L478 AbstractCegarLoop]: Abstraction has 132 states and 144 transitions. [2022-04-15 07:47:56,887 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 16 states have internal predecessors, (34), 6 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2022-04-15 07:47:56,887 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 132 states and 144 transitions. [2022-04-15 07:47:58,016 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-15 07:47:58,016 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 144 transitions. [2022-04-15 07:47:58,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-04-15 07:47:58,018 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:47:58,018 INFO L499 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 07:47:58,034 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-15 07:47:58,218 WARN L460 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-15 07:47:58,218 INFO L403 AbstractCegarLoop]: === Iteration 24 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:47:58,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:47:58,219 INFO L85 PathProgramCache]: Analyzing trace with hash 809583191, now seen corresponding path program 17 times [2022-04-15 07:47:58,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:47:58,219 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1848630894] [2022-04-15 07:47:58,219 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 07:47:58,219 INFO L85 PathProgramCache]: Analyzing trace with hash 809583191, now seen corresponding path program 18 times [2022-04-15 07:47:58,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:47:58,219 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2134062264] [2022-04-15 07:47:58,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:47:58,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:47:58,228 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 07:47:58,228 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [104917635] [2022-04-15 07:47:58,229 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 07:47:58,229 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 07:47:58,229 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 07:47:58,230 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-15 07:47:58,230 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-15 07:47:58,279 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-04-15 07:47:58,279 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 07:47:58,280 INFO L263 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 52 conjunts are in the unsatisfiable core [2022-04-15 07:47:58,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:47:58,295 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 07:48:09,222 WARN L914 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-15 07:48:14,470 WARN L914 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-15 07:48:14,825 INFO L272 TraceCheckUtils]: 0: Hoare triple {19669#true} call ULTIMATE.init(); {19669#true} is VALID [2022-04-15 07:48:14,825 INFO L290 TraceCheckUtils]: 1: Hoare triple {19669#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(15, 2);call #Ultimate.allocInit(12, 3); {19669#true} is VALID [2022-04-15 07:48:14,825 INFO L290 TraceCheckUtils]: 2: Hoare triple {19669#true} assume true; {19669#true} is VALID [2022-04-15 07:48:14,826 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19669#true} {19669#true} #69#return; {19669#true} is VALID [2022-04-15 07:48:14,826 INFO L272 TraceCheckUtils]: 4: Hoare triple {19669#true} call #t~ret8 := main(); {19669#true} is VALID [2022-04-15 07:48:14,826 INFO L290 TraceCheckUtils]: 5: Hoare triple {19669#true} havoc ~X~0;havoc ~Y~0;havoc ~x~0;havoc ~y~0;havoc ~v~0;havoc ~xy~0;havoc ~yx~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~X~0 := #t~nondet4;havoc #t~nondet4; {19669#true} is VALID [2022-04-15 07:48:14,826 INFO L272 TraceCheckUtils]: 6: Hoare triple {19669#true} call assume_abort_if_not((if ~X~0 >= 0 && ~X~0 <= 10 then 1 else 0)); {19669#true} is VALID [2022-04-15 07:48:14,826 INFO L290 TraceCheckUtils]: 7: Hoare triple {19669#true} ~cond := #in~cond; {19695#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-15 07:48:14,826 INFO L290 TraceCheckUtils]: 8: Hoare triple {19695#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {19699#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 07:48:14,827 INFO L290 TraceCheckUtils]: 9: Hoare triple {19699#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {19699#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 07:48:14,827 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {19699#(not (= |assume_abort_if_not_#in~cond| 0))} {19669#true} #61#return; {19706#(and (<= main_~X~0 10) (<= 0 main_~X~0))} is VALID [2022-04-15 07:48:14,828 INFO L290 TraceCheckUtils]: 11: Hoare triple {19706#(and (<= main_~X~0 10) (<= 0 main_~X~0))} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~Y~0 := #t~nondet5;havoc #t~nondet5; {19706#(and (<= main_~X~0 10) (<= 0 main_~X~0))} is VALID [2022-04-15 07:48:14,828 INFO L272 TraceCheckUtils]: 12: Hoare triple {19706#(and (<= main_~X~0 10) (<= 0 main_~X~0))} call assume_abort_if_not((if ~Y~0 >= 0 && ~Y~0 <= 10 then 1 else 0)); {19669#true} is VALID [2022-04-15 07:48:14,828 INFO L290 TraceCheckUtils]: 13: Hoare triple {19669#true} ~cond := #in~cond; {19695#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-15 07:48:14,828 INFO L290 TraceCheckUtils]: 14: Hoare triple {19695#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {19699#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 07:48:14,829 INFO L290 TraceCheckUtils]: 15: Hoare triple {19699#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {19699#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 07:48:14,829 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {19699#(not (= |assume_abort_if_not_#in~cond| 0))} {19706#(and (<= main_~X~0 10) (<= 0 main_~X~0))} #63#return; {19725#(and (<= main_~X~0 10) (<= 0 main_~Y~0) (<= 0 main_~X~0) (<= main_~Y~0 10))} is VALID [2022-04-15 07:48:14,830 INFO L290 TraceCheckUtils]: 17: Hoare triple {19725#(and (<= main_~X~0 10) (<= 0 main_~Y~0) (<= 0 main_~X~0) (<= main_~Y~0 10))} ~v~0 := 2 * ~Y~0 - ~X~0;~y~0 := 0;~x~0 := 0; {19729#(and (= main_~x~0 0) (<= main_~X~0 10) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (<= 0 main_~Y~0) (<= 0 main_~X~0) (= main_~y~0 0) (<= main_~Y~0 10))} is VALID [2022-04-15 07:48:14,830 INFO L290 TraceCheckUtils]: 18: Hoare triple {19729#(and (= main_~x~0 0) (<= main_~X~0 10) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (<= 0 main_~Y~0) (<= 0 main_~X~0) (= main_~y~0 0) (<= main_~Y~0 10))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {19729#(and (= main_~x~0 0) (<= main_~X~0 10) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (<= 0 main_~Y~0) (<= 0 main_~X~0) (= main_~y~0 0) (<= main_~Y~0 10))} is VALID [2022-04-15 07:48:14,830 INFO L272 TraceCheckUtils]: 19: Hoare triple {19729#(and (= main_~x~0 0) (<= main_~X~0 10) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (<= 0 main_~Y~0) (<= 0 main_~X~0) (= main_~y~0 0) (<= main_~Y~0 10))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {19669#true} is VALID [2022-04-15 07:48:14,830 INFO L290 TraceCheckUtils]: 20: Hoare triple {19669#true} ~cond := #in~cond; {19669#true} is VALID [2022-04-15 07:48:14,830 INFO L290 TraceCheckUtils]: 21: Hoare triple {19669#true} assume !(0 == ~cond); {19669#true} is VALID [2022-04-15 07:48:14,830 INFO L290 TraceCheckUtils]: 22: Hoare triple {19669#true} assume true; {19669#true} is VALID [2022-04-15 07:48:14,831 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {19669#true} {19729#(and (= main_~x~0 0) (<= main_~X~0 10) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (<= 0 main_~Y~0) (<= 0 main_~X~0) (= main_~y~0 0) (<= main_~Y~0 10))} #65#return; {19729#(and (= main_~x~0 0) (<= main_~X~0 10) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (<= 0 main_~Y~0) (<= 0 main_~X~0) (= main_~y~0 0) (<= main_~Y~0 10))} is VALID [2022-04-15 07:48:14,831 INFO L290 TraceCheckUtils]: 24: Hoare triple {19729#(and (= main_~x~0 0) (<= main_~X~0 10) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (<= 0 main_~Y~0) (<= 0 main_~X~0) (= main_~y~0 0) (<= main_~Y~0 10))} assume !!(~x~0 <= ~X~0); {19729#(and (= main_~x~0 0) (<= main_~X~0 10) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (<= 0 main_~Y~0) (<= 0 main_~X~0) (= main_~y~0 0) (<= main_~Y~0 10))} is VALID [2022-04-15 07:48:14,832 INFO L290 TraceCheckUtils]: 25: Hoare triple {19729#(and (= main_~x~0 0) (<= main_~X~0 10) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (<= 0 main_~Y~0) (<= 0 main_~X~0) (= main_~y~0 0) (<= main_~Y~0 10))} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {19754#(and (= main_~x~0 0) (<= main_~X~0 10) (<= 0 main_~Y~0) (<= 0 main_~X~0) (= main_~y~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) (+ main_~v~0 (* (- 2) main_~Y~0))) (<= main_~Y~0 10))} is VALID [2022-04-15 07:48:14,833 INFO L290 TraceCheckUtils]: 26: Hoare triple {19754#(and (= main_~x~0 0) (<= main_~X~0 10) (<= 0 main_~Y~0) (<= 0 main_~X~0) (= main_~y~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) (+ main_~v~0 (* (- 2) main_~Y~0))) (<= main_~Y~0 10))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {19758#(and (<= main_~X~0 10) (<= main_~x~0 1) (<= 0 main_~Y~0) (<= 0 main_~X~0) (= main_~y~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) (+ main_~v~0 (* (- 2) main_~Y~0))) (<= main_~Y~0 10))} is VALID [2022-04-15 07:48:14,833 INFO L290 TraceCheckUtils]: 27: Hoare triple {19758#(and (<= main_~X~0 10) (<= main_~x~0 1) (<= 0 main_~Y~0) (<= 0 main_~X~0) (= main_~y~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) (+ main_~v~0 (* (- 2) main_~Y~0))) (<= main_~Y~0 10))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {19758#(and (<= main_~X~0 10) (<= main_~x~0 1) (<= 0 main_~Y~0) (<= 0 main_~X~0) (= main_~y~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) (+ main_~v~0 (* (- 2) main_~Y~0))) (<= main_~Y~0 10))} is VALID [2022-04-15 07:48:14,833 INFO L272 TraceCheckUtils]: 28: Hoare triple {19758#(and (<= main_~X~0 10) (<= main_~x~0 1) (<= 0 main_~Y~0) (<= 0 main_~X~0) (= main_~y~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) (+ main_~v~0 (* (- 2) main_~Y~0))) (<= main_~Y~0 10))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {19669#true} is VALID [2022-04-15 07:48:14,833 INFO L290 TraceCheckUtils]: 29: Hoare triple {19669#true} ~cond := #in~cond; {19669#true} is VALID [2022-04-15 07:48:14,833 INFO L290 TraceCheckUtils]: 30: Hoare triple {19669#true} assume !(0 == ~cond); {19669#true} is VALID [2022-04-15 07:48:14,833 INFO L290 TraceCheckUtils]: 31: Hoare triple {19669#true} assume true; {19669#true} is VALID [2022-04-15 07:48:14,834 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {19669#true} {19758#(and (<= main_~X~0 10) (<= main_~x~0 1) (<= 0 main_~Y~0) (<= 0 main_~X~0) (= main_~y~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) (+ main_~v~0 (* (- 2) main_~Y~0))) (<= main_~Y~0 10))} #65#return; {19758#(and (<= main_~X~0 10) (<= main_~x~0 1) (<= 0 main_~Y~0) (<= 0 main_~X~0) (= main_~y~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) (+ main_~v~0 (* (- 2) main_~Y~0))) (<= main_~Y~0 10))} is VALID [2022-04-15 07:48:14,834 INFO L290 TraceCheckUtils]: 33: Hoare triple {19758#(and (<= main_~X~0 10) (<= main_~x~0 1) (<= 0 main_~Y~0) (<= 0 main_~X~0) (= main_~y~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) (+ main_~v~0 (* (- 2) main_~Y~0))) (<= main_~Y~0 10))} assume !!(~x~0 <= ~X~0); {19758#(and (<= main_~X~0 10) (<= main_~x~0 1) (<= 0 main_~Y~0) (<= 0 main_~X~0) (= main_~y~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) (+ main_~v~0 (* (- 2) main_~Y~0))) (<= main_~Y~0 10))} is VALID [2022-04-15 07:48:14,835 INFO L290 TraceCheckUtils]: 34: Hoare triple {19758#(and (<= main_~X~0 10) (<= main_~x~0 1) (<= 0 main_~Y~0) (<= 0 main_~X~0) (= main_~y~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) (+ main_~v~0 (* (- 2) main_~Y~0))) (<= main_~Y~0 10))} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {19783#(and (<= main_~X~0 10) (<= main_~x~0 1) (< (* main_~Y~0 4) main_~X~0) (<= 0 main_~Y~0) (= main_~y~0 0) (= (+ main_~X~0 main_~v~0) (* main_~Y~0 6)))} is VALID [2022-04-15 07:48:14,837 INFO L290 TraceCheckUtils]: 35: Hoare triple {19783#(and (<= main_~X~0 10) (<= main_~x~0 1) (< (* main_~Y~0 4) main_~X~0) (<= 0 main_~Y~0) (= main_~y~0 0) (= (+ main_~X~0 main_~v~0) (* main_~Y~0 6)))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {19787#(and (<= main_~X~0 10) (< (* main_~Y~0 4) main_~X~0) (<= 0 main_~Y~0) (= main_~y~0 0) (= (+ main_~X~0 main_~v~0) (* main_~Y~0 6)) (<= main_~x~0 2))} is VALID [2022-04-15 07:48:14,838 INFO L290 TraceCheckUtils]: 36: Hoare triple {19787#(and (<= main_~X~0 10) (< (* main_~Y~0 4) main_~X~0) (<= 0 main_~Y~0) (= main_~y~0 0) (= (+ main_~X~0 main_~v~0) (* main_~Y~0 6)) (<= main_~x~0 2))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {19787#(and (<= main_~X~0 10) (< (* main_~Y~0 4) main_~X~0) (<= 0 main_~Y~0) (= main_~y~0 0) (= (+ main_~X~0 main_~v~0) (* main_~Y~0 6)) (<= main_~x~0 2))} is VALID [2022-04-15 07:48:14,838 INFO L272 TraceCheckUtils]: 37: Hoare triple {19787#(and (<= main_~X~0 10) (< (* main_~Y~0 4) main_~X~0) (<= 0 main_~Y~0) (= main_~y~0 0) (= (+ main_~X~0 main_~v~0) (* main_~Y~0 6)) (<= main_~x~0 2))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {19669#true} is VALID [2022-04-15 07:48:14,838 INFO L290 TraceCheckUtils]: 38: Hoare triple {19669#true} ~cond := #in~cond; {19669#true} is VALID [2022-04-15 07:48:14,838 INFO L290 TraceCheckUtils]: 39: Hoare triple {19669#true} assume !(0 == ~cond); {19669#true} is VALID [2022-04-15 07:48:14,838 INFO L290 TraceCheckUtils]: 40: Hoare triple {19669#true} assume true; {19669#true} is VALID [2022-04-15 07:48:14,839 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {19669#true} {19787#(and (<= main_~X~0 10) (< (* main_~Y~0 4) main_~X~0) (<= 0 main_~Y~0) (= main_~y~0 0) (= (+ main_~X~0 main_~v~0) (* main_~Y~0 6)) (<= main_~x~0 2))} #65#return; {19787#(and (<= main_~X~0 10) (< (* main_~Y~0 4) main_~X~0) (<= 0 main_~Y~0) (= main_~y~0 0) (= (+ main_~X~0 main_~v~0) (* main_~Y~0 6)) (<= main_~x~0 2))} is VALID [2022-04-15 07:48:14,839 INFO L290 TraceCheckUtils]: 42: Hoare triple {19787#(and (<= main_~X~0 10) (< (* main_~Y~0 4) main_~X~0) (<= 0 main_~Y~0) (= main_~y~0 0) (= (+ main_~X~0 main_~v~0) (* main_~Y~0 6)) (<= main_~x~0 2))} assume !!(~x~0 <= ~X~0); {19787#(and (<= main_~X~0 10) (< (* main_~Y~0 4) main_~X~0) (<= 0 main_~Y~0) (= main_~y~0 0) (= (+ main_~X~0 main_~v~0) (* main_~Y~0 6)) (<= main_~x~0 2))} is VALID [2022-04-15 07:48:14,840 INFO L290 TraceCheckUtils]: 43: Hoare triple {19787#(and (<= main_~X~0 10) (< (* main_~Y~0 4) main_~X~0) (<= 0 main_~Y~0) (= main_~y~0 0) (= (+ main_~X~0 main_~v~0) (* main_~Y~0 6)) (<= main_~x~0 2))} assume !(~v~0 < 0);~v~0 := ~v~0 + 2 * (~Y~0 - ~X~0);#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {19812#(and (<= main_~X~0 10) (<= (* main_~Y~0 8) (+ main_~v~0 (* main_~X~0 3))) (= main_~y~0 1) (<= main_~X~0 (* main_~Y~0 6)) (< (* main_~Y~0 4) main_~X~0) (<= main_~x~0 2))} is VALID [2022-04-15 07:48:14,842 INFO L290 TraceCheckUtils]: 44: Hoare triple {19812#(and (<= main_~X~0 10) (<= (* main_~Y~0 8) (+ main_~v~0 (* main_~X~0 3))) (= main_~y~0 1) (<= main_~X~0 (* main_~Y~0 6)) (< (* main_~Y~0 4) main_~X~0) (<= main_~x~0 2))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {19816#(and (<= main_~X~0 10) (<= (* main_~Y~0 8) (+ main_~v~0 (* main_~X~0 3))) (= main_~y~0 1) (<= main_~X~0 (* main_~Y~0 6)) (< (* main_~Y~0 4) main_~X~0) (<= main_~x~0 3))} is VALID [2022-04-15 07:48:14,842 INFO L290 TraceCheckUtils]: 45: Hoare triple {19816#(and (<= main_~X~0 10) (<= (* main_~Y~0 8) (+ main_~v~0 (* main_~X~0 3))) (= main_~y~0 1) (<= main_~X~0 (* main_~Y~0 6)) (< (* main_~Y~0 4) main_~X~0) (<= main_~x~0 3))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {19820#(and (<= main_~X~0 10) (<= (* main_~Y~0 8) (+ main_~v~0 (* main_~X~0 3))) (= main_~y~0 1) (<= main_~X~0 (* main_~Y~0 6)) (< (* main_~Y~0 4) main_~X~0) (<= main_~x~0 3) (= (* main_~X~0 main_~y~0) main_~xy~0) (= main_~yx~0 (* main_~Y~0 main_~x~0)))} is VALID [2022-04-15 07:48:14,843 INFO L272 TraceCheckUtils]: 46: Hoare triple {19820#(and (<= main_~X~0 10) (<= (* main_~Y~0 8) (+ main_~v~0 (* main_~X~0 3))) (= main_~y~0 1) (<= main_~X~0 (* main_~Y~0 6)) (< (* main_~Y~0 4) main_~X~0) (<= main_~x~0 3) (= (* main_~X~0 main_~y~0) main_~xy~0) (= main_~yx~0 (* main_~Y~0 main_~x~0)))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {19669#true} is VALID [2022-04-15 07:48:14,843 INFO L290 TraceCheckUtils]: 47: Hoare triple {19669#true} ~cond := #in~cond; {19827#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-15 07:48:14,843 INFO L290 TraceCheckUtils]: 48: Hoare triple {19827#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {19831#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:48:14,843 INFO L290 TraceCheckUtils]: 49: Hoare triple {19831#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {19831#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:48:14,845 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {19831#(not (= |__VERIFIER_assert_#in~cond| 0))} {19820#(and (<= main_~X~0 10) (<= (* main_~Y~0 8) (+ main_~v~0 (* main_~X~0 3))) (= main_~y~0 1) (<= main_~X~0 (* main_~Y~0 6)) (< (* main_~Y~0 4) main_~X~0) (<= main_~x~0 3) (= (* main_~X~0 main_~y~0) main_~xy~0) (= main_~yx~0 (* main_~Y~0 main_~x~0)))} #65#return; {19838#(and (<= main_~X~0 10) (<= (* main_~Y~0 8) (+ main_~v~0 (* main_~X~0 3))) (= main_~y~0 1) (<= main_~X~0 (* main_~Y~0 6)) (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (< (* main_~Y~0 4) main_~X~0) (<= main_~x~0 3))} is VALID [2022-04-15 07:48:14,845 INFO L290 TraceCheckUtils]: 51: Hoare triple {19838#(and (<= main_~X~0 10) (<= (* main_~Y~0 8) (+ main_~v~0 (* main_~X~0 3))) (= main_~y~0 1) (<= main_~X~0 (* main_~Y~0 6)) (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (< (* main_~Y~0 4) main_~X~0) (<= main_~x~0 3))} assume !!(~x~0 <= ~X~0); {19838#(and (<= main_~X~0 10) (<= (* main_~Y~0 8) (+ main_~v~0 (* main_~X~0 3))) (= main_~y~0 1) (<= main_~X~0 (* main_~Y~0 6)) (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (< (* main_~Y~0 4) main_~X~0) (<= main_~x~0 3))} is VALID [2022-04-15 07:48:14,846 INFO L290 TraceCheckUtils]: 52: Hoare triple {19838#(and (<= main_~X~0 10) (<= (* main_~Y~0 8) (+ main_~v~0 (* main_~X~0 3))) (= main_~y~0 1) (<= main_~X~0 (* main_~Y~0 6)) (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (< (* main_~Y~0 4) main_~X~0) (<= main_~x~0 3))} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {19845#(and (<= main_~X~0 10) (= main_~y~0 1) (<= main_~X~0 (* main_~Y~0 6)) (< (* main_~Y~0 4) main_~X~0) (<= (* main_~Y~0 10) (+ main_~v~0 (* main_~X~0 3))) (<= main_~x~0 3) (= (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0 (* (- 2) main_~Y~0)) (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0)))))} is VALID [2022-04-15 07:48:14,848 INFO L290 TraceCheckUtils]: 53: Hoare triple {19845#(and (<= main_~X~0 10) (= main_~y~0 1) (<= main_~X~0 (* main_~Y~0 6)) (< (* main_~Y~0 4) main_~X~0) (<= (* main_~Y~0 10) (+ main_~v~0 (* main_~X~0 3))) (<= main_~x~0 3) (= (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0 (* (- 2) main_~Y~0)) (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0)))))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {19849#(and (= (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0 (* (- 2) main_~Y~0)) (+ (* main_~Y~0 2) (* 2 (* (+ (- 1) main_~x~0) main_~Y~0)))) (<= main_~x~0 4) (<= main_~X~0 10) (= main_~y~0 1) (<= main_~X~0 (* main_~Y~0 6)) (< (* main_~Y~0 4) main_~X~0) (<= (* main_~Y~0 10) (+ main_~v~0 (* main_~X~0 3))))} is VALID [2022-04-15 07:48:14,854 INFO L290 TraceCheckUtils]: 54: Hoare triple {19849#(and (= (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0 (* (- 2) main_~Y~0)) (+ (* main_~Y~0 2) (* 2 (* (+ (- 1) main_~x~0) main_~Y~0)))) (<= main_~x~0 4) (<= main_~X~0 10) (= main_~y~0 1) (<= main_~X~0 (* main_~Y~0 6)) (< (* main_~Y~0 4) main_~X~0) (<= (* main_~Y~0 10) (+ main_~v~0 (* main_~X~0 3))))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {19853#(and (= (+ (* main_~Y~0 2) (* (* (+ (div main_~yx~0 main_~Y~0) (- 1)) main_~Y~0) 2)) (+ main_~v~0 (* main_~X~0 3) (* (- 2) main_~Y~0))) (<= main_~X~0 10) (<= (div main_~yx~0 main_~Y~0) 4) (<= main_~X~0 (* main_~Y~0 6)) (< (* main_~Y~0 4) main_~X~0) (= main_~X~0 main_~xy~0) (<= (* main_~Y~0 10) (+ main_~v~0 (* main_~X~0 3))) (= (mod main_~yx~0 main_~Y~0) 0))} is VALID [2022-04-15 07:48:14,856 INFO L272 TraceCheckUtils]: 55: Hoare triple {19853#(and (= (+ (* main_~Y~0 2) (* (* (+ (div main_~yx~0 main_~Y~0) (- 1)) main_~Y~0) 2)) (+ main_~v~0 (* main_~X~0 3) (* (- 2) main_~Y~0))) (<= main_~X~0 10) (<= (div main_~yx~0 main_~Y~0) 4) (<= main_~X~0 (* main_~Y~0 6)) (< (* main_~Y~0 4) main_~X~0) (= main_~X~0 main_~xy~0) (<= (* main_~Y~0 10) (+ main_~v~0 (* main_~X~0 3))) (= (mod main_~yx~0 main_~Y~0) 0))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {19857#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 07:48:14,856 INFO L290 TraceCheckUtils]: 56: Hoare triple {19857#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {19861#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 07:48:14,856 INFO L290 TraceCheckUtils]: 57: Hoare triple {19861#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {19670#false} is VALID [2022-04-15 07:48:14,856 INFO L290 TraceCheckUtils]: 58: Hoare triple {19670#false} assume !false; {19670#false} is VALID [2022-04-15 07:48:14,857 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 16 proven. 39 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-04-15 07:48:14,857 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 07:48:18,479 INFO L290 TraceCheckUtils]: 58: Hoare triple {19670#false} assume !false; {19670#false} is VALID [2022-04-15 07:48:18,481 INFO L290 TraceCheckUtils]: 57: Hoare triple {19861#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {19670#false} is VALID [2022-04-15 07:48:18,481 INFO L290 TraceCheckUtils]: 56: Hoare triple {19857#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {19861#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 07:48:18,482 INFO L272 TraceCheckUtils]: 55: Hoare triple {19877#(= (+ (* 2 main_~xy~0) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 main_~yx~0)))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {19857#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 07:48:18,483 INFO L290 TraceCheckUtils]: 54: Hoare triple {19881#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {19877#(= (+ (* 2 main_~xy~0) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 main_~yx~0)))} is VALID [2022-04-15 07:48:18,486 INFO L290 TraceCheckUtils]: 53: Hoare triple {19885#(= (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0))))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {19881#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} is VALID [2022-04-15 07:48:18,487 INFO L290 TraceCheckUtils]: 52: Hoare triple {19881#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {19885#(= (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0))))} is VALID [2022-04-15 07:48:18,487 INFO L290 TraceCheckUtils]: 51: Hoare triple {19881#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} assume !!(~x~0 <= ~X~0); {19881#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} is VALID [2022-04-15 07:48:18,488 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {19831#(not (= |__VERIFIER_assert_#in~cond| 0))} {19895#(or (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (not (= (+ (* 2 main_~xy~0) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 main_~yx~0)))))} #65#return; {19881#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} is VALID [2022-04-15 07:48:18,488 INFO L290 TraceCheckUtils]: 49: Hoare triple {19831#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {19831#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:48:18,488 INFO L290 TraceCheckUtils]: 48: Hoare triple {19905#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {19831#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:48:18,489 INFO L290 TraceCheckUtils]: 47: Hoare triple {19669#true} ~cond := #in~cond; {19905#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 07:48:18,489 INFO L272 TraceCheckUtils]: 46: Hoare triple {19895#(or (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (not (= (+ (* 2 main_~xy~0) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 main_~yx~0)))))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {19669#true} is VALID [2022-04-15 07:48:18,490 INFO L290 TraceCheckUtils]: 45: Hoare triple {19669#true} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {19895#(or (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (not (= (+ (* 2 main_~xy~0) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 main_~yx~0)))))} is VALID [2022-04-15 07:48:18,490 INFO L290 TraceCheckUtils]: 44: Hoare triple {19669#true} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {19669#true} is VALID [2022-04-15 07:48:18,490 INFO L290 TraceCheckUtils]: 43: Hoare triple {19669#true} assume !(~v~0 < 0);~v~0 := ~v~0 + 2 * (~Y~0 - ~X~0);#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {19669#true} is VALID [2022-04-15 07:48:18,490 INFO L290 TraceCheckUtils]: 42: Hoare triple {19669#true} assume !!(~x~0 <= ~X~0); {19669#true} is VALID [2022-04-15 07:48:18,490 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {19669#true} {19669#true} #65#return; {19669#true} is VALID [2022-04-15 07:48:18,490 INFO L290 TraceCheckUtils]: 40: Hoare triple {19669#true} assume true; {19669#true} is VALID [2022-04-15 07:48:18,490 INFO L290 TraceCheckUtils]: 39: Hoare triple {19669#true} assume !(0 == ~cond); {19669#true} is VALID [2022-04-15 07:48:18,490 INFO L290 TraceCheckUtils]: 38: Hoare triple {19669#true} ~cond := #in~cond; {19669#true} is VALID [2022-04-15 07:48:18,490 INFO L272 TraceCheckUtils]: 37: Hoare triple {19669#true} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {19669#true} is VALID [2022-04-15 07:48:18,491 INFO L290 TraceCheckUtils]: 36: Hoare triple {19669#true} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {19669#true} is VALID [2022-04-15 07:48:18,491 INFO L290 TraceCheckUtils]: 35: Hoare triple {19669#true} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {19669#true} is VALID [2022-04-15 07:48:18,491 INFO L290 TraceCheckUtils]: 34: Hoare triple {19669#true} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {19669#true} is VALID [2022-04-15 07:48:18,491 INFO L290 TraceCheckUtils]: 33: Hoare triple {19669#true} assume !!(~x~0 <= ~X~0); {19669#true} is VALID [2022-04-15 07:48:18,491 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {19669#true} {19669#true} #65#return; {19669#true} is VALID [2022-04-15 07:48:18,491 INFO L290 TraceCheckUtils]: 31: Hoare triple {19669#true} assume true; {19669#true} is VALID [2022-04-15 07:48:18,491 INFO L290 TraceCheckUtils]: 30: Hoare triple {19669#true} assume !(0 == ~cond); {19669#true} is VALID [2022-04-15 07:48:18,491 INFO L290 TraceCheckUtils]: 29: Hoare triple {19669#true} ~cond := #in~cond; {19669#true} is VALID [2022-04-15 07:48:18,491 INFO L272 TraceCheckUtils]: 28: Hoare triple {19669#true} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {19669#true} is VALID [2022-04-15 07:48:18,491 INFO L290 TraceCheckUtils]: 27: Hoare triple {19669#true} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {19669#true} is VALID [2022-04-15 07:48:18,491 INFO L290 TraceCheckUtils]: 26: Hoare triple {19669#true} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {19669#true} is VALID [2022-04-15 07:48:18,491 INFO L290 TraceCheckUtils]: 25: Hoare triple {19669#true} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {19669#true} is VALID [2022-04-15 07:48:18,491 INFO L290 TraceCheckUtils]: 24: Hoare triple {19669#true} assume !!(~x~0 <= ~X~0); {19669#true} is VALID [2022-04-15 07:48:18,491 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {19669#true} {19669#true} #65#return; {19669#true} is VALID [2022-04-15 07:48:18,492 INFO L290 TraceCheckUtils]: 22: Hoare triple {19669#true} assume true; {19669#true} is VALID [2022-04-15 07:48:18,492 INFO L290 TraceCheckUtils]: 21: Hoare triple {19669#true} assume !(0 == ~cond); {19669#true} is VALID [2022-04-15 07:48:18,492 INFO L290 TraceCheckUtils]: 20: Hoare triple {19669#true} ~cond := #in~cond; {19669#true} is VALID [2022-04-15 07:48:18,492 INFO L272 TraceCheckUtils]: 19: Hoare triple {19669#true} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {19669#true} is VALID [2022-04-15 07:48:18,492 INFO L290 TraceCheckUtils]: 18: Hoare triple {19669#true} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {19669#true} is VALID [2022-04-15 07:48:18,492 INFO L290 TraceCheckUtils]: 17: Hoare triple {19669#true} ~v~0 := 2 * ~Y~0 - ~X~0;~y~0 := 0;~x~0 := 0; {19669#true} is VALID [2022-04-15 07:48:18,492 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {19669#true} {19669#true} #63#return; {19669#true} is VALID [2022-04-15 07:48:18,492 INFO L290 TraceCheckUtils]: 15: Hoare triple {19669#true} assume true; {19669#true} is VALID [2022-04-15 07:48:18,492 INFO L290 TraceCheckUtils]: 14: Hoare triple {19669#true} assume !(0 == ~cond); {19669#true} is VALID [2022-04-15 07:48:18,492 INFO L290 TraceCheckUtils]: 13: Hoare triple {19669#true} ~cond := #in~cond; {19669#true} is VALID [2022-04-15 07:48:18,492 INFO L272 TraceCheckUtils]: 12: Hoare triple {19669#true} call assume_abort_if_not((if ~Y~0 >= 0 && ~Y~0 <= 10 then 1 else 0)); {19669#true} is VALID [2022-04-15 07:48:18,492 INFO L290 TraceCheckUtils]: 11: Hoare triple {19669#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~Y~0 := #t~nondet5;havoc #t~nondet5; {19669#true} is VALID [2022-04-15 07:48:18,492 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {19669#true} {19669#true} #61#return; {19669#true} is VALID [2022-04-15 07:48:18,492 INFO L290 TraceCheckUtils]: 9: Hoare triple {19669#true} assume true; {19669#true} is VALID [2022-04-15 07:48:18,492 INFO L290 TraceCheckUtils]: 8: Hoare triple {19669#true} assume !(0 == ~cond); {19669#true} is VALID [2022-04-15 07:48:18,493 INFO L290 TraceCheckUtils]: 7: Hoare triple {19669#true} ~cond := #in~cond; {19669#true} is VALID [2022-04-15 07:48:18,493 INFO L272 TraceCheckUtils]: 6: Hoare triple {19669#true} call assume_abort_if_not((if ~X~0 >= 0 && ~X~0 <= 10 then 1 else 0)); {19669#true} is VALID [2022-04-15 07:48:18,493 INFO L290 TraceCheckUtils]: 5: Hoare triple {19669#true} havoc ~X~0;havoc ~Y~0;havoc ~x~0;havoc ~y~0;havoc ~v~0;havoc ~xy~0;havoc ~yx~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~X~0 := #t~nondet4;havoc #t~nondet4; {19669#true} is VALID [2022-04-15 07:48:18,493 INFO L272 TraceCheckUtils]: 4: Hoare triple {19669#true} call #t~ret8 := main(); {19669#true} is VALID [2022-04-15 07:48:18,493 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19669#true} {19669#true} #69#return; {19669#true} is VALID [2022-04-15 07:48:18,493 INFO L290 TraceCheckUtils]: 2: Hoare triple {19669#true} assume true; {19669#true} is VALID [2022-04-15 07:48:18,493 INFO L290 TraceCheckUtils]: 1: Hoare triple {19669#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(15, 2);call #Ultimate.allocInit(12, 3); {19669#true} is VALID [2022-04-15 07:48:18,493 INFO L272 TraceCheckUtils]: 0: Hoare triple {19669#true} call ULTIMATE.init(); {19669#true} is VALID [2022-04-15 07:48:18,493 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 35 proven. 2 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2022-04-15 07:48:18,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:48:18,494 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2134062264] [2022-04-15 07:48:18,494 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 07:48:18,494 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [104917635] [2022-04-15 07:48:18,494 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [104917635] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 07:48:18,494 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 07:48:18,494 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 10] total 27 [2022-04-15 07:48:18,494 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:48:18,494 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1848630894] [2022-04-15 07:48:18,494 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1848630894] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:48:18,494 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:48:18,494 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2022-04-15 07:48:18,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1989376391] [2022-04-15 07:48:18,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:48:18,495 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 20 states have (on average 1.7) internal successors, (34), 20 states have internal predecessors, (34), 7 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 6 states have call successors, (7) Word has length 59 [2022-04-15 07:48:18,495 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:48:18,495 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 22 states, 20 states have (on average 1.7) internal successors, (34), 20 states have internal predecessors, (34), 7 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 6 states have call successors, (7) [2022-04-15 07:48:18,565 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:48:18,565 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-04-15 07:48:18,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:48:18,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-04-15 07:48:18,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=605, Unknown=0, NotChecked=0, Total=702 [2022-04-15 07:48:18,566 INFO L87 Difference]: Start difference. First operand 132 states and 144 transitions. Second operand has 22 states, 20 states have (on average 1.7) internal successors, (34), 20 states have internal predecessors, (34), 7 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 6 states have call successors, (7) [2022-04-15 07:48:25,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:48:25,322 INFO L93 Difference]: Finished difference Result 162 states and 179 transitions. [2022-04-15 07:48:25,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-04-15 07:48:25,322 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 20 states have (on average 1.7) internal successors, (34), 20 states have internal predecessors, (34), 7 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 6 states have call successors, (7) Word has length 59 [2022-04-15 07:48:25,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:48:25,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 20 states have (on average 1.7) internal successors, (34), 20 states have internal predecessors, (34), 7 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 6 states have call successors, (7) [2022-04-15 07:48:25,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 76 transitions. [2022-04-15 07:48:25,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 20 states have (on average 1.7) internal successors, (34), 20 states have internal predecessors, (34), 7 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 6 states have call successors, (7) [2022-04-15 07:48:25,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 76 transitions. [2022-04-15 07:48:25,325 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 22 states and 76 transitions. [2022-04-15 07:48:25,415 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 76 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:48:25,417 INFO L225 Difference]: With dead ends: 162 [2022-04-15 07:48:25,417 INFO L226 Difference]: Without dead ends: 146 [2022-04-15 07:48:25,418 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 90 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 274 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=142, Invalid=914, Unknown=0, NotChecked=0, Total=1056 [2022-04-15 07:48:25,418 INFO L913 BasicCegarLoop]: 20 mSDtfsCounter, 28 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 505 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 525 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 505 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-04-15 07:48:25,418 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [31 Valid, 113 Invalid, 525 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 505 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-04-15 07:48:25,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2022-04-15 07:48:25,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 144. [2022-04-15 07:48:25,844 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:48:25,844 INFO L82 GeneralOperation]: Start isEquivalent. First operand 146 states. Second operand has 144 states, 107 states have (on average 1.0841121495327102) internal successors, (116), 111 states have internal predecessors, (116), 21 states have call successors, (21), 16 states have call predecessors, (21), 15 states have return successors, (20), 16 states have call predecessors, (20), 20 states have call successors, (20) [2022-04-15 07:48:25,844 INFO L74 IsIncluded]: Start isIncluded. First operand 146 states. Second operand has 144 states, 107 states have (on average 1.0841121495327102) internal successors, (116), 111 states have internal predecessors, (116), 21 states have call successors, (21), 16 states have call predecessors, (21), 15 states have return successors, (20), 16 states have call predecessors, (20), 20 states have call successors, (20) [2022-04-15 07:48:25,845 INFO L87 Difference]: Start difference. First operand 146 states. Second operand has 144 states, 107 states have (on average 1.0841121495327102) internal successors, (116), 111 states have internal predecessors, (116), 21 states have call successors, (21), 16 states have call predecessors, (21), 15 states have return successors, (20), 16 states have call predecessors, (20), 20 states have call successors, (20) [2022-04-15 07:48:25,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:48:25,850 INFO L93 Difference]: Finished difference Result 146 states and 159 transitions. [2022-04-15 07:48:25,850 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 159 transitions. [2022-04-15 07:48:25,850 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:48:25,850 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:48:25,850 INFO L74 IsIncluded]: Start isIncluded. First operand has 144 states, 107 states have (on average 1.0841121495327102) internal successors, (116), 111 states have internal predecessors, (116), 21 states have call successors, (21), 16 states have call predecessors, (21), 15 states have return successors, (20), 16 states have call predecessors, (20), 20 states have call successors, (20) Second operand 146 states. [2022-04-15 07:48:25,851 INFO L87 Difference]: Start difference. First operand has 144 states, 107 states have (on average 1.0841121495327102) internal successors, (116), 111 states have internal predecessors, (116), 21 states have call successors, (21), 16 states have call predecessors, (21), 15 states have return successors, (20), 16 states have call predecessors, (20), 20 states have call successors, (20) Second operand 146 states. [2022-04-15 07:48:25,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:48:25,852 INFO L93 Difference]: Finished difference Result 146 states and 159 transitions. [2022-04-15 07:48:25,852 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 159 transitions. [2022-04-15 07:48:25,852 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:48:25,852 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:48:25,853 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:48:25,853 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:48:25,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 107 states have (on average 1.0841121495327102) internal successors, (116), 111 states have internal predecessors, (116), 21 states have call successors, (21), 16 states have call predecessors, (21), 15 states have return successors, (20), 16 states have call predecessors, (20), 20 states have call successors, (20) [2022-04-15 07:48:25,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 157 transitions. [2022-04-15 07:48:25,855 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 157 transitions. Word has length 59 [2022-04-15 07:48:25,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:48:25,855 INFO L478 AbstractCegarLoop]: Abstraction has 144 states and 157 transitions. [2022-04-15 07:48:25,855 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 20 states have (on average 1.7) internal successors, (34), 20 states have internal predecessors, (34), 7 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 6 states have call successors, (7) [2022-04-15 07:48:25,855 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 144 states and 157 transitions. [2022-04-15 07:48:27,109 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 157 edges. 157 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:48:27,109 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 157 transitions. [2022-04-15 07:48:27,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-04-15 07:48:27,110 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:48:27,110 INFO L499 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 07:48:27,130 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2022-04-15 07:48:27,310 WARN L460 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-15 07:48:27,310 INFO L403 AbstractCegarLoop]: === Iteration 25 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:48:27,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:48:27,311 INFO L85 PathProgramCache]: Analyzing trace with hash 1971200155, now seen corresponding path program 19 times [2022-04-15 07:48:27,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:48:27,311 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [233128331] [2022-04-15 07:48:27,311 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 07:48:27,311 INFO L85 PathProgramCache]: Analyzing trace with hash 1971200155, now seen corresponding path program 20 times [2022-04-15 07:48:27,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:48:27,311 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1693379339] [2022-04-15 07:48:27,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:48:27,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:48:27,320 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 07:48:27,321 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1409987689] [2022-04-15 07:48:27,321 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 07:48:27,321 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 07:48:27,321 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 07:48:27,322 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-15 07:48:27,323 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-15 07:48:27,372 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 07:48:27,372 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 07:48:27,374 INFO L263 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 54 conjunts are in the unsatisfiable core [2022-04-15 07:48:27,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:48:27,406 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 07:48:57,191 WARN L914 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-15 07:48:59,451 WARN L914 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-15 07:49:15,263 INFO L272 TraceCheckUtils]: 0: Hoare triple {20965#true} call ULTIMATE.init(); {20965#true} is VALID [2022-04-15 07:49:15,264 INFO L290 TraceCheckUtils]: 1: Hoare triple {20965#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(15, 2);call #Ultimate.allocInit(12, 3); {20965#true} is VALID [2022-04-15 07:49:15,264 INFO L290 TraceCheckUtils]: 2: Hoare triple {20965#true} assume true; {20965#true} is VALID [2022-04-15 07:49:15,264 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20965#true} {20965#true} #69#return; {20965#true} is VALID [2022-04-15 07:49:15,264 INFO L272 TraceCheckUtils]: 4: Hoare triple {20965#true} call #t~ret8 := main(); {20965#true} is VALID [2022-04-15 07:49:15,264 INFO L290 TraceCheckUtils]: 5: Hoare triple {20965#true} havoc ~X~0;havoc ~Y~0;havoc ~x~0;havoc ~y~0;havoc ~v~0;havoc ~xy~0;havoc ~yx~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~X~0 := #t~nondet4;havoc #t~nondet4; {20965#true} is VALID [2022-04-15 07:49:15,264 INFO L272 TraceCheckUtils]: 6: Hoare triple {20965#true} call assume_abort_if_not((if ~X~0 >= 0 && ~X~0 <= 10 then 1 else 0)); {20965#true} is VALID [2022-04-15 07:49:15,264 INFO L290 TraceCheckUtils]: 7: Hoare triple {20965#true} ~cond := #in~cond; {20965#true} is VALID [2022-04-15 07:49:15,264 INFO L290 TraceCheckUtils]: 8: Hoare triple {20965#true} assume !(0 == ~cond); {20965#true} is VALID [2022-04-15 07:49:15,264 INFO L290 TraceCheckUtils]: 9: Hoare triple {20965#true} assume true; {20965#true} is VALID [2022-04-15 07:49:15,264 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {20965#true} {20965#true} #61#return; {20965#true} is VALID [2022-04-15 07:49:15,264 INFO L290 TraceCheckUtils]: 11: Hoare triple {20965#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~Y~0 := #t~nondet5;havoc #t~nondet5; {20965#true} is VALID [2022-04-15 07:49:15,264 INFO L272 TraceCheckUtils]: 12: Hoare triple {20965#true} call assume_abort_if_not((if ~Y~0 >= 0 && ~Y~0 <= 10 then 1 else 0)); {20965#true} is VALID [2022-04-15 07:49:15,265 INFO L290 TraceCheckUtils]: 13: Hoare triple {20965#true} ~cond := #in~cond; {20965#true} is VALID [2022-04-15 07:49:15,265 INFO L290 TraceCheckUtils]: 14: Hoare triple {20965#true} assume !(0 == ~cond); {20965#true} is VALID [2022-04-15 07:49:15,265 INFO L290 TraceCheckUtils]: 15: Hoare triple {20965#true} assume true; {20965#true} is VALID [2022-04-15 07:49:15,265 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {20965#true} {20965#true} #63#return; {20965#true} is VALID [2022-04-15 07:49:15,265 INFO L290 TraceCheckUtils]: 17: Hoare triple {20965#true} ~v~0 := 2 * ~Y~0 - ~X~0;~y~0 := 0;~x~0 := 0; {21021#(and (= (+ main_~X~0 main_~v~0) (* main_~Y~0 2)) (= main_~y~0 0))} is VALID [2022-04-15 07:49:15,265 INFO L290 TraceCheckUtils]: 18: Hoare triple {21021#(and (= (+ main_~X~0 main_~v~0) (* main_~Y~0 2)) (= main_~y~0 0))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {21021#(and (= (+ main_~X~0 main_~v~0) (* main_~Y~0 2)) (= main_~y~0 0))} is VALID [2022-04-15 07:49:15,266 INFO L272 TraceCheckUtils]: 19: Hoare triple {21021#(and (= (+ main_~X~0 main_~v~0) (* main_~Y~0 2)) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {20965#true} is VALID [2022-04-15 07:49:15,266 INFO L290 TraceCheckUtils]: 20: Hoare triple {20965#true} ~cond := #in~cond; {20965#true} is VALID [2022-04-15 07:49:15,266 INFO L290 TraceCheckUtils]: 21: Hoare triple {20965#true} assume !(0 == ~cond); {20965#true} is VALID [2022-04-15 07:49:15,266 INFO L290 TraceCheckUtils]: 22: Hoare triple {20965#true} assume true; {20965#true} is VALID [2022-04-15 07:49:15,266 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {20965#true} {21021#(and (= (+ main_~X~0 main_~v~0) (* main_~Y~0 2)) (= main_~y~0 0))} #65#return; {21021#(and (= (+ main_~X~0 main_~v~0) (* main_~Y~0 2)) (= main_~y~0 0))} is VALID [2022-04-15 07:49:15,267 INFO L290 TraceCheckUtils]: 24: Hoare triple {21021#(and (= (+ main_~X~0 main_~v~0) (* main_~Y~0 2)) (= main_~y~0 0))} assume !!(~x~0 <= ~X~0); {21021#(and (= (+ main_~X~0 main_~v~0) (* main_~Y~0 2)) (= main_~y~0 0))} is VALID [2022-04-15 07:49:15,268 INFO L290 TraceCheckUtils]: 25: Hoare triple {21021#(and (= (+ main_~X~0 main_~v~0) (* main_~Y~0 2)) (= main_~y~0 0))} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {21046#(and (= main_~v~0 (+ (* (- 1) main_~X~0) (* main_~Y~0 4))) (= main_~y~0 0))} is VALID [2022-04-15 07:49:15,268 INFO L290 TraceCheckUtils]: 26: Hoare triple {21046#(and (= main_~v~0 (+ (* (- 1) main_~X~0) (* main_~Y~0 4))) (= main_~y~0 0))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {21046#(and (= main_~v~0 (+ (* (- 1) main_~X~0) (* main_~Y~0 4))) (= main_~y~0 0))} is VALID [2022-04-15 07:49:17,271 WARN L290 TraceCheckUtils]: 27: Hoare triple {21046#(and (= main_~v~0 (+ (* (- 1) main_~X~0) (* main_~Y~0 4))) (= main_~y~0 0))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {21053#(and (or (and (= (mod main_~yx~0 main_~Y~0) 0) (not (= main_~Y~0 0))) (= main_~yx~0 0)) (= main_~v~0 (+ (* (- 1) main_~X~0) (* main_~Y~0 4))) (= (* main_~X~0 main_~y~0) main_~xy~0) (= main_~y~0 0))} is UNKNOWN [2022-04-15 07:49:17,271 INFO L272 TraceCheckUtils]: 28: Hoare triple {21053#(and (or (and (= (mod main_~yx~0 main_~Y~0) 0) (not (= main_~Y~0 0))) (= main_~yx~0 0)) (= main_~v~0 (+ (* (- 1) main_~X~0) (* main_~Y~0 4))) (= (* main_~X~0 main_~y~0) main_~xy~0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {20965#true} is VALID [2022-04-15 07:49:17,271 INFO L290 TraceCheckUtils]: 29: Hoare triple {20965#true} ~cond := #in~cond; {21060#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-15 07:49:17,272 INFO L290 TraceCheckUtils]: 30: Hoare triple {21060#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {21064#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:49:17,272 INFO L290 TraceCheckUtils]: 31: Hoare triple {21064#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {21064#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:49:17,273 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {21064#(not (= |__VERIFIER_assert_#in~cond| 0))} {21053#(and (or (and (= (mod main_~yx~0 main_~Y~0) 0) (not (= main_~Y~0 0))) (= main_~yx~0 0)) (= main_~v~0 (+ (* (- 1) main_~X~0) (* main_~Y~0 4))) (= (* main_~X~0 main_~y~0) main_~xy~0) (= main_~y~0 0))} #65#return; {21046#(and (= main_~v~0 (+ (* (- 1) main_~X~0) (* main_~Y~0 4))) (= main_~y~0 0))} is VALID [2022-04-15 07:49:17,273 INFO L290 TraceCheckUtils]: 33: Hoare triple {21046#(and (= main_~v~0 (+ (* (- 1) main_~X~0) (* main_~Y~0 4))) (= main_~y~0 0))} assume !!(~x~0 <= ~X~0); {21046#(and (= main_~v~0 (+ (* (- 1) main_~X~0) (* main_~Y~0 4))) (= main_~y~0 0))} is VALID [2022-04-15 07:49:17,274 INFO L290 TraceCheckUtils]: 34: Hoare triple {21046#(and (= main_~v~0 (+ (* (- 1) main_~X~0) (* main_~Y~0 4))) (= main_~y~0 0))} assume !(~v~0 < 0);~v~0 := ~v~0 + 2 * (~Y~0 - ~X~0);#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {21077#(and (= (+ main_~v~0 (* main_~X~0 2) (* (- 2) main_~Y~0)) (+ (* (- 1) main_~X~0) (* main_~Y~0 4))) (= main_~y~0 1))} is VALID [2022-04-15 07:49:17,274 INFO L290 TraceCheckUtils]: 35: Hoare triple {21077#(and (= (+ main_~v~0 (* main_~X~0 2) (* (- 2) main_~Y~0)) (+ (* (- 1) main_~X~0) (* main_~Y~0 4))) (= main_~y~0 1))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {21077#(and (= (+ main_~v~0 (* main_~X~0 2) (* (- 2) main_~Y~0)) (+ (* (- 1) main_~X~0) (* main_~Y~0 4))) (= main_~y~0 1))} is VALID [2022-04-15 07:49:19,278 WARN L290 TraceCheckUtils]: 36: Hoare triple {21077#(and (= (+ main_~v~0 (* main_~X~0 2) (* (- 2) main_~Y~0)) (+ (* (- 1) main_~X~0) (* main_~Y~0 4))) (= main_~y~0 1))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {21084#(and (= (+ main_~v~0 (* main_~X~0 2) (* (- 2) main_~Y~0)) (+ (* (- 1) main_~X~0) (* main_~Y~0 4))) (or (and (= (mod main_~yx~0 main_~Y~0) 0) (not (= main_~Y~0 0))) (= main_~yx~0 0)) (= main_~y~0 1) (= (* main_~X~0 main_~y~0) main_~xy~0))} is UNKNOWN [2022-04-15 07:49:19,278 INFO L272 TraceCheckUtils]: 37: Hoare triple {21084#(and (= (+ main_~v~0 (* main_~X~0 2) (* (- 2) main_~Y~0)) (+ (* (- 1) main_~X~0) (* main_~Y~0 4))) (or (and (= (mod main_~yx~0 main_~Y~0) 0) (not (= main_~Y~0 0))) (= main_~yx~0 0)) (= main_~y~0 1) (= (* main_~X~0 main_~y~0) main_~xy~0))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {20965#true} is VALID [2022-04-15 07:49:19,278 INFO L290 TraceCheckUtils]: 38: Hoare triple {20965#true} ~cond := #in~cond; {21060#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-15 07:49:19,279 INFO L290 TraceCheckUtils]: 39: Hoare triple {21060#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {21064#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:49:19,279 INFO L290 TraceCheckUtils]: 40: Hoare triple {21064#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {21064#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:49:19,280 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {21064#(not (= |__VERIFIER_assert_#in~cond| 0))} {21084#(and (= (+ main_~v~0 (* main_~X~0 2) (* (- 2) main_~Y~0)) (+ (* (- 1) main_~X~0) (* main_~Y~0 4))) (or (and (= (mod main_~yx~0 main_~Y~0) 0) (not (= main_~Y~0 0))) (= main_~yx~0 0)) (= main_~y~0 1) (= (* main_~X~0 main_~y~0) main_~xy~0))} #65#return; {21077#(and (= (+ main_~v~0 (* main_~X~0 2) (* (- 2) main_~Y~0)) (+ (* (- 1) main_~X~0) (* main_~Y~0 4))) (= main_~y~0 1))} is VALID [2022-04-15 07:49:19,280 INFO L290 TraceCheckUtils]: 42: Hoare triple {21077#(and (= (+ main_~v~0 (* main_~X~0 2) (* (- 2) main_~Y~0)) (+ (* (- 1) main_~X~0) (* main_~Y~0 4))) (= main_~y~0 1))} assume !!(~x~0 <= ~X~0); {21077#(and (= (+ main_~v~0 (* main_~X~0 2) (* (- 2) main_~Y~0)) (+ (* (- 1) main_~X~0) (* main_~Y~0 4))) (= main_~y~0 1))} is VALID [2022-04-15 07:49:19,281 INFO L290 TraceCheckUtils]: 43: Hoare triple {21077#(and (= (+ main_~v~0 (* main_~X~0 2) (* (- 2) main_~Y~0)) (+ (* (- 1) main_~X~0) (* main_~Y~0 4))) (= main_~y~0 1))} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {21106#(and (= main_~y~0 1) (= (+ main_~v~0 (* main_~Y~0 (- 4)) (* main_~X~0 2)) (+ (* (- 1) main_~X~0) (* main_~Y~0 4))))} is VALID [2022-04-15 07:49:19,281 INFO L290 TraceCheckUtils]: 44: Hoare triple {21106#(and (= main_~y~0 1) (= (+ main_~v~0 (* main_~Y~0 (- 4)) (* main_~X~0 2)) (+ (* (- 1) main_~X~0) (* main_~Y~0 4))))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {21106#(and (= main_~y~0 1) (= (+ main_~v~0 (* main_~Y~0 (- 4)) (* main_~X~0 2)) (+ (* (- 1) main_~X~0) (* main_~Y~0 4))))} is VALID [2022-04-15 07:49:19,282 INFO L290 TraceCheckUtils]: 45: Hoare triple {21106#(and (= main_~y~0 1) (= (+ main_~v~0 (* main_~Y~0 (- 4)) (* main_~X~0 2)) (+ (* (- 1) main_~X~0) (* main_~Y~0 4))))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {21113#(and (= main_~y~0 1) (= (+ main_~v~0 (* main_~Y~0 (- 4)) (* main_~X~0 2)) (+ (* (- 1) main_~X~0) (* main_~Y~0 4))) (= (* main_~X~0 main_~y~0) main_~xy~0) (= main_~yx~0 (* main_~Y~0 main_~x~0)))} is VALID [2022-04-15 07:49:19,282 INFO L272 TraceCheckUtils]: 46: Hoare triple {21113#(and (= main_~y~0 1) (= (+ main_~v~0 (* main_~Y~0 (- 4)) (* main_~X~0 2)) (+ (* (- 1) main_~X~0) (* main_~Y~0 4))) (= (* main_~X~0 main_~y~0) main_~xy~0) (= main_~yx~0 (* main_~Y~0 main_~x~0)))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {20965#true} is VALID [2022-04-15 07:49:19,282 INFO L290 TraceCheckUtils]: 47: Hoare triple {20965#true} ~cond := #in~cond; {21060#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-15 07:49:19,282 INFO L290 TraceCheckUtils]: 48: Hoare triple {21060#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {21064#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:49:19,282 INFO L290 TraceCheckUtils]: 49: Hoare triple {21064#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {21064#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:49:19,284 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {21064#(not (= |__VERIFIER_assert_#in~cond| 0))} {21113#(and (= main_~y~0 1) (= (+ main_~v~0 (* main_~Y~0 (- 4)) (* main_~X~0 2)) (+ (* (- 1) main_~X~0) (* main_~Y~0 4))) (= (* main_~X~0 main_~y~0) main_~xy~0) (= main_~yx~0 (* main_~Y~0 main_~x~0)))} #65#return; {21129#(and (= main_~y~0 1) (= (+ main_~v~0 (* main_~Y~0 (- 4)) (* main_~X~0 2)) (+ (* (- 1) main_~X~0) (* main_~Y~0 4))) (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)))} is VALID [2022-04-15 07:49:19,284 INFO L290 TraceCheckUtils]: 51: Hoare triple {21129#(and (= main_~y~0 1) (= (+ main_~v~0 (* main_~Y~0 (- 4)) (* main_~X~0 2)) (+ (* (- 1) main_~X~0) (* main_~Y~0 4))) (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)))} assume !!(~x~0 <= ~X~0); {21129#(and (= main_~y~0 1) (= (+ main_~v~0 (* main_~Y~0 (- 4)) (* main_~X~0 2)) (+ (* (- 1) main_~X~0) (* main_~Y~0 4))) (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)))} is VALID [2022-04-15 07:49:19,285 INFO L290 TraceCheckUtils]: 52: Hoare triple {21129#(and (= main_~y~0 1) (= (+ main_~v~0 (* main_~Y~0 (- 4)) (* main_~X~0 2)) (+ (* (- 1) main_~X~0) (* main_~Y~0 4))) (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)))} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {21136#(and (= main_~v~0 (+ (* main_~Y~0 main_~x~0 2) (* (- 1) main_~X~0) (* (- 2) main_~X~0 main_~y~0) (* main_~Y~0 4))) (= main_~y~0 1) (= (+ (* main_~Y~0 main_~x~0 2) main_~X~0 (* (- 2) main_~X~0 main_~y~0) (* (- 2) main_~Y~0)) (+ (* (- 1) main_~X~0) (* main_~Y~0 4))))} is VALID [2022-04-15 07:49:19,289 INFO L290 TraceCheckUtils]: 53: Hoare triple {21136#(and (= main_~v~0 (+ (* main_~Y~0 main_~x~0 2) (* (- 1) main_~X~0) (* (- 2) main_~X~0 main_~y~0) (* main_~Y~0 4))) (= main_~y~0 1) (= (+ (* main_~Y~0 main_~x~0 2) main_~X~0 (* (- 2) main_~X~0 main_~y~0) (* (- 2) main_~Y~0)) (+ (* (- 1) main_~X~0) (* main_~Y~0 4))))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {21140#(and (= main_~v~0 (+ (* (- 1) main_~X~0) (* (- 2) main_~X~0 main_~y~0) (* main_~Y~0 4) (* (+ (- 1) main_~x~0) main_~Y~0 2))) (= main_~y~0 1) (= (+ main_~X~0 (* (- 2) main_~X~0 main_~y~0) (* (+ (- 1) main_~x~0) main_~Y~0 2) (* (- 2) main_~Y~0)) (+ (* (- 1) main_~X~0) (* main_~Y~0 4))))} is VALID [2022-04-15 07:49:19,294 INFO L290 TraceCheckUtils]: 54: Hoare triple {21140#(and (= main_~v~0 (+ (* (- 1) main_~X~0) (* (- 2) main_~X~0 main_~y~0) (* main_~Y~0 4) (* (+ (- 1) main_~x~0) main_~Y~0 2))) (= main_~y~0 1) (= (+ main_~X~0 (* (- 2) main_~X~0 main_~y~0) (* (+ (- 1) main_~x~0) main_~Y~0 2) (* (- 2) main_~Y~0)) (+ (* (- 1) main_~X~0) (* main_~Y~0 4))))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {21144#(and (or (and (= (+ (div (+ (* main_~X~0 (- 3)) (* (- 1) main_~v~0)) (- 2)) (* (- 1) main_~Y~0)) 0) (= (mod (+ main_~X~0 main_~v~0) 2) 0) (= main_~yx~0 0) (= main_~Y~0 0)) (and (= (mod (+ main_~X~0 main_~v~0) 2) 0) (= (* (div (+ (div (+ (* main_~X~0 (- 3)) (* (- 1) main_~v~0)) (- 2)) (* (- 1) main_~Y~0)) main_~Y~0) main_~Y~0) main_~yx~0) (not (= main_~Y~0 0)) (= (mod (+ (div (+ (* main_~X~0 (- 3)) (* (- 1) main_~v~0)) (- 2)) (* (- 1) main_~Y~0)) main_~Y~0) 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2 (+ (div (+ (div (+ (* main_~X~0 (- 3)) (* (- 1) main_~v~0)) (- 2)) (* (- 1) main_~Y~0)) main_~Y~0) (- 1))) (* (- 2) main_~Y~0)) (+ (* (- 1) main_~X~0) (* main_~Y~0 4))))) (= main_~X~0 main_~xy~0))} is VALID [2022-04-15 07:49:19,297 INFO L272 TraceCheckUtils]: 55: Hoare triple {21144#(and (or (and (= (+ (div (+ (* main_~X~0 (- 3)) (* (- 1) main_~v~0)) (- 2)) (* (- 1) main_~Y~0)) 0) (= (mod (+ main_~X~0 main_~v~0) 2) 0) (= main_~yx~0 0) (= main_~Y~0 0)) (and (= (mod (+ main_~X~0 main_~v~0) 2) 0) (= (* (div (+ (div (+ (* main_~X~0 (- 3)) (* (- 1) main_~v~0)) (- 2)) (* (- 1) main_~Y~0)) main_~Y~0) main_~Y~0) main_~yx~0) (not (= main_~Y~0 0)) (= (mod (+ (div (+ (* main_~X~0 (- 3)) (* (- 1) main_~v~0)) (- 2)) (* (- 1) main_~Y~0)) main_~Y~0) 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2 (+ (div (+ (div (+ (* main_~X~0 (- 3)) (* (- 1) main_~v~0)) (- 2)) (* (- 1) main_~Y~0)) main_~Y~0) (- 1))) (* (- 2) main_~Y~0)) (+ (* (- 1) main_~X~0) (* main_~Y~0 4))))) (= main_~X~0 main_~xy~0))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {21148#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 07:49:19,297 INFO L290 TraceCheckUtils]: 56: Hoare triple {21148#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {21152#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 07:49:19,297 INFO L290 TraceCheckUtils]: 57: Hoare triple {21152#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {20966#false} is VALID [2022-04-15 07:49:19,297 INFO L290 TraceCheckUtils]: 58: Hoare triple {20966#false} assume !false; {20966#false} is VALID [2022-04-15 07:49:19,298 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 14 proven. 41 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-04-15 07:49:19,298 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 07:49:22,959 INFO L290 TraceCheckUtils]: 58: Hoare triple {20966#false} assume !false; {20966#false} is VALID [2022-04-15 07:49:22,959 INFO L290 TraceCheckUtils]: 57: Hoare triple {21152#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {20966#false} is VALID [2022-04-15 07:49:22,960 INFO L290 TraceCheckUtils]: 56: Hoare triple {21148#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {21152#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 07:49:22,960 INFO L272 TraceCheckUtils]: 55: Hoare triple {21168#(= (+ (* 2 main_~xy~0) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 main_~yx~0)))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {21148#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 07:49:22,961 INFO L290 TraceCheckUtils]: 54: Hoare triple {21172#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {21168#(= (+ (* 2 main_~xy~0) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 main_~yx~0)))} is VALID [2022-04-15 07:49:22,964 INFO L290 TraceCheckUtils]: 53: Hoare triple {21176#(= (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0))))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {21172#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} is VALID [2022-04-15 07:49:22,965 INFO L290 TraceCheckUtils]: 52: Hoare triple {21172#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {21176#(= (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0))))} is VALID [2022-04-15 07:49:22,965 INFO L290 TraceCheckUtils]: 51: Hoare triple {21172#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} assume !!(~x~0 <= ~X~0); {21172#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} is VALID [2022-04-15 07:49:22,966 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {21064#(not (= |__VERIFIER_assert_#in~cond| 0))} {21186#(or (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (not (= (+ (* 2 main_~xy~0) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 main_~yx~0)))))} #65#return; {21172#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} is VALID [2022-04-15 07:49:22,966 INFO L290 TraceCheckUtils]: 49: Hoare triple {21064#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {21064#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:49:22,966 INFO L290 TraceCheckUtils]: 48: Hoare triple {21196#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {21064#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:49:22,967 INFO L290 TraceCheckUtils]: 47: Hoare triple {20965#true} ~cond := #in~cond; {21196#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 07:49:22,967 INFO L272 TraceCheckUtils]: 46: Hoare triple {21186#(or (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (not (= (+ (* 2 main_~xy~0) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 main_~yx~0)))))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {20965#true} is VALID [2022-04-15 07:49:22,968 INFO L290 TraceCheckUtils]: 45: Hoare triple {20965#true} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {21186#(or (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (not (= (+ (* 2 main_~xy~0) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 main_~yx~0)))))} is VALID [2022-04-15 07:49:22,968 INFO L290 TraceCheckUtils]: 44: Hoare triple {20965#true} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {20965#true} is VALID [2022-04-15 07:49:22,968 INFO L290 TraceCheckUtils]: 43: Hoare triple {20965#true} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {20965#true} is VALID [2022-04-15 07:49:22,968 INFO L290 TraceCheckUtils]: 42: Hoare triple {20965#true} assume !!(~x~0 <= ~X~0); {20965#true} is VALID [2022-04-15 07:49:22,968 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {20965#true} {20965#true} #65#return; {20965#true} is VALID [2022-04-15 07:49:22,968 INFO L290 TraceCheckUtils]: 40: Hoare triple {20965#true} assume true; {20965#true} is VALID [2022-04-15 07:49:22,968 INFO L290 TraceCheckUtils]: 39: Hoare triple {20965#true} assume !(0 == ~cond); {20965#true} is VALID [2022-04-15 07:49:22,968 INFO L290 TraceCheckUtils]: 38: Hoare triple {20965#true} ~cond := #in~cond; {20965#true} is VALID [2022-04-15 07:49:22,968 INFO L272 TraceCheckUtils]: 37: Hoare triple {20965#true} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {20965#true} is VALID [2022-04-15 07:49:22,969 INFO L290 TraceCheckUtils]: 36: Hoare triple {20965#true} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {20965#true} is VALID [2022-04-15 07:49:22,969 INFO L290 TraceCheckUtils]: 35: Hoare triple {20965#true} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {20965#true} is VALID [2022-04-15 07:49:22,969 INFO L290 TraceCheckUtils]: 34: Hoare triple {20965#true} assume !(~v~0 < 0);~v~0 := ~v~0 + 2 * (~Y~0 - ~X~0);#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {20965#true} is VALID [2022-04-15 07:49:22,969 INFO L290 TraceCheckUtils]: 33: Hoare triple {20965#true} assume !!(~x~0 <= ~X~0); {20965#true} is VALID [2022-04-15 07:49:22,969 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {20965#true} {20965#true} #65#return; {20965#true} is VALID [2022-04-15 07:49:22,969 INFO L290 TraceCheckUtils]: 31: Hoare triple {20965#true} assume true; {20965#true} is VALID [2022-04-15 07:49:22,969 INFO L290 TraceCheckUtils]: 30: Hoare triple {20965#true} assume !(0 == ~cond); {20965#true} is VALID [2022-04-15 07:49:22,969 INFO L290 TraceCheckUtils]: 29: Hoare triple {20965#true} ~cond := #in~cond; {20965#true} is VALID [2022-04-15 07:49:22,969 INFO L272 TraceCheckUtils]: 28: Hoare triple {20965#true} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {20965#true} is VALID [2022-04-15 07:49:22,969 INFO L290 TraceCheckUtils]: 27: Hoare triple {20965#true} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {20965#true} is VALID [2022-04-15 07:49:22,969 INFO L290 TraceCheckUtils]: 26: Hoare triple {20965#true} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {20965#true} is VALID [2022-04-15 07:49:22,969 INFO L290 TraceCheckUtils]: 25: Hoare triple {20965#true} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {20965#true} is VALID [2022-04-15 07:49:22,969 INFO L290 TraceCheckUtils]: 24: Hoare triple {20965#true} assume !!(~x~0 <= ~X~0); {20965#true} is VALID [2022-04-15 07:49:22,969 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {20965#true} {20965#true} #65#return; {20965#true} is VALID [2022-04-15 07:49:22,970 INFO L290 TraceCheckUtils]: 22: Hoare triple {20965#true} assume true; {20965#true} is VALID [2022-04-15 07:49:22,970 INFO L290 TraceCheckUtils]: 21: Hoare triple {20965#true} assume !(0 == ~cond); {20965#true} is VALID [2022-04-15 07:49:22,970 INFO L290 TraceCheckUtils]: 20: Hoare triple {20965#true} ~cond := #in~cond; {20965#true} is VALID [2022-04-15 07:49:22,970 INFO L272 TraceCheckUtils]: 19: Hoare triple {20965#true} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {20965#true} is VALID [2022-04-15 07:49:22,970 INFO L290 TraceCheckUtils]: 18: Hoare triple {20965#true} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {20965#true} is VALID [2022-04-15 07:49:22,970 INFO L290 TraceCheckUtils]: 17: Hoare triple {20965#true} ~v~0 := 2 * ~Y~0 - ~X~0;~y~0 := 0;~x~0 := 0; {20965#true} is VALID [2022-04-15 07:49:22,970 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {20965#true} {20965#true} #63#return; {20965#true} is VALID [2022-04-15 07:49:22,970 INFO L290 TraceCheckUtils]: 15: Hoare triple {20965#true} assume true; {20965#true} is VALID [2022-04-15 07:49:22,970 INFO L290 TraceCheckUtils]: 14: Hoare triple {20965#true} assume !(0 == ~cond); {20965#true} is VALID [2022-04-15 07:49:22,970 INFO L290 TraceCheckUtils]: 13: Hoare triple {20965#true} ~cond := #in~cond; {20965#true} is VALID [2022-04-15 07:49:22,970 INFO L272 TraceCheckUtils]: 12: Hoare triple {20965#true} call assume_abort_if_not((if ~Y~0 >= 0 && ~Y~0 <= 10 then 1 else 0)); {20965#true} is VALID [2022-04-15 07:49:22,970 INFO L290 TraceCheckUtils]: 11: Hoare triple {20965#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~Y~0 := #t~nondet5;havoc #t~nondet5; {20965#true} is VALID [2022-04-15 07:49:22,970 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {20965#true} {20965#true} #61#return; {20965#true} is VALID [2022-04-15 07:49:22,970 INFO L290 TraceCheckUtils]: 9: Hoare triple {20965#true} assume true; {20965#true} is VALID [2022-04-15 07:49:22,971 INFO L290 TraceCheckUtils]: 8: Hoare triple {20965#true} assume !(0 == ~cond); {20965#true} is VALID [2022-04-15 07:49:22,971 INFO L290 TraceCheckUtils]: 7: Hoare triple {20965#true} ~cond := #in~cond; {20965#true} is VALID [2022-04-15 07:49:22,971 INFO L272 TraceCheckUtils]: 6: Hoare triple {20965#true} call assume_abort_if_not((if ~X~0 >= 0 && ~X~0 <= 10 then 1 else 0)); {20965#true} is VALID [2022-04-15 07:49:22,971 INFO L290 TraceCheckUtils]: 5: Hoare triple {20965#true} havoc ~X~0;havoc ~Y~0;havoc ~x~0;havoc ~y~0;havoc ~v~0;havoc ~xy~0;havoc ~yx~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~X~0 := #t~nondet4;havoc #t~nondet4; {20965#true} is VALID [2022-04-15 07:49:22,971 INFO L272 TraceCheckUtils]: 4: Hoare triple {20965#true} call #t~ret8 := main(); {20965#true} is VALID [2022-04-15 07:49:22,971 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20965#true} {20965#true} #69#return; {20965#true} is VALID [2022-04-15 07:49:22,971 INFO L290 TraceCheckUtils]: 2: Hoare triple {20965#true} assume true; {20965#true} is VALID [2022-04-15 07:49:22,971 INFO L290 TraceCheckUtils]: 1: Hoare triple {20965#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(15, 2);call #Ultimate.allocInit(12, 3); {20965#true} is VALID [2022-04-15 07:49:22,971 INFO L272 TraceCheckUtils]: 0: Hoare triple {20965#true} call ULTIMATE.init(); {20965#true} is VALID [2022-04-15 07:49:22,971 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 35 proven. 2 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2022-04-15 07:49:22,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:49:22,972 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1693379339] [2022-04-15 07:49:22,972 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 07:49:22,972 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1409987689] [2022-04-15 07:49:22,972 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1409987689] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 07:49:22,972 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 07:49:22,972 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 10] total 22 [2022-04-15 07:49:22,972 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:49:22,972 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [233128331] [2022-04-15 07:49:22,972 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [233128331] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:49:22,972 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:49:22,972 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-04-15 07:49:22,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1406551500] [2022-04-15 07:49:22,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:49:22,973 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 16 states have internal predecessors, (34), 6 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) Word has length 59 [2022-04-15 07:49:22,973 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:49:22,973 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 17 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 16 states have internal predecessors, (34), 6 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2022-04-15 07:49:27,039 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 48 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-15 07:49:27,039 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-04-15 07:49:27,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:49:27,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-04-15 07:49:27,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=405, Unknown=0, NotChecked=0, Total=462 [2022-04-15 07:49:27,040 INFO L87 Difference]: Start difference. First operand 144 states and 157 transitions. Second operand has 17 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 16 states have internal predecessors, (34), 6 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2022-04-15 07:49:31,656 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-15 07:49:33,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:49:33,395 INFO L93 Difference]: Finished difference Result 157 states and 172 transitions. [2022-04-15 07:49:33,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-04-15 07:49:33,395 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 16 states have internal predecessors, (34), 6 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) Word has length 59 [2022-04-15 07:49:33,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:49:33,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 16 states have internal predecessors, (34), 6 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2022-04-15 07:49:33,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 65 transitions. [2022-04-15 07:49:33,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 16 states have internal predecessors, (34), 6 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2022-04-15 07:49:33,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 65 transitions. [2022-04-15 07:49:33,397 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 65 transitions. [2022-04-15 07:49:37,491 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 63 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-15 07:49:37,493 INFO L225 Difference]: With dead ends: 157 [2022-04-15 07:49:37,493 INFO L226 Difference]: Without dead ends: 155 [2022-04-15 07:49:37,493 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 93 SyntacticMatches, 4 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=85, Invalid=565, Unknown=0, NotChecked=0, Total=650 [2022-04-15 07:49:37,493 INFO L913 BasicCegarLoop]: 27 mSDtfsCounter, 20 mSDsluCounter, 203 mSDsCounter, 0 mSdLazyCounter, 468 mSolverCounterSat, 4 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 230 SdHoareTripleChecker+Invalid, 473 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 468 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2022-04-15 07:49:37,493 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [23 Valid, 230 Invalid, 473 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 468 Invalid, 1 Unknown, 0 Unchecked, 3.3s Time] [2022-04-15 07:49:37,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2022-04-15 07:49:37,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 153. [2022-04-15 07:49:37,912 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:49:37,912 INFO L82 GeneralOperation]: Start isEquivalent. First operand 155 states. Second operand has 153 states, 114 states have (on average 1.087719298245614) internal successors, (124), 118 states have internal predecessors, (124), 22 states have call successors, (22), 17 states have call predecessors, (22), 16 states have return successors, (21), 17 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-15 07:49:37,912 INFO L74 IsIncluded]: Start isIncluded. First operand 155 states. Second operand has 153 states, 114 states have (on average 1.087719298245614) internal successors, (124), 118 states have internal predecessors, (124), 22 states have call successors, (22), 17 states have call predecessors, (22), 16 states have return successors, (21), 17 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-15 07:49:37,912 INFO L87 Difference]: Start difference. First operand 155 states. Second operand has 153 states, 114 states have (on average 1.087719298245614) internal successors, (124), 118 states have internal predecessors, (124), 22 states have call successors, (22), 17 states have call predecessors, (22), 16 states have return successors, (21), 17 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-15 07:49:37,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:49:37,914 INFO L93 Difference]: Finished difference Result 155 states and 170 transitions. [2022-04-15 07:49:37,914 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 170 transitions. [2022-04-15 07:49:37,915 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:49:37,915 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:49:37,915 INFO L74 IsIncluded]: Start isIncluded. First operand has 153 states, 114 states have (on average 1.087719298245614) internal successors, (124), 118 states have internal predecessors, (124), 22 states have call successors, (22), 17 states have call predecessors, (22), 16 states have return successors, (21), 17 states have call predecessors, (21), 21 states have call successors, (21) Second operand 155 states. [2022-04-15 07:49:37,915 INFO L87 Difference]: Start difference. First operand has 153 states, 114 states have (on average 1.087719298245614) internal successors, (124), 118 states have internal predecessors, (124), 22 states have call successors, (22), 17 states have call predecessors, (22), 16 states have return successors, (21), 17 states have call predecessors, (21), 21 states have call successors, (21) Second operand 155 states. [2022-04-15 07:49:37,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:49:37,917 INFO L93 Difference]: Finished difference Result 155 states and 170 transitions. [2022-04-15 07:49:37,917 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 170 transitions. [2022-04-15 07:49:37,917 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:49:37,917 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:49:37,917 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:49:37,917 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:49:37,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 114 states have (on average 1.087719298245614) internal successors, (124), 118 states have internal predecessors, (124), 22 states have call successors, (22), 17 states have call predecessors, (22), 16 states have return successors, (21), 17 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-15 07:49:37,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 167 transitions. [2022-04-15 07:49:37,924 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 167 transitions. Word has length 59 [2022-04-15 07:49:37,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:49:37,924 INFO L478 AbstractCegarLoop]: Abstraction has 153 states and 167 transitions. [2022-04-15 07:49:37,924 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 16 states have internal predecessors, (34), 6 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2022-04-15 07:49:37,924 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 153 states and 167 transitions. [2022-04-15 07:49:39,583 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 167 edges. 167 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:49:39,584 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 167 transitions. [2022-04-15 07:49:39,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-04-15 07:49:39,584 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:49:39,584 INFO L499 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 07:49:39,602 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2022-04-15 07:49:39,785 WARN L460 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-15 07:49:39,785 INFO L403 AbstractCegarLoop]: === Iteration 26 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:49:39,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:49:39,786 INFO L85 PathProgramCache]: Analyzing trace with hash -548759779, now seen corresponding path program 21 times [2022-04-15 07:49:39,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:49:39,786 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1049024890] [2022-04-15 07:49:39,786 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 07:49:39,786 INFO L85 PathProgramCache]: Analyzing trace with hash -548759779, now seen corresponding path program 22 times [2022-04-15 07:49:39,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:49:39,787 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1133724411] [2022-04-15 07:49:39,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:49:39,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:49:39,796 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 07:49:39,796 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [128256819] [2022-04-15 07:49:39,796 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 07:49:39,796 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 07:49:39,796 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 07:49:39,797 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-15 07:49:39,797 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-15 07:49:39,841 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 07:49:39,841 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 07:49:39,842 INFO L263 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 59 conjunts are in the unsatisfiable core [2022-04-15 07:49:39,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:49:39,862 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 07:49:40,225 WARN L914 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-15 07:49:48,017 WARN L914 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-15 07:49:51,871 WARN L914 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-15 07:49:58,033 INFO L272 TraceCheckUtils]: 0: Hoare triple {22278#true} call ULTIMATE.init(); {22278#true} is VALID [2022-04-15 07:49:58,034 INFO L290 TraceCheckUtils]: 1: Hoare triple {22278#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(15, 2);call #Ultimate.allocInit(12, 3); {22278#true} is VALID [2022-04-15 07:49:58,034 INFO L290 TraceCheckUtils]: 2: Hoare triple {22278#true} assume true; {22278#true} is VALID [2022-04-15 07:49:58,034 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22278#true} {22278#true} #69#return; {22278#true} is VALID [2022-04-15 07:49:58,034 INFO L272 TraceCheckUtils]: 4: Hoare triple {22278#true} call #t~ret8 := main(); {22278#true} is VALID [2022-04-15 07:49:58,034 INFO L290 TraceCheckUtils]: 5: Hoare triple {22278#true} havoc ~X~0;havoc ~Y~0;havoc ~x~0;havoc ~y~0;havoc ~v~0;havoc ~xy~0;havoc ~yx~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~X~0 := #t~nondet4;havoc #t~nondet4; {22278#true} is VALID [2022-04-15 07:49:58,034 INFO L272 TraceCheckUtils]: 6: Hoare triple {22278#true} call assume_abort_if_not((if ~X~0 >= 0 && ~X~0 <= 10 then 1 else 0)); {22278#true} is VALID [2022-04-15 07:49:58,034 INFO L290 TraceCheckUtils]: 7: Hoare triple {22278#true} ~cond := #in~cond; {22278#true} is VALID [2022-04-15 07:49:58,034 INFO L290 TraceCheckUtils]: 8: Hoare triple {22278#true} assume !(0 == ~cond); {22278#true} is VALID [2022-04-15 07:49:58,034 INFO L290 TraceCheckUtils]: 9: Hoare triple {22278#true} assume true; {22278#true} is VALID [2022-04-15 07:49:58,034 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {22278#true} {22278#true} #61#return; {22278#true} is VALID [2022-04-15 07:49:58,034 INFO L290 TraceCheckUtils]: 11: Hoare triple {22278#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~Y~0 := #t~nondet5;havoc #t~nondet5; {22278#true} is VALID [2022-04-15 07:49:58,034 INFO L272 TraceCheckUtils]: 12: Hoare triple {22278#true} call assume_abort_if_not((if ~Y~0 >= 0 && ~Y~0 <= 10 then 1 else 0)); {22278#true} is VALID [2022-04-15 07:49:58,034 INFO L290 TraceCheckUtils]: 13: Hoare triple {22278#true} ~cond := #in~cond; {22278#true} is VALID [2022-04-15 07:49:58,035 INFO L290 TraceCheckUtils]: 14: Hoare triple {22278#true} assume !(0 == ~cond); {22278#true} is VALID [2022-04-15 07:49:58,035 INFO L290 TraceCheckUtils]: 15: Hoare triple {22278#true} assume true; {22278#true} is VALID [2022-04-15 07:49:58,035 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {22278#true} {22278#true} #63#return; {22278#true} is VALID [2022-04-15 07:49:58,035 INFO L290 TraceCheckUtils]: 17: Hoare triple {22278#true} ~v~0 := 2 * ~Y~0 - ~X~0;~y~0 := 0;~x~0 := 0; {22334#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (= main_~y~0 0))} is VALID [2022-04-15 07:49:58,035 INFO L290 TraceCheckUtils]: 18: Hoare triple {22334#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (= main_~y~0 0))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {22334#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (= main_~y~0 0))} is VALID [2022-04-15 07:49:58,036 INFO L272 TraceCheckUtils]: 19: Hoare triple {22334#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {22278#true} is VALID [2022-04-15 07:49:58,036 INFO L290 TraceCheckUtils]: 20: Hoare triple {22278#true} ~cond := #in~cond; {22278#true} is VALID [2022-04-15 07:49:58,036 INFO L290 TraceCheckUtils]: 21: Hoare triple {22278#true} assume !(0 == ~cond); {22278#true} is VALID [2022-04-15 07:49:58,036 INFO L290 TraceCheckUtils]: 22: Hoare triple {22278#true} assume true; {22278#true} is VALID [2022-04-15 07:49:58,036 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {22278#true} {22334#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (= main_~y~0 0))} #65#return; {22334#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (= main_~y~0 0))} is VALID [2022-04-15 07:49:58,037 INFO L290 TraceCheckUtils]: 24: Hoare triple {22334#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (= main_~y~0 0))} assume !!(~x~0 <= ~X~0); {22334#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (= main_~y~0 0))} is VALID [2022-04-15 07:49:58,038 INFO L290 TraceCheckUtils]: 25: Hoare triple {22334#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (= main_~y~0 0))} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {22359#(and (= main_~x~0 0) (< main_~v~0 (* main_~Y~0 2)) (= main_~y~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) (+ main_~v~0 (* (- 2) main_~Y~0))))} is VALID [2022-04-15 07:49:58,038 INFO L290 TraceCheckUtils]: 26: Hoare triple {22359#(and (= main_~x~0 0) (< main_~v~0 (* main_~Y~0 2)) (= main_~y~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) (+ main_~v~0 (* (- 2) main_~Y~0))))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {22363#(and (<= 1 main_~x~0) (< main_~v~0 (* main_~Y~0 2)) (= main_~y~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) (+ main_~v~0 (* (- 2) main_~Y~0))))} is VALID [2022-04-15 07:49:58,039 INFO L290 TraceCheckUtils]: 27: Hoare triple {22363#(and (<= 1 main_~x~0) (< main_~v~0 (* main_~Y~0 2)) (= main_~y~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) (+ main_~v~0 (* (- 2) main_~Y~0))))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {22367#(and (<= 1 main_~x~0) (< main_~v~0 (* main_~Y~0 2)) (= (* main_~X~0 main_~y~0) main_~xy~0) (= main_~y~0 0) (= main_~yx~0 (* main_~Y~0 main_~x~0)) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) (+ main_~v~0 (* (- 2) main_~Y~0))))} is VALID [2022-04-15 07:49:58,039 INFO L272 TraceCheckUtils]: 28: Hoare triple {22367#(and (<= 1 main_~x~0) (< main_~v~0 (* main_~Y~0 2)) (= (* main_~X~0 main_~y~0) main_~xy~0) (= main_~y~0 0) (= main_~yx~0 (* main_~Y~0 main_~x~0)) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) (+ main_~v~0 (* (- 2) main_~Y~0))))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {22278#true} is VALID [2022-04-15 07:49:58,039 INFO L290 TraceCheckUtils]: 29: Hoare triple {22278#true} ~cond := #in~cond; {22374#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-15 07:49:58,039 INFO L290 TraceCheckUtils]: 30: Hoare triple {22374#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {22378#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:49:58,040 INFO L290 TraceCheckUtils]: 31: Hoare triple {22378#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {22378#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:49:58,041 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {22378#(not (= |__VERIFIER_assert_#in~cond| 0))} {22367#(and (<= 1 main_~x~0) (< main_~v~0 (* main_~Y~0 2)) (= (* main_~X~0 main_~y~0) main_~xy~0) (= main_~y~0 0) (= main_~yx~0 (* main_~Y~0 main_~x~0)) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) (+ main_~v~0 (* (- 2) main_~Y~0))))} #65#return; {22385#(and (<= 1 main_~x~0) (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (< main_~v~0 (* main_~Y~0 2)) (= main_~y~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) (+ main_~v~0 (* (- 2) main_~Y~0))))} is VALID [2022-04-15 07:49:58,042 INFO L290 TraceCheckUtils]: 33: Hoare triple {22385#(and (<= 1 main_~x~0) (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (< main_~v~0 (* main_~Y~0 2)) (= main_~y~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) (+ main_~v~0 (* (- 2) main_~Y~0))))} assume !!(~x~0 <= ~X~0); {22385#(and (<= 1 main_~x~0) (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (< main_~v~0 (* main_~Y~0 2)) (= main_~y~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) (+ main_~v~0 (* (- 2) main_~Y~0))))} is VALID [2022-04-15 07:49:58,043 INFO L290 TraceCheckUtils]: 34: Hoare triple {22385#(and (<= 1 main_~x~0) (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (< main_~v~0 (* main_~Y~0 2)) (= main_~y~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) (+ main_~v~0 (* (- 2) main_~Y~0))))} assume !(~v~0 < 0);~v~0 := ~v~0 + 2 * (~Y~0 - ~X~0);#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {22392#(and (= (+ main_~v~0 (* main_~X~0 3)) (* main_~Y~0 6)) (< (* main_~Y~0 2) main_~X~0) (= main_~y~0 1) (<= main_~X~0 (* main_~Y~0 4)) (= (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))))} is VALID [2022-04-15 07:49:58,045 INFO L290 TraceCheckUtils]: 35: Hoare triple {22392#(and (= (+ main_~v~0 (* main_~X~0 3)) (* main_~Y~0 6)) (< (* main_~Y~0 2) main_~X~0) (= main_~y~0 1) (<= main_~X~0 (* main_~Y~0 4)) (= (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {22396#(and (= (+ main_~v~0 (* main_~X~0 3)) (* main_~Y~0 6)) (< (* main_~Y~0 2) main_~X~0) (= main_~y~0 1) (<= main_~X~0 (* main_~Y~0 4)) (<= (+ (div main_~Y~0 main_~Y~0) 1) main_~x~0))} is VALID [2022-04-15 07:49:58,046 INFO L290 TraceCheckUtils]: 36: Hoare triple {22396#(and (= (+ main_~v~0 (* main_~X~0 3)) (* main_~Y~0 6)) (< (* main_~Y~0 2) main_~X~0) (= main_~y~0 1) (<= main_~X~0 (* main_~Y~0 4)) (<= (+ (div main_~Y~0 main_~Y~0) 1) main_~x~0))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {22400#(and (= (+ main_~v~0 (* main_~X~0 3)) (* main_~Y~0 6)) (< (* main_~Y~0 2) main_~X~0) (= main_~y~0 1) (<= main_~X~0 (* main_~Y~0 4)) (= (* main_~X~0 main_~y~0) main_~xy~0) (= main_~yx~0 (* main_~Y~0 main_~x~0)) (<= (+ (div main_~Y~0 main_~Y~0) 1) main_~x~0))} is VALID [2022-04-15 07:49:58,046 INFO L272 TraceCheckUtils]: 37: Hoare triple {22400#(and (= (+ main_~v~0 (* main_~X~0 3)) (* main_~Y~0 6)) (< (* main_~Y~0 2) main_~X~0) (= main_~y~0 1) (<= main_~X~0 (* main_~Y~0 4)) (= (* main_~X~0 main_~y~0) main_~xy~0) (= main_~yx~0 (* main_~Y~0 main_~x~0)) (<= (+ (div main_~Y~0 main_~Y~0) 1) main_~x~0))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {22278#true} is VALID [2022-04-15 07:49:58,046 INFO L290 TraceCheckUtils]: 38: Hoare triple {22278#true} ~cond := #in~cond; {22374#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-15 07:49:58,046 INFO L290 TraceCheckUtils]: 39: Hoare triple {22374#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {22378#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:49:58,047 INFO L290 TraceCheckUtils]: 40: Hoare triple {22378#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {22378#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:49:58,048 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {22378#(not (= |__VERIFIER_assert_#in~cond| 0))} {22400#(and (= (+ main_~v~0 (* main_~X~0 3)) (* main_~Y~0 6)) (< (* main_~Y~0 2) main_~X~0) (= main_~y~0 1) (<= main_~X~0 (* main_~Y~0 4)) (= (* main_~X~0 main_~y~0) main_~xy~0) (= main_~yx~0 (* main_~Y~0 main_~x~0)) (<= (+ (div main_~Y~0 main_~Y~0) 1) main_~x~0))} #65#return; {22416#(and (= (+ main_~v~0 (* main_~X~0 3)) (* main_~Y~0 6)) (< (* main_~Y~0 2) main_~X~0) (= main_~y~0 1) (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (<= main_~X~0 (* main_~Y~0 4)))} is VALID [2022-04-15 07:49:58,049 INFO L290 TraceCheckUtils]: 42: Hoare triple {22416#(and (= (+ main_~v~0 (* main_~X~0 3)) (* main_~Y~0 6)) (< (* main_~Y~0 2) main_~X~0) (= main_~y~0 1) (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (<= main_~X~0 (* main_~Y~0 4)))} assume !!(~x~0 <= ~X~0); {22416#(and (= (+ main_~v~0 (* main_~X~0 3)) (* main_~Y~0 6)) (< (* main_~Y~0 2) main_~X~0) (= main_~y~0 1) (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (<= main_~X~0 (* main_~Y~0 4)))} is VALID [2022-04-15 07:49:58,050 INFO L290 TraceCheckUtils]: 43: Hoare triple {22416#(and (= (+ main_~v~0 (* main_~X~0 3)) (* main_~Y~0 6)) (< (* main_~Y~0 2) main_~X~0) (= main_~y~0 1) (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (<= main_~X~0 (* main_~Y~0 4)))} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {22423#(and (< (* main_~Y~0 2) main_~X~0) (= main_~y~0 1) (<= main_~X~0 (* main_~Y~0 4)) (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) (* (- 2) main_~X~0) (* main_~Y~0 6))) (= main_~v~0 (+ (* main_~Y~0 8) (* main_~X~0 (- 3)))))} is VALID [2022-04-15 07:49:58,052 INFO L290 TraceCheckUtils]: 44: Hoare triple {22423#(and (< (* main_~Y~0 2) main_~X~0) (= main_~y~0 1) (<= main_~X~0 (* main_~Y~0 4)) (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) (* (- 2) main_~X~0) (* main_~Y~0 6))) (= main_~v~0 (+ (* main_~Y~0 8) (* main_~X~0 (- 3)))))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {22427#(and (< (* main_~Y~0 2) main_~X~0) (= main_~y~0 1) (<= (+ (div (+ (* main_~X~0 main_~y~0) (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~Y~0) 1) main_~x~0) (<= main_~X~0 (* main_~Y~0 4)) (= main_~v~0 (+ (* main_~Y~0 8) (* main_~X~0 (- 3)))))} is VALID [2022-04-15 07:49:58,053 INFO L290 TraceCheckUtils]: 45: Hoare triple {22427#(and (< (* main_~Y~0 2) main_~X~0) (= main_~y~0 1) (<= (+ (div (+ (* main_~X~0 main_~y~0) (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~Y~0) 1) main_~x~0) (<= main_~X~0 (* main_~Y~0 4)) (= main_~v~0 (+ (* main_~Y~0 8) (* main_~X~0 (- 3)))))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {22431#(and (< (* main_~Y~0 2) main_~X~0) (= main_~y~0 1) (<= (+ (div (+ (* main_~X~0 main_~y~0) (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~Y~0) 1) main_~x~0) (<= main_~X~0 (* main_~Y~0 4)) (= main_~v~0 (+ (* main_~Y~0 8) (* main_~X~0 (- 3)))) (= (* main_~X~0 main_~y~0) main_~xy~0) (= main_~yx~0 (* main_~Y~0 main_~x~0)))} is VALID [2022-04-15 07:49:58,053 INFO L272 TraceCheckUtils]: 46: Hoare triple {22431#(and (< (* main_~Y~0 2) main_~X~0) (= main_~y~0 1) (<= (+ (div (+ (* main_~X~0 main_~y~0) (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~Y~0) 1) main_~x~0) (<= main_~X~0 (* main_~Y~0 4)) (= main_~v~0 (+ (* main_~Y~0 8) (* main_~X~0 (- 3)))) (= (* main_~X~0 main_~y~0) main_~xy~0) (= main_~yx~0 (* main_~Y~0 main_~x~0)))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {22278#true} is VALID [2022-04-15 07:49:58,053 INFO L290 TraceCheckUtils]: 47: Hoare triple {22278#true} ~cond := #in~cond; {22374#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-15 07:49:58,054 INFO L290 TraceCheckUtils]: 48: Hoare triple {22374#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {22378#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:49:58,054 INFO L290 TraceCheckUtils]: 49: Hoare triple {22378#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {22378#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:49:58,056 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {22378#(not (= |__VERIFIER_assert_#in~cond| 0))} {22431#(and (< (* main_~Y~0 2) main_~X~0) (= main_~y~0 1) (<= (+ (div (+ (* main_~X~0 main_~y~0) (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~Y~0) 1) main_~x~0) (<= main_~X~0 (* main_~Y~0 4)) (= main_~v~0 (+ (* main_~Y~0 8) (* main_~X~0 (- 3)))) (= (* main_~X~0 main_~y~0) main_~xy~0) (= main_~yx~0 (* main_~Y~0 main_~x~0)))} #65#return; {22447#(and (< (* main_~Y~0 2) main_~X~0) (= main_~y~0 1) (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (<= main_~X~0 (* main_~Y~0 4)) (= (* main_~Y~0 8) (+ main_~v~0 (* main_~X~0 3))))} is VALID [2022-04-15 07:49:58,057 INFO L290 TraceCheckUtils]: 51: Hoare triple {22447#(and (< (* main_~Y~0 2) main_~X~0) (= main_~y~0 1) (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (<= main_~X~0 (* main_~Y~0 4)) (= (* main_~Y~0 8) (+ main_~v~0 (* main_~X~0 3))))} assume !!(~x~0 <= ~X~0); {22447#(and (< (* main_~Y~0 2) main_~X~0) (= main_~y~0 1) (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (<= main_~X~0 (* main_~Y~0 4)) (= (* main_~Y~0 8) (+ main_~v~0 (* main_~X~0 3))))} is VALID [2022-04-15 07:49:58,058 INFO L290 TraceCheckUtils]: 52: Hoare triple {22447#(and (< (* main_~Y~0 2) main_~X~0) (= main_~y~0 1) (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (<= main_~X~0 (* main_~Y~0 4)) (= (* main_~Y~0 8) (+ main_~v~0 (* main_~X~0 3))))} assume !(~v~0 < 0);~v~0 := ~v~0 + 2 * (~Y~0 - ~X~0);#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {22454#(and (= (+ (* main_~Y~0 10) (* main_~X~0 (- 5))) main_~v~0) (= main_~y~0 2) (= (* main_~Y~0 8) (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0)))) (< (* main_~Y~0 2) main_~X~0) (<= main_~X~0 (* main_~Y~0 4)))} is VALID [2022-04-15 07:49:58,059 INFO L290 TraceCheckUtils]: 53: Hoare triple {22454#(and (= (+ (* main_~Y~0 10) (* main_~X~0 (- 5))) main_~v~0) (= main_~y~0 2) (= (* main_~Y~0 8) (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0)))) (< (* main_~Y~0 2) main_~X~0) (<= main_~X~0 (* main_~Y~0 4)))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {22458#(and (= (+ (* main_~Y~0 10) (* main_~X~0 (- 5))) main_~v~0) (= main_~y~0 2) (< (* main_~Y~0 2) main_~X~0) (<= main_~X~0 (* main_~Y~0 4)) (= (* main_~Y~0 8) (+ (* main_~Y~0 2) (* 2 (* (+ (- 1) main_~x~0) main_~Y~0)))))} is VALID [2022-04-15 07:49:58,061 INFO L290 TraceCheckUtils]: 54: Hoare triple {22458#(and (= (+ (* main_~Y~0 10) (* main_~X~0 (- 5))) main_~v~0) (= main_~y~0 2) (< (* main_~Y~0 2) main_~X~0) (<= main_~X~0 (* main_~Y~0 4)) (= (* main_~Y~0 8) (+ (* main_~Y~0 2) (* 2 (* (+ (- 1) main_~x~0) main_~Y~0)))))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {22462#(and (= (+ (* main_~Y~0 10) (* main_~X~0 (- 5))) main_~v~0) (= main_~xy~0 (* main_~X~0 2)) (< (* main_~Y~0 2) main_~X~0) (<= main_~X~0 (* main_~Y~0 4)) (= (* (div (* main_~Y~0 4) main_~Y~0) main_~Y~0) main_~yx~0))} is VALID [2022-04-15 07:49:58,063 INFO L272 TraceCheckUtils]: 55: Hoare triple {22462#(and (= (+ (* main_~Y~0 10) (* main_~X~0 (- 5))) main_~v~0) (= main_~xy~0 (* main_~X~0 2)) (< (* main_~Y~0 2) main_~X~0) (<= main_~X~0 (* main_~Y~0 4)) (= (* (div (* main_~Y~0 4) main_~Y~0) main_~Y~0) main_~yx~0))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {22466#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 07:49:58,063 INFO L290 TraceCheckUtils]: 56: Hoare triple {22466#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {22470#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 07:49:58,063 INFO L290 TraceCheckUtils]: 57: Hoare triple {22470#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {22279#false} is VALID [2022-04-15 07:49:58,063 INFO L290 TraceCheckUtils]: 58: Hoare triple {22279#false} assume !false; {22279#false} is VALID [2022-04-15 07:49:58,064 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 14 proven. 41 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-04-15 07:49:58,064 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 07:50:01,759 INFO L290 TraceCheckUtils]: 58: Hoare triple {22279#false} assume !false; {22279#false} is VALID [2022-04-15 07:50:01,759 INFO L290 TraceCheckUtils]: 57: Hoare triple {22470#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {22279#false} is VALID [2022-04-15 07:50:01,760 INFO L290 TraceCheckUtils]: 56: Hoare triple {22466#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {22470#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 07:50:01,760 INFO L272 TraceCheckUtils]: 55: Hoare triple {22486#(= (+ (* 2 main_~xy~0) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 main_~yx~0)))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {22466#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 07:50:01,761 INFO L290 TraceCheckUtils]: 54: Hoare triple {22490#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {22486#(= (+ (* 2 main_~xy~0) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 main_~yx~0)))} is VALID [2022-04-15 07:50:01,767 INFO L290 TraceCheckUtils]: 53: Hoare triple {22494#(= (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0))))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {22490#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} is VALID [2022-04-15 07:50:01,769 INFO L290 TraceCheckUtils]: 52: Hoare triple {22490#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} assume !(~v~0 < 0);~v~0 := ~v~0 + 2 * (~Y~0 - ~X~0);#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {22494#(= (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0))))} is VALID [2022-04-15 07:50:01,770 INFO L290 TraceCheckUtils]: 51: Hoare triple {22490#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} assume !!(~x~0 <= ~X~0); {22490#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} is VALID [2022-04-15 07:50:01,770 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {22378#(not (= |__VERIFIER_assert_#in~cond| 0))} {22504#(or (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (not (= (+ (* 2 main_~xy~0) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 main_~yx~0)))))} #65#return; {22490#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} is VALID [2022-04-15 07:50:01,771 INFO L290 TraceCheckUtils]: 49: Hoare triple {22378#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {22378#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:50:01,771 INFO L290 TraceCheckUtils]: 48: Hoare triple {22514#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {22378#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:50:01,771 INFO L290 TraceCheckUtils]: 47: Hoare triple {22278#true} ~cond := #in~cond; {22514#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 07:50:01,771 INFO L272 TraceCheckUtils]: 46: Hoare triple {22504#(or (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (not (= (+ (* 2 main_~xy~0) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 main_~yx~0)))))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {22278#true} is VALID [2022-04-15 07:50:01,772 INFO L290 TraceCheckUtils]: 45: Hoare triple {22278#true} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {22504#(or (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (not (= (+ (* 2 main_~xy~0) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 main_~yx~0)))))} is VALID [2022-04-15 07:50:01,772 INFO L290 TraceCheckUtils]: 44: Hoare triple {22278#true} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {22278#true} is VALID [2022-04-15 07:50:01,773 INFO L290 TraceCheckUtils]: 43: Hoare triple {22278#true} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {22278#true} is VALID [2022-04-15 07:50:01,773 INFO L290 TraceCheckUtils]: 42: Hoare triple {22278#true} assume !!(~x~0 <= ~X~0); {22278#true} is VALID [2022-04-15 07:50:01,773 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {22278#true} {22278#true} #65#return; {22278#true} is VALID [2022-04-15 07:50:01,773 INFO L290 TraceCheckUtils]: 40: Hoare triple {22278#true} assume true; {22278#true} is VALID [2022-04-15 07:50:01,773 INFO L290 TraceCheckUtils]: 39: Hoare triple {22278#true} assume !(0 == ~cond); {22278#true} is VALID [2022-04-15 07:50:01,773 INFO L290 TraceCheckUtils]: 38: Hoare triple {22278#true} ~cond := #in~cond; {22278#true} is VALID [2022-04-15 07:50:01,773 INFO L272 TraceCheckUtils]: 37: Hoare triple {22278#true} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {22278#true} is VALID [2022-04-15 07:50:01,773 INFO L290 TraceCheckUtils]: 36: Hoare triple {22278#true} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {22278#true} is VALID [2022-04-15 07:50:01,773 INFO L290 TraceCheckUtils]: 35: Hoare triple {22278#true} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {22278#true} is VALID [2022-04-15 07:50:01,773 INFO L290 TraceCheckUtils]: 34: Hoare triple {22278#true} assume !(~v~0 < 0);~v~0 := ~v~0 + 2 * (~Y~0 - ~X~0);#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {22278#true} is VALID [2022-04-15 07:50:01,773 INFO L290 TraceCheckUtils]: 33: Hoare triple {22278#true} assume !!(~x~0 <= ~X~0); {22278#true} is VALID [2022-04-15 07:50:01,773 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {22278#true} {22278#true} #65#return; {22278#true} is VALID [2022-04-15 07:50:01,773 INFO L290 TraceCheckUtils]: 31: Hoare triple {22278#true} assume true; {22278#true} is VALID [2022-04-15 07:50:01,773 INFO L290 TraceCheckUtils]: 30: Hoare triple {22278#true} assume !(0 == ~cond); {22278#true} is VALID [2022-04-15 07:50:01,774 INFO L290 TraceCheckUtils]: 29: Hoare triple {22278#true} ~cond := #in~cond; {22278#true} is VALID [2022-04-15 07:50:01,774 INFO L272 TraceCheckUtils]: 28: Hoare triple {22278#true} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {22278#true} is VALID [2022-04-15 07:50:01,774 INFO L290 TraceCheckUtils]: 27: Hoare triple {22278#true} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {22278#true} is VALID [2022-04-15 07:50:01,774 INFO L290 TraceCheckUtils]: 26: Hoare triple {22278#true} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {22278#true} is VALID [2022-04-15 07:50:01,774 INFO L290 TraceCheckUtils]: 25: Hoare triple {22278#true} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {22278#true} is VALID [2022-04-15 07:50:01,774 INFO L290 TraceCheckUtils]: 24: Hoare triple {22278#true} assume !!(~x~0 <= ~X~0); {22278#true} is VALID [2022-04-15 07:50:01,774 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {22278#true} {22278#true} #65#return; {22278#true} is VALID [2022-04-15 07:50:01,774 INFO L290 TraceCheckUtils]: 22: Hoare triple {22278#true} assume true; {22278#true} is VALID [2022-04-15 07:50:01,774 INFO L290 TraceCheckUtils]: 21: Hoare triple {22278#true} assume !(0 == ~cond); {22278#true} is VALID [2022-04-15 07:50:01,774 INFO L290 TraceCheckUtils]: 20: Hoare triple {22278#true} ~cond := #in~cond; {22278#true} is VALID [2022-04-15 07:50:01,774 INFO L272 TraceCheckUtils]: 19: Hoare triple {22278#true} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {22278#true} is VALID [2022-04-15 07:50:01,774 INFO L290 TraceCheckUtils]: 18: Hoare triple {22278#true} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {22278#true} is VALID [2022-04-15 07:50:01,774 INFO L290 TraceCheckUtils]: 17: Hoare triple {22278#true} ~v~0 := 2 * ~Y~0 - ~X~0;~y~0 := 0;~x~0 := 0; {22278#true} is VALID [2022-04-15 07:50:01,774 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {22278#true} {22278#true} #63#return; {22278#true} is VALID [2022-04-15 07:50:01,775 INFO L290 TraceCheckUtils]: 15: Hoare triple {22278#true} assume true; {22278#true} is VALID [2022-04-15 07:50:01,775 INFO L290 TraceCheckUtils]: 14: Hoare triple {22278#true} assume !(0 == ~cond); {22278#true} is VALID [2022-04-15 07:50:01,775 INFO L290 TraceCheckUtils]: 13: Hoare triple {22278#true} ~cond := #in~cond; {22278#true} is VALID [2022-04-15 07:50:01,775 INFO L272 TraceCheckUtils]: 12: Hoare triple {22278#true} call assume_abort_if_not((if ~Y~0 >= 0 && ~Y~0 <= 10 then 1 else 0)); {22278#true} is VALID [2022-04-15 07:50:01,775 INFO L290 TraceCheckUtils]: 11: Hoare triple {22278#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~Y~0 := #t~nondet5;havoc #t~nondet5; {22278#true} is VALID [2022-04-15 07:50:01,775 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {22278#true} {22278#true} #61#return; {22278#true} is VALID [2022-04-15 07:50:01,775 INFO L290 TraceCheckUtils]: 9: Hoare triple {22278#true} assume true; {22278#true} is VALID [2022-04-15 07:50:01,775 INFO L290 TraceCheckUtils]: 8: Hoare triple {22278#true} assume !(0 == ~cond); {22278#true} is VALID [2022-04-15 07:50:01,775 INFO L290 TraceCheckUtils]: 7: Hoare triple {22278#true} ~cond := #in~cond; {22278#true} is VALID [2022-04-15 07:50:01,775 INFO L272 TraceCheckUtils]: 6: Hoare triple {22278#true} call assume_abort_if_not((if ~X~0 >= 0 && ~X~0 <= 10 then 1 else 0)); {22278#true} is VALID [2022-04-15 07:50:01,775 INFO L290 TraceCheckUtils]: 5: Hoare triple {22278#true} havoc ~X~0;havoc ~Y~0;havoc ~x~0;havoc ~y~0;havoc ~v~0;havoc ~xy~0;havoc ~yx~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~X~0 := #t~nondet4;havoc #t~nondet4; {22278#true} is VALID [2022-04-15 07:50:01,775 INFO L272 TraceCheckUtils]: 4: Hoare triple {22278#true} call #t~ret8 := main(); {22278#true} is VALID [2022-04-15 07:50:01,775 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22278#true} {22278#true} #69#return; {22278#true} is VALID [2022-04-15 07:50:01,775 INFO L290 TraceCheckUtils]: 2: Hoare triple {22278#true} assume true; {22278#true} is VALID [2022-04-15 07:50:01,776 INFO L290 TraceCheckUtils]: 1: Hoare triple {22278#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(15, 2);call #Ultimate.allocInit(12, 3); {22278#true} is VALID [2022-04-15 07:50:01,776 INFO L272 TraceCheckUtils]: 0: Hoare triple {22278#true} call ULTIMATE.init(); {22278#true} is VALID [2022-04-15 07:50:01,776 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 35 proven. 2 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2022-04-15 07:50:01,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:50:01,776 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1133724411] [2022-04-15 07:50:01,776 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 07:50:01,776 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [128256819] [2022-04-15 07:50:01,776 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [128256819] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 07:50:01,776 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 07:50:01,776 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 10] total 27 [2022-04-15 07:50:01,777 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:50:01,777 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1049024890] [2022-04-15 07:50:01,777 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1049024890] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:50:01,777 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:50:01,777 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2022-04-15 07:50:01,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1723133373] [2022-04-15 07:50:01,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:50:01,777 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 21 states have internal predecessors, (34), 6 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) Word has length 59 [2022-04-15 07:50:01,777 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:50:01,777 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 22 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 21 states have internal predecessors, (34), 6 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2022-04-15 07:50:01,840 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:50:01,840 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-04-15 07:50:01,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:50:01,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-04-15 07:50:01,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=622, Unknown=0, NotChecked=0, Total=702 [2022-04-15 07:50:01,841 INFO L87 Difference]: Start difference. First operand 153 states and 167 transitions. Second operand has 22 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 21 states have internal predecessors, (34), 6 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2022-04-15 07:50:05,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:50:05,326 INFO L93 Difference]: Finished difference Result 168 states and 181 transitions. [2022-04-15 07:50:05,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-04-15 07:50:05,326 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 21 states have internal predecessors, (34), 6 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) Word has length 59 [2022-04-15 07:50:05,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:50:05,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 21 states have internal predecessors, (34), 6 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2022-04-15 07:50:05,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 64 transitions. [2022-04-15 07:50:05,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 21 states have internal predecessors, (34), 6 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2022-04-15 07:50:05,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 64 transitions. [2022-04-15 07:50:05,328 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 64 transitions. [2022-04-15 07:50:05,416 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-15 07:50:05,418 INFO L225 Difference]: With dead ends: 168 [2022-04-15 07:50:05,418 INFO L226 Difference]: Without dead ends: 166 [2022-04-15 07:50:05,419 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 90 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 166 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=124, Invalid=932, Unknown=0, NotChecked=0, Total=1056 [2022-04-15 07:50:05,419 INFO L913 BasicCegarLoop]: 24 mSDtfsCounter, 21 mSDsluCounter, 245 mSDsCounter, 0 mSdLazyCounter, 682 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 269 SdHoareTripleChecker+Invalid, 698 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 682 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-04-15 07:50:05,419 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [21 Valid, 269 Invalid, 698 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 682 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-04-15 07:50:05,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2022-04-15 07:50:05,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 157. [2022-04-15 07:50:05,858 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:50:05,858 INFO L82 GeneralOperation]: Start isEquivalent. First operand 166 states. Second operand has 157 states, 117 states have (on average 1.0854700854700854) internal successors, (127), 121 states have internal predecessors, (127), 22 states have call successors, (22), 18 states have call predecessors, (22), 17 states have return successors, (21), 17 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-15 07:50:05,859 INFO L74 IsIncluded]: Start isIncluded. First operand 166 states. Second operand has 157 states, 117 states have (on average 1.0854700854700854) internal successors, (127), 121 states have internal predecessors, (127), 22 states have call successors, (22), 18 states have call predecessors, (22), 17 states have return successors, (21), 17 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-15 07:50:05,859 INFO L87 Difference]: Start difference. First operand 166 states. Second operand has 157 states, 117 states have (on average 1.0854700854700854) internal successors, (127), 121 states have internal predecessors, (127), 22 states have call successors, (22), 18 states have call predecessors, (22), 17 states have return successors, (21), 17 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-15 07:50:05,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:50:05,861 INFO L93 Difference]: Finished difference Result 166 states and 179 transitions. [2022-04-15 07:50:05,861 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 179 transitions. [2022-04-15 07:50:05,861 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:50:05,861 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:50:05,861 INFO L74 IsIncluded]: Start isIncluded. First operand has 157 states, 117 states have (on average 1.0854700854700854) internal successors, (127), 121 states have internal predecessors, (127), 22 states have call successors, (22), 18 states have call predecessors, (22), 17 states have return successors, (21), 17 states have call predecessors, (21), 21 states have call successors, (21) Second operand 166 states. [2022-04-15 07:50:05,861 INFO L87 Difference]: Start difference. First operand has 157 states, 117 states have (on average 1.0854700854700854) internal successors, (127), 121 states have internal predecessors, (127), 22 states have call successors, (22), 18 states have call predecessors, (22), 17 states have return successors, (21), 17 states have call predecessors, (21), 21 states have call successors, (21) Second operand 166 states. [2022-04-15 07:50:05,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:50:05,863 INFO L93 Difference]: Finished difference Result 166 states and 179 transitions. [2022-04-15 07:50:05,863 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 179 transitions. [2022-04-15 07:50:05,863 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:50:05,864 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:50:05,864 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:50:05,864 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:50:05,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 117 states have (on average 1.0854700854700854) internal successors, (127), 121 states have internal predecessors, (127), 22 states have call successors, (22), 18 states have call predecessors, (22), 17 states have return successors, (21), 17 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-15 07:50:05,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 170 transitions. [2022-04-15 07:50:05,866 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 170 transitions. Word has length 59 [2022-04-15 07:50:05,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:50:05,866 INFO L478 AbstractCegarLoop]: Abstraction has 157 states and 170 transitions. [2022-04-15 07:50:05,866 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 21 states have internal predecessors, (34), 6 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2022-04-15 07:50:05,866 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 157 states and 170 transitions. [2022-04-15 07:50:08,458 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 170 edges. 169 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-15 07:50:08,458 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 170 transitions. [2022-04-15 07:50:08,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-04-15 07:50:08,459 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:50:08,459 INFO L499 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 07:50:08,475 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Forceful destruction successful, exit code 0 [2022-04-15 07:50:08,663 WARN L460 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-15 07:50:08,665 INFO L403 AbstractCegarLoop]: === Iteration 27 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:50:08,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:50:08,666 INFO L85 PathProgramCache]: Analyzing trace with hash -1434400107, now seen corresponding path program 23 times [2022-04-15 07:50:08,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:50:08,666 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [681670650] [2022-04-15 07:50:08,666 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 07:50:08,666 INFO L85 PathProgramCache]: Analyzing trace with hash -1434400107, now seen corresponding path program 24 times [2022-04-15 07:50:08,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:50:08,667 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [945333445] [2022-04-15 07:50:08,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:50:08,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:50:08,675 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 07:50:08,675 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2111869386] [2022-04-15 07:50:08,675 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 07:50:08,675 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 07:50:08,676 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 07:50:08,676 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-15 07:50:08,677 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-15 07:50:08,731 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-04-15 07:50:08,731 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 07:50:08,732 INFO L263 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 61 conjunts are in the unsatisfiable core [2022-04-15 07:50:08,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:50:08,746 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 07:50:31,118 WARN L914 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-15 07:50:33,142 WARN L914 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful