/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf -i ../../../trunk/examples/svcomp/nla-digbench-scaling/bresenham-ll_valuebound5.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-28 11:09:40,487 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-28 11:09:40,488 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-28 11:09:40,520 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-28 11:09:40,521 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-28 11:09:40,521 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-28 11:09:40,522 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-28 11:09:40,523 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-28 11:09:40,524 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-28 11:09:40,525 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-28 11:09:40,526 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-28 11:09:40,527 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-28 11:09:40,527 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-28 11:09:40,528 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-28 11:09:40,529 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-28 11:09:40,530 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-28 11:09:40,530 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-28 11:09:40,531 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-28 11:09:40,533 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-28 11:09:40,534 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-28 11:09:40,536 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-28 11:09:40,542 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-28 11:09:40,544 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-28 11:09:40,547 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-28 11:09:40,551 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-28 11:09:40,554 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-28 11:09:40,554 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-28 11:09:40,554 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-28 11:09:40,555 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-28 11:09:40,555 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-28 11:09:40,556 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-28 11:09:40,556 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-28 11:09:40,556 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-28 11:09:40,557 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-28 11:09:40,557 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-28 11:09:40,558 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-28 11:09:40,558 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-28 11:09:40,559 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-28 11:09:40,559 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-28 11:09:40,559 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-28 11:09:40,560 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-28 11:09:40,562 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-28 11:09:40,563 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-04-28 11:09:40,570 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-28 11:09:40,571 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-28 11:09:40,572 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-28 11:09:40,572 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-28 11:09:40,572 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-28 11:09:40,572 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-28 11:09:40,572 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-28 11:09:40,573 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-28 11:09:40,573 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-28 11:09:40,573 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-28 11:09:40,573 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-28 11:09:40,573 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-28 11:09:40,573 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-28 11:09:40,574 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-28 11:09:40,574 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-28 11:09:40,574 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 11:09:40,574 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-28 11:09:40,574 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-28 11:09:40,574 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-28 11:09:40,574 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-28 11:09:40,575 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-28 11:09:40,575 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-28 11:09:40,575 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-28 11:09:40,752 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-28 11:09:40,779 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-28 11:09:40,781 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-28 11:09:40,782 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-28 11:09:40,783 INFO L275 PluginConnector]: CDTParser initialized [2022-04-28 11:09:40,784 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/bresenham-ll_valuebound5.c [2022-04-28 11:09:40,831 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/61468b2a3/37082fd2a560427dbc11a679758469e6/FLAG0b19bcc80 [2022-04-28 11:09:41,186 INFO L306 CDTParser]: Found 1 translation units. [2022-04-28 11:09:41,187 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/bresenham-ll_valuebound5.c [2022-04-28 11:09:41,194 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/61468b2a3/37082fd2a560427dbc11a679758469e6/FLAG0b19bcc80 [2022-04-28 11:09:41,205 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/61468b2a3/37082fd2a560427dbc11a679758469e6 [2022-04-28 11:09:41,206 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-28 11:09:41,207 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-28 11:09:41,209 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-28 11:09:41,209 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-28 11:09:41,211 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-28 11:09:41,212 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 11:09:41" (1/1) ... [2022-04-28 11:09:41,213 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@59338a09 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 11:09:41, skipping insertion in model container [2022-04-28 11:09:41,213 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 11:09:41" (1/1) ... [2022-04-28 11:09:41,224 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-28 11:09:41,237 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-28 11:09:41,386 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_valuebound5.c[597,610] [2022-04-28 11:09:41,425 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 11:09:41,432 INFO L203 MainTranslator]: Completed pre-run [2022-04-28 11:09:41,447 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_valuebound5.c[597,610] [2022-04-28 11:09:41,469 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 11:09:41,480 INFO L208 MainTranslator]: Completed translation [2022-04-28 11:09:41,481 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 11:09:41 WrapperNode [2022-04-28 11:09:41,481 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-28 11:09:41,482 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-28 11:09:41,482 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-28 11:09:41,482 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-28 11:09:41,491 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 11:09:41" (1/1) ... [2022-04-28 11:09:41,492 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 11:09:41" (1/1) ... [2022-04-28 11:09:41,498 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 11:09:41" (1/1) ... [2022-04-28 11:09:41,498 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 11:09:41" (1/1) ... [2022-04-28 11:09:41,511 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 11:09:41" (1/1) ... [2022-04-28 11:09:41,515 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 11:09:41" (1/1) ... [2022-04-28 11:09:41,520 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 11:09:41" (1/1) ... [2022-04-28 11:09:41,523 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-28 11:09:41,524 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-28 11:09:41,524 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-28 11:09:41,524 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-28 11:09:41,525 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 11:09:41" (1/1) ... [2022-04-28 11:09:41,531 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 11:09:41,542 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:09:41,555 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-28 11:09:41,566 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-28 11:09:41,601 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-28 11:09:41,601 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-28 11:09:41,601 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-28 11:09:41,601 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-28 11:09:41,601 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-28 11:09:41,601 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-28 11:09:41,601 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-28 11:09:41,602 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-28 11:09:41,602 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-28 11:09:41,602 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-28 11:09:41,602 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-28 11:09:41,602 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-28 11:09:41,602 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-28 11:09:41,602 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-28 11:09:41,603 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-28 11:09:41,604 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-28 11:09:41,604 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-28 11:09:41,604 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-28 11:09:41,604 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-28 11:09:41,604 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-28 11:09:41,654 INFO L234 CfgBuilder]: Building ICFG [2022-04-28 11:09:41,655 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-28 11:09:41,785 INFO L275 CfgBuilder]: Performing block encoding [2022-04-28 11:09:41,791 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-28 11:09:41,791 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-28 11:09:41,792 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 11:09:41 BoogieIcfgContainer [2022-04-28 11:09:41,793 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-28 11:09:41,794 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-28 11:09:41,795 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-28 11:09:41,798 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-28 11:09:41,798 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.04 11:09:41" (1/3) ... [2022-04-28 11:09:41,798 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d4490c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 11:09:41, skipping insertion in model container [2022-04-28 11:09:41,798 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 11:09:41" (2/3) ... [2022-04-28 11:09:41,799 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d4490c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 11:09:41, skipping insertion in model container [2022-04-28 11:09:41,799 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 11:09:41" (3/3) ... [2022-04-28 11:09:41,800 INFO L111 eAbstractionObserver]: Analyzing ICFG bresenham-ll_valuebound5.c [2022-04-28 11:09:41,810 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-28 11:09:41,810 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-28 11:09:41,858 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-28 11:09:41,863 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@7494267, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@790cf2e1 [2022-04-28 11:09:41,863 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-28 11:09:41,884 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-28 11:09:41,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-28 11:09:41,892 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:09:41,892 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 11:09:41,893 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:09:41,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:09:41,897 INFO L85 PathProgramCache]: Analyzing trace with hash -1867489771, now seen corresponding path program 1 times [2022-04-28 11:09:41,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:09:41,906 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1751219664] [2022-04-28 11:09:41,924 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 11:09:41,924 INFO L85 PathProgramCache]: Analyzing trace with hash -1867489771, now seen corresponding path program 2 times [2022-04-28 11:09:41,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:09:41,928 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1112187582] [2022-04-28 11:09:41,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:09:41,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:09:42,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:09:42,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 11:09:42,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:09:42,125 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-28 11:09:42,125 INFO L290 TraceCheckUtils]: 1: Hoare triple {35#true} assume true; {35#true} is VALID [2022-04-28 11:09:42,126 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {35#true} {35#true} #69#return; {35#true} is VALID [2022-04-28 11:09:42,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-28 11:09:42,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:09:42,136 INFO L290 TraceCheckUtils]: 0: Hoare triple {35#true} ~cond := #in~cond; {35#true} is VALID [2022-04-28 11:09:42,137 INFO L290 TraceCheckUtils]: 1: Hoare triple {35#true} assume 0 == ~cond;assume false; {36#false} is VALID [2022-04-28 11:09:42,137 INFO L290 TraceCheckUtils]: 2: Hoare triple {36#false} assume true; {36#false} is VALID [2022-04-28 11:09:42,137 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {36#false} {35#true} #61#return; {36#false} is VALID [2022-04-28 11:09:42,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-28 11:09:42,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:09:42,146 INFO L290 TraceCheckUtils]: 0: Hoare triple {35#true} ~cond := #in~cond; {35#true} is VALID [2022-04-28 11:09:42,146 INFO L290 TraceCheckUtils]: 1: Hoare triple {35#true} assume 0 == ~cond;assume false; {36#false} is VALID [2022-04-28 11:09:42,147 INFO L290 TraceCheckUtils]: 2: Hoare triple {36#false} assume true; {36#false} is VALID [2022-04-28 11:09:42,147 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {36#false} {36#false} #63#return; {36#false} is VALID [2022-04-28 11:09:42,148 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-28 11:09:42,148 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-28 11:09:42,148 INFO L290 TraceCheckUtils]: 2: Hoare triple {35#true} assume true; {35#true} is VALID [2022-04-28 11:09:42,149 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35#true} {35#true} #69#return; {35#true} is VALID [2022-04-28 11:09:42,149 INFO L272 TraceCheckUtils]: 4: Hoare triple {35#true} call #t~ret8 := main(); {35#true} is VALID [2022-04-28 11:09:42,149 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-28 11:09:42,149 INFO L272 TraceCheckUtils]: 6: Hoare triple {35#true} call assume_abort_if_not((if ~X~0 >= 0 && ~X~0 <= 5 then 1 else 0)); {35#true} is VALID [2022-04-28 11:09:42,150 INFO L290 TraceCheckUtils]: 7: Hoare triple {35#true} ~cond := #in~cond; {35#true} is VALID [2022-04-28 11:09:42,150 INFO L290 TraceCheckUtils]: 8: Hoare triple {35#true} assume 0 == ~cond;assume false; {36#false} is VALID [2022-04-28 11:09:42,150 INFO L290 TraceCheckUtils]: 9: Hoare triple {36#false} assume true; {36#false} is VALID [2022-04-28 11:09:42,151 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {36#false} {35#true} #61#return; {36#false} is VALID [2022-04-28 11:09:42,151 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-28 11:09:42,151 INFO L272 TraceCheckUtils]: 12: Hoare triple {36#false} call assume_abort_if_not((if ~Y~0 >= 0 && ~Y~0 <= 5 then 1 else 0)); {35#true} is VALID [2022-04-28 11:09:42,151 INFO L290 TraceCheckUtils]: 13: Hoare triple {35#true} ~cond := #in~cond; {35#true} is VALID [2022-04-28 11:09:42,152 INFO L290 TraceCheckUtils]: 14: Hoare triple {35#true} assume 0 == ~cond;assume false; {36#false} is VALID [2022-04-28 11:09:42,152 INFO L290 TraceCheckUtils]: 15: Hoare triple {36#false} assume true; {36#false} is VALID [2022-04-28 11:09:42,152 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {36#false} {36#false} #63#return; {36#false} is VALID [2022-04-28 11:09:42,152 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-28 11:09:42,153 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-28 11:09:42,153 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-28 11:09:42,153 INFO L290 TraceCheckUtils]: 20: Hoare triple {36#false} ~cond := #in~cond; {36#false} is VALID [2022-04-28 11:09:42,153 INFO L290 TraceCheckUtils]: 21: Hoare triple {36#false} assume 0 == ~cond; {36#false} is VALID [2022-04-28 11:09:42,154 INFO L290 TraceCheckUtils]: 22: Hoare triple {36#false} assume !false; {36#false} is VALID [2022-04-28 11:09:42,154 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-28 11:09:42,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:09:42,155 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1112187582] [2022-04-28 11:09:42,155 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1112187582] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:09:42,156 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:09:42,156 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 11:09:42,161 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:09:42,161 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1751219664] [2022-04-28 11:09:42,161 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1751219664] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:09:42,162 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:09:42,162 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 11:09:42,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [162225455] [2022-04-28 11:09:42,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:09:42,168 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-28 11:09:42,169 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:09:42,171 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-28 11:09:42,196 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:09:42,196 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-28 11:09:42,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:09:42,213 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-28 11:09:42,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-28 11:09:42,215 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-28 11:09:42,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:09:42,330 INFO L93 Difference]: Finished difference Result 57 states and 74 transitions. [2022-04-28 11:09:42,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-28 11:09:42,330 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-28 11:09:42,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:09:42,331 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-28 11:09:42,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 74 transitions. [2022-04-28 11:09:42,339 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-28 11:09:42,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 74 transitions. [2022-04-28 11:09:42,344 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 74 transitions. [2022-04-28 11:09:42,437 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-28 11:09:42,445 INFO L225 Difference]: With dead ends: 57 [2022-04-28 11:09:42,445 INFO L226 Difference]: Without dead ends: 27 [2022-04-28 11:09:42,448 INFO L412 NwaCegarLoop]: 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-28 11:09:42,450 INFO L413 NwaCegarLoop]: 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-28 11:09:42,451 INFO L414 NwaCegarLoop]: 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-28 11:09:42,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-04-28 11:09:42,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2022-04-28 11:09:42,478 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:09:42,479 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-28 11:09:42,479 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-28 11:09:42,480 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-28 11:09:42,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:09:42,484 INFO L93 Difference]: Finished difference Result 27 states and 30 transitions. [2022-04-28 11:09:42,484 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2022-04-28 11:09:42,485 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:09:42,485 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:09:42,485 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-28 11:09:42,486 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-28 11:09:42,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:09:42,489 INFO L93 Difference]: Finished difference Result 27 states and 30 transitions. [2022-04-28 11:09:42,489 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2022-04-28 11:09:42,490 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:09:42,490 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:09:42,490 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:09:42,490 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:09:42,491 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-28 11:09:42,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 30 transitions. [2022-04-28 11:09:42,494 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 30 transitions. Word has length 23 [2022-04-28 11:09:42,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:09:42,495 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 30 transitions. [2022-04-28 11:09:42,495 INFO L496 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-28 11:09:42,495 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 27 states and 30 transitions. [2022-04-28 11:09:42,530 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:09:42,531 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2022-04-28 11:09:42,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-28 11:09:42,532 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:09:42,533 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 11:09:42,533 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-28 11:09:42,533 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:09:42,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:09:42,535 INFO L85 PathProgramCache]: Analyzing trace with hash 1827672217, now seen corresponding path program 1 times [2022-04-28 11:09:42,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:09:42,536 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [452893086] [2022-04-28 11:09:42,537 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 11:09:42,537 INFO L85 PathProgramCache]: Analyzing trace with hash 1827672217, now seen corresponding path program 2 times [2022-04-28 11:09:42,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:09:42,541 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861773484] [2022-04-28 11:09:42,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:09:42,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:09:42,587 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 11:09:42,587 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2128686417] [2022-04-28 11:09:42,587 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 11:09:42,588 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:09:42,588 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:09:42,595 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 11:09:42,602 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-28 11:09:42,656 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-28 11:09:42,657 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 11:09:42,658 INFO L263 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-28 11:09:42,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:09:42,693 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 11:09:42,911 INFO L272 TraceCheckUtils]: 0: Hoare triple {273#true} call ULTIMATE.init(); {273#true} is VALID [2022-04-28 11:09:42,912 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-28 11:09:42,912 INFO L290 TraceCheckUtils]: 2: Hoare triple {273#true} assume true; {273#true} is VALID [2022-04-28 11:09:42,912 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {273#true} {273#true} #69#return; {273#true} is VALID [2022-04-28 11:09:42,912 INFO L272 TraceCheckUtils]: 4: Hoare triple {273#true} call #t~ret8 := main(); {273#true} is VALID [2022-04-28 11:09:42,913 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-28 11:09:42,914 INFO L272 TraceCheckUtils]: 6: Hoare triple {273#true} call assume_abort_if_not((if ~X~0 >= 0 && ~X~0 <= 5 then 1 else 0)); {273#true} is VALID [2022-04-28 11:09:42,914 INFO L290 TraceCheckUtils]: 7: Hoare triple {273#true} ~cond := #in~cond; {273#true} is VALID [2022-04-28 11:09:42,914 INFO L290 TraceCheckUtils]: 8: Hoare triple {273#true} assume !(0 == ~cond); {273#true} is VALID [2022-04-28 11:09:42,915 INFO L290 TraceCheckUtils]: 9: Hoare triple {273#true} assume true; {273#true} is VALID [2022-04-28 11:09:42,915 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {273#true} {273#true} #61#return; {273#true} is VALID [2022-04-28 11:09:42,915 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-28 11:09:42,915 INFO L272 TraceCheckUtils]: 12: Hoare triple {273#true} call assume_abort_if_not((if ~Y~0 >= 0 && ~Y~0 <= 5 then 1 else 0)); {273#true} is VALID [2022-04-28 11:09:42,917 INFO L290 TraceCheckUtils]: 13: Hoare triple {273#true} ~cond := #in~cond; {273#true} is VALID [2022-04-28 11:09:42,920 INFO L290 TraceCheckUtils]: 14: Hoare triple {273#true} assume !(0 == ~cond); {273#true} is VALID [2022-04-28 11:09:42,921 INFO L290 TraceCheckUtils]: 15: Hoare triple {273#true} assume true; {273#true} is VALID [2022-04-28 11:09:42,921 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {273#true} {273#true} #63#return; {273#true} is VALID [2022-04-28 11:09:42,922 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-28 11:09:42,925 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-28 11:09:42,926 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-28 11:09:42,927 INFO L290 TraceCheckUtils]: 20: Hoare triple {337#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {341#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:09:42,927 INFO L290 TraceCheckUtils]: 21: Hoare triple {341#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {274#false} is VALID [2022-04-28 11:09:42,928 INFO L290 TraceCheckUtils]: 22: Hoare triple {274#false} assume !false; {274#false} is VALID [2022-04-28 11:09:42,928 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-28 11:09:42,928 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 11:09:42,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:09:42,929 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1861773484] [2022-04-28 11:09:42,929 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 11:09:42,929 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2128686417] [2022-04-28 11:09:42,930 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2128686417] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:09:42,930 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:09:42,930 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 11:09:42,931 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:09:42,931 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [452893086] [2022-04-28 11:09:42,931 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [452893086] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:09:42,932 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:09:42,932 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 11:09:42,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [7768722] [2022-04-28 11:09:42,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:09:42,933 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-28 11:09:42,934 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:09:42,934 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-28 11:09:42,951 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:09:42,952 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 11:09:42,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:09:42,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 11:09:42,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-28 11:09:42,955 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-28 11:09:43,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:09:43,172 INFO L93 Difference]: Finished difference Result 39 states and 44 transitions. [2022-04-28 11:09:43,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-28 11:09:43,173 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-28 11:09:43,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:09:43,174 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-28 11:09:43,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 44 transitions. [2022-04-28 11:09:43,185 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-28 11:09:43,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 44 transitions. [2022-04-28 11:09:43,190 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 44 transitions. [2022-04-28 11:09:43,231 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:09:43,234 INFO L225 Difference]: With dead ends: 39 [2022-04-28 11:09:43,235 INFO L226 Difference]: Without dead ends: 35 [2022-04-28 11:09:43,236 INFO L412 NwaCegarLoop]: 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-28 11:09:43,237 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 10 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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-28 11:09:43,241 INFO L414 NwaCegarLoop]: 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-28 11:09:43,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-04-28 11:09:43,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 34. [2022-04-28 11:09:43,255 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:09:43,256 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-28 11:09:43,257 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-28 11:09:43,259 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-28 11:09:43,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:09:43,262 INFO L93 Difference]: Finished difference Result 35 states and 39 transitions. [2022-04-28 11:09:43,262 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2022-04-28 11:09:43,263 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:09:43,264 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:09:43,264 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-28 11:09:43,265 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-28 11:09:43,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:09:43,275 INFO L93 Difference]: Finished difference Result 35 states and 39 transitions. [2022-04-28 11:09:43,275 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2022-04-28 11:09:43,279 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:09:43,279 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:09:43,279 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:09:43,279 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:09:43,280 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-28 11:09:43,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 37 transitions. [2022-04-28 11:09:43,282 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 37 transitions. Word has length 23 [2022-04-28 11:09:43,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:09:43,282 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 37 transitions. [2022-04-28 11:09:43,282 INFO L496 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-28 11:09:43,282 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 34 states and 37 transitions. [2022-04-28 11:09:43,320 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-28 11:09:43,320 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 37 transitions. [2022-04-28 11:09:43,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-28 11:09:43,323 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:09:43,323 INFO L195 NwaCegarLoop]: 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-28 11:09:43,344 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-28 11:09:43,539 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:09:43,540 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:09:43,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:09:43,541 INFO L85 PathProgramCache]: Analyzing trace with hash -1419291471, now seen corresponding path program 1 times [2022-04-28 11:09:43,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:09:43,541 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1471092454] [2022-04-28 11:09:43,542 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 11:09:43,542 INFO L85 PathProgramCache]: Analyzing trace with hash -1419291471, now seen corresponding path program 2 times [2022-04-28 11:09:43,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:09:43,542 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [689911919] [2022-04-28 11:09:43,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:09:43,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:09:43,564 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 11:09:43,564 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [450452506] [2022-04-28 11:09:43,565 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 11:09:43,565 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:09:43,565 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:09:43,566 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 11:09:43,589 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-28 11:09:43,625 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 11:09:43,626 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 11:09:43,627 INFO L263 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 24 conjunts are in the unsatisfiable core [2022-04-28 11:09:43,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:09:43,645 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 11:09:44,031 INFO L272 TraceCheckUtils]: 0: Hoare triple {567#true} call ULTIMATE.init(); {567#true} is VALID [2022-04-28 11:09:44,031 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-28 11:09:44,032 INFO L290 TraceCheckUtils]: 2: Hoare triple {567#true} assume true; {567#true} is VALID [2022-04-28 11:09:44,032 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {567#true} {567#true} #69#return; {567#true} is VALID [2022-04-28 11:09:44,032 INFO L272 TraceCheckUtils]: 4: Hoare triple {567#true} call #t~ret8 := main(); {567#true} is VALID [2022-04-28 11:09:44,032 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-28 11:09:44,033 INFO L272 TraceCheckUtils]: 6: Hoare triple {567#true} call assume_abort_if_not((if ~X~0 >= 0 && ~X~0 <= 5 then 1 else 0)); {567#true} is VALID [2022-04-28 11:09:44,033 INFO L290 TraceCheckUtils]: 7: Hoare triple {567#true} ~cond := #in~cond; {567#true} is VALID [2022-04-28 11:09:44,033 INFO L290 TraceCheckUtils]: 8: Hoare triple {567#true} assume !(0 == ~cond); {567#true} is VALID [2022-04-28 11:09:44,034 INFO L290 TraceCheckUtils]: 9: Hoare triple {567#true} assume true; {567#true} is VALID [2022-04-28 11:09:44,034 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {567#true} {567#true} #61#return; {567#true} is VALID [2022-04-28 11:09:44,034 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-28 11:09:44,034 INFO L272 TraceCheckUtils]: 12: Hoare triple {567#true} call assume_abort_if_not((if ~Y~0 >= 0 && ~Y~0 <= 5 then 1 else 0)); {567#true} is VALID [2022-04-28 11:09:44,034 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-28 11:09:44,035 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-28 11:09:44,035 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-28 11:09:44,036 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 5))} is VALID [2022-04-28 11:09:44,036 INFO L290 TraceCheckUtils]: 17: Hoare triple {622#(and (<= 0 main_~Y~0) (<= main_~Y~0 5))} ~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 5))} is VALID [2022-04-28 11:09:44,037 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 5))} 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 5))} is VALID [2022-04-28 11:09:44,037 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 5))} 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-28 11:09:44,037 INFO L290 TraceCheckUtils]: 20: Hoare triple {567#true} ~cond := #in~cond; {567#true} is VALID [2022-04-28 11:09:44,038 INFO L290 TraceCheckUtils]: 21: Hoare triple {567#true} assume !(0 == ~cond); {567#true} is VALID [2022-04-28 11:09:44,038 INFO L290 TraceCheckUtils]: 22: Hoare triple {567#true} assume true; {567#true} is VALID [2022-04-28 11:09:44,039 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 5))} #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 5))} is VALID [2022-04-28 11:09:44,039 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 5))} 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 5))} is VALID [2022-04-28 11:09:44,040 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 5))} 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) (<= main_~Y~0 5) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) (+ main_~v~0 (* (- 2) main_~Y~0))))} is VALID [2022-04-28 11:09:44,041 INFO L290 TraceCheckUtils]: 26: Hoare triple {651#(and (= main_~x~0 0) (<= 0 main_~Y~0) (= main_~y~0 0) (<= main_~Y~0 5) (= (+ (* (- 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; {655#(and (= main_~x~0 1) (<= 0 main_~Y~0) (= main_~y~0 0) (<= main_~Y~0 5) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) (+ main_~v~0 (* (- 2) main_~Y~0))))} is VALID [2022-04-28 11:09:44,041 INFO L290 TraceCheckUtils]: 27: Hoare triple {655#(and (= main_~x~0 1) (<= 0 main_~Y~0) (= main_~y~0 0) (<= main_~Y~0 5) (= (+ (* (- 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; {659#(and (= main_~xy~0 0) (<= 0 main_~Y~0) (= main_~Y~0 main_~yx~0) (<= main_~Y~0 5) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) (+ main_~v~0 (* (- 2) main_~Y~0))))} is VALID [2022-04-28 11:09:44,042 INFO L272 TraceCheckUtils]: 28: Hoare triple {659#(and (= main_~xy~0 0) (<= 0 main_~Y~0) (= main_~Y~0 main_~yx~0) (<= main_~Y~0 5) (= (+ (* (- 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)); {663#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 11:09:44,043 INFO L290 TraceCheckUtils]: 29: Hoare triple {663#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {667#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:09:44,043 INFO L290 TraceCheckUtils]: 30: Hoare triple {667#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {568#false} is VALID [2022-04-28 11:09:44,043 INFO L290 TraceCheckUtils]: 31: Hoare triple {568#false} assume !false; {568#false} is VALID [2022-04-28 11:09:44,044 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-28 11:09:44,044 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 11:09:44,316 INFO L290 TraceCheckUtils]: 31: Hoare triple {568#false} assume !false; {568#false} is VALID [2022-04-28 11:09:44,317 INFO L290 TraceCheckUtils]: 30: Hoare triple {667#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {568#false} is VALID [2022-04-28 11:09:44,317 INFO L290 TraceCheckUtils]: 29: Hoare triple {663#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {667#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:09:44,318 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-28 11:09:44,319 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-28 11:09:44,320 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-28 11:09:44,321 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-28 11:09:44,321 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-28 11:09:44,322 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-28 11:09:44,322 INFO L290 TraceCheckUtils]: 22: Hoare triple {567#true} assume true; {567#true} is VALID [2022-04-28 11:09:44,323 INFO L290 TraceCheckUtils]: 21: Hoare triple {567#true} assume !(0 == ~cond); {567#true} is VALID [2022-04-28 11:09:44,323 INFO L290 TraceCheckUtils]: 20: Hoare triple {567#true} ~cond := #in~cond; {567#true} is VALID [2022-04-28 11:09:44,323 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-28 11:09:44,326 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-28 11:09:44,327 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-28 11:09:44,327 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {567#true} {567#true} #63#return; {567#true} is VALID [2022-04-28 11:09:44,327 INFO L290 TraceCheckUtils]: 15: Hoare triple {567#true} assume true; {567#true} is VALID [2022-04-28 11:09:44,328 INFO L290 TraceCheckUtils]: 14: Hoare triple {567#true} assume !(0 == ~cond); {567#true} is VALID [2022-04-28 11:09:44,328 INFO L290 TraceCheckUtils]: 13: Hoare triple {567#true} ~cond := #in~cond; {567#true} is VALID [2022-04-28 11:09:44,328 INFO L272 TraceCheckUtils]: 12: Hoare triple {567#true} call assume_abort_if_not((if ~Y~0 >= 0 && ~Y~0 <= 5 then 1 else 0)); {567#true} is VALID [2022-04-28 11:09:44,328 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-28 11:09:44,328 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {567#true} {567#true} #61#return; {567#true} is VALID [2022-04-28 11:09:44,328 INFO L290 TraceCheckUtils]: 9: Hoare triple {567#true} assume true; {567#true} is VALID [2022-04-28 11:09:44,329 INFO L290 TraceCheckUtils]: 8: Hoare triple {567#true} assume !(0 == ~cond); {567#true} is VALID [2022-04-28 11:09:44,329 INFO L290 TraceCheckUtils]: 7: Hoare triple {567#true} ~cond := #in~cond; {567#true} is VALID [2022-04-28 11:09:44,329 INFO L272 TraceCheckUtils]: 6: Hoare triple {567#true} call assume_abort_if_not((if ~X~0 >= 0 && ~X~0 <= 5 then 1 else 0)); {567#true} is VALID [2022-04-28 11:09:44,329 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-28 11:09:44,329 INFO L272 TraceCheckUtils]: 4: Hoare triple {567#true} call #t~ret8 := main(); {567#true} is VALID [2022-04-28 11:09:44,329 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {567#true} {567#true} #69#return; {567#true} is VALID [2022-04-28 11:09:44,330 INFO L290 TraceCheckUtils]: 2: Hoare triple {567#true} assume true; {567#true} is VALID [2022-04-28 11:09:44,330 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-28 11:09:44,330 INFO L272 TraceCheckUtils]: 0: Hoare triple {567#true} call ULTIMATE.init(); {567#true} is VALID [2022-04-28 11:09:44,330 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-28 11:09:44,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:09:44,331 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [689911919] [2022-04-28 11:09:44,331 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 11:09:44,331 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [450452506] [2022-04-28 11:09:44,331 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [450452506] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 11:09:44,331 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 11:09:44,331 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7] total 14 [2022-04-28 11:09:44,332 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:09:44,332 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1471092454] [2022-04-28 11:09:44,332 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1471092454] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:09:44,332 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:09:44,332 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-28 11:09:44,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1496977801] [2022-04-28 11:09:44,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:09:44,333 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-28 11:09:44,333 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:09:44,333 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-28 11:09:44,362 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-28 11:09:44,362 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-28 11:09:44,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:09:44,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-28 11:09:44,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2022-04-28 11:09:44,364 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-28 11:09:44,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:09:44,988 INFO L93 Difference]: Finished difference Result 48 states and 54 transitions. [2022-04-28 11:09:44,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-28 11:09:44,989 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-28 11:09:44,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:09:44,989 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-28 11:09:44,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 51 transitions. [2022-04-28 11:09:44,991 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-28 11:09:44,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 51 transitions. [2022-04-28 11:09:44,993 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 51 transitions. [2022-04-28 11:09:45,043 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:09:45,045 INFO L225 Difference]: With dead ends: 48 [2022-04-28 11:09:45,045 INFO L226 Difference]: Without dead ends: 44 [2022-04-28 11:09:45,045 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 49 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=224, Unknown=0, NotChecked=0, Total=272 [2022-04-28 11:09:45,046 INFO L413 NwaCegarLoop]: 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-28 11:09:45,046 INFO L414 NwaCegarLoop]: 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-28 11:09:45,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-04-28 11:09:45,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 43. [2022-04-28 11:09:45,084 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:09:45,084 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-28 11:09:45,084 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-28 11:09:45,085 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-28 11:09:45,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:09:45,089 INFO L93 Difference]: Finished difference Result 44 states and 49 transitions. [2022-04-28 11:09:45,090 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 49 transitions. [2022-04-28 11:09:45,094 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:09:45,094 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:09:45,095 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-28 11:09:45,095 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-28 11:09:45,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:09:45,101 INFO L93 Difference]: Finished difference Result 44 states and 49 transitions. [2022-04-28 11:09:45,102 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 49 transitions. [2022-04-28 11:09:45,102 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:09:45,102 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:09:45,102 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:09:45,102 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:09:45,102 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-28 11:09:45,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 47 transitions. [2022-04-28 11:09:45,104 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 47 transitions. Word has length 32 [2022-04-28 11:09:45,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:09:45,105 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 47 transitions. [2022-04-28 11:09:45,105 INFO L496 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-28 11:09:45,105 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 43 states and 47 transitions. [2022-04-28 11:09:45,157 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-28 11:09:45,157 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2022-04-28 11:09:45,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-28 11:09:45,158 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:09:45,158 INFO L195 NwaCegarLoop]: 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-28 11:09:45,179 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-04-28 11:09:45,371 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-04-28 11:09:45,372 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:09:45,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:09:45,372 INFO L85 PathProgramCache]: Analyzing trace with hash 355715891, now seen corresponding path program 1 times [2022-04-28 11:09:45,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:09:45,372 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [739439766] [2022-04-28 11:09:45,373 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 11:09:45,373 INFO L85 PathProgramCache]: Analyzing trace with hash 355715891, now seen corresponding path program 2 times [2022-04-28 11:09:45,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:09:45,373 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [744288339] [2022-04-28 11:09:45,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:09:45,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:09:45,389 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 11:09:45,389 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [774965959] [2022-04-28 11:09:45,389 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 11:09:45,389 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:09:45,390 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:09:45,395 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 11:09:45,399 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-28 11:09:45,443 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 11:09:45,444 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 11:09:45,445 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 24 conjunts are in the unsatisfiable core [2022-04-28 11:09:45,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:09:45,464 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 11:09:45,710 INFO L272 TraceCheckUtils]: 0: Hoare triple {1048#true} call ULTIMATE.init(); {1048#true} is VALID [2022-04-28 11:09:45,710 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-28 11:09:45,710 INFO L290 TraceCheckUtils]: 2: Hoare triple {1048#true} assume true; {1048#true} is VALID [2022-04-28 11:09:45,710 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1048#true} {1048#true} #69#return; {1048#true} is VALID [2022-04-28 11:09:45,711 INFO L272 TraceCheckUtils]: 4: Hoare triple {1048#true} call #t~ret8 := main(); {1048#true} is VALID [2022-04-28 11:09:45,711 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-28 11:09:45,711 INFO L272 TraceCheckUtils]: 6: Hoare triple {1048#true} call assume_abort_if_not((if ~X~0 >= 0 && ~X~0 <= 5 then 1 else 0)); {1048#true} is VALID [2022-04-28 11:09:45,711 INFO L290 TraceCheckUtils]: 7: Hoare triple {1048#true} ~cond := #in~cond; {1048#true} is VALID [2022-04-28 11:09:45,711 INFO L290 TraceCheckUtils]: 8: Hoare triple {1048#true} assume !(0 == ~cond); {1048#true} is VALID [2022-04-28 11:09:45,711 INFO L290 TraceCheckUtils]: 9: Hoare triple {1048#true} assume true; {1048#true} is VALID [2022-04-28 11:09:45,711 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1048#true} {1048#true} #61#return; {1048#true} is VALID [2022-04-28 11:09:45,712 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-28 11:09:45,712 INFO L272 TraceCheckUtils]: 12: Hoare triple {1048#true} call assume_abort_if_not((if ~Y~0 >= 0 && ~Y~0 <= 5 then 1 else 0)); {1048#true} is VALID [2022-04-28 11:09:45,712 INFO L290 TraceCheckUtils]: 13: Hoare triple {1048#true} ~cond := #in~cond; {1048#true} is VALID [2022-04-28 11:09:45,712 INFO L290 TraceCheckUtils]: 14: Hoare triple {1048#true} assume !(0 == ~cond); {1048#true} is VALID [2022-04-28 11:09:45,712 INFO L290 TraceCheckUtils]: 15: Hoare triple {1048#true} assume true; {1048#true} is VALID [2022-04-28 11:09:45,712 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {1048#true} {1048#true} #63#return; {1048#true} is VALID [2022-04-28 11:09:45,713 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-28 11:09:45,714 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-28 11:09:45,714 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-28 11:09:45,714 INFO L290 TraceCheckUtils]: 20: Hoare triple {1048#true} ~cond := #in~cond; {1048#true} is VALID [2022-04-28 11:09:45,714 INFO L290 TraceCheckUtils]: 21: Hoare triple {1048#true} assume !(0 == ~cond); {1048#true} is VALID [2022-04-28 11:09:45,714 INFO L290 TraceCheckUtils]: 22: Hoare triple {1048#true} assume true; {1048#true} is VALID [2022-04-28 11:09:45,715 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-28 11:09:45,716 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-28 11:09:45,717 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-28 11:09:45,718 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-28 11:09:45,719 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-28 11:09:45,720 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-28 11:09:45,720 INFO L290 TraceCheckUtils]: 29: Hoare triple {1142#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1146#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:09:45,721 INFO L290 TraceCheckUtils]: 30: Hoare triple {1146#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1049#false} is VALID [2022-04-28 11:09:45,721 INFO L290 TraceCheckUtils]: 31: Hoare triple {1049#false} assume !false; {1049#false} is VALID [2022-04-28 11:09:45,721 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-28 11:09:45,721 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 11:09:45,985 INFO L290 TraceCheckUtils]: 31: Hoare triple {1049#false} assume !false; {1049#false} is VALID [2022-04-28 11:09:45,985 INFO L290 TraceCheckUtils]: 30: Hoare triple {1146#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1049#false} is VALID [2022-04-28 11:09:45,986 INFO L290 TraceCheckUtils]: 29: Hoare triple {1142#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1146#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:09:45,987 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-28 11:09:45,988 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-28 11:09:46,157 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-28 11:09:46,159 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-28 11:09:46,159 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-28 11:09:46,160 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-28 11:09:46,160 INFO L290 TraceCheckUtils]: 22: Hoare triple {1048#true} assume true; {1048#true} is VALID [2022-04-28 11:09:46,160 INFO L290 TraceCheckUtils]: 21: Hoare triple {1048#true} assume !(0 == ~cond); {1048#true} is VALID [2022-04-28 11:09:46,161 INFO L290 TraceCheckUtils]: 20: Hoare triple {1048#true} ~cond := #in~cond; {1048#true} is VALID [2022-04-28 11:09:46,161 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-28 11:09:46,161 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-28 11:09:46,162 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-28 11:09:46,162 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {1048#true} {1048#true} #63#return; {1048#true} is VALID [2022-04-28 11:09:46,162 INFO L290 TraceCheckUtils]: 15: Hoare triple {1048#true} assume true; {1048#true} is VALID [2022-04-28 11:09:46,162 INFO L290 TraceCheckUtils]: 14: Hoare triple {1048#true} assume !(0 == ~cond); {1048#true} is VALID [2022-04-28 11:09:46,162 INFO L290 TraceCheckUtils]: 13: Hoare triple {1048#true} ~cond := #in~cond; {1048#true} is VALID [2022-04-28 11:09:46,162 INFO L272 TraceCheckUtils]: 12: Hoare triple {1048#true} call assume_abort_if_not((if ~Y~0 >= 0 && ~Y~0 <= 5 then 1 else 0)); {1048#true} is VALID [2022-04-28 11:09:46,162 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-28 11:09:46,163 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1048#true} {1048#true} #61#return; {1048#true} is VALID [2022-04-28 11:09:46,163 INFO L290 TraceCheckUtils]: 9: Hoare triple {1048#true} assume true; {1048#true} is VALID [2022-04-28 11:09:46,163 INFO L290 TraceCheckUtils]: 8: Hoare triple {1048#true} assume !(0 == ~cond); {1048#true} is VALID [2022-04-28 11:09:46,163 INFO L290 TraceCheckUtils]: 7: Hoare triple {1048#true} ~cond := #in~cond; {1048#true} is VALID [2022-04-28 11:09:46,163 INFO L272 TraceCheckUtils]: 6: Hoare triple {1048#true} call assume_abort_if_not((if ~X~0 >= 0 && ~X~0 <= 5 then 1 else 0)); {1048#true} is VALID [2022-04-28 11:09:46,163 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-28 11:09:46,164 INFO L272 TraceCheckUtils]: 4: Hoare triple {1048#true} call #t~ret8 := main(); {1048#true} is VALID [2022-04-28 11:09:46,164 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1048#true} {1048#true} #69#return; {1048#true} is VALID [2022-04-28 11:09:46,164 INFO L290 TraceCheckUtils]: 2: Hoare triple {1048#true} assume true; {1048#true} is VALID [2022-04-28 11:09:46,164 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-28 11:09:46,164 INFO L272 TraceCheckUtils]: 0: Hoare triple {1048#true} call ULTIMATE.init(); {1048#true} is VALID [2022-04-28 11:09:46,164 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-28 11:09:46,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:09:46,165 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [744288339] [2022-04-28 11:09:46,165 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 11:09:46,165 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [774965959] [2022-04-28 11:09:46,165 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [774965959] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 11:09:46,165 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 11:09:46,165 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 13 [2022-04-28 11:09:46,165 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:09:46,166 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [739439766] [2022-04-28 11:09:46,166 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [739439766] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:09:46,166 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:09:46,166 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-28 11:09:46,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [674416947] [2022-04-28 11:09:46,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:09:46,166 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-28 11:09:46,167 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:09:46,167 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-28 11:09:46,200 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:09:46,200 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-28 11:09:46,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:09:46,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-28 11:09:46,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2022-04-28 11:09:46,201 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-28 11:09:46,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:09:46,619 INFO L93 Difference]: Finished difference Result 56 states and 62 transitions. [2022-04-28 11:09:46,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-28 11:09:46,619 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-28 11:09:46,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:09:46,620 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-28 11:09:46,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 51 transitions. [2022-04-28 11:09:46,621 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-28 11:09:46,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 51 transitions. [2022-04-28 11:09:46,623 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 51 transitions. [2022-04-28 11:09:46,666 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:09:46,667 INFO L225 Difference]: With dead ends: 56 [2022-04-28 11:09:46,667 INFO L226 Difference]: Without dead ends: 54 [2022-04-28 11:09:46,668 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 50 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2022-04-28 11:09:46,669 INFO L413 NwaCegarLoop]: 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-28 11:09:46,669 INFO L414 NwaCegarLoop]: 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-28 11:09:46,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2022-04-28 11:09:46,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 50. [2022-04-28 11:09:46,709 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:09:46,709 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-28 11:09:46,709 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-28 11:09:46,710 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-28 11:09:46,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:09:46,712 INFO L93 Difference]: Finished difference Result 54 states and 60 transitions. [2022-04-28 11:09:46,712 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 60 transitions. [2022-04-28 11:09:46,712 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:09:46,712 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:09:46,713 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-28 11:09:46,713 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-28 11:09:46,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:09:46,715 INFO L93 Difference]: Finished difference Result 54 states and 60 transitions. [2022-04-28 11:09:46,715 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 60 transitions. [2022-04-28 11:09:46,715 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:09:46,715 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:09:46,716 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:09:46,716 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:09:46,716 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-28 11:09:46,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 54 transitions. [2022-04-28 11:09:46,718 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 54 transitions. Word has length 32 [2022-04-28 11:09:46,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:09:46,718 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 54 transitions. [2022-04-28 11:09:46,718 INFO L496 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-28 11:09:46,718 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 50 states and 54 transitions. [2022-04-28 11:09:46,778 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:09:46,778 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2022-04-28 11:09:46,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-04-28 11:09:46,779 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:09:46,779 INFO L195 NwaCegarLoop]: 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-28 11:09:46,795 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-28 11:09:46,983 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:09:46,983 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:09:46,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:09:46,984 INFO L85 PathProgramCache]: Analyzing trace with hash 125050924, now seen corresponding path program 1 times [2022-04-28 11:09:46,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:09:46,984 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1271165993] [2022-04-28 11:09:46,984 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 11:09:46,985 INFO L85 PathProgramCache]: Analyzing trace with hash 125050924, now seen corresponding path program 2 times [2022-04-28 11:09:46,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:09:46,985 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1215116258] [2022-04-28 11:09:46,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:09:46,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:09:47,012 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 11:09:47,012 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [498143374] [2022-04-28 11:09:47,012 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 11:09:47,012 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:09:47,012 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:09:47,015 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 11:09:47,016 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-04-28 11:09:47,066 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 11:09:47,066 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 11:09:47,067 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 30 conjunts are in the unsatisfiable core [2022-04-28 11:09:47,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:09:47,082 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 11:10:04,138 WARN L828 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-28 11:10:12,705 WARN L828 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-28 11:10:18,742 WARN L828 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-28 11:10:31,875 INFO L272 TraceCheckUtils]: 0: Hoare triple {1576#true} call ULTIMATE.init(); {1576#true} is VALID [2022-04-28 11:10:31,875 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-28 11:10:31,876 INFO L290 TraceCheckUtils]: 2: Hoare triple {1576#true} assume true; {1576#true} is VALID [2022-04-28 11:10:31,876 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1576#true} {1576#true} #69#return; {1576#true} is VALID [2022-04-28 11:10:31,876 INFO L272 TraceCheckUtils]: 4: Hoare triple {1576#true} call #t~ret8 := main(); {1576#true} is VALID [2022-04-28 11:10:31,876 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-28 11:10:31,876 INFO L272 TraceCheckUtils]: 6: Hoare triple {1576#true} call assume_abort_if_not((if ~X~0 >= 0 && ~X~0 <= 5 then 1 else 0)); {1576#true} is VALID [2022-04-28 11:10:31,876 INFO L290 TraceCheckUtils]: 7: Hoare triple {1576#true} ~cond := #in~cond; {1576#true} is VALID [2022-04-28 11:10:31,876 INFO L290 TraceCheckUtils]: 8: Hoare triple {1576#true} assume !(0 == ~cond); {1576#true} is VALID [2022-04-28 11:10:31,876 INFO L290 TraceCheckUtils]: 9: Hoare triple {1576#true} assume true; {1576#true} is VALID [2022-04-28 11:10:31,876 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1576#true} {1576#true} #61#return; {1576#true} is VALID [2022-04-28 11:10:31,877 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-28 11:10:31,877 INFO L272 TraceCheckUtils]: 12: Hoare triple {1576#true} call assume_abort_if_not((if ~Y~0 >= 0 && ~Y~0 <= 5 then 1 else 0)); {1576#true} is VALID [2022-04-28 11:10:31,877 INFO L290 TraceCheckUtils]: 13: Hoare triple {1576#true} ~cond := #in~cond; {1576#true} is VALID [2022-04-28 11:10:31,877 INFO L290 TraceCheckUtils]: 14: Hoare triple {1576#true} assume !(0 == ~cond); {1576#true} is VALID [2022-04-28 11:10:31,877 INFO L290 TraceCheckUtils]: 15: Hoare triple {1576#true} assume true; {1576#true} is VALID [2022-04-28 11:10:31,877 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {1576#true} {1576#true} #63#return; {1576#true} is VALID [2022-04-28 11:10:31,879 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-28 11:10:31,880 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-28 11:10:31,880 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-28 11:10:31,880 INFO L290 TraceCheckUtils]: 20: Hoare triple {1576#true} ~cond := #in~cond; {1642#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:10:31,881 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-28 11:10:31,881 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-28 11:10:31,882 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-28 11:10:31,883 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-28 11:10:31,883 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-28 11:10:31,884 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-28 11:10:31,884 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-28 11:10:31,884 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-28 11:10:31,885 INFO L290 TraceCheckUtils]: 29: Hoare triple {1576#true} ~cond := #in~cond; {1642#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:10:31,885 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-28 11:10:31,885 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-28 11:10:31,886 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-28 11:10:31,887 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-28 11:10:31,893 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-28 11:10:31,895 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-28 11:10:31,895 INFO L290 TraceCheckUtils]: 36: Hoare triple {1696#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1700#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:10:31,895 INFO L290 TraceCheckUtils]: 37: Hoare triple {1700#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1577#false} is VALID [2022-04-28 11:10:31,895 INFO L290 TraceCheckUtils]: 38: Hoare triple {1577#false} assume !false; {1577#false} is VALID [2022-04-28 11:10:31,896 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-28 11:10:31,896 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 11:10:39,004 INFO L290 TraceCheckUtils]: 38: Hoare triple {1577#false} assume !false; {1577#false} is VALID [2022-04-28 11:10:39,005 INFO L290 TraceCheckUtils]: 37: Hoare triple {1700#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1577#false} is VALID [2022-04-28 11:10:39,005 INFO L290 TraceCheckUtils]: 36: Hoare triple {1696#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1700#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:10:39,006 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-28 11:10:39,007 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-28 11:10:39,010 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-28 11:10:39,011 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-28 11:10:39,011 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-28 11:10:39,013 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-28 11:10:39,013 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-28 11:10:39,013 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-28 11:10:39,014 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-28 11:10:39,015 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-28 11:10:39,018 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-28 11:10:39,020 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-28 11:10:39,020 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {1576#true} {1576#true} #65#return; {1576#true} is VALID [2022-04-28 11:10:39,020 INFO L290 TraceCheckUtils]: 22: Hoare triple {1576#true} assume true; {1576#true} is VALID [2022-04-28 11:10:39,020 INFO L290 TraceCheckUtils]: 21: Hoare triple {1576#true} assume !(0 == ~cond); {1576#true} is VALID [2022-04-28 11:10:39,020 INFO L290 TraceCheckUtils]: 20: Hoare triple {1576#true} ~cond := #in~cond; {1576#true} is VALID [2022-04-28 11:10:39,021 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-28 11:10:39,021 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-28 11:10:39,021 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-28 11:10:39,021 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {1576#true} {1576#true} #63#return; {1576#true} is VALID [2022-04-28 11:10:39,021 INFO L290 TraceCheckUtils]: 15: Hoare triple {1576#true} assume true; {1576#true} is VALID [2022-04-28 11:10:39,021 INFO L290 TraceCheckUtils]: 14: Hoare triple {1576#true} assume !(0 == ~cond); {1576#true} is VALID [2022-04-28 11:10:39,021 INFO L290 TraceCheckUtils]: 13: Hoare triple {1576#true} ~cond := #in~cond; {1576#true} is VALID [2022-04-28 11:10:39,022 INFO L272 TraceCheckUtils]: 12: Hoare triple {1576#true} call assume_abort_if_not((if ~Y~0 >= 0 && ~Y~0 <= 5 then 1 else 0)); {1576#true} is VALID [2022-04-28 11:10:39,022 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-28 11:10:39,022 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1576#true} {1576#true} #61#return; {1576#true} is VALID [2022-04-28 11:10:39,022 INFO L290 TraceCheckUtils]: 9: Hoare triple {1576#true} assume true; {1576#true} is VALID [2022-04-28 11:10:39,022 INFO L290 TraceCheckUtils]: 8: Hoare triple {1576#true} assume !(0 == ~cond); {1576#true} is VALID [2022-04-28 11:10:39,022 INFO L290 TraceCheckUtils]: 7: Hoare triple {1576#true} ~cond := #in~cond; {1576#true} is VALID [2022-04-28 11:10:39,022 INFO L272 TraceCheckUtils]: 6: Hoare triple {1576#true} call assume_abort_if_not((if ~X~0 >= 0 && ~X~0 <= 5 then 1 else 0)); {1576#true} is VALID [2022-04-28 11:10:39,022 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-28 11:10:39,023 INFO L272 TraceCheckUtils]: 4: Hoare triple {1576#true} call #t~ret8 := main(); {1576#true} is VALID [2022-04-28 11:10:39,023 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1576#true} {1576#true} #69#return; {1576#true} is VALID [2022-04-28 11:10:39,023 INFO L290 TraceCheckUtils]: 2: Hoare triple {1576#true} assume true; {1576#true} is VALID [2022-04-28 11:10:39,023 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-28 11:10:39,023 INFO L272 TraceCheckUtils]: 0: Hoare triple {1576#true} call ULTIMATE.init(); {1576#true} is VALID [2022-04-28 11:10:39,023 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-28 11:10:39,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:10:39,024 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1215116258] [2022-04-28 11:10:39,024 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 11:10:39,024 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [498143374] [2022-04-28 11:10:39,024 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [498143374] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 11:10:39,024 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 11:10:39,024 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 22 [2022-04-28 11:10:39,024 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:10:39,025 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1271165993] [2022-04-28 11:10:39,025 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1271165993] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:10:39,025 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:10:39,025 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-28 11:10:39,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1630738146] [2022-04-28 11:10:39,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:10:39,025 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-28 11:10:39,026 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:10:39,026 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-28 11:10:39,063 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:10:39,063 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-28 11:10:39,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:10:39,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-28 11:10:39,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=388, Unknown=0, NotChecked=0, Total=462 [2022-04-28 11:10:39,064 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-28 11:10:40,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:10:40,366 INFO L93 Difference]: Finished difference Result 61 states and 66 transitions. [2022-04-28 11:10:40,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-28 11:10:40,366 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-28 11:10:40,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:10:40,366 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-28 11:10:40,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 53 transitions. [2022-04-28 11:10:40,368 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-28 11:10:40,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 53 transitions. [2022-04-28 11:10:40,369 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 53 transitions. [2022-04-28 11:10:40,428 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:10:40,429 INFO L225 Difference]: With dead ends: 61 [2022-04-28 11:10:40,429 INFO L226 Difference]: Without dead ends: 53 [2022-04-28 11:10:40,430 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 56 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=116, Invalid=586, Unknown=0, NotChecked=0, Total=702 [2022-04-28 11:10:40,431 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 16 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 295 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s 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.4s IncrementalHoareTripleChecker+Time [2022-04-28 11:10:40,431 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 219 Invalid, 299 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 295 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-28 11:10:40,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-04-28 11:10:40,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 43. [2022-04-28 11:10:40,471 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:10:40,472 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-28 11:10:40,472 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-28 11:10:40,473 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-28 11:10:40,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:10:40,475 INFO L93 Difference]: Finished difference Result 53 states and 58 transitions. [2022-04-28 11:10:40,475 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 58 transitions. [2022-04-28 11:10:40,475 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:10:40,475 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:10:40,476 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-28 11:10:40,476 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-28 11:10:40,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:10:40,484 INFO L93 Difference]: Finished difference Result 53 states and 58 transitions. [2022-04-28 11:10:40,484 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 58 transitions. [2022-04-28 11:10:40,484 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:10:40,484 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:10:40,485 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:10:40,485 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:10:40,485 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-28 11:10:40,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 47 transitions. [2022-04-28 11:10:40,486 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 47 transitions. Word has length 39 [2022-04-28 11:10:40,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:10:40,487 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 47 transitions. [2022-04-28 11:10:40,487 INFO L496 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-28 11:10:40,487 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 43 states and 47 transitions. [2022-04-28 11:10:40,547 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-28 11:10:40,548 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2022-04-28 11:10:40,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-04-28 11:10:40,548 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:10:40,548 INFO L195 NwaCegarLoop]: 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-28 11:10:40,571 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-04-28 11:10:40,767 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:10:40,767 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:10:40,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:10:40,768 INFO L85 PathProgramCache]: Analyzing trace with hash 733948825, now seen corresponding path program 3 times [2022-04-28 11:10:40,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:10:40,768 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [446780232] [2022-04-28 11:10:40,768 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 11:10:40,769 INFO L85 PathProgramCache]: Analyzing trace with hash 733948825, now seen corresponding path program 4 times [2022-04-28 11:10:40,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:10:40,769 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1021371662] [2022-04-28 11:10:40,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:10:40,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:10:40,785 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 11:10:40,785 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [424134399] [2022-04-28 11:10:40,786 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 11:10:40,786 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:10:40,786 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:10:40,789 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 11:10:40,790 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-04-28 11:10:40,833 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 11:10:40,833 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 11:10:40,834 INFO L263 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 40 conjunts are in the unsatisfiable core [2022-04-28 11:10:40,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:10:40,851 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 11:10:57,892 WARN L828 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-28 11:11:04,015 WARN L828 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-28 11:11:07,410 INFO L272 TraceCheckUtils]: 0: Hoare triple {2155#true} call ULTIMATE.init(); {2155#true} is VALID [2022-04-28 11:11:07,410 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-28 11:11:07,410 INFO L290 TraceCheckUtils]: 2: Hoare triple {2155#true} assume true; {2155#true} is VALID [2022-04-28 11:11:07,410 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2155#true} {2155#true} #69#return; {2155#true} is VALID [2022-04-28 11:11:07,411 INFO L272 TraceCheckUtils]: 4: Hoare triple {2155#true} call #t~ret8 := main(); {2155#true} is VALID [2022-04-28 11:11:07,411 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-28 11:11:07,411 INFO L272 TraceCheckUtils]: 6: Hoare triple {2155#true} call assume_abort_if_not((if ~X~0 >= 0 && ~X~0 <= 5 then 1 else 0)); {2155#true} is VALID [2022-04-28 11:11:07,411 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-28 11:11:07,411 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-28 11:11:07,412 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-28 11:11:07,412 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2185#(not (= |assume_abort_if_not_#in~cond| 0))} {2155#true} #61#return; {2192#(and (<= 0 main_~X~0) (<= main_~X~0 5))} is VALID [2022-04-28 11:11:07,413 INFO L290 TraceCheckUtils]: 11: Hoare triple {2192#(and (<= 0 main_~X~0) (<= main_~X~0 5))} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~Y~0 := #t~nondet5;havoc #t~nondet5; {2192#(and (<= 0 main_~X~0) (<= main_~X~0 5))} is VALID [2022-04-28 11:11:07,413 INFO L272 TraceCheckUtils]: 12: Hoare triple {2192#(and (<= 0 main_~X~0) (<= main_~X~0 5))} call assume_abort_if_not((if ~Y~0 >= 0 && ~Y~0 <= 5 then 1 else 0)); {2155#true} is VALID [2022-04-28 11:11:07,413 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-28 11:11:07,413 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-28 11:11:07,414 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-28 11:11:07,414 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {2185#(not (= |assume_abort_if_not_#in~cond| 0))} {2192#(and (<= 0 main_~X~0) (<= main_~X~0 5))} #63#return; {2211#(and (<= 0 main_~Y~0) (<= 0 main_~X~0) (<= main_~X~0 5) (<= main_~Y~0 5))} is VALID [2022-04-28 11:11:07,415 INFO L290 TraceCheckUtils]: 17: Hoare triple {2211#(and (<= 0 main_~Y~0) (<= 0 main_~X~0) (<= main_~X~0 5) (<= main_~Y~0 5))} ~v~0 := 2 * ~Y~0 - ~X~0;~y~0 := 0;~x~0 := 0; {2215#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (<= 0 main_~Y~0) (<= 0 main_~X~0) (<= main_~X~0 5) (= main_~y~0 0) (<= main_~Y~0 5))} is VALID [2022-04-28 11:11:07,415 INFO L290 TraceCheckUtils]: 18: Hoare triple {2215#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (<= 0 main_~Y~0) (<= 0 main_~X~0) (<= main_~X~0 5) (= main_~y~0 0) (<= main_~Y~0 5))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {2215#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (<= 0 main_~Y~0) (<= 0 main_~X~0) (<= main_~X~0 5) (= main_~y~0 0) (<= main_~Y~0 5))} is VALID [2022-04-28 11:11:07,415 INFO L272 TraceCheckUtils]: 19: Hoare triple {2215#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (<= 0 main_~Y~0) (<= 0 main_~X~0) (<= main_~X~0 5) (= main_~y~0 0) (<= main_~Y~0 5))} 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-28 11:11:07,415 INFO L290 TraceCheckUtils]: 20: Hoare triple {2155#true} ~cond := #in~cond; {2155#true} is VALID [2022-04-28 11:11:07,415 INFO L290 TraceCheckUtils]: 21: Hoare triple {2155#true} assume !(0 == ~cond); {2155#true} is VALID [2022-04-28 11:11:07,416 INFO L290 TraceCheckUtils]: 22: Hoare triple {2155#true} assume true; {2155#true} is VALID [2022-04-28 11:11:07,416 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {2155#true} {2215#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (<= 0 main_~Y~0) (<= 0 main_~X~0) (<= main_~X~0 5) (= main_~y~0 0) (<= main_~Y~0 5))} #65#return; {2215#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (<= 0 main_~Y~0) (<= 0 main_~X~0) (<= main_~X~0 5) (= main_~y~0 0) (<= main_~Y~0 5))} is VALID [2022-04-28 11:11:07,417 INFO L290 TraceCheckUtils]: 24: Hoare triple {2215#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (<= 0 main_~Y~0) (<= 0 main_~X~0) (<= main_~X~0 5) (= main_~y~0 0) (<= main_~Y~0 5))} assume !!(~x~0 <= ~X~0); {2215#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (<= 0 main_~Y~0) (<= 0 main_~X~0) (<= main_~X~0 5) (= main_~y~0 0) (<= main_~Y~0 5))} is VALID [2022-04-28 11:11:07,417 INFO L290 TraceCheckUtils]: 25: Hoare triple {2215#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (<= 0 main_~Y~0) (<= 0 main_~X~0) (<= main_~X~0 5) (= main_~y~0 0) (<= main_~Y~0 5))} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {2240#(and (= main_~x~0 0) (<= 0 main_~Y~0) (<= 0 main_~X~0) (<= main_~X~0 5) (= main_~y~0 0) (<= main_~Y~0 5) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) (+ main_~v~0 (* (- 2) main_~Y~0))))} is VALID [2022-04-28 11:11:07,418 INFO L290 TraceCheckUtils]: 26: Hoare triple {2240#(and (= main_~x~0 0) (<= 0 main_~Y~0) (<= 0 main_~X~0) (<= main_~X~0 5) (= main_~y~0 0) (<= main_~Y~0 5) (= (+ (* (- 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; {2244#(and (<= 1 main_~x~0) (<= 0 main_~Y~0) (<= 0 main_~X~0) (<= main_~X~0 5) (= main_~y~0 0) (<= main_~Y~0 5) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) (+ main_~v~0 (* (- 2) main_~Y~0))))} is VALID [2022-04-28 11:11:07,419 INFO L290 TraceCheckUtils]: 27: Hoare triple {2244#(and (<= 1 main_~x~0) (<= 0 main_~Y~0) (<= 0 main_~X~0) (<= main_~X~0 5) (= main_~y~0 0) (<= main_~Y~0 5) (= (+ (* (- 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; {2248#(and (<= 1 main_~x~0) (<= 0 main_~Y~0) (<= 0 main_~X~0) (<= main_~X~0 5) (= (* 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 5) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) (+ main_~v~0 (* (- 2) main_~Y~0))))} is VALID [2022-04-28 11:11:07,419 INFO L272 TraceCheckUtils]: 28: Hoare triple {2248#(and (<= 1 main_~x~0) (<= 0 main_~Y~0) (<= 0 main_~X~0) (<= main_~X~0 5) (= (* 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 5) (= (+ (* (- 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)); {2155#true} is VALID [2022-04-28 11:11:07,419 INFO L290 TraceCheckUtils]: 29: Hoare triple {2155#true} ~cond := #in~cond; {2255#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:11:07,420 INFO L290 TraceCheckUtils]: 30: Hoare triple {2255#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {2259#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:11:07,420 INFO L290 TraceCheckUtils]: 31: Hoare triple {2259#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {2259#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:11:07,421 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {2259#(not (= |__VERIFIER_assert_#in~cond| 0))} {2248#(and (<= 1 main_~x~0) (<= 0 main_~Y~0) (<= 0 main_~X~0) (<= main_~X~0 5) (= (* 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 5) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) (+ main_~v~0 (* (- 2) main_~Y~0))))} #65#return; {2266#(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)) (<= 0 main_~Y~0) (<= 0 main_~X~0) (<= main_~X~0 5) (= main_~y~0 0) (<= main_~Y~0 5) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) (+ main_~v~0 (* (- 2) main_~Y~0))))} is VALID [2022-04-28 11:11:07,422 INFO L290 TraceCheckUtils]: 33: Hoare triple {2266#(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)) (<= 0 main_~Y~0) (<= 0 main_~X~0) (<= main_~X~0 5) (= main_~y~0 0) (<= main_~Y~0 5) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) (+ main_~v~0 (* (- 2) main_~Y~0))))} assume !!(~x~0 <= ~X~0); {2266#(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)) (<= 0 main_~Y~0) (<= 0 main_~X~0) (<= main_~X~0 5) (= main_~y~0 0) (<= main_~Y~0 5) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) (+ main_~v~0 (* (- 2) main_~Y~0))))} is VALID [2022-04-28 11:11:07,422 INFO L290 TraceCheckUtils]: 34: Hoare triple {2266#(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)) (<= 0 main_~Y~0) (<= 0 main_~X~0) (<= main_~X~0 5) (= main_~y~0 0) (<= main_~Y~0 5) (= (+ (* (- 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; {2273#(and (<= 1 main_~x~0) (< main_~v~0 (* main_~Y~0 2)) (<= 0 main_~Y~0) (<= main_~X~0 5) (= 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)))} is VALID [2022-04-28 11:11:07,424 INFO L290 TraceCheckUtils]: 35: Hoare triple {2273#(and (<= 1 main_~x~0) (< main_~v~0 (* main_~Y~0 2)) (<= 0 main_~Y~0) (<= main_~X~0 5) (= 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)))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {2277#(and (< main_~v~0 (* main_~Y~0 2)) (<= 0 main_~Y~0) (<= 2 main_~x~0) (<= main_~X~0 5) (= 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))))} is VALID [2022-04-28 11:11:07,428 INFO L290 TraceCheckUtils]: 36: Hoare triple {2277#(and (< main_~v~0 (* main_~Y~0 2)) (<= 0 main_~Y~0) (<= 2 main_~x~0) (<= main_~X~0 5) (= 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))))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {2281#(and (= main_~xy~0 0) (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) (<= 2 (div (+ (* (- 1) main_~Y~0) (div (+ (* (- 1) main_~X~0) (* (- 1) main_~v~0)) (- 2))) main_~Y~0)) (not (= main_~Y~0 0)))) (< main_~v~0 (* main_~Y~0 2)) (<= 0 main_~Y~0) (<= main_~X~0 5))} is VALID [2022-04-28 11:11:07,430 INFO L272 TraceCheckUtils]: 37: Hoare triple {2281#(and (= main_~xy~0 0) (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) (<= 2 (div (+ (* (- 1) main_~Y~0) (div (+ (* (- 1) main_~X~0) (* (- 1) main_~v~0)) (- 2))) main_~Y~0)) (not (= main_~Y~0 0)))) (< main_~v~0 (* main_~Y~0 2)) (<= 0 main_~Y~0) (<= main_~X~0 5))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {2285#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 11:11:07,431 INFO L290 TraceCheckUtils]: 38: Hoare triple {2285#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2289#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:11:07,431 INFO L290 TraceCheckUtils]: 39: Hoare triple {2289#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2156#false} is VALID [2022-04-28 11:11:07,431 INFO L290 TraceCheckUtils]: 40: Hoare triple {2156#false} assume !false; {2156#false} is VALID [2022-04-28 11:11:07,432 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-28 11:11:07,432 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 11:11:11,841 INFO L290 TraceCheckUtils]: 40: Hoare triple {2156#false} assume !false; {2156#false} is VALID [2022-04-28 11:11:11,842 INFO L290 TraceCheckUtils]: 39: Hoare triple {2289#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2156#false} is VALID [2022-04-28 11:11:11,842 INFO L290 TraceCheckUtils]: 38: Hoare triple {2285#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2289#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:11:11,843 INFO L272 TraceCheckUtils]: 37: Hoare triple {2305#(= (+ (* 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)); {2285#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 11:11:11,844 INFO L290 TraceCheckUtils]: 36: Hoare triple {2309#(= (+ (* 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; {2305#(= (+ (* 2 main_~xy~0) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 main_~yx~0)))} is VALID [2022-04-28 11:11:11,846 INFO L290 TraceCheckUtils]: 35: Hoare triple {2313#(= (+ (* (* 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; {2309#(= (+ (* 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-28 11:11:11,847 INFO L290 TraceCheckUtils]: 34: Hoare triple {2317#(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; {2313#(= (+ (* (* 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-28 11:11:11,848 INFO L290 TraceCheckUtils]: 33: Hoare triple {2317#(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); {2317#(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-28 11:11:11,849 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {2259#(not (= |__VERIFIER_assert_#in~cond| 0))} {2324#(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; {2317#(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-28 11:11:11,849 INFO L290 TraceCheckUtils]: 31: Hoare triple {2259#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {2259#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:11:11,850 INFO L290 TraceCheckUtils]: 30: Hoare triple {2334#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {2259#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:11:11,850 INFO L290 TraceCheckUtils]: 29: Hoare triple {2155#true} ~cond := #in~cond; {2334#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 11:11:11,850 INFO L272 TraceCheckUtils]: 28: Hoare triple {2324#(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)); {2155#true} is VALID [2022-04-28 11:11:11,851 INFO L290 TraceCheckUtils]: 27: Hoare triple {2155#true} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {2324#(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-28 11:11:11,852 INFO L290 TraceCheckUtils]: 26: Hoare triple {2155#true} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {2155#true} is VALID [2022-04-28 11:11:11,852 INFO L290 TraceCheckUtils]: 25: Hoare triple {2155#true} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {2155#true} is VALID [2022-04-28 11:11:11,852 INFO L290 TraceCheckUtils]: 24: Hoare triple {2155#true} assume !!(~x~0 <= ~X~0); {2155#true} is VALID [2022-04-28 11:11:11,852 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {2155#true} {2155#true} #65#return; {2155#true} is VALID [2022-04-28 11:11:11,852 INFO L290 TraceCheckUtils]: 22: Hoare triple {2155#true} assume true; {2155#true} is VALID [2022-04-28 11:11:11,852 INFO L290 TraceCheckUtils]: 21: Hoare triple {2155#true} assume !(0 == ~cond); {2155#true} is VALID [2022-04-28 11:11:11,852 INFO L290 TraceCheckUtils]: 20: Hoare triple {2155#true} ~cond := #in~cond; {2155#true} is VALID [2022-04-28 11:11:11,852 INFO L272 TraceCheckUtils]: 19: Hoare triple {2155#true} 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-28 11:11:11,853 INFO L290 TraceCheckUtils]: 18: Hoare triple {2155#true} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {2155#true} is VALID [2022-04-28 11:11:11,853 INFO L290 TraceCheckUtils]: 17: Hoare triple {2155#true} ~v~0 := 2 * ~Y~0 - ~X~0;~y~0 := 0;~x~0 := 0; {2155#true} is VALID [2022-04-28 11:11:11,853 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {2155#true} {2155#true} #63#return; {2155#true} is VALID [2022-04-28 11:11:11,853 INFO L290 TraceCheckUtils]: 15: Hoare triple {2155#true} assume true; {2155#true} is VALID [2022-04-28 11:11:11,853 INFO L290 TraceCheckUtils]: 14: Hoare triple {2155#true} assume !(0 == ~cond); {2155#true} is VALID [2022-04-28 11:11:11,853 INFO L290 TraceCheckUtils]: 13: Hoare triple {2155#true} ~cond := #in~cond; {2155#true} is VALID [2022-04-28 11:11:11,853 INFO L272 TraceCheckUtils]: 12: Hoare triple {2155#true} call assume_abort_if_not((if ~Y~0 >= 0 && ~Y~0 <= 5 then 1 else 0)); {2155#true} is VALID [2022-04-28 11:11:11,853 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-28 11:11:11,854 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2155#true} {2155#true} #61#return; {2155#true} is VALID [2022-04-28 11:11:11,854 INFO L290 TraceCheckUtils]: 9: Hoare triple {2155#true} assume true; {2155#true} is VALID [2022-04-28 11:11:11,854 INFO L290 TraceCheckUtils]: 8: Hoare triple {2155#true} assume !(0 == ~cond); {2155#true} is VALID [2022-04-28 11:11:11,854 INFO L290 TraceCheckUtils]: 7: Hoare triple {2155#true} ~cond := #in~cond; {2155#true} is VALID [2022-04-28 11:11:11,854 INFO L272 TraceCheckUtils]: 6: Hoare triple {2155#true} call assume_abort_if_not((if ~X~0 >= 0 && ~X~0 <= 5 then 1 else 0)); {2155#true} is VALID [2022-04-28 11:11:11,854 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-28 11:11:11,854 INFO L272 TraceCheckUtils]: 4: Hoare triple {2155#true} call #t~ret8 := main(); {2155#true} is VALID [2022-04-28 11:11:11,855 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2155#true} {2155#true} #69#return; {2155#true} is VALID [2022-04-28 11:11:11,855 INFO L290 TraceCheckUtils]: 2: Hoare triple {2155#true} assume true; {2155#true} is VALID [2022-04-28 11:11:11,855 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-28 11:11:11,855 INFO L272 TraceCheckUtils]: 0: Hoare triple {2155#true} call ULTIMATE.init(); {2155#true} is VALID [2022-04-28 11:11:11,855 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-28 11:11:11,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:11:11,855 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1021371662] [2022-04-28 11:11:11,856 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 11:11:11,856 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [424134399] [2022-04-28 11:11:11,856 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [424134399] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 11:11:11,856 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 11:11:11,856 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 11] total 24 [2022-04-28 11:11:11,856 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:11:11,856 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [446780232] [2022-04-28 11:11:11,856 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [446780232] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:11:11,857 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:11:11,857 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-04-28 11:11:11,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [532552235] [2022-04-28 11:11:11,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:11:11,857 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 1.625) internal successors, (26), 16 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-28 11:11:11,857 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:11:11,858 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 18 states, 16 states have (on average 1.625) internal successors, (26), 16 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-28 11:11:11,905 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:11:11,905 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-04-28 11:11:11,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:11:11,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-04-28 11:11:11,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=466, Unknown=0, NotChecked=0, Total=552 [2022-04-28 11:11:11,906 INFO L87 Difference]: Start difference. First operand 43 states and 47 transitions. Second operand has 18 states, 16 states have (on average 1.625) internal successors, (26), 16 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-28 11:11:14,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:11:14,593 INFO L93 Difference]: Finished difference Result 81 states and 94 transitions. [2022-04-28 11:11:14,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-04-28 11:11:14,594 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 1.625) internal successors, (26), 16 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-28 11:11:14,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:11:14,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 16 states have (on average 1.625) internal successors, (26), 16 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-28 11:11:14,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 80 transitions. [2022-04-28 11:11:14,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 16 states have (on average 1.625) internal successors, (26), 16 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-28 11:11:14,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 80 transitions. [2022-04-28 11:11:14,599 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 80 transitions. [2022-04-28 11:11:14,693 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-28 11:11:14,694 INFO L225 Difference]: With dead ends: 81 [2022-04-28 11:11:14,694 INFO L226 Difference]: Without dead ends: 61 [2022-04-28 11:11:14,695 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 58 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 163 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=141, Invalid=729, Unknown=0, NotChecked=0, Total=870 [2022-04-28 11:11:14,696 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 39 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 495 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 537 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 495 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-04-28 11:11:14,696 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 147 Invalid, 537 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 495 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-04-28 11:11:14,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2022-04-28 11:11:14,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2022-04-28 11:11:14,797 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:11:14,798 INFO L82 GeneralOperation]: Start isEquivalent. First operand 61 states. Second operand has 61 states, 43 states have (on average 1.1162790697674418) internal successors, (48), 44 states have internal predecessors, (48), 10 states have call successors, (10), 8 states have call predecessors, (10), 7 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 11:11:14,798 INFO L74 IsIncluded]: Start isIncluded. First operand 61 states. Second operand has 61 states, 43 states have (on average 1.1162790697674418) internal successors, (48), 44 states have internal predecessors, (48), 10 states have call successors, (10), 8 states have call predecessors, (10), 7 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 11:11:14,798 INFO L87 Difference]: Start difference. First operand 61 states. Second operand has 61 states, 43 states have (on average 1.1162790697674418) internal successors, (48), 44 states have internal predecessors, (48), 10 states have call successors, (10), 8 states have call predecessors, (10), 7 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 11:11:14,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:11:14,800 INFO L93 Difference]: Finished difference Result 61 states and 66 transitions. [2022-04-28 11:11:14,800 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 66 transitions. [2022-04-28 11:11:14,801 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:11:14,801 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:11:14,801 INFO L74 IsIncluded]: Start isIncluded. First operand has 61 states, 43 states have (on average 1.1162790697674418) internal successors, (48), 44 states have internal predecessors, (48), 10 states have call successors, (10), 8 states have call predecessors, (10), 7 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 61 states. [2022-04-28 11:11:14,801 INFO L87 Difference]: Start difference. First operand has 61 states, 43 states have (on average 1.1162790697674418) internal successors, (48), 44 states have internal predecessors, (48), 10 states have call successors, (10), 8 states have call predecessors, (10), 7 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 61 states. [2022-04-28 11:11:14,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:11:14,803 INFO L93 Difference]: Finished difference Result 61 states and 66 transitions. [2022-04-28 11:11:14,803 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 66 transitions. [2022-04-28 11:11:14,803 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:11:14,804 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:11:14,804 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:11:14,804 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:11:14,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 43 states have (on average 1.1162790697674418) internal successors, (48), 44 states have internal predecessors, (48), 10 states have call successors, (10), 8 states have call predecessors, (10), 7 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 11:11:14,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 66 transitions. [2022-04-28 11:11:14,806 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 66 transitions. Word has length 41 [2022-04-28 11:11:14,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:11:14,806 INFO L495 AbstractCegarLoop]: Abstraction has 61 states and 66 transitions. [2022-04-28 11:11:14,806 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 1.625) internal successors, (26), 16 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-28 11:11:14,806 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 61 states and 66 transitions. [2022-04-28 11:11:14,894 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:11:14,894 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 66 transitions. [2022-04-28 11:11:14,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-04-28 11:11:14,894 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:11:14,894 INFO L195 NwaCegarLoop]: 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-28 11:11:14,919 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-04-28 11:11:15,107 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:11:15,108 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:11:15,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:11:15,108 INFO L85 PathProgramCache]: Analyzing trace with hash -1786011109, now seen corresponding path program 1 times [2022-04-28 11:11:15,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:11:15,108 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [267271809] [2022-04-28 11:11:15,108 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 11:11:15,109 INFO L85 PathProgramCache]: Analyzing trace with hash -1786011109, now seen corresponding path program 2 times [2022-04-28 11:11:15,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:11:15,109 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [771424148] [2022-04-28 11:11:15,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:11:15,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:11:15,122 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 11:11:15,122 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [638892299] [2022-04-28 11:11:15,122 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 11:11:15,122 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:11:15,122 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:11:15,123 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 11:11:15,131 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-04-28 11:11:15,177 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 11:11:15,177 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 11:11:15,178 INFO L263 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 43 conjunts are in the unsatisfiable core [2022-04-28 11:11:15,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:11:15,197 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 11:11:15,950 INFO L272 TraceCheckUtils]: 0: Hoare triple {2842#true} call ULTIMATE.init(); {2842#true} is VALID [2022-04-28 11:11:15,950 INFO L290 TraceCheckUtils]: 1: Hoare triple {2842#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); {2842#true} is VALID [2022-04-28 11:11:15,950 INFO L290 TraceCheckUtils]: 2: Hoare triple {2842#true} assume true; {2842#true} is VALID [2022-04-28 11:11:15,951 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2842#true} {2842#true} #69#return; {2842#true} is VALID [2022-04-28 11:11:15,951 INFO L272 TraceCheckUtils]: 4: Hoare triple {2842#true} call #t~ret8 := main(); {2842#true} is VALID [2022-04-28 11:11:15,951 INFO L290 TraceCheckUtils]: 5: Hoare triple {2842#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; {2842#true} is VALID [2022-04-28 11:11:15,951 INFO L272 TraceCheckUtils]: 6: Hoare triple {2842#true} call assume_abort_if_not((if ~X~0 >= 0 && ~X~0 <= 5 then 1 else 0)); {2842#true} is VALID [2022-04-28 11:11:15,951 INFO L290 TraceCheckUtils]: 7: Hoare triple {2842#true} ~cond := #in~cond; {2868#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-28 11:11:15,952 INFO L290 TraceCheckUtils]: 8: Hoare triple {2868#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {2872#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 11:11:15,952 INFO L290 TraceCheckUtils]: 9: Hoare triple {2872#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {2872#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 11:11:15,953 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2872#(not (= |assume_abort_if_not_#in~cond| 0))} {2842#true} #61#return; {2879#(and (<= 0 main_~X~0) (<= main_~X~0 5))} is VALID [2022-04-28 11:11:15,953 INFO L290 TraceCheckUtils]: 11: Hoare triple {2879#(and (<= 0 main_~X~0) (<= main_~X~0 5))} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~Y~0 := #t~nondet5;havoc #t~nondet5; {2879#(and (<= 0 main_~X~0) (<= main_~X~0 5))} is VALID [2022-04-28 11:11:15,953 INFO L272 TraceCheckUtils]: 12: Hoare triple {2879#(and (<= 0 main_~X~0) (<= main_~X~0 5))} call assume_abort_if_not((if ~Y~0 >= 0 && ~Y~0 <= 5 then 1 else 0)); {2842#true} is VALID [2022-04-28 11:11:15,954 INFO L290 TraceCheckUtils]: 13: Hoare triple {2842#true} ~cond := #in~cond; {2842#true} is VALID [2022-04-28 11:11:15,954 INFO L290 TraceCheckUtils]: 14: Hoare triple {2842#true} assume !(0 == ~cond); {2842#true} is VALID [2022-04-28 11:11:15,954 INFO L290 TraceCheckUtils]: 15: Hoare triple {2842#true} assume true; {2842#true} is VALID [2022-04-28 11:11:15,954 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {2842#true} {2879#(and (<= 0 main_~X~0) (<= main_~X~0 5))} #63#return; {2879#(and (<= 0 main_~X~0) (<= main_~X~0 5))} is VALID [2022-04-28 11:11:15,955 INFO L290 TraceCheckUtils]: 17: Hoare triple {2879#(and (<= 0 main_~X~0) (<= main_~X~0 5))} ~v~0 := 2 * ~Y~0 - ~X~0;~y~0 := 0;~x~0 := 0; {2901#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (<= 0 main_~X~0) (<= main_~X~0 5) (= main_~y~0 0))} is VALID [2022-04-28 11:11:15,955 INFO L290 TraceCheckUtils]: 18: Hoare triple {2901#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (<= 0 main_~X~0) (<= main_~X~0 5) (= main_~y~0 0))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {2901#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (<= 0 main_~X~0) (<= main_~X~0 5) (= main_~y~0 0))} is VALID [2022-04-28 11:11:15,956 INFO L272 TraceCheckUtils]: 19: Hoare triple {2901#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (<= 0 main_~X~0) (<= main_~X~0 5) (= 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)); {2842#true} is VALID [2022-04-28 11:11:15,956 INFO L290 TraceCheckUtils]: 20: Hoare triple {2842#true} ~cond := #in~cond; {2842#true} is VALID [2022-04-28 11:11:15,956 INFO L290 TraceCheckUtils]: 21: Hoare triple {2842#true} assume !(0 == ~cond); {2842#true} is VALID [2022-04-28 11:11:15,956 INFO L290 TraceCheckUtils]: 22: Hoare triple {2842#true} assume true; {2842#true} is VALID [2022-04-28 11:11:15,957 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {2842#true} {2901#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (<= 0 main_~X~0) (<= main_~X~0 5) (= main_~y~0 0))} #65#return; {2901#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (<= 0 main_~X~0) (<= main_~X~0 5) (= main_~y~0 0))} is VALID [2022-04-28 11:11:15,957 INFO L290 TraceCheckUtils]: 24: Hoare triple {2901#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (<= 0 main_~X~0) (<= main_~X~0 5) (= main_~y~0 0))} assume !!(~x~0 <= ~X~0); {2901#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (<= 0 main_~X~0) (<= main_~X~0 5) (= main_~y~0 0))} is VALID [2022-04-28 11:11:15,958 INFO L290 TraceCheckUtils]: 25: Hoare triple {2901#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (<= 0 main_~X~0) (<= main_~X~0 5) (= main_~y~0 0))} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {2926#(and (= main_~x~0 0) (< (* main_~Y~0 2) main_~X~0) (= main_~v~0 (+ (* (- 1) main_~X~0) (* main_~Y~0 4))) (<= 0 main_~X~0) (<= main_~X~0 5) (= main_~y~0 0))} is VALID [2022-04-28 11:11:15,959 INFO L290 TraceCheckUtils]: 26: Hoare triple {2926#(and (= main_~x~0 0) (< (* main_~Y~0 2) main_~X~0) (= main_~v~0 (+ (* (- 1) main_~X~0) (* main_~Y~0 4))) (<= 0 main_~X~0) (<= main_~X~0 5) (= main_~y~0 0))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {2930#(and (= (+ (- 1) main_~x~0) 0) (< (* main_~Y~0 2) main_~X~0) (= main_~v~0 (+ (* (- 1) main_~X~0) (* main_~Y~0 4))) (<= 0 main_~X~0) (<= main_~X~0 5) (= main_~y~0 0))} is VALID [2022-04-28 11:11:15,959 INFO L290 TraceCheckUtils]: 27: Hoare triple {2930#(and (= (+ (- 1) main_~x~0) 0) (< (* main_~Y~0 2) main_~X~0) (= main_~v~0 (+ (* (- 1) main_~X~0) (* main_~Y~0 4))) (<= 0 main_~X~0) (<= main_~X~0 5) (= main_~y~0 0))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {2934#(and (= (+ (- 1) main_~x~0) 0) (< (* main_~Y~0 2) main_~X~0) (= main_~v~0 (+ (* (- 1) main_~X~0) (* main_~Y~0 4))) (<= 0 main_~X~0) (<= main_~X~0 5) (= (* 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-28 11:11:15,960 INFO L272 TraceCheckUtils]: 28: Hoare triple {2934#(and (= (+ (- 1) main_~x~0) 0) (< (* main_~Y~0 2) main_~X~0) (= main_~v~0 (+ (* (- 1) main_~X~0) (* main_~Y~0 4))) (<= 0 main_~X~0) (<= main_~X~0 5) (= (* 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)); {2842#true} is VALID [2022-04-28 11:11:15,960 INFO L290 TraceCheckUtils]: 29: Hoare triple {2842#true} ~cond := #in~cond; {2941#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:11:15,960 INFO L290 TraceCheckUtils]: 30: Hoare triple {2941#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {2945#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:11:15,961 INFO L290 TraceCheckUtils]: 31: Hoare triple {2945#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {2945#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:11:15,962 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {2945#(not (= |__VERIFIER_assert_#in~cond| 0))} {2934#(and (= (+ (- 1) main_~x~0) 0) (< (* main_~Y~0 2) main_~X~0) (= main_~v~0 (+ (* (- 1) main_~X~0) (* main_~Y~0 4))) (<= 0 main_~X~0) (<= main_~X~0 5) (= (* main_~X~0 main_~y~0) main_~xy~0) (= main_~y~0 0) (= main_~yx~0 (* main_~Y~0 main_~x~0)))} #65#return; {2930#(and (= (+ (- 1) main_~x~0) 0) (< (* main_~Y~0 2) main_~X~0) (= main_~v~0 (+ (* (- 1) main_~X~0) (* main_~Y~0 4))) (<= 0 main_~X~0) (<= main_~X~0 5) (= main_~y~0 0))} is VALID [2022-04-28 11:11:15,963 INFO L290 TraceCheckUtils]: 33: Hoare triple {2930#(and (= (+ (- 1) main_~x~0) 0) (< (* main_~Y~0 2) main_~X~0) (= main_~v~0 (+ (* (- 1) main_~X~0) (* main_~Y~0 4))) (<= 0 main_~X~0) (<= main_~X~0 5) (= main_~y~0 0))} assume !!(~x~0 <= ~X~0); {2930#(and (= (+ (- 1) main_~x~0) 0) (< (* main_~Y~0 2) main_~X~0) (= main_~v~0 (+ (* (- 1) main_~X~0) (* main_~Y~0 4))) (<= 0 main_~X~0) (<= main_~X~0 5) (= main_~y~0 0))} is VALID [2022-04-28 11:11:15,964 INFO L290 TraceCheckUtils]: 34: Hoare triple {2930#(and (= (+ (- 1) main_~x~0) 0) (< (* main_~Y~0 2) main_~X~0) (= main_~v~0 (+ (* (- 1) main_~X~0) (* main_~Y~0 4))) (<= 0 main_~X~0) (<= main_~X~0 5) (= 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; {2958#(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 1) (<= (* main_~Y~0 2) (+ main_~v~0 (* main_~X~0 2))) (<= main_~X~0 5))} is VALID [2022-04-28 11:11:15,964 INFO L290 TraceCheckUtils]: 35: Hoare triple {2958#(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 1) (<= (* main_~Y~0 2) (+ main_~v~0 (* main_~X~0 2))) (<= main_~X~0 5))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {2962#(and (= (+ (- 1) main_~x~0) 1) (= (+ 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) (+ main_~v~0 (* main_~X~0 2))) (<= main_~X~0 5))} is VALID [2022-04-28 11:11:15,965 INFO L290 TraceCheckUtils]: 36: Hoare triple {2962#(and (= (+ (- 1) main_~x~0) 1) (= (+ 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) (+ main_~v~0 (* main_~X~0 2))) (<= main_~X~0 5))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {2966#(and (= (+ main_~v~0 (* main_~X~0 3)) (* main_~Y~0 6)) (< (* main_~Y~0 2) main_~X~0) (= (* main_~Y~0 2) main_~yx~0) (= main_~X~0 main_~xy~0) (<= (* main_~Y~0 2) (+ main_~v~0 (* main_~X~0 2))) (<= main_~X~0 5))} is VALID [2022-04-28 11:11:15,966 INFO L272 TraceCheckUtils]: 37: Hoare triple {2966#(and (= (+ main_~v~0 (* main_~X~0 3)) (* main_~Y~0 6)) (< (* main_~Y~0 2) main_~X~0) (= (* main_~Y~0 2) main_~yx~0) (= main_~X~0 main_~xy~0) (<= (* main_~Y~0 2) (+ main_~v~0 (* main_~X~0 2))) (<= main_~X~0 5))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {2970#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 11:11:15,967 INFO L290 TraceCheckUtils]: 38: Hoare triple {2970#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2974#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:11:15,967 INFO L290 TraceCheckUtils]: 39: Hoare triple {2974#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2843#false} is VALID [2022-04-28 11:11:15,967 INFO L290 TraceCheckUtils]: 40: Hoare triple {2843#false} assume !false; {2843#false} is VALID [2022-04-28 11:11:15,968 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 13 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 11:11:15,968 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 11:11:20,302 INFO L290 TraceCheckUtils]: 40: Hoare triple {2843#false} assume !false; {2843#false} is VALID [2022-04-28 11:11:20,302 INFO L290 TraceCheckUtils]: 39: Hoare triple {2974#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2843#false} is VALID [2022-04-28 11:11:20,303 INFO L290 TraceCheckUtils]: 38: Hoare triple {2970#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2974#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:11:20,303 INFO L272 TraceCheckUtils]: 37: Hoare triple {2990#(= (+ (* 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)); {2970#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 11:11:20,304 INFO L290 TraceCheckUtils]: 36: Hoare triple {2994#(= (+ (* 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; {2990#(= (+ (* 2 main_~xy~0) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 main_~yx~0)))} is VALID [2022-04-28 11:11:20,305 INFO L290 TraceCheckUtils]: 35: Hoare triple {2998#(= (+ (* (* 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; {2994#(= (+ (* 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-28 11:11:20,307 INFO L290 TraceCheckUtils]: 34: Hoare triple {3002#(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; {2998#(= (+ (* (* 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-28 11:11:20,307 INFO L290 TraceCheckUtils]: 33: Hoare triple {3002#(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 !!(~x~0 <= ~X~0); {3002#(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-28 11:11:20,308 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {2945#(not (= |__VERIFIER_assert_#in~cond| 0))} {3009#(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)))))} #65#return; {3002#(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-28 11:11:20,309 INFO L290 TraceCheckUtils]: 31: Hoare triple {2945#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {2945#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:11:20,309 INFO L290 TraceCheckUtils]: 30: Hoare triple {3019#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {2945#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:11:20,309 INFO L290 TraceCheckUtils]: 29: Hoare triple {2842#true} ~cond := #in~cond; {3019#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 11:11:20,309 INFO L272 TraceCheckUtils]: 28: Hoare triple {3009#(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)))))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {2842#true} is VALID [2022-04-28 11:11:20,310 INFO L290 TraceCheckUtils]: 27: Hoare triple {2842#true} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {3009#(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)))))} is VALID [2022-04-28 11:11:20,310 INFO L290 TraceCheckUtils]: 26: Hoare triple {2842#true} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {2842#true} is VALID [2022-04-28 11:11:20,310 INFO L290 TraceCheckUtils]: 25: Hoare triple {2842#true} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {2842#true} is VALID [2022-04-28 11:11:20,310 INFO L290 TraceCheckUtils]: 24: Hoare triple {2842#true} assume !!(~x~0 <= ~X~0); {2842#true} is VALID [2022-04-28 11:11:20,310 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {2842#true} {2842#true} #65#return; {2842#true} is VALID [2022-04-28 11:11:20,311 INFO L290 TraceCheckUtils]: 22: Hoare triple {2842#true} assume true; {2842#true} is VALID [2022-04-28 11:11:20,311 INFO L290 TraceCheckUtils]: 21: Hoare triple {2842#true} assume !(0 == ~cond); {2842#true} is VALID [2022-04-28 11:11:20,311 INFO L290 TraceCheckUtils]: 20: Hoare triple {2842#true} ~cond := #in~cond; {2842#true} is VALID [2022-04-28 11:11:20,311 INFO L272 TraceCheckUtils]: 19: Hoare triple {2842#true} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {2842#true} is VALID [2022-04-28 11:11:20,311 INFO L290 TraceCheckUtils]: 18: Hoare triple {2842#true} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {2842#true} is VALID [2022-04-28 11:11:20,311 INFO L290 TraceCheckUtils]: 17: Hoare triple {2842#true} ~v~0 := 2 * ~Y~0 - ~X~0;~y~0 := 0;~x~0 := 0; {2842#true} is VALID [2022-04-28 11:11:20,311 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {2842#true} {2842#true} #63#return; {2842#true} is VALID [2022-04-28 11:11:20,311 INFO L290 TraceCheckUtils]: 15: Hoare triple {2842#true} assume true; {2842#true} is VALID [2022-04-28 11:11:20,311 INFO L290 TraceCheckUtils]: 14: Hoare triple {2842#true} assume !(0 == ~cond); {2842#true} is VALID [2022-04-28 11:11:20,311 INFO L290 TraceCheckUtils]: 13: Hoare triple {2842#true} ~cond := #in~cond; {2842#true} is VALID [2022-04-28 11:11:20,311 INFO L272 TraceCheckUtils]: 12: Hoare triple {2842#true} call assume_abort_if_not((if ~Y~0 >= 0 && ~Y~0 <= 5 then 1 else 0)); {2842#true} is VALID [2022-04-28 11:11:20,312 INFO L290 TraceCheckUtils]: 11: Hoare triple {2842#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~Y~0 := #t~nondet5;havoc #t~nondet5; {2842#true} is VALID [2022-04-28 11:11:20,312 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2842#true} {2842#true} #61#return; {2842#true} is VALID [2022-04-28 11:11:20,312 INFO L290 TraceCheckUtils]: 9: Hoare triple {2842#true} assume true; {2842#true} is VALID [2022-04-28 11:11:20,312 INFO L290 TraceCheckUtils]: 8: Hoare triple {2842#true} assume !(0 == ~cond); {2842#true} is VALID [2022-04-28 11:11:20,312 INFO L290 TraceCheckUtils]: 7: Hoare triple {2842#true} ~cond := #in~cond; {2842#true} is VALID [2022-04-28 11:11:20,312 INFO L272 TraceCheckUtils]: 6: Hoare triple {2842#true} call assume_abort_if_not((if ~X~0 >= 0 && ~X~0 <= 5 then 1 else 0)); {2842#true} is VALID [2022-04-28 11:11:20,312 INFO L290 TraceCheckUtils]: 5: Hoare triple {2842#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; {2842#true} is VALID [2022-04-28 11:11:20,312 INFO L272 TraceCheckUtils]: 4: Hoare triple {2842#true} call #t~ret8 := main(); {2842#true} is VALID [2022-04-28 11:11:20,312 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2842#true} {2842#true} #69#return; {2842#true} is VALID [2022-04-28 11:11:20,313 INFO L290 TraceCheckUtils]: 2: Hoare triple {2842#true} assume true; {2842#true} is VALID [2022-04-28 11:11:20,313 INFO L290 TraceCheckUtils]: 1: Hoare triple {2842#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); {2842#true} is VALID [2022-04-28 11:11:20,313 INFO L272 TraceCheckUtils]: 0: Hoare triple {2842#true} call ULTIMATE.init(); {2842#true} is VALID [2022-04-28 11:11:20,313 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-28 11:11:20,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:11:20,313 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [771424148] [2022-04-28 11:11:20,313 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 11:11:20,313 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [638892299] [2022-04-28 11:11:20,314 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [638892299] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 11:11:20,314 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 11:11:20,314 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 11] total 22 [2022-04-28 11:11:20,314 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:11:20,314 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [267271809] [2022-04-28 11:11:20,314 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [267271809] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:11:20,314 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:11:20,314 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-04-28 11:11:20,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [577226377] [2022-04-28 11:11:20,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:11:20,315 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 15 states have internal predecessors, (29), 5 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) Word has length 41 [2022-04-28 11:11:20,315 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:11:20,315 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 16 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 15 states have internal predecessors, (29), 5 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-28 11:11:20,349 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:11:20,350 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-28 11:11:20,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:11:20,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-28 11:11:20,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=386, Unknown=0, NotChecked=0, Total=462 [2022-04-28 11:11:20,350 INFO L87 Difference]: Start difference. First operand 61 states and 66 transitions. Second operand has 16 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 15 states have internal predecessors, (29), 5 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-28 11:11:21,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:11:21,756 INFO L93 Difference]: Finished difference Result 83 states and 93 transitions. [2022-04-28 11:11:21,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-04-28 11:11:21,756 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 15 states have internal predecessors, (29), 5 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) Word has length 41 [2022-04-28 11:11:21,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:11:21,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 15 states have internal predecessors, (29), 5 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-28 11:11:21,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 70 transitions. [2022-04-28 11:11:21,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 15 states have internal predecessors, (29), 5 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-28 11:11:21,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 70 transitions. [2022-04-28 11:11:21,759 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 70 transitions. [2022-04-28 11:11:21,845 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-28 11:11:21,846 INFO L225 Difference]: With dead ends: 83 [2022-04-28 11:11:21,846 INFO L226 Difference]: Without dead ends: 70 [2022-04-28 11:11:21,847 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 59 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=102, Invalid=548, Unknown=0, NotChecked=0, Total=650 [2022-04-28 11:11:21,847 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 29 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 353 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 367 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 353 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-04-28 11:11:21,848 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 140 Invalid, 367 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 353 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-28 11:11:21,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2022-04-28 11:11:22,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2022-04-28 11:11:22,027 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:11:22,028 INFO L82 GeneralOperation]: Start isEquivalent. First operand 70 states. Second operand has 70 states, 50 states have (on average 1.1) internal successors, (55), 51 states have internal predecessors, (55), 11 states have call successors, (11), 9 states have call predecessors, (11), 8 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-28 11:11:22,028 INFO L74 IsIncluded]: Start isIncluded. First operand 70 states. Second operand has 70 states, 50 states have (on average 1.1) internal successors, (55), 51 states have internal predecessors, (55), 11 states have call successors, (11), 9 states have call predecessors, (11), 8 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-28 11:11:22,029 INFO L87 Difference]: Start difference. First operand 70 states. Second operand has 70 states, 50 states have (on average 1.1) internal successors, (55), 51 states have internal predecessors, (55), 11 states have call successors, (11), 9 states have call predecessors, (11), 8 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-28 11:11:22,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:11:22,031 INFO L93 Difference]: Finished difference Result 70 states and 75 transitions. [2022-04-28 11:11:22,031 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 75 transitions. [2022-04-28 11:11:22,031 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:11:22,031 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:11:22,032 INFO L74 IsIncluded]: Start isIncluded. First operand has 70 states, 50 states have (on average 1.1) internal successors, (55), 51 states have internal predecessors, (55), 11 states have call successors, (11), 9 states have call predecessors, (11), 8 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand 70 states. [2022-04-28 11:11:22,032 INFO L87 Difference]: Start difference. First operand has 70 states, 50 states have (on average 1.1) internal successors, (55), 51 states have internal predecessors, (55), 11 states have call successors, (11), 9 states have call predecessors, (11), 8 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand 70 states. [2022-04-28 11:11:22,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:11:22,037 INFO L93 Difference]: Finished difference Result 70 states and 75 transitions. [2022-04-28 11:11:22,037 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 75 transitions. [2022-04-28 11:11:22,037 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:11:22,037 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:11:22,037 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:11:22,037 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:11:22,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 50 states have (on average 1.1) internal successors, (55), 51 states have internal predecessors, (55), 11 states have call successors, (11), 9 states have call predecessors, (11), 8 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-28 11:11:22,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 75 transitions. [2022-04-28 11:11:22,040 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 75 transitions. Word has length 41 [2022-04-28 11:11:22,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:11:22,040 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 75 transitions. [2022-04-28 11:11:22,040 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 15 states have internal predecessors, (29), 5 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-28 11:11:22,040 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 70 states and 75 transitions. [2022-04-28 11:11:22,162 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 75 edges. 75 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:11:22,163 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 75 transitions. [2022-04-28 11:11:22,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-04-28 11:11:22,163 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:11:22,163 INFO L195 NwaCegarLoop]: 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-28 11:11:22,190 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-04-28 11:11:22,364 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:11:22,364 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:11:22,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:11:22,365 INFO L85 PathProgramCache]: Analyzing trace with hash -287119529, now seen corresponding path program 3 times [2022-04-28 11:11:22,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:11:22,365 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1437081317] [2022-04-28 11:11:22,365 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 11:11:22,365 INFO L85 PathProgramCache]: Analyzing trace with hash -287119529, now seen corresponding path program 4 times [2022-04-28 11:11:22,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:11:22,365 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1895002943] [2022-04-28 11:11:22,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:11:22,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:11:22,378 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 11:11:22,378 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1891099008] [2022-04-28 11:11:22,379 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 11:11:22,379 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:11:22,379 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:11:22,386 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 11:11:22,411 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-04-28 11:11:22,432 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 11:11:22,432 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 11:11:22,433 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 32 conjunts are in the unsatisfiable core [2022-04-28 11:11:22,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:11:22,443 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 11:11:22,788 INFO L272 TraceCheckUtils]: 0: Hoare triple {3563#true} call ULTIMATE.init(); {3563#true} is VALID [2022-04-28 11:11:22,789 INFO L290 TraceCheckUtils]: 1: Hoare triple {3563#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); {3563#true} is VALID [2022-04-28 11:11:22,789 INFO L290 TraceCheckUtils]: 2: Hoare triple {3563#true} assume true; {3563#true} is VALID [2022-04-28 11:11:22,789 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3563#true} {3563#true} #69#return; {3563#true} is VALID [2022-04-28 11:11:22,789 INFO L272 TraceCheckUtils]: 4: Hoare triple {3563#true} call #t~ret8 := main(); {3563#true} is VALID [2022-04-28 11:11:22,789 INFO L290 TraceCheckUtils]: 5: Hoare triple {3563#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; {3563#true} is VALID [2022-04-28 11:11:22,789 INFO L272 TraceCheckUtils]: 6: Hoare triple {3563#true} call assume_abort_if_not((if ~X~0 >= 0 && ~X~0 <= 5 then 1 else 0)); {3563#true} is VALID [2022-04-28 11:11:22,789 INFO L290 TraceCheckUtils]: 7: Hoare triple {3563#true} ~cond := #in~cond; {3563#true} is VALID [2022-04-28 11:11:22,789 INFO L290 TraceCheckUtils]: 8: Hoare triple {3563#true} assume !(0 == ~cond); {3563#true} is VALID [2022-04-28 11:11:22,790 INFO L290 TraceCheckUtils]: 9: Hoare triple {3563#true} assume true; {3563#true} is VALID [2022-04-28 11:11:22,790 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3563#true} {3563#true} #61#return; {3563#true} is VALID [2022-04-28 11:11:22,790 INFO L290 TraceCheckUtils]: 11: Hoare triple {3563#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~Y~0 := #t~nondet5;havoc #t~nondet5; {3563#true} is VALID [2022-04-28 11:11:22,790 INFO L272 TraceCheckUtils]: 12: Hoare triple {3563#true} call assume_abort_if_not((if ~Y~0 >= 0 && ~Y~0 <= 5 then 1 else 0)); {3563#true} is VALID [2022-04-28 11:11:22,790 INFO L290 TraceCheckUtils]: 13: Hoare triple {3563#true} ~cond := #in~cond; {3563#true} is VALID [2022-04-28 11:11:22,790 INFO L290 TraceCheckUtils]: 14: Hoare triple {3563#true} assume !(0 == ~cond); {3563#true} is VALID [2022-04-28 11:11:22,790 INFO L290 TraceCheckUtils]: 15: Hoare triple {3563#true} assume true; {3563#true} is VALID [2022-04-28 11:11:22,790 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {3563#true} {3563#true} #63#return; {3563#true} is VALID [2022-04-28 11:11:22,790 INFO L290 TraceCheckUtils]: 17: Hoare triple {3563#true} ~v~0 := 2 * ~Y~0 - ~X~0;~y~0 := 0;~x~0 := 0; {3619#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (= main_~y~0 0))} is VALID [2022-04-28 11:11:22,791 INFO L290 TraceCheckUtils]: 18: Hoare triple {3619#(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; {3619#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (= main_~y~0 0))} is VALID [2022-04-28 11:11:22,791 INFO L272 TraceCheckUtils]: 19: Hoare triple {3619#(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)); {3563#true} is VALID [2022-04-28 11:11:22,791 INFO L290 TraceCheckUtils]: 20: Hoare triple {3563#true} ~cond := #in~cond; {3563#true} is VALID [2022-04-28 11:11:22,791 INFO L290 TraceCheckUtils]: 21: Hoare triple {3563#true} assume !(0 == ~cond); {3563#true} is VALID [2022-04-28 11:11:22,791 INFO L290 TraceCheckUtils]: 22: Hoare triple {3563#true} assume true; {3563#true} is VALID [2022-04-28 11:11:22,792 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {3563#true} {3619#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (= main_~y~0 0))} #65#return; {3619#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (= main_~y~0 0))} is VALID [2022-04-28 11:11:22,792 INFO L290 TraceCheckUtils]: 24: Hoare triple {3619#(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); {3619#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (= main_~y~0 0))} is VALID [2022-04-28 11:11:22,793 INFO L290 TraceCheckUtils]: 25: Hoare triple {3619#(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; {3644#(and (= main_~x~0 0) (= (+ (- 1) main_~y~0) 0) (= main_~v~0 (+ (* main_~X~0 (- 3)) (* main_~Y~0 4))))} is VALID [2022-04-28 11:11:22,793 INFO L290 TraceCheckUtils]: 26: Hoare triple {3644#(and (= main_~x~0 0) (= (+ (- 1) main_~y~0) 0) (= main_~v~0 (+ (* main_~X~0 (- 3)) (* main_~Y~0 4))))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {3648#(and (= (+ (- 1) main_~x~0) 0) (= (+ (- 1) main_~y~0) 0) (= main_~v~0 (+ (* main_~X~0 (- 3)) (* main_~Y~0 4))))} is VALID [2022-04-28 11:11:22,794 INFO L290 TraceCheckUtils]: 27: Hoare triple {3648#(and (= (+ (- 1) main_~x~0) 0) (= (+ (- 1) main_~y~0) 0) (= main_~v~0 (+ (* main_~X~0 (- 3)) (* main_~Y~0 4))))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {3652#(and (= (+ (- 1) main_~x~0) 0) (= (+ (- 1) main_~y~0) 0) (= 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)))} is VALID [2022-04-28 11:11:22,794 INFO L272 TraceCheckUtils]: 28: Hoare triple {3652#(and (= (+ (- 1) main_~x~0) 0) (= (+ (- 1) main_~y~0) 0) (= 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)))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {3563#true} is VALID [2022-04-28 11:11:22,794 INFO L290 TraceCheckUtils]: 29: Hoare triple {3563#true} ~cond := #in~cond; {3659#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:11:22,795 INFO L290 TraceCheckUtils]: 30: Hoare triple {3659#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {3663#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:11:22,795 INFO L290 TraceCheckUtils]: 31: Hoare triple {3663#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {3663#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:11:22,796 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {3663#(not (= |__VERIFIER_assert_#in~cond| 0))} {3652#(and (= (+ (- 1) main_~x~0) 0) (= (+ (- 1) main_~y~0) 0) (= 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)))} #65#return; {3648#(and (= (+ (- 1) main_~x~0) 0) (= (+ (- 1) main_~y~0) 0) (= main_~v~0 (+ (* main_~X~0 (- 3)) (* main_~Y~0 4))))} is VALID [2022-04-28 11:11:22,796 INFO L290 TraceCheckUtils]: 33: Hoare triple {3648#(and (= (+ (- 1) main_~x~0) 0) (= (+ (- 1) main_~y~0) 0) (= main_~v~0 (+ (* main_~X~0 (- 3)) (* main_~Y~0 4))))} assume !!(~x~0 <= ~X~0); {3648#(and (= (+ (- 1) main_~x~0) 0) (= (+ (- 1) main_~y~0) 0) (= main_~v~0 (+ (* main_~X~0 (- 3)) (* main_~Y~0 4))))} is VALID [2022-04-28 11:11:22,797 INFO L290 TraceCheckUtils]: 34: Hoare triple {3648#(and (= (+ (- 1) main_~x~0) 0) (= (+ (- 1) main_~y~0) 0) (= main_~v~0 (+ (* main_~X~0 (- 3)) (* main_~Y~0 4))))} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {3676#(and (= (+ (- 1) main_~x~0) 0) (= (+ (- 1) main_~y~0) 0) (= (+ (* main_~X~0 (- 3)) (* main_~Y~0 6)) main_~v~0))} is VALID [2022-04-28 11:11:22,797 INFO L290 TraceCheckUtils]: 35: Hoare triple {3676#(and (= (+ (- 1) main_~x~0) 0) (= (+ (- 1) main_~y~0) 0) (= (+ (* main_~X~0 (- 3)) (* main_~Y~0 6)) main_~v~0))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {3680#(and (= (+ (- 2) main_~x~0) 0) (= (+ (- 1) main_~y~0) 0) (= (+ (* main_~X~0 (- 3)) (* main_~Y~0 6)) main_~v~0))} is VALID [2022-04-28 11:11:22,798 INFO L290 TraceCheckUtils]: 36: Hoare triple {3680#(and (= (+ (- 2) main_~x~0) 0) (= (+ (- 1) main_~y~0) 0) (= (+ (* main_~X~0 (- 3)) (* main_~Y~0 6)) main_~v~0))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {3684#(and (= (+ (* main_~X~0 (- 3)) (* main_~Y~0 6)) main_~v~0) (= (* main_~Y~0 2) main_~yx~0) (= main_~X~0 main_~xy~0))} is VALID [2022-04-28 11:11:22,799 INFO L272 TraceCheckUtils]: 37: Hoare triple {3684#(and (= (+ (* main_~X~0 (- 3)) (* main_~Y~0 6)) main_~v~0) (= (* 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)); {3688#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 11:11:22,799 INFO L290 TraceCheckUtils]: 38: Hoare triple {3688#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3692#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:11:22,799 INFO L290 TraceCheckUtils]: 39: Hoare triple {3692#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3564#false} is VALID [2022-04-28 11:11:22,799 INFO L290 TraceCheckUtils]: 40: Hoare triple {3564#false} assume !false; {3564#false} is VALID [2022-04-28 11:11:22,800 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-28 11:11:22,800 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 11:11:26,904 INFO L290 TraceCheckUtils]: 40: Hoare triple {3564#false} assume !false; {3564#false} is VALID [2022-04-28 11:11:26,905 INFO L290 TraceCheckUtils]: 39: Hoare triple {3692#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3564#false} is VALID [2022-04-28 11:11:26,905 INFO L290 TraceCheckUtils]: 38: Hoare triple {3688#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3692#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:11:26,906 INFO L272 TraceCheckUtils]: 37: Hoare triple {3708#(= (+ (* 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)); {3688#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 11:11:26,906 INFO L290 TraceCheckUtils]: 36: Hoare triple {3712#(= (+ (* 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; {3708#(= (+ (* 2 main_~xy~0) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 main_~yx~0)))} is VALID [2022-04-28 11:11:26,908 INFO L290 TraceCheckUtils]: 35: Hoare triple {3716#(= (+ (* (* 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; {3712#(= (+ (* 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-28 11:11:26,908 INFO L290 TraceCheckUtils]: 34: Hoare triple {3712#(= (+ (* 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; {3716#(= (+ (* (* 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-28 11:11:26,909 INFO L290 TraceCheckUtils]: 33: Hoare triple {3712#(= (+ (* 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); {3712#(= (+ (* 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-28 11:11:26,910 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {3663#(not (= |__VERIFIER_assert_#in~cond| 0))} {3726#(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; {3712#(= (+ (* 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-28 11:11:26,910 INFO L290 TraceCheckUtils]: 31: Hoare triple {3663#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {3663#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:11:26,910 INFO L290 TraceCheckUtils]: 30: Hoare triple {3736#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {3663#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:11:26,911 INFO L290 TraceCheckUtils]: 29: Hoare triple {3563#true} ~cond := #in~cond; {3736#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 11:11:26,911 INFO L272 TraceCheckUtils]: 28: Hoare triple {3726#(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)); {3563#true} is VALID [2022-04-28 11:11:26,911 INFO L290 TraceCheckUtils]: 27: Hoare triple {3563#true} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {3726#(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-28 11:11:26,912 INFO L290 TraceCheckUtils]: 26: Hoare triple {3563#true} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {3563#true} is VALID [2022-04-28 11:11:26,912 INFO L290 TraceCheckUtils]: 25: Hoare triple {3563#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; {3563#true} is VALID [2022-04-28 11:11:26,912 INFO L290 TraceCheckUtils]: 24: Hoare triple {3563#true} assume !!(~x~0 <= ~X~0); {3563#true} is VALID [2022-04-28 11:11:26,912 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {3563#true} {3563#true} #65#return; {3563#true} is VALID [2022-04-28 11:11:26,912 INFO L290 TraceCheckUtils]: 22: Hoare triple {3563#true} assume true; {3563#true} is VALID [2022-04-28 11:11:26,912 INFO L290 TraceCheckUtils]: 21: Hoare triple {3563#true} assume !(0 == ~cond); {3563#true} is VALID [2022-04-28 11:11:26,912 INFO L290 TraceCheckUtils]: 20: Hoare triple {3563#true} ~cond := #in~cond; {3563#true} is VALID [2022-04-28 11:11:26,912 INFO L272 TraceCheckUtils]: 19: Hoare triple {3563#true} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {3563#true} is VALID [2022-04-28 11:11:26,912 INFO L290 TraceCheckUtils]: 18: Hoare triple {3563#true} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {3563#true} is VALID [2022-04-28 11:11:26,912 INFO L290 TraceCheckUtils]: 17: Hoare triple {3563#true} ~v~0 := 2 * ~Y~0 - ~X~0;~y~0 := 0;~x~0 := 0; {3563#true} is VALID [2022-04-28 11:11:26,912 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {3563#true} {3563#true} #63#return; {3563#true} is VALID [2022-04-28 11:11:26,912 INFO L290 TraceCheckUtils]: 15: Hoare triple {3563#true} assume true; {3563#true} is VALID [2022-04-28 11:11:26,913 INFO L290 TraceCheckUtils]: 14: Hoare triple {3563#true} assume !(0 == ~cond); {3563#true} is VALID [2022-04-28 11:11:26,913 INFO L290 TraceCheckUtils]: 13: Hoare triple {3563#true} ~cond := #in~cond; {3563#true} is VALID [2022-04-28 11:11:26,913 INFO L272 TraceCheckUtils]: 12: Hoare triple {3563#true} call assume_abort_if_not((if ~Y~0 >= 0 && ~Y~0 <= 5 then 1 else 0)); {3563#true} is VALID [2022-04-28 11:11:26,913 INFO L290 TraceCheckUtils]: 11: Hoare triple {3563#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~Y~0 := #t~nondet5;havoc #t~nondet5; {3563#true} is VALID [2022-04-28 11:11:26,913 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3563#true} {3563#true} #61#return; {3563#true} is VALID [2022-04-28 11:11:26,913 INFO L290 TraceCheckUtils]: 9: Hoare triple {3563#true} assume true; {3563#true} is VALID [2022-04-28 11:11:26,913 INFO L290 TraceCheckUtils]: 8: Hoare triple {3563#true} assume !(0 == ~cond); {3563#true} is VALID [2022-04-28 11:11:26,913 INFO L290 TraceCheckUtils]: 7: Hoare triple {3563#true} ~cond := #in~cond; {3563#true} is VALID [2022-04-28 11:11:26,913 INFO L272 TraceCheckUtils]: 6: Hoare triple {3563#true} call assume_abort_if_not((if ~X~0 >= 0 && ~X~0 <= 5 then 1 else 0)); {3563#true} is VALID [2022-04-28 11:11:26,913 INFO L290 TraceCheckUtils]: 5: Hoare triple {3563#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; {3563#true} is VALID [2022-04-28 11:11:26,914 INFO L272 TraceCheckUtils]: 4: Hoare triple {3563#true} call #t~ret8 := main(); {3563#true} is VALID [2022-04-28 11:11:26,914 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3563#true} {3563#true} #69#return; {3563#true} is VALID [2022-04-28 11:11:26,914 INFO L290 TraceCheckUtils]: 2: Hoare triple {3563#true} assume true; {3563#true} is VALID [2022-04-28 11:11:26,914 INFO L290 TraceCheckUtils]: 1: Hoare triple {3563#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); {3563#true} is VALID [2022-04-28 11:11:26,914 INFO L272 TraceCheckUtils]: 0: Hoare triple {3563#true} call ULTIMATE.init(); {3563#true} is VALID [2022-04-28 11:11:26,914 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-28 11:11:26,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:11:26,915 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1895002943] [2022-04-28 11:11:26,915 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 11:11:26,915 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1891099008] [2022-04-28 11:11:26,915 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1891099008] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 11:11:26,915 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 11:11:26,915 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10] total 18 [2022-04-28 11:11:26,915 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:11:26,915 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1437081317] [2022-04-28 11:11:26,915 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1437081317] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:11:26,916 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:11:26,916 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-28 11:11:26,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1992581706] [2022-04-28 11:11:26,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:11:26,916 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-28 11:11:26,916 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:11:26,917 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-28 11:11:26,949 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:11:26,949 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-28 11:11:26,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:11:26,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-28 11:11:26,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=255, Unknown=0, NotChecked=0, Total=306 [2022-04-28 11:11:26,950 INFO L87 Difference]: Start difference. First operand 70 states and 75 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-28 11:11:28,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:11:28,098 INFO L93 Difference]: Finished difference Result 84 states and 92 transitions. [2022-04-28 11:11:28,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-28 11:11:28,098 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-28 11:11:28,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:11:28,098 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-28 11:11:28,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 58 transitions. [2022-04-28 11:11:28,100 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-28 11:11:28,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 58 transitions. [2022-04-28 11:11:28,101 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 58 transitions. [2022-04-28 11:11:28,158 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-28 11:11:28,159 INFO L225 Difference]: With dead ends: 84 [2022-04-28 11:11:28,159 INFO L226 Difference]: Without dead ends: 82 [2022-04-28 11:11:28,160 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 62 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=71, Invalid=349, Unknown=0, NotChecked=0, Total=420 [2022-04-28 11:11:28,160 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 16 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 344 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 349 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 344 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-28 11:11:28,160 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 192 Invalid, 349 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 344 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-28 11:11:28,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2022-04-28 11:11:28,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 78. [2022-04-28 11:11:28,293 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:11:28,293 INFO L82 GeneralOperation]: Start isEquivalent. First operand 82 states. Second operand has 78 states, 56 states have (on average 1.1071428571428572) internal successors, (62), 58 states have internal predecessors, (62), 12 states have call successors, (12), 10 states have call predecessors, (12), 9 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-28 11:11:28,293 INFO L74 IsIncluded]: Start isIncluded. First operand 82 states. Second operand has 78 states, 56 states have (on average 1.1071428571428572) internal successors, (62), 58 states have internal predecessors, (62), 12 states have call successors, (12), 10 states have call predecessors, (12), 9 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-28 11:11:28,293 INFO L87 Difference]: Start difference. First operand 82 states. Second operand has 78 states, 56 states have (on average 1.1071428571428572) internal successors, (62), 58 states have internal predecessors, (62), 12 states have call successors, (12), 10 states have call predecessors, (12), 9 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-28 11:11:28,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:11:28,296 INFO L93 Difference]: Finished difference Result 82 states and 90 transitions. [2022-04-28 11:11:28,296 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 90 transitions. [2022-04-28 11:11:28,296 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:11:28,296 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:11:28,296 INFO L74 IsIncluded]: Start isIncluded. First operand has 78 states, 56 states have (on average 1.1071428571428572) internal successors, (62), 58 states have internal predecessors, (62), 12 states have call successors, (12), 10 states have call predecessors, (12), 9 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) Second operand 82 states. [2022-04-28 11:11:28,297 INFO L87 Difference]: Start difference. First operand has 78 states, 56 states have (on average 1.1071428571428572) internal successors, (62), 58 states have internal predecessors, (62), 12 states have call successors, (12), 10 states have call predecessors, (12), 9 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) Second operand 82 states. [2022-04-28 11:11:28,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:11:28,299 INFO L93 Difference]: Finished difference Result 82 states and 90 transitions. [2022-04-28 11:11:28,299 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 90 transitions. [2022-04-28 11:11:28,299 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:11:28,299 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:11:28,299 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:11:28,299 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:11:28,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 56 states have (on average 1.1071428571428572) internal successors, (62), 58 states have internal predecessors, (62), 12 states have call successors, (12), 10 states have call predecessors, (12), 9 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-28 11:11:28,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 84 transitions. [2022-04-28 11:11:28,302 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 84 transitions. Word has length 41 [2022-04-28 11:11:28,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:11:28,302 INFO L495 AbstractCegarLoop]: Abstraction has 78 states and 84 transitions. [2022-04-28 11:11:28,302 INFO L496 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-28 11:11:28,302 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 78 states and 84 transitions. [2022-04-28 11:11:28,421 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 84 edges. 84 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:11:28,421 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 84 transitions. [2022-04-28 11:11:28,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-04-28 11:11:28,422 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:11:28,422 INFO L195 NwaCegarLoop]: 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-28 11:11:28,438 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-04-28 11:11:28,627 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:11:28,627 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:11:28,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:11:28,628 INFO L85 PathProgramCache]: Analyzing trace with hash 1487887833, now seen corresponding path program 3 times [2022-04-28 11:11:28,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:11:28,628 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1118239545] [2022-04-28 11:11:28,628 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 11:11:28,628 INFO L85 PathProgramCache]: Analyzing trace with hash 1487887833, now seen corresponding path program 4 times [2022-04-28 11:11:28,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:11:28,629 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [538438655] [2022-04-28 11:11:28,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:11:28,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:11:28,650 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 11:11:28,650 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [189822162] [2022-04-28 11:11:28,651 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 11:11:28,651 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:11:28,651 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:11:28,655 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 11:11:28,663 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-04-28 11:11:28,698 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 11:11:28,698 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 11:11:28,699 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 29 conjunts are in the unsatisfiable core [2022-04-28 11:11:28,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:11:28,708 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 11:11:29,129 INFO L272 TraceCheckUtils]: 0: Hoare triple {4320#true} call ULTIMATE.init(); {4320#true} is VALID [2022-04-28 11:11:29,129 INFO L290 TraceCheckUtils]: 1: Hoare triple {4320#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); {4320#true} is VALID [2022-04-28 11:11:29,130 INFO L290 TraceCheckUtils]: 2: Hoare triple {4320#true} assume true; {4320#true} is VALID [2022-04-28 11:11:29,130 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4320#true} {4320#true} #69#return; {4320#true} is VALID [2022-04-28 11:11:29,130 INFO L272 TraceCheckUtils]: 4: Hoare triple {4320#true} call #t~ret8 := main(); {4320#true} is VALID [2022-04-28 11:11:29,130 INFO L290 TraceCheckUtils]: 5: Hoare triple {4320#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; {4320#true} is VALID [2022-04-28 11:11:29,130 INFO L272 TraceCheckUtils]: 6: Hoare triple {4320#true} call assume_abort_if_not((if ~X~0 >= 0 && ~X~0 <= 5 then 1 else 0)); {4320#true} is VALID [2022-04-28 11:11:29,130 INFO L290 TraceCheckUtils]: 7: Hoare triple {4320#true} ~cond := #in~cond; {4320#true} is VALID [2022-04-28 11:11:29,130 INFO L290 TraceCheckUtils]: 8: Hoare triple {4320#true} assume !(0 == ~cond); {4320#true} is VALID [2022-04-28 11:11:29,130 INFO L290 TraceCheckUtils]: 9: Hoare triple {4320#true} assume true; {4320#true} is VALID [2022-04-28 11:11:29,130 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4320#true} {4320#true} #61#return; {4320#true} is VALID [2022-04-28 11:11:29,131 INFO L290 TraceCheckUtils]: 11: Hoare triple {4320#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~Y~0 := #t~nondet5;havoc #t~nondet5; {4320#true} is VALID [2022-04-28 11:11:29,131 INFO L272 TraceCheckUtils]: 12: Hoare triple {4320#true} call assume_abort_if_not((if ~Y~0 >= 0 && ~Y~0 <= 5 then 1 else 0)); {4320#true} is VALID [2022-04-28 11:11:29,131 INFO L290 TraceCheckUtils]: 13: Hoare triple {4320#true} ~cond := #in~cond; {4320#true} is VALID [2022-04-28 11:11:29,131 INFO L290 TraceCheckUtils]: 14: Hoare triple {4320#true} assume !(0 == ~cond); {4320#true} is VALID [2022-04-28 11:11:29,131 INFO L290 TraceCheckUtils]: 15: Hoare triple {4320#true} assume true; {4320#true} is VALID [2022-04-28 11:11:29,131 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {4320#true} {4320#true} #63#return; {4320#true} is VALID [2022-04-28 11:11:29,132 INFO L290 TraceCheckUtils]: 17: Hoare triple {4320#true} ~v~0 := 2 * ~Y~0 - ~X~0;~y~0 := 0;~x~0 := 0; {4376#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (= main_~y~0 0))} is VALID [2022-04-28 11:11:29,132 INFO L290 TraceCheckUtils]: 18: Hoare triple {4376#(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; {4376#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (= main_~y~0 0))} is VALID [2022-04-28 11:11:29,132 INFO L272 TraceCheckUtils]: 19: Hoare triple {4376#(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)); {4320#true} is VALID [2022-04-28 11:11:29,132 INFO L290 TraceCheckUtils]: 20: Hoare triple {4320#true} ~cond := #in~cond; {4320#true} is VALID [2022-04-28 11:11:29,132 INFO L290 TraceCheckUtils]: 21: Hoare triple {4320#true} assume !(0 == ~cond); {4320#true} is VALID [2022-04-28 11:11:29,133 INFO L290 TraceCheckUtils]: 22: Hoare triple {4320#true} assume true; {4320#true} is VALID [2022-04-28 11:11:29,133 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {4320#true} {4376#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (= main_~y~0 0))} #65#return; {4376#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (= main_~y~0 0))} is VALID [2022-04-28 11:11:29,134 INFO L290 TraceCheckUtils]: 24: Hoare triple {4376#(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); {4376#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (= main_~y~0 0))} is VALID [2022-04-28 11:11:29,135 INFO L290 TraceCheckUtils]: 25: Hoare triple {4376#(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; {4401#(and (= main_~x~0 0) (= (+ (- 1) main_~y~0) 0) (not (< (* main_~Y~0 2) main_~X~0)) (= main_~v~0 (+ (* main_~X~0 (- 3)) (* main_~Y~0 4))))} is VALID [2022-04-28 11:11:29,135 INFO L290 TraceCheckUtils]: 26: Hoare triple {4401#(and (= main_~x~0 0) (= (+ (- 1) main_~y~0) 0) (not (< (* main_~Y~0 2) main_~X~0)) (= main_~v~0 (+ (* main_~X~0 (- 3)) (* main_~Y~0 4))))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {4405#(and (= (+ (- 1) main_~x~0) 0) (= (+ (- 1) main_~y~0) 0) (not (< (* main_~Y~0 2) main_~X~0)) (= main_~v~0 (+ (* main_~X~0 (- 3)) (* main_~Y~0 4))))} is VALID [2022-04-28 11:11:29,136 INFO L290 TraceCheckUtils]: 27: Hoare triple {4405#(and (= (+ (- 1) main_~x~0) 0) (= (+ (- 1) main_~y~0) 0) (not (< (* main_~Y~0 2) main_~X~0)) (= main_~v~0 (+ (* main_~X~0 (- 3)) (* main_~Y~0 4))))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {4405#(and (= (+ (- 1) main_~x~0) 0) (= (+ (- 1) main_~y~0) 0) (not (< (* main_~Y~0 2) main_~X~0)) (= main_~v~0 (+ (* main_~X~0 (- 3)) (* main_~Y~0 4))))} is VALID [2022-04-28 11:11:29,136 INFO L272 TraceCheckUtils]: 28: Hoare triple {4405#(and (= (+ (- 1) main_~x~0) 0) (= (+ (- 1) main_~y~0) 0) (not (< (* main_~Y~0 2) main_~X~0)) (= main_~v~0 (+ (* main_~X~0 (- 3)) (* 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)); {4320#true} is VALID [2022-04-28 11:11:29,136 INFO L290 TraceCheckUtils]: 29: Hoare triple {4320#true} ~cond := #in~cond; {4320#true} is VALID [2022-04-28 11:11:29,136 INFO L290 TraceCheckUtils]: 30: Hoare triple {4320#true} assume !(0 == ~cond); {4320#true} is VALID [2022-04-28 11:11:29,136 INFO L290 TraceCheckUtils]: 31: Hoare triple {4320#true} assume true; {4320#true} is VALID [2022-04-28 11:11:29,137 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {4320#true} {4405#(and (= (+ (- 1) main_~x~0) 0) (= (+ (- 1) main_~y~0) 0) (not (< (* main_~Y~0 2) main_~X~0)) (= main_~v~0 (+ (* main_~X~0 (- 3)) (* main_~Y~0 4))))} #65#return; {4405#(and (= (+ (- 1) main_~x~0) 0) (= (+ (- 1) main_~y~0) 0) (not (< (* main_~Y~0 2) main_~X~0)) (= main_~v~0 (+ (* main_~X~0 (- 3)) (* main_~Y~0 4))))} is VALID [2022-04-28 11:11:29,138 INFO L290 TraceCheckUtils]: 33: Hoare triple {4405#(and (= (+ (- 1) main_~x~0) 0) (= (+ (- 1) main_~y~0) 0) (not (< (* main_~Y~0 2) main_~X~0)) (= main_~v~0 (+ (* main_~X~0 (- 3)) (* main_~Y~0 4))))} assume !!(~x~0 <= ~X~0); {4427#(and (= (+ (- 1) main_~x~0) 0) (<= main_~x~0 main_~X~0) (= (+ (- 1) main_~y~0) 0) (not (< (* main_~Y~0 2) main_~X~0)) (= main_~v~0 (+ (* main_~X~0 (- 3)) (* main_~Y~0 4))))} is VALID [2022-04-28 11:11:29,139 INFO L290 TraceCheckUtils]: 34: Hoare triple {4427#(and (= (+ (- 1) main_~x~0) 0) (<= main_~x~0 main_~X~0) (= (+ (- 1) main_~y~0) 0) (not (< (* main_~Y~0 2) main_~X~0)) (= main_~v~0 (+ (* main_~X~0 (- 3)) (* 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; {4431#(and (= main_~v~0 (+ (* main_~Y~0 6) (* main_~X~0 (- 5)))) (= (+ (- 1) main_~x~0) 0) (<= main_~x~0 main_~X~0) (= (+ (- 2) main_~y~0) 0) (not (< (* main_~Y~0 2) main_~X~0)))} is VALID [2022-04-28 11:11:29,139 INFO L290 TraceCheckUtils]: 35: Hoare triple {4431#(and (= main_~v~0 (+ (* main_~Y~0 6) (* main_~X~0 (- 5)))) (= (+ (- 1) main_~x~0) 0) (<= main_~x~0 main_~X~0) (= (+ (- 2) main_~y~0) 0) (not (< (* main_~Y~0 2) main_~X~0)))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {4435#(and (= main_~v~0 (+ (* main_~Y~0 6) (* main_~X~0 (- 5)))) (= (+ (- 2) main_~x~0) 0) (= (+ (- 2) main_~y~0) 0) (not (< (* main_~Y~0 2) main_~X~0)) (<= main_~x~0 (+ main_~X~0 1)))} is VALID [2022-04-28 11:11:29,140 INFO L290 TraceCheckUtils]: 36: Hoare triple {4435#(and (= main_~v~0 (+ (* main_~Y~0 6) (* main_~X~0 (- 5)))) (= (+ (- 2) main_~x~0) 0) (= (+ (- 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; {4439#(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-28 11:11:29,141 INFO L272 TraceCheckUtils]: 37: Hoare triple {4439#(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)); {4443#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 11:11:29,141 INFO L290 TraceCheckUtils]: 38: Hoare triple {4443#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4447#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:11:29,142 INFO L290 TraceCheckUtils]: 39: Hoare triple {4447#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4321#false} is VALID [2022-04-28 11:11:29,142 INFO L290 TraceCheckUtils]: 40: Hoare triple {4321#false} assume !false; {4321#false} is VALID [2022-04-28 11:11:29,142 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-28 11:11:29,142 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 11:11:29,557 INFO L290 TraceCheckUtils]: 40: Hoare triple {4321#false} assume !false; {4321#false} is VALID [2022-04-28 11:11:29,558 INFO L290 TraceCheckUtils]: 39: Hoare triple {4447#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4321#false} is VALID [2022-04-28 11:11:29,559 INFO L290 TraceCheckUtils]: 38: Hoare triple {4443#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4447#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:11:29,559 INFO L272 TraceCheckUtils]: 37: Hoare triple {4463#(= (+ (* 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)); {4443#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 11:11:29,560 INFO L290 TraceCheckUtils]: 36: Hoare triple {4467#(= (+ (* 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; {4463#(= (+ (* 2 main_~xy~0) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 main_~yx~0)))} is VALID [2022-04-28 11:11:29,562 INFO L290 TraceCheckUtils]: 35: Hoare triple {4471#(= (+ (* (* 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; {4467#(= (+ (* 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-28 11:11:29,563 INFO L290 TraceCheckUtils]: 34: Hoare triple {4467#(= (+ (* 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; {4471#(= (+ (* (* 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-28 11:11:29,563 INFO L290 TraceCheckUtils]: 33: Hoare triple {4478#(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); {4467#(= (+ (* 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-28 11:11:29,564 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {4320#true} {4478#(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; {4478#(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-28 11:11:29,564 INFO L290 TraceCheckUtils]: 31: Hoare triple {4320#true} assume true; {4320#true} is VALID [2022-04-28 11:11:29,564 INFO L290 TraceCheckUtils]: 30: Hoare triple {4320#true} assume !(0 == ~cond); {4320#true} is VALID [2022-04-28 11:11:29,564 INFO L290 TraceCheckUtils]: 29: Hoare triple {4320#true} ~cond := #in~cond; {4320#true} is VALID [2022-04-28 11:11:29,564 INFO L272 TraceCheckUtils]: 28: Hoare triple {4478#(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)); {4320#true} is VALID [2022-04-28 11:11:29,565 INFO L290 TraceCheckUtils]: 27: Hoare triple {4478#(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; {4478#(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-28 11:11:29,566 INFO L290 TraceCheckUtils]: 26: Hoare triple {4500#(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; {4478#(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-28 11:11:29,568 INFO L290 TraceCheckUtils]: 25: Hoare triple {4504#(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; {4500#(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-28 11:11:29,568 INFO L290 TraceCheckUtils]: 24: Hoare triple {4504#(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); {4504#(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-28 11:11:29,569 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {4320#true} {4504#(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; {4504#(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-28 11:11:29,569 INFO L290 TraceCheckUtils]: 22: Hoare triple {4320#true} assume true; {4320#true} is VALID [2022-04-28 11:11:29,569 INFO L290 TraceCheckUtils]: 21: Hoare triple {4320#true} assume !(0 == ~cond); {4320#true} is VALID [2022-04-28 11:11:29,569 INFO L290 TraceCheckUtils]: 20: Hoare triple {4320#true} ~cond := #in~cond; {4320#true} is VALID [2022-04-28 11:11:29,569 INFO L272 TraceCheckUtils]: 19: Hoare triple {4504#(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)); {4320#true} is VALID [2022-04-28 11:11:29,570 INFO L290 TraceCheckUtils]: 18: Hoare triple {4504#(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; {4504#(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-28 11:11:29,570 INFO L290 TraceCheckUtils]: 17: Hoare triple {4320#true} ~v~0 := 2 * ~Y~0 - ~X~0;~y~0 := 0;~x~0 := 0; {4504#(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-28 11:11:29,570 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {4320#true} {4320#true} #63#return; {4320#true} is VALID [2022-04-28 11:11:29,570 INFO L290 TraceCheckUtils]: 15: Hoare triple {4320#true} assume true; {4320#true} is VALID [2022-04-28 11:11:29,570 INFO L290 TraceCheckUtils]: 14: Hoare triple {4320#true} assume !(0 == ~cond); {4320#true} is VALID [2022-04-28 11:11:29,570 INFO L290 TraceCheckUtils]: 13: Hoare triple {4320#true} ~cond := #in~cond; {4320#true} is VALID [2022-04-28 11:11:29,570 INFO L272 TraceCheckUtils]: 12: Hoare triple {4320#true} call assume_abort_if_not((if ~Y~0 >= 0 && ~Y~0 <= 5 then 1 else 0)); {4320#true} is VALID [2022-04-28 11:11:29,570 INFO L290 TraceCheckUtils]: 11: Hoare triple {4320#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~Y~0 := #t~nondet5;havoc #t~nondet5; {4320#true} is VALID [2022-04-28 11:11:29,571 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4320#true} {4320#true} #61#return; {4320#true} is VALID [2022-04-28 11:11:29,571 INFO L290 TraceCheckUtils]: 9: Hoare triple {4320#true} assume true; {4320#true} is VALID [2022-04-28 11:11:29,571 INFO L290 TraceCheckUtils]: 8: Hoare triple {4320#true} assume !(0 == ~cond); {4320#true} is VALID [2022-04-28 11:11:29,571 INFO L290 TraceCheckUtils]: 7: Hoare triple {4320#true} ~cond := #in~cond; {4320#true} is VALID [2022-04-28 11:11:29,571 INFO L272 TraceCheckUtils]: 6: Hoare triple {4320#true} call assume_abort_if_not((if ~X~0 >= 0 && ~X~0 <= 5 then 1 else 0)); {4320#true} is VALID [2022-04-28 11:11:29,571 INFO L290 TraceCheckUtils]: 5: Hoare triple {4320#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; {4320#true} is VALID [2022-04-28 11:11:29,571 INFO L272 TraceCheckUtils]: 4: Hoare triple {4320#true} call #t~ret8 := main(); {4320#true} is VALID [2022-04-28 11:11:29,571 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4320#true} {4320#true} #69#return; {4320#true} is VALID [2022-04-28 11:11:29,571 INFO L290 TraceCheckUtils]: 2: Hoare triple {4320#true} assume true; {4320#true} is VALID [2022-04-28 11:11:29,571 INFO L290 TraceCheckUtils]: 1: Hoare triple {4320#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); {4320#true} is VALID [2022-04-28 11:11:29,571 INFO L272 TraceCheckUtils]: 0: Hoare triple {4320#true} call ULTIMATE.init(); {4320#true} is VALID [2022-04-28 11:11:29,571 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-28 11:11:29,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:11:29,572 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [538438655] [2022-04-28 11:11:29,572 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 11:11:29,572 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [189822162] [2022-04-28 11:11:29,572 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [189822162] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 11:11:29,572 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 11:11:29,572 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 17 [2022-04-28 11:11:29,572 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:11:29,572 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1118239545] [2022-04-28 11:11:29,572 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1118239545] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:11:29,572 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:11:29,573 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-28 11:11:29,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [233551028] [2022-04-28 11:11:29,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:11:29,574 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-28 11:11:29,574 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:11:29,574 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-28 11:11:29,601 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:11:29,601 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-28 11:11:29,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:11:29,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-28 11:11:29,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=219, Unknown=0, NotChecked=0, Total=272 [2022-04-28 11:11:29,602 INFO L87 Difference]: Start difference. First operand 78 states and 84 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-28 11:11:30,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:11:30,532 INFO L93 Difference]: Finished difference Result 91 states and 99 transitions. [2022-04-28 11:11:30,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-28 11:11:30,532 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-28 11:11:30,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:11:30,533 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-28 11:11:30,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 58 transitions. [2022-04-28 11:11:30,539 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-28 11:11:30,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 58 transitions. [2022-04-28 11:11:30,541 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 58 transitions. [2022-04-28 11:11:30,589 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-28 11:11:30,591 INFO L225 Difference]: With dead ends: 91 [2022-04-28 11:11:30,591 INFO L226 Difference]: Without dead ends: 89 [2022-04-28 11:11:30,592 INFO L412 NwaCegarLoop]: 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-28 11:11:30,594 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 11 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 254 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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.3s IncrementalHoareTripleChecker+Time [2022-04-28 11:11:30,594 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 184 Invalid, 257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 254 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-28 11:11:30,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2022-04-28 11:11:30,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 78. [2022-04-28 11:11:30,717 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:11:30,718 INFO L82 GeneralOperation]: Start isEquivalent. First operand 89 states. Second operand has 78 states, 56 states have (on average 1.1071428571428572) internal successors, (62), 58 states have internal predecessors, (62), 12 states have call successors, (12), 10 states have call predecessors, (12), 9 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-28 11:11:30,718 INFO L74 IsIncluded]: Start isIncluded. First operand 89 states. Second operand has 78 states, 56 states have (on average 1.1071428571428572) internal successors, (62), 58 states have internal predecessors, (62), 12 states have call successors, (12), 10 states have call predecessors, (12), 9 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-28 11:11:30,718 INFO L87 Difference]: Start difference. First operand 89 states. Second operand has 78 states, 56 states have (on average 1.1071428571428572) internal successors, (62), 58 states have internal predecessors, (62), 12 states have call successors, (12), 10 states have call predecessors, (12), 9 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-28 11:11:30,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:11:30,721 INFO L93 Difference]: Finished difference Result 89 states and 97 transitions. [2022-04-28 11:11:30,721 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 97 transitions. [2022-04-28 11:11:30,721 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:11:30,721 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:11:30,722 INFO L74 IsIncluded]: Start isIncluded. First operand has 78 states, 56 states have (on average 1.1071428571428572) internal successors, (62), 58 states have internal predecessors, (62), 12 states have call successors, (12), 10 states have call predecessors, (12), 9 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) Second operand 89 states. [2022-04-28 11:11:30,722 INFO L87 Difference]: Start difference. First operand has 78 states, 56 states have (on average 1.1071428571428572) internal successors, (62), 58 states have internal predecessors, (62), 12 states have call successors, (12), 10 states have call predecessors, (12), 9 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) Second operand 89 states. [2022-04-28 11:11:30,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:11:30,724 INFO L93 Difference]: Finished difference Result 89 states and 97 transitions. [2022-04-28 11:11:30,724 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 97 transitions. [2022-04-28 11:11:30,724 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:11:30,724 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:11:30,724 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:11:30,724 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:11:30,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 56 states have (on average 1.1071428571428572) internal successors, (62), 58 states have internal predecessors, (62), 12 states have call successors, (12), 10 states have call predecessors, (12), 9 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-28 11:11:30,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 84 transitions. [2022-04-28 11:11:30,726 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 84 transitions. Word has length 41 [2022-04-28 11:11:30,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:11:30,726 INFO L495 AbstractCegarLoop]: Abstraction has 78 states and 84 transitions. [2022-04-28 11:11:30,726 INFO L496 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-28 11:11:30,726 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 78 states and 84 transitions. [2022-04-28 11:11:30,848 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 84 edges. 84 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:11:30,848 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 84 transitions. [2022-04-28 11:11:30,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-04-28 11:11:30,849 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:11:30,849 INFO L195 NwaCegarLoop]: 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-28 11:11:30,865 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-04-28 11:11:31,049 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2022-04-28 11:11:31,050 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:11:31,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:11:31,050 INFO L85 PathProgramCache]: Analyzing trace with hash -143142008, now seen corresponding path program 1 times [2022-04-28 11:11:31,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:11:31,050 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1070328908] [2022-04-28 11:11:31,050 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 11:11:31,051 INFO L85 PathProgramCache]: Analyzing trace with hash -143142008, now seen corresponding path program 2 times [2022-04-28 11:11:31,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:11:31,051 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1704655103] [2022-04-28 11:11:31,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:11:31,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:11:31,063 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 11:11:31,063 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [915564914] [2022-04-28 11:11:31,063 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 11:11:31,064 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:11:31,064 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:11:31,066 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 11:11:31,066 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-04-28 11:11:31,104 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 11:11:31,104 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 11:11:31,105 INFO L263 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-28 11:11:31,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:11:31,115 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 11:11:35,685 INFO L272 TraceCheckUtils]: 0: Hoare triple {5102#true} call ULTIMATE.init(); {5102#true} is VALID [2022-04-28 11:11:35,685 INFO L290 TraceCheckUtils]: 1: Hoare triple {5102#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); {5102#true} is VALID [2022-04-28 11:11:35,685 INFO L290 TraceCheckUtils]: 2: Hoare triple {5102#true} assume true; {5102#true} is VALID [2022-04-28 11:11:35,685 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5102#true} {5102#true} #69#return; {5102#true} is VALID [2022-04-28 11:11:35,685 INFO L272 TraceCheckUtils]: 4: Hoare triple {5102#true} call #t~ret8 := main(); {5102#true} is VALID [2022-04-28 11:11:35,685 INFO L290 TraceCheckUtils]: 5: Hoare triple {5102#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; {5102#true} is VALID [2022-04-28 11:11:35,685 INFO L272 TraceCheckUtils]: 6: Hoare triple {5102#true} call assume_abort_if_not((if ~X~0 >= 0 && ~X~0 <= 5 then 1 else 0)); {5102#true} is VALID [2022-04-28 11:11:35,685 INFO L290 TraceCheckUtils]: 7: Hoare triple {5102#true} ~cond := #in~cond; {5102#true} is VALID [2022-04-28 11:11:35,685 INFO L290 TraceCheckUtils]: 8: Hoare triple {5102#true} assume !(0 == ~cond); {5102#true} is VALID [2022-04-28 11:11:35,686 INFO L290 TraceCheckUtils]: 9: Hoare triple {5102#true} assume true; {5102#true} is VALID [2022-04-28 11:11:35,686 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {5102#true} {5102#true} #61#return; {5102#true} is VALID [2022-04-28 11:11:35,686 INFO L290 TraceCheckUtils]: 11: Hoare triple {5102#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~Y~0 := #t~nondet5;havoc #t~nondet5; {5102#true} is VALID [2022-04-28 11:11:35,686 INFO L272 TraceCheckUtils]: 12: Hoare triple {5102#true} call assume_abort_if_not((if ~Y~0 >= 0 && ~Y~0 <= 5 then 1 else 0)); {5102#true} is VALID [2022-04-28 11:11:35,686 INFO L290 TraceCheckUtils]: 13: Hoare triple {5102#true} ~cond := #in~cond; {5102#true} is VALID [2022-04-28 11:11:35,686 INFO L290 TraceCheckUtils]: 14: Hoare triple {5102#true} assume !(0 == ~cond); {5102#true} is VALID [2022-04-28 11:11:35,686 INFO L290 TraceCheckUtils]: 15: Hoare triple {5102#true} assume true; {5102#true} is VALID [2022-04-28 11:11:35,686 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {5102#true} {5102#true} #63#return; {5102#true} is VALID [2022-04-28 11:11:35,686 INFO L290 TraceCheckUtils]: 17: Hoare triple {5102#true} ~v~0 := 2 * ~Y~0 - ~X~0;~y~0 := 0;~x~0 := 0; {5158#(and (<= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0))} is VALID [2022-04-28 11:11:35,687 INFO L290 TraceCheckUtils]: 18: Hoare triple {5158#(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; {5158#(and (<= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0))} is VALID [2022-04-28 11:11:35,687 INFO L272 TraceCheckUtils]: 19: Hoare triple {5158#(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)); {5102#true} is VALID [2022-04-28 11:11:35,687 INFO L290 TraceCheckUtils]: 20: Hoare triple {5102#true} ~cond := #in~cond; {5102#true} is VALID [2022-04-28 11:11:35,687 INFO L290 TraceCheckUtils]: 21: Hoare triple {5102#true} assume !(0 == ~cond); {5102#true} is VALID [2022-04-28 11:11:35,687 INFO L290 TraceCheckUtils]: 22: Hoare triple {5102#true} assume true; {5102#true} is VALID [2022-04-28 11:11:35,688 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {5102#true} {5158#(and (<= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0))} #65#return; {5158#(and (<= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0))} is VALID [2022-04-28 11:11:35,688 INFO L290 TraceCheckUtils]: 24: Hoare triple {5158#(and (<= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0))} assume !!(~x~0 <= ~X~0); {5158#(and (<= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0))} is VALID [2022-04-28 11:11:35,689 INFO L290 TraceCheckUtils]: 25: Hoare triple {5158#(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; {5183#(and (<= main_~x~0 0) (<= (+ (div (+ (- 1) main_~X~0) 2) 1) (div (+ main_~v~0 (* main_~X~0 3)) 4)))} is VALID [2022-04-28 11:11:35,690 INFO L290 TraceCheckUtils]: 26: Hoare triple {5183#(and (<= main_~x~0 0) (<= (+ (div (+ (- 1) main_~X~0) 2) 1) (div (+ main_~v~0 (* main_~X~0 3)) 4)))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {5187#(and (<= main_~x~0 1) (<= (+ (div (+ (- 1) main_~X~0) 2) 1) (div (+ main_~v~0 (* main_~X~0 3)) 4)))} is VALID [2022-04-28 11:11:35,691 INFO L290 TraceCheckUtils]: 27: Hoare triple {5187#(and (<= main_~x~0 1) (<= (+ (div (+ (- 1) main_~X~0) 2) 1) (div (+ main_~v~0 (* main_~X~0 3)) 4)))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {5187#(and (<= main_~x~0 1) (<= (+ (div (+ (- 1) main_~X~0) 2) 1) (div (+ main_~v~0 (* main_~X~0 3)) 4)))} is VALID [2022-04-28 11:11:35,691 INFO L272 TraceCheckUtils]: 28: Hoare triple {5187#(and (<= main_~x~0 1) (<= (+ (div (+ (- 1) main_~X~0) 2) 1) (div (+ main_~v~0 (* main_~X~0 3)) 4)))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {5102#true} is VALID [2022-04-28 11:11:35,691 INFO L290 TraceCheckUtils]: 29: Hoare triple {5102#true} ~cond := #in~cond; {5102#true} is VALID [2022-04-28 11:11:35,691 INFO L290 TraceCheckUtils]: 30: Hoare triple {5102#true} assume !(0 == ~cond); {5102#true} is VALID [2022-04-28 11:11:35,691 INFO L290 TraceCheckUtils]: 31: Hoare triple {5102#true} assume true; {5102#true} is VALID [2022-04-28 11:11:35,691 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {5102#true} {5187#(and (<= main_~x~0 1) (<= (+ (div (+ (- 1) main_~X~0) 2) 1) (div (+ main_~v~0 (* main_~X~0 3)) 4)))} #65#return; {5187#(and (<= main_~x~0 1) (<= (+ (div (+ (- 1) main_~X~0) 2) 1) (div (+ main_~v~0 (* main_~X~0 3)) 4)))} is VALID [2022-04-28 11:11:35,692 INFO L290 TraceCheckUtils]: 33: Hoare triple {5187#(and (<= main_~x~0 1) (<= (+ (div (+ (- 1) main_~X~0) 2) 1) (div (+ main_~v~0 (* main_~X~0 3)) 4)))} assume !!(~x~0 <= ~X~0); {5187#(and (<= main_~x~0 1) (<= (+ (div (+ (- 1) main_~X~0) 2) 1) (div (+ main_~v~0 (* main_~X~0 3)) 4)))} is VALID [2022-04-28 11:11:35,692 INFO L290 TraceCheckUtils]: 34: Hoare triple {5187#(and (<= main_~x~0 1) (<= (+ (div (+ (- 1) main_~X~0) 2) 1) (div (+ main_~v~0 (* main_~X~0 3)) 4)))} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {5212#(and (< (div (+ (- 1) main_~X~0) 2) (div (+ (- 1) (* main_~X~0 3)) 4)) (<= main_~x~0 1))} is VALID [2022-04-28 11:11:35,693 INFO L290 TraceCheckUtils]: 35: Hoare triple {5212#(and (< (div (+ (- 1) main_~X~0) 2) (div (+ (- 1) (* main_~X~0 3)) 4)) (<= main_~x~0 1))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {5216#(and (< (div (+ (- 1) main_~X~0) 2) (div (+ (- 1) (* main_~X~0 3)) 4)) (<= main_~x~0 2))} is VALID [2022-04-28 11:11:35,694 INFO L290 TraceCheckUtils]: 36: Hoare triple {5216#(and (< (div (+ (- 1) main_~X~0) 2) (div (+ (- 1) (* main_~X~0 3)) 4)) (<= main_~x~0 2))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {5216#(and (< (div (+ (- 1) main_~X~0) 2) (div (+ (- 1) (* main_~X~0 3)) 4)) (<= main_~x~0 2))} is VALID [2022-04-28 11:11:35,694 INFO L272 TraceCheckUtils]: 37: Hoare triple {5216#(and (< (div (+ (- 1) main_~X~0) 2) (div (+ (- 1) (* main_~X~0 3)) 4)) (<= 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)); {5102#true} is VALID [2022-04-28 11:11:35,694 INFO L290 TraceCheckUtils]: 38: Hoare triple {5102#true} ~cond := #in~cond; {5102#true} is VALID [2022-04-28 11:11:35,694 INFO L290 TraceCheckUtils]: 39: Hoare triple {5102#true} assume !(0 == ~cond); {5102#true} is VALID [2022-04-28 11:11:35,694 INFO L290 TraceCheckUtils]: 40: Hoare triple {5102#true} assume true; {5102#true} is VALID [2022-04-28 11:11:35,694 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {5102#true} {5216#(and (< (div (+ (- 1) main_~X~0) 2) (div (+ (- 1) (* main_~X~0 3)) 4)) (<= main_~x~0 2))} #65#return; {5216#(and (< (div (+ (- 1) main_~X~0) 2) (div (+ (- 1) (* main_~X~0 3)) 4)) (<= main_~x~0 2))} is VALID [2022-04-28 11:11:35,695 INFO L290 TraceCheckUtils]: 42: Hoare triple {5216#(and (< (div (+ (- 1) main_~X~0) 2) (div (+ (- 1) (* main_~X~0 3)) 4)) (<= main_~x~0 2))} assume !(~x~0 <= ~X~0); {5103#false} is VALID [2022-04-28 11:11:35,695 INFO L290 TraceCheckUtils]: 43: Hoare triple {5103#false} ~xy~0 := ~x~0 * ~y~0;~yx~0 := ~Y~0 * ~x~0; {5103#false} is VALID [2022-04-28 11:11:35,695 INFO L272 TraceCheckUtils]: 44: Hoare triple {5103#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)); {5103#false} is VALID [2022-04-28 11:11:35,695 INFO L290 TraceCheckUtils]: 45: Hoare triple {5103#false} ~cond := #in~cond; {5103#false} is VALID [2022-04-28 11:11:35,695 INFO L290 TraceCheckUtils]: 46: Hoare triple {5103#false} assume 0 == ~cond; {5103#false} is VALID [2022-04-28 11:11:35,696 INFO L290 TraceCheckUtils]: 47: Hoare triple {5103#false} assume !false; {5103#false} is VALID [2022-04-28 11:11:35,696 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-28 11:11:35,696 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 11:11:36,056 INFO L290 TraceCheckUtils]: 47: Hoare triple {5103#false} assume !false; {5103#false} is VALID [2022-04-28 11:11:36,056 INFO L290 TraceCheckUtils]: 46: Hoare triple {5103#false} assume 0 == ~cond; {5103#false} is VALID [2022-04-28 11:11:36,057 INFO L290 TraceCheckUtils]: 45: Hoare triple {5103#false} ~cond := #in~cond; {5103#false} is VALID [2022-04-28 11:11:36,057 INFO L272 TraceCheckUtils]: 44: Hoare triple {5103#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)); {5103#false} is VALID [2022-04-28 11:11:36,057 INFO L290 TraceCheckUtils]: 43: Hoare triple {5103#false} ~xy~0 := ~x~0 * ~y~0;~yx~0 := ~Y~0 * ~x~0; {5103#false} is VALID [2022-04-28 11:11:36,057 INFO L290 TraceCheckUtils]: 42: Hoare triple {5268#(<= main_~x~0 main_~X~0)} assume !(~x~0 <= ~X~0); {5103#false} is VALID [2022-04-28 11:11:36,058 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {5102#true} {5268#(<= main_~x~0 main_~X~0)} #65#return; {5268#(<= main_~x~0 main_~X~0)} is VALID [2022-04-28 11:11:36,058 INFO L290 TraceCheckUtils]: 40: Hoare triple {5102#true} assume true; {5102#true} is VALID [2022-04-28 11:11:36,058 INFO L290 TraceCheckUtils]: 39: Hoare triple {5102#true} assume !(0 == ~cond); {5102#true} is VALID [2022-04-28 11:11:36,058 INFO L290 TraceCheckUtils]: 38: Hoare triple {5102#true} ~cond := #in~cond; {5102#true} is VALID [2022-04-28 11:11:36,058 INFO L272 TraceCheckUtils]: 37: Hoare triple {5268#(<= 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)); {5102#true} is VALID [2022-04-28 11:11:36,059 INFO L290 TraceCheckUtils]: 36: Hoare triple {5268#(<= main_~x~0 main_~X~0)} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {5268#(<= main_~x~0 main_~X~0)} is VALID [2022-04-28 11:11:36,060 INFO L290 TraceCheckUtils]: 35: Hoare triple {5290#(<= (+ main_~x~0 1) main_~X~0)} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {5268#(<= main_~x~0 main_~X~0)} is VALID [2022-04-28 11:11:36,060 INFO L290 TraceCheckUtils]: 34: Hoare triple {5294#(or (not (< main_~v~0 0)) (<= (+ main_~x~0 1) main_~X~0))} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {5290#(<= (+ main_~x~0 1) main_~X~0)} is VALID [2022-04-28 11:11:36,060 INFO L290 TraceCheckUtils]: 33: Hoare triple {5294#(or (not (< main_~v~0 0)) (<= (+ main_~x~0 1) main_~X~0))} assume !!(~x~0 <= ~X~0); {5294#(or (not (< main_~v~0 0)) (<= (+ main_~x~0 1) main_~X~0))} is VALID [2022-04-28 11:11:36,061 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {5102#true} {5294#(or (not (< main_~v~0 0)) (<= (+ main_~x~0 1) main_~X~0))} #65#return; {5294#(or (not (< main_~v~0 0)) (<= (+ main_~x~0 1) main_~X~0))} is VALID [2022-04-28 11:11:36,061 INFO L290 TraceCheckUtils]: 31: Hoare triple {5102#true} assume true; {5102#true} is VALID [2022-04-28 11:11:36,061 INFO L290 TraceCheckUtils]: 30: Hoare triple {5102#true} assume !(0 == ~cond); {5102#true} is VALID [2022-04-28 11:11:36,062 INFO L290 TraceCheckUtils]: 29: Hoare triple {5102#true} ~cond := #in~cond; {5102#true} is VALID [2022-04-28 11:11:36,062 INFO L272 TraceCheckUtils]: 28: Hoare triple {5294#(or (not (< 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)); {5102#true} is VALID [2022-04-28 11:11:36,062 INFO L290 TraceCheckUtils]: 27: Hoare triple {5294#(or (not (< 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; {5294#(or (not (< main_~v~0 0)) (<= (+ main_~x~0 1) main_~X~0))} is VALID [2022-04-28 11:11:36,063 INFO L290 TraceCheckUtils]: 26: Hoare triple {5319#(or (<= (+ main_~x~0 2) main_~X~0) (not (< main_~v~0 0)))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {5294#(or (not (< main_~v~0 0)) (<= (+ main_~x~0 1) main_~X~0))} is VALID [2022-04-28 11:11:36,064 INFO L290 TraceCheckUtils]: 25: Hoare triple {5323#(or (<= (+ main_~x~0 2) main_~X~0) (<= (* main_~X~0 2) (+ main_~v~0 (* main_~Y~0 2))) (< 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; {5319#(or (<= (+ main_~x~0 2) main_~X~0) (not (< main_~v~0 0)))} is VALID [2022-04-28 11:11:36,064 INFO L290 TraceCheckUtils]: 24: Hoare triple {5323#(or (<= (+ main_~x~0 2) main_~X~0) (<= (* main_~X~0 2) (+ main_~v~0 (* main_~Y~0 2))) (< main_~v~0 0))} assume !!(~x~0 <= ~X~0); {5323#(or (<= (+ main_~x~0 2) main_~X~0) (<= (* main_~X~0 2) (+ main_~v~0 (* main_~Y~0 2))) (< main_~v~0 0))} is VALID [2022-04-28 11:11:36,065 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {5102#true} {5323#(or (<= (+ main_~x~0 2) main_~X~0) (<= (* main_~X~0 2) (+ main_~v~0 (* main_~Y~0 2))) (< main_~v~0 0))} #65#return; {5323#(or (<= (+ main_~x~0 2) main_~X~0) (<= (* main_~X~0 2) (+ main_~v~0 (* main_~Y~0 2))) (< main_~v~0 0))} is VALID [2022-04-28 11:11:36,065 INFO L290 TraceCheckUtils]: 22: Hoare triple {5102#true} assume true; {5102#true} is VALID [2022-04-28 11:11:36,065 INFO L290 TraceCheckUtils]: 21: Hoare triple {5102#true} assume !(0 == ~cond); {5102#true} is VALID [2022-04-28 11:11:36,065 INFO L290 TraceCheckUtils]: 20: Hoare triple {5102#true} ~cond := #in~cond; {5102#true} is VALID [2022-04-28 11:11:36,065 INFO L272 TraceCheckUtils]: 19: Hoare triple {5323#(or (<= (+ main_~x~0 2) main_~X~0) (<= (* main_~X~0 2) (+ main_~v~0 (* main_~Y~0 2))) (< 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)); {5102#true} is VALID [2022-04-28 11:11:36,066 INFO L290 TraceCheckUtils]: 18: Hoare triple {5323#(or (<= (+ main_~x~0 2) main_~X~0) (<= (* main_~X~0 2) (+ main_~v~0 (* main_~Y~0 2))) (< main_~v~0 0))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {5323#(or (<= (+ main_~x~0 2) main_~X~0) (<= (* main_~X~0 2) (+ main_~v~0 (* main_~Y~0 2))) (< main_~v~0 0))} is VALID [2022-04-28 11:11:36,067 INFO L290 TraceCheckUtils]: 17: Hoare triple {5102#true} ~v~0 := 2 * ~Y~0 - ~X~0;~y~0 := 0;~x~0 := 0; {5323#(or (<= (+ main_~x~0 2) main_~X~0) (<= (* main_~X~0 2) (+ main_~v~0 (* main_~Y~0 2))) (< main_~v~0 0))} is VALID [2022-04-28 11:11:36,067 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {5102#true} {5102#true} #63#return; {5102#true} is VALID [2022-04-28 11:11:36,067 INFO L290 TraceCheckUtils]: 15: Hoare triple {5102#true} assume true; {5102#true} is VALID [2022-04-28 11:11:36,067 INFO L290 TraceCheckUtils]: 14: Hoare triple {5102#true} assume !(0 == ~cond); {5102#true} is VALID [2022-04-28 11:11:36,067 INFO L290 TraceCheckUtils]: 13: Hoare triple {5102#true} ~cond := #in~cond; {5102#true} is VALID [2022-04-28 11:11:36,067 INFO L272 TraceCheckUtils]: 12: Hoare triple {5102#true} call assume_abort_if_not((if ~Y~0 >= 0 && ~Y~0 <= 5 then 1 else 0)); {5102#true} is VALID [2022-04-28 11:11:36,067 INFO L290 TraceCheckUtils]: 11: Hoare triple {5102#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~Y~0 := #t~nondet5;havoc #t~nondet5; {5102#true} is VALID [2022-04-28 11:11:36,067 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {5102#true} {5102#true} #61#return; {5102#true} is VALID [2022-04-28 11:11:36,068 INFO L290 TraceCheckUtils]: 9: Hoare triple {5102#true} assume true; {5102#true} is VALID [2022-04-28 11:11:36,068 INFO L290 TraceCheckUtils]: 8: Hoare triple {5102#true} assume !(0 == ~cond); {5102#true} is VALID [2022-04-28 11:11:36,068 INFO L290 TraceCheckUtils]: 7: Hoare triple {5102#true} ~cond := #in~cond; {5102#true} is VALID [2022-04-28 11:11:36,068 INFO L272 TraceCheckUtils]: 6: Hoare triple {5102#true} call assume_abort_if_not((if ~X~0 >= 0 && ~X~0 <= 5 then 1 else 0)); {5102#true} is VALID [2022-04-28 11:11:36,068 INFO L290 TraceCheckUtils]: 5: Hoare triple {5102#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; {5102#true} is VALID [2022-04-28 11:11:36,068 INFO L272 TraceCheckUtils]: 4: Hoare triple {5102#true} call #t~ret8 := main(); {5102#true} is VALID [2022-04-28 11:11:36,068 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5102#true} {5102#true} #69#return; {5102#true} is VALID [2022-04-28 11:11:36,068 INFO L290 TraceCheckUtils]: 2: Hoare triple {5102#true} assume true; {5102#true} is VALID [2022-04-28 11:11:36,068 INFO L290 TraceCheckUtils]: 1: Hoare triple {5102#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); {5102#true} is VALID [2022-04-28 11:11:36,068 INFO L272 TraceCheckUtils]: 0: Hoare triple {5102#true} call ULTIMATE.init(); {5102#true} is VALID [2022-04-28 11:11:36,069 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-28 11:11:36,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:11:36,069 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1704655103] [2022-04-28 11:11:36,069 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 11:11:36,069 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [915564914] [2022-04-28 11:11:36,069 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [915564914] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 11:11:36,069 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 11:11:36,069 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2022-04-28 11:11:36,070 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:11:36,070 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1070328908] [2022-04-28 11:11:36,070 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1070328908] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:11:36,070 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:11:36,070 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 11:11:36,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1962511727] [2022-04-28 11:11:36,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:11:36,070 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-28 11:11:36,071 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:11:36,071 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-28 11:11:36,104 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:11:36,104 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-28 11:11:36,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:11:36,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-28 11:11:36,104 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2022-04-28 11:11:36,105 INFO L87 Difference]: Start difference. First operand 78 states and 84 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-28 11:11:36,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:11:36,585 INFO L93 Difference]: Finished difference Result 92 states and 100 transitions. [2022-04-28 11:11:36,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-28 11:11:36,585 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-28 11:11:36,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:11:36,585 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-28 11:11:36,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 59 transitions. [2022-04-28 11:11:36,587 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-28 11:11:36,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 59 transitions. [2022-04-28 11:11:36,591 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 59 transitions. [2022-04-28 11:11:36,651 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-28 11:11:36,655 INFO L225 Difference]: With dead ends: 92 [2022-04-28 11:11:36,655 INFO L226 Difference]: Without dead ends: 84 [2022-04-28 11:11:36,655 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2022-04-28 11:11:36,655 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 3 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 11:11:36,656 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 103 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 11:11:36,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2022-04-28 11:11:36,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 82. [2022-04-28 11:11:36,795 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:11:36,796 INFO L82 GeneralOperation]: Start isEquivalent. First operand 84 states. Second operand has 82 states, 59 states have (on average 1.1016949152542372) internal successors, (65), 61 states have internal predecessors, (65), 13 states have call successors, (13), 10 states have call predecessors, (13), 9 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-28 11:11:36,796 INFO L74 IsIncluded]: Start isIncluded. First operand 84 states. Second operand has 82 states, 59 states have (on average 1.1016949152542372) internal successors, (65), 61 states have internal predecessors, (65), 13 states have call successors, (13), 10 states have call predecessors, (13), 9 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-28 11:11:36,796 INFO L87 Difference]: Start difference. First operand 84 states. Second operand has 82 states, 59 states have (on average 1.1016949152542372) internal successors, (65), 61 states have internal predecessors, (65), 13 states have call successors, (13), 10 states have call predecessors, (13), 9 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-28 11:11:36,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:11:36,798 INFO L93 Difference]: Finished difference Result 84 states and 92 transitions. [2022-04-28 11:11:36,798 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 92 transitions. [2022-04-28 11:11:36,798 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:11:36,798 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:11:36,798 INFO L74 IsIncluded]: Start isIncluded. First operand has 82 states, 59 states have (on average 1.1016949152542372) internal successors, (65), 61 states have internal predecessors, (65), 13 states have call successors, (13), 10 states have call predecessors, (13), 9 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) Second operand 84 states. [2022-04-28 11:11:36,798 INFO L87 Difference]: Start difference. First operand has 82 states, 59 states have (on average 1.1016949152542372) internal successors, (65), 61 states have internal predecessors, (65), 13 states have call successors, (13), 10 states have call predecessors, (13), 9 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) Second operand 84 states. [2022-04-28 11:11:36,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:11:36,800 INFO L93 Difference]: Finished difference Result 84 states and 92 transitions. [2022-04-28 11:11:36,800 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 92 transitions. [2022-04-28 11:11:36,800 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:11:36,800 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:11:36,800 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:11:36,801 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:11:36,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 59 states have (on average 1.1016949152542372) internal successors, (65), 61 states have internal predecessors, (65), 13 states have call successors, (13), 10 states have call predecessors, (13), 9 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-28 11:11:36,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 89 transitions. [2022-04-28 11:11:36,802 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 89 transitions. Word has length 48 [2022-04-28 11:11:36,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:11:36,803 INFO L495 AbstractCegarLoop]: Abstraction has 82 states and 89 transitions. [2022-04-28 11:11:36,803 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 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-28 11:11:36,803 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 82 states and 89 transitions. [2022-04-28 11:11:36,942 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 89 edges. 89 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:11:36,942 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 89 transitions. [2022-04-28 11:11:36,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-04-28 11:11:36,943 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:11:36,943 INFO L195 NwaCegarLoop]: 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-28 11:11:36,958 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2022-04-28 11:11:37,144 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-04-28 11:11:37,144 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:11:37,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:11:37,144 INFO L85 PathProgramCache]: Analyzing trace with hash -1154259258, now seen corresponding path program 3 times [2022-04-28 11:11:37,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:11:37,145 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1679829084] [2022-04-28 11:11:37,145 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 11:11:37,145 INFO L85 PathProgramCache]: Analyzing trace with hash -1154259258, now seen corresponding path program 4 times [2022-04-28 11:11:37,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:11:37,145 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [350631661] [2022-04-28 11:11:37,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:11:37,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:11:37,155 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 11:11:37,155 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [310952046] [2022-04-28 11:11:37,155 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 11:11:37,155 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:11:37,155 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:11:37,156 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 11:11:37,158 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-04-28 11:11:37,202 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 11:11:37,202 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 11:11:37,203 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 41 conjunts are in the unsatisfiable core [2022-04-28 11:11:37,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:11:37,213 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 11:11:37,961 INFO L272 TraceCheckUtils]: 0: Hoare triple {5917#true} call ULTIMATE.init(); {5917#true} is VALID [2022-04-28 11:11:37,961 INFO L290 TraceCheckUtils]: 1: Hoare triple {5917#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); {5917#true} is VALID [2022-04-28 11:11:37,962 INFO L290 TraceCheckUtils]: 2: Hoare triple {5917#true} assume true; {5917#true} is VALID [2022-04-28 11:11:37,962 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5917#true} {5917#true} #69#return; {5917#true} is VALID [2022-04-28 11:11:37,962 INFO L272 TraceCheckUtils]: 4: Hoare triple {5917#true} call #t~ret8 := main(); {5917#true} is VALID [2022-04-28 11:11:37,962 INFO L290 TraceCheckUtils]: 5: Hoare triple {5917#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; {5917#true} is VALID [2022-04-28 11:11:37,962 INFO L272 TraceCheckUtils]: 6: Hoare triple {5917#true} call assume_abort_if_not((if ~X~0 >= 0 && ~X~0 <= 5 then 1 else 0)); {5917#true} is VALID [2022-04-28 11:11:37,962 INFO L290 TraceCheckUtils]: 7: Hoare triple {5917#true} ~cond := #in~cond; {5917#true} is VALID [2022-04-28 11:11:37,962 INFO L290 TraceCheckUtils]: 8: Hoare triple {5917#true} assume !(0 == ~cond); {5917#true} is VALID [2022-04-28 11:11:37,962 INFO L290 TraceCheckUtils]: 9: Hoare triple {5917#true} assume true; {5917#true} is VALID [2022-04-28 11:11:37,962 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {5917#true} {5917#true} #61#return; {5917#true} is VALID [2022-04-28 11:11:37,962 INFO L290 TraceCheckUtils]: 11: Hoare triple {5917#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~Y~0 := #t~nondet5;havoc #t~nondet5; {5917#true} is VALID [2022-04-28 11:11:37,962 INFO L272 TraceCheckUtils]: 12: Hoare triple {5917#true} call assume_abort_if_not((if ~Y~0 >= 0 && ~Y~0 <= 5 then 1 else 0)); {5917#true} is VALID [2022-04-28 11:11:37,962 INFO L290 TraceCheckUtils]: 13: Hoare triple {5917#true} ~cond := #in~cond; {5917#true} is VALID [2022-04-28 11:11:37,962 INFO L290 TraceCheckUtils]: 14: Hoare triple {5917#true} assume !(0 == ~cond); {5917#true} is VALID [2022-04-28 11:11:37,962 INFO L290 TraceCheckUtils]: 15: Hoare triple {5917#true} assume true; {5917#true} is VALID [2022-04-28 11:11:37,963 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {5917#true} {5917#true} #63#return; {5917#true} is VALID [2022-04-28 11:11:37,963 INFO L290 TraceCheckUtils]: 17: Hoare triple {5917#true} ~v~0 := 2 * ~Y~0 - ~X~0;~y~0 := 0;~x~0 := 0; {5973#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (= main_~y~0 0))} is VALID [2022-04-28 11:11:37,963 INFO L290 TraceCheckUtils]: 18: Hoare triple {5973#(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; {5973#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (= main_~y~0 0))} is VALID [2022-04-28 11:11:37,963 INFO L272 TraceCheckUtils]: 19: Hoare triple {5973#(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)); {5917#true} is VALID [2022-04-28 11:11:37,964 INFO L290 TraceCheckUtils]: 20: Hoare triple {5917#true} ~cond := #in~cond; {5917#true} is VALID [2022-04-28 11:11:37,964 INFO L290 TraceCheckUtils]: 21: Hoare triple {5917#true} assume !(0 == ~cond); {5917#true} is VALID [2022-04-28 11:11:37,964 INFO L290 TraceCheckUtils]: 22: Hoare triple {5917#true} assume true; {5917#true} is VALID [2022-04-28 11:11:37,964 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {5917#true} {5973#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (= main_~y~0 0))} #65#return; {5973#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (= main_~y~0 0))} is VALID [2022-04-28 11:11:37,965 INFO L290 TraceCheckUtils]: 24: Hoare triple {5973#(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); {5973#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (= main_~y~0 0))} is VALID [2022-04-28 11:11:37,965 INFO L290 TraceCheckUtils]: 25: Hoare triple {5973#(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; {5998#(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-28 11:11:37,966 INFO L290 TraceCheckUtils]: 26: Hoare triple {5998#(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; {6002#(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-28 11:11:37,966 INFO L290 TraceCheckUtils]: 27: Hoare triple {6002#(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; {6002#(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-28 11:11:37,966 INFO L272 TraceCheckUtils]: 28: Hoare triple {6002#(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)); {5917#true} is VALID [2022-04-28 11:11:37,967 INFO L290 TraceCheckUtils]: 29: Hoare triple {5917#true} ~cond := #in~cond; {6012#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:11:37,967 INFO L290 TraceCheckUtils]: 30: Hoare triple {6012#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {6016#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:11:37,967 INFO L290 TraceCheckUtils]: 31: Hoare triple {6016#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {6016#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:11:37,968 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {6016#(not (= |__VERIFIER_assert_#in~cond| 0))} {6002#(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; {6002#(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-28 11:11:37,968 INFO L290 TraceCheckUtils]: 33: Hoare triple {6002#(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); {6026#(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-28 11:11:37,969 INFO L290 TraceCheckUtils]: 34: Hoare triple {6026#(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; {6030#(and (= main_~y~0 2) (<= main_~x~0 main_~X~0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) (+ main_~v~0 (* main_~X~0 4) (* main_~Y~0 (- 4)))) (= main_~x~0 1))} is VALID [2022-04-28 11:11:37,969 INFO L290 TraceCheckUtils]: 35: Hoare triple {6030#(and (= main_~y~0 2) (<= main_~x~0 main_~X~0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) (+ main_~v~0 (* main_~X~0 4) (* main_~Y~0 (- 4)))) (= main_~x~0 1))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {6034#(and (= (+ (- 1) main_~x~0) 1) (= main_~y~0 2) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) (+ main_~v~0 (* main_~X~0 4) (* main_~Y~0 (- 4)))) (<= main_~x~0 (+ main_~X~0 1)))} is VALID [2022-04-28 11:11:37,970 INFO L290 TraceCheckUtils]: 36: Hoare triple {6034#(and (= (+ (- 1) main_~x~0) 1) (= main_~y~0 2) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) (+ main_~v~0 (* main_~X~0 4) (* 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; {6038#(and (= (+ (- 1) main_~x~0) 1) (= main_~y~0 2) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) (+ main_~v~0 (* main_~X~0 4) (* main_~Y~0 (- 4)))) (= (* 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-28 11:11:37,970 INFO L272 TraceCheckUtils]: 37: Hoare triple {6038#(and (= (+ (- 1) main_~x~0) 1) (= main_~y~0 2) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) (+ main_~v~0 (* main_~X~0 4) (* main_~Y~0 (- 4)))) (= (* 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)); {5917#true} is VALID [2022-04-28 11:11:37,970 INFO L290 TraceCheckUtils]: 38: Hoare triple {5917#true} ~cond := #in~cond; {6012#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:11:37,971 INFO L290 TraceCheckUtils]: 39: Hoare triple {6012#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {6016#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:11:37,971 INFO L290 TraceCheckUtils]: 40: Hoare triple {6016#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {6016#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:11:37,972 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {6016#(not (= |__VERIFIER_assert_#in~cond| 0))} {6038#(and (= (+ (- 1) main_~x~0) 1) (= main_~y~0 2) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) (+ main_~v~0 (* main_~X~0 4) (* main_~Y~0 (- 4)))) (= (* 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; {6034#(and (= (+ (- 1) main_~x~0) 1) (= main_~y~0 2) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) (+ main_~v~0 (* main_~X~0 4) (* main_~Y~0 (- 4)))) (<= main_~x~0 (+ main_~X~0 1)))} is VALID [2022-04-28 11:11:37,972 INFO L290 TraceCheckUtils]: 42: Hoare triple {6034#(and (= (+ (- 1) main_~x~0) 1) (= main_~y~0 2) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) (+ main_~v~0 (* main_~X~0 4) (* main_~Y~0 (- 4)))) (<= main_~x~0 (+ main_~X~0 1)))} assume !(~x~0 <= ~X~0); {6057#(and (= (+ (- 1) main_~x~0) 1) (= main_~y~0 2) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) (+ main_~v~0 (* main_~X~0 4) (* main_~Y~0 (- 4)))) (not (<= main_~x~0 main_~X~0)) (<= main_~x~0 (+ main_~X~0 1)))} is VALID [2022-04-28 11:11:37,973 INFO L290 TraceCheckUtils]: 43: Hoare triple {6057#(and (= (+ (- 1) main_~x~0) 1) (= main_~y~0 2) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) (+ main_~v~0 (* main_~X~0 4) (* main_~Y~0 (- 4)))) (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; {6061#(and (= main_~y~0 2) (= (* main_~y~0 2) main_~xy~0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) (+ main_~v~0 (* main_~X~0 4) (* main_~Y~0 (- 4)))) (= (* main_~Y~0 2) main_~yx~0) (<= 1 main_~X~0) (not (<= 2 main_~X~0)))} is VALID [2022-04-28 11:11:37,974 INFO L272 TraceCheckUtils]: 44: Hoare triple {6061#(and (= main_~y~0 2) (= (* main_~y~0 2) main_~xy~0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) (+ main_~v~0 (* main_~X~0 4) (* main_~Y~0 (- 4)))) (= (* 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)); {6065#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 11:11:37,974 INFO L290 TraceCheckUtils]: 45: Hoare triple {6065#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {6069#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:11:37,975 INFO L290 TraceCheckUtils]: 46: Hoare triple {6069#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {5918#false} is VALID [2022-04-28 11:11:37,975 INFO L290 TraceCheckUtils]: 47: Hoare triple {5918#false} assume !false; {5918#false} is VALID [2022-04-28 11:11:37,975 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-28 11:11:37,975 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 11:11:38,750 INFO L290 TraceCheckUtils]: 47: Hoare triple {5918#false} assume !false; {5918#false} is VALID [2022-04-28 11:11:38,751 INFO L290 TraceCheckUtils]: 46: Hoare triple {6069#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {5918#false} is VALID [2022-04-28 11:11:38,751 INFO L290 TraceCheckUtils]: 45: Hoare triple {6065#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {6069#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:11:38,752 INFO L272 TraceCheckUtils]: 44: Hoare triple {6085#(= (+ (* 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)); {6065#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 11:11:38,753 INFO L290 TraceCheckUtils]: 43: Hoare triple {6089#(= (+ (* 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; {6085#(= (+ (* 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-28 11:11:38,753 INFO L290 TraceCheckUtils]: 42: Hoare triple {6093#(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); {6089#(= (+ (* 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-28 11:11:38,754 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {6016#(not (= |__VERIFIER_assert_#in~cond| 0))} {6097#(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; {6093#(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-28 11:11:38,754 INFO L290 TraceCheckUtils]: 40: Hoare triple {6016#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {6016#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:11:38,755 INFO L290 TraceCheckUtils]: 39: Hoare triple {6107#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {6016#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:11:38,755 INFO L290 TraceCheckUtils]: 38: Hoare triple {5917#true} ~cond := #in~cond; {6107#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 11:11:38,755 INFO L272 TraceCheckUtils]: 37: Hoare triple {6097#(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)); {5917#true} is VALID [2022-04-28 11:11:38,756 INFO L290 TraceCheckUtils]: 36: Hoare triple {6114#(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; {6097#(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-28 11:11:38,776 INFO L290 TraceCheckUtils]: 35: Hoare triple {6118#(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; {6114#(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-28 11:11:38,821 INFO L290 TraceCheckUtils]: 34: Hoare triple {6122#(or (= (+ (* main_~Y~0 main_~x~0 2) (* (- 2) main_~X~0) (* 2 (* (+ main_~x~0 1) (+ main_~y~0 1))) (* (- 2) main_~X~0 main_~y~0) (* main_~Y~0 4)) (+ 2 (* main_~y~0 2) (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0)))) (<= (+ main_~x~0 1) main_~X~0) (not (= (+ (* (- 2) main_~X~0) main_~v~0 (* main_~Y~0 2)) (+ (* main_~Y~0 main_~x~0 2) (* main_~X~0 (- 3)) (* (- 2) main_~X~0 main_~y~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; {6118#(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-28 11:11:38,825 INFO L290 TraceCheckUtils]: 33: Hoare triple {5917#true} assume !!(~x~0 <= ~X~0); {6122#(or (= (+ (* main_~Y~0 main_~x~0 2) (* (- 2) main_~X~0) (* 2 (* (+ main_~x~0 1) (+ main_~y~0 1))) (* (- 2) main_~X~0 main_~y~0) (* main_~Y~0 4)) (+ 2 (* main_~y~0 2) (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0)))) (<= (+ main_~x~0 1) main_~X~0) (not (= (+ (* (- 2) main_~X~0) main_~v~0 (* main_~Y~0 2)) (+ (* main_~Y~0 main_~x~0 2) (* main_~X~0 (- 3)) (* (- 2) main_~X~0 main_~y~0) (* main_~Y~0 4)))))} is VALID [2022-04-28 11:11:38,825 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {5917#true} {5917#true} #65#return; {5917#true} is VALID [2022-04-28 11:11:38,825 INFO L290 TraceCheckUtils]: 31: Hoare triple {5917#true} assume true; {5917#true} is VALID [2022-04-28 11:11:38,826 INFO L290 TraceCheckUtils]: 30: Hoare triple {5917#true} assume !(0 == ~cond); {5917#true} is VALID [2022-04-28 11:11:38,826 INFO L290 TraceCheckUtils]: 29: Hoare triple {5917#true} ~cond := #in~cond; {5917#true} is VALID [2022-04-28 11:11:38,826 INFO L272 TraceCheckUtils]: 28: Hoare triple {5917#true} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {5917#true} is VALID [2022-04-28 11:11:38,826 INFO L290 TraceCheckUtils]: 27: Hoare triple {5917#true} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {5917#true} is VALID [2022-04-28 11:11:38,826 INFO L290 TraceCheckUtils]: 26: Hoare triple {5917#true} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {5917#true} is VALID [2022-04-28 11:11:38,826 INFO L290 TraceCheckUtils]: 25: Hoare triple {5917#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; {5917#true} is VALID [2022-04-28 11:11:38,826 INFO L290 TraceCheckUtils]: 24: Hoare triple {5917#true} assume !!(~x~0 <= ~X~0); {5917#true} is VALID [2022-04-28 11:11:38,826 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {5917#true} {5917#true} #65#return; {5917#true} is VALID [2022-04-28 11:11:38,826 INFO L290 TraceCheckUtils]: 22: Hoare triple {5917#true} assume true; {5917#true} is VALID [2022-04-28 11:11:38,826 INFO L290 TraceCheckUtils]: 21: Hoare triple {5917#true} assume !(0 == ~cond); {5917#true} is VALID [2022-04-28 11:11:38,827 INFO L290 TraceCheckUtils]: 20: Hoare triple {5917#true} ~cond := #in~cond; {5917#true} is VALID [2022-04-28 11:11:38,827 INFO L272 TraceCheckUtils]: 19: Hoare triple {5917#true} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {5917#true} is VALID [2022-04-28 11:11:38,827 INFO L290 TraceCheckUtils]: 18: Hoare triple {5917#true} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {5917#true} is VALID [2022-04-28 11:11:38,827 INFO L290 TraceCheckUtils]: 17: Hoare triple {5917#true} ~v~0 := 2 * ~Y~0 - ~X~0;~y~0 := 0;~x~0 := 0; {5917#true} is VALID [2022-04-28 11:11:38,827 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {5917#true} {5917#true} #63#return; {5917#true} is VALID [2022-04-28 11:11:38,827 INFO L290 TraceCheckUtils]: 15: Hoare triple {5917#true} assume true; {5917#true} is VALID [2022-04-28 11:11:38,827 INFO L290 TraceCheckUtils]: 14: Hoare triple {5917#true} assume !(0 == ~cond); {5917#true} is VALID [2022-04-28 11:11:38,827 INFO L290 TraceCheckUtils]: 13: Hoare triple {5917#true} ~cond := #in~cond; {5917#true} is VALID [2022-04-28 11:11:38,827 INFO L272 TraceCheckUtils]: 12: Hoare triple {5917#true} call assume_abort_if_not((if ~Y~0 >= 0 && ~Y~0 <= 5 then 1 else 0)); {5917#true} is VALID [2022-04-28 11:11:38,828 INFO L290 TraceCheckUtils]: 11: Hoare triple {5917#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~Y~0 := #t~nondet5;havoc #t~nondet5; {5917#true} is VALID [2022-04-28 11:11:38,828 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {5917#true} {5917#true} #61#return; {5917#true} is VALID [2022-04-28 11:11:38,828 INFO L290 TraceCheckUtils]: 9: Hoare triple {5917#true} assume true; {5917#true} is VALID [2022-04-28 11:11:38,828 INFO L290 TraceCheckUtils]: 8: Hoare triple {5917#true} assume !(0 == ~cond); {5917#true} is VALID [2022-04-28 11:11:38,828 INFO L290 TraceCheckUtils]: 7: Hoare triple {5917#true} ~cond := #in~cond; {5917#true} is VALID [2022-04-28 11:11:38,828 INFO L272 TraceCheckUtils]: 6: Hoare triple {5917#true} call assume_abort_if_not((if ~X~0 >= 0 && ~X~0 <= 5 then 1 else 0)); {5917#true} is VALID [2022-04-28 11:11:38,828 INFO L290 TraceCheckUtils]: 5: Hoare triple {5917#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; {5917#true} is VALID [2022-04-28 11:11:38,828 INFO L272 TraceCheckUtils]: 4: Hoare triple {5917#true} call #t~ret8 := main(); {5917#true} is VALID [2022-04-28 11:11:38,828 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5917#true} {5917#true} #69#return; {5917#true} is VALID [2022-04-28 11:11:38,829 INFO L290 TraceCheckUtils]: 2: Hoare triple {5917#true} assume true; {5917#true} is VALID [2022-04-28 11:11:38,829 INFO L290 TraceCheckUtils]: 1: Hoare triple {5917#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); {5917#true} is VALID [2022-04-28 11:11:38,829 INFO L272 TraceCheckUtils]: 0: Hoare triple {5917#true} call ULTIMATE.init(); {5917#true} is VALID [2022-04-28 11:11:38,829 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-28 11:11:38,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:11:38,829 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [350631661] [2022-04-28 11:11:38,829 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 11:11:38,830 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [310952046] [2022-04-28 11:11:38,830 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [310952046] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 11:11:38,830 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 11:11:38,830 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13] total 23 [2022-04-28 11:11:38,830 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:11:38,830 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1679829084] [2022-04-28 11:11:38,831 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1679829084] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:11:38,831 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:11:38,831 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-04-28 11:11:38,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [564870617] [2022-04-28 11:11:38,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:11:38,833 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-28 11:11:38,833 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:11:38,833 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-28 11:11:38,878 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-28 11:11:38,879 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-28 11:11:38,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:11:38,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-28 11:11:38,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=424, Unknown=0, NotChecked=0, Total=506 [2022-04-28 11:11:38,879 INFO L87 Difference]: Start difference. First operand 82 states and 89 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-28 11:11:40,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:11:40,080 INFO L93 Difference]: Finished difference Result 96 states and 103 transitions. [2022-04-28 11:11:40,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-28 11:11:40,080 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-28 11:11:40,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:11:40,080 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-28 11:11:40,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 58 transitions. [2022-04-28 11:11:40,081 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-28 11:11:40,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 58 transitions. [2022-04-28 11:11:40,083 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 58 transitions. [2022-04-28 11:11:40,129 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-28 11:11:40,130 INFO L225 Difference]: With dead ends: 96 [2022-04-28 11:11:40,130 INFO L226 Difference]: Without dead ends: 88 [2022-04-28 11:11:40,131 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 71 SyntacticMatches, 3 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=114, Invalid=588, Unknown=0, NotChecked=0, Total=702 [2022-04-28 11:11:40,131 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 14 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 361 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 365 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 361 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-28 11:11:40,131 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 189 Invalid, 365 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 361 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-28 11:11:40,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2022-04-28 11:11:40,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 79. [2022-04-28 11:11:40,258 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:11:40,258 INFO L82 GeneralOperation]: Start isEquivalent. First operand 88 states. Second operand has 79 states, 57 states have (on average 1.105263157894737) internal successors, (63), 58 states have internal predecessors, (63), 12 states have call successors, (12), 10 states have call predecessors, (12), 9 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-28 11:11:40,259 INFO L74 IsIncluded]: Start isIncluded. First operand 88 states. Second operand has 79 states, 57 states have (on average 1.105263157894737) internal successors, (63), 58 states have internal predecessors, (63), 12 states have call successors, (12), 10 states have call predecessors, (12), 9 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-28 11:11:40,259 INFO L87 Difference]: Start difference. First operand 88 states. Second operand has 79 states, 57 states have (on average 1.105263157894737) internal successors, (63), 58 states have internal predecessors, (63), 12 states have call successors, (12), 10 states have call predecessors, (12), 9 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-28 11:11:40,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:11:40,260 INFO L93 Difference]: Finished difference Result 88 states and 95 transitions. [2022-04-28 11:11:40,260 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 95 transitions. [2022-04-28 11:11:40,261 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:11:40,261 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:11:40,261 INFO L74 IsIncluded]: Start isIncluded. First operand has 79 states, 57 states have (on average 1.105263157894737) internal successors, (63), 58 states have internal predecessors, (63), 12 states have call successors, (12), 10 states have call predecessors, (12), 9 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 88 states. [2022-04-28 11:11:40,261 INFO L87 Difference]: Start difference. First operand has 79 states, 57 states have (on average 1.105263157894737) internal successors, (63), 58 states have internal predecessors, (63), 12 states have call successors, (12), 10 states have call predecessors, (12), 9 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 88 states. [2022-04-28 11:11:40,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:11:40,263 INFO L93 Difference]: Finished difference Result 88 states and 95 transitions. [2022-04-28 11:11:40,263 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 95 transitions. [2022-04-28 11:11:40,263 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:11:40,263 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:11:40,263 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:11:40,264 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:11:40,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 57 states have (on average 1.105263157894737) internal successors, (63), 58 states have internal predecessors, (63), 12 states have call successors, (12), 10 states have call predecessors, (12), 9 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-28 11:11:40,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 85 transitions. [2022-04-28 11:11:40,265 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 85 transitions. Word has length 48 [2022-04-28 11:11:40,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:11:40,266 INFO L495 AbstractCegarLoop]: Abstraction has 79 states and 85 transitions. [2022-04-28 11:11:40,266 INFO L496 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-28 11:11:40,266 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 79 states and 85 transitions. [2022-04-28 11:11:40,393 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 85 edges. 85 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:11:40,393 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 85 transitions. [2022-04-28 11:11:40,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-04-28 11:11:40,394 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:11:40,394 INFO L195 NwaCegarLoop]: 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-28 11:11:40,410 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-04-28 11:11:40,594 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-04-28 11:11:40,595 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:11:40,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:11:40,595 INFO L85 PathProgramCache]: Analyzing trace with hash 1311969331, now seen corresponding path program 5 times [2022-04-28 11:11:40,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:11:40,595 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [666428180] [2022-04-28 11:11:40,595 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 11:11:40,595 INFO L85 PathProgramCache]: Analyzing trace with hash 1311969331, now seen corresponding path program 6 times [2022-04-28 11:11:40,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:11:40,596 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169826083] [2022-04-28 11:11:40,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:11:40,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:11:40,605 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 11:11:40,605 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1230662377] [2022-04-28 11:11:40,606 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 11:11:40,606 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:11:40,606 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:11:40,606 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 11:11:40,607 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-04-28 11:11:40,647 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-04-28 11:11:40,647 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 11:11:40,648 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 60 conjunts are in the unsatisfiable core [2022-04-28 11:11:40,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:11:40,663 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 11:11:49,119 WARN L828 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-28 11:12:05,760 WARN L828 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-28 11:12:06,085 INFO L272 TraceCheckUtils]: 0: Hoare triple {6761#true} call ULTIMATE.init(); {6761#true} is VALID [2022-04-28 11:12:06,085 INFO L290 TraceCheckUtils]: 1: Hoare triple {6761#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); {6761#true} is VALID [2022-04-28 11:12:06,085 INFO L290 TraceCheckUtils]: 2: Hoare triple {6761#true} assume true; {6761#true} is VALID [2022-04-28 11:12:06,085 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6761#true} {6761#true} #69#return; {6761#true} is VALID [2022-04-28 11:12:06,085 INFO L272 TraceCheckUtils]: 4: Hoare triple {6761#true} call #t~ret8 := main(); {6761#true} is VALID [2022-04-28 11:12:06,085 INFO L290 TraceCheckUtils]: 5: Hoare triple {6761#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; {6761#true} is VALID [2022-04-28 11:12:06,085 INFO L272 TraceCheckUtils]: 6: Hoare triple {6761#true} call assume_abort_if_not((if ~X~0 >= 0 && ~X~0 <= 5 then 1 else 0)); {6761#true} is VALID [2022-04-28 11:12:06,086 INFO L290 TraceCheckUtils]: 7: Hoare triple {6761#true} ~cond := #in~cond; {6787#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-28 11:12:06,086 INFO L290 TraceCheckUtils]: 8: Hoare triple {6787#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {6791#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 11:12:06,086 INFO L290 TraceCheckUtils]: 9: Hoare triple {6791#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {6791#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 11:12:06,087 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {6791#(not (= |assume_abort_if_not_#in~cond| 0))} {6761#true} #61#return; {6798#(and (<= 0 main_~X~0) (<= main_~X~0 5))} is VALID [2022-04-28 11:12:06,087 INFO L290 TraceCheckUtils]: 11: Hoare triple {6798#(and (<= 0 main_~X~0) (<= main_~X~0 5))} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~Y~0 := #t~nondet5;havoc #t~nondet5; {6798#(and (<= 0 main_~X~0) (<= main_~X~0 5))} is VALID [2022-04-28 11:12:06,087 INFO L272 TraceCheckUtils]: 12: Hoare triple {6798#(and (<= 0 main_~X~0) (<= main_~X~0 5))} call assume_abort_if_not((if ~Y~0 >= 0 && ~Y~0 <= 5 then 1 else 0)); {6761#true} is VALID [2022-04-28 11:12:06,087 INFO L290 TraceCheckUtils]: 13: Hoare triple {6761#true} ~cond := #in~cond; {6761#true} is VALID [2022-04-28 11:12:06,087 INFO L290 TraceCheckUtils]: 14: Hoare triple {6761#true} assume !(0 == ~cond); {6761#true} is VALID [2022-04-28 11:12:06,087 INFO L290 TraceCheckUtils]: 15: Hoare triple {6761#true} assume true; {6761#true} is VALID [2022-04-28 11:12:06,088 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {6761#true} {6798#(and (<= 0 main_~X~0) (<= main_~X~0 5))} #63#return; {6798#(and (<= 0 main_~X~0) (<= main_~X~0 5))} is VALID [2022-04-28 11:12:06,088 INFO L290 TraceCheckUtils]: 17: Hoare triple {6798#(and (<= 0 main_~X~0) (<= main_~X~0 5))} ~v~0 := 2 * ~Y~0 - ~X~0;~y~0 := 0;~x~0 := 0; {6820#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (<= 0 main_~X~0) (<= main_~X~0 5) (= main_~y~0 0))} is VALID [2022-04-28 11:12:06,089 INFO L290 TraceCheckUtils]: 18: Hoare triple {6820#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (<= 0 main_~X~0) (<= main_~X~0 5) (= main_~y~0 0))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {6824#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (<= 0 main_~X~0) (<= main_~X~0 5) (= (* 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-28 11:12:06,089 INFO L272 TraceCheckUtils]: 19: Hoare triple {6824#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (<= 0 main_~X~0) (<= main_~X~0 5) (= (* 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)); {6761#true} is VALID [2022-04-28 11:12:06,089 INFO L290 TraceCheckUtils]: 20: Hoare triple {6761#true} ~cond := #in~cond; {6831#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:12:06,089 INFO L290 TraceCheckUtils]: 21: Hoare triple {6831#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {6835#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:12:06,090 INFO L290 TraceCheckUtils]: 22: Hoare triple {6835#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {6835#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:12:06,090 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {6835#(not (= |__VERIFIER_assert_#in~cond| 0))} {6824#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (<= 0 main_~X~0) (<= main_~X~0 5) (= (* main_~X~0 main_~y~0) main_~xy~0) (= main_~y~0 0) (= main_~yx~0 (* main_~Y~0 main_~x~0)))} #65#return; {6820#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (<= 0 main_~X~0) (<= main_~X~0 5) (= main_~y~0 0))} is VALID [2022-04-28 11:12:06,091 INFO L290 TraceCheckUtils]: 24: Hoare triple {6820#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (<= 0 main_~X~0) (<= main_~X~0 5) (= main_~y~0 0))} assume !!(~x~0 <= ~X~0); {6820#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (<= 0 main_~X~0) (<= main_~X~0 5) (= main_~y~0 0))} is VALID [2022-04-28 11:12:06,092 INFO L290 TraceCheckUtils]: 25: Hoare triple {6820#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (<= 0 main_~X~0) (<= main_~X~0 5) (= main_~y~0 0))} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {6848#(and (= main_~x~0 0) (= main_~v~0 (+ (* (- 1) main_~X~0) (* main_~Y~0 4))) (<= 0 main_~X~0) (<= main_~X~0 5) (= main_~y~0 0))} is VALID [2022-04-28 11:12:06,092 INFO L290 TraceCheckUtils]: 26: Hoare triple {6848#(and (= main_~x~0 0) (= main_~v~0 (+ (* (- 1) main_~X~0) (* main_~Y~0 4))) (<= 0 main_~X~0) (<= main_~X~0 5) (= main_~y~0 0))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {6852#(and (= main_~v~0 (+ (* (- 1) main_~X~0) (* main_~Y~0 4))) (<= main_~x~0 1) (<= 0 main_~X~0) (<= main_~X~0 5) (= main_~y~0 0))} is VALID [2022-04-28 11:12:08,093 WARN L290 TraceCheckUtils]: 27: Hoare triple {6852#(and (= main_~v~0 (+ (* (- 1) main_~X~0) (* main_~Y~0 4))) (<= main_~x~0 1) (<= 0 main_~X~0) (<= main_~X~0 5) (= main_~y~0 0))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {6856#(and (or (= main_~yx~0 0) (and (= (mod main_~yx~0 main_~Y~0) 0) (<= (div main_~yx~0 main_~Y~0) 1) (not (= main_~Y~0 0)))) (= main_~v~0 (+ (* (- 1) main_~X~0) (* main_~Y~0 4))) (<= 0 main_~X~0) (<= main_~X~0 5) (= (* main_~X~0 main_~y~0) main_~xy~0) (= main_~y~0 0))} is UNKNOWN [2022-04-28 11:12:08,094 INFO L272 TraceCheckUtils]: 28: Hoare triple {6856#(and (or (= main_~yx~0 0) (and (= (mod main_~yx~0 main_~Y~0) 0) (<= (div main_~yx~0 main_~Y~0) 1) (not (= main_~Y~0 0)))) (= main_~v~0 (+ (* (- 1) main_~X~0) (* main_~Y~0 4))) (<= 0 main_~X~0) (<= main_~X~0 5) (= (* 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)); {6761#true} is VALID [2022-04-28 11:12:08,094 INFO L290 TraceCheckUtils]: 29: Hoare triple {6761#true} ~cond := #in~cond; {6831#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:12:08,095 INFO L290 TraceCheckUtils]: 30: Hoare triple {6831#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {6835#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:12:08,095 INFO L290 TraceCheckUtils]: 31: Hoare triple {6835#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {6835#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:12:08,096 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {6835#(not (= |__VERIFIER_assert_#in~cond| 0))} {6856#(and (or (= main_~yx~0 0) (and (= (mod main_~yx~0 main_~Y~0) 0) (<= (div main_~yx~0 main_~Y~0) 1) (not (= main_~Y~0 0)))) (= main_~v~0 (+ (* (- 1) main_~X~0) (* main_~Y~0 4))) (<= 0 main_~X~0) (<= main_~X~0 5) (= (* main_~X~0 main_~y~0) main_~xy~0) (= main_~y~0 0))} #65#return; {6872#(and (= (+ main_~X~0 main_~v~0) (* main_~Y~0 4)) (<= 0 main_~X~0) (<= main_~X~0 5) (= main_~y~0 0))} is VALID [2022-04-28 11:12:08,096 INFO L290 TraceCheckUtils]: 33: Hoare triple {6872#(and (= (+ main_~X~0 main_~v~0) (* main_~Y~0 4)) (<= 0 main_~X~0) (<= main_~X~0 5) (= main_~y~0 0))} assume !!(~x~0 <= ~X~0); {6872#(and (= (+ main_~X~0 main_~v~0) (* main_~Y~0 4)) (<= 0 main_~X~0) (<= main_~X~0 5) (= main_~y~0 0))} is VALID [2022-04-28 11:12:08,097 INFO L290 TraceCheckUtils]: 34: Hoare triple {6872#(and (= (+ main_~X~0 main_~v~0) (* main_~Y~0 4)) (<= 0 main_~X~0) (<= main_~X~0 5) (= main_~y~0 0))} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {6879#(and (= (+ (* (- 1) main_~X~0) (* main_~Y~0 6)) main_~v~0) (< (* main_~Y~0 4) main_~X~0) (<= 0 main_~X~0) (<= main_~X~0 5) (= main_~y~0 0))} is VALID [2022-04-28 11:12:08,097 INFO L290 TraceCheckUtils]: 35: Hoare triple {6879#(and (= (+ (* (- 1) main_~X~0) (* main_~Y~0 6)) main_~v~0) (< (* main_~Y~0 4) main_~X~0) (<= 0 main_~X~0) (<= main_~X~0 5) (= main_~y~0 0))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {6879#(and (= (+ (* (- 1) main_~X~0) (* main_~Y~0 6)) main_~v~0) (< (* main_~Y~0 4) main_~X~0) (<= 0 main_~X~0) (<= main_~X~0 5) (= main_~y~0 0))} is VALID [2022-04-28 11:12:08,098 INFO L290 TraceCheckUtils]: 36: Hoare triple {6879#(and (= (+ (* (- 1) main_~X~0) (* main_~Y~0 6)) main_~v~0) (< (* main_~Y~0 4) main_~X~0) (<= 0 main_~X~0) (<= main_~X~0 5) (= main_~y~0 0))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {6886#(and (= (+ (* (- 1) main_~X~0) (* main_~Y~0 6)) main_~v~0) (< (* main_~Y~0 4) main_~X~0) (<= 0 main_~X~0) (<= main_~X~0 5) (= (* 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-28 11:12:08,098 INFO L272 TraceCheckUtils]: 37: Hoare triple {6886#(and (= (+ (* (- 1) main_~X~0) (* main_~Y~0 6)) main_~v~0) (< (* main_~Y~0 4) main_~X~0) (<= 0 main_~X~0) (<= main_~X~0 5) (= (* 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)); {6761#true} is VALID [2022-04-28 11:12:08,098 INFO L290 TraceCheckUtils]: 38: Hoare triple {6761#true} ~cond := #in~cond; {6831#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:12:08,098 INFO L290 TraceCheckUtils]: 39: Hoare triple {6831#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {6835#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:12:08,099 INFO L290 TraceCheckUtils]: 40: Hoare triple {6835#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {6835#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:12:08,100 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {6835#(not (= |__VERIFIER_assert_#in~cond| 0))} {6886#(and (= (+ (* (- 1) main_~X~0) (* main_~Y~0 6)) main_~v~0) (< (* main_~Y~0 4) main_~X~0) (<= 0 main_~X~0) (<= main_~X~0 5) (= (* main_~X~0 main_~y~0) main_~xy~0) (= main_~y~0 0) (= main_~yx~0 (* main_~Y~0 main_~x~0)))} #65#return; {6902#(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 4) main_~X~0) (<= 0 main_~X~0) (<= main_~X~0 5) (= main_~y~0 0))} is VALID [2022-04-28 11:12:08,100 INFO L290 TraceCheckUtils]: 42: Hoare triple {6902#(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 4) main_~X~0) (<= 0 main_~X~0) (<= main_~X~0 5) (= main_~y~0 0))} assume !!(~x~0 <= ~X~0); {6902#(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 4) main_~X~0) (<= 0 main_~X~0) (<= main_~X~0 5) (= main_~y~0 0))} is VALID [2022-04-28 11:12:08,101 INFO L290 TraceCheckUtils]: 43: Hoare triple {6902#(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 4) main_~X~0) (<= 0 main_~X~0) (<= main_~X~0 5) (= 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; {6909#(and (= (+ (* main_~X~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) (* main_~Y~0 4))) (= main_~y~0 1) (<= main_~X~0 (* main_~Y~0 6)) (< (* main_~Y~0 4) main_~X~0) (= (* main_~Y~0 8) (+ main_~v~0 (* main_~X~0 3))) (<= main_~X~0 5))} is VALID [2022-04-28 11:12:08,104 INFO L290 TraceCheckUtils]: 44: Hoare triple {6909#(and (= (+ (* main_~X~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) (* main_~Y~0 4))) (= main_~y~0 1) (<= main_~X~0 (* main_~Y~0 6)) (< (* main_~Y~0 4) main_~X~0) (= (* main_~Y~0 8) (+ main_~v~0 (* main_~X~0 3))) (<= main_~X~0 5))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {6913#(and (= main_~y~0 1) (<= main_~X~0 (* main_~Y~0 6)) (= (+ (* 2 (* (+ (- 1) main_~x~0) main_~Y~0)) (* main_~X~0 2)) (+ (* (* main_~X~0 main_~y~0) 2) (* main_~Y~0 4))) (< (* main_~Y~0 4) main_~X~0) (= (* main_~Y~0 8) (+ main_~v~0 (* main_~X~0 3))) (<= main_~X~0 5))} is VALID [2022-04-28 11:12:08,105 INFO L290 TraceCheckUtils]: 45: Hoare triple {6913#(and (= main_~y~0 1) (<= main_~X~0 (* main_~Y~0 6)) (= (+ (* 2 (* (+ (- 1) main_~x~0) main_~Y~0)) (* main_~X~0 2)) (+ (* (* main_~X~0 main_~y~0) 2) (* main_~Y~0 4))) (< (* main_~Y~0 4) main_~X~0) (= (* main_~Y~0 8) (+ main_~v~0 (* main_~X~0 3))) (<= main_~X~0 5))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {6917#(and (<= main_~X~0 (* main_~Y~0 6)) (= (* (* (div main_~yx~0 main_~Y~0) main_~Y~0) 2) (* main_~Y~0 6)) (< (* main_~Y~0 4) main_~X~0) (= (* main_~Y~0 8) (+ main_~v~0 (* main_~X~0 3))) (= main_~X~0 main_~xy~0) (<= main_~X~0 5))} is VALID [2022-04-28 11:12:08,106 INFO L272 TraceCheckUtils]: 46: Hoare triple {6917#(and (<= main_~X~0 (* main_~Y~0 6)) (= (* (* (div main_~yx~0 main_~Y~0) main_~Y~0) 2) (* main_~Y~0 6)) (< (* main_~Y~0 4) main_~X~0) (= (* main_~Y~0 8) (+ main_~v~0 (* main_~X~0 3))) (= main_~X~0 main_~xy~0) (<= main_~X~0 5))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {6921#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 11:12:08,107 INFO L290 TraceCheckUtils]: 47: Hoare triple {6921#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {6925#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:12:08,107 INFO L290 TraceCheckUtils]: 48: Hoare triple {6925#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {6762#false} is VALID [2022-04-28 11:12:08,107 INFO L290 TraceCheckUtils]: 49: Hoare triple {6762#false} assume !false; {6762#false} is VALID [2022-04-28 11:12:08,108 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 3 proven. 27 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-04-28 11:12:08,108 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 11:12:12,142 INFO L290 TraceCheckUtils]: 49: Hoare triple {6762#false} assume !false; {6762#false} is VALID [2022-04-28 11:12:12,143 INFO L290 TraceCheckUtils]: 48: Hoare triple {6925#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {6762#false} is VALID [2022-04-28 11:12:12,143 INFO L290 TraceCheckUtils]: 47: Hoare triple {6921#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {6925#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:12:12,144 INFO L272 TraceCheckUtils]: 46: Hoare triple {6941#(= (+ (* 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)); {6921#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 11:12:12,144 INFO L290 TraceCheckUtils]: 45: Hoare triple {6945#(= (+ (* 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; {6941#(= (+ (* 2 main_~xy~0) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 main_~yx~0)))} is VALID [2022-04-28 11:12:12,146 INFO L290 TraceCheckUtils]: 44: Hoare triple {6949#(= (+ (* (* 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; {6945#(= (+ (* 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-28 11:12:12,148 INFO L290 TraceCheckUtils]: 43: Hoare triple {6953#(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; {6949#(= (+ (* (* 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-28 11:12:12,148 INFO L290 TraceCheckUtils]: 42: Hoare triple {6953#(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 !!(~x~0 <= ~X~0); {6953#(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-28 11:12:12,149 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {6835#(not (= |__VERIFIER_assert_#in~cond| 0))} {6960#(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)))))} #65#return; {6953#(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-28 11:12:12,149 INFO L290 TraceCheckUtils]: 40: Hoare triple {6835#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {6835#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:12:12,150 INFO L290 TraceCheckUtils]: 39: Hoare triple {6970#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {6835#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:12:12,150 INFO L290 TraceCheckUtils]: 38: Hoare triple {6761#true} ~cond := #in~cond; {6970#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 11:12:12,150 INFO L272 TraceCheckUtils]: 37: Hoare triple {6960#(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)))))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {6761#true} is VALID [2022-04-28 11:12:12,151 INFO L290 TraceCheckUtils]: 36: Hoare triple {6761#true} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {6960#(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)))))} is VALID [2022-04-28 11:12:12,151 INFO L290 TraceCheckUtils]: 35: Hoare triple {6761#true} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {6761#true} is VALID [2022-04-28 11:12:12,151 INFO L290 TraceCheckUtils]: 34: Hoare triple {6761#true} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {6761#true} is VALID [2022-04-28 11:12:12,151 INFO L290 TraceCheckUtils]: 33: Hoare triple {6761#true} assume !!(~x~0 <= ~X~0); {6761#true} is VALID [2022-04-28 11:12:12,151 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {6761#true} {6761#true} #65#return; {6761#true} is VALID [2022-04-28 11:12:12,151 INFO L290 TraceCheckUtils]: 31: Hoare triple {6761#true} assume true; {6761#true} is VALID [2022-04-28 11:12:12,151 INFO L290 TraceCheckUtils]: 30: Hoare triple {6761#true} assume !(0 == ~cond); {6761#true} is VALID [2022-04-28 11:12:12,152 INFO L290 TraceCheckUtils]: 29: Hoare triple {6761#true} ~cond := #in~cond; {6761#true} is VALID [2022-04-28 11:12:12,152 INFO L272 TraceCheckUtils]: 28: Hoare triple {6761#true} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {6761#true} is VALID [2022-04-28 11:12:12,152 INFO L290 TraceCheckUtils]: 27: Hoare triple {6761#true} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {6761#true} is VALID [2022-04-28 11:12:12,152 INFO L290 TraceCheckUtils]: 26: Hoare triple {6761#true} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {6761#true} is VALID [2022-04-28 11:12:12,152 INFO L290 TraceCheckUtils]: 25: Hoare triple {6761#true} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {6761#true} is VALID [2022-04-28 11:12:12,152 INFO L290 TraceCheckUtils]: 24: Hoare triple {6761#true} assume !!(~x~0 <= ~X~0); {6761#true} is VALID [2022-04-28 11:12:12,152 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {6761#true} {6761#true} #65#return; {6761#true} is VALID [2022-04-28 11:12:12,152 INFO L290 TraceCheckUtils]: 22: Hoare triple {6761#true} assume true; {6761#true} is VALID [2022-04-28 11:12:12,153 INFO L290 TraceCheckUtils]: 21: Hoare triple {6761#true} assume !(0 == ~cond); {6761#true} is VALID [2022-04-28 11:12:12,153 INFO L290 TraceCheckUtils]: 20: Hoare triple {6761#true} ~cond := #in~cond; {6761#true} is VALID [2022-04-28 11:12:12,153 INFO L272 TraceCheckUtils]: 19: Hoare triple {6761#true} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {6761#true} is VALID [2022-04-28 11:12:12,153 INFO L290 TraceCheckUtils]: 18: Hoare triple {6761#true} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {6761#true} is VALID [2022-04-28 11:12:12,153 INFO L290 TraceCheckUtils]: 17: Hoare triple {6761#true} ~v~0 := 2 * ~Y~0 - ~X~0;~y~0 := 0;~x~0 := 0; {6761#true} is VALID [2022-04-28 11:12:12,153 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {6761#true} {6761#true} #63#return; {6761#true} is VALID [2022-04-28 11:12:12,153 INFO L290 TraceCheckUtils]: 15: Hoare triple {6761#true} assume true; {6761#true} is VALID [2022-04-28 11:12:12,153 INFO L290 TraceCheckUtils]: 14: Hoare triple {6761#true} assume !(0 == ~cond); {6761#true} is VALID [2022-04-28 11:12:12,153 INFO L290 TraceCheckUtils]: 13: Hoare triple {6761#true} ~cond := #in~cond; {6761#true} is VALID [2022-04-28 11:12:12,154 INFO L272 TraceCheckUtils]: 12: Hoare triple {6761#true} call assume_abort_if_not((if ~Y~0 >= 0 && ~Y~0 <= 5 then 1 else 0)); {6761#true} is VALID [2022-04-28 11:12:12,154 INFO L290 TraceCheckUtils]: 11: Hoare triple {6761#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~Y~0 := #t~nondet5;havoc #t~nondet5; {6761#true} is VALID [2022-04-28 11:12:12,154 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {6761#true} {6761#true} #61#return; {6761#true} is VALID [2022-04-28 11:12:12,154 INFO L290 TraceCheckUtils]: 9: Hoare triple {6761#true} assume true; {6761#true} is VALID [2022-04-28 11:12:12,154 INFO L290 TraceCheckUtils]: 8: Hoare triple {6761#true} assume !(0 == ~cond); {6761#true} is VALID [2022-04-28 11:12:12,154 INFO L290 TraceCheckUtils]: 7: Hoare triple {6761#true} ~cond := #in~cond; {6761#true} is VALID [2022-04-28 11:12:12,154 INFO L272 TraceCheckUtils]: 6: Hoare triple {6761#true} call assume_abort_if_not((if ~X~0 >= 0 && ~X~0 <= 5 then 1 else 0)); {6761#true} is VALID [2022-04-28 11:12:12,154 INFO L290 TraceCheckUtils]: 5: Hoare triple {6761#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; {6761#true} is VALID [2022-04-28 11:12:12,154 INFO L272 TraceCheckUtils]: 4: Hoare triple {6761#true} call #t~ret8 := main(); {6761#true} is VALID [2022-04-28 11:12:12,154 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6761#true} {6761#true} #69#return; {6761#true} is VALID [2022-04-28 11:12:12,155 INFO L290 TraceCheckUtils]: 2: Hoare triple {6761#true} assume true; {6761#true} is VALID [2022-04-28 11:12:12,155 INFO L290 TraceCheckUtils]: 1: Hoare triple {6761#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); {6761#true} is VALID [2022-04-28 11:12:12,155 INFO L272 TraceCheckUtils]: 0: Hoare triple {6761#true} call ULTIMATE.init(); {6761#true} is VALID [2022-04-28 11:12:12,155 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-28 11:12:12,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:12:12,155 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1169826083] [2022-04-28 11:12:12,155 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 11:12:12,156 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1230662377] [2022-04-28 11:12:12,156 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1230662377] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 11:12:12,156 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 11:12:12,156 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 11] total 27 [2022-04-28 11:12:12,156 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:12:12,156 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [666428180] [2022-04-28 11:12:12,156 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [666428180] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:12:12,156 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:12:12,157 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2022-04-28 11:12:12,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [226007752] [2022-04-28 11:12:12,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:12:12,157 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 17 states have (on average 1.7647058823529411) internal successors, (30), 20 states have internal predecessors, (30), 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-28 11:12:12,157 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:12:12,158 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 21 states, 17 states have (on average 1.7647058823529411) internal successors, (30), 20 states have internal predecessors, (30), 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-28 11:12:14,204 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 43 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 11:12:14,205 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-04-28 11:12:14,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:12:14,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-04-28 11:12:14,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=604, Unknown=0, NotChecked=0, Total=702 [2022-04-28 11:12:14,205 INFO L87 Difference]: Start difference. First operand 79 states and 85 transitions. Second operand has 21 states, 17 states have (on average 1.7647058823529411) internal successors, (30), 20 states have internal predecessors, (30), 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-28 11:12:17,561 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-28 11:12:20,326 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-28 11:12:20,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:12:20,426 INFO L93 Difference]: Finished difference Result 101 states and 112 transitions. [2022-04-28 11:12:20,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-04-28 11:12:20,426 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 17 states have (on average 1.7647058823529411) internal successors, (30), 20 states have internal predecessors, (30), 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-28 11:12:20,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:12:20,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 17 states have (on average 1.7647058823529411) internal successors, (30), 20 states have internal predecessors, (30), 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-28 11:12:20,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 76 transitions. [2022-04-28 11:12:20,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 17 states have (on average 1.7647058823529411) internal successors, (30), 20 states have internal predecessors, (30), 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-28 11:12:20,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 76 transitions. [2022-04-28 11:12:20,430 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 76 transitions. [2022-04-28 11:12:22,516 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 75 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 11:12:22,517 INFO L225 Difference]: With dead ends: 101 [2022-04-28 11:12:22,517 INFO L226 Difference]: Without dead ends: 88 [2022-04-28 11:12:22,518 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 72 SyntacticMatches, 2 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 253 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=149, Invalid=973, Unknown=0, NotChecked=0, Total=1122 [2022-04-28 11:12:22,518 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 32 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 537 mSolverCounterSat, 17 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 556 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 537 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.9s IncrementalHoareTripleChecker+Time [2022-04-28 11:12:22,518 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 163 Invalid, 556 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 537 Invalid, 2 Unknown, 0 Unchecked, 4.9s Time] [2022-04-28 11:12:22,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2022-04-28 11:12:22,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 79. [2022-04-28 11:12:22,654 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:12:22,655 INFO L82 GeneralOperation]: Start isEquivalent. First operand 88 states. Second operand has 79 states, 57 states have (on average 1.105263157894737) internal successors, (63), 58 states have internal predecessors, (63), 12 states have call successors, (12), 10 states have call predecessors, (12), 9 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-28 11:12:22,655 INFO L74 IsIncluded]: Start isIncluded. First operand 88 states. Second operand has 79 states, 57 states have (on average 1.105263157894737) internal successors, (63), 58 states have internal predecessors, (63), 12 states have call successors, (12), 10 states have call predecessors, (12), 9 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-28 11:12:22,655 INFO L87 Difference]: Start difference. First operand 88 states. Second operand has 79 states, 57 states have (on average 1.105263157894737) internal successors, (63), 58 states have internal predecessors, (63), 12 states have call successors, (12), 10 states have call predecessors, (12), 9 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-28 11:12:22,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:12:22,657 INFO L93 Difference]: Finished difference Result 88 states and 94 transitions. [2022-04-28 11:12:22,657 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 94 transitions. [2022-04-28 11:12:22,657 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:12:22,657 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:12:22,658 INFO L74 IsIncluded]: Start isIncluded. First operand has 79 states, 57 states have (on average 1.105263157894737) internal successors, (63), 58 states have internal predecessors, (63), 12 states have call successors, (12), 10 states have call predecessors, (12), 9 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 88 states. [2022-04-28 11:12:22,658 INFO L87 Difference]: Start difference. First operand has 79 states, 57 states have (on average 1.105263157894737) internal successors, (63), 58 states have internal predecessors, (63), 12 states have call successors, (12), 10 states have call predecessors, (12), 9 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 88 states. [2022-04-28 11:12:22,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:12:22,659 INFO L93 Difference]: Finished difference Result 88 states and 94 transitions. [2022-04-28 11:12:22,660 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 94 transitions. [2022-04-28 11:12:22,660 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:12:22,660 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:12:22,660 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:12:22,660 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:12:22,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 57 states have (on average 1.105263157894737) internal successors, (63), 58 states have internal predecessors, (63), 12 states have call successors, (12), 10 states have call predecessors, (12), 9 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-28 11:12:22,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 85 transitions. [2022-04-28 11:12:22,662 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 85 transitions. Word has length 50 [2022-04-28 11:12:22,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:12:22,662 INFO L495 AbstractCegarLoop]: Abstraction has 79 states and 85 transitions. [2022-04-28 11:12:22,662 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 17 states have (on average 1.7647058823529411) internal successors, (30), 20 states have internal predecessors, (30), 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-28 11:12:22,662 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 79 states and 85 transitions. [2022-04-28 11:12:22,812 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 85 edges. 85 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:12:22,812 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 85 transitions. [2022-04-28 11:12:22,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-04-28 11:12:22,813 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:12:22,813 INFO L195 NwaCegarLoop]: 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-28 11:12:22,829 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-04-28 11:12:23,015 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-04-28 11:12:23,015 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:12:23,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:12:23,016 INFO L85 PathProgramCache]: Analyzing trace with hash -1484106385, now seen corresponding path program 7 times [2022-04-28 11:12:23,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:12:23,016 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [760433560] [2022-04-28 11:12:23,016 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 11:12:23,016 INFO L85 PathProgramCache]: Analyzing trace with hash -1484106385, now seen corresponding path program 8 times [2022-04-28 11:12:23,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:12:23,016 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1299830116] [2022-04-28 11:12:23,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:12:23,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:12:23,025 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 11:12:23,026 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1862199188] [2022-04-28 11:12:23,026 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 11:12:23,026 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:12:23,026 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:12:23,027 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 11:12:23,028 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-04-28 11:12:23,067 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 11:12:23,067 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 11:12:23,068 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 41 conjunts are in the unsatisfiable core [2022-04-28 11:12:23,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:12:23,082 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 11:12:33,785 WARN L828 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-28 11:12:37,974 WARN L828 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-28 11:12:44,758 WARN L828 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-28 11:12:56,943 WARN L828 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-28 11:13:06,308 WARN L828 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-28 11:13:28,390 INFO L272 TraceCheckUtils]: 0: Hoare triple {7637#true} call ULTIMATE.init(); {7637#true} is VALID [2022-04-28 11:13:28,390 INFO L290 TraceCheckUtils]: 1: Hoare triple {7637#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); {7637#true} is VALID [2022-04-28 11:13:28,390 INFO L290 TraceCheckUtils]: 2: Hoare triple {7637#true} assume true; {7637#true} is VALID [2022-04-28 11:13:28,390 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7637#true} {7637#true} #69#return; {7637#true} is VALID [2022-04-28 11:13:28,390 INFO L272 TraceCheckUtils]: 4: Hoare triple {7637#true} call #t~ret8 := main(); {7637#true} is VALID [2022-04-28 11:13:28,390 INFO L290 TraceCheckUtils]: 5: Hoare triple {7637#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; {7637#true} is VALID [2022-04-28 11:13:28,390 INFO L272 TraceCheckUtils]: 6: Hoare triple {7637#true} call assume_abort_if_not((if ~X~0 >= 0 && ~X~0 <= 5 then 1 else 0)); {7637#true} is VALID [2022-04-28 11:13:28,390 INFO L290 TraceCheckUtils]: 7: Hoare triple {7637#true} ~cond := #in~cond; {7637#true} is VALID [2022-04-28 11:13:28,390 INFO L290 TraceCheckUtils]: 8: Hoare triple {7637#true} assume !(0 == ~cond); {7637#true} is VALID [2022-04-28 11:13:28,390 INFO L290 TraceCheckUtils]: 9: Hoare triple {7637#true} assume true; {7637#true} is VALID [2022-04-28 11:13:28,391 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {7637#true} {7637#true} #61#return; {7637#true} is VALID [2022-04-28 11:13:28,391 INFO L290 TraceCheckUtils]: 11: Hoare triple {7637#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~Y~0 := #t~nondet5;havoc #t~nondet5; {7637#true} is VALID [2022-04-28 11:13:28,391 INFO L272 TraceCheckUtils]: 12: Hoare triple {7637#true} call assume_abort_if_not((if ~Y~0 >= 0 && ~Y~0 <= 5 then 1 else 0)); {7637#true} is VALID [2022-04-28 11:13:28,391 INFO L290 TraceCheckUtils]: 13: Hoare triple {7637#true} ~cond := #in~cond; {7637#true} is VALID [2022-04-28 11:13:28,391 INFO L290 TraceCheckUtils]: 14: Hoare triple {7637#true} assume !(0 == ~cond); {7637#true} is VALID [2022-04-28 11:13:28,391 INFO L290 TraceCheckUtils]: 15: Hoare triple {7637#true} assume true; {7637#true} is VALID [2022-04-28 11:13:28,391 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {7637#true} {7637#true} #63#return; {7637#true} is VALID [2022-04-28 11:13:28,392 INFO L290 TraceCheckUtils]: 17: Hoare triple {7637#true} ~v~0 := 2 * ~Y~0 - ~X~0;~y~0 := 0;~x~0 := 0; {7693#(and (= (+ main_~X~0 main_~v~0) (* main_~Y~0 2)) (= main_~y~0 0))} is VALID [2022-04-28 11:13:28,392 INFO L290 TraceCheckUtils]: 18: Hoare triple {7693#(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; {7693#(and (= (+ main_~X~0 main_~v~0) (* main_~Y~0 2)) (= main_~y~0 0))} is VALID [2022-04-28 11:13:28,392 INFO L272 TraceCheckUtils]: 19: Hoare triple {7693#(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)); {7637#true} is VALID [2022-04-28 11:13:28,392 INFO L290 TraceCheckUtils]: 20: Hoare triple {7637#true} ~cond := #in~cond; {7637#true} is VALID [2022-04-28 11:13:28,392 INFO L290 TraceCheckUtils]: 21: Hoare triple {7637#true} assume !(0 == ~cond); {7637#true} is VALID [2022-04-28 11:13:28,392 INFO L290 TraceCheckUtils]: 22: Hoare triple {7637#true} assume true; {7637#true} is VALID [2022-04-28 11:13:28,393 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {7637#true} {7693#(and (= (+ main_~X~0 main_~v~0) (* main_~Y~0 2)) (= main_~y~0 0))} #65#return; {7693#(and (= (+ main_~X~0 main_~v~0) (* main_~Y~0 2)) (= main_~y~0 0))} is VALID [2022-04-28 11:13:28,393 INFO L290 TraceCheckUtils]: 24: Hoare triple {7693#(and (= (+ main_~X~0 main_~v~0) (* main_~Y~0 2)) (= main_~y~0 0))} assume !!(~x~0 <= ~X~0); {7693#(and (= (+ main_~X~0 main_~v~0) (* main_~Y~0 2)) (= main_~y~0 0))} is VALID [2022-04-28 11:13:28,394 INFO L290 TraceCheckUtils]: 25: Hoare triple {7693#(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; {7718#(and (= main_~v~0 (+ (* (- 1) main_~X~0) (* main_~Y~0 4))) (= main_~y~0 0))} is VALID [2022-04-28 11:13:28,394 INFO L290 TraceCheckUtils]: 26: Hoare triple {7718#(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; {7718#(and (= main_~v~0 (+ (* (- 1) main_~X~0) (* main_~Y~0 4))) (= main_~y~0 0))} is VALID [2022-04-28 11:13:28,395 INFO L290 TraceCheckUtils]: 27: Hoare triple {7718#(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; {7725#(and (= main_~xy~0 0) (= main_~v~0 (+ (* (- 1) main_~X~0) (* main_~Y~0 4))))} is VALID [2022-04-28 11:13:28,395 INFO L272 TraceCheckUtils]: 28: Hoare triple {7725#(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)); {7637#true} is VALID [2022-04-28 11:13:28,395 INFO L290 TraceCheckUtils]: 29: Hoare triple {7637#true} ~cond := #in~cond; {7732#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:13:28,395 INFO L290 TraceCheckUtils]: 30: Hoare triple {7732#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {7736#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:13:28,396 INFO L290 TraceCheckUtils]: 31: Hoare triple {7736#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {7736#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:13:28,396 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {7736#(not (= |__VERIFIER_assert_#in~cond| 0))} {7725#(and (= main_~xy~0 0) (= main_~v~0 (+ (* (- 1) main_~X~0) (* main_~Y~0 4))))} #65#return; {7743#(= (+ main_~X~0 main_~v~0) (* main_~Y~0 4))} is VALID [2022-04-28 11:13:28,397 INFO L290 TraceCheckUtils]: 33: Hoare triple {7743#(= (+ main_~X~0 main_~v~0) (* main_~Y~0 4))} assume !!(~x~0 <= ~X~0); {7743#(= (+ main_~X~0 main_~v~0) (* main_~Y~0 4))} is VALID [2022-04-28 11:13:28,398 INFO L290 TraceCheckUtils]: 34: Hoare triple {7743#(= (+ 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; {7750#(= (+ (* main_~X~0 (- 3)) (* main_~Y~0 6)) main_~v~0)} is VALID [2022-04-28 11:13:28,398 INFO L290 TraceCheckUtils]: 35: Hoare triple {7750#(= (+ (* main_~X~0 (- 3)) (* main_~Y~0 6)) main_~v~0)} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {7750#(= (+ (* main_~X~0 (- 3)) (* main_~Y~0 6)) main_~v~0)} is VALID [2022-04-28 11:13:28,398 INFO L290 TraceCheckUtils]: 36: Hoare triple {7750#(= (+ (* main_~X~0 (- 3)) (* main_~Y~0 6)) main_~v~0)} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {7757#(and (= (+ (* main_~X~0 (- 3)) (* main_~Y~0 6)) main_~v~0) (= (* main_~X~0 main_~y~0) main_~xy~0) (= main_~yx~0 (* main_~Y~0 main_~x~0)))} is VALID [2022-04-28 11:13:28,398 INFO L272 TraceCheckUtils]: 37: Hoare triple {7757#(and (= (+ (* main_~X~0 (- 3)) (* main_~Y~0 6)) main_~v~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)); {7637#true} is VALID [2022-04-28 11:13:28,399 INFO L290 TraceCheckUtils]: 38: Hoare triple {7637#true} ~cond := #in~cond; {7732#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:13:28,399 INFO L290 TraceCheckUtils]: 39: Hoare triple {7732#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {7736#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:13:28,399 INFO L290 TraceCheckUtils]: 40: Hoare triple {7736#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {7736#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:13:28,400 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {7736#(not (= |__VERIFIER_assert_#in~cond| 0))} {7757#(and (= (+ (* main_~X~0 (- 3)) (* main_~Y~0 6)) main_~v~0) (= (* main_~X~0 main_~y~0) main_~xy~0) (= main_~yx~0 (* main_~Y~0 main_~x~0)))} #65#return; {7773#(and (= (+ (* main_~X~0 (- 3)) (* 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)))} is VALID [2022-04-28 11:13:28,401 INFO L290 TraceCheckUtils]: 42: Hoare triple {7773#(and (= (+ (* main_~X~0 (- 3)) (* 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)))} assume !!(~x~0 <= ~X~0); {7773#(and (= (+ (* main_~X~0 (- 3)) (* 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)))} is VALID [2022-04-28 11:13:28,402 INFO L290 TraceCheckUtils]: 43: Hoare triple {7773#(and (= (+ (* main_~X~0 (- 3)) (* 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)))} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {7780#(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_~X~0 (- 3)) (* main_~Y~0 6)) (+ (* main_~Y~0 main_~x~0 2) (* (- 1) main_~X~0) (* main_~Y~0 2) (* (- 2) main_~X~0 main_~y~0))))} is VALID [2022-04-28 11:13:28,403 INFO L290 TraceCheckUtils]: 44: Hoare triple {7780#(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_~X~0 (- 3)) (* main_~Y~0 6)) (+ (* main_~Y~0 main_~x~0 2) (* (- 1) main_~X~0) (* main_~Y~0 2) (* (- 2) main_~X~0 main_~y~0))))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {7784#(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))) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2) (* (- 2) main_~X~0 main_~y~0) (* (+ (- 1) main_~x~0) main_~Y~0 2)) (+ (* main_~X~0 (- 3)) (* main_~Y~0 6))))} is VALID [2022-04-28 11:13:30,405 WARN L290 TraceCheckUtils]: 45: Hoare triple {7784#(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))) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2) (* (- 2) main_~X~0 main_~y~0) (* (+ (- 1) main_~x~0) main_~Y~0 2)) (+ (* main_~X~0 (- 3)) (* main_~Y~0 6))))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {7788#(or (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)) (= (+ (* (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) (not (= main_~Y~0 0))) (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 (or (and (= (+ (* (div main_~xy~0 main_~X~0) main_~X~0) (* (- 1) main_~Y~0) (div (+ (* (- 1) main_~X~0) (* (- 1) main_~v~0)) (- 2))) 0) (= main_~X~0 (+ (* main_~Y~0 3) (* (div main_~xy~0 main_~X~0) main_~X~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)) (and (= (mod (+ (* (div main_~xy~0 main_~X~0) main_~X~0) (* (- 1) main_~Y~0) (div (+ (* (- 1) main_~X~0) (* (- 1) main_~v~0)) (- 2))) main_~Y~0) 0) (= (* main_~Y~0 (div (+ (* (div main_~xy~0 main_~X~0) main_~X~0) (* (- 1) main_~Y~0) (div (+ (* (- 1) main_~X~0) (* (- 1) main_~v~0)) (- 2))) main_~Y~0)) main_~yx~0) (= (+ (* main_~Y~0 2 (+ (- 1) (div (+ (* (div main_~xy~0 main_~X~0) main_~X~0) (* (- 1) main_~Y~0) (div (+ (* (- 1) main_~X~0) (* (- 1) main_~v~0)) (- 2))) main_~Y~0))) (* (- 1) main_~X~0) (* main_~Y~0 2) (* (- 2) (div main_~xy~0 main_~X~0) main_~X~0)) (+ (* main_~X~0 (- 3)) (* main_~Y~0 6))) (= (mod (+ main_~X~0 main_~v~0 (* (- 2) (div main_~xy~0 main_~X~0) main_~X~0)) 2) 0) (not (= main_~Y~0 0)))) (not (= main_~X~0 0)) (= (mod main_~xy~0 main_~X~0) 0)))} is UNKNOWN [2022-04-28 11:13:30,412 INFO L272 TraceCheckUtils]: 46: Hoare triple {7788#(or (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)) (= (+ (* (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) (not (= main_~Y~0 0))) (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 (or (and (= (+ (* (div main_~xy~0 main_~X~0) main_~X~0) (* (- 1) main_~Y~0) (div (+ (* (- 1) main_~X~0) (* (- 1) main_~v~0)) (- 2))) 0) (= main_~X~0 (+ (* main_~Y~0 3) (* (div main_~xy~0 main_~X~0) main_~X~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)) (and (= (mod (+ (* (div main_~xy~0 main_~X~0) main_~X~0) (* (- 1) main_~Y~0) (div (+ (* (- 1) main_~X~0) (* (- 1) main_~v~0)) (- 2))) main_~Y~0) 0) (= (* main_~Y~0 (div (+ (* (div main_~xy~0 main_~X~0) main_~X~0) (* (- 1) main_~Y~0) (div (+ (* (- 1) main_~X~0) (* (- 1) main_~v~0)) (- 2))) main_~Y~0)) main_~yx~0) (= (+ (* main_~Y~0 2 (+ (- 1) (div (+ (* (div main_~xy~0 main_~X~0) main_~X~0) (* (- 1) main_~Y~0) (div (+ (* (- 1) main_~X~0) (* (- 1) main_~v~0)) (- 2))) main_~Y~0))) (* (- 1) main_~X~0) (* main_~Y~0 2) (* (- 2) (div main_~xy~0 main_~X~0) main_~X~0)) (+ (* main_~X~0 (- 3)) (* main_~Y~0 6))) (= (mod (+ main_~X~0 main_~v~0 (* (- 2) (div main_~xy~0 main_~X~0) main_~X~0)) 2) 0) (not (= main_~Y~0 0)))) (not (= main_~X~0 0)) (= (mod main_~xy~0 main_~X~0) 0)))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {7792#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 11:13:30,413 INFO L290 TraceCheckUtils]: 47: Hoare triple {7792#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {7796#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:13:30,413 INFO L290 TraceCheckUtils]: 48: Hoare triple {7796#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {7638#false} is VALID [2022-04-28 11:13:30,413 INFO L290 TraceCheckUtils]: 49: Hoare triple {7638#false} assume !false; {7638#false} is VALID [2022-04-28 11:13:30,413 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-28 11:13:30,414 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 11:13:35,045 INFO L290 TraceCheckUtils]: 49: Hoare triple {7638#false} assume !false; {7638#false} is VALID [2022-04-28 11:13:35,045 INFO L290 TraceCheckUtils]: 48: Hoare triple {7796#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {7638#false} is VALID [2022-04-28 11:13:35,046 INFO L290 TraceCheckUtils]: 47: Hoare triple {7792#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {7796#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:13:35,046 INFO L272 TraceCheckUtils]: 46: Hoare triple {7812#(= (+ (* 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)); {7792#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 11:13:35,047 INFO L290 TraceCheckUtils]: 45: Hoare triple {7816#(= (+ (* 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; {7812#(= (+ (* 2 main_~xy~0) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 main_~yx~0)))} is VALID [2022-04-28 11:13:35,063 INFO L290 TraceCheckUtils]: 44: Hoare triple {7820#(= (+ (* (* 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; {7816#(= (+ (* 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-28 11:13:35,063 INFO L290 TraceCheckUtils]: 43: Hoare triple {7816#(= (+ (* 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; {7820#(= (+ (* (* 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-28 11:13:35,064 INFO L290 TraceCheckUtils]: 42: Hoare triple {7816#(= (+ (* 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); {7816#(= (+ (* 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-28 11:13:35,065 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {7736#(not (= |__VERIFIER_assert_#in~cond| 0))} {7830#(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; {7816#(= (+ (* 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-28 11:13:35,065 INFO L290 TraceCheckUtils]: 40: Hoare triple {7736#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {7736#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:13:35,065 INFO L290 TraceCheckUtils]: 39: Hoare triple {7840#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {7736#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:13:35,066 INFO L290 TraceCheckUtils]: 38: Hoare triple {7637#true} ~cond := #in~cond; {7840#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 11:13:35,066 INFO L272 TraceCheckUtils]: 37: Hoare triple {7830#(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)); {7637#true} is VALID [2022-04-28 11:13:35,066 INFO L290 TraceCheckUtils]: 36: Hoare triple {7637#true} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {7830#(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-28 11:13:35,067 INFO L290 TraceCheckUtils]: 35: Hoare triple {7637#true} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {7637#true} is VALID [2022-04-28 11:13:35,067 INFO L290 TraceCheckUtils]: 34: Hoare triple {7637#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; {7637#true} is VALID [2022-04-28 11:13:35,067 INFO L290 TraceCheckUtils]: 33: Hoare triple {7637#true} assume !!(~x~0 <= ~X~0); {7637#true} is VALID [2022-04-28 11:13:35,067 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {7637#true} {7637#true} #65#return; {7637#true} is VALID [2022-04-28 11:13:35,067 INFO L290 TraceCheckUtils]: 31: Hoare triple {7637#true} assume true; {7637#true} is VALID [2022-04-28 11:13:35,067 INFO L290 TraceCheckUtils]: 30: Hoare triple {7637#true} assume !(0 == ~cond); {7637#true} is VALID [2022-04-28 11:13:35,067 INFO L290 TraceCheckUtils]: 29: Hoare triple {7637#true} ~cond := #in~cond; {7637#true} is VALID [2022-04-28 11:13:35,067 INFO L272 TraceCheckUtils]: 28: Hoare triple {7637#true} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {7637#true} is VALID [2022-04-28 11:13:35,067 INFO L290 TraceCheckUtils]: 27: Hoare triple {7637#true} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {7637#true} is VALID [2022-04-28 11:13:35,067 INFO L290 TraceCheckUtils]: 26: Hoare triple {7637#true} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {7637#true} is VALID [2022-04-28 11:13:35,067 INFO L290 TraceCheckUtils]: 25: Hoare triple {7637#true} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {7637#true} is VALID [2022-04-28 11:13:35,068 INFO L290 TraceCheckUtils]: 24: Hoare triple {7637#true} assume !!(~x~0 <= ~X~0); {7637#true} is VALID [2022-04-28 11:13:35,068 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {7637#true} {7637#true} #65#return; {7637#true} is VALID [2022-04-28 11:13:35,068 INFO L290 TraceCheckUtils]: 22: Hoare triple {7637#true} assume true; {7637#true} is VALID [2022-04-28 11:13:35,068 INFO L290 TraceCheckUtils]: 21: Hoare triple {7637#true} assume !(0 == ~cond); {7637#true} is VALID [2022-04-28 11:13:35,068 INFO L290 TraceCheckUtils]: 20: Hoare triple {7637#true} ~cond := #in~cond; {7637#true} is VALID [2022-04-28 11:13:35,068 INFO L272 TraceCheckUtils]: 19: Hoare triple {7637#true} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {7637#true} is VALID [2022-04-28 11:13:35,068 INFO L290 TraceCheckUtils]: 18: Hoare triple {7637#true} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {7637#true} is VALID [2022-04-28 11:13:35,068 INFO L290 TraceCheckUtils]: 17: Hoare triple {7637#true} ~v~0 := 2 * ~Y~0 - ~X~0;~y~0 := 0;~x~0 := 0; {7637#true} is VALID [2022-04-28 11:13:35,068 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {7637#true} {7637#true} #63#return; {7637#true} is VALID [2022-04-28 11:13:35,068 INFO L290 TraceCheckUtils]: 15: Hoare triple {7637#true} assume true; {7637#true} is VALID [2022-04-28 11:13:35,069 INFO L290 TraceCheckUtils]: 14: Hoare triple {7637#true} assume !(0 == ~cond); {7637#true} is VALID [2022-04-28 11:13:35,069 INFO L290 TraceCheckUtils]: 13: Hoare triple {7637#true} ~cond := #in~cond; {7637#true} is VALID [2022-04-28 11:13:35,069 INFO L272 TraceCheckUtils]: 12: Hoare triple {7637#true} call assume_abort_if_not((if ~Y~0 >= 0 && ~Y~0 <= 5 then 1 else 0)); {7637#true} is VALID [2022-04-28 11:13:35,069 INFO L290 TraceCheckUtils]: 11: Hoare triple {7637#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~Y~0 := #t~nondet5;havoc #t~nondet5; {7637#true} is VALID [2022-04-28 11:13:35,069 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {7637#true} {7637#true} #61#return; {7637#true} is VALID [2022-04-28 11:13:35,069 INFO L290 TraceCheckUtils]: 9: Hoare triple {7637#true} assume true; {7637#true} is VALID [2022-04-28 11:13:35,069 INFO L290 TraceCheckUtils]: 8: Hoare triple {7637#true} assume !(0 == ~cond); {7637#true} is VALID [2022-04-28 11:13:35,069 INFO L290 TraceCheckUtils]: 7: Hoare triple {7637#true} ~cond := #in~cond; {7637#true} is VALID [2022-04-28 11:13:35,069 INFO L272 TraceCheckUtils]: 6: Hoare triple {7637#true} call assume_abort_if_not((if ~X~0 >= 0 && ~X~0 <= 5 then 1 else 0)); {7637#true} is VALID [2022-04-28 11:13:35,069 INFO L290 TraceCheckUtils]: 5: Hoare triple {7637#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; {7637#true} is VALID [2022-04-28 11:13:35,070 INFO L272 TraceCheckUtils]: 4: Hoare triple {7637#true} call #t~ret8 := main(); {7637#true} is VALID [2022-04-28 11:13:35,070 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7637#true} {7637#true} #69#return; {7637#true} is VALID [2022-04-28 11:13:35,070 INFO L290 TraceCheckUtils]: 2: Hoare triple {7637#true} assume true; {7637#true} is VALID [2022-04-28 11:13:35,070 INFO L290 TraceCheckUtils]: 1: Hoare triple {7637#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); {7637#true} is VALID [2022-04-28 11:13:35,070 INFO L272 TraceCheckUtils]: 0: Hoare triple {7637#true} call ULTIMATE.init(); {7637#true} is VALID [2022-04-28 11:13:35,070 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-28 11:13:35,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:13:35,070 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1299830116] [2022-04-28 11:13:35,071 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 11:13:35,071 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1862199188] [2022-04-28 11:13:35,071 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1862199188] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 11:13:35,071 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 11:13:35,071 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 10] total 21 [2022-04-28 11:13:35,071 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:13:35,071 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [760433560] [2022-04-28 11:13:35,071 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [760433560] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:13:35,071 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:13:35,071 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-04-28 11:13:35,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [165809819] [2022-04-28 11:13:35,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:13:35,072 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-28 11:13:35,072 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:13:35,072 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-28 11:13:37,128 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 43 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 11:13:37,129 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-28 11:13:37,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:13:37,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-28 11:13:37,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=364, Unknown=1, NotChecked=0, Total=420 [2022-04-28 11:13:37,130 INFO L87 Difference]: Start difference. First operand 79 states and 85 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-28 11:13:44,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:13:44,765 INFO L93 Difference]: Finished difference Result 93 states and 100 transitions. [2022-04-28 11:13:44,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-28 11:13:44,766 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-28 11:13:44,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:13:44,766 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-28 11:13:44,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 58 transitions. [2022-04-28 11:13:44,767 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-28 11:13:44,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 58 transitions. [2022-04-28 11:13:44,768 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 58 transitions. [2022-04-28 11:13:46,836 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 57 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 11:13:46,837 INFO L225 Difference]: With dead ends: 93 [2022-04-28 11:13:46,837 INFO L226 Difference]: Without dead ends: 91 [2022-04-28 11:13:46,837 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 78 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 9.4s TimeCoverageRelationStatistics Valid=88, Invalid=561, Unknown=1, NotChecked=0, Total=650 [2022-04-28 11:13:46,839 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 18 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 302 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 210 SdHoareTripleChecker+Invalid, 344 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 302 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 39 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-04-28 11:13:46,839 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 210 Invalid, 344 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 302 Invalid, 0 Unknown, 39 Unchecked, 0.8s Time] [2022-04-28 11:13:46,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2022-04-28 11:13:47,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2022-04-28 11:13:47,006 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:13:47,006 INFO L82 GeneralOperation]: Start isEquivalent. First operand 91 states. Second operand has 91 states, 66 states have (on average 1.0909090909090908) internal successors, (72), 68 states have internal predecessors, (72), 14 states have call successors, (14), 11 states have call predecessors, (14), 10 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-28 11:13:47,007 INFO L74 IsIncluded]: Start isIncluded. First operand 91 states. Second operand has 91 states, 66 states have (on average 1.0909090909090908) internal successors, (72), 68 states have internal predecessors, (72), 14 states have call successors, (14), 11 states have call predecessors, (14), 10 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-28 11:13:47,007 INFO L87 Difference]: Start difference. First operand 91 states. Second operand has 91 states, 66 states have (on average 1.0909090909090908) internal successors, (72), 68 states have internal predecessors, (72), 14 states have call successors, (14), 11 states have call predecessors, (14), 10 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-28 11:13:47,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:13:47,009 INFO L93 Difference]: Finished difference Result 91 states and 98 transitions. [2022-04-28 11:13:47,009 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 98 transitions. [2022-04-28 11:13:47,009 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:13:47,009 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:13:47,010 INFO L74 IsIncluded]: Start isIncluded. First operand has 91 states, 66 states have (on average 1.0909090909090908) internal successors, (72), 68 states have internal predecessors, (72), 14 states have call successors, (14), 11 states have call predecessors, (14), 10 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) Second operand 91 states. [2022-04-28 11:13:47,010 INFO L87 Difference]: Start difference. First operand has 91 states, 66 states have (on average 1.0909090909090908) internal successors, (72), 68 states have internal predecessors, (72), 14 states have call successors, (14), 11 states have call predecessors, (14), 10 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) Second operand 91 states. [2022-04-28 11:13:47,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:13:47,012 INFO L93 Difference]: Finished difference Result 91 states and 98 transitions. [2022-04-28 11:13:47,012 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 98 transitions. [2022-04-28 11:13:47,012 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:13:47,012 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:13:47,012 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:13:47,012 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:13:47,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 66 states have (on average 1.0909090909090908) internal successors, (72), 68 states have internal predecessors, (72), 14 states have call successors, (14), 11 states have call predecessors, (14), 10 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-28 11:13:47,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 98 transitions. [2022-04-28 11:13:47,014 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 98 transitions. Word has length 50 [2022-04-28 11:13:47,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:13:47,015 INFO L495 AbstractCegarLoop]: Abstraction has 91 states and 98 transitions. [2022-04-28 11:13:47,015 INFO L496 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-28 11:13:47,015 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 91 states and 98 transitions. [2022-04-28 11:13:49,218 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 98 edges. 97 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 11:13:49,218 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 98 transitions. [2022-04-28 11:13:49,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-04-28 11:13:49,219 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:13:49,219 INFO L195 NwaCegarLoop]: 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-28 11:13:49,236 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-04-28 11:13:49,423 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-04-28 11:13:49,424 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:13:49,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:13:49,424 INFO L85 PathProgramCache]: Analyzing trace with hash -322489421, now seen corresponding path program 9 times [2022-04-28 11:13:49,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:13:49,424 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1662317882] [2022-04-28 11:13:49,424 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 11:13:49,424 INFO L85 PathProgramCache]: Analyzing trace with hash -322489421, now seen corresponding path program 10 times [2022-04-28 11:13:49,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:13:49,424 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330125008] [2022-04-28 11:13:49,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:13:49,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:13:49,434 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 11:13:49,434 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [217279720] [2022-04-28 11:13:49,434 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 11:13:49,434 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:13:49,435 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:13:49,436 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 11:13:49,440 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-04-28 11:13:49,472 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 11:13:49,473 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 11:13:49,473 INFO L263 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-28 11:13:49,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:13:49,485 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 11:13:49,944 INFO L272 TraceCheckUtils]: 0: Hoare triple {8517#true} call ULTIMATE.init(); {8517#true} is VALID [2022-04-28 11:13:49,945 INFO L290 TraceCheckUtils]: 1: Hoare triple {8517#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); {8517#true} is VALID [2022-04-28 11:13:49,945 INFO L290 TraceCheckUtils]: 2: Hoare triple {8517#true} assume true; {8517#true} is VALID [2022-04-28 11:13:49,945 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8517#true} {8517#true} #69#return; {8517#true} is VALID [2022-04-28 11:13:49,945 INFO L272 TraceCheckUtils]: 4: Hoare triple {8517#true} call #t~ret8 := main(); {8517#true} is VALID [2022-04-28 11:13:49,945 INFO L290 TraceCheckUtils]: 5: Hoare triple {8517#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; {8517#true} is VALID [2022-04-28 11:13:49,945 INFO L272 TraceCheckUtils]: 6: Hoare triple {8517#true} call assume_abort_if_not((if ~X~0 >= 0 && ~X~0 <= 5 then 1 else 0)); {8517#true} is VALID [2022-04-28 11:13:49,945 INFO L290 TraceCheckUtils]: 7: Hoare triple {8517#true} ~cond := #in~cond; {8517#true} is VALID [2022-04-28 11:13:49,945 INFO L290 TraceCheckUtils]: 8: Hoare triple {8517#true} assume !(0 == ~cond); {8517#true} is VALID [2022-04-28 11:13:49,945 INFO L290 TraceCheckUtils]: 9: Hoare triple {8517#true} assume true; {8517#true} is VALID [2022-04-28 11:13:49,945 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {8517#true} {8517#true} #61#return; {8517#true} is VALID [2022-04-28 11:13:49,946 INFO L290 TraceCheckUtils]: 11: Hoare triple {8517#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~Y~0 := #t~nondet5;havoc #t~nondet5; {8517#true} is VALID [2022-04-28 11:13:49,946 INFO L272 TraceCheckUtils]: 12: Hoare triple {8517#true} call assume_abort_if_not((if ~Y~0 >= 0 && ~Y~0 <= 5 then 1 else 0)); {8517#true} is VALID [2022-04-28 11:13:49,946 INFO L290 TraceCheckUtils]: 13: Hoare triple {8517#true} ~cond := #in~cond; {8517#true} is VALID [2022-04-28 11:13:49,946 INFO L290 TraceCheckUtils]: 14: Hoare triple {8517#true} assume !(0 == ~cond); {8517#true} is VALID [2022-04-28 11:13:49,946 INFO L290 TraceCheckUtils]: 15: Hoare triple {8517#true} assume true; {8517#true} is VALID [2022-04-28 11:13:49,946 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {8517#true} {8517#true} #63#return; {8517#true} is VALID [2022-04-28 11:13:49,946 INFO L290 TraceCheckUtils]: 17: Hoare triple {8517#true} ~v~0 := 2 * ~Y~0 - ~X~0;~y~0 := 0;~x~0 := 0; {8573#(<= (+ main_~X~0 main_~v~0) (* main_~Y~0 2))} is VALID [2022-04-28 11:13:49,947 INFO L290 TraceCheckUtils]: 18: Hoare triple {8573#(<= (+ main_~X~0 main_~v~0) (* main_~Y~0 2))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {8573#(<= (+ main_~X~0 main_~v~0) (* main_~Y~0 2))} is VALID [2022-04-28 11:13:49,947 INFO L272 TraceCheckUtils]: 19: Hoare triple {8573#(<= (+ 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)); {8517#true} is VALID [2022-04-28 11:13:49,947 INFO L290 TraceCheckUtils]: 20: Hoare triple {8517#true} ~cond := #in~cond; {8517#true} is VALID [2022-04-28 11:13:49,947 INFO L290 TraceCheckUtils]: 21: Hoare triple {8517#true} assume !(0 == ~cond); {8517#true} is VALID [2022-04-28 11:13:49,947 INFO L290 TraceCheckUtils]: 22: Hoare triple {8517#true} assume true; {8517#true} is VALID [2022-04-28 11:13:49,948 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {8517#true} {8573#(<= (+ main_~X~0 main_~v~0) (* main_~Y~0 2))} #65#return; {8573#(<= (+ main_~X~0 main_~v~0) (* main_~Y~0 2))} is VALID [2022-04-28 11:13:49,948 INFO L290 TraceCheckUtils]: 24: Hoare triple {8573#(<= (+ main_~X~0 main_~v~0) (* main_~Y~0 2))} assume !!(~x~0 <= ~X~0); {8573#(<= (+ main_~X~0 main_~v~0) (* main_~Y~0 2))} is VALID [2022-04-28 11:13:49,949 INFO L290 TraceCheckUtils]: 25: Hoare triple {8573#(<= (+ 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; {8598#(<= (div main_~v~0 (- 2)) main_~Y~0)} is VALID [2022-04-28 11:13:49,949 INFO L290 TraceCheckUtils]: 26: Hoare triple {8598#(<= (div main_~v~0 (- 2)) main_~Y~0)} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {8598#(<= (div main_~v~0 (- 2)) main_~Y~0)} is VALID [2022-04-28 11:13:49,949 INFO L290 TraceCheckUtils]: 27: Hoare triple {8598#(<= (div main_~v~0 (- 2)) main_~Y~0)} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {8598#(<= (div main_~v~0 (- 2)) main_~Y~0)} is VALID [2022-04-28 11:13:49,950 INFO L272 TraceCheckUtils]: 28: Hoare triple {8598#(<= (div 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)); {8517#true} is VALID [2022-04-28 11:13:49,950 INFO L290 TraceCheckUtils]: 29: Hoare triple {8517#true} ~cond := #in~cond; {8517#true} is VALID [2022-04-28 11:13:49,950 INFO L290 TraceCheckUtils]: 30: Hoare triple {8517#true} assume !(0 == ~cond); {8517#true} is VALID [2022-04-28 11:13:49,950 INFO L290 TraceCheckUtils]: 31: Hoare triple {8517#true} assume true; {8517#true} is VALID [2022-04-28 11:13:49,950 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {8517#true} {8598#(<= (div main_~v~0 (- 2)) main_~Y~0)} #65#return; {8598#(<= (div main_~v~0 (- 2)) main_~Y~0)} is VALID [2022-04-28 11:13:49,951 INFO L290 TraceCheckUtils]: 33: Hoare triple {8598#(<= (div main_~v~0 (- 2)) main_~Y~0)} assume !!(~x~0 <= ~X~0); {8598#(<= (div main_~v~0 (- 2)) main_~Y~0)} is VALID [2022-04-28 11:13:49,951 INFO L290 TraceCheckUtils]: 34: Hoare triple {8598#(<= (div main_~v~0 (- 2)) main_~Y~0)} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {8626#(<= (div main_~v~0 (- 2)) 0)} is VALID [2022-04-28 11:13:49,952 INFO L290 TraceCheckUtils]: 35: Hoare triple {8626#(<= (div main_~v~0 (- 2)) 0)} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {8626#(<= (div main_~v~0 (- 2)) 0)} is VALID [2022-04-28 11:13:49,952 INFO L290 TraceCheckUtils]: 36: Hoare triple {8626#(<= (div main_~v~0 (- 2)) 0)} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {8626#(<= (div main_~v~0 (- 2)) 0)} is VALID [2022-04-28 11:13:49,952 INFO L272 TraceCheckUtils]: 37: Hoare triple {8626#(<= (div main_~v~0 (- 2)) 0)} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {8517#true} is VALID [2022-04-28 11:13:49,952 INFO L290 TraceCheckUtils]: 38: Hoare triple {8517#true} ~cond := #in~cond; {8517#true} is VALID [2022-04-28 11:13:49,952 INFO L290 TraceCheckUtils]: 39: Hoare triple {8517#true} assume !(0 == ~cond); {8517#true} is VALID [2022-04-28 11:13:49,952 INFO L290 TraceCheckUtils]: 40: Hoare triple {8517#true} assume true; {8517#true} is VALID [2022-04-28 11:13:49,953 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {8517#true} {8626#(<= (div main_~v~0 (- 2)) 0)} #65#return; {8626#(<= (div main_~v~0 (- 2)) 0)} is VALID [2022-04-28 11:13:49,953 INFO L290 TraceCheckUtils]: 42: Hoare triple {8626#(<= (div main_~v~0 (- 2)) 0)} assume !!(~x~0 <= ~X~0); {8626#(<= (div main_~v~0 (- 2)) 0)} is VALID [2022-04-28 11:13:49,953 INFO L290 TraceCheckUtils]: 43: Hoare triple {8626#(<= (div main_~v~0 (- 2)) 0)} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {8518#false} is VALID [2022-04-28 11:13:49,953 INFO L290 TraceCheckUtils]: 44: Hoare triple {8518#false} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {8518#false} is VALID [2022-04-28 11:13:49,954 INFO L290 TraceCheckUtils]: 45: Hoare triple {8518#false} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {8518#false} is VALID [2022-04-28 11:13:49,954 INFO L272 TraceCheckUtils]: 46: Hoare triple {8518#false} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {8518#false} is VALID [2022-04-28 11:13:49,954 INFO L290 TraceCheckUtils]: 47: Hoare triple {8518#false} ~cond := #in~cond; {8518#false} is VALID [2022-04-28 11:13:49,954 INFO L290 TraceCheckUtils]: 48: Hoare triple {8518#false} assume 0 == ~cond; {8518#false} is VALID [2022-04-28 11:13:49,954 INFO L290 TraceCheckUtils]: 49: Hoare triple {8518#false} assume !false; {8518#false} is VALID [2022-04-28 11:13:49,954 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-28 11:13:49,954 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 11:13:50,492 INFO L290 TraceCheckUtils]: 49: Hoare triple {8518#false} assume !false; {8518#false} is VALID [2022-04-28 11:13:50,492 INFO L290 TraceCheckUtils]: 48: Hoare triple {8518#false} assume 0 == ~cond; {8518#false} is VALID [2022-04-28 11:13:50,492 INFO L290 TraceCheckUtils]: 47: Hoare triple {8518#false} ~cond := #in~cond; {8518#false} is VALID [2022-04-28 11:13:50,492 INFO L272 TraceCheckUtils]: 46: Hoare triple {8518#false} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {8518#false} is VALID [2022-04-28 11:13:50,492 INFO L290 TraceCheckUtils]: 45: Hoare triple {8518#false} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {8518#false} is VALID [2022-04-28 11:13:50,492 INFO L290 TraceCheckUtils]: 44: Hoare triple {8518#false} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {8518#false} is VALID [2022-04-28 11:13:50,493 INFO L290 TraceCheckUtils]: 43: Hoare triple {8626#(<= (div main_~v~0 (- 2)) 0)} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {8518#false} is VALID [2022-04-28 11:13:50,493 INFO L290 TraceCheckUtils]: 42: Hoare triple {8626#(<= (div main_~v~0 (- 2)) 0)} assume !!(~x~0 <= ~X~0); {8626#(<= (div main_~v~0 (- 2)) 0)} is VALID [2022-04-28 11:13:50,494 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {8517#true} {8626#(<= (div main_~v~0 (- 2)) 0)} #65#return; {8626#(<= (div main_~v~0 (- 2)) 0)} is VALID [2022-04-28 11:13:50,494 INFO L290 TraceCheckUtils]: 40: Hoare triple {8517#true} assume true; {8517#true} is VALID [2022-04-28 11:13:50,494 INFO L290 TraceCheckUtils]: 39: Hoare triple {8517#true} assume !(0 == ~cond); {8517#true} is VALID [2022-04-28 11:13:50,494 INFO L290 TraceCheckUtils]: 38: Hoare triple {8517#true} ~cond := #in~cond; {8517#true} is VALID [2022-04-28 11:13:50,494 INFO L272 TraceCheckUtils]: 37: Hoare triple {8626#(<= (div main_~v~0 (- 2)) 0)} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {8517#true} is VALID [2022-04-28 11:13:50,494 INFO L290 TraceCheckUtils]: 36: Hoare triple {8626#(<= (div main_~v~0 (- 2)) 0)} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {8626#(<= (div main_~v~0 (- 2)) 0)} is VALID [2022-04-28 11:13:50,495 INFO L290 TraceCheckUtils]: 35: Hoare triple {8626#(<= (div main_~v~0 (- 2)) 0)} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {8626#(<= (div main_~v~0 (- 2)) 0)} is VALID [2022-04-28 11:13:50,496 INFO L290 TraceCheckUtils]: 34: Hoare triple {8598#(<= (div main_~v~0 (- 2)) main_~Y~0)} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {8626#(<= (div main_~v~0 (- 2)) 0)} is VALID [2022-04-28 11:13:50,496 INFO L290 TraceCheckUtils]: 33: Hoare triple {8598#(<= (div main_~v~0 (- 2)) main_~Y~0)} assume !!(~x~0 <= ~X~0); {8598#(<= (div main_~v~0 (- 2)) main_~Y~0)} is VALID [2022-04-28 11:13:50,496 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {8517#true} {8598#(<= (div main_~v~0 (- 2)) main_~Y~0)} #65#return; {8598#(<= (div main_~v~0 (- 2)) main_~Y~0)} is VALID [2022-04-28 11:13:50,496 INFO L290 TraceCheckUtils]: 31: Hoare triple {8517#true} assume true; {8517#true} is VALID [2022-04-28 11:13:50,496 INFO L290 TraceCheckUtils]: 30: Hoare triple {8517#true} assume !(0 == ~cond); {8517#true} is VALID [2022-04-28 11:13:50,497 INFO L290 TraceCheckUtils]: 29: Hoare triple {8517#true} ~cond := #in~cond; {8517#true} is VALID [2022-04-28 11:13:50,497 INFO L272 TraceCheckUtils]: 28: Hoare triple {8598#(<= (div 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)); {8517#true} is VALID [2022-04-28 11:13:50,497 INFO L290 TraceCheckUtils]: 27: Hoare triple {8598#(<= (div main_~v~0 (- 2)) main_~Y~0)} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {8598#(<= (div main_~v~0 (- 2)) main_~Y~0)} is VALID [2022-04-28 11:13:50,497 INFO L290 TraceCheckUtils]: 26: Hoare triple {8598#(<= (div main_~v~0 (- 2)) main_~Y~0)} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {8598#(<= (div main_~v~0 (- 2)) main_~Y~0)} is VALID [2022-04-28 11:13:50,498 INFO L290 TraceCheckUtils]: 25: Hoare triple {8744#(or (< main_~v~0 0) (<= (+ (div (+ (- 2) main_~v~0) (- 2)) main_~X~0) (+ (* main_~Y~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; {8598#(<= (div main_~v~0 (- 2)) main_~Y~0)} is VALID [2022-04-28 11:13:50,498 INFO L290 TraceCheckUtils]: 24: Hoare triple {8744#(or (< main_~v~0 0) (<= (+ (div (+ (- 2) main_~v~0) (- 2)) main_~X~0) (+ (* main_~Y~0 2) 1)))} assume !!(~x~0 <= ~X~0); {8744#(or (< main_~v~0 0) (<= (+ (div (+ (- 2) main_~v~0) (- 2)) main_~X~0) (+ (* main_~Y~0 2) 1)))} is VALID [2022-04-28 11:13:50,499 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {8517#true} {8744#(or (< main_~v~0 0) (<= (+ (div (+ (- 2) main_~v~0) (- 2)) main_~X~0) (+ (* main_~Y~0 2) 1)))} #65#return; {8744#(or (< main_~v~0 0) (<= (+ (div (+ (- 2) main_~v~0) (- 2)) main_~X~0) (+ (* main_~Y~0 2) 1)))} is VALID [2022-04-28 11:13:50,499 INFO L290 TraceCheckUtils]: 22: Hoare triple {8517#true} assume true; {8517#true} is VALID [2022-04-28 11:13:50,499 INFO L290 TraceCheckUtils]: 21: Hoare triple {8517#true} assume !(0 == ~cond); {8517#true} is VALID [2022-04-28 11:13:50,499 INFO L290 TraceCheckUtils]: 20: Hoare triple {8517#true} ~cond := #in~cond; {8517#true} is VALID [2022-04-28 11:13:50,499 INFO L272 TraceCheckUtils]: 19: Hoare triple {8744#(or (< main_~v~0 0) (<= (+ (div (+ (- 2) main_~v~0) (- 2)) main_~X~0) (+ (* main_~Y~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)); {8517#true} is VALID [2022-04-28 11:13:50,500 INFO L290 TraceCheckUtils]: 18: Hoare triple {8744#(or (< main_~v~0 0) (<= (+ (div (+ (- 2) main_~v~0) (- 2)) main_~X~0) (+ (* main_~Y~0 2) 1)))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {8744#(or (< main_~v~0 0) (<= (+ (div (+ (- 2) main_~v~0) (- 2)) main_~X~0) (+ (* main_~Y~0 2) 1)))} is VALID [2022-04-28 11:13:50,500 INFO L290 TraceCheckUtils]: 17: Hoare triple {8517#true} ~v~0 := 2 * ~Y~0 - ~X~0;~y~0 := 0;~x~0 := 0; {8744#(or (< main_~v~0 0) (<= (+ (div (+ (- 2) main_~v~0) (- 2)) main_~X~0) (+ (* main_~Y~0 2) 1)))} is VALID [2022-04-28 11:13:50,500 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {8517#true} {8517#true} #63#return; {8517#true} is VALID [2022-04-28 11:13:50,500 INFO L290 TraceCheckUtils]: 15: Hoare triple {8517#true} assume true; {8517#true} is VALID [2022-04-28 11:13:50,501 INFO L290 TraceCheckUtils]: 14: Hoare triple {8517#true} assume !(0 == ~cond); {8517#true} is VALID [2022-04-28 11:13:50,501 INFO L290 TraceCheckUtils]: 13: Hoare triple {8517#true} ~cond := #in~cond; {8517#true} is VALID [2022-04-28 11:13:50,501 INFO L272 TraceCheckUtils]: 12: Hoare triple {8517#true} call assume_abort_if_not((if ~Y~0 >= 0 && ~Y~0 <= 5 then 1 else 0)); {8517#true} is VALID [2022-04-28 11:13:50,501 INFO L290 TraceCheckUtils]: 11: Hoare triple {8517#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~Y~0 := #t~nondet5;havoc #t~nondet5; {8517#true} is VALID [2022-04-28 11:13:50,501 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {8517#true} {8517#true} #61#return; {8517#true} is VALID [2022-04-28 11:13:50,501 INFO L290 TraceCheckUtils]: 9: Hoare triple {8517#true} assume true; {8517#true} is VALID [2022-04-28 11:13:50,501 INFO L290 TraceCheckUtils]: 8: Hoare triple {8517#true} assume !(0 == ~cond); {8517#true} is VALID [2022-04-28 11:13:50,501 INFO L290 TraceCheckUtils]: 7: Hoare triple {8517#true} ~cond := #in~cond; {8517#true} is VALID [2022-04-28 11:13:50,501 INFO L272 TraceCheckUtils]: 6: Hoare triple {8517#true} call assume_abort_if_not((if ~X~0 >= 0 && ~X~0 <= 5 then 1 else 0)); {8517#true} is VALID [2022-04-28 11:13:50,501 INFO L290 TraceCheckUtils]: 5: Hoare triple {8517#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; {8517#true} is VALID [2022-04-28 11:13:50,501 INFO L272 TraceCheckUtils]: 4: Hoare triple {8517#true} call #t~ret8 := main(); {8517#true} is VALID [2022-04-28 11:13:50,501 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8517#true} {8517#true} #69#return; {8517#true} is VALID [2022-04-28 11:13:50,501 INFO L290 TraceCheckUtils]: 2: Hoare triple {8517#true} assume true; {8517#true} is VALID [2022-04-28 11:13:50,501 INFO L290 TraceCheckUtils]: 1: Hoare triple {8517#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); {8517#true} is VALID [2022-04-28 11:13:50,501 INFO L272 TraceCheckUtils]: 0: Hoare triple {8517#true} call ULTIMATE.init(); {8517#true} is VALID [2022-04-28 11:13:50,502 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-28 11:13:50,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:13:50,502 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [330125008] [2022-04-28 11:13:50,502 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 11:13:50,502 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [217279720] [2022-04-28 11:13:50,502 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [217279720] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 11:13:50,502 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 11:13:50,502 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2022-04-28 11:13:50,502 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:13:50,502 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1662317882] [2022-04-28 11:13:50,503 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1662317882] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:13:50,503 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:13:50,503 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 11:13:50,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1554330195] [2022-04-28 11:13:50,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:13:50,503 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-28 11:13:50,505 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:13:50,505 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-28 11:13:50,535 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:13:50,535 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 11:13:50,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:13:50,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 11:13:50,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-04-28 11:13:50,536 INFO L87 Difference]: Start difference. First operand 91 states and 98 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-28 11:13:50,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:13:50,971 INFO L93 Difference]: Finished difference Result 109 states and 120 transitions. [2022-04-28 11:13:50,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 11:13:50,972 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-28 11:13:50,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:13:50,972 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-28 11:13:50,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 65 transitions. [2022-04-28 11:13:50,973 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-28 11:13:50,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 65 transitions. [2022-04-28 11:13:50,974 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 65 transitions. [2022-04-28 11:13:51,046 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:13:51,048 INFO L225 Difference]: With dead ends: 109 [2022-04-28 11:13:51,048 INFO L226 Difference]: Without dead ends: 96 [2022-04-28 11:13:51,048 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 93 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-04-28 11:13:51,049 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 0 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 11:13:51,049 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 97 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 11:13:51,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2022-04-28 11:13:51,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2022-04-28 11:13:51,266 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:13:51,266 INFO L82 GeneralOperation]: Start isEquivalent. First operand 96 states. Second operand has 96 states, 70 states have (on average 1.0857142857142856) internal successors, (76), 72 states have internal predecessors, (76), 15 states have call successors, (15), 11 states have call predecessors, (15), 10 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-28 11:13:51,266 INFO L74 IsIncluded]: Start isIncluded. First operand 96 states. Second operand has 96 states, 70 states have (on average 1.0857142857142856) internal successors, (76), 72 states have internal predecessors, (76), 15 states have call successors, (15), 11 states have call predecessors, (15), 10 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-28 11:13:51,266 INFO L87 Difference]: Start difference. First operand 96 states. Second operand has 96 states, 70 states have (on average 1.0857142857142856) internal successors, (76), 72 states have internal predecessors, (76), 15 states have call successors, (15), 11 states have call predecessors, (15), 10 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-28 11:13:51,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:13:51,268 INFO L93 Difference]: Finished difference Result 96 states and 104 transitions. [2022-04-28 11:13:51,268 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 104 transitions. [2022-04-28 11:13:51,269 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:13:51,269 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:13:51,269 INFO L74 IsIncluded]: Start isIncluded. First operand has 96 states, 70 states have (on average 1.0857142857142856) internal successors, (76), 72 states have internal predecessors, (76), 15 states have call successors, (15), 11 states have call predecessors, (15), 10 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) Second operand 96 states. [2022-04-28 11:13:51,269 INFO L87 Difference]: Start difference. First operand has 96 states, 70 states have (on average 1.0857142857142856) internal successors, (76), 72 states have internal predecessors, (76), 15 states have call successors, (15), 11 states have call predecessors, (15), 10 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) Second operand 96 states. [2022-04-28 11:13:51,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:13:51,271 INFO L93 Difference]: Finished difference Result 96 states and 104 transitions. [2022-04-28 11:13:51,271 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 104 transitions. [2022-04-28 11:13:51,271 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:13:51,271 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:13:51,272 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:13:51,272 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:13:51,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 70 states have (on average 1.0857142857142856) internal successors, (76), 72 states have internal predecessors, (76), 15 states have call successors, (15), 11 states have call predecessors, (15), 10 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-28 11:13:51,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 104 transitions. [2022-04-28 11:13:51,274 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 104 transitions. Word has length 50 [2022-04-28 11:13:51,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:13:51,274 INFO L495 AbstractCegarLoop]: Abstraction has 96 states and 104 transitions. [2022-04-28 11:13:51,274 INFO L496 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-28 11:13:51,274 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 96 states and 104 transitions. [2022-04-28 11:13:53,482 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 104 edges. 103 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 11:13:53,482 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 104 transitions. [2022-04-28 11:13:53,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-04-28 11:13:53,482 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:13:53,482 INFO L195 NwaCegarLoop]: 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-28 11:13:53,498 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2022-04-28 11:13:53,683 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-04-28 11:13:53,683 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:13:53,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:13:53,683 INFO L85 PathProgramCache]: Analyzing trace with hash 1452517941, now seen corresponding path program 11 times [2022-04-28 11:13:53,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:13:53,684 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1715549057] [2022-04-28 11:13:53,684 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 11:13:53,684 INFO L85 PathProgramCache]: Analyzing trace with hash 1452517941, now seen corresponding path program 12 times [2022-04-28 11:13:53,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:13:53,684 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1677470382] [2022-04-28 11:13:53,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:13:53,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:13:53,693 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 11:13:53,694 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1081207665] [2022-04-28 11:13:53,694 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 11:13:53,694 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:13:53,694 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:13:53,695 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 11:13:53,702 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-04-28 11:13:53,749 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-04-28 11:13:53,749 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 11:13:53,750 INFO L263 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 42 conjunts are in the unsatisfiable core [2022-04-28 11:13:53,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:13:53,762 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 11:13:54,229 INFO L272 TraceCheckUtils]: 0: Hoare triple {9426#true} call ULTIMATE.init(); {9426#true} is VALID [2022-04-28 11:13:54,230 INFO L290 TraceCheckUtils]: 1: Hoare triple {9426#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); {9426#true} is VALID [2022-04-28 11:13:54,230 INFO L290 TraceCheckUtils]: 2: Hoare triple {9426#true} assume true; {9426#true} is VALID [2022-04-28 11:13:54,230 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9426#true} {9426#true} #69#return; {9426#true} is VALID [2022-04-28 11:13:54,230 INFO L272 TraceCheckUtils]: 4: Hoare triple {9426#true} call #t~ret8 := main(); {9426#true} is VALID [2022-04-28 11:13:54,230 INFO L290 TraceCheckUtils]: 5: Hoare triple {9426#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; {9426#true} is VALID [2022-04-28 11:13:54,230 INFO L272 TraceCheckUtils]: 6: Hoare triple {9426#true} call assume_abort_if_not((if ~X~0 >= 0 && ~X~0 <= 5 then 1 else 0)); {9426#true} is VALID [2022-04-28 11:13:54,230 INFO L290 TraceCheckUtils]: 7: Hoare triple {9426#true} ~cond := #in~cond; {9426#true} is VALID [2022-04-28 11:13:54,230 INFO L290 TraceCheckUtils]: 8: Hoare triple {9426#true} assume !(0 == ~cond); {9426#true} is VALID [2022-04-28 11:13:54,230 INFO L290 TraceCheckUtils]: 9: Hoare triple {9426#true} assume true; {9426#true} is VALID [2022-04-28 11:13:54,230 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {9426#true} {9426#true} #61#return; {9426#true} is VALID [2022-04-28 11:13:54,231 INFO L290 TraceCheckUtils]: 11: Hoare triple {9426#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~Y~0 := #t~nondet5;havoc #t~nondet5; {9426#true} is VALID [2022-04-28 11:13:54,231 INFO L272 TraceCheckUtils]: 12: Hoare triple {9426#true} call assume_abort_if_not((if ~Y~0 >= 0 && ~Y~0 <= 5 then 1 else 0)); {9426#true} is VALID [2022-04-28 11:13:54,231 INFO L290 TraceCheckUtils]: 13: Hoare triple {9426#true} ~cond := #in~cond; {9426#true} is VALID [2022-04-28 11:13:54,231 INFO L290 TraceCheckUtils]: 14: Hoare triple {9426#true} assume !(0 == ~cond); {9426#true} is VALID [2022-04-28 11:13:54,231 INFO L290 TraceCheckUtils]: 15: Hoare triple {9426#true} assume true; {9426#true} is VALID [2022-04-28 11:13:54,231 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {9426#true} {9426#true} #63#return; {9426#true} is VALID [2022-04-28 11:13:54,235 INFO L290 TraceCheckUtils]: 17: Hoare triple {9426#true} ~v~0 := 2 * ~Y~0 - ~X~0;~y~0 := 0;~x~0 := 0; {9482#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (= main_~y~0 0))} is VALID [2022-04-28 11:13:54,235 INFO L290 TraceCheckUtils]: 18: Hoare triple {9482#(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; {9482#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (= main_~y~0 0))} is VALID [2022-04-28 11:13:54,236 INFO L272 TraceCheckUtils]: 19: Hoare triple {9482#(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)); {9426#true} is VALID [2022-04-28 11:13:54,236 INFO L290 TraceCheckUtils]: 20: Hoare triple {9426#true} ~cond := #in~cond; {9426#true} is VALID [2022-04-28 11:13:54,236 INFO L290 TraceCheckUtils]: 21: Hoare triple {9426#true} assume !(0 == ~cond); {9426#true} is VALID [2022-04-28 11:13:54,236 INFO L290 TraceCheckUtils]: 22: Hoare triple {9426#true} assume true; {9426#true} is VALID [2022-04-28 11:13:54,236 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {9426#true} {9482#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (= main_~y~0 0))} #65#return; {9482#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (= main_~y~0 0))} is VALID [2022-04-28 11:13:54,237 INFO L290 TraceCheckUtils]: 24: Hoare triple {9482#(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); {9482#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (= main_~y~0 0))} is VALID [2022-04-28 11:13:54,237 INFO L290 TraceCheckUtils]: 25: Hoare triple {9482#(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; {9507#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~v~0 (+ (* main_~X~0 (- 3)) (* main_~Y~0 4))))} is VALID [2022-04-28 11:13:54,238 INFO L290 TraceCheckUtils]: 26: Hoare triple {9507#(and (= 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; {9511#(and (= main_~y~0 1) (= main_~x~0 1) (= main_~v~0 (+ (* main_~X~0 (- 3)) (* main_~Y~0 4))))} is VALID [2022-04-28 11:13:54,238 INFO L290 TraceCheckUtils]: 27: Hoare triple {9511#(and (= main_~y~0 1) (= main_~x~0 1) (= main_~v~0 (+ (* main_~X~0 (- 3)) (* main_~Y~0 4))))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {9515#(and (= main_~y~0 1) (= 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)))} is VALID [2022-04-28 11:13:54,238 INFO L272 TraceCheckUtils]: 28: Hoare triple {9515#(and (= main_~y~0 1) (= 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)))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {9426#true} is VALID [2022-04-28 11:13:54,239 INFO L290 TraceCheckUtils]: 29: Hoare triple {9426#true} ~cond := #in~cond; {9522#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:13:54,239 INFO L290 TraceCheckUtils]: 30: Hoare triple {9522#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {9526#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:13:54,239 INFO L290 TraceCheckUtils]: 31: Hoare triple {9526#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {9526#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:13:54,240 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {9526#(not (= |__VERIFIER_assert_#in~cond| 0))} {9515#(and (= main_~y~0 1) (= 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)))} #65#return; {9511#(and (= main_~y~0 1) (= main_~x~0 1) (= main_~v~0 (+ (* main_~X~0 (- 3)) (* main_~Y~0 4))))} is VALID [2022-04-28 11:13:54,240 INFO L290 TraceCheckUtils]: 33: Hoare triple {9511#(and (= main_~y~0 1) (= main_~x~0 1) (= main_~v~0 (+ (* main_~X~0 (- 3)) (* main_~Y~0 4))))} assume !!(~x~0 <= ~X~0); {9511#(and (= main_~y~0 1) (= main_~x~0 1) (= main_~v~0 (+ (* main_~X~0 (- 3)) (* main_~Y~0 4))))} is VALID [2022-04-28 11:13:54,243 INFO L290 TraceCheckUtils]: 34: Hoare triple {9511#(and (= main_~y~0 1) (= main_~x~0 1) (= main_~v~0 (+ (* main_~X~0 (- 3)) (* main_~Y~0 4))))} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {9539#(and (= (+ (* main_~X~0 (- 3)) (* main_~Y~0 6)) main_~v~0) (= main_~y~0 1) (= main_~x~0 1))} is VALID [2022-04-28 11:13:54,244 INFO L290 TraceCheckUtils]: 35: Hoare triple {9539#(and (= (+ (* main_~X~0 (- 3)) (* main_~Y~0 6)) main_~v~0) (= main_~y~0 1) (= main_~x~0 1))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {9543#(and (= (+ (- 1) main_~x~0) 1) (= (+ (* main_~X~0 (- 3)) (* main_~Y~0 6)) main_~v~0) (= main_~y~0 1))} is VALID [2022-04-28 11:13:54,244 INFO L290 TraceCheckUtils]: 36: Hoare triple {9543#(and (= (+ (- 1) main_~x~0) 1) (= (+ (* main_~X~0 (- 3)) (* main_~Y~0 6)) main_~v~0) (= main_~y~0 1))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {9543#(and (= (+ (- 1) main_~x~0) 1) (= (+ (* main_~X~0 (- 3)) (* main_~Y~0 6)) main_~v~0) (= main_~y~0 1))} is VALID [2022-04-28 11:13:54,245 INFO L272 TraceCheckUtils]: 37: Hoare triple {9543#(and (= (+ (- 1) main_~x~0) 1) (= (+ (* main_~X~0 (- 3)) (* main_~Y~0 6)) main_~v~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)); {9426#true} is VALID [2022-04-28 11:13:54,245 INFO L290 TraceCheckUtils]: 38: Hoare triple {9426#true} ~cond := #in~cond; {9426#true} is VALID [2022-04-28 11:13:54,245 INFO L290 TraceCheckUtils]: 39: Hoare triple {9426#true} assume !(0 == ~cond); {9426#true} is VALID [2022-04-28 11:13:54,245 INFO L290 TraceCheckUtils]: 40: Hoare triple {9426#true} assume true; {9426#true} is VALID [2022-04-28 11:13:54,245 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {9426#true} {9543#(and (= (+ (- 1) main_~x~0) 1) (= (+ (* main_~X~0 (- 3)) (* main_~Y~0 6)) main_~v~0) (= main_~y~0 1))} #65#return; {9543#(and (= (+ (- 1) main_~x~0) 1) (= (+ (* main_~X~0 (- 3)) (* main_~Y~0 6)) main_~v~0) (= main_~y~0 1))} is VALID [2022-04-28 11:13:54,246 INFO L290 TraceCheckUtils]: 42: Hoare triple {9543#(and (= (+ (- 1) main_~x~0) 1) (= (+ (* main_~X~0 (- 3)) (* main_~Y~0 6)) main_~v~0) (= main_~y~0 1))} assume !!(~x~0 <= ~X~0); {9543#(and (= (+ (- 1) main_~x~0) 1) (= (+ (* main_~X~0 (- 3)) (* main_~Y~0 6)) main_~v~0) (= main_~y~0 1))} is VALID [2022-04-28 11:13:54,246 INFO L290 TraceCheckUtils]: 43: Hoare triple {9543#(and (= (+ (- 1) main_~x~0) 1) (= (+ (* main_~X~0 (- 3)) (* main_~Y~0 6)) main_~v~0) (= 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; {9568#(and (= (+ (- 1) main_~x~0) 1) (= (+ (- 1) main_~y~0) 1) (= main_~v~0 (+ (* main_~Y~0 8) (* main_~X~0 (- 5)))))} is VALID [2022-04-28 11:13:54,247 INFO L290 TraceCheckUtils]: 44: Hoare triple {9568#(and (= (+ (- 1) main_~x~0) 1) (= (+ (- 1) main_~y~0) 1) (= main_~v~0 (+ (* main_~Y~0 8) (* main_~X~0 (- 5)))))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {9572#(and (= main_~x~0 3) (= (+ (- 1) main_~y~0) 1) (= main_~v~0 (+ (* main_~Y~0 8) (* main_~X~0 (- 5)))))} is VALID [2022-04-28 11:13:54,247 INFO L290 TraceCheckUtils]: 45: Hoare triple {9572#(and (= main_~x~0 3) (= (+ (- 1) main_~y~0) 1) (= main_~v~0 (+ (* main_~Y~0 8) (* main_~X~0 (- 5)))))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {9576#(and (= main_~xy~0 (* main_~X~0 2)) (= (* main_~Y~0 3) main_~yx~0) (= main_~v~0 (+ (* main_~Y~0 8) (* main_~X~0 (- 5)))))} is VALID [2022-04-28 11:13:54,248 INFO L272 TraceCheckUtils]: 46: Hoare triple {9576#(and (= main_~xy~0 (* main_~X~0 2)) (= (* main_~Y~0 3) main_~yx~0) (= main_~v~0 (+ (* main_~Y~0 8) (* main_~X~0 (- 5)))))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {9580#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 11:13:54,248 INFO L290 TraceCheckUtils]: 47: Hoare triple {9580#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {9584#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:13:54,249 INFO L290 TraceCheckUtils]: 48: Hoare triple {9584#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {9427#false} is VALID [2022-04-28 11:13:54,249 INFO L290 TraceCheckUtils]: 49: Hoare triple {9427#false} assume !false; {9427#false} is VALID [2022-04-28 11:13:54,249 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 8 proven. 25 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-28 11:13:54,249 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 11:13:57,574 INFO L290 TraceCheckUtils]: 49: Hoare triple {9427#false} assume !false; {9427#false} is VALID [2022-04-28 11:13:57,574 INFO L290 TraceCheckUtils]: 48: Hoare triple {9584#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {9427#false} is VALID [2022-04-28 11:13:57,575 INFO L290 TraceCheckUtils]: 47: Hoare triple {9580#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {9584#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:13:57,575 INFO L272 TraceCheckUtils]: 46: Hoare triple {9600#(= (+ (* 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)); {9580#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 11:13:57,576 INFO L290 TraceCheckUtils]: 45: Hoare triple {9604#(= (+ (* 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; {9600#(= (+ (* 2 main_~xy~0) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 main_~yx~0)))} is VALID [2022-04-28 11:13:57,578 INFO L290 TraceCheckUtils]: 44: Hoare triple {9608#(= (+ (* (* 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; {9604#(= (+ (* 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-28 11:13:57,579 INFO L290 TraceCheckUtils]: 43: Hoare triple {9604#(= (+ (* 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; {9608#(= (+ (* (* 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-28 11:13:57,580 INFO L290 TraceCheckUtils]: 42: Hoare triple {9604#(= (+ (* 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); {9604#(= (+ (* 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-28 11:13:57,580 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {9426#true} {9604#(= (+ (* 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; {9604#(= (+ (* 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-28 11:13:57,581 INFO L290 TraceCheckUtils]: 40: Hoare triple {9426#true} assume true; {9426#true} is VALID [2022-04-28 11:13:57,581 INFO L290 TraceCheckUtils]: 39: Hoare triple {9426#true} assume !(0 == ~cond); {9426#true} is VALID [2022-04-28 11:13:57,581 INFO L290 TraceCheckUtils]: 38: Hoare triple {9426#true} ~cond := #in~cond; {9426#true} is VALID [2022-04-28 11:13:57,581 INFO L272 TraceCheckUtils]: 37: Hoare triple {9604#(= (+ (* 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)); {9426#true} is VALID [2022-04-28 11:13:57,581 INFO L290 TraceCheckUtils]: 36: Hoare triple {9604#(= (+ (* 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; {9604#(= (+ (* 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-28 11:13:57,583 INFO L290 TraceCheckUtils]: 35: Hoare triple {9608#(= (+ (* (* 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; {9604#(= (+ (* 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-28 11:13:57,583 INFO L290 TraceCheckUtils]: 34: Hoare triple {9604#(= (+ (* 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; {9608#(= (+ (* (* 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-28 11:13:57,584 INFO L290 TraceCheckUtils]: 33: Hoare triple {9604#(= (+ (* 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); {9604#(= (+ (* 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-28 11:13:57,584 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {9526#(not (= |__VERIFIER_assert_#in~cond| 0))} {9645#(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; {9604#(= (+ (* 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-28 11:13:57,585 INFO L290 TraceCheckUtils]: 31: Hoare triple {9526#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {9526#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:13:57,585 INFO L290 TraceCheckUtils]: 30: Hoare triple {9655#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {9526#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:13:57,585 INFO L290 TraceCheckUtils]: 29: Hoare triple {9426#true} ~cond := #in~cond; {9655#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 11:13:57,585 INFO L272 TraceCheckUtils]: 28: Hoare triple {9645#(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)); {9426#true} is VALID [2022-04-28 11:13:57,586 INFO L290 TraceCheckUtils]: 27: Hoare triple {9426#true} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {9645#(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-28 11:13:57,586 INFO L290 TraceCheckUtils]: 26: Hoare triple {9426#true} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {9426#true} is VALID [2022-04-28 11:13:57,586 INFO L290 TraceCheckUtils]: 25: Hoare triple {9426#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; {9426#true} is VALID [2022-04-28 11:13:57,586 INFO L290 TraceCheckUtils]: 24: Hoare triple {9426#true} assume !!(~x~0 <= ~X~0); {9426#true} is VALID [2022-04-28 11:13:57,587 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {9426#true} {9426#true} #65#return; {9426#true} is VALID [2022-04-28 11:13:57,587 INFO L290 TraceCheckUtils]: 22: Hoare triple {9426#true} assume true; {9426#true} is VALID [2022-04-28 11:13:57,587 INFO L290 TraceCheckUtils]: 21: Hoare triple {9426#true} assume !(0 == ~cond); {9426#true} is VALID [2022-04-28 11:13:57,587 INFO L290 TraceCheckUtils]: 20: Hoare triple {9426#true} ~cond := #in~cond; {9426#true} is VALID [2022-04-28 11:13:57,587 INFO L272 TraceCheckUtils]: 19: Hoare triple {9426#true} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {9426#true} is VALID [2022-04-28 11:13:57,587 INFO L290 TraceCheckUtils]: 18: Hoare triple {9426#true} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {9426#true} is VALID [2022-04-28 11:13:57,587 INFO L290 TraceCheckUtils]: 17: Hoare triple {9426#true} ~v~0 := 2 * ~Y~0 - ~X~0;~y~0 := 0;~x~0 := 0; {9426#true} is VALID [2022-04-28 11:13:57,587 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {9426#true} {9426#true} #63#return; {9426#true} is VALID [2022-04-28 11:13:57,587 INFO L290 TraceCheckUtils]: 15: Hoare triple {9426#true} assume true; {9426#true} is VALID [2022-04-28 11:13:57,587 INFO L290 TraceCheckUtils]: 14: Hoare triple {9426#true} assume !(0 == ~cond); {9426#true} is VALID [2022-04-28 11:13:57,587 INFO L290 TraceCheckUtils]: 13: Hoare triple {9426#true} ~cond := #in~cond; {9426#true} is VALID [2022-04-28 11:13:57,587 INFO L272 TraceCheckUtils]: 12: Hoare triple {9426#true} call assume_abort_if_not((if ~Y~0 >= 0 && ~Y~0 <= 5 then 1 else 0)); {9426#true} is VALID [2022-04-28 11:13:57,587 INFO L290 TraceCheckUtils]: 11: Hoare triple {9426#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~Y~0 := #t~nondet5;havoc #t~nondet5; {9426#true} is VALID [2022-04-28 11:13:57,587 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {9426#true} {9426#true} #61#return; {9426#true} is VALID [2022-04-28 11:13:57,588 INFO L290 TraceCheckUtils]: 9: Hoare triple {9426#true} assume true; {9426#true} is VALID [2022-04-28 11:13:57,588 INFO L290 TraceCheckUtils]: 8: Hoare triple {9426#true} assume !(0 == ~cond); {9426#true} is VALID [2022-04-28 11:13:57,588 INFO L290 TraceCheckUtils]: 7: Hoare triple {9426#true} ~cond := #in~cond; {9426#true} is VALID [2022-04-28 11:13:57,588 INFO L272 TraceCheckUtils]: 6: Hoare triple {9426#true} call assume_abort_if_not((if ~X~0 >= 0 && ~X~0 <= 5 then 1 else 0)); {9426#true} is VALID [2022-04-28 11:13:57,588 INFO L290 TraceCheckUtils]: 5: Hoare triple {9426#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; {9426#true} is VALID [2022-04-28 11:13:57,588 INFO L272 TraceCheckUtils]: 4: Hoare triple {9426#true} call #t~ret8 := main(); {9426#true} is VALID [2022-04-28 11:13:57,588 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9426#true} {9426#true} #69#return; {9426#true} is VALID [2022-04-28 11:13:57,588 INFO L290 TraceCheckUtils]: 2: Hoare triple {9426#true} assume true; {9426#true} is VALID [2022-04-28 11:13:57,588 INFO L290 TraceCheckUtils]: 1: Hoare triple {9426#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); {9426#true} is VALID [2022-04-28 11:13:57,588 INFO L272 TraceCheckUtils]: 0: Hoare triple {9426#true} call ULTIMATE.init(); {9426#true} is VALID [2022-04-28 11:13:57,588 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 22 proven. 6 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-04-28 11:13:57,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:13:57,589 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1677470382] [2022-04-28 11:13:57,589 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 11:13:57,589 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1081207665] [2022-04-28 11:13:57,589 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1081207665] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 11:13:57,589 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 11:13:57,589 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 10] total 20 [2022-04-28 11:13:57,589 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:13:57,589 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1715549057] [2022-04-28 11:13:57,589 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1715549057] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:13:57,589 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:13:57,589 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-04-28 11:13:57,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1104844255] [2022-04-28 11:13:57,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:13:57,590 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 2.3076923076923075) 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-28 11:13:57,590 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:13:57,590 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 15 states, 13 states have (on average 2.3076923076923075) 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-28 11:13:57,627 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:13:57,627 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-28 11:13:57,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:13:57,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-28 11:13:57,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=322, Unknown=0, NotChecked=0, Total=380 [2022-04-28 11:13:57,627 INFO L87 Difference]: Start difference. First operand 96 states and 104 transitions. Second operand has 15 states, 13 states have (on average 2.3076923076923075) 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-28 11:13:59,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:13:59,381 INFO L93 Difference]: Finished difference Result 109 states and 119 transitions. [2022-04-28 11:13:59,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-28 11:13:59,381 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 2.3076923076923075) 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-28 11:13:59,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:13:59,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 13 states have (on average 2.3076923076923075) 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-28 11:13:59,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 64 transitions. [2022-04-28 11:13:59,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 13 states have (on average 2.3076923076923075) 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-28 11:13:59,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 64 transitions. [2022-04-28 11:13:59,383 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 64 transitions. [2022-04-28 11:13:59,443 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:13:59,445 INFO L225 Difference]: With dead ends: 109 [2022-04-28 11:13:59,445 INFO L226 Difference]: Without dead ends: 107 [2022-04-28 11:13:59,445 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 76 SyntacticMatches, 5 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=78, Invalid=428, Unknown=0, NotChecked=0, Total=506 [2022-04-28 11:13:59,446 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 16 mSDsluCounter, 205 mSDsCounter, 0 mSdLazyCounter, 517 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 233 SdHoareTripleChecker+Invalid, 522 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 517 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-04-28 11:13:59,446 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 233 Invalid, 522 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 517 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-04-28 11:13:59,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2022-04-28 11:13:59,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 96. [2022-04-28 11:13:59,647 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:13:59,647 INFO L82 GeneralOperation]: Start isEquivalent. First operand 107 states. Second operand has 96 states, 70 states have (on average 1.0857142857142856) internal successors, (76), 72 states have internal predecessors, (76), 15 states have call successors, (15), 11 states have call predecessors, (15), 10 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-28 11:13:59,647 INFO L74 IsIncluded]: Start isIncluded. First operand 107 states. Second operand has 96 states, 70 states have (on average 1.0857142857142856) internal successors, (76), 72 states have internal predecessors, (76), 15 states have call successors, (15), 11 states have call predecessors, (15), 10 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-28 11:13:59,648 INFO L87 Difference]: Start difference. First operand 107 states. Second operand has 96 states, 70 states have (on average 1.0857142857142856) internal successors, (76), 72 states have internal predecessors, (76), 15 states have call successors, (15), 11 states have call predecessors, (15), 10 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-28 11:13:59,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:13:59,652 INFO L93 Difference]: Finished difference Result 107 states and 117 transitions. [2022-04-28 11:13:59,652 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 117 transitions. [2022-04-28 11:13:59,652 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:13:59,652 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:13:59,653 INFO L74 IsIncluded]: Start isIncluded. First operand has 96 states, 70 states have (on average 1.0857142857142856) internal successors, (76), 72 states have internal predecessors, (76), 15 states have call successors, (15), 11 states have call predecessors, (15), 10 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) Second operand 107 states. [2022-04-28 11:13:59,653 INFO L87 Difference]: Start difference. First operand has 96 states, 70 states have (on average 1.0857142857142856) internal successors, (76), 72 states have internal predecessors, (76), 15 states have call successors, (15), 11 states have call predecessors, (15), 10 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) Second operand 107 states. [2022-04-28 11:13:59,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:13:59,656 INFO L93 Difference]: Finished difference Result 107 states and 117 transitions. [2022-04-28 11:13:59,656 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 117 transitions. [2022-04-28 11:13:59,656 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:13:59,656 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:13:59,656 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:13:59,656 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:13:59,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 70 states have (on average 1.0857142857142856) internal successors, (76), 72 states have internal predecessors, (76), 15 states have call successors, (15), 11 states have call predecessors, (15), 10 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-28 11:13:59,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 104 transitions. [2022-04-28 11:13:59,658 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 104 transitions. Word has length 50 [2022-04-28 11:13:59,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:13:59,659 INFO L495 AbstractCegarLoop]: Abstraction has 96 states and 104 transitions. [2022-04-28 11:13:59,659 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 2.3076923076923075) 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-28 11:13:59,659 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 96 states and 104 transitions. [2022-04-28 11:14:01,882 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 104 edges. 103 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 11:14:01,882 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 104 transitions. [2022-04-28 11:14:01,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-04-28 11:14:01,883 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:14:01,883 INFO L195 NwaCegarLoop]: 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-28 11:14:01,901 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-28 11:14:02,091 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:14:02,091 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:14:02,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:14:02,092 INFO L85 PathProgramCache]: Analyzing trace with hash -1343557775, now seen corresponding path program 13 times [2022-04-28 11:14:02,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:14:02,092 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [97548663] [2022-04-28 11:14:02,092 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 11:14:02,092 INFO L85 PathProgramCache]: Analyzing trace with hash -1343557775, now seen corresponding path program 14 times [2022-04-28 11:14:02,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:14:02,092 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570646072] [2022-04-28 11:14:02,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:14:02,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:14:02,102 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 11:14:02,102 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [144172304] [2022-04-28 11:14:02,102 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 11:14:02,102 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:14:02,102 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:14:02,103 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 11:14:02,105 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-04-28 11:14:02,145 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 11:14:02,145 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 11:14:02,146 INFO L263 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 39 conjunts are in the unsatisfiable core [2022-04-28 11:14:02,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:14:02,158 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 11:14:20,251 WARN L828 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-28 11:14:25,534 WARN L828 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-28 11:14:34,713 WARN L828 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-28 11:15:01,844 INFO L272 TraceCheckUtils]: 0: Hoare triple {10375#true} call ULTIMATE.init(); {10375#true} is VALID [2022-04-28 11:15:01,844 INFO L290 TraceCheckUtils]: 1: Hoare triple {10375#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); {10375#true} is VALID [2022-04-28 11:15:01,844 INFO L290 TraceCheckUtils]: 2: Hoare triple {10375#true} assume true; {10375#true} is VALID [2022-04-28 11:15:01,844 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10375#true} {10375#true} #69#return; {10375#true} is VALID [2022-04-28 11:15:01,844 INFO L272 TraceCheckUtils]: 4: Hoare triple {10375#true} call #t~ret8 := main(); {10375#true} is VALID [2022-04-28 11:15:01,844 INFO L290 TraceCheckUtils]: 5: Hoare triple {10375#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; {10375#true} is VALID [2022-04-28 11:15:01,845 INFO L272 TraceCheckUtils]: 6: Hoare triple {10375#true} call assume_abort_if_not((if ~X~0 >= 0 && ~X~0 <= 5 then 1 else 0)); {10375#true} is VALID [2022-04-28 11:15:01,845 INFO L290 TraceCheckUtils]: 7: Hoare triple {10375#true} ~cond := #in~cond; {10375#true} is VALID [2022-04-28 11:15:01,845 INFO L290 TraceCheckUtils]: 8: Hoare triple {10375#true} assume !(0 == ~cond); {10375#true} is VALID [2022-04-28 11:15:01,845 INFO L290 TraceCheckUtils]: 9: Hoare triple {10375#true} assume true; {10375#true} is VALID [2022-04-28 11:15:01,845 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {10375#true} {10375#true} #61#return; {10375#true} is VALID [2022-04-28 11:15:01,845 INFO L290 TraceCheckUtils]: 11: Hoare triple {10375#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~Y~0 := #t~nondet5;havoc #t~nondet5; {10375#true} is VALID [2022-04-28 11:15:01,845 INFO L272 TraceCheckUtils]: 12: Hoare triple {10375#true} call assume_abort_if_not((if ~Y~0 >= 0 && ~Y~0 <= 5 then 1 else 0)); {10375#true} is VALID [2022-04-28 11:15:01,845 INFO L290 TraceCheckUtils]: 13: Hoare triple {10375#true} ~cond := #in~cond; {10375#true} is VALID [2022-04-28 11:15:01,845 INFO L290 TraceCheckUtils]: 14: Hoare triple {10375#true} assume !(0 == ~cond); {10375#true} is VALID [2022-04-28 11:15:01,845 INFO L290 TraceCheckUtils]: 15: Hoare triple {10375#true} assume true; {10375#true} is VALID [2022-04-28 11:15:01,846 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {10375#true} {10375#true} #63#return; {10375#true} is VALID [2022-04-28 11:15:01,846 INFO L290 TraceCheckUtils]: 17: Hoare triple {10375#true} ~v~0 := 2 * ~Y~0 - ~X~0;~y~0 := 0;~x~0 := 0; {10431#(= (+ main_~X~0 main_~v~0) (* main_~Y~0 2))} is VALID [2022-04-28 11:15:01,846 INFO L290 TraceCheckUtils]: 18: Hoare triple {10431#(= (+ main_~X~0 main_~v~0) (* main_~Y~0 2))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {10431#(= (+ main_~X~0 main_~v~0) (* main_~Y~0 2))} is VALID [2022-04-28 11:15:01,847 INFO L272 TraceCheckUtils]: 19: Hoare triple {10431#(= (+ 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)); {10375#true} is VALID [2022-04-28 11:15:01,847 INFO L290 TraceCheckUtils]: 20: Hoare triple {10375#true} ~cond := #in~cond; {10375#true} is VALID [2022-04-28 11:15:01,847 INFO L290 TraceCheckUtils]: 21: Hoare triple {10375#true} assume !(0 == ~cond); {10375#true} is VALID [2022-04-28 11:15:01,847 INFO L290 TraceCheckUtils]: 22: Hoare triple {10375#true} assume true; {10375#true} is VALID [2022-04-28 11:15:01,848 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {10375#true} {10431#(= (+ main_~X~0 main_~v~0) (* main_~Y~0 2))} #65#return; {10431#(= (+ main_~X~0 main_~v~0) (* main_~Y~0 2))} is VALID [2022-04-28 11:15:01,848 INFO L290 TraceCheckUtils]: 24: Hoare triple {10431#(= (+ main_~X~0 main_~v~0) (* main_~Y~0 2))} assume !!(~x~0 <= ~X~0); {10431#(= (+ main_~X~0 main_~v~0) (* main_~Y~0 2))} is VALID [2022-04-28 11:15:01,849 INFO L290 TraceCheckUtils]: 25: Hoare triple {10431#(= (+ 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; {10456#(= main_~v~0 (+ (* main_~X~0 (- 3)) (* main_~Y~0 4)))} is VALID [2022-04-28 11:15:01,850 INFO L290 TraceCheckUtils]: 26: Hoare triple {10456#(= main_~v~0 (+ (* main_~X~0 (- 3)) (* main_~Y~0 4)))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {10456#(= main_~v~0 (+ (* main_~X~0 (- 3)) (* main_~Y~0 4)))} is VALID [2022-04-28 11:15:01,850 INFO L290 TraceCheckUtils]: 27: Hoare triple {10456#(= main_~v~0 (+ (* main_~X~0 (- 3)) (* main_~Y~0 4)))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {10456#(= main_~v~0 (+ (* main_~X~0 (- 3)) (* main_~Y~0 4)))} is VALID [2022-04-28 11:15:01,850 INFO L272 TraceCheckUtils]: 28: Hoare triple {10456#(= main_~v~0 (+ (* main_~X~0 (- 3)) (* 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)); {10375#true} is VALID [2022-04-28 11:15:01,851 INFO L290 TraceCheckUtils]: 29: Hoare triple {10375#true} ~cond := #in~cond; {10469#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:15:01,851 INFO L290 TraceCheckUtils]: 30: Hoare triple {10469#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {10473#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:15:01,851 INFO L290 TraceCheckUtils]: 31: Hoare triple {10473#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {10473#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:15:01,852 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {10473#(not (= |__VERIFIER_assert_#in~cond| 0))} {10456#(= main_~v~0 (+ (* main_~X~0 (- 3)) (* main_~Y~0 4)))} #65#return; {10456#(= main_~v~0 (+ (* main_~X~0 (- 3)) (* main_~Y~0 4)))} is VALID [2022-04-28 11:15:01,852 INFO L290 TraceCheckUtils]: 33: Hoare triple {10456#(= main_~v~0 (+ (* main_~X~0 (- 3)) (* main_~Y~0 4)))} assume !!(~x~0 <= ~X~0); {10456#(= main_~v~0 (+ (* main_~X~0 (- 3)) (* main_~Y~0 4)))} is VALID [2022-04-28 11:15:01,853 INFO L290 TraceCheckUtils]: 34: Hoare triple {10456#(= main_~v~0 (+ (* main_~X~0 (- 3)) (* 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; {10486#(= (+ main_~v~0 (* main_~X~0 2) (* (- 2) main_~Y~0)) (+ (* main_~X~0 (- 3)) (* main_~Y~0 4)))} is VALID [2022-04-28 11:15:01,854 INFO L290 TraceCheckUtils]: 35: Hoare triple {10486#(= (+ main_~v~0 (* main_~X~0 2) (* (- 2) main_~Y~0)) (+ (* main_~X~0 (- 3)) (* main_~Y~0 4)))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {10486#(= (+ main_~v~0 (* main_~X~0 2) (* (- 2) main_~Y~0)) (+ (* main_~X~0 (- 3)) (* main_~Y~0 4)))} is VALID [2022-04-28 11:15:01,854 INFO L290 TraceCheckUtils]: 36: Hoare triple {10486#(= (+ main_~v~0 (* main_~X~0 2) (* (- 2) main_~Y~0)) (+ (* main_~X~0 (- 3)) (* main_~Y~0 4)))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {10493#(and (= (* main_~X~0 main_~y~0) main_~xy~0) (= (+ main_~v~0 (* main_~X~0 2) (* (- 2) main_~Y~0)) (+ (* main_~X~0 (- 3)) (* main_~Y~0 4))) (= main_~yx~0 (* main_~Y~0 main_~x~0)))} is VALID [2022-04-28 11:15:01,855 INFO L272 TraceCheckUtils]: 37: Hoare triple {10493#(and (= (* main_~X~0 main_~y~0) main_~xy~0) (= (+ main_~v~0 (* main_~X~0 2) (* (- 2) main_~Y~0)) (+ (* main_~X~0 (- 3)) (* main_~Y~0 4))) (= 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)); {10375#true} is VALID [2022-04-28 11:15:01,855 INFO L290 TraceCheckUtils]: 38: Hoare triple {10375#true} ~cond := #in~cond; {10469#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:15:01,855 INFO L290 TraceCheckUtils]: 39: Hoare triple {10469#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {10473#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:15:01,856 INFO L290 TraceCheckUtils]: 40: Hoare triple {10473#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {10473#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:15:01,857 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {10473#(not (= |__VERIFIER_assert_#in~cond| 0))} {10493#(and (= (* main_~X~0 main_~y~0) main_~xy~0) (= (+ main_~v~0 (* main_~X~0 2) (* (- 2) main_~Y~0)) (+ (* main_~X~0 (- 3)) (* main_~Y~0 4))) (= main_~yx~0 (* main_~Y~0 main_~x~0)))} #65#return; {10509#(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_~v~0 (* main_~X~0 2) (* (- 2) main_~Y~0)) (+ (* main_~X~0 (- 3)) (* main_~Y~0 4))))} is VALID [2022-04-28 11:15:01,858 INFO L290 TraceCheckUtils]: 42: Hoare triple {10509#(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_~v~0 (* main_~X~0 2) (* (- 2) main_~Y~0)) (+ (* main_~X~0 (- 3)) (* main_~Y~0 4))))} assume !!(~x~0 <= ~X~0); {10509#(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_~v~0 (* main_~X~0 2) (* (- 2) main_~Y~0)) (+ (* main_~X~0 (- 3)) (* main_~Y~0 4))))} is VALID [2022-04-28 11:15:01,859 INFO L290 TraceCheckUtils]: 43: Hoare triple {10509#(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_~v~0 (* main_~X~0 2) (* (- 2) main_~Y~0)) (+ (* main_~X~0 (- 3)) (* main_~Y~0 4))))} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {10516#(and (= (+ main_~v~0 (* main_~Y~0 (- 4)) (* main_~X~0 2)) (+ (* main_~X~0 (- 3)) (* main_~Y~0 4))) (= (+ (* (* 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-28 11:15:01,861 INFO L290 TraceCheckUtils]: 44: Hoare triple {10516#(and (= (+ main_~v~0 (* main_~Y~0 (- 4)) (* main_~X~0 2)) (+ (* main_~X~0 (- 3)) (* main_~Y~0 4))) (= (+ (* (* 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; {10520#(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_~v~0 (* main_~Y~0 (- 4)) (* main_~X~0 2)) (+ (* main_~X~0 (- 3)) (* main_~Y~0 4))))} is VALID [2022-04-28 11:15:03,865 WARN L290 TraceCheckUtils]: 45: Hoare triple {10520#(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_~v~0 (* main_~Y~0 (- 4)) (* main_~X~0 2)) (+ (* main_~X~0 (- 3)) (* main_~Y~0 4))))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {10524#(and (or (and (or (and (= main_~Y~0 (+ (* (div main_~xy~0 main_~X~0) main_~X~0) (div (+ (* (- 1) main_~X~0) (* (- 1) main_~v~0)) (- 2)))) (= main_~yx~0 0)) (and (= (mod (+ (* (div main_~xy~0 main_~X~0) main_~X~0) (* (- 1) main_~Y~0) (div (+ (* (- 1) main_~X~0) (* (- 1) main_~v~0)) (- 2))) main_~Y~0) 0) (= (* main_~Y~0 (div (+ (* (div main_~xy~0 main_~X~0) main_~X~0) (* (- 1) main_~Y~0) (div (+ (* (- 1) main_~X~0) (* (- 1) main_~v~0)) (- 2))) 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_~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) (not (= main_~Y~0 0)))))) (= (+ main_~v~0 (* main_~Y~0 (- 4)) (* main_~X~0 2)) (+ (* main_~X~0 (- 3)) (* main_~Y~0 4))))} is UNKNOWN [2022-04-28 11:15:03,869 INFO L272 TraceCheckUtils]: 46: Hoare triple {10524#(and (or (and (or (and (= main_~Y~0 (+ (* (div main_~xy~0 main_~X~0) main_~X~0) (div (+ (* (- 1) main_~X~0) (* (- 1) main_~v~0)) (- 2)))) (= main_~yx~0 0)) (and (= (mod (+ (* (div main_~xy~0 main_~X~0) main_~X~0) (* (- 1) main_~Y~0) (div (+ (* (- 1) main_~X~0) (* (- 1) main_~v~0)) (- 2))) main_~Y~0) 0) (= (* main_~Y~0 (div (+ (* (div main_~xy~0 main_~X~0) main_~X~0) (* (- 1) main_~Y~0) (div (+ (* (- 1) main_~X~0) (* (- 1) main_~v~0)) (- 2))) 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_~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) (not (= main_~Y~0 0)))))) (= (+ main_~v~0 (* main_~Y~0 (- 4)) (* main_~X~0 2)) (+ (* main_~X~0 (- 3)) (* 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)); {10528#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 11:15:03,869 INFO L290 TraceCheckUtils]: 47: Hoare triple {10528#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {10532#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:15:03,870 INFO L290 TraceCheckUtils]: 48: Hoare triple {10532#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {10376#false} is VALID [2022-04-28 11:15:03,870 INFO L290 TraceCheckUtils]: 49: Hoare triple {10376#false} assume !false; {10376#false} is VALID [2022-04-28 11:15:03,870 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-28 11:15:03,870 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 11:15:06,641 INFO L290 TraceCheckUtils]: 49: Hoare triple {10376#false} assume !false; {10376#false} is VALID [2022-04-28 11:15:06,642 INFO L290 TraceCheckUtils]: 48: Hoare triple {10532#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {10376#false} is VALID [2022-04-28 11:15:06,642 INFO L290 TraceCheckUtils]: 47: Hoare triple {10528#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {10532#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:15:06,643 INFO L272 TraceCheckUtils]: 46: Hoare triple {10548#(= (+ (* 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)); {10528#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 11:15:06,644 INFO L290 TraceCheckUtils]: 45: Hoare triple {10552#(= (+ (* 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; {10548#(= (+ (* 2 main_~xy~0) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 main_~yx~0)))} is VALID [2022-04-28 11:15:06,646 INFO L290 TraceCheckUtils]: 44: Hoare triple {10556#(= (+ (* (* 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; {10552#(= (+ (* 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-28 11:15:06,647 INFO L290 TraceCheckUtils]: 43: Hoare triple {10552#(= (+ (* 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; {10556#(= (+ (* (* 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-28 11:15:06,647 INFO L290 TraceCheckUtils]: 42: Hoare triple {10552#(= (+ (* 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); {10552#(= (+ (* 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-28 11:15:06,648 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {10473#(not (= |__VERIFIER_assert_#in~cond| 0))} {10566#(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; {10552#(= (+ (* 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-28 11:15:06,648 INFO L290 TraceCheckUtils]: 40: Hoare triple {10473#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {10473#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:15:06,649 INFO L290 TraceCheckUtils]: 39: Hoare triple {10576#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {10473#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:15:06,649 INFO L290 TraceCheckUtils]: 38: Hoare triple {10375#true} ~cond := #in~cond; {10576#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 11:15:06,649 INFO L272 TraceCheckUtils]: 37: Hoare triple {10566#(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)); {10375#true} is VALID [2022-04-28 11:15:06,650 INFO L290 TraceCheckUtils]: 36: Hoare triple {10375#true} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {10566#(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-28 11:15:06,650 INFO L290 TraceCheckUtils]: 35: Hoare triple {10375#true} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {10375#true} is VALID [2022-04-28 11:15:06,650 INFO L290 TraceCheckUtils]: 34: Hoare triple {10375#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; {10375#true} is VALID [2022-04-28 11:15:06,650 INFO L290 TraceCheckUtils]: 33: Hoare triple {10375#true} assume !!(~x~0 <= ~X~0); {10375#true} is VALID [2022-04-28 11:15:06,650 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {10375#true} {10375#true} #65#return; {10375#true} is VALID [2022-04-28 11:15:06,650 INFO L290 TraceCheckUtils]: 31: Hoare triple {10375#true} assume true; {10375#true} is VALID [2022-04-28 11:15:06,650 INFO L290 TraceCheckUtils]: 30: Hoare triple {10375#true} assume !(0 == ~cond); {10375#true} is VALID [2022-04-28 11:15:06,651 INFO L290 TraceCheckUtils]: 29: Hoare triple {10375#true} ~cond := #in~cond; {10375#true} is VALID [2022-04-28 11:15:06,651 INFO L272 TraceCheckUtils]: 28: Hoare triple {10375#true} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {10375#true} is VALID [2022-04-28 11:15:06,651 INFO L290 TraceCheckUtils]: 27: Hoare triple {10375#true} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {10375#true} is VALID [2022-04-28 11:15:06,651 INFO L290 TraceCheckUtils]: 26: Hoare triple {10375#true} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {10375#true} is VALID [2022-04-28 11:15:06,651 INFO L290 TraceCheckUtils]: 25: Hoare triple {10375#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; {10375#true} is VALID [2022-04-28 11:15:06,651 INFO L290 TraceCheckUtils]: 24: Hoare triple {10375#true} assume !!(~x~0 <= ~X~0); {10375#true} is VALID [2022-04-28 11:15:06,651 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {10375#true} {10375#true} #65#return; {10375#true} is VALID [2022-04-28 11:15:06,651 INFO L290 TraceCheckUtils]: 22: Hoare triple {10375#true} assume true; {10375#true} is VALID [2022-04-28 11:15:06,651 INFO L290 TraceCheckUtils]: 21: Hoare triple {10375#true} assume !(0 == ~cond); {10375#true} is VALID [2022-04-28 11:15:06,651 INFO L290 TraceCheckUtils]: 20: Hoare triple {10375#true} ~cond := #in~cond; {10375#true} is VALID [2022-04-28 11:15:06,651 INFO L272 TraceCheckUtils]: 19: Hoare triple {10375#true} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {10375#true} is VALID [2022-04-28 11:15:06,651 INFO L290 TraceCheckUtils]: 18: Hoare triple {10375#true} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {10375#true} is VALID [2022-04-28 11:15:06,651 INFO L290 TraceCheckUtils]: 17: Hoare triple {10375#true} ~v~0 := 2 * ~Y~0 - ~X~0;~y~0 := 0;~x~0 := 0; {10375#true} is VALID [2022-04-28 11:15:06,651 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {10375#true} {10375#true} #63#return; {10375#true} is VALID [2022-04-28 11:15:06,652 INFO L290 TraceCheckUtils]: 15: Hoare triple {10375#true} assume true; {10375#true} is VALID [2022-04-28 11:15:06,652 INFO L290 TraceCheckUtils]: 14: Hoare triple {10375#true} assume !(0 == ~cond); {10375#true} is VALID [2022-04-28 11:15:06,652 INFO L290 TraceCheckUtils]: 13: Hoare triple {10375#true} ~cond := #in~cond; {10375#true} is VALID [2022-04-28 11:15:06,652 INFO L272 TraceCheckUtils]: 12: Hoare triple {10375#true} call assume_abort_if_not((if ~Y~0 >= 0 && ~Y~0 <= 5 then 1 else 0)); {10375#true} is VALID [2022-04-28 11:15:06,652 INFO L290 TraceCheckUtils]: 11: Hoare triple {10375#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~Y~0 := #t~nondet5;havoc #t~nondet5; {10375#true} is VALID [2022-04-28 11:15:06,652 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {10375#true} {10375#true} #61#return; {10375#true} is VALID [2022-04-28 11:15:06,652 INFO L290 TraceCheckUtils]: 9: Hoare triple {10375#true} assume true; {10375#true} is VALID [2022-04-28 11:15:06,652 INFO L290 TraceCheckUtils]: 8: Hoare triple {10375#true} assume !(0 == ~cond); {10375#true} is VALID [2022-04-28 11:15:06,652 INFO L290 TraceCheckUtils]: 7: Hoare triple {10375#true} ~cond := #in~cond; {10375#true} is VALID [2022-04-28 11:15:06,652 INFO L272 TraceCheckUtils]: 6: Hoare triple {10375#true} call assume_abort_if_not((if ~X~0 >= 0 && ~X~0 <= 5 then 1 else 0)); {10375#true} is VALID [2022-04-28 11:15:06,652 INFO L290 TraceCheckUtils]: 5: Hoare triple {10375#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; {10375#true} is VALID [2022-04-28 11:15:06,652 INFO L272 TraceCheckUtils]: 4: Hoare triple {10375#true} call #t~ret8 := main(); {10375#true} is VALID [2022-04-28 11:15:06,652 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10375#true} {10375#true} #69#return; {10375#true} is VALID [2022-04-28 11:15:06,652 INFO L290 TraceCheckUtils]: 2: Hoare triple {10375#true} assume true; {10375#true} is VALID [2022-04-28 11:15:06,652 INFO L290 TraceCheckUtils]: 1: Hoare triple {10375#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); {10375#true} is VALID [2022-04-28 11:15:06,653 INFO L272 TraceCheckUtils]: 0: Hoare triple {10375#true} call ULTIMATE.init(); {10375#true} is VALID [2022-04-28 11:15:06,653 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-28 11:15:06,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:15:06,653 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1570646072] [2022-04-28 11:15:06,653 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 11:15:06,653 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [144172304] [2022-04-28 11:15:06,653 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [144172304] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 11:15:06,653 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 11:15:06,653 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10] total 19 [2022-04-28 11:15:06,653 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:15:06,654 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [97548663] [2022-04-28 11:15:06,654 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [97548663] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:15:06,654 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:15:06,654 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-28 11:15:06,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [913123828] [2022-04-28 11:15:06,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:15:06,654 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 2.5) 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), 4 states have call predecessors, (6), 4 states have call successors, (6) Word has length 50 [2022-04-28 11:15:06,654 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:15:06,655 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 12 states have (on average 2.5) 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), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-28 11:15:08,738 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 43 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 11:15:08,738 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-28 11:15:08,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:15:08,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-28 11:15:08,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=293, Unknown=0, NotChecked=0, Total=342 [2022-04-28 11:15:08,739 INFO L87 Difference]: Start difference. First operand 96 states and 104 transitions. Second operand has 14 states, 12 states have (on average 2.5) 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), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-28 11:15:11,871 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-28 11:15:15,950 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-28 11:15:17,964 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-28 11:15:23,386 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.30s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-28 11:15:32,120 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-28 11:15:38,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:15:38,882 INFO L93 Difference]: Finished difference Result 110 states and 121 transitions. [2022-04-28 11:15:38,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-28 11:15:38,882 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 2.5) 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), 4 states have call predecessors, (6), 4 states have call successors, (6) Word has length 50 [2022-04-28 11:15:38,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:15:38,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 12 states have (on average 2.5) 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), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-28 11:15:38,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 65 transitions. [2022-04-28 11:15:38,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 12 states have (on average 2.5) 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), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-28 11:15:38,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 65 transitions. [2022-04-28 11:15:38,887 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 65 transitions. [2022-04-28 11:15:41,015 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-28 11:15:41,016 INFO L225 Difference]: With dead ends: 110 [2022-04-28 11:15:41,017 INFO L226 Difference]: Without dead ends: 108 [2022-04-28 11:15:41,017 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 79 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=77, Invalid=429, Unknown=0, NotChecked=0, Total=506 [2022-04-28 11:15:41,017 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 17 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 387 mSolverCounterSat, 5 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 210 SdHoareTripleChecker+Invalid, 396 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 387 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.0s IncrementalHoareTripleChecker+Time [2022-04-28 11:15:41,018 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 210 Invalid, 396 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 387 Invalid, 4 Unknown, 0 Unchecked, 13.0s Time] [2022-04-28 11:15:41,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2022-04-28 11:15:41,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 97. [2022-04-28 11:15:41,233 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:15:41,234 INFO L82 GeneralOperation]: Start isEquivalent. First operand 108 states. Second operand has 97 states, 71 states have (on average 1.0985915492957747) internal successors, (78), 73 states have internal predecessors, (78), 15 states have call successors, (15), 11 states have call predecessors, (15), 10 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-28 11:15:41,234 INFO L74 IsIncluded]: Start isIncluded. First operand 108 states. Second operand has 97 states, 71 states have (on average 1.0985915492957747) internal successors, (78), 73 states have internal predecessors, (78), 15 states have call successors, (15), 11 states have call predecessors, (15), 10 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-28 11:15:41,234 INFO L87 Difference]: Start difference. First operand 108 states. Second operand has 97 states, 71 states have (on average 1.0985915492957747) internal successors, (78), 73 states have internal predecessors, (78), 15 states have call successors, (15), 11 states have call predecessors, (15), 10 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-28 11:15:41,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:15:41,236 INFO L93 Difference]: Finished difference Result 108 states and 119 transitions. [2022-04-28 11:15:41,236 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 119 transitions. [2022-04-28 11:15:41,237 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:15:41,237 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:15:41,237 INFO L74 IsIncluded]: Start isIncluded. First operand has 97 states, 71 states have (on average 1.0985915492957747) internal successors, (78), 73 states have internal predecessors, (78), 15 states have call successors, (15), 11 states have call predecessors, (15), 10 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) Second operand 108 states. [2022-04-28 11:15:41,237 INFO L87 Difference]: Start difference. First operand has 97 states, 71 states have (on average 1.0985915492957747) internal successors, (78), 73 states have internal predecessors, (78), 15 states have call successors, (15), 11 states have call predecessors, (15), 10 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) Second operand 108 states. [2022-04-28 11:15:41,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:15:41,240 INFO L93 Difference]: Finished difference Result 108 states and 119 transitions. [2022-04-28 11:15:41,240 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 119 transitions. [2022-04-28 11:15:41,240 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:15:41,240 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:15:41,240 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:15:41,240 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:15:41,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 71 states have (on average 1.0985915492957747) internal successors, (78), 73 states have internal predecessors, (78), 15 states have call successors, (15), 11 states have call predecessors, (15), 10 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-28 11:15:41,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 106 transitions. [2022-04-28 11:15:41,243 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 106 transitions. Word has length 50 [2022-04-28 11:15:41,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:15:41,243 INFO L495 AbstractCegarLoop]: Abstraction has 97 states and 106 transitions. [2022-04-28 11:15:41,243 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 2.5) 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), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-28 11:15:41,243 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 97 states and 106 transitions. [2022-04-28 11:15:43,565 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 106 edges. 105 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 11:15:43,565 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 106 transitions. [2022-04-28 11:15:43,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-04-28 11:15:43,566 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:15:43,566 INFO L195 NwaCegarLoop]: 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-28 11:15:43,595 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-04-28 11:15:43,766 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-04-28 11:15:43,766 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:15:43,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:15:43,767 INFO L85 PathProgramCache]: Analyzing trace with hash 431449587, now seen corresponding path program 5 times [2022-04-28 11:15:43,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:15:43,767 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [402726414] [2022-04-28 11:15:43,767 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 11:15:43,767 INFO L85 PathProgramCache]: Analyzing trace with hash 431449587, now seen corresponding path program 6 times [2022-04-28 11:15:43,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:15:43,768 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [120837529] [2022-04-28 11:15:43,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:15:43,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:15:43,794 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 11:15:43,794 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1265801175] [2022-04-28 11:15:43,794 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 11:15:43,794 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:15:43,794 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:15:43,804 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 11:15:43,829 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-04-28 11:15:43,866 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-04-28 11:15:43,866 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 11:15:43,867 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 33 conjunts are in the unsatisfiable core [2022-04-28 11:15:43,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:15:43,882 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 11:15:44,509 INFO L272 TraceCheckUtils]: 0: Hoare triple {11331#true} call ULTIMATE.init(); {11331#true} is VALID [2022-04-28 11:15:44,509 INFO L290 TraceCheckUtils]: 1: Hoare triple {11331#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); {11331#true} is VALID [2022-04-28 11:15:44,509 INFO L290 TraceCheckUtils]: 2: Hoare triple {11331#true} assume true; {11331#true} is VALID [2022-04-28 11:15:44,509 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11331#true} {11331#true} #69#return; {11331#true} is VALID [2022-04-28 11:15:44,509 INFO L272 TraceCheckUtils]: 4: Hoare triple {11331#true} call #t~ret8 := main(); {11331#true} is VALID [2022-04-28 11:15:44,509 INFO L290 TraceCheckUtils]: 5: Hoare triple {11331#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; {11331#true} is VALID [2022-04-28 11:15:44,510 INFO L272 TraceCheckUtils]: 6: Hoare triple {11331#true} call assume_abort_if_not((if ~X~0 >= 0 && ~X~0 <= 5 then 1 else 0)); {11331#true} is VALID [2022-04-28 11:15:44,510 INFO L290 TraceCheckUtils]: 7: Hoare triple {11331#true} ~cond := #in~cond; {11331#true} is VALID [2022-04-28 11:15:44,510 INFO L290 TraceCheckUtils]: 8: Hoare triple {11331#true} assume !(0 == ~cond); {11331#true} is VALID [2022-04-28 11:15:44,510 INFO L290 TraceCheckUtils]: 9: Hoare triple {11331#true} assume true; {11331#true} is VALID [2022-04-28 11:15:44,510 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {11331#true} {11331#true} #61#return; {11331#true} is VALID [2022-04-28 11:15:44,510 INFO L290 TraceCheckUtils]: 11: Hoare triple {11331#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~Y~0 := #t~nondet5;havoc #t~nondet5; {11331#true} is VALID [2022-04-28 11:15:44,510 INFO L272 TraceCheckUtils]: 12: Hoare triple {11331#true} call assume_abort_if_not((if ~Y~0 >= 0 && ~Y~0 <= 5 then 1 else 0)); {11331#true} is VALID [2022-04-28 11:15:44,510 INFO L290 TraceCheckUtils]: 13: Hoare triple {11331#true} ~cond := #in~cond; {11331#true} is VALID [2022-04-28 11:15:44,510 INFO L290 TraceCheckUtils]: 14: Hoare triple {11331#true} assume !(0 == ~cond); {11331#true} is VALID [2022-04-28 11:15:44,510 INFO L290 TraceCheckUtils]: 15: Hoare triple {11331#true} assume true; {11331#true} is VALID [2022-04-28 11:15:44,510 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {11331#true} {11331#true} #63#return; {11331#true} is VALID [2022-04-28 11:15:44,511 INFO L290 TraceCheckUtils]: 17: Hoare triple {11331#true} ~v~0 := 2 * ~Y~0 - ~X~0;~y~0 := 0;~x~0 := 0; {11387#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (= main_~y~0 0))} is VALID [2022-04-28 11:15:44,511 INFO L290 TraceCheckUtils]: 18: Hoare triple {11387#(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; {11387#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (= main_~y~0 0))} is VALID [2022-04-28 11:15:44,511 INFO L272 TraceCheckUtils]: 19: Hoare triple {11387#(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)); {11331#true} is VALID [2022-04-28 11:15:44,511 INFO L290 TraceCheckUtils]: 20: Hoare triple {11331#true} ~cond := #in~cond; {11331#true} is VALID [2022-04-28 11:15:44,511 INFO L290 TraceCheckUtils]: 21: Hoare triple {11331#true} assume !(0 == ~cond); {11331#true} is VALID [2022-04-28 11:15:44,511 INFO L290 TraceCheckUtils]: 22: Hoare triple {11331#true} assume true; {11331#true} is VALID [2022-04-28 11:15:44,512 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {11331#true} {11387#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (= main_~y~0 0))} #65#return; {11387#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (= main_~y~0 0))} is VALID [2022-04-28 11:15:44,512 INFO L290 TraceCheckUtils]: 24: Hoare triple {11387#(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); {11387#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (= main_~y~0 0))} is VALID [2022-04-28 11:15:44,513 INFO L290 TraceCheckUtils]: 25: Hoare triple {11387#(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; {11412#(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-28 11:15:44,514 INFO L290 TraceCheckUtils]: 26: Hoare triple {11412#(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; {11416#(and (= (+ (- 1) 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-28 11:15:44,514 INFO L290 TraceCheckUtils]: 27: Hoare triple {11416#(and (= (+ (- 1) 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))))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {11416#(and (= (+ (- 1) 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-28 11:15:44,514 INFO L272 TraceCheckUtils]: 28: Hoare triple {11416#(and (= (+ (- 1) 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))))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {11331#true} is VALID [2022-04-28 11:15:44,515 INFO L290 TraceCheckUtils]: 29: Hoare triple {11331#true} ~cond := #in~cond; {11331#true} is VALID [2022-04-28 11:15:44,515 INFO L290 TraceCheckUtils]: 30: Hoare triple {11331#true} assume !(0 == ~cond); {11331#true} is VALID [2022-04-28 11:15:44,515 INFO L290 TraceCheckUtils]: 31: Hoare triple {11331#true} assume true; {11331#true} is VALID [2022-04-28 11:15:44,515 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {11331#true} {11416#(and (= (+ (- 1) 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))))} #65#return; {11416#(and (= (+ (- 1) 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-28 11:15:44,516 INFO L290 TraceCheckUtils]: 33: Hoare triple {11416#(and (= (+ (- 1) 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))))} assume !!(~x~0 <= ~X~0); {11416#(and (= (+ (- 1) 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-28 11:15:44,517 INFO L290 TraceCheckUtils]: 34: Hoare triple {11416#(and (= (+ (- 1) 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))))} 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; {11441#(and (= main_~y~0 2) (= main_~v~0 (+ (* main_~Y~0 6) (* main_~X~0 (- 5)))) (= (+ (- 1) main_~x~0) 0))} is VALID [2022-04-28 11:15:44,517 INFO L290 TraceCheckUtils]: 35: Hoare triple {11441#(and (= main_~y~0 2) (= main_~v~0 (+ (* main_~Y~0 6) (* main_~X~0 (- 5)))) (= (+ (- 1) main_~x~0) 0))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {11445#(and (= main_~y~0 2) (= main_~v~0 (+ (* main_~Y~0 6) (* main_~X~0 (- 5)))) (= (+ (- 2) main_~x~0) 0))} is VALID [2022-04-28 11:15:44,517 INFO L290 TraceCheckUtils]: 36: Hoare triple {11445#(and (= main_~y~0 2) (= main_~v~0 (+ (* main_~Y~0 6) (* main_~X~0 (- 5)))) (= (+ (- 2) main_~x~0) 0))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {11445#(and (= main_~y~0 2) (= main_~v~0 (+ (* main_~Y~0 6) (* main_~X~0 (- 5)))) (= (+ (- 2) main_~x~0) 0))} is VALID [2022-04-28 11:15:44,518 INFO L272 TraceCheckUtils]: 37: Hoare triple {11445#(and (= main_~y~0 2) (= main_~v~0 (+ (* main_~Y~0 6) (* main_~X~0 (- 5)))) (= (+ (- 2) main_~x~0) 0))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {11331#true} is VALID [2022-04-28 11:15:44,518 INFO L290 TraceCheckUtils]: 38: Hoare triple {11331#true} ~cond := #in~cond; {11331#true} is VALID [2022-04-28 11:15:44,518 INFO L290 TraceCheckUtils]: 39: Hoare triple {11331#true} assume !(0 == ~cond); {11331#true} is VALID [2022-04-28 11:15:44,518 INFO L290 TraceCheckUtils]: 40: Hoare triple {11331#true} assume true; {11331#true} is VALID [2022-04-28 11:15:44,518 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {11331#true} {11445#(and (= main_~y~0 2) (= main_~v~0 (+ (* main_~Y~0 6) (* main_~X~0 (- 5)))) (= (+ (- 2) main_~x~0) 0))} #65#return; {11445#(and (= main_~y~0 2) (= main_~v~0 (+ (* main_~Y~0 6) (* main_~X~0 (- 5)))) (= (+ (- 2) main_~x~0) 0))} is VALID [2022-04-28 11:15:44,519 INFO L290 TraceCheckUtils]: 42: Hoare triple {11445#(and (= main_~y~0 2) (= main_~v~0 (+ (* main_~Y~0 6) (* main_~X~0 (- 5)))) (= (+ (- 2) main_~x~0) 0))} assume !!(~x~0 <= ~X~0); {11467#(and (= main_~y~0 2) (= main_~v~0 (+ (* main_~Y~0 6) (* main_~X~0 (- 5)))) (= (+ (- 2) main_~x~0) 0) (<= main_~x~0 main_~X~0))} is VALID [2022-04-28 11:15:44,520 INFO L290 TraceCheckUtils]: 43: Hoare triple {11467#(and (= main_~y~0 2) (= main_~v~0 (+ (* main_~Y~0 6) (* main_~X~0 (- 5)))) (= (+ (- 2) main_~x~0) 0) (<= main_~x~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; {11471#(and (= (+ (- 2) main_~x~0) 0) (<= main_~x~0 main_~X~0) (not (< (* main_~Y~0 6) (* 5 main_~X~0))) (= main_~y~0 3) (= (+ (* main_~Y~0 8) (* main_~X~0 (- 7))) main_~v~0))} is VALID [2022-04-28 11:15:44,520 INFO L290 TraceCheckUtils]: 44: Hoare triple {11471#(and (= (+ (- 2) main_~x~0) 0) (<= main_~x~0 main_~X~0) (not (< (* main_~Y~0 6) (* 5 main_~X~0))) (= main_~y~0 3) (= (+ (* main_~Y~0 8) (* main_~X~0 (- 7))) main_~v~0))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {11475#(and (= (+ main_~x~0 (- 3)) 0) (not (< (* main_~Y~0 6) (* 5 main_~X~0))) (= main_~y~0 3) (= (+ (* main_~Y~0 8) (* main_~X~0 (- 7))) main_~v~0) (<= main_~x~0 (+ main_~X~0 1)))} is VALID [2022-04-28 11:15:44,521 INFO L290 TraceCheckUtils]: 45: Hoare triple {11475#(and (= (+ main_~x~0 (- 3)) 0) (not (< (* main_~Y~0 6) (* 5 main_~X~0))) (= main_~y~0 3) (= (+ (* main_~Y~0 8) (* main_~X~0 (- 7))) main_~v~0) (<= main_~x~0 (+ main_~X~0 1)))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {11479#(and (= (* main_~Y~0 3) main_~yx~0) (not (< (* main_~Y~0 6) (* 5 main_~X~0))) (<= 2 main_~X~0) (= main_~xy~0 (* main_~X~0 3)) (= (+ (* main_~Y~0 8) (* main_~X~0 (- 7))) main_~v~0))} is VALID [2022-04-28 11:15:44,522 INFO L272 TraceCheckUtils]: 46: Hoare triple {11479#(and (= (* main_~Y~0 3) main_~yx~0) (not (< (* main_~Y~0 6) (* 5 main_~X~0))) (<= 2 main_~X~0) (= main_~xy~0 (* main_~X~0 3)) (= (+ (* main_~Y~0 8) (* main_~X~0 (- 7))) 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)); {11483#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 11:15:44,523 INFO L290 TraceCheckUtils]: 47: Hoare triple {11483#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {11487#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:15:44,523 INFO L290 TraceCheckUtils]: 48: Hoare triple {11487#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {11332#false} is VALID [2022-04-28 11:15:44,523 INFO L290 TraceCheckUtils]: 49: Hoare triple {11332#false} assume !false; {11332#false} is VALID [2022-04-28 11:15:44,523 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 6 proven. 21 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-04-28 11:15:44,524 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 11:15:45,358 INFO L290 TraceCheckUtils]: 49: Hoare triple {11332#false} assume !false; {11332#false} is VALID [2022-04-28 11:15:45,359 INFO L290 TraceCheckUtils]: 48: Hoare triple {11487#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {11332#false} is VALID [2022-04-28 11:15:45,359 INFO L290 TraceCheckUtils]: 47: Hoare triple {11483#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {11487#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:15:45,360 INFO L272 TraceCheckUtils]: 46: Hoare triple {11503#(= (+ (* 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)); {11483#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 11:15:45,361 INFO L290 TraceCheckUtils]: 45: Hoare triple {11507#(= (+ (* 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; {11503#(= (+ (* 2 main_~xy~0) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 main_~yx~0)))} is VALID [2022-04-28 11:15:45,363 INFO L290 TraceCheckUtils]: 44: Hoare triple {11511#(= (+ (* (* 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; {11507#(= (+ (* 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-28 11:15:45,365 INFO L290 TraceCheckUtils]: 43: Hoare triple {11515#(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; {11511#(= (+ (* (* 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-28 11:15:45,366 INFO L290 TraceCheckUtils]: 42: Hoare triple {11519#(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); {11515#(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-28 11:15:45,367 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {11331#true} {11519#(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)))} #65#return; {11519#(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-28 11:15:45,367 INFO L290 TraceCheckUtils]: 40: Hoare triple {11331#true} assume true; {11331#true} is VALID [2022-04-28 11:15:45,367 INFO L290 TraceCheckUtils]: 39: Hoare triple {11331#true} assume !(0 == ~cond); {11331#true} is VALID [2022-04-28 11:15:45,367 INFO L290 TraceCheckUtils]: 38: Hoare triple {11331#true} ~cond := #in~cond; {11331#true} is VALID [2022-04-28 11:15:45,367 INFO L272 TraceCheckUtils]: 37: Hoare triple {11519#(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)))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {11331#true} is VALID [2022-04-28 11:15:45,367 INFO L290 TraceCheckUtils]: 36: Hoare triple {11519#(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 !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {11519#(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-28 11:15:45,370 INFO L290 TraceCheckUtils]: 35: Hoare triple {11541#(or (< main_~v~0 0) (not (<= (+ main_~x~0 1) main_~X~0)) (= (+ (* 2 (* main_~Y~0 (+ main_~x~0 2))) (* main_~Y~0 2)) (+ main_~v~0 (* (- 1) main_~X~0) (* main_~Y~0 2) (* (* main_~X~0 (+ main_~y~0 1)) 2))))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {11519#(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-28 11:15:45,372 INFO L290 TraceCheckUtils]: 34: Hoare triple {11545#(or (not (<= (+ main_~x~0 1) main_~X~0)) (< (+ main_~v~0 (* main_~Y~0 2)) (* main_~X~0 2)) (= (+ (* main_~X~0 (- 3)) (* 2 (* (+ 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))))} 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; {11541#(or (< main_~v~0 0) (not (<= (+ main_~x~0 1) main_~X~0)) (= (+ (* 2 (* main_~Y~0 (+ main_~x~0 2))) (* main_~Y~0 2)) (+ main_~v~0 (* (- 1) main_~X~0) (* main_~Y~0 2) (* (* main_~X~0 (+ main_~y~0 1)) 2))))} is VALID [2022-04-28 11:15:45,373 INFO L290 TraceCheckUtils]: 33: Hoare triple {11545#(or (not (<= (+ main_~x~0 1) main_~X~0)) (< (+ main_~v~0 (* main_~Y~0 2)) (* main_~X~0 2)) (= (+ (* main_~X~0 (- 3)) (* 2 (* (+ 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))))} assume !!(~x~0 <= ~X~0); {11545#(or (not (<= (+ main_~x~0 1) main_~X~0)) (< (+ main_~v~0 (* main_~Y~0 2)) (* main_~X~0 2)) (= (+ (* main_~X~0 (- 3)) (* 2 (* (+ 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))))} is VALID [2022-04-28 11:15:45,374 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {11331#true} {11545#(or (not (<= (+ main_~x~0 1) main_~X~0)) (< (+ main_~v~0 (* main_~Y~0 2)) (* main_~X~0 2)) (= (+ (* main_~X~0 (- 3)) (* 2 (* (+ 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))))} #65#return; {11545#(or (not (<= (+ main_~x~0 1) main_~X~0)) (< (+ main_~v~0 (* main_~Y~0 2)) (* main_~X~0 2)) (= (+ (* main_~X~0 (- 3)) (* 2 (* (+ 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))))} is VALID [2022-04-28 11:15:45,374 INFO L290 TraceCheckUtils]: 31: Hoare triple {11331#true} assume true; {11331#true} is VALID [2022-04-28 11:15:45,374 INFO L290 TraceCheckUtils]: 30: Hoare triple {11331#true} assume !(0 == ~cond); {11331#true} is VALID [2022-04-28 11:15:45,374 INFO L290 TraceCheckUtils]: 29: Hoare triple {11331#true} ~cond := #in~cond; {11331#true} is VALID [2022-04-28 11:15:45,374 INFO L272 TraceCheckUtils]: 28: Hoare triple {11545#(or (not (<= (+ main_~x~0 1) main_~X~0)) (< (+ main_~v~0 (* main_~Y~0 2)) (* main_~X~0 2)) (= (+ (* main_~X~0 (- 3)) (* 2 (* (+ 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))))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {11331#true} is VALID [2022-04-28 11:15:45,374 INFO L290 TraceCheckUtils]: 27: Hoare triple {11545#(or (not (<= (+ main_~x~0 1) main_~X~0)) (< (+ main_~v~0 (* main_~Y~0 2)) (* main_~X~0 2)) (= (+ (* main_~X~0 (- 3)) (* 2 (* (+ 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))))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {11545#(or (not (<= (+ main_~x~0 1) main_~X~0)) (< (+ main_~v~0 (* main_~Y~0 2)) (* main_~X~0 2)) (= (+ (* main_~X~0 (- 3)) (* 2 (* (+ 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))))} is VALID [2022-04-28 11:15:45,377 INFO L290 TraceCheckUtils]: 26: Hoare triple {11570#(or (= (+ (* main_~X~0 (- 3)) (* 2 (* (+ main_~y~0 2) main_~X~0)) main_~v~0 (* main_~Y~0 4)) (+ (* main_~Y~0 2) (* (* (+ main_~x~0 3) main_~Y~0) 2))) (< (+ main_~v~0 (* main_~Y~0 2)) (* main_~X~0 2)) (not (<= (+ main_~x~0 2) main_~X~0)))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {11545#(or (not (<= (+ main_~x~0 1) main_~X~0)) (< (+ main_~v~0 (* main_~Y~0 2)) (* main_~X~0 2)) (= (+ (* main_~X~0 (- 3)) (* 2 (* (+ 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))))} is VALID [2022-04-28 11:15:45,379 INFO L290 TraceCheckUtils]: 25: Hoare triple {11574#(or (= (+ main_~v~0 (* 2 (* main_~X~0 (+ main_~y~0 3))) (* main_~Y~0 6) (* main_~X~0 (- 5))) (+ (* main_~Y~0 2) (* (* (+ main_~x~0 3) main_~Y~0) 2))) (< (+ main_~v~0 (* main_~Y~0 4)) (* main_~X~0 4)) (not (<= (+ main_~x~0 2) 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; {11570#(or (= (+ (* main_~X~0 (- 3)) (* 2 (* (+ main_~y~0 2) main_~X~0)) main_~v~0 (* main_~Y~0 4)) (+ (* main_~Y~0 2) (* (* (+ main_~x~0 3) main_~Y~0) 2))) (< (+ main_~v~0 (* main_~Y~0 2)) (* main_~X~0 2)) (not (<= (+ main_~x~0 2) main_~X~0)))} is VALID [2022-04-28 11:15:45,380 INFO L290 TraceCheckUtils]: 24: Hoare triple {11574#(or (= (+ main_~v~0 (* 2 (* main_~X~0 (+ main_~y~0 3))) (* main_~Y~0 6) (* main_~X~0 (- 5))) (+ (* main_~Y~0 2) (* (* (+ main_~x~0 3) main_~Y~0) 2))) (< (+ main_~v~0 (* main_~Y~0 4)) (* main_~X~0 4)) (not (<= (+ main_~x~0 2) main_~X~0)))} assume !!(~x~0 <= ~X~0); {11574#(or (= (+ main_~v~0 (* 2 (* main_~X~0 (+ main_~y~0 3))) (* main_~Y~0 6) (* main_~X~0 (- 5))) (+ (* main_~Y~0 2) (* (* (+ main_~x~0 3) main_~Y~0) 2))) (< (+ main_~v~0 (* main_~Y~0 4)) (* main_~X~0 4)) (not (<= (+ main_~x~0 2) main_~X~0)))} is VALID [2022-04-28 11:15:45,381 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {11331#true} {11574#(or (= (+ main_~v~0 (* 2 (* main_~X~0 (+ main_~y~0 3))) (* main_~Y~0 6) (* main_~X~0 (- 5))) (+ (* main_~Y~0 2) (* (* (+ main_~x~0 3) main_~Y~0) 2))) (< (+ main_~v~0 (* main_~Y~0 4)) (* main_~X~0 4)) (not (<= (+ main_~x~0 2) main_~X~0)))} #65#return; {11574#(or (= (+ main_~v~0 (* 2 (* main_~X~0 (+ main_~y~0 3))) (* main_~Y~0 6) (* main_~X~0 (- 5))) (+ (* main_~Y~0 2) (* (* (+ main_~x~0 3) main_~Y~0) 2))) (< (+ main_~v~0 (* main_~Y~0 4)) (* main_~X~0 4)) (not (<= (+ main_~x~0 2) main_~X~0)))} is VALID [2022-04-28 11:15:45,381 INFO L290 TraceCheckUtils]: 22: Hoare triple {11331#true} assume true; {11331#true} is VALID [2022-04-28 11:15:45,381 INFO L290 TraceCheckUtils]: 21: Hoare triple {11331#true} assume !(0 == ~cond); {11331#true} is VALID [2022-04-28 11:15:45,381 INFO L290 TraceCheckUtils]: 20: Hoare triple {11331#true} ~cond := #in~cond; {11331#true} is VALID [2022-04-28 11:15:45,381 INFO L272 TraceCheckUtils]: 19: Hoare triple {11574#(or (= (+ main_~v~0 (* 2 (* main_~X~0 (+ main_~y~0 3))) (* main_~Y~0 6) (* main_~X~0 (- 5))) (+ (* main_~Y~0 2) (* (* (+ main_~x~0 3) main_~Y~0) 2))) (< (+ main_~v~0 (* main_~Y~0 4)) (* main_~X~0 4)) (not (<= (+ 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)); {11331#true} is VALID [2022-04-28 11:15:45,382 INFO L290 TraceCheckUtils]: 18: Hoare triple {11574#(or (= (+ main_~v~0 (* 2 (* main_~X~0 (+ main_~y~0 3))) (* main_~Y~0 6) (* main_~X~0 (- 5))) (+ (* main_~Y~0 2) (* (* (+ main_~x~0 3) main_~Y~0) 2))) (< (+ main_~v~0 (* main_~Y~0 4)) (* main_~X~0 4)) (not (<= (+ main_~x~0 2) main_~X~0)))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {11574#(or (= (+ main_~v~0 (* 2 (* main_~X~0 (+ main_~y~0 3))) (* main_~Y~0 6) (* main_~X~0 (- 5))) (+ (* main_~Y~0 2) (* (* (+ main_~x~0 3) main_~Y~0) 2))) (< (+ main_~v~0 (* main_~Y~0 4)) (* main_~X~0 4)) (not (<= (+ main_~x~0 2) main_~X~0)))} is VALID [2022-04-28 11:15:45,382 INFO L290 TraceCheckUtils]: 17: Hoare triple {11331#true} ~v~0 := 2 * ~Y~0 - ~X~0;~y~0 := 0;~x~0 := 0; {11574#(or (= (+ main_~v~0 (* 2 (* main_~X~0 (+ main_~y~0 3))) (* main_~Y~0 6) (* main_~X~0 (- 5))) (+ (* main_~Y~0 2) (* (* (+ main_~x~0 3) main_~Y~0) 2))) (< (+ main_~v~0 (* main_~Y~0 4)) (* main_~X~0 4)) (not (<= (+ main_~x~0 2) main_~X~0)))} is VALID [2022-04-28 11:15:45,382 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {11331#true} {11331#true} #63#return; {11331#true} is VALID [2022-04-28 11:15:45,382 INFO L290 TraceCheckUtils]: 15: Hoare triple {11331#true} assume true; {11331#true} is VALID [2022-04-28 11:15:45,382 INFO L290 TraceCheckUtils]: 14: Hoare triple {11331#true} assume !(0 == ~cond); {11331#true} is VALID [2022-04-28 11:15:45,382 INFO L290 TraceCheckUtils]: 13: Hoare triple {11331#true} ~cond := #in~cond; {11331#true} is VALID [2022-04-28 11:15:45,382 INFO L272 TraceCheckUtils]: 12: Hoare triple {11331#true} call assume_abort_if_not((if ~Y~0 >= 0 && ~Y~0 <= 5 then 1 else 0)); {11331#true} is VALID [2022-04-28 11:15:45,383 INFO L290 TraceCheckUtils]: 11: Hoare triple {11331#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~Y~0 := #t~nondet5;havoc #t~nondet5; {11331#true} is VALID [2022-04-28 11:15:45,383 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {11331#true} {11331#true} #61#return; {11331#true} is VALID [2022-04-28 11:15:45,383 INFO L290 TraceCheckUtils]: 9: Hoare triple {11331#true} assume true; {11331#true} is VALID [2022-04-28 11:15:45,383 INFO L290 TraceCheckUtils]: 8: Hoare triple {11331#true} assume !(0 == ~cond); {11331#true} is VALID [2022-04-28 11:15:45,383 INFO L290 TraceCheckUtils]: 7: Hoare triple {11331#true} ~cond := #in~cond; {11331#true} is VALID [2022-04-28 11:15:45,383 INFO L272 TraceCheckUtils]: 6: Hoare triple {11331#true} call assume_abort_if_not((if ~X~0 >= 0 && ~X~0 <= 5 then 1 else 0)); {11331#true} is VALID [2022-04-28 11:15:45,383 INFO L290 TraceCheckUtils]: 5: Hoare triple {11331#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; {11331#true} is VALID [2022-04-28 11:15:45,383 INFO L272 TraceCheckUtils]: 4: Hoare triple {11331#true} call #t~ret8 := main(); {11331#true} is VALID [2022-04-28 11:15:45,383 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11331#true} {11331#true} #69#return; {11331#true} is VALID [2022-04-28 11:15:45,383 INFO L290 TraceCheckUtils]: 2: Hoare triple {11331#true} assume true; {11331#true} is VALID [2022-04-28 11:15:45,383 INFO L290 TraceCheckUtils]: 1: Hoare triple {11331#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); {11331#true} is VALID [2022-04-28 11:15:45,383 INFO L272 TraceCheckUtils]: 0: Hoare triple {11331#true} call ULTIMATE.init(); {11331#true} is VALID [2022-04-28 11:15:45,384 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 11 proven. 16 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-04-28 11:15:45,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:15:45,384 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [120837529] [2022-04-28 11:15:45,384 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 11:15:45,384 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1265801175] [2022-04-28 11:15:45,384 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1265801175] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 11:15:45,384 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 11:15:45,384 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 22 [2022-04-28 11:15:45,384 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:15:45,384 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [402726414] [2022-04-28 11:15:45,384 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [402726414] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:15:45,385 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:15:45,385 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-28 11:15:45,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [734897085] [2022-04-28 11:15:45,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:15:45,385 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.25) internal successors, (27), 12 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-28 11:15:45,385 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:15:45,385 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 12 states have (on average 2.25) internal successors, (27), 12 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-28 11:15:45,432 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:15:45,432 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-28 11:15:45,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:15:45,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-28 11:15:45,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=378, Unknown=0, NotChecked=0, Total=462 [2022-04-28 11:15:45,433 INFO L87 Difference]: Start difference. First operand 97 states and 106 transitions. Second operand has 13 states, 12 states have (on average 2.25) internal successors, (27), 12 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-28 11:15:47,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:15:47,542 INFO L93 Difference]: Finished difference Result 110 states and 121 transitions. [2022-04-28 11:15:47,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-28 11:15:47,543 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.25) internal successors, (27), 12 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-28 11:15:47,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:15:47,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 2.25) internal successors, (27), 12 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-28 11:15:47,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 65 transitions. [2022-04-28 11:15:47,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 2.25) internal successors, (27), 12 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-28 11:15:47,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 65 transitions. [2022-04-28 11:15:47,545 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 65 transitions. [2022-04-28 11:15:47,634 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:15:47,636 INFO L225 Difference]: With dead ends: 110 [2022-04-28 11:15:47,636 INFO L226 Difference]: Without dead ends: 108 [2022-04-28 11:15:47,636 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 78 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=98, Invalid=454, Unknown=0, NotChecked=0, Total=552 [2022-04-28 11:15:47,637 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 11 mSDsluCounter, 205 mSDsCounter, 0 mSdLazyCounter, 427 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 239 SdHoareTripleChecker+Invalid, 430 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 427 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-04-28 11:15:47,637 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 239 Invalid, 430 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 427 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-04-28 11:15:47,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2022-04-28 11:15:47,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 97. [2022-04-28 11:15:47,924 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:15:47,925 INFO L82 GeneralOperation]: Start isEquivalent. First operand 108 states. Second operand has 97 states, 71 states have (on average 1.0985915492957747) internal successors, (78), 73 states have internal predecessors, (78), 15 states have call successors, (15), 11 states have call predecessors, (15), 10 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-28 11:15:47,925 INFO L74 IsIncluded]: Start isIncluded. First operand 108 states. Second operand has 97 states, 71 states have (on average 1.0985915492957747) internal successors, (78), 73 states have internal predecessors, (78), 15 states have call successors, (15), 11 states have call predecessors, (15), 10 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-28 11:15:47,925 INFO L87 Difference]: Start difference. First operand 108 states. Second operand has 97 states, 71 states have (on average 1.0985915492957747) internal successors, (78), 73 states have internal predecessors, (78), 15 states have call successors, (15), 11 states have call predecessors, (15), 10 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-28 11:15:47,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:15:47,929 INFO L93 Difference]: Finished difference Result 108 states and 119 transitions. [2022-04-28 11:15:47,929 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 119 transitions. [2022-04-28 11:15:47,929 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:15:47,929 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:15:47,930 INFO L74 IsIncluded]: Start isIncluded. First operand has 97 states, 71 states have (on average 1.0985915492957747) internal successors, (78), 73 states have internal predecessors, (78), 15 states have call successors, (15), 11 states have call predecessors, (15), 10 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) Second operand 108 states. [2022-04-28 11:15:47,930 INFO L87 Difference]: Start difference. First operand has 97 states, 71 states have (on average 1.0985915492957747) internal successors, (78), 73 states have internal predecessors, (78), 15 states have call successors, (15), 11 states have call predecessors, (15), 10 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) Second operand 108 states. [2022-04-28 11:15:47,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:15:47,933 INFO L93 Difference]: Finished difference Result 108 states and 119 transitions. [2022-04-28 11:15:47,933 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 119 transitions. [2022-04-28 11:15:47,935 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:15:47,935 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:15:47,935 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:15:47,935 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:15:47,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 71 states have (on average 1.0985915492957747) internal successors, (78), 73 states have internal predecessors, (78), 15 states have call successors, (15), 11 states have call predecessors, (15), 10 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-28 11:15:47,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 106 transitions. [2022-04-28 11:15:47,937 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 106 transitions. Word has length 50 [2022-04-28 11:15:47,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:15:47,937 INFO L495 AbstractCegarLoop]: Abstraction has 97 states and 106 transitions. [2022-04-28 11:15:47,937 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.25) internal successors, (27), 12 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-28 11:15:47,938 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 97 states and 106 transitions. [2022-04-28 11:15:50,225 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 106 edges. 105 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 11:15:50,226 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 106 transitions. [2022-04-28 11:15:50,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-04-28 11:15:50,226 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:15:50,226 INFO L195 NwaCegarLoop]: 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-28 11:15:50,242 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2022-04-28 11:15:50,427 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-04-28 11:15:50,427 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:15:50,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:15:50,427 INFO L85 PathProgramCache]: Analyzing trace with hash 55892592, now seen corresponding path program 3 times [2022-04-28 11:15:50,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:15:50,427 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1837777818] [2022-04-28 11:15:50,428 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 11:15:50,428 INFO L85 PathProgramCache]: Analyzing trace with hash 55892592, now seen corresponding path program 4 times [2022-04-28 11:15:50,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:15:50,428 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1537995494] [2022-04-28 11:15:50,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:15:50,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:15:50,446 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 11:15:50,447 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1249568799] [2022-04-28 11:15:50,447 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 11:15:50,447 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:15:50,447 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:15:50,448 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 11:15:50,459 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-04-28 11:15:50,494 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 11:15:50,494 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 11:15:50,495 INFO L263 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-28 11:15:50,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:15:50,507 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 11:15:51,668 INFO L272 TraceCheckUtils]: 0: Hoare triple {12286#true} call ULTIMATE.init(); {12286#true} is VALID [2022-04-28 11:15:51,668 INFO L290 TraceCheckUtils]: 1: Hoare triple {12286#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); {12286#true} is VALID [2022-04-28 11:15:51,668 INFO L290 TraceCheckUtils]: 2: Hoare triple {12286#true} assume true; {12286#true} is VALID [2022-04-28 11:15:51,668 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12286#true} {12286#true} #69#return; {12286#true} is VALID [2022-04-28 11:15:51,668 INFO L272 TraceCheckUtils]: 4: Hoare triple {12286#true} call #t~ret8 := main(); {12286#true} is VALID [2022-04-28 11:15:51,668 INFO L290 TraceCheckUtils]: 5: Hoare triple {12286#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; {12286#true} is VALID [2022-04-28 11:15:51,669 INFO L272 TraceCheckUtils]: 6: Hoare triple {12286#true} call assume_abort_if_not((if ~X~0 >= 0 && ~X~0 <= 5 then 1 else 0)); {12286#true} is VALID [2022-04-28 11:15:51,669 INFO L290 TraceCheckUtils]: 7: Hoare triple {12286#true} ~cond := #in~cond; {12286#true} is VALID [2022-04-28 11:15:51,669 INFO L290 TraceCheckUtils]: 8: Hoare triple {12286#true} assume !(0 == ~cond); {12286#true} is VALID [2022-04-28 11:15:51,669 INFO L290 TraceCheckUtils]: 9: Hoare triple {12286#true} assume true; {12286#true} is VALID [2022-04-28 11:15:51,669 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {12286#true} {12286#true} #61#return; {12286#true} is VALID [2022-04-28 11:15:51,669 INFO L290 TraceCheckUtils]: 11: Hoare triple {12286#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~Y~0 := #t~nondet5;havoc #t~nondet5; {12286#true} is VALID [2022-04-28 11:15:51,669 INFO L272 TraceCheckUtils]: 12: Hoare triple {12286#true} call assume_abort_if_not((if ~Y~0 >= 0 && ~Y~0 <= 5 then 1 else 0)); {12286#true} is VALID [2022-04-28 11:15:51,669 INFO L290 TraceCheckUtils]: 13: Hoare triple {12286#true} ~cond := #in~cond; {12286#true} is VALID [2022-04-28 11:15:51,669 INFO L290 TraceCheckUtils]: 14: Hoare triple {12286#true} assume !(0 == ~cond); {12286#true} is VALID [2022-04-28 11:15:51,669 INFO L290 TraceCheckUtils]: 15: Hoare triple {12286#true} assume true; {12286#true} is VALID [2022-04-28 11:15:51,670 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {12286#true} {12286#true} #63#return; {12286#true} is VALID [2022-04-28 11:15:51,670 INFO L290 TraceCheckUtils]: 17: Hoare triple {12286#true} ~v~0 := 2 * ~Y~0 - ~X~0;~y~0 := 0;~x~0 := 0; {12342#(and (<= main_~x~0 0) (<= (* main_~Y~0 2) (+ main_~X~0 main_~v~0)))} is VALID [2022-04-28 11:15:51,671 INFO L290 TraceCheckUtils]: 18: Hoare triple {12342#(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; {12342#(and (<= main_~x~0 0) (<= (* main_~Y~0 2) (+ main_~X~0 main_~v~0)))} is VALID [2022-04-28 11:15:51,671 INFO L272 TraceCheckUtils]: 19: Hoare triple {12342#(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)); {12286#true} is VALID [2022-04-28 11:15:51,671 INFO L290 TraceCheckUtils]: 20: Hoare triple {12286#true} ~cond := #in~cond; {12286#true} is VALID [2022-04-28 11:15:51,671 INFO L290 TraceCheckUtils]: 21: Hoare triple {12286#true} assume !(0 == ~cond); {12286#true} is VALID [2022-04-28 11:15:51,671 INFO L290 TraceCheckUtils]: 22: Hoare triple {12286#true} assume true; {12286#true} is VALID [2022-04-28 11:15:51,672 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {12286#true} {12342#(and (<= main_~x~0 0) (<= (* main_~Y~0 2) (+ main_~X~0 main_~v~0)))} #65#return; {12342#(and (<= main_~x~0 0) (<= (* main_~Y~0 2) (+ main_~X~0 main_~v~0)))} is VALID [2022-04-28 11:15:51,672 INFO L290 TraceCheckUtils]: 24: Hoare triple {12342#(and (<= main_~x~0 0) (<= (* main_~Y~0 2) (+ main_~X~0 main_~v~0)))} assume !!(~x~0 <= ~X~0); {12342#(and (<= main_~x~0 0) (<= (* main_~Y~0 2) (+ main_~X~0 main_~v~0)))} is VALID [2022-04-28 11:15:51,673 INFO L290 TraceCheckUtils]: 25: Hoare triple {12342#(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; {12367#(and (<= main_~x~0 0) (< (div (+ (- 1) (* (- 1) main_~v~0)) (- 2)) (+ (div (+ (- 1) main_~X~0) 2) 1)))} is VALID [2022-04-28 11:15:51,675 INFO L290 TraceCheckUtils]: 26: Hoare triple {12367#(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; {12371#(and (<= main_~x~0 1) (< (div (+ (- 1) (* (- 1) main_~v~0)) (- 2)) (+ (div (+ (- 1) main_~X~0) 2) 1)))} is VALID [2022-04-28 11:15:51,676 INFO L290 TraceCheckUtils]: 27: Hoare triple {12371#(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; {12371#(and (<= main_~x~0 1) (< (div (+ (- 1) (* (- 1) main_~v~0)) (- 2)) (+ (div (+ (- 1) main_~X~0) 2) 1)))} is VALID [2022-04-28 11:15:51,676 INFO L272 TraceCheckUtils]: 28: Hoare triple {12371#(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)); {12286#true} is VALID [2022-04-28 11:15:51,676 INFO L290 TraceCheckUtils]: 29: Hoare triple {12286#true} ~cond := #in~cond; {12286#true} is VALID [2022-04-28 11:15:51,676 INFO L290 TraceCheckUtils]: 30: Hoare triple {12286#true} assume !(0 == ~cond); {12286#true} is VALID [2022-04-28 11:15:51,676 INFO L290 TraceCheckUtils]: 31: Hoare triple {12286#true} assume true; {12286#true} is VALID [2022-04-28 11:15:51,677 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {12286#true} {12371#(and (<= main_~x~0 1) (< (div (+ (- 1) (* (- 1) main_~v~0)) (- 2)) (+ (div (+ (- 1) main_~X~0) 2) 1)))} #65#return; {12371#(and (<= main_~x~0 1) (< (div (+ (- 1) (* (- 1) main_~v~0)) (- 2)) (+ (div (+ (- 1) main_~X~0) 2) 1)))} is VALID [2022-04-28 11:15:51,677 INFO L290 TraceCheckUtils]: 33: Hoare triple {12371#(and (<= main_~x~0 1) (< (div (+ (- 1) (* (- 1) main_~v~0)) (- 2)) (+ (div (+ (- 1) main_~X~0) 2) 1)))} assume !!(~x~0 <= ~X~0); {12371#(and (<= main_~x~0 1) (< (div (+ (- 1) (* (- 1) main_~v~0)) (- 2)) (+ (div (+ (- 1) main_~X~0) 2) 1)))} is VALID [2022-04-28 11:15:51,678 INFO L290 TraceCheckUtils]: 34: Hoare triple {12371#(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; {12396#(and (<= main_~x~0 1) (< 0 (div (+ (- 1) main_~X~0) 2)))} is VALID [2022-04-28 11:15:51,679 INFO L290 TraceCheckUtils]: 35: Hoare triple {12396#(and (<= main_~x~0 1) (< 0 (div (+ (- 1) main_~X~0) 2)))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {12400#(and (<= main_~x~0 2) (< 0 (div (+ (- 1) main_~X~0) 2)))} is VALID [2022-04-28 11:15:51,679 INFO L290 TraceCheckUtils]: 36: Hoare triple {12400#(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; {12400#(and (<= main_~x~0 2) (< 0 (div (+ (- 1) main_~X~0) 2)))} is VALID [2022-04-28 11:15:51,680 INFO L272 TraceCheckUtils]: 37: Hoare triple {12400#(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)); {12286#true} is VALID [2022-04-28 11:15:51,680 INFO L290 TraceCheckUtils]: 38: Hoare triple {12286#true} ~cond := #in~cond; {12286#true} is VALID [2022-04-28 11:15:51,680 INFO L290 TraceCheckUtils]: 39: Hoare triple {12286#true} assume !(0 == ~cond); {12286#true} is VALID [2022-04-28 11:15:51,680 INFO L290 TraceCheckUtils]: 40: Hoare triple {12286#true} assume true; {12286#true} is VALID [2022-04-28 11:15:51,681 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {12286#true} {12400#(and (<= main_~x~0 2) (< 0 (div (+ (- 1) main_~X~0) 2)))} #65#return; {12400#(and (<= main_~x~0 2) (< 0 (div (+ (- 1) main_~X~0) 2)))} is VALID [2022-04-28 11:15:51,681 INFO L290 TraceCheckUtils]: 42: Hoare triple {12400#(and (<= main_~x~0 2) (< 0 (div (+ (- 1) main_~X~0) 2)))} assume !!(~x~0 <= ~X~0); {12400#(and (<= main_~x~0 2) (< 0 (div (+ (- 1) main_~X~0) 2)))} is VALID [2022-04-28 11:15:51,681 INFO L290 TraceCheckUtils]: 43: Hoare triple {12400#(and (<= main_~x~0 2) (< 0 (div (+ (- 1) main_~X~0) 2)))} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {12400#(and (<= main_~x~0 2) (< 0 (div (+ (- 1) main_~X~0) 2)))} is VALID [2022-04-28 11:15:51,682 INFO L290 TraceCheckUtils]: 44: Hoare triple {12400#(and (<= main_~x~0 2) (< 0 (div (+ (- 1) main_~X~0) 2)))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {12428#(and (<= main_~x~0 3) (< 0 (div (+ (- 1) main_~X~0) 2)))} is VALID [2022-04-28 11:15:51,683 INFO L290 TraceCheckUtils]: 45: Hoare triple {12428#(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; {12428#(and (<= main_~x~0 3) (< 0 (div (+ (- 1) main_~X~0) 2)))} is VALID [2022-04-28 11:15:51,683 INFO L272 TraceCheckUtils]: 46: Hoare triple {12428#(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)); {12286#true} is VALID [2022-04-28 11:15:51,683 INFO L290 TraceCheckUtils]: 47: Hoare triple {12286#true} ~cond := #in~cond; {12286#true} is VALID [2022-04-28 11:15:51,683 INFO L290 TraceCheckUtils]: 48: Hoare triple {12286#true} assume !(0 == ~cond); {12286#true} is VALID [2022-04-28 11:15:51,683 INFO L290 TraceCheckUtils]: 49: Hoare triple {12286#true} assume true; {12286#true} is VALID [2022-04-28 11:15:51,684 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {12286#true} {12428#(and (<= main_~x~0 3) (< 0 (div (+ (- 1) main_~X~0) 2)))} #65#return; {12428#(and (<= main_~x~0 3) (< 0 (div (+ (- 1) main_~X~0) 2)))} is VALID [2022-04-28 11:15:51,685 INFO L290 TraceCheckUtils]: 51: Hoare triple {12428#(and (<= main_~x~0 3) (< 0 (div (+ (- 1) main_~X~0) 2)))} assume !(~x~0 <= ~X~0); {12287#false} is VALID [2022-04-28 11:15:51,685 INFO L290 TraceCheckUtils]: 52: Hoare triple {12287#false} ~xy~0 := ~x~0 * ~y~0;~yx~0 := ~Y~0 * ~x~0; {12287#false} is VALID [2022-04-28 11:15:51,685 INFO L272 TraceCheckUtils]: 53: Hoare triple {12287#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)); {12287#false} is VALID [2022-04-28 11:15:51,685 INFO L290 TraceCheckUtils]: 54: Hoare triple {12287#false} ~cond := #in~cond; {12287#false} is VALID [2022-04-28 11:15:51,685 INFO L290 TraceCheckUtils]: 55: Hoare triple {12287#false} assume 0 == ~cond; {12287#false} is VALID [2022-04-28 11:15:51,685 INFO L290 TraceCheckUtils]: 56: Hoare triple {12287#false} assume !false; {12287#false} is VALID [2022-04-28 11:15:51,686 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-28 11:15:51,686 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 11:15:52,071 INFO L290 TraceCheckUtils]: 56: Hoare triple {12287#false} assume !false; {12287#false} is VALID [2022-04-28 11:15:52,071 INFO L290 TraceCheckUtils]: 55: Hoare triple {12287#false} assume 0 == ~cond; {12287#false} is VALID [2022-04-28 11:15:52,071 INFO L290 TraceCheckUtils]: 54: Hoare triple {12287#false} ~cond := #in~cond; {12287#false} is VALID [2022-04-28 11:15:52,071 INFO L272 TraceCheckUtils]: 53: Hoare triple {12287#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)); {12287#false} is VALID [2022-04-28 11:15:52,071 INFO L290 TraceCheckUtils]: 52: Hoare triple {12287#false} ~xy~0 := ~x~0 * ~y~0;~yx~0 := ~Y~0 * ~x~0; {12287#false} is VALID [2022-04-28 11:15:52,072 INFO L290 TraceCheckUtils]: 51: Hoare triple {12480#(<= main_~x~0 main_~X~0)} assume !(~x~0 <= ~X~0); {12287#false} is VALID [2022-04-28 11:15:52,072 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {12286#true} {12480#(<= main_~x~0 main_~X~0)} #65#return; {12480#(<= main_~x~0 main_~X~0)} is VALID [2022-04-28 11:15:52,072 INFO L290 TraceCheckUtils]: 49: Hoare triple {12286#true} assume true; {12286#true} is VALID [2022-04-28 11:15:52,072 INFO L290 TraceCheckUtils]: 48: Hoare triple {12286#true} assume !(0 == ~cond); {12286#true} is VALID [2022-04-28 11:15:52,072 INFO L290 TraceCheckUtils]: 47: Hoare triple {12286#true} ~cond := #in~cond; {12286#true} is VALID [2022-04-28 11:15:52,072 INFO L272 TraceCheckUtils]: 46: Hoare triple {12480#(<= 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)); {12286#true} is VALID [2022-04-28 11:15:52,073 INFO L290 TraceCheckUtils]: 45: Hoare triple {12480#(<= main_~x~0 main_~X~0)} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {12480#(<= main_~x~0 main_~X~0)} is VALID [2022-04-28 11:15:52,074 INFO L290 TraceCheckUtils]: 44: Hoare triple {12502#(<= (+ main_~x~0 1) main_~X~0)} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {12480#(<= main_~x~0 main_~X~0)} is VALID [2022-04-28 11:15:52,074 INFO L290 TraceCheckUtils]: 43: Hoare triple {12502#(<= (+ main_~x~0 1) main_~X~0)} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {12502#(<= (+ main_~x~0 1) main_~X~0)} is VALID [2022-04-28 11:15:52,075 INFO L290 TraceCheckUtils]: 42: Hoare triple {12502#(<= (+ main_~x~0 1) main_~X~0)} assume !!(~x~0 <= ~X~0); {12502#(<= (+ main_~x~0 1) main_~X~0)} is VALID [2022-04-28 11:15:52,075 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {12286#true} {12502#(<= (+ main_~x~0 1) main_~X~0)} #65#return; {12502#(<= (+ main_~x~0 1) main_~X~0)} is VALID [2022-04-28 11:15:52,075 INFO L290 TraceCheckUtils]: 40: Hoare triple {12286#true} assume true; {12286#true} is VALID [2022-04-28 11:15:52,075 INFO L290 TraceCheckUtils]: 39: Hoare triple {12286#true} assume !(0 == ~cond); {12286#true} is VALID [2022-04-28 11:15:52,075 INFO L290 TraceCheckUtils]: 38: Hoare triple {12286#true} ~cond := #in~cond; {12286#true} is VALID [2022-04-28 11:15:52,075 INFO L272 TraceCheckUtils]: 37: Hoare triple {12502#(<= (+ 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)); {12286#true} is VALID [2022-04-28 11:15:52,076 INFO L290 TraceCheckUtils]: 36: Hoare triple {12502#(<= (+ main_~x~0 1) main_~X~0)} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {12502#(<= (+ main_~x~0 1) main_~X~0)} is VALID [2022-04-28 11:15:52,076 INFO L290 TraceCheckUtils]: 35: Hoare triple {12530#(<= (+ main_~x~0 2) main_~X~0)} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {12502#(<= (+ main_~x~0 1) main_~X~0)} is VALID [2022-04-28 11:15:52,077 INFO L290 TraceCheckUtils]: 34: Hoare triple {12534#(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; {12530#(<= (+ main_~x~0 2) main_~X~0)} is VALID [2022-04-28 11:15:52,077 INFO L290 TraceCheckUtils]: 33: Hoare triple {12534#(or (<= (+ main_~x~0 2) main_~X~0) (< main_~v~0 0))} assume !!(~x~0 <= ~X~0); {12534#(or (<= (+ main_~x~0 2) main_~X~0) (< main_~v~0 0))} is VALID [2022-04-28 11:15:52,078 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {12286#true} {12534#(or (<= (+ main_~x~0 2) main_~X~0) (< main_~v~0 0))} #65#return; {12534#(or (<= (+ main_~x~0 2) main_~X~0) (< main_~v~0 0))} is VALID [2022-04-28 11:15:52,078 INFO L290 TraceCheckUtils]: 31: Hoare triple {12286#true} assume true; {12286#true} is VALID [2022-04-28 11:15:52,078 INFO L290 TraceCheckUtils]: 30: Hoare triple {12286#true} assume !(0 == ~cond); {12286#true} is VALID [2022-04-28 11:15:52,078 INFO L290 TraceCheckUtils]: 29: Hoare triple {12286#true} ~cond := #in~cond; {12286#true} is VALID [2022-04-28 11:15:52,078 INFO L272 TraceCheckUtils]: 28: Hoare triple {12534#(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)); {12286#true} is VALID [2022-04-28 11:15:52,078 INFO L290 TraceCheckUtils]: 27: Hoare triple {12534#(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; {12534#(or (<= (+ main_~x~0 2) main_~X~0) (< main_~v~0 0))} is VALID [2022-04-28 11:15:52,079 INFO L290 TraceCheckUtils]: 26: Hoare triple {12559#(or (< main_~v~0 0) (<= (+ main_~x~0 3) main_~X~0))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {12534#(or (<= (+ main_~x~0 2) main_~X~0) (< main_~v~0 0))} is VALID [2022-04-28 11:15:52,080 INFO L290 TraceCheckUtils]: 25: Hoare triple {12563#(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; {12559#(or (< main_~v~0 0) (<= (+ main_~x~0 3) main_~X~0))} is VALID [2022-04-28 11:15:52,080 INFO L290 TraceCheckUtils]: 24: Hoare triple {12563#(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); {12563#(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-28 11:15:52,081 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {12286#true} {12563#(or (< (+ main_~v~0 (* main_~Y~0 2)) 0) (not (< main_~v~0 0)) (<= (+ main_~x~0 3) main_~X~0))} #65#return; {12563#(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-28 11:15:52,081 INFO L290 TraceCheckUtils]: 22: Hoare triple {12286#true} assume true; {12286#true} is VALID [2022-04-28 11:15:52,081 INFO L290 TraceCheckUtils]: 21: Hoare triple {12286#true} assume !(0 == ~cond); {12286#true} is VALID [2022-04-28 11:15:52,081 INFO L290 TraceCheckUtils]: 20: Hoare triple {12286#true} ~cond := #in~cond; {12286#true} is VALID [2022-04-28 11:15:52,081 INFO L272 TraceCheckUtils]: 19: Hoare triple {12563#(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)); {12286#true} is VALID [2022-04-28 11:15:52,091 INFO L290 TraceCheckUtils]: 18: Hoare triple {12563#(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; {12563#(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-28 11:15:52,092 INFO L290 TraceCheckUtils]: 17: Hoare triple {12286#true} ~v~0 := 2 * ~Y~0 - ~X~0;~y~0 := 0;~x~0 := 0; {12563#(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-28 11:15:52,092 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {12286#true} {12286#true} #63#return; {12286#true} is VALID [2022-04-28 11:15:52,093 INFO L290 TraceCheckUtils]: 15: Hoare triple {12286#true} assume true; {12286#true} is VALID [2022-04-28 11:15:52,093 INFO L290 TraceCheckUtils]: 14: Hoare triple {12286#true} assume !(0 == ~cond); {12286#true} is VALID [2022-04-28 11:15:52,093 INFO L290 TraceCheckUtils]: 13: Hoare triple {12286#true} ~cond := #in~cond; {12286#true} is VALID [2022-04-28 11:15:52,093 INFO L272 TraceCheckUtils]: 12: Hoare triple {12286#true} call assume_abort_if_not((if ~Y~0 >= 0 && ~Y~0 <= 5 then 1 else 0)); {12286#true} is VALID [2022-04-28 11:15:52,093 INFO L290 TraceCheckUtils]: 11: Hoare triple {12286#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~Y~0 := #t~nondet5;havoc #t~nondet5; {12286#true} is VALID [2022-04-28 11:15:52,093 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {12286#true} {12286#true} #61#return; {12286#true} is VALID [2022-04-28 11:15:52,093 INFO L290 TraceCheckUtils]: 9: Hoare triple {12286#true} assume true; {12286#true} is VALID [2022-04-28 11:15:52,093 INFO L290 TraceCheckUtils]: 8: Hoare triple {12286#true} assume !(0 == ~cond); {12286#true} is VALID [2022-04-28 11:15:52,093 INFO L290 TraceCheckUtils]: 7: Hoare triple {12286#true} ~cond := #in~cond; {12286#true} is VALID [2022-04-28 11:15:52,093 INFO L272 TraceCheckUtils]: 6: Hoare triple {12286#true} call assume_abort_if_not((if ~X~0 >= 0 && ~X~0 <= 5 then 1 else 0)); {12286#true} is VALID [2022-04-28 11:15:52,093 INFO L290 TraceCheckUtils]: 5: Hoare triple {12286#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; {12286#true} is VALID [2022-04-28 11:15:52,094 INFO L272 TraceCheckUtils]: 4: Hoare triple {12286#true} call #t~ret8 := main(); {12286#true} is VALID [2022-04-28 11:15:52,094 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12286#true} {12286#true} #69#return; {12286#true} is VALID [2022-04-28 11:15:52,094 INFO L290 TraceCheckUtils]: 2: Hoare triple {12286#true} assume true; {12286#true} is VALID [2022-04-28 11:15:52,094 INFO L290 TraceCheckUtils]: 1: Hoare triple {12286#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); {12286#true} is VALID [2022-04-28 11:15:52,094 INFO L272 TraceCheckUtils]: 0: Hoare triple {12286#true} call ULTIMATE.init(); {12286#true} is VALID [2022-04-28 11:15:52,094 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-28 11:15:52,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:15:52,094 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1537995494] [2022-04-28 11:15:52,095 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 11:15:52,095 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1249568799] [2022-04-28 11:15:52,095 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1249568799] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 11:15:52,095 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 11:15:52,095 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2022-04-28 11:15:52,095 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:15:52,095 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1837777818] [2022-04-28 11:15:52,095 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1837777818] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:15:52,095 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:15:52,096 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 11:15:52,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936348989] [2022-04-28 11:15:52,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:15:52,096 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-28 11:15:52,096 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:15:52,096 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-28 11:15:52,134 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:15:52,134 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-28 11:15:52,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:15:52,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-28 11:15:52,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2022-04-28 11:15:52,135 INFO L87 Difference]: Start difference. First operand 97 states and 106 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-28 11:15:52,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:15:52,880 INFO L93 Difference]: Finished difference Result 111 states and 122 transitions. [2022-04-28 11:15:52,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-28 11:15:52,881 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-28 11:15:52,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:15:52,881 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-28 11:15:52,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 65 transitions. [2022-04-28 11:15:52,882 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-28 11:15:52,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 65 transitions. [2022-04-28 11:15:52,883 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 65 transitions. [2022-04-28 11:15:52,948 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:15:52,949 INFO L225 Difference]: With dead ends: 111 [2022-04-28 11:15:52,949 INFO L226 Difference]: Without dead ends: 103 [2022-04-28 11:15:52,949 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2022-04-28 11:15:52,950 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 5 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 11:15:52,950 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 104 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 11:15:52,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2022-04-28 11:15:53,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 101. [2022-04-28 11:15:53,201 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:15:53,202 INFO L82 GeneralOperation]: Start isEquivalent. First operand 103 states. Second operand has 101 states, 74 states have (on average 1.0945945945945945) internal successors, (81), 76 states have internal predecessors, (81), 16 states have call successors, (16), 11 states have call predecessors, (16), 10 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-28 11:15:53,202 INFO L74 IsIncluded]: Start isIncluded. First operand 103 states. Second operand has 101 states, 74 states have (on average 1.0945945945945945) internal successors, (81), 76 states have internal predecessors, (81), 16 states have call successors, (16), 11 states have call predecessors, (16), 10 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-28 11:15:53,202 INFO L87 Difference]: Start difference. First operand 103 states. Second operand has 101 states, 74 states have (on average 1.0945945945945945) internal successors, (81), 76 states have internal predecessors, (81), 16 states have call successors, (16), 11 states have call predecessors, (16), 10 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-28 11:15:53,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:15:53,203 INFO L93 Difference]: Finished difference Result 103 states and 114 transitions. [2022-04-28 11:15:53,203 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 114 transitions. [2022-04-28 11:15:53,204 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:15:53,204 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:15:53,204 INFO L74 IsIncluded]: Start isIncluded. First operand has 101 states, 74 states have (on average 1.0945945945945945) internal successors, (81), 76 states have internal predecessors, (81), 16 states have call successors, (16), 11 states have call predecessors, (16), 10 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) Second operand 103 states. [2022-04-28 11:15:53,204 INFO L87 Difference]: Start difference. First operand has 101 states, 74 states have (on average 1.0945945945945945) internal successors, (81), 76 states have internal predecessors, (81), 16 states have call successors, (16), 11 states have call predecessors, (16), 10 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) Second operand 103 states. [2022-04-28 11:15:53,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:15:53,206 INFO L93 Difference]: Finished difference Result 103 states and 114 transitions. [2022-04-28 11:15:53,206 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 114 transitions. [2022-04-28 11:15:53,206 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:15:53,206 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:15:53,207 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:15:53,207 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:15:53,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 74 states have (on average 1.0945945945945945) internal successors, (81), 76 states have internal predecessors, (81), 16 states have call successors, (16), 11 states have call predecessors, (16), 10 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-28 11:15:53,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 111 transitions. [2022-04-28 11:15:53,209 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 111 transitions. Word has length 57 [2022-04-28 11:15:53,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:15:53,209 INFO L495 AbstractCegarLoop]: Abstraction has 101 states and 111 transitions. [2022-04-28 11:15:53,209 INFO L496 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-28 11:15:53,209 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 101 states and 111 transitions. [2022-04-28 11:15:57,566 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 111 edges. 109 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-28 11:15:57,566 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 111 transitions. [2022-04-28 11:15:57,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-04-28 11:15:57,567 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:15:57,567 INFO L195 NwaCegarLoop]: 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-28 11:15:57,586 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-04-28 11:15:57,775 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-04-28 11:15:57,776 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:15:57,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:15:57,776 INFO L85 PathProgramCache]: Analyzing trace with hash 1124973290, now seen corresponding path program 5 times [2022-04-28 11:15:57,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:15:57,776 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1581974429] [2022-04-28 11:15:57,776 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 11:15:57,776 INFO L85 PathProgramCache]: Analyzing trace with hash 1124973290, now seen corresponding path program 6 times [2022-04-28 11:15:57,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:15:57,776 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56287581] [2022-04-28 11:15:57,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:15:57,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:15:57,796 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 11:15:57,797 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1817868449] [2022-04-28 11:15:57,797 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 11:15:57,797 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:15:57,797 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:15:57,798 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 11:15:57,799 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-04-28 11:15:57,841 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-04-28 11:15:57,841 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 11:15:57,842 INFO L263 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 29 conjunts are in the unsatisfiable core [2022-04-28 11:15:57,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:15:57,856 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 11:16:15,637 WARN L828 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-28 11:16:25,672 WARN L828 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-28 11:16:31,692 WARN L828 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-28 11:16:48,427 INFO L272 TraceCheckUtils]: 0: Hoare triple {13271#true} call ULTIMATE.init(); {13271#true} is VALID [2022-04-28 11:16:48,427 INFO L290 TraceCheckUtils]: 1: Hoare triple {13271#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); {13271#true} is VALID [2022-04-28 11:16:48,427 INFO L290 TraceCheckUtils]: 2: Hoare triple {13271#true} assume true; {13271#true} is VALID [2022-04-28 11:16:48,427 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13271#true} {13271#true} #69#return; {13271#true} is VALID [2022-04-28 11:16:48,427 INFO L272 TraceCheckUtils]: 4: Hoare triple {13271#true} call #t~ret8 := main(); {13271#true} is VALID [2022-04-28 11:16:48,427 INFO L290 TraceCheckUtils]: 5: Hoare triple {13271#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; {13271#true} is VALID [2022-04-28 11:16:48,427 INFO L272 TraceCheckUtils]: 6: Hoare triple {13271#true} call assume_abort_if_not((if ~X~0 >= 0 && ~X~0 <= 5 then 1 else 0)); {13271#true} is VALID [2022-04-28 11:16:48,428 INFO L290 TraceCheckUtils]: 7: Hoare triple {13271#true} ~cond := #in~cond; {13271#true} is VALID [2022-04-28 11:16:48,428 INFO L290 TraceCheckUtils]: 8: Hoare triple {13271#true} assume !(0 == ~cond); {13271#true} is VALID [2022-04-28 11:16:48,428 INFO L290 TraceCheckUtils]: 9: Hoare triple {13271#true} assume true; {13271#true} is VALID [2022-04-28 11:16:48,428 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {13271#true} {13271#true} #61#return; {13271#true} is VALID [2022-04-28 11:16:48,428 INFO L290 TraceCheckUtils]: 11: Hoare triple {13271#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~Y~0 := #t~nondet5;havoc #t~nondet5; {13271#true} is VALID [2022-04-28 11:16:48,428 INFO L272 TraceCheckUtils]: 12: Hoare triple {13271#true} call assume_abort_if_not((if ~Y~0 >= 0 && ~Y~0 <= 5 then 1 else 0)); {13271#true} is VALID [2022-04-28 11:16:48,428 INFO L290 TraceCheckUtils]: 13: Hoare triple {13271#true} ~cond := #in~cond; {13271#true} is VALID [2022-04-28 11:16:48,428 INFO L290 TraceCheckUtils]: 14: Hoare triple {13271#true} assume !(0 == ~cond); {13271#true} is VALID [2022-04-28 11:16:48,428 INFO L290 TraceCheckUtils]: 15: Hoare triple {13271#true} assume true; {13271#true} is VALID [2022-04-28 11:16:48,428 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {13271#true} {13271#true} #63#return; {13271#true} is VALID [2022-04-28 11:16:48,428 INFO L290 TraceCheckUtils]: 17: Hoare triple {13271#true} ~v~0 := 2 * ~Y~0 - ~X~0;~y~0 := 0;~x~0 := 0; {13327#(and (<= 0 main_~x~0) (= main_~y~0 0))} is VALID [2022-04-28 11:16:48,429 INFO L290 TraceCheckUtils]: 18: Hoare triple {13327#(and (<= 0 main_~x~0) (= main_~y~0 0))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {13327#(and (<= 0 main_~x~0) (= main_~y~0 0))} is VALID [2022-04-28 11:16:48,429 INFO L272 TraceCheckUtils]: 19: Hoare triple {13327#(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)); {13271#true} is VALID [2022-04-28 11:16:48,429 INFO L290 TraceCheckUtils]: 20: Hoare triple {13271#true} ~cond := #in~cond; {13271#true} is VALID [2022-04-28 11:16:48,429 INFO L290 TraceCheckUtils]: 21: Hoare triple {13271#true} assume !(0 == ~cond); {13271#true} is VALID [2022-04-28 11:16:48,429 INFO L290 TraceCheckUtils]: 22: Hoare triple {13271#true} assume true; {13271#true} is VALID [2022-04-28 11:16:48,430 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {13271#true} {13327#(and (<= 0 main_~x~0) (= main_~y~0 0))} #65#return; {13327#(and (<= 0 main_~x~0) (= main_~y~0 0))} is VALID [2022-04-28 11:16:48,431 INFO L290 TraceCheckUtils]: 24: Hoare triple {13327#(and (<= 0 main_~x~0) (= main_~y~0 0))} assume !!(~x~0 <= ~X~0); {13349#(and (<= 0 main_~X~0) (= main_~y~0 0))} is VALID [2022-04-28 11:16:48,431 INFO L290 TraceCheckUtils]: 25: Hoare triple {13349#(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; {13353#(and (= main_~y~0 1) (<= 0 main_~X~0))} is VALID [2022-04-28 11:16:48,432 INFO L290 TraceCheckUtils]: 26: Hoare triple {13353#(and (= main_~y~0 1) (<= 0 main_~X~0))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {13353#(and (= main_~y~0 1) (<= 0 main_~X~0))} is VALID [2022-04-28 11:16:48,432 INFO L290 TraceCheckUtils]: 27: Hoare triple {13353#(and (= main_~y~0 1) (<= 0 main_~X~0))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {13353#(and (= main_~y~0 1) (<= 0 main_~X~0))} is VALID [2022-04-28 11:16:48,432 INFO L272 TraceCheckUtils]: 28: Hoare triple {13353#(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)); {13271#true} is VALID [2022-04-28 11:16:48,432 INFO L290 TraceCheckUtils]: 29: Hoare triple {13271#true} ~cond := #in~cond; {13271#true} is VALID [2022-04-28 11:16:48,432 INFO L290 TraceCheckUtils]: 30: Hoare triple {13271#true} assume !(0 == ~cond); {13271#true} is VALID [2022-04-28 11:16:48,432 INFO L290 TraceCheckUtils]: 31: Hoare triple {13271#true} assume true; {13271#true} is VALID [2022-04-28 11:16:48,433 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {13271#true} {13353#(and (= main_~y~0 1) (<= 0 main_~X~0))} #65#return; {13353#(and (= main_~y~0 1) (<= 0 main_~X~0))} is VALID [2022-04-28 11:16:48,434 INFO L290 TraceCheckUtils]: 33: Hoare triple {13353#(and (= main_~y~0 1) (<= 0 main_~X~0))} assume !!(~x~0 <= ~X~0); {13353#(and (= main_~y~0 1) (<= 0 main_~X~0))} is VALID [2022-04-28 11:16:48,434 INFO L290 TraceCheckUtils]: 34: Hoare triple {13353#(and (= main_~y~0 1) (<= 0 main_~X~0))} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {13353#(and (= main_~y~0 1) (<= 0 main_~X~0))} is VALID [2022-04-28 11:16:48,434 INFO L290 TraceCheckUtils]: 35: Hoare triple {13353#(and (= main_~y~0 1) (<= 0 main_~X~0))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {13353#(and (= main_~y~0 1) (<= 0 main_~X~0))} is VALID [2022-04-28 11:16:48,435 INFO L290 TraceCheckUtils]: 36: Hoare triple {13353#(and (= main_~y~0 1) (<= 0 main_~X~0))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {13353#(and (= main_~y~0 1) (<= 0 main_~X~0))} is VALID [2022-04-28 11:16:48,435 INFO L272 TraceCheckUtils]: 37: Hoare triple {13353#(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)); {13271#true} is VALID [2022-04-28 11:16:48,435 INFO L290 TraceCheckUtils]: 38: Hoare triple {13271#true} ~cond := #in~cond; {13271#true} is VALID [2022-04-28 11:16:48,435 INFO L290 TraceCheckUtils]: 39: Hoare triple {13271#true} assume !(0 == ~cond); {13271#true} is VALID [2022-04-28 11:16:48,435 INFO L290 TraceCheckUtils]: 40: Hoare triple {13271#true} assume true; {13271#true} is VALID [2022-04-28 11:16:48,436 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {13271#true} {13353#(and (= main_~y~0 1) (<= 0 main_~X~0))} #65#return; {13353#(and (= main_~y~0 1) (<= 0 main_~X~0))} is VALID [2022-04-28 11:16:48,436 INFO L290 TraceCheckUtils]: 42: Hoare triple {13353#(and (= main_~y~0 1) (<= 0 main_~X~0))} assume !!(~x~0 <= ~X~0); {13405#(and (<= main_~x~0 main_~X~0) (= main_~y~0 1) (<= 0 main_~X~0))} is VALID [2022-04-28 11:16:48,436 INFO L290 TraceCheckUtils]: 43: Hoare triple {13405#(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; {13409#(and (= main_~y~0 2) (<= main_~x~0 main_~X~0) (<= 0 main_~X~0))} is VALID [2022-04-28 11:16:48,437 INFO L290 TraceCheckUtils]: 44: Hoare triple {13409#(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; {13413#(and (= main_~y~0 2) (<= 0 main_~X~0) (<= main_~x~0 (+ main_~X~0 1)))} is VALID [2022-04-28 11:16:48,438 INFO L290 TraceCheckUtils]: 45: Hoare triple {13413#(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; {13417#(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-28 11:16:48,438 INFO L272 TraceCheckUtils]: 46: Hoare triple {13417#(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)); {13271#true} is VALID [2022-04-28 11:16:48,438 INFO L290 TraceCheckUtils]: 47: Hoare triple {13271#true} ~cond := #in~cond; {13424#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:16:48,438 INFO L290 TraceCheckUtils]: 48: Hoare triple {13424#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {13428#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:16:48,438 INFO L290 TraceCheckUtils]: 49: Hoare triple {13428#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {13428#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:16:48,440 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {13428#(not (= |__VERIFIER_assert_#in~cond| 0))} {13417#(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; {13435#(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-28 11:16:48,440 INFO L290 TraceCheckUtils]: 51: Hoare triple {13435#(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); {13439#(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-28 11:16:50,443 WARN L290 TraceCheckUtils]: 52: Hoare triple {13439#(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; {13443#(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-28 11:16:50,445 INFO L272 TraceCheckUtils]: 53: Hoare triple {13443#(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)); {13447#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 11:16:50,446 INFO L290 TraceCheckUtils]: 54: Hoare triple {13447#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {13451#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:16:50,446 INFO L290 TraceCheckUtils]: 55: Hoare triple {13451#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {13272#false} is VALID [2022-04-28 11:16:50,446 INFO L290 TraceCheckUtils]: 56: Hoare triple {13272#false} assume !false; {13272#false} is VALID [2022-04-28 11:16:50,446 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-28 11:16:50,446 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 11:17:09,622 INFO L290 TraceCheckUtils]: 56: Hoare triple {13272#false} assume !false; {13272#false} is VALID [2022-04-28 11:17:09,623 INFO L290 TraceCheckUtils]: 55: Hoare triple {13451#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {13272#false} is VALID [2022-04-28 11:17:09,623 INFO L290 TraceCheckUtils]: 54: Hoare triple {13447#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {13451#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:17:09,624 INFO L272 TraceCheckUtils]: 53: Hoare triple {13467#(= (+ (* 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)); {13447#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 11:17:09,625 INFO L290 TraceCheckUtils]: 52: Hoare triple {13471#(= (+ (* 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; {13467#(= (+ (* 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-28 11:17:09,626 INFO L290 TraceCheckUtils]: 51: Hoare triple {13475#(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); {13471#(= (+ (* 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-28 11:17:09,627 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {13428#(not (= |__VERIFIER_assert_#in~cond| 0))} {13479#(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; {13475#(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-28 11:17:09,627 INFO L290 TraceCheckUtils]: 49: Hoare triple {13428#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {13428#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:17:09,627 INFO L290 TraceCheckUtils]: 48: Hoare triple {13489#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {13428#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:17:09,628 INFO L290 TraceCheckUtils]: 47: Hoare triple {13271#true} ~cond := #in~cond; {13489#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 11:17:09,628 INFO L272 TraceCheckUtils]: 46: Hoare triple {13479#(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)); {13271#true} is VALID [2022-04-28 11:17:09,629 INFO L290 TraceCheckUtils]: 45: Hoare triple {13496#(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; {13479#(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-28 11:17:09,631 INFO L290 TraceCheckUtils]: 44: Hoare triple {13500#(forall ((v_main_~x~0_70 Int)) (or (forall ((main_~Y~0 Int)) (= (+ (* (* v_main_~x~0_70 main_~y~0) 2) (* main_~Y~0 2) (* 2 (* v_main_~x~0_70 main_~Y~0)) (* (* main_~X~0 main_~y~0) (- 2))) (+ (* main_~y~0 2) (* main_~Y~0 2) (* 2 (* v_main_~x~0_70 main_~Y~0))))) (not (<= v_main_~x~0_70 (+ main_~x~0 1))) (<= v_main_~x~0_70 main_~X~0)))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {13496#(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-28 11:17:09,633 INFO L290 TraceCheckUtils]: 43: Hoare triple {13504#(forall ((main_~Y~0 Int) (v_main_~x~0_70 Int)) (or (= (+ (* main_~Y~0 2) (* 2 (* v_main_~x~0_70 main_~Y~0)) (* (* v_main_~x~0_70 (+ main_~y~0 1)) 2) (* (* main_~X~0 (+ main_~y~0 1)) (- 2))) (+ 2 (* main_~y~0 2) (* main_~Y~0 2) (* 2 (* v_main_~x~0_70 main_~Y~0)))) (not (<= v_main_~x~0_70 (+ main_~x~0 1))) (<= v_main_~x~0_70 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; {13500#(forall ((v_main_~x~0_70 Int)) (or (forall ((main_~Y~0 Int)) (= (+ (* (* v_main_~x~0_70 main_~y~0) 2) (* main_~Y~0 2) (* 2 (* v_main_~x~0_70 main_~Y~0)) (* (* main_~X~0 main_~y~0) (- 2))) (+ (* main_~y~0 2) (* main_~Y~0 2) (* 2 (* v_main_~x~0_70 main_~Y~0))))) (not (<= v_main_~x~0_70 (+ main_~x~0 1))) (<= v_main_~x~0_70 main_~X~0)))} is VALID [2022-04-28 11:17:09,635 INFO L290 TraceCheckUtils]: 42: Hoare triple {13271#true} assume !!(~x~0 <= ~X~0); {13504#(forall ((main_~Y~0 Int) (v_main_~x~0_70 Int)) (or (= (+ (* main_~Y~0 2) (* 2 (* v_main_~x~0_70 main_~Y~0)) (* (* v_main_~x~0_70 (+ main_~y~0 1)) 2) (* (* main_~X~0 (+ main_~y~0 1)) (- 2))) (+ 2 (* main_~y~0 2) (* main_~Y~0 2) (* 2 (* v_main_~x~0_70 main_~Y~0)))) (not (<= v_main_~x~0_70 (+ main_~x~0 1))) (<= v_main_~x~0_70 main_~X~0)))} is VALID [2022-04-28 11:17:09,635 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {13271#true} {13271#true} #65#return; {13271#true} is VALID [2022-04-28 11:17:09,635 INFO L290 TraceCheckUtils]: 40: Hoare triple {13271#true} assume true; {13271#true} is VALID [2022-04-28 11:17:09,635 INFO L290 TraceCheckUtils]: 39: Hoare triple {13271#true} assume !(0 == ~cond); {13271#true} is VALID [2022-04-28 11:17:09,635 INFO L290 TraceCheckUtils]: 38: Hoare triple {13271#true} ~cond := #in~cond; {13271#true} is VALID [2022-04-28 11:17:09,635 INFO L272 TraceCheckUtils]: 37: Hoare triple {13271#true} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {13271#true} is VALID [2022-04-28 11:17:09,635 INFO L290 TraceCheckUtils]: 36: Hoare triple {13271#true} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {13271#true} is VALID [2022-04-28 11:17:09,636 INFO L290 TraceCheckUtils]: 35: Hoare triple {13271#true} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {13271#true} is VALID [2022-04-28 11:17:09,636 INFO L290 TraceCheckUtils]: 34: Hoare triple {13271#true} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {13271#true} is VALID [2022-04-28 11:17:09,636 INFO L290 TraceCheckUtils]: 33: Hoare triple {13271#true} assume !!(~x~0 <= ~X~0); {13271#true} is VALID [2022-04-28 11:17:09,636 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {13271#true} {13271#true} #65#return; {13271#true} is VALID [2022-04-28 11:17:09,636 INFO L290 TraceCheckUtils]: 31: Hoare triple {13271#true} assume true; {13271#true} is VALID [2022-04-28 11:17:09,636 INFO L290 TraceCheckUtils]: 30: Hoare triple {13271#true} assume !(0 == ~cond); {13271#true} is VALID [2022-04-28 11:17:09,636 INFO L290 TraceCheckUtils]: 29: Hoare triple {13271#true} ~cond := #in~cond; {13271#true} is VALID [2022-04-28 11:17:09,636 INFO L272 TraceCheckUtils]: 28: Hoare triple {13271#true} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {13271#true} is VALID [2022-04-28 11:17:09,636 INFO L290 TraceCheckUtils]: 27: Hoare triple {13271#true} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {13271#true} is VALID [2022-04-28 11:17:09,636 INFO L290 TraceCheckUtils]: 26: Hoare triple {13271#true} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {13271#true} is VALID [2022-04-28 11:17:09,636 INFO L290 TraceCheckUtils]: 25: Hoare triple {13271#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; {13271#true} is VALID [2022-04-28 11:17:09,636 INFO L290 TraceCheckUtils]: 24: Hoare triple {13271#true} assume !!(~x~0 <= ~X~0); {13271#true} is VALID [2022-04-28 11:17:09,636 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {13271#true} {13271#true} #65#return; {13271#true} is VALID [2022-04-28 11:17:09,637 INFO L290 TraceCheckUtils]: 22: Hoare triple {13271#true} assume true; {13271#true} is VALID [2022-04-28 11:17:09,637 INFO L290 TraceCheckUtils]: 21: Hoare triple {13271#true} assume !(0 == ~cond); {13271#true} is VALID [2022-04-28 11:17:09,637 INFO L290 TraceCheckUtils]: 20: Hoare triple {13271#true} ~cond := #in~cond; {13271#true} is VALID [2022-04-28 11:17:09,637 INFO L272 TraceCheckUtils]: 19: Hoare triple {13271#true} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {13271#true} is VALID [2022-04-28 11:17:09,637 INFO L290 TraceCheckUtils]: 18: Hoare triple {13271#true} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {13271#true} is VALID [2022-04-28 11:17:09,637 INFO L290 TraceCheckUtils]: 17: Hoare triple {13271#true} ~v~0 := 2 * ~Y~0 - ~X~0;~y~0 := 0;~x~0 := 0; {13271#true} is VALID [2022-04-28 11:17:09,637 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {13271#true} {13271#true} #63#return; {13271#true} is VALID [2022-04-28 11:17:09,637 INFO L290 TraceCheckUtils]: 15: Hoare triple {13271#true} assume true; {13271#true} is VALID [2022-04-28 11:17:09,637 INFO L290 TraceCheckUtils]: 14: Hoare triple {13271#true} assume !(0 == ~cond); {13271#true} is VALID [2022-04-28 11:17:09,637 INFO L290 TraceCheckUtils]: 13: Hoare triple {13271#true} ~cond := #in~cond; {13271#true} is VALID [2022-04-28 11:17:09,638 INFO L272 TraceCheckUtils]: 12: Hoare triple {13271#true} call assume_abort_if_not((if ~Y~0 >= 0 && ~Y~0 <= 5 then 1 else 0)); {13271#true} is VALID [2022-04-28 11:17:09,638 INFO L290 TraceCheckUtils]: 11: Hoare triple {13271#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~Y~0 := #t~nondet5;havoc #t~nondet5; {13271#true} is VALID [2022-04-28 11:17:09,638 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {13271#true} {13271#true} #61#return; {13271#true} is VALID [2022-04-28 11:17:09,638 INFO L290 TraceCheckUtils]: 9: Hoare triple {13271#true} assume true; {13271#true} is VALID [2022-04-28 11:17:09,638 INFO L290 TraceCheckUtils]: 8: Hoare triple {13271#true} assume !(0 == ~cond); {13271#true} is VALID [2022-04-28 11:17:09,638 INFO L290 TraceCheckUtils]: 7: Hoare triple {13271#true} ~cond := #in~cond; {13271#true} is VALID [2022-04-28 11:17:09,638 INFO L272 TraceCheckUtils]: 6: Hoare triple {13271#true} call assume_abort_if_not((if ~X~0 >= 0 && ~X~0 <= 5 then 1 else 0)); {13271#true} is VALID [2022-04-28 11:17:09,638 INFO L290 TraceCheckUtils]: 5: Hoare triple {13271#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; {13271#true} is VALID [2022-04-28 11:17:09,638 INFO L272 TraceCheckUtils]: 4: Hoare triple {13271#true} call #t~ret8 := main(); {13271#true} is VALID [2022-04-28 11:17:09,638 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13271#true} {13271#true} #69#return; {13271#true} is VALID [2022-04-28 11:17:09,639 INFO L290 TraceCheckUtils]: 2: Hoare triple {13271#true} assume true; {13271#true} is VALID [2022-04-28 11:17:09,639 INFO L290 TraceCheckUtils]: 1: Hoare triple {13271#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); {13271#true} is VALID [2022-04-28 11:17:09,639 INFO L272 TraceCheckUtils]: 0: Hoare triple {13271#true} call ULTIMATE.init(); {13271#true} is VALID [2022-04-28 11:17:09,639 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-28 11:17:09,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:17:09,639 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [56287581] [2022-04-28 11:17:09,639 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 11:17:09,639 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1817868449] [2022-04-28 11:17:09,640 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1817868449] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 11:17:09,640 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 11:17:09,640 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 13] total 24 [2022-04-28 11:17:09,640 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:17:09,640 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1581974429] [2022-04-28 11:17:09,640 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1581974429] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:17:09,640 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:17:09,640 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-04-28 11:17:09,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1423490125] [2022-04-28 11:17:09,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:17:09,641 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-28 11:17:09,641 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:17:09,641 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-28 11:17:11,687 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 43 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 11:17:11,687 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-28 11:17:11,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:17:11,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-28 11:17:11,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=471, Unknown=1, NotChecked=0, Total=552 [2022-04-28 11:17:11,688 INFO L87 Difference]: Start difference. First operand 101 states and 111 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-28 11:17:15,754 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-28 11:17:23,713 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-28 11:17:28,342 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-28 11:17:30,345 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-28 11:17:31,609 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.26s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-28 11:17:33,611 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-28 11:17:35,614 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-28 11:17:37,616 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-28 11:17:39,619 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-28 11:17:41,631 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-28 11:17:43,634 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-28 11:17:44,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:17:44,072 INFO L93 Difference]: Finished difference Result 126 states and 142 transitions. [2022-04-28 11:17:44,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-04-28 11:17:44,072 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-28 11:17:44,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:17:44,073 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-28 11:17:44,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 68 transitions. [2022-04-28 11:17:44,074 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-28 11:17:44,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 68 transitions. [2022-04-28 11:17:44,075 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 68 transitions. [2022-04-28 11:17:46,856 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 67 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 11:17:46,858 INFO L225 Difference]: With dead ends: 126 [2022-04-28 11:17:46,858 INFO L226 Difference]: Without dead ends: 118 [2022-04-28 11:17:46,859 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 90 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 161 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=151, Invalid=840, Unknown=1, NotChecked=0, Total=992 [2022-04-28 11:17:46,859 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 21 mSDsluCounter, 251 mSDsCounter, 0 mSdLazyCounter, 536 mSolverCounterSat, 8 mSolverCounterUnsat, 10 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 22.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 282 SdHoareTripleChecker+Invalid, 554 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 536 IncrementalHoareTripleChecker+Invalid, 10 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 22.8s IncrementalHoareTripleChecker+Time [2022-04-28 11:17:46,859 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 282 Invalid, 554 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 536 Invalid, 10 Unknown, 0 Unchecked, 22.8s Time] [2022-04-28 11:17:46,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2022-04-28 11:17:47,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 114. [2022-04-28 11:17:47,160 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:17:47,160 INFO L82 GeneralOperation]: Start isEquivalent. First operand 118 states. Second operand has 114 states, 84 states have (on average 1.119047619047619) internal successors, (94), 87 states have internal predecessors, (94), 19 states have call successors, (19), 11 states have call predecessors, (19), 10 states have return successors, (17), 15 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-28 11:17:47,160 INFO L74 IsIncluded]: Start isIncluded. First operand 118 states. Second operand has 114 states, 84 states have (on average 1.119047619047619) internal successors, (94), 87 states have internal predecessors, (94), 19 states have call successors, (19), 11 states have call predecessors, (19), 10 states have return successors, (17), 15 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-28 11:17:47,161 INFO L87 Difference]: Start difference. First operand 118 states. Second operand has 114 states, 84 states have (on average 1.119047619047619) internal successors, (94), 87 states have internal predecessors, (94), 19 states have call successors, (19), 11 states have call predecessors, (19), 10 states have return successors, (17), 15 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-28 11:17:47,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:17:47,163 INFO L93 Difference]: Finished difference Result 118 states and 134 transitions. [2022-04-28 11:17:47,163 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 134 transitions. [2022-04-28 11:17:47,164 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:17:47,164 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:17:47,164 INFO L74 IsIncluded]: Start isIncluded. First operand has 114 states, 84 states have (on average 1.119047619047619) internal successors, (94), 87 states have internal predecessors, (94), 19 states have call successors, (19), 11 states have call predecessors, (19), 10 states have return successors, (17), 15 states have call predecessors, (17), 17 states have call successors, (17) Second operand 118 states. [2022-04-28 11:17:47,164 INFO L87 Difference]: Start difference. First operand has 114 states, 84 states have (on average 1.119047619047619) internal successors, (94), 87 states have internal predecessors, (94), 19 states have call successors, (19), 11 states have call predecessors, (19), 10 states have return successors, (17), 15 states have call predecessors, (17), 17 states have call successors, (17) Second operand 118 states. [2022-04-28 11:17:47,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:17:47,166 INFO L93 Difference]: Finished difference Result 118 states and 134 transitions. [2022-04-28 11:17:47,166 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 134 transitions. [2022-04-28 11:17:47,167 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:17:47,167 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:17:47,167 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:17:47,167 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:17:47,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 84 states have (on average 1.119047619047619) internal successors, (94), 87 states have internal predecessors, (94), 19 states have call successors, (19), 11 states have call predecessors, (19), 10 states have return successors, (17), 15 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-28 11:17:47,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 130 transitions. [2022-04-28 11:17:47,169 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 130 transitions. Word has length 57 [2022-04-28 11:17:47,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:17:47,170 INFO L495 AbstractCegarLoop]: Abstraction has 114 states and 130 transitions. [2022-04-28 11:17:47,170 INFO L496 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-28 11:17:47,170 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 114 states and 130 transitions. [2022-04-28 11:17:49,546 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 130 edges. 129 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 11:17:49,546 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 130 transitions. [2022-04-28 11:17:49,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-04-28 11:17:49,548 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:17:49,548 INFO L195 NwaCegarLoop]: 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-28 11:17:49,573 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-04-28 11:17:49,770 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:17:49,771 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:17:49,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:17:49,771 INFO L85 PathProgramCache]: Analyzing trace with hash -680465044, now seen corresponding path program 5 times [2022-04-28 11:17:49,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:17:49,771 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2057070414] [2022-04-28 11:17:49,771 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 11:17:49,772 INFO L85 PathProgramCache]: Analyzing trace with hash -680465044, now seen corresponding path program 6 times [2022-04-28 11:17:49,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:17:49,772 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1954391214] [2022-04-28 11:17:49,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:17:49,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:17:49,785 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 11:17:49,785 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1427073880] [2022-04-28 11:17:49,785 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 11:17:49,785 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:17:49,785 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:17:49,787 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 11:17:49,787 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-04-28 11:17:49,906 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-04-28 11:17:49,906 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 11:17:49,907 INFO L263 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 33 conjunts are in the unsatisfiable core [2022-04-28 11:17:49,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:17:49,927 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 11:18:09,028 WARN L828 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-28 11:18:15,648 WARN L828 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-28 11:18:21,673 WARN L828 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-28 11:18:45,206 INFO L272 TraceCheckUtils]: 0: Hoare triple {14368#true} call ULTIMATE.init(); {14368#true} is VALID [2022-04-28 11:18:45,206 INFO L290 TraceCheckUtils]: 1: Hoare triple {14368#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); {14368#true} is VALID [2022-04-28 11:18:45,207 INFO L290 TraceCheckUtils]: 2: Hoare triple {14368#true} assume true; {14368#true} is VALID [2022-04-28 11:18:45,207 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14368#true} {14368#true} #69#return; {14368#true} is VALID [2022-04-28 11:18:45,207 INFO L272 TraceCheckUtils]: 4: Hoare triple {14368#true} call #t~ret8 := main(); {14368#true} is VALID [2022-04-28 11:18:45,207 INFO L290 TraceCheckUtils]: 5: Hoare triple {14368#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; {14368#true} is VALID [2022-04-28 11:18:45,207 INFO L272 TraceCheckUtils]: 6: Hoare triple {14368#true} call assume_abort_if_not((if ~X~0 >= 0 && ~X~0 <= 5 then 1 else 0)); {14368#true} is VALID [2022-04-28 11:18:45,207 INFO L290 TraceCheckUtils]: 7: Hoare triple {14368#true} ~cond := #in~cond; {14394#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-28 11:18:45,207 INFO L290 TraceCheckUtils]: 8: Hoare triple {14394#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {14398#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 11:18:45,208 INFO L290 TraceCheckUtils]: 9: Hoare triple {14398#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {14398#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 11:18:45,208 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {14398#(not (= |assume_abort_if_not_#in~cond| 0))} {14368#true} #61#return; {14405#(and (<= 0 main_~X~0) (<= main_~X~0 5))} is VALID [2022-04-28 11:18:45,209 INFO L290 TraceCheckUtils]: 11: Hoare triple {14405#(and (<= 0 main_~X~0) (<= main_~X~0 5))} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~Y~0 := #t~nondet5;havoc #t~nondet5; {14405#(and (<= 0 main_~X~0) (<= main_~X~0 5))} is VALID [2022-04-28 11:18:45,209 INFO L272 TraceCheckUtils]: 12: Hoare triple {14405#(and (<= 0 main_~X~0) (<= main_~X~0 5))} call assume_abort_if_not((if ~Y~0 >= 0 && ~Y~0 <= 5 then 1 else 0)); {14368#true} is VALID [2022-04-28 11:18:45,209 INFO L290 TraceCheckUtils]: 13: Hoare triple {14368#true} ~cond := #in~cond; {14394#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-28 11:18:45,209 INFO L290 TraceCheckUtils]: 14: Hoare triple {14394#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {14398#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 11:18:45,210 INFO L290 TraceCheckUtils]: 15: Hoare triple {14398#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {14398#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 11:18:45,210 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {14398#(not (= |assume_abort_if_not_#in~cond| 0))} {14405#(and (<= 0 main_~X~0) (<= main_~X~0 5))} #63#return; {14424#(and (<= 0 main_~Y~0) (<= 0 main_~X~0) (<= main_~X~0 5) (<= main_~Y~0 5))} is VALID [2022-04-28 11:18:45,211 INFO L290 TraceCheckUtils]: 17: Hoare triple {14424#(and (<= 0 main_~Y~0) (<= 0 main_~X~0) (<= main_~X~0 5) (<= main_~Y~0 5))} ~v~0 := 2 * ~Y~0 - ~X~0;~y~0 := 0;~x~0 := 0; {14428#(and (<= 0 main_~x~0) (<= 0 main_~Y~0) (<= 0 main_~X~0) (<= main_~X~0 5) (<= main_~Y~0 5))} is VALID [2022-04-28 11:18:45,211 INFO L290 TraceCheckUtils]: 18: Hoare triple {14428#(and (<= 0 main_~x~0) (<= 0 main_~Y~0) (<= 0 main_~X~0) (<= main_~X~0 5) (<= main_~Y~0 5))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {14428#(and (<= 0 main_~x~0) (<= 0 main_~Y~0) (<= 0 main_~X~0) (<= main_~X~0 5) (<= main_~Y~0 5))} is VALID [2022-04-28 11:18:45,211 INFO L272 TraceCheckUtils]: 19: Hoare triple {14428#(and (<= 0 main_~x~0) (<= 0 main_~Y~0) (<= 0 main_~X~0) (<= main_~X~0 5) (<= main_~Y~0 5))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {14368#true} is VALID [2022-04-28 11:18:45,211 INFO L290 TraceCheckUtils]: 20: Hoare triple {14368#true} ~cond := #in~cond; {14368#true} is VALID [2022-04-28 11:18:45,211 INFO L290 TraceCheckUtils]: 21: Hoare triple {14368#true} assume !(0 == ~cond); {14368#true} is VALID [2022-04-28 11:18:45,211 INFO L290 TraceCheckUtils]: 22: Hoare triple {14368#true} assume true; {14368#true} is VALID [2022-04-28 11:18:45,212 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {14368#true} {14428#(and (<= 0 main_~x~0) (<= 0 main_~Y~0) (<= 0 main_~X~0) (<= main_~X~0 5) (<= main_~Y~0 5))} #65#return; {14428#(and (<= 0 main_~x~0) (<= 0 main_~Y~0) (<= 0 main_~X~0) (<= main_~X~0 5) (<= main_~Y~0 5))} is VALID [2022-04-28 11:18:45,212 INFO L290 TraceCheckUtils]: 24: Hoare triple {14428#(and (<= 0 main_~x~0) (<= 0 main_~Y~0) (<= 0 main_~X~0) (<= main_~X~0 5) (<= main_~Y~0 5))} assume !!(~x~0 <= ~X~0); {14424#(and (<= 0 main_~Y~0) (<= 0 main_~X~0) (<= main_~X~0 5) (<= main_~Y~0 5))} is VALID [2022-04-28 11:18:45,213 INFO L290 TraceCheckUtils]: 25: Hoare triple {14424#(and (<= 0 main_~Y~0) (<= 0 main_~X~0) (<= main_~X~0 5) (<= main_~Y~0 5))} 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; {14424#(and (<= 0 main_~Y~0) (<= 0 main_~X~0) (<= main_~X~0 5) (<= main_~Y~0 5))} is VALID [2022-04-28 11:18:45,213 INFO L290 TraceCheckUtils]: 26: Hoare triple {14424#(and (<= 0 main_~Y~0) (<= 0 main_~X~0) (<= main_~X~0 5) (<= main_~Y~0 5))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {14424#(and (<= 0 main_~Y~0) (<= 0 main_~X~0) (<= main_~X~0 5) (<= main_~Y~0 5))} is VALID [2022-04-28 11:18:45,213 INFO L290 TraceCheckUtils]: 27: Hoare triple {14424#(and (<= 0 main_~Y~0) (<= 0 main_~X~0) (<= main_~X~0 5) (<= main_~Y~0 5))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {14424#(and (<= 0 main_~Y~0) (<= 0 main_~X~0) (<= main_~X~0 5) (<= main_~Y~0 5))} is VALID [2022-04-28 11:18:45,213 INFO L272 TraceCheckUtils]: 28: Hoare triple {14424#(and (<= 0 main_~Y~0) (<= 0 main_~X~0) (<= main_~X~0 5) (<= main_~Y~0 5))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {14368#true} is VALID [2022-04-28 11:18:45,213 INFO L290 TraceCheckUtils]: 29: Hoare triple {14368#true} ~cond := #in~cond; {14368#true} is VALID [2022-04-28 11:18:45,214 INFO L290 TraceCheckUtils]: 30: Hoare triple {14368#true} assume !(0 == ~cond); {14368#true} is VALID [2022-04-28 11:18:45,214 INFO L290 TraceCheckUtils]: 31: Hoare triple {14368#true} assume true; {14368#true} is VALID [2022-04-28 11:18:45,214 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {14368#true} {14424#(and (<= 0 main_~Y~0) (<= 0 main_~X~0) (<= main_~X~0 5) (<= main_~Y~0 5))} #65#return; {14424#(and (<= 0 main_~Y~0) (<= 0 main_~X~0) (<= main_~X~0 5) (<= main_~Y~0 5))} is VALID [2022-04-28 11:18:45,214 INFO L290 TraceCheckUtils]: 33: Hoare triple {14424#(and (<= 0 main_~Y~0) (<= 0 main_~X~0) (<= main_~X~0 5) (<= main_~Y~0 5))} assume !!(~x~0 <= ~X~0); {14424#(and (<= 0 main_~Y~0) (<= 0 main_~X~0) (<= main_~X~0 5) (<= main_~Y~0 5))} is VALID [2022-04-28 11:18:45,215 INFO L290 TraceCheckUtils]: 34: Hoare triple {14424#(and (<= 0 main_~Y~0) (<= 0 main_~X~0) (<= main_~X~0 5) (<= main_~Y~0 5))} 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; {14424#(and (<= 0 main_~Y~0) (<= 0 main_~X~0) (<= main_~X~0 5) (<= main_~Y~0 5))} is VALID [2022-04-28 11:18:45,215 INFO L290 TraceCheckUtils]: 35: Hoare triple {14424#(and (<= 0 main_~Y~0) (<= 0 main_~X~0) (<= main_~X~0 5) (<= main_~Y~0 5))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {14424#(and (<= 0 main_~Y~0) (<= 0 main_~X~0) (<= main_~X~0 5) (<= main_~Y~0 5))} is VALID [2022-04-28 11:18:45,216 INFO L290 TraceCheckUtils]: 36: Hoare triple {14424#(and (<= 0 main_~Y~0) (<= 0 main_~X~0) (<= main_~X~0 5) (<= main_~Y~0 5))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {14424#(and (<= 0 main_~Y~0) (<= 0 main_~X~0) (<= main_~X~0 5) (<= main_~Y~0 5))} is VALID [2022-04-28 11:18:45,216 INFO L272 TraceCheckUtils]: 37: Hoare triple {14424#(and (<= 0 main_~Y~0) (<= 0 main_~X~0) (<= main_~X~0 5) (<= main_~Y~0 5))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {14368#true} is VALID [2022-04-28 11:18:45,216 INFO L290 TraceCheckUtils]: 38: Hoare triple {14368#true} ~cond := #in~cond; {14368#true} is VALID [2022-04-28 11:18:45,216 INFO L290 TraceCheckUtils]: 39: Hoare triple {14368#true} assume !(0 == ~cond); {14368#true} is VALID [2022-04-28 11:18:45,216 INFO L290 TraceCheckUtils]: 40: Hoare triple {14368#true} assume true; {14368#true} is VALID [2022-04-28 11:18:45,216 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {14368#true} {14424#(and (<= 0 main_~Y~0) (<= 0 main_~X~0) (<= main_~X~0 5) (<= main_~Y~0 5))} #65#return; {14424#(and (<= 0 main_~Y~0) (<= 0 main_~X~0) (<= main_~X~0 5) (<= main_~Y~0 5))} is VALID [2022-04-28 11:18:45,217 INFO L290 TraceCheckUtils]: 42: Hoare triple {14424#(and (<= 0 main_~Y~0) (<= 0 main_~X~0) (<= main_~X~0 5) (<= main_~Y~0 5))} assume !!(~x~0 <= ~X~0); {14504#(and (<= main_~x~0 main_~X~0) (<= 0 main_~Y~0) (<= 0 main_~X~0) (<= main_~X~0 5) (<= main_~Y~0 5))} is VALID [2022-04-28 11:18:45,218 INFO L290 TraceCheckUtils]: 43: Hoare triple {14504#(and (<= main_~x~0 main_~X~0) (<= 0 main_~Y~0) (<= 0 main_~X~0) (<= main_~X~0 5) (<= main_~Y~0 5))} 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; {14508#(and (<= main_~x~0 main_~X~0) (<= 0 main_~Y~0) (<= 0 main_~X~0) (<= (* main_~Y~0 2) (+ main_~v~0 (* main_~X~0 2))) (<= main_~X~0 5) (<= main_~Y~0 5))} is VALID [2022-04-28 11:18:45,220 INFO L290 TraceCheckUtils]: 44: Hoare triple {14508#(and (<= main_~x~0 main_~X~0) (<= 0 main_~Y~0) (<= 0 main_~X~0) (<= (* main_~Y~0 2) (+ main_~v~0 (* main_~X~0 2))) (<= main_~X~0 5) (<= main_~Y~0 5))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {14512#(and (<= 0 main_~Y~0) (<= 0 main_~X~0) (<= (* main_~Y~0 2) (+ main_~v~0 (* main_~X~0 2))) (<= main_~X~0 5) (<= main_~x~0 (+ main_~X~0 1)) (<= main_~Y~0 5))} is VALID [2022-04-28 11:18:45,220 INFO L290 TraceCheckUtils]: 45: Hoare triple {14512#(and (<= 0 main_~Y~0) (<= 0 main_~X~0) (<= (* main_~Y~0 2) (+ main_~v~0 (* main_~X~0 2))) (<= main_~X~0 5) (<= main_~x~0 (+ main_~X~0 1)) (<= main_~Y~0 5))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {14516#(and (<= 0 main_~Y~0) (<= 0 main_~X~0) (<= (* main_~Y~0 2) (+ main_~v~0 (* main_~X~0 2))) (<= 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)) (<= main_~Y~0 5))} is VALID [2022-04-28 11:18:45,220 INFO L272 TraceCheckUtils]: 46: Hoare triple {14516#(and (<= 0 main_~Y~0) (<= 0 main_~X~0) (<= (* main_~Y~0 2) (+ main_~v~0 (* main_~X~0 2))) (<= 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)) (<= main_~Y~0 5))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {14368#true} is VALID [2022-04-28 11:18:45,220 INFO L290 TraceCheckUtils]: 47: Hoare triple {14368#true} ~cond := #in~cond; {14523#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:18:45,221 INFO L290 TraceCheckUtils]: 48: Hoare triple {14523#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {14527#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:18:45,221 INFO L290 TraceCheckUtils]: 49: Hoare triple {14527#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {14527#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:18:45,223 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {14527#(not (= |__VERIFIER_assert_#in~cond| 0))} {14516#(and (<= 0 main_~Y~0) (<= 0 main_~X~0) (<= (* main_~Y~0 2) (+ main_~v~0 (* main_~X~0 2))) (<= 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)) (<= main_~Y~0 5))} #65#return; {14534#(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)) (<= 0 main_~Y~0) (<= 0 main_~X~0) (<= (* main_~Y~0 2) (+ main_~v~0 (* main_~X~0 2))) (<= main_~X~0 5) (<= main_~x~0 (+ main_~X~0 1)) (<= main_~Y~0 5))} is VALID [2022-04-28 11:18:45,223 INFO L290 TraceCheckUtils]: 51: Hoare triple {14534#(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)) (<= 0 main_~Y~0) (<= 0 main_~X~0) (<= (* main_~Y~0 2) (+ main_~v~0 (* main_~X~0 2))) (<= main_~X~0 5) (<= main_~x~0 (+ main_~X~0 1)) (<= main_~Y~0 5))} assume !(~x~0 <= ~X~0); {14538#(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)) (<= 0 main_~Y~0) (<= 0 main_~X~0) (<= (* main_~Y~0 2) (+ main_~v~0 (* main_~X~0 2))) (<= main_~X~0 5) (not (<= main_~x~0 main_~X~0)) (<= main_~x~0 (+ main_~X~0 1)) (<= main_~Y~0 5))} is VALID [2022-04-28 11:18:45,251 INFO L290 TraceCheckUtils]: 52: Hoare triple {14538#(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)) (<= 0 main_~Y~0) (<= 0 main_~X~0) (<= (* main_~Y~0 2) (+ main_~v~0 (* main_~X~0 2))) (<= main_~X~0 5) (not (<= main_~x~0 main_~X~0)) (<= main_~x~0 (+ main_~X~0 1)) (<= main_~Y~0 5))} ~xy~0 := ~x~0 * ~y~0;~yx~0 := ~Y~0 * ~x~0; {14542#(and (<= 0 main_~Y~0) (<= 0 main_~X~0) (<= (* main_~Y~0 2) (+ main_~v~0 (* main_~X~0 2))) (<= main_~X~0 5) (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))))) (<= main_~Y~0 5))} is VALID [2022-04-28 11:18:45,272 INFO L272 TraceCheckUtils]: 53: Hoare triple {14542#(and (<= 0 main_~Y~0) (<= 0 main_~X~0) (<= (* main_~Y~0 2) (+ main_~v~0 (* main_~X~0 2))) (<= main_~X~0 5) (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))))) (<= main_~Y~0 5))} 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)); {14546#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 11:18:45,273 INFO L290 TraceCheckUtils]: 54: Hoare triple {14546#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {14550#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:18:45,273 INFO L290 TraceCheckUtils]: 55: Hoare triple {14550#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {14369#false} is VALID [2022-04-28 11:18:45,273 INFO L290 TraceCheckUtils]: 56: Hoare triple {14369#false} assume !false; {14369#false} is VALID [2022-04-28 11:18:45,273 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 26 proven. 10 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-28 11:18:45,273 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 11:18:53,039 WARN L828 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-28 11:19:01,993 WARN L828 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-28 11:19:58,082 INFO L290 TraceCheckUtils]: 56: Hoare triple {14369#false} assume !false; {14369#false} is VALID [2022-04-28 11:19:58,083 INFO L290 TraceCheckUtils]: 55: Hoare triple {14550#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {14369#false} is VALID [2022-04-28 11:19:58,083 INFO L290 TraceCheckUtils]: 54: Hoare triple {14546#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {14550#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:19:58,084 INFO L272 TraceCheckUtils]: 53: Hoare triple {14566#(= (+ (* 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)); {14546#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 11:19:58,086 INFO L290 TraceCheckUtils]: 52: Hoare triple {14570#(= (+ (* 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; {14566#(= (+ (* 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-28 11:19:58,086 INFO L290 TraceCheckUtils]: 51: Hoare triple {14574#(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); {14570#(= (+ (* 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-28 11:19:58,087 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {14527#(not (= |__VERIFIER_assert_#in~cond| 0))} {14578#(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; {14574#(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-28 11:19:58,088 INFO L290 TraceCheckUtils]: 49: Hoare triple {14527#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {14527#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:19:58,088 INFO L290 TraceCheckUtils]: 48: Hoare triple {14588#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {14527#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:19:58,089 INFO L290 TraceCheckUtils]: 47: Hoare triple {14368#true} ~cond := #in~cond; {14588#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 11:19:58,089 INFO L272 TraceCheckUtils]: 46: Hoare triple {14578#(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)); {14368#true} is VALID [2022-04-28 11:20:00,092 WARN L290 TraceCheckUtils]: 45: Hoare triple {14595#(or (<= main_~x~0 main_~X~0) (and (or (= (+ main_~X~0 main_~v~0 (* (* (div (+ (div (+ main_~X~0 main_~v~0) (- 2)) main_~Y~0 (* main_~Y~0 main_~x~0)) main_~X~0) main_~x~0) 2)) (+ (* main_~Y~0 2) (* (div (+ (div (+ main_~X~0 main_~v~0) (- 2)) main_~Y~0 (* main_~Y~0 main_~x~0)) main_~X~0) 2) (* 2 (* main_~Y~0 main_~x~0)))) (not (= (mod (+ (div (+ main_~X~0 main_~v~0) (- 2)) main_~Y~0 (* main_~Y~0 main_~x~0)) main_~X~0) 0)) (= main_~X~0 0) (not (= (mod (+ main_~X~0 main_~v~0 (* (- 2) main_~Y~0 main_~x~0)) 2) 0))) (or (forall ((main_~y~0 Int)) (= (+ (* 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))))) (not (= main_~X~0 0)) (not (= (+ (div (+ main_~X~0 main_~v~0) (- 2)) main_~Y~0 (* main_~Y~0 main_~x~0)) 0)) (not (= (mod (+ main_~X~0 main_~v~0 (* (- 2) main_~Y~0 main_~x~0)) 2) 0)))))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {14578#(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 UNKNOWN [2022-04-28 11:20:00,101 INFO L290 TraceCheckUtils]: 44: Hoare triple {14599#(forall ((v_main_~x~0_72 Int)) (or (<= v_main_~x~0_72 main_~X~0) (and (or (not (= (mod (+ main_~X~0 main_~v~0 (* v_main_~x~0_72 (- 2) main_~Y~0)) 2) 0)) (not (= (+ (div (+ main_~X~0 main_~v~0) (- 2)) main_~Y~0 (* v_main_~x~0_72 main_~Y~0)) 0)) (not (= main_~X~0 0)) (forall ((main_~y~0 Int)) (= (+ main_~X~0 main_~v~0 (* 2 (* v_main_~x~0_72 main_~y~0))) (+ (* 2 (* v_main_~x~0_72 main_~Y~0)) (* main_~y~0 2) (* main_~Y~0 2))))) (or (not (= (mod (+ main_~X~0 main_~v~0 (* v_main_~x~0_72 (- 2) main_~Y~0)) 2) 0)) (= main_~X~0 0) (not (= (mod (+ (div (+ main_~X~0 main_~v~0) (- 2)) main_~Y~0 (* v_main_~x~0_72 main_~Y~0)) main_~X~0) 0)) (= (+ (* (div (+ (div (+ main_~X~0 main_~v~0) (- 2)) main_~Y~0 (* v_main_~x~0_72 main_~Y~0)) main_~X~0) 2) (* 2 (* v_main_~x~0_72 main_~Y~0)) (* main_~Y~0 2)) (+ main_~X~0 main_~v~0 (* (* (div (+ (div (+ main_~X~0 main_~v~0) (- 2)) main_~Y~0 (* v_main_~x~0_72 main_~Y~0)) main_~X~0) v_main_~x~0_72) 2))))) (not (<= v_main_~x~0_72 (+ main_~x~0 1)))))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {14595#(or (<= main_~x~0 main_~X~0) (and (or (= (+ main_~X~0 main_~v~0 (* (* (div (+ (div (+ main_~X~0 main_~v~0) (- 2)) main_~Y~0 (* main_~Y~0 main_~x~0)) main_~X~0) main_~x~0) 2)) (+ (* main_~Y~0 2) (* (div (+ (div (+ main_~X~0 main_~v~0) (- 2)) main_~Y~0 (* main_~Y~0 main_~x~0)) main_~X~0) 2) (* 2 (* main_~Y~0 main_~x~0)))) (not (= (mod (+ (div (+ main_~X~0 main_~v~0) (- 2)) main_~Y~0 (* main_~Y~0 main_~x~0)) main_~X~0) 0)) (= main_~X~0 0) (not (= (mod (+ main_~X~0 main_~v~0 (* (- 2) main_~Y~0 main_~x~0)) 2) 0))) (or (forall ((main_~y~0 Int)) (= (+ (* 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))))) (not (= main_~X~0 0)) (not (= (+ (div (+ main_~X~0 main_~v~0) (- 2)) main_~Y~0 (* main_~Y~0 main_~x~0)) 0)) (not (= (mod (+ main_~X~0 main_~v~0 (* (- 2) main_~Y~0 main_~x~0)) 2) 0)))))} is VALID [2022-04-28 11:20:00,227 INFO L290 TraceCheckUtils]: 43: Hoare triple {14603#(forall ((v_main_~x~0_72 Int)) (or (<= v_main_~x~0_72 main_~X~0) (not (<= v_main_~x~0_72 (+ main_~x~0 1))) (and (or (not (= main_~X~0 0)) (forall ((main_~y~0 Int)) (= (+ (* main_~Y~0 2) (* 2 (* v_main_~x~0_72 main_~y~0))) (+ (* main_~y~0 2) (* main_~Y~0 2)))) (< (+ (* 2 (* v_main_~x~0_72 main_~Y~0)) main_~X~0) 0)) (or (= main_~X~0 0) (forall ((aux_div_aux_mod_v_main_~v~0_110_41_79 Int) (aux_div_v_main_~v~0_110_41 Int)) (or (and (or (<= (+ aux_div_aux_mod_v_main_~v~0_110_41_79 1) aux_div_v_main_~v~0_110_41) (<= (* v_main_~x~0_72 (div (+ aux_div_aux_mod_v_main_~v~0_110_41_79 main_~Y~0 (* v_main_~x~0_72 main_~Y~0)) main_~X~0)) (+ main_~Y~0 (* v_main_~x~0_72 main_~Y~0) (div (+ aux_div_aux_mod_v_main_~v~0_110_41_79 main_~Y~0 (* v_main_~x~0_72 main_~Y~0)) main_~X~0) aux_div_v_main_~v~0_110_41)) (<= (+ 1 aux_div_v_main_~v~0_110_41) aux_div_aux_mod_v_main_~v~0_110_41_79) (<= 0 (+ aux_div_aux_mod_v_main_~v~0_110_41_79 (div (+ (- 1) (* (- 1) main_~X~0)) 2) main_~Y~0))) (or (<= (+ aux_div_aux_mod_v_main_~v~0_110_41_79 1) aux_div_v_main_~v~0_110_41) (<= (+ 1 aux_div_v_main_~v~0_110_41) aux_div_aux_mod_v_main_~v~0_110_41_79) (<= 0 (+ aux_div_aux_mod_v_main_~v~0_110_41_79 (div (+ (- 1) (* (- 1) main_~X~0)) 2) main_~Y~0)) (<= (+ aux_div_aux_mod_v_main_~v~0_110_41_79 main_~Y~0 (* v_main_~x~0_72 main_~Y~0) (div (+ aux_div_aux_mod_v_main_~v~0_110_41_79 main_~Y~0 (* v_main_~x~0_72 main_~Y~0)) main_~X~0)) (* v_main_~x~0_72 (div (+ aux_div_aux_mod_v_main_~v~0_110_41_79 main_~Y~0 (* v_main_~x~0_72 main_~Y~0)) main_~X~0))))) (not (= (mod (+ main_~Y~0 (* v_main_~x~0_72 main_~Y~0) aux_div_v_main_~v~0_110_41) main_~X~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; {14599#(forall ((v_main_~x~0_72 Int)) (or (<= v_main_~x~0_72 main_~X~0) (and (or (not (= (mod (+ main_~X~0 main_~v~0 (* v_main_~x~0_72 (- 2) main_~Y~0)) 2) 0)) (not (= (+ (div (+ main_~X~0 main_~v~0) (- 2)) main_~Y~0 (* v_main_~x~0_72 main_~Y~0)) 0)) (not (= main_~X~0 0)) (forall ((main_~y~0 Int)) (= (+ main_~X~0 main_~v~0 (* 2 (* v_main_~x~0_72 main_~y~0))) (+ (* 2 (* v_main_~x~0_72 main_~Y~0)) (* main_~y~0 2) (* main_~Y~0 2))))) (or (not (= (mod (+ main_~X~0 main_~v~0 (* v_main_~x~0_72 (- 2) main_~Y~0)) 2) 0)) (= main_~X~0 0) (not (= (mod (+ (div (+ main_~X~0 main_~v~0) (- 2)) main_~Y~0 (* v_main_~x~0_72 main_~Y~0)) main_~X~0) 0)) (= (+ (* (div (+ (div (+ main_~X~0 main_~v~0) (- 2)) main_~Y~0 (* v_main_~x~0_72 main_~Y~0)) main_~X~0) 2) (* 2 (* v_main_~x~0_72 main_~Y~0)) (* main_~Y~0 2)) (+ main_~X~0 main_~v~0 (* (* (div (+ (div (+ main_~X~0 main_~v~0) (- 2)) main_~Y~0 (* v_main_~x~0_72 main_~Y~0)) main_~X~0) v_main_~x~0_72) 2))))) (not (<= v_main_~x~0_72 (+ main_~x~0 1)))))} is VALID [2022-04-28 11:20:00,373 INFO L290 TraceCheckUtils]: 42: Hoare triple {14368#true} assume !!(~x~0 <= ~X~0); {14603#(forall ((v_main_~x~0_72 Int)) (or (<= v_main_~x~0_72 main_~X~0) (not (<= v_main_~x~0_72 (+ main_~x~0 1))) (and (or (not (= main_~X~0 0)) (forall ((main_~y~0 Int)) (= (+ (* main_~Y~0 2) (* 2 (* v_main_~x~0_72 main_~y~0))) (+ (* main_~y~0 2) (* main_~Y~0 2)))) (< (+ (* 2 (* v_main_~x~0_72 main_~Y~0)) main_~X~0) 0)) (or (= main_~X~0 0) (forall ((aux_div_aux_mod_v_main_~v~0_110_41_79 Int) (aux_div_v_main_~v~0_110_41 Int)) (or (and (or (<= (+ aux_div_aux_mod_v_main_~v~0_110_41_79 1) aux_div_v_main_~v~0_110_41) (<= (* v_main_~x~0_72 (div (+ aux_div_aux_mod_v_main_~v~0_110_41_79 main_~Y~0 (* v_main_~x~0_72 main_~Y~0)) main_~X~0)) (+ main_~Y~0 (* v_main_~x~0_72 main_~Y~0) (div (+ aux_div_aux_mod_v_main_~v~0_110_41_79 main_~Y~0 (* v_main_~x~0_72 main_~Y~0)) main_~X~0) aux_div_v_main_~v~0_110_41)) (<= (+ 1 aux_div_v_main_~v~0_110_41) aux_div_aux_mod_v_main_~v~0_110_41_79) (<= 0 (+ aux_div_aux_mod_v_main_~v~0_110_41_79 (div (+ (- 1) (* (- 1) main_~X~0)) 2) main_~Y~0))) (or (<= (+ aux_div_aux_mod_v_main_~v~0_110_41_79 1) aux_div_v_main_~v~0_110_41) (<= (+ 1 aux_div_v_main_~v~0_110_41) aux_div_aux_mod_v_main_~v~0_110_41_79) (<= 0 (+ aux_div_aux_mod_v_main_~v~0_110_41_79 (div (+ (- 1) (* (- 1) main_~X~0)) 2) main_~Y~0)) (<= (+ aux_div_aux_mod_v_main_~v~0_110_41_79 main_~Y~0 (* v_main_~x~0_72 main_~Y~0) (div (+ aux_div_aux_mod_v_main_~v~0_110_41_79 main_~Y~0 (* v_main_~x~0_72 main_~Y~0)) main_~X~0)) (* v_main_~x~0_72 (div (+ aux_div_aux_mod_v_main_~v~0_110_41_79 main_~Y~0 (* v_main_~x~0_72 main_~Y~0)) main_~X~0))))) (not (= (mod (+ main_~Y~0 (* v_main_~x~0_72 main_~Y~0) aux_div_v_main_~v~0_110_41) main_~X~0) 0))))))))} is VALID [2022-04-28 11:20:00,374 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {14368#true} {14368#true} #65#return; {14368#true} is VALID [2022-04-28 11:20:00,374 INFO L290 TraceCheckUtils]: 40: Hoare triple {14368#true} assume true; {14368#true} is VALID [2022-04-28 11:20:00,374 INFO L290 TraceCheckUtils]: 39: Hoare triple {14368#true} assume !(0 == ~cond); {14368#true} is VALID [2022-04-28 11:20:00,374 INFO L290 TraceCheckUtils]: 38: Hoare triple {14368#true} ~cond := #in~cond; {14368#true} is VALID [2022-04-28 11:20:00,374 INFO L272 TraceCheckUtils]: 37: Hoare triple {14368#true} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {14368#true} is VALID [2022-04-28 11:20:00,374 INFO L290 TraceCheckUtils]: 36: Hoare triple {14368#true} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {14368#true} is VALID [2022-04-28 11:20:00,374 INFO L290 TraceCheckUtils]: 35: Hoare triple {14368#true} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {14368#true} is VALID [2022-04-28 11:20:00,374 INFO L290 TraceCheckUtils]: 34: Hoare triple {14368#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; {14368#true} is VALID [2022-04-28 11:20:00,374 INFO L290 TraceCheckUtils]: 33: Hoare triple {14368#true} assume !!(~x~0 <= ~X~0); {14368#true} is VALID [2022-04-28 11:20:00,374 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {14368#true} {14368#true} #65#return; {14368#true} is VALID [2022-04-28 11:20:00,374 INFO L290 TraceCheckUtils]: 31: Hoare triple {14368#true} assume true; {14368#true} is VALID [2022-04-28 11:20:00,374 INFO L290 TraceCheckUtils]: 30: Hoare triple {14368#true} assume !(0 == ~cond); {14368#true} is VALID [2022-04-28 11:20:00,375 INFO L290 TraceCheckUtils]: 29: Hoare triple {14368#true} ~cond := #in~cond; {14368#true} is VALID [2022-04-28 11:20:00,375 INFO L272 TraceCheckUtils]: 28: Hoare triple {14368#true} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {14368#true} is VALID [2022-04-28 11:20:00,375 INFO L290 TraceCheckUtils]: 27: Hoare triple {14368#true} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {14368#true} is VALID [2022-04-28 11:20:00,375 INFO L290 TraceCheckUtils]: 26: Hoare triple {14368#true} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {14368#true} is VALID [2022-04-28 11:20:00,375 INFO L290 TraceCheckUtils]: 25: Hoare triple {14368#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; {14368#true} is VALID [2022-04-28 11:20:00,375 INFO L290 TraceCheckUtils]: 24: Hoare triple {14368#true} assume !!(~x~0 <= ~X~0); {14368#true} is VALID [2022-04-28 11:20:00,375 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {14368#true} {14368#true} #65#return; {14368#true} is VALID [2022-04-28 11:20:00,375 INFO L290 TraceCheckUtils]: 22: Hoare triple {14368#true} assume true; {14368#true} is VALID [2022-04-28 11:20:00,375 INFO L290 TraceCheckUtils]: 21: Hoare triple {14368#true} assume !(0 == ~cond); {14368#true} is VALID [2022-04-28 11:20:00,375 INFO L290 TraceCheckUtils]: 20: Hoare triple {14368#true} ~cond := #in~cond; {14368#true} is VALID [2022-04-28 11:20:00,375 INFO L272 TraceCheckUtils]: 19: Hoare triple {14368#true} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {14368#true} is VALID [2022-04-28 11:20:00,375 INFO L290 TraceCheckUtils]: 18: Hoare triple {14368#true} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {14368#true} is VALID [2022-04-28 11:20:00,375 INFO L290 TraceCheckUtils]: 17: Hoare triple {14368#true} ~v~0 := 2 * ~Y~0 - ~X~0;~y~0 := 0;~x~0 := 0; {14368#true} is VALID [2022-04-28 11:20:00,375 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {14368#true} {14368#true} #63#return; {14368#true} is VALID [2022-04-28 11:20:00,375 INFO L290 TraceCheckUtils]: 15: Hoare triple {14368#true} assume true; {14368#true} is VALID [2022-04-28 11:20:00,376 INFO L290 TraceCheckUtils]: 14: Hoare triple {14368#true} assume !(0 == ~cond); {14368#true} is VALID [2022-04-28 11:20:00,376 INFO L290 TraceCheckUtils]: 13: Hoare triple {14368#true} ~cond := #in~cond; {14368#true} is VALID [2022-04-28 11:20:00,376 INFO L272 TraceCheckUtils]: 12: Hoare triple {14368#true} call assume_abort_if_not((if ~Y~0 >= 0 && ~Y~0 <= 5 then 1 else 0)); {14368#true} is VALID [2022-04-28 11:20:00,376 INFO L290 TraceCheckUtils]: 11: Hoare triple {14368#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~Y~0 := #t~nondet5;havoc #t~nondet5; {14368#true} is VALID [2022-04-28 11:20:00,376 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {14368#true} {14368#true} #61#return; {14368#true} is VALID [2022-04-28 11:20:00,376 INFO L290 TraceCheckUtils]: 9: Hoare triple {14368#true} assume true; {14368#true} is VALID [2022-04-28 11:20:00,376 INFO L290 TraceCheckUtils]: 8: Hoare triple {14368#true} assume !(0 == ~cond); {14368#true} is VALID [2022-04-28 11:20:00,376 INFO L290 TraceCheckUtils]: 7: Hoare triple {14368#true} ~cond := #in~cond; {14368#true} is VALID [2022-04-28 11:20:00,376 INFO L272 TraceCheckUtils]: 6: Hoare triple {14368#true} call assume_abort_if_not((if ~X~0 >= 0 && ~X~0 <= 5 then 1 else 0)); {14368#true} is VALID [2022-04-28 11:20:00,376 INFO L290 TraceCheckUtils]: 5: Hoare triple {14368#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; {14368#true} is VALID [2022-04-28 11:20:00,376 INFO L272 TraceCheckUtils]: 4: Hoare triple {14368#true} call #t~ret8 := main(); {14368#true} is VALID [2022-04-28 11:20:00,376 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14368#true} {14368#true} #69#return; {14368#true} is VALID [2022-04-28 11:20:00,376 INFO L290 TraceCheckUtils]: 2: Hoare triple {14368#true} assume true; {14368#true} is VALID [2022-04-28 11:20:00,376 INFO L290 TraceCheckUtils]: 1: Hoare triple {14368#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); {14368#true} is VALID [2022-04-28 11:20:00,376 INFO L272 TraceCheckUtils]: 0: Hoare triple {14368#true} call ULTIMATE.init(); {14368#true} is VALID [2022-04-28 11:20:00,377 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-28 11:20:00,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:20:00,377 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1954391214] [2022-04-28 11:20:00,377 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 11:20:00,377 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1427073880] [2022-04-28 11:20:00,377 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1427073880] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 11:20:00,377 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 11:20:00,377 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 13] total 26 [2022-04-28 11:20:00,378 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:20:00,378 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2057070414] [2022-04-28 11:20:00,378 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2057070414] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:20:00,378 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:20:00,378 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-04-28 11:20:00,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [201939020] [2022-04-28 11:20:00,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:20:00,378 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 1.8125) internal successors, (29), 16 states have internal predecessors, (29), 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 57 [2022-04-28 11:20:00,378 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:20:00,379 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 18 states, 16 states have (on average 1.8125) internal successors, (29), 16 states have internal predecessors, (29), 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-28 11:20:00,463 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:20:00,463 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-04-28 11:20:00,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:20:00,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-04-28 11:20:00,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=544, Unknown=4, NotChecked=0, Total=650 [2022-04-28 11:20:00,464 INFO L87 Difference]: Start difference. First operand 114 states and 130 transitions. Second operand has 18 states, 16 states have (on average 1.8125) internal successors, (29), 16 states have internal predecessors, (29), 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-28 11:20:06,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:20:06,542 INFO L93 Difference]: Finished difference Result 123 states and 138 transitions. [2022-04-28 11:20:06,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-04-28 11:20:06,543 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 1.8125) internal successors, (29), 16 states have internal predecessors, (29), 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 57 [2022-04-28 11:20:06,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:20:06,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 16 states have (on average 1.8125) internal successors, (29), 16 states have internal predecessors, (29), 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-28 11:20:06,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 40 transitions. [2022-04-28 11:20:06,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 16 states have (on average 1.8125) internal successors, (29), 16 states have internal predecessors, (29), 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-28 11:20:06,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 40 transitions. [2022-04-28 11:20:06,545 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 40 transitions. [2022-04-28 11:20:06,676 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:20:06,678 INFO L225 Difference]: With dead ends: 123 [2022-04-28 11:20:06,678 INFO L226 Difference]: Without dead ends: 115 [2022-04-28 11:20:06,678 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 88 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 285 ImplicationChecksByTransitivity, 19.7s TimeCoverageRelationStatistics Valid=249, Invalid=1153, Unknown=4, NotChecked=0, Total=1406 [2022-04-28 11:20:06,679 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 33 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 175 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-04-28 11:20:06,679 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 101 Invalid, 201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 175 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-04-28 11:20:06,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2022-04-28 11:20:07,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 95. [2022-04-28 11:20:07,032 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:20:07,033 INFO L82 GeneralOperation]: Start isEquivalent. First operand 115 states. Second operand has 95 states, 70 states have (on average 1.0857142857142856) internal successors, (76), 71 states have internal predecessors, (76), 14 states have call successors, (14), 11 states have call predecessors, (14), 10 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-28 11:20:07,033 INFO L74 IsIncluded]: Start isIncluded. First operand 115 states. Second operand has 95 states, 70 states have (on average 1.0857142857142856) internal successors, (76), 71 states have internal predecessors, (76), 14 states have call successors, (14), 11 states have call predecessors, (14), 10 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-28 11:20:07,033 INFO L87 Difference]: Start difference. First operand 115 states. Second operand has 95 states, 70 states have (on average 1.0857142857142856) internal successors, (76), 71 states have internal predecessors, (76), 14 states have call successors, (14), 11 states have call predecessors, (14), 10 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-28 11:20:07,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:20:07,036 INFO L93 Difference]: Finished difference Result 115 states and 129 transitions. [2022-04-28 11:20:07,036 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 129 transitions. [2022-04-28 11:20:07,036 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:20:07,036 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:20:07,036 INFO L74 IsIncluded]: Start isIncluded. First operand has 95 states, 70 states have (on average 1.0857142857142856) internal successors, (76), 71 states have internal predecessors, (76), 14 states have call successors, (14), 11 states have call predecessors, (14), 10 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) Second operand 115 states. [2022-04-28 11:20:07,037 INFO L87 Difference]: Start difference. First operand has 95 states, 70 states have (on average 1.0857142857142856) internal successors, (76), 71 states have internal predecessors, (76), 14 states have call successors, (14), 11 states have call predecessors, (14), 10 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) Second operand 115 states. [2022-04-28 11:20:07,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:20:07,040 INFO L93 Difference]: Finished difference Result 115 states and 129 transitions. [2022-04-28 11:20:07,040 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 129 transitions. [2022-04-28 11:20:07,040 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:20:07,040 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:20:07,040 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:20:07,041 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:20:07,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 70 states have (on average 1.0857142857142856) internal successors, (76), 71 states have internal predecessors, (76), 14 states have call successors, (14), 11 states have call predecessors, (14), 10 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-28 11:20:07,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 103 transitions. [2022-04-28 11:20:07,043 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 103 transitions. Word has length 57 [2022-04-28 11:20:07,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:20:07,044 INFO L495 AbstractCegarLoop]: Abstraction has 95 states and 103 transitions. [2022-04-28 11:20:07,044 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 1.8125) internal successors, (29), 16 states have internal predecessors, (29), 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-28 11:20:07,044 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 95 states and 103 transitions. [2022-04-28 11:20:07,753 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 103 edges. 103 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:20:07,753 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 103 transitions. [2022-04-28 11:20:07,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-04-28 11:20:07,753 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:20:07,753 INFO L195 NwaCegarLoop]: 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-28 11:20:07,762 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-04-28 11:20:07,954 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:20:07,954 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:20:07,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:20:07,955 INFO L85 PathProgramCache]: Analyzing trace with hash 809583191, now seen corresponding path program 15 times [2022-04-28 11:20:07,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:20:07,955 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1492674105] [2022-04-28 11:20:07,961 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 11:20:07,962 INFO L85 PathProgramCache]: Analyzing trace with hash 809583191, now seen corresponding path program 16 times [2022-04-28 11:20:07,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:20:07,962 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1950533446] [2022-04-28 11:20:07,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:20:07,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:20:07,975 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 11:20:07,975 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1311028920] [2022-04-28 11:20:07,975 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 11:20:07,976 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:20:07,976 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:20:07,976 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 11:20:07,977 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-04-28 11:20:08,018 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 11:20:08,018 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 11:20:08,019 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 36 conjunts are in the unsatisfiable core [2022-04-28 11:20:08,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:20:08,035 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 11:20:23,779 WARN L828 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-28 11:20:29,804 WARN L828 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-28 11:20:40,549 WARN L828 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-28 11:20:46,571 WARN L828 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-28 11:22:07,286 INFO L272 TraceCheckUtils]: 0: Hoare triple {15425#true} call ULTIMATE.init(); {15425#true} is VALID [2022-04-28 11:22:07,287 INFO L290 TraceCheckUtils]: 1: Hoare triple {15425#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); {15425#true} is VALID [2022-04-28 11:22:07,287 INFO L290 TraceCheckUtils]: 2: Hoare triple {15425#true} assume true; {15425#true} is VALID [2022-04-28 11:22:07,287 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15425#true} {15425#true} #69#return; {15425#true} is VALID [2022-04-28 11:22:07,287 INFO L272 TraceCheckUtils]: 4: Hoare triple {15425#true} call #t~ret8 := main(); {15425#true} is VALID [2022-04-28 11:22:07,287 INFO L290 TraceCheckUtils]: 5: Hoare triple {15425#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; {15425#true} is VALID [2022-04-28 11:22:07,287 INFO L272 TraceCheckUtils]: 6: Hoare triple {15425#true} call assume_abort_if_not((if ~X~0 >= 0 && ~X~0 <= 5 then 1 else 0)); {15425#true} is VALID [2022-04-28 11:22:07,287 INFO L290 TraceCheckUtils]: 7: Hoare triple {15425#true} ~cond := #in~cond; {15451#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-28 11:22:07,288 INFO L290 TraceCheckUtils]: 8: Hoare triple {15451#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {15455#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 11:22:07,288 INFO L290 TraceCheckUtils]: 9: Hoare triple {15455#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {15455#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 11:22:07,288 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {15455#(not (= |assume_abort_if_not_#in~cond| 0))} {15425#true} #61#return; {15462#(and (<= 0 main_~X~0) (<= main_~X~0 5))} is VALID [2022-04-28 11:22:07,289 INFO L290 TraceCheckUtils]: 11: Hoare triple {15462#(and (<= 0 main_~X~0) (<= main_~X~0 5))} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~Y~0 := #t~nondet5;havoc #t~nondet5; {15462#(and (<= 0 main_~X~0) (<= main_~X~0 5))} is VALID [2022-04-28 11:22:07,289 INFO L272 TraceCheckUtils]: 12: Hoare triple {15462#(and (<= 0 main_~X~0) (<= main_~X~0 5))} call assume_abort_if_not((if ~Y~0 >= 0 && ~Y~0 <= 5 then 1 else 0)); {15425#true} is VALID [2022-04-28 11:22:07,289 INFO L290 TraceCheckUtils]: 13: Hoare triple {15425#true} ~cond := #in~cond; {15425#true} is VALID [2022-04-28 11:22:07,289 INFO L290 TraceCheckUtils]: 14: Hoare triple {15425#true} assume !(0 == ~cond); {15425#true} is VALID [2022-04-28 11:22:07,289 INFO L290 TraceCheckUtils]: 15: Hoare triple {15425#true} assume true; {15425#true} is VALID [2022-04-28 11:22:07,289 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {15425#true} {15462#(and (<= 0 main_~X~0) (<= main_~X~0 5))} #63#return; {15462#(and (<= 0 main_~X~0) (<= main_~X~0 5))} is VALID [2022-04-28 11:22:07,290 INFO L290 TraceCheckUtils]: 17: Hoare triple {15462#(and (<= 0 main_~X~0) (<= main_~X~0 5))} ~v~0 := 2 * ~Y~0 - ~X~0;~y~0 := 0;~x~0 := 0; {15484#(and (<= 0 main_~x~0) (<= 0 main_~X~0) (<= (* main_~Y~0 2) (+ main_~X~0 main_~v~0)) (<= main_~X~0 5))} is VALID [2022-04-28 11:22:07,290 INFO L290 TraceCheckUtils]: 18: Hoare triple {15484#(and (<= 0 main_~x~0) (<= 0 main_~X~0) (<= (* main_~Y~0 2) (+ main_~X~0 main_~v~0)) (<= main_~X~0 5))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {15484#(and (<= 0 main_~x~0) (<= 0 main_~X~0) (<= (* main_~Y~0 2) (+ main_~X~0 main_~v~0)) (<= main_~X~0 5))} is VALID [2022-04-28 11:22:07,290 INFO L272 TraceCheckUtils]: 19: Hoare triple {15484#(and (<= 0 main_~x~0) (<= 0 main_~X~0) (<= (* main_~Y~0 2) (+ main_~X~0 main_~v~0)) (<= main_~X~0 5))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {15425#true} is VALID [2022-04-28 11:22:07,290 INFO L290 TraceCheckUtils]: 20: Hoare triple {15425#true} ~cond := #in~cond; {15425#true} is VALID [2022-04-28 11:22:07,290 INFO L290 TraceCheckUtils]: 21: Hoare triple {15425#true} assume !(0 == ~cond); {15425#true} is VALID [2022-04-28 11:22:07,290 INFO L290 TraceCheckUtils]: 22: Hoare triple {15425#true} assume true; {15425#true} is VALID [2022-04-28 11:22:07,291 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {15425#true} {15484#(and (<= 0 main_~x~0) (<= 0 main_~X~0) (<= (* main_~Y~0 2) (+ main_~X~0 main_~v~0)) (<= main_~X~0 5))} #65#return; {15484#(and (<= 0 main_~x~0) (<= 0 main_~X~0) (<= (* main_~Y~0 2) (+ main_~X~0 main_~v~0)) (<= main_~X~0 5))} is VALID [2022-04-28 11:22:07,292 INFO L290 TraceCheckUtils]: 24: Hoare triple {15484#(and (<= 0 main_~x~0) (<= 0 main_~X~0) (<= (* main_~Y~0 2) (+ main_~X~0 main_~v~0)) (<= main_~X~0 5))} assume !!(~x~0 <= ~X~0); {15484#(and (<= 0 main_~x~0) (<= 0 main_~X~0) (<= (* main_~Y~0 2) (+ main_~X~0 main_~v~0)) (<= main_~X~0 5))} is VALID [2022-04-28 11:22:07,293 INFO L290 TraceCheckUtils]: 25: Hoare triple {15484#(and (<= 0 main_~x~0) (<= 0 main_~X~0) (<= (* main_~Y~0 2) (+ main_~X~0 main_~v~0)) (<= main_~X~0 5))} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {15509#(and (<= (* main_~Y~0 4) (+ main_~X~0 main_~v~0)) (<= 0 main_~x~0) (< main_~v~0 (* main_~Y~0 2)) (<= 0 main_~X~0) (<= main_~X~0 5))} is VALID [2022-04-28 11:22:07,294 INFO L290 TraceCheckUtils]: 26: Hoare triple {15509#(and (<= (* main_~Y~0 4) (+ main_~X~0 main_~v~0)) (<= 0 main_~x~0) (< main_~v~0 (* main_~Y~0 2)) (<= 0 main_~X~0) (<= main_~X~0 5))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {15513#(and (<= (* main_~Y~0 4) (+ main_~X~0 main_~v~0)) (<= 1 main_~x~0) (< main_~v~0 (* main_~Y~0 2)) (<= 0 main_~X~0) (<= main_~X~0 5))} is VALID [2022-04-28 11:22:07,294 INFO L290 TraceCheckUtils]: 27: Hoare triple {15513#(and (<= (* main_~Y~0 4) (+ main_~X~0 main_~v~0)) (<= 1 main_~x~0) (< main_~v~0 (* main_~Y~0 2)) (<= 0 main_~X~0) (<= main_~X~0 5))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {15513#(and (<= (* main_~Y~0 4) (+ main_~X~0 main_~v~0)) (<= 1 main_~x~0) (< main_~v~0 (* main_~Y~0 2)) (<= 0 main_~X~0) (<= main_~X~0 5))} is VALID [2022-04-28 11:22:07,294 INFO L272 TraceCheckUtils]: 28: Hoare triple {15513#(and (<= (* main_~Y~0 4) (+ main_~X~0 main_~v~0)) (<= 1 main_~x~0) (< main_~v~0 (* main_~Y~0 2)) (<= 0 main_~X~0) (<= main_~X~0 5))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {15425#true} is VALID [2022-04-28 11:22:07,294 INFO L290 TraceCheckUtils]: 29: Hoare triple {15425#true} ~cond := #in~cond; {15425#true} is VALID [2022-04-28 11:22:07,295 INFO L290 TraceCheckUtils]: 30: Hoare triple {15425#true} assume !(0 == ~cond); {15425#true} is VALID [2022-04-28 11:22:07,295 INFO L290 TraceCheckUtils]: 31: Hoare triple {15425#true} assume true; {15425#true} is VALID [2022-04-28 11:22:07,295 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {15425#true} {15513#(and (<= (* main_~Y~0 4) (+ main_~X~0 main_~v~0)) (<= 1 main_~x~0) (< main_~v~0 (* main_~Y~0 2)) (<= 0 main_~X~0) (<= main_~X~0 5))} #65#return; {15513#(and (<= (* main_~Y~0 4) (+ main_~X~0 main_~v~0)) (<= 1 main_~x~0) (< main_~v~0 (* main_~Y~0 2)) (<= 0 main_~X~0) (<= main_~X~0 5))} is VALID [2022-04-28 11:22:07,296 INFO L290 TraceCheckUtils]: 33: Hoare triple {15513#(and (<= (* main_~Y~0 4) (+ main_~X~0 main_~v~0)) (<= 1 main_~x~0) (< main_~v~0 (* main_~Y~0 2)) (<= 0 main_~X~0) (<= main_~X~0 5))} assume !!(~x~0 <= ~X~0); {15513#(and (<= (* main_~Y~0 4) (+ main_~X~0 main_~v~0)) (<= 1 main_~x~0) (< main_~v~0 (* main_~Y~0 2)) (<= 0 main_~X~0) (<= main_~X~0 5))} is VALID [2022-04-28 11:22:07,297 INFO L290 TraceCheckUtils]: 34: Hoare triple {15513#(and (<= (* main_~Y~0 4) (+ main_~X~0 main_~v~0)) (<= 1 main_~x~0) (< main_~v~0 (* main_~Y~0 2)) (<= 0 main_~X~0) (<= main_~X~0 5))} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {15538#(and (<= 1 main_~x~0) (< main_~v~0 (* main_~Y~0 4)) (< (* main_~Y~0 4) main_~X~0) (< main_~v~0 (* main_~Y~0 2)) (<= 0 main_~X~0) (<= main_~X~0 5))} is VALID [2022-04-28 11:22:07,298 INFO L290 TraceCheckUtils]: 35: Hoare triple {15538#(and (<= 1 main_~x~0) (< main_~v~0 (* main_~Y~0 4)) (< (* main_~Y~0 4) main_~X~0) (< main_~v~0 (* main_~Y~0 2)) (<= 0 main_~X~0) (<= main_~X~0 5))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {15542#(and (< main_~v~0 (* main_~Y~0 4)) (< (* main_~Y~0 4) main_~X~0) (< main_~v~0 (* main_~Y~0 2)) (<= 2 main_~x~0) (<= 0 main_~X~0) (<= main_~X~0 5))} is VALID [2022-04-28 11:22:07,299 INFO L290 TraceCheckUtils]: 36: Hoare triple {15542#(and (< main_~v~0 (* main_~Y~0 4)) (< (* main_~Y~0 4) main_~X~0) (< main_~v~0 (* main_~Y~0 2)) (<= 2 main_~x~0) (<= 0 main_~X~0) (<= main_~X~0 5))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {15542#(and (< main_~v~0 (* main_~Y~0 4)) (< (* main_~Y~0 4) main_~X~0) (< main_~v~0 (* main_~Y~0 2)) (<= 2 main_~x~0) (<= 0 main_~X~0) (<= main_~X~0 5))} is VALID [2022-04-28 11:22:07,299 INFO L272 TraceCheckUtils]: 37: Hoare triple {15542#(and (< main_~v~0 (* main_~Y~0 4)) (< (* main_~Y~0 4) main_~X~0) (< main_~v~0 (* main_~Y~0 2)) (<= 2 main_~x~0) (<= 0 main_~X~0) (<= main_~X~0 5))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {15425#true} is VALID [2022-04-28 11:22:07,299 INFO L290 TraceCheckUtils]: 38: Hoare triple {15425#true} ~cond := #in~cond; {15425#true} is VALID [2022-04-28 11:22:07,299 INFO L290 TraceCheckUtils]: 39: Hoare triple {15425#true} assume !(0 == ~cond); {15425#true} is VALID [2022-04-28 11:22:07,299 INFO L290 TraceCheckUtils]: 40: Hoare triple {15425#true} assume true; {15425#true} is VALID [2022-04-28 11:22:07,300 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {15425#true} {15542#(and (< main_~v~0 (* main_~Y~0 4)) (< (* main_~Y~0 4) main_~X~0) (< main_~v~0 (* main_~Y~0 2)) (<= 2 main_~x~0) (<= 0 main_~X~0) (<= main_~X~0 5))} #65#return; {15542#(and (< main_~v~0 (* main_~Y~0 4)) (< (* main_~Y~0 4) main_~X~0) (< main_~v~0 (* main_~Y~0 2)) (<= 2 main_~x~0) (<= 0 main_~X~0) (<= main_~X~0 5))} is VALID [2022-04-28 11:22:07,300 INFO L290 TraceCheckUtils]: 42: Hoare triple {15542#(and (< main_~v~0 (* main_~Y~0 4)) (< (* main_~Y~0 4) main_~X~0) (< main_~v~0 (* main_~Y~0 2)) (<= 2 main_~x~0) (<= 0 main_~X~0) (<= main_~X~0 5))} assume !!(~x~0 <= ~X~0); {15542#(and (< main_~v~0 (* main_~Y~0 4)) (< (* main_~Y~0 4) main_~X~0) (< main_~v~0 (* main_~Y~0 2)) (<= 2 main_~x~0) (<= 0 main_~X~0) (<= main_~X~0 5))} is VALID [2022-04-28 11:22:07,301 INFO L290 TraceCheckUtils]: 43: Hoare triple {15542#(and (< main_~v~0 (* main_~Y~0 4)) (< (* main_~Y~0 4) main_~X~0) (< main_~v~0 (* main_~Y~0 2)) (<= 2 main_~x~0) (<= 0 main_~X~0) (<= main_~X~0 5))} 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; {15567#(and (< (* main_~Y~0 4) main_~X~0) (<= 2 main_~x~0) (<= main_~X~0 5) (< 0 (* main_~Y~0 2)))} is VALID [2022-04-28 11:22:07,302 INFO L290 TraceCheckUtils]: 44: Hoare triple {15567#(and (< (* main_~Y~0 4) main_~X~0) (<= 2 main_~x~0) (<= main_~X~0 5) (< 0 (* main_~Y~0 2)))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {15571#(and (< (* main_~Y~0 4) main_~X~0) (<= main_~X~0 5) (<= 3 main_~x~0) (< 0 (* main_~Y~0 2)))} is VALID [2022-04-28 11:22:07,303 INFO L290 TraceCheckUtils]: 45: Hoare triple {15571#(and (< (* main_~Y~0 4) main_~X~0) (<= main_~X~0 5) (<= 3 main_~x~0) (< 0 (* main_~Y~0 2)))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {15575#(and (< (* main_~Y~0 4) main_~X~0) (<= main_~X~0 5) (= (* main_~X~0 main_~y~0) main_~xy~0) (<= 3 main_~x~0) (= main_~yx~0 (* main_~Y~0 main_~x~0)) (< 0 (* main_~Y~0 2)))} is VALID [2022-04-28 11:22:07,303 INFO L272 TraceCheckUtils]: 46: Hoare triple {15575#(and (< (* main_~Y~0 4) main_~X~0) (<= main_~X~0 5) (= (* main_~X~0 main_~y~0) main_~xy~0) (<= 3 main_~x~0) (= main_~yx~0 (* main_~Y~0 main_~x~0)) (< 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)); {15425#true} is VALID [2022-04-28 11:22:07,303 INFO L290 TraceCheckUtils]: 47: Hoare triple {15425#true} ~cond := #in~cond; {15582#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:22:07,303 INFO L290 TraceCheckUtils]: 48: Hoare triple {15582#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {15586#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:22:07,303 INFO L290 TraceCheckUtils]: 49: Hoare triple {15586#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {15586#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:22:07,305 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {15586#(not (= |__VERIFIER_assert_#in~cond| 0))} {15575#(and (< (* main_~Y~0 4) main_~X~0) (<= main_~X~0 5) (= (* main_~X~0 main_~y~0) main_~xy~0) (<= 3 main_~x~0) (= main_~yx~0 (* main_~Y~0 main_~x~0)) (< 0 (* main_~Y~0 2)))} #65#return; {15593#(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_~X~0) (<= main_~X~0 5) (<= 3 main_~x~0) (< 0 (* main_~Y~0 2)))} is VALID [2022-04-28 11:22:07,306 INFO L290 TraceCheckUtils]: 51: Hoare triple {15593#(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_~X~0) (<= main_~X~0 5) (<= 3 main_~x~0) (< 0 (* main_~Y~0 2)))} assume !!(~x~0 <= ~X~0); {15593#(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_~X~0) (<= main_~X~0 5) (<= 3 main_~x~0) (< 0 (* main_~Y~0 2)))} is VALID [2022-04-28 11:22:07,306 INFO L290 TraceCheckUtils]: 52: Hoare triple {15593#(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_~X~0) (<= main_~X~0 5) (<= 3 main_~x~0) (< 0 (* main_~Y~0 2)))} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {15600#(and (< (* main_~Y~0 4) main_~X~0) (<= main_~X~0 5) (<= 3 main_~x~0) (< 0 (* main_~Y~0 2)) (= (+ (* (* 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-28 11:22:07,309 INFO L290 TraceCheckUtils]: 53: Hoare triple {15600#(and (< (* main_~Y~0 4) main_~X~0) (<= main_~X~0 5) (<= 3 main_~x~0) (< 0 (* main_~Y~0 2)) (= (+ (* (* 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; {15604#(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_~Y~0 4) main_~X~0) (<= main_~X~0 5) (<= 4 main_~x~0) (< 0 (* main_~Y~0 2)))} is VALID [2022-04-28 11:22:07,655 INFO L290 TraceCheckUtils]: 54: Hoare triple {15604#(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_~Y~0 4) main_~X~0) (<= main_~X~0 5) (<= 4 main_~x~0) (< 0 (* main_~Y~0 2)))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {15608#(and (<= 4 (div (+ (* (div main_~xy~0 main_~X~0) main_~X~0) (* (- 1) main_~Y~0) (div (+ (* (- 1) main_~X~0) (* (- 1) main_~v~0)) (- 2))) main_~Y~0)) (< (* main_~Y~0 4) main_~X~0) (= (* main_~Y~0 (div (+ (* (div main_~xy~0 main_~X~0) main_~X~0) (* (- 1) main_~Y~0) (div (+ (* (- 1) main_~X~0) (* (- 1) main_~v~0)) (- 2))) main_~Y~0)) main_~yx~0) (<= main_~X~0 5) (= (mod main_~xy~0 main_~X~0) 0) (= (mod (+ main_~X~0 main_~v~0 (* (- 2) (div main_~xy~0 main_~X~0) main_~X~0)) 2) 0) (< 0 (* main_~Y~0 2)))} is VALID [2022-04-28 11:22:07,658 INFO L272 TraceCheckUtils]: 55: Hoare triple {15608#(and (<= 4 (div (+ (* (div main_~xy~0 main_~X~0) main_~X~0) (* (- 1) main_~Y~0) (div (+ (* (- 1) main_~X~0) (* (- 1) main_~v~0)) (- 2))) main_~Y~0)) (< (* main_~Y~0 4) main_~X~0) (= (* main_~Y~0 (div (+ (* (div main_~xy~0 main_~X~0) main_~X~0) (* (- 1) main_~Y~0) (div (+ (* (- 1) main_~X~0) (* (- 1) main_~v~0)) (- 2))) main_~Y~0)) main_~yx~0) (<= main_~X~0 5) (= (mod main_~xy~0 main_~X~0) 0) (= (mod (+ main_~X~0 main_~v~0 (* (- 2) (div main_~xy~0 main_~X~0) main_~X~0)) 2) 0) (< 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)); {15612#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 11:22:07,659 INFO L290 TraceCheckUtils]: 56: Hoare triple {15612#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {15616#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:22:07,659 INFO L290 TraceCheckUtils]: 57: Hoare triple {15616#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {15426#false} is VALID [2022-04-28 11:22:07,659 INFO L290 TraceCheckUtils]: 58: Hoare triple {15426#false} assume !false; {15426#false} is VALID [2022-04-28 11:22:07,659 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 18 proven. 40 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-04-28 11:22:07,659 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 11:22:14,320 INFO L290 TraceCheckUtils]: 58: Hoare triple {15426#false} assume !false; {15426#false} is VALID [2022-04-28 11:22:14,321 INFO L290 TraceCheckUtils]: 57: Hoare triple {15616#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {15426#false} is VALID [2022-04-28 11:22:14,321 INFO L290 TraceCheckUtils]: 56: Hoare triple {15612#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {15616#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:22:14,322 INFO L272 TraceCheckUtils]: 55: Hoare triple {15632#(= (+ (* 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)); {15612#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 11:22:14,323 INFO L290 TraceCheckUtils]: 54: Hoare triple {15636#(= (+ (* 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; {15632#(= (+ (* 2 main_~xy~0) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 main_~yx~0)))} is VALID [2022-04-28 11:22:14,325 INFO L290 TraceCheckUtils]: 53: Hoare triple {15640#(= (+ (* (* 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; {15636#(= (+ (* 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-28 11:22:14,326 INFO L290 TraceCheckUtils]: 52: Hoare triple {15636#(= (+ (* 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; {15640#(= (+ (* (* 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-28 11:22:14,327 INFO L290 TraceCheckUtils]: 51: Hoare triple {15636#(= (+ (* 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); {15636#(= (+ (* 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-28 11:22:14,328 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {15586#(not (= |__VERIFIER_assert_#in~cond| 0))} {15650#(= (+ (* (* main_~X~0 main_~y~0) 2) (* (- 2) main_~xy~0) (* main_~Y~0 2) (* 2 main_~yx~0)) (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))))} #65#return; {15636#(= (+ (* 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-28 11:22:14,328 INFO L290 TraceCheckUtils]: 49: Hoare triple {15586#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {15586#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:22:14,328 INFO L290 TraceCheckUtils]: 48: Hoare triple {15660#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {15586#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:22:14,329 INFO L290 TraceCheckUtils]: 47: Hoare triple {15425#true} ~cond := #in~cond; {15660#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 11:22:14,329 INFO L272 TraceCheckUtils]: 46: Hoare triple {15650#(= (+ (* (* main_~X~0 main_~y~0) 2) (* (- 2) main_~xy~0) (* main_~Y~0 2) (* 2 main_~yx~0)) (+ (* 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)); {15425#true} is VALID [2022-04-28 11:22:14,330 INFO L290 TraceCheckUtils]: 45: Hoare triple {15425#true} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {15650#(= (+ (* (* main_~X~0 main_~y~0) 2) (* (- 2) main_~xy~0) (* main_~Y~0 2) (* 2 main_~yx~0)) (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))))} is VALID [2022-04-28 11:22:14,330 INFO L290 TraceCheckUtils]: 44: Hoare triple {15425#true} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {15425#true} is VALID [2022-04-28 11:22:14,331 INFO L290 TraceCheckUtils]: 43: Hoare triple {15425#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; {15425#true} is VALID [2022-04-28 11:22:14,331 INFO L290 TraceCheckUtils]: 42: Hoare triple {15425#true} assume !!(~x~0 <= ~X~0); {15425#true} is VALID [2022-04-28 11:22:14,331 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {15425#true} {15425#true} #65#return; {15425#true} is VALID [2022-04-28 11:22:14,331 INFO L290 TraceCheckUtils]: 40: Hoare triple {15425#true} assume true; {15425#true} is VALID [2022-04-28 11:22:14,331 INFO L290 TraceCheckUtils]: 39: Hoare triple {15425#true} assume !(0 == ~cond); {15425#true} is VALID [2022-04-28 11:22:14,331 INFO L290 TraceCheckUtils]: 38: Hoare triple {15425#true} ~cond := #in~cond; {15425#true} is VALID [2022-04-28 11:22:14,331 INFO L272 TraceCheckUtils]: 37: Hoare triple {15425#true} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {15425#true} is VALID [2022-04-28 11:22:14,331 INFO L290 TraceCheckUtils]: 36: Hoare triple {15425#true} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {15425#true} is VALID [2022-04-28 11:22:14,331 INFO L290 TraceCheckUtils]: 35: Hoare triple {15425#true} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {15425#true} is VALID [2022-04-28 11:22:14,331 INFO L290 TraceCheckUtils]: 34: Hoare triple {15425#true} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {15425#true} is VALID [2022-04-28 11:22:14,331 INFO L290 TraceCheckUtils]: 33: Hoare triple {15425#true} assume !!(~x~0 <= ~X~0); {15425#true} is VALID [2022-04-28 11:22:14,331 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {15425#true} {15425#true} #65#return; {15425#true} is VALID [2022-04-28 11:22:14,331 INFO L290 TraceCheckUtils]: 31: Hoare triple {15425#true} assume true; {15425#true} is VALID [2022-04-28 11:22:14,331 INFO L290 TraceCheckUtils]: 30: Hoare triple {15425#true} assume !(0 == ~cond); {15425#true} is VALID [2022-04-28 11:22:14,331 INFO L290 TraceCheckUtils]: 29: Hoare triple {15425#true} ~cond := #in~cond; {15425#true} is VALID [2022-04-28 11:22:14,332 INFO L272 TraceCheckUtils]: 28: Hoare triple {15425#true} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {15425#true} is VALID [2022-04-28 11:22:14,332 INFO L290 TraceCheckUtils]: 27: Hoare triple {15425#true} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {15425#true} is VALID [2022-04-28 11:22:14,332 INFO L290 TraceCheckUtils]: 26: Hoare triple {15425#true} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {15425#true} is VALID [2022-04-28 11:22:14,332 INFO L290 TraceCheckUtils]: 25: Hoare triple {15425#true} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {15425#true} is VALID [2022-04-28 11:22:14,332 INFO L290 TraceCheckUtils]: 24: Hoare triple {15425#true} assume !!(~x~0 <= ~X~0); {15425#true} is VALID [2022-04-28 11:22:14,332 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {15425#true} {15425#true} #65#return; {15425#true} is VALID [2022-04-28 11:22:14,332 INFO L290 TraceCheckUtils]: 22: Hoare triple {15425#true} assume true; {15425#true} is VALID [2022-04-28 11:22:14,332 INFO L290 TraceCheckUtils]: 21: Hoare triple {15425#true} assume !(0 == ~cond); {15425#true} is VALID [2022-04-28 11:22:14,332 INFO L290 TraceCheckUtils]: 20: Hoare triple {15425#true} ~cond := #in~cond; {15425#true} is VALID [2022-04-28 11:22:14,332 INFO L272 TraceCheckUtils]: 19: Hoare triple {15425#true} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {15425#true} is VALID [2022-04-28 11:22:14,332 INFO L290 TraceCheckUtils]: 18: Hoare triple {15425#true} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {15425#true} is VALID [2022-04-28 11:22:14,332 INFO L290 TraceCheckUtils]: 17: Hoare triple {15425#true} ~v~0 := 2 * ~Y~0 - ~X~0;~y~0 := 0;~x~0 := 0; {15425#true} is VALID [2022-04-28 11:22:14,332 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {15425#true} {15425#true} #63#return; {15425#true} is VALID [2022-04-28 11:22:14,332 INFO L290 TraceCheckUtils]: 15: Hoare triple {15425#true} assume true; {15425#true} is VALID [2022-04-28 11:22:14,332 INFO L290 TraceCheckUtils]: 14: Hoare triple {15425#true} assume !(0 == ~cond); {15425#true} is VALID [2022-04-28 11:22:14,333 INFO L290 TraceCheckUtils]: 13: Hoare triple {15425#true} ~cond := #in~cond; {15425#true} is VALID [2022-04-28 11:22:14,333 INFO L272 TraceCheckUtils]: 12: Hoare triple {15425#true} call assume_abort_if_not((if ~Y~0 >= 0 && ~Y~0 <= 5 then 1 else 0)); {15425#true} is VALID [2022-04-28 11:22:14,333 INFO L290 TraceCheckUtils]: 11: Hoare triple {15425#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~Y~0 := #t~nondet5;havoc #t~nondet5; {15425#true} is VALID [2022-04-28 11:22:14,333 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {15425#true} {15425#true} #61#return; {15425#true} is VALID [2022-04-28 11:22:14,333 INFO L290 TraceCheckUtils]: 9: Hoare triple {15425#true} assume true; {15425#true} is VALID [2022-04-28 11:22:14,333 INFO L290 TraceCheckUtils]: 8: Hoare triple {15425#true} assume !(0 == ~cond); {15425#true} is VALID [2022-04-28 11:22:14,333 INFO L290 TraceCheckUtils]: 7: Hoare triple {15425#true} ~cond := #in~cond; {15425#true} is VALID [2022-04-28 11:22:14,333 INFO L272 TraceCheckUtils]: 6: Hoare triple {15425#true} call assume_abort_if_not((if ~X~0 >= 0 && ~X~0 <= 5 then 1 else 0)); {15425#true} is VALID [2022-04-28 11:22:14,333 INFO L290 TraceCheckUtils]: 5: Hoare triple {15425#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; {15425#true} is VALID [2022-04-28 11:22:14,333 INFO L272 TraceCheckUtils]: 4: Hoare triple {15425#true} call #t~ret8 := main(); {15425#true} is VALID [2022-04-28 11:22:14,333 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15425#true} {15425#true} #69#return; {15425#true} is VALID [2022-04-28 11:22:14,333 INFO L290 TraceCheckUtils]: 2: Hoare triple {15425#true} assume true; {15425#true} is VALID [2022-04-28 11:22:14,333 INFO L290 TraceCheckUtils]: 1: Hoare triple {15425#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); {15425#true} is VALID [2022-04-28 11:22:14,333 INFO L272 TraceCheckUtils]: 0: Hoare triple {15425#true} call ULTIMATE.init(); {15425#true} is VALID [2022-04-28 11:22:14,334 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-28 11:22:14,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:22:14,334 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1950533446] [2022-04-28 11:22:14,334 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 11:22:14,334 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1311028920] [2022-04-28 11:22:14,334 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1311028920] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 11:22:14,334 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 11:22:14,334 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 10] total 26 [2022-04-28 11:22:14,334 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:22:14,334 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1492674105] [2022-04-28 11:22:14,335 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1492674105] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:22:14,335 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:22:14,335 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2022-04-28 11:22:14,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1838360209] [2022-04-28 11:22:14,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:22:14,335 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 19 states have (on average 1.9473684210526316) internal successors, (37), 20 states have internal predecessors, (37), 7 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) Word has length 59 [2022-04-28 11:22:14,336 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:22:14,336 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 21 states, 19 states have (on average 1.9473684210526316) internal successors, (37), 20 states have internal predecessors, (37), 7 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2022-04-28 11:22:14,899 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:22:14,899 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-04-28 11:22:14,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:22:14,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-04-28 11:22:14,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=567, Unknown=1, NotChecked=0, Total=650 [2022-04-28 11:22:14,900 INFO L87 Difference]: Start difference. First operand 95 states and 103 transitions. Second operand has 21 states, 19 states have (on average 1.9473684210526316) internal successors, (37), 20 states have internal predecessors, (37), 7 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2022-04-28 11:22:17,655 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-28 11:22:21,336 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.47s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-28 11:22:24,331 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-28 11:22:29,288 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-28 11:22:46,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:22:46,480 INFO L93 Difference]: Finished difference Result 107 states and 116 transitions. [2022-04-28 11:22:46,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-04-28 11:22:46,480 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 19 states have (on average 1.9473684210526316) internal successors, (37), 20 states have internal predecessors, (37), 7 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) Word has length 59 [2022-04-28 11:22:46,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:22:46,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 19 states have (on average 1.9473684210526316) internal successors, (37), 20 states have internal predecessors, (37), 7 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2022-04-28 11:22:46,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 65 transitions. [2022-04-28 11:22:46,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 19 states have (on average 1.9473684210526316) internal successors, (37), 20 states have internal predecessors, (37), 7 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2022-04-28 11:22:46,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 65 transitions. [2022-04-28 11:22:46,482 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 22 states and 65 transitions. [2022-04-28 11:22:48,686 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-28 11:22:48,687 INFO L225 Difference]: With dead ends: 107 [2022-04-28 11:22:48,687 INFO L226 Difference]: Without dead ends: 81 [2022-04-28 11:22:48,688 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 91 SyntacticMatches, 2 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 265 ImplicationChecksByTransitivity, 13.1s TimeCoverageRelationStatistics Valid=196, Invalid=1135, Unknown=1, NotChecked=0, Total=1332 [2022-04-28 11:22:48,688 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 34 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 445 mSolverCounterSat, 37 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 485 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 445 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14.5s IncrementalHoareTripleChecker+Time [2022-04-28 11:22:48,688 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 103 Invalid, 485 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 445 Invalid, 3 Unknown, 0 Unchecked, 14.5s Time] [2022-04-28 11:22:48,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2022-04-28 11:22:48,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2022-04-28 11:22:48,898 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:22:48,899 INFO L82 GeneralOperation]: Start isEquivalent. First operand 81 states. Second operand has 81 states, 59 states have (on average 1.0847457627118644) internal successors, (64), 60 states have internal predecessors, (64), 12 states have call successors, (12), 10 states have call predecessors, (12), 9 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-28 11:22:48,899 INFO L74 IsIncluded]: Start isIncluded. First operand 81 states. Second operand has 81 states, 59 states have (on average 1.0847457627118644) internal successors, (64), 60 states have internal predecessors, (64), 12 states have call successors, (12), 10 states have call predecessors, (12), 9 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-28 11:22:48,899 INFO L87 Difference]: Start difference. First operand 81 states. Second operand has 81 states, 59 states have (on average 1.0847457627118644) internal successors, (64), 60 states have internal predecessors, (64), 12 states have call successors, (12), 10 states have call predecessors, (12), 9 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-28 11:22:48,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:22:48,901 INFO L93 Difference]: Finished difference Result 81 states and 87 transitions. [2022-04-28 11:22:48,901 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 87 transitions. [2022-04-28 11:22:48,901 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:22:48,901 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:22:48,901 INFO L74 IsIncluded]: Start isIncluded. First operand has 81 states, 59 states have (on average 1.0847457627118644) internal successors, (64), 60 states have internal predecessors, (64), 12 states have call successors, (12), 10 states have call predecessors, (12), 9 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) Second operand 81 states. [2022-04-28 11:22:48,901 INFO L87 Difference]: Start difference. First operand has 81 states, 59 states have (on average 1.0847457627118644) internal successors, (64), 60 states have internal predecessors, (64), 12 states have call successors, (12), 10 states have call predecessors, (12), 9 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) Second operand 81 states. [2022-04-28 11:22:48,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:22:48,903 INFO L93 Difference]: Finished difference Result 81 states and 87 transitions. [2022-04-28 11:22:48,903 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 87 transitions. [2022-04-28 11:22:48,903 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:22:48,903 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:22:48,903 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:22:48,903 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:22:48,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 59 states have (on average 1.0847457627118644) internal successors, (64), 60 states have internal predecessors, (64), 12 states have call successors, (12), 10 states have call predecessors, (12), 9 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-28 11:22:48,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 87 transitions. [2022-04-28 11:22:48,905 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 87 transitions. Word has length 59 [2022-04-28 11:22:48,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:22:48,905 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 87 transitions. [2022-04-28 11:22:48,905 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 19 states have (on average 1.9473684210526316) internal successors, (37), 20 states have internal predecessors, (37), 7 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2022-04-28 11:22:48,905 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 81 states and 87 transitions. [2022-04-28 11:22:49,339 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 87 edges. 87 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:22:49,340 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 87 transitions. [2022-04-28 11:22:49,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-04-28 11:22:49,340 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:22:49,340 INFO L195 NwaCegarLoop]: 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-28 11:22:49,356 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2022-04-28 11:22:49,540 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2022-04-28 11:22:49,541 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:22:49,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:22:49,541 INFO L85 PathProgramCache]: Analyzing trace with hash 1971200155, now seen corresponding path program 17 times [2022-04-28 11:22:49,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:22:49,541 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1664701161] [2022-04-28 11:22:49,541 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 11:22:49,541 INFO L85 PathProgramCache]: Analyzing trace with hash 1971200155, now seen corresponding path program 18 times [2022-04-28 11:22:49,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:22:49,542 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1347385191] [2022-04-28 11:22:49,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:22:49,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:22:49,551 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 11:22:49,552 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [164959621] [2022-04-28 11:22:49,552 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 11:22:49,552 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:22:49,552 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:22:49,553 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 11:22:49,555 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-04-28 11:22:49,600 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-04-28 11:22:49,600 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 11:22:49,601 INFO L263 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 52 conjunts are in the unsatisfiable core [2022-04-28 11:22:49,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:22:49,617 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 11:23:21,707 WARN L232 SmtUtils]: Spent 6.07s on a formula simplification that was a NOOP. DAG size: 35 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-28 11:23:37,285 WARN L232 SmtUtils]: Spent 6.04s on a formula simplification that was a NOOP. DAG size: 38 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-28 11:23:51,245 WARN L232 SmtUtils]: Spent 6.04s on a formula simplification that was a NOOP. DAG size: 39 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)