/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf -i ../../../trunk/examples/svcomp/nla-digbench-scaling/bresenham-ll_valuebound5.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-08 04:44:08,055 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-08 04:44:08,057 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-08 04:44:08,117 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-08 04:44:08,118 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-08 04:44:08,119 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-08 04:44:08,121 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-08 04:44:08,124 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-08 04:44:08,126 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-08 04:44:08,129 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-08 04:44:08,130 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-08 04:44:08,136 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-08 04:44:08,136 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-08 04:44:08,138 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-08 04:44:08,139 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-08 04:44:08,141 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-08 04:44:08,142 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-08 04:44:08,142 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-08 04:44:08,144 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-08 04:44:08,149 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-08 04:44:08,151 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-08 04:44:08,152 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-08 04:44:08,153 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-08 04:44:08,153 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-08 04:44:08,155 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-08 04:44:08,160 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-08 04:44:08,160 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-08 04:44:08,161 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-08 04:44:08,161 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-08 04:44:08,162 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-08 04:44:08,163 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-08 04:44:08,163 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-08 04:44:08,164 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-08 04:44:08,165 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-08 04:44:08,165 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-08 04:44:08,166 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-08 04:44:08,166 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-08 04:44:08,167 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-08 04:44:08,167 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-08 04:44:08,167 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-08 04:44:08,168 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-08 04:44:08,169 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-08 04:44:08,170 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-04-08 04:44:08,178 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-08 04:44:08,179 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-08 04:44:08,180 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-08 04:44:08,180 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-08 04:44:08,180 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-08 04:44:08,180 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-08 04:44:08,180 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-08 04:44:08,180 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-08 04:44:08,181 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-08 04:44:08,181 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-08 04:44:08,181 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-08 04:44:08,182 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-08 04:44:08,182 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-08 04:44:08,182 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-08 04:44:08,182 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-08 04:44:08,182 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-08 04:44:08,182 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-08 04:44:08,183 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-08 04:44:08,183 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 04:44:08,183 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-08 04:44:08,183 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-08 04:44:08,183 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-08 04:44:08,183 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-08 04:44:08,184 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-08 04:44:08,184 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-08 04:44:08,184 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-08 04:44:08,420 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-08 04:44:08,442 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-08 04:44:08,444 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-08 04:44:08,445 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-08 04:44:08,446 INFO L275 PluginConnector]: CDTParser initialized [2022-04-08 04:44:08,447 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-08 04:44:08,500 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4400fc824/6e624f0b9af944eb90075b1bf26288ea/FLAG66833d556 [2022-04-08 04:44:08,871 INFO L306 CDTParser]: Found 1 translation units. [2022-04-08 04:44:08,872 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/bresenham-ll_valuebound5.c [2022-04-08 04:44:08,879 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4400fc824/6e624f0b9af944eb90075b1bf26288ea/FLAG66833d556 [2022-04-08 04:44:09,295 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4400fc824/6e624f0b9af944eb90075b1bf26288ea [2022-04-08 04:44:09,297 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-08 04:44:09,298 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-08 04:44:09,303 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-08 04:44:09,303 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-08 04:44:09,307 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-08 04:44:09,307 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 04:44:09" (1/1) ... [2022-04-08 04:44:09,308 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@23ccd274 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 04:44:09, skipping insertion in model container [2022-04-08 04:44:09,308 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 04:44:09" (1/1) ... [2022-04-08 04:44:09,314 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-08 04:44:09,327 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-08 04:44:09,482 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-08 04:44:09,523 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 04:44:09,529 INFO L203 MainTranslator]: Completed pre-run [2022-04-08 04:44:09,548 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-08 04:44:09,566 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 04:44:09,581 INFO L208 MainTranslator]: Completed translation [2022-04-08 04:44:09,581 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 04:44:09 WrapperNode [2022-04-08 04:44:09,581 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-08 04:44:09,582 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-08 04:44:09,582 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-08 04:44:09,583 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-08 04:44:09,593 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 04:44:09" (1/1) ... [2022-04-08 04:44:09,593 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 04:44:09" (1/1) ... [2022-04-08 04:44:09,600 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 04:44:09" (1/1) ... [2022-04-08 04:44:09,600 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 04:44:09" (1/1) ... [2022-04-08 04:44:09,613 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 04:44:09" (1/1) ... [2022-04-08 04:44:09,618 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 04:44:09" (1/1) ... [2022-04-08 04:44:09,622 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 04:44:09" (1/1) ... [2022-04-08 04:44:09,625 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-08 04:44:09,626 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-08 04:44:09,626 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-08 04:44:09,626 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-08 04:44:09,627 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 04:44:09" (1/1) ... [2022-04-08 04:44:09,633 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 04:44:09,641 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 04:44:09,656 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-08 04:44:09,683 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-08 04:44:09,703 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-08 04:44:09,703 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-08 04:44:09,703 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-08 04:44:09,703 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-08 04:44:09,704 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-08 04:44:09,704 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-08 04:44:09,704 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-08 04:44:09,704 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-08 04:44:09,704 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-08 04:44:09,704 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-08 04:44:09,705 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-08 04:44:09,705 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-08 04:44:09,706 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-08 04:44:09,706 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-08 04:44:09,706 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-08 04:44:09,706 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-08 04:44:09,706 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-08 04:44:09,706 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-08 04:44:09,707 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-08 04:44:09,707 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-08 04:44:09,765 INFO L234 CfgBuilder]: Building ICFG [2022-04-08 04:44:09,767 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-08 04:44:09,968 INFO L275 CfgBuilder]: Performing block encoding [2022-04-08 04:44:09,974 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-08 04:44:09,974 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-08 04:44:09,975 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 04:44:09 BoogieIcfgContainer [2022-04-08 04:44:09,976 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-08 04:44:09,977 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-08 04:44:09,977 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-08 04:44:09,993 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-08 04:44:09,993 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.04 04:44:09" (1/3) ... [2022-04-08 04:44:09,994 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3cdd38 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 04:44:09, skipping insertion in model container [2022-04-08 04:44:09,994 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 04:44:09" (2/3) ... [2022-04-08 04:44:09,994 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3cdd38 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 04:44:09, skipping insertion in model container [2022-04-08 04:44:09,995 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 04:44:09" (3/3) ... [2022-04-08 04:44:09,996 INFO L111 eAbstractionObserver]: Analyzing ICFG bresenham-ll_valuebound5.c [2022-04-08 04:44:10,000 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-08 04:44:10,000 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-08 04:44:10,039 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-08 04:44:10,044 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-08 04:44:10,045 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-08 04:44:10,060 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-08 04:44:10,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-08 04:44:10,066 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 04:44:10,067 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 04:44:10,067 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 04:44:10,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 04:44:10,072 INFO L85 PathProgramCache]: Analyzing trace with hash -1867489771, now seen corresponding path program 1 times [2022-04-08 04:44:10,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 04:44:10,079 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [902731167] [2022-04-08 04:44:10,090 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 04:44:10,090 INFO L85 PathProgramCache]: Analyzing trace with hash -1867489771, now seen corresponding path program 2 times [2022-04-08 04:44:10,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 04:44:10,094 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041441230] [2022-04-08 04:44:10,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 04:44:10,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 04:44:10,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:44:10,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 04:44:10,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:44:10,313 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-08 04:44:10,313 INFO L290 TraceCheckUtils]: 1: Hoare triple {35#true} assume true; {35#true} is VALID [2022-04-08 04:44:10,313 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {35#true} {35#true} #69#return; {35#true} is VALID [2022-04-08 04:44:10,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-08 04:44:10,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:44:10,332 INFO L290 TraceCheckUtils]: 0: Hoare triple {35#true} ~cond := #in~cond; {35#true} is VALID [2022-04-08 04:44:10,333 INFO L290 TraceCheckUtils]: 1: Hoare triple {35#true} assume 0 == ~cond;assume false; {36#false} is VALID [2022-04-08 04:44:10,333 INFO L290 TraceCheckUtils]: 2: Hoare triple {36#false} assume true; {36#false} is VALID [2022-04-08 04:44:10,334 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {36#false} {35#true} #61#return; {36#false} is VALID [2022-04-08 04:44:10,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-08 04:44:10,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:44:10,355 INFO L290 TraceCheckUtils]: 0: Hoare triple {35#true} ~cond := #in~cond; {35#true} is VALID [2022-04-08 04:44:10,355 INFO L290 TraceCheckUtils]: 1: Hoare triple {35#true} assume 0 == ~cond;assume false; {36#false} is VALID [2022-04-08 04:44:10,355 INFO L290 TraceCheckUtils]: 2: Hoare triple {36#false} assume true; {36#false} is VALID [2022-04-08 04:44:10,356 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {36#false} {36#false} #63#return; {36#false} is VALID [2022-04-08 04:44:10,358 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-08 04:44:10,358 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-08 04:44:10,359 INFO L290 TraceCheckUtils]: 2: Hoare triple {35#true} assume true; {35#true} is VALID [2022-04-08 04:44:10,359 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35#true} {35#true} #69#return; {35#true} is VALID [2022-04-08 04:44:10,359 INFO L272 TraceCheckUtils]: 4: Hoare triple {35#true} call #t~ret8 := main(); {35#true} is VALID [2022-04-08 04:44:10,359 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-08 04:44:10,360 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-08 04:44:10,360 INFO L290 TraceCheckUtils]: 7: Hoare triple {35#true} ~cond := #in~cond; {35#true} is VALID [2022-04-08 04:44:10,361 INFO L290 TraceCheckUtils]: 8: Hoare triple {35#true} assume 0 == ~cond;assume false; {36#false} is VALID [2022-04-08 04:44:10,361 INFO L290 TraceCheckUtils]: 9: Hoare triple {36#false} assume true; {36#false} is VALID [2022-04-08 04:44:10,361 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {36#false} {35#true} #61#return; {36#false} is VALID [2022-04-08 04:44:10,361 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-08 04:44:10,362 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-08 04:44:10,362 INFO L290 TraceCheckUtils]: 13: Hoare triple {35#true} ~cond := #in~cond; {35#true} is VALID [2022-04-08 04:44:10,363 INFO L290 TraceCheckUtils]: 14: Hoare triple {35#true} assume 0 == ~cond;assume false; {36#false} is VALID [2022-04-08 04:44:10,363 INFO L290 TraceCheckUtils]: 15: Hoare triple {36#false} assume true; {36#false} is VALID [2022-04-08 04:44:10,364 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {36#false} {36#false} #63#return; {36#false} is VALID [2022-04-08 04:44:10,364 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-08 04:44:10,364 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-08 04:44:10,364 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-08 04:44:10,364 INFO L290 TraceCheckUtils]: 20: Hoare triple {36#false} ~cond := #in~cond; {36#false} is VALID [2022-04-08 04:44:10,365 INFO L290 TraceCheckUtils]: 21: Hoare triple {36#false} assume 0 == ~cond; {36#false} is VALID [2022-04-08 04:44:10,365 INFO L290 TraceCheckUtils]: 22: Hoare triple {36#false} assume !false; {36#false} is VALID [2022-04-08 04:44:10,365 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-08 04:44:10,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 04:44:10,366 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1041441230] [2022-04-08 04:44:10,367 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1041441230] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 04:44:10,367 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 04:44:10,367 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-08 04:44:10,369 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 04:44:10,369 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [902731167] [2022-04-08 04:44:10,370 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [902731167] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 04:44:10,370 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 04:44:10,370 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-08 04:44:10,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2053293090] [2022-04-08 04:44:10,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 04:44:10,378 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-08 04:44:10,379 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 04:44:10,382 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-08 04:44:10,417 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 04:44:10,418 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-08 04:44:10,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 04:44:10,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-08 04:44:10,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-08 04:44:10,448 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-08 04:44:10,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:44:10,612 INFO L93 Difference]: Finished difference Result 57 states and 74 transitions. [2022-04-08 04:44:10,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-08 04:44:10,612 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-08 04:44:10,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 04:44:10,614 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-08 04:44:10,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 74 transitions. [2022-04-08 04:44:10,628 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-08 04:44:10,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 74 transitions. [2022-04-08 04:44:10,634 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 74 transitions. [2022-04-08 04:44:10,747 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-08 04:44:10,755 INFO L225 Difference]: With dead ends: 57 [2022-04-08 04:44:10,756 INFO L226 Difference]: Without dead ends: 27 [2022-04-08 04:44:10,758 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-08 04:44:10,761 INFO L913 BasicCegarLoop]: 31 mSDtfsCounter, 20 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 04:44:10,761 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [24 Valid, 34 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 04:44:10,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-04-08 04:44:10,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2022-04-08 04:44:10,810 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 04:44:10,811 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-08 04:44:10,811 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-08 04:44:10,822 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-08 04:44:10,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:44:10,826 INFO L93 Difference]: Finished difference Result 27 states and 30 transitions. [2022-04-08 04:44:10,826 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2022-04-08 04:44:10,827 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:44:10,827 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:44:10,827 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-08 04:44:10,827 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-08 04:44:10,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:44:10,831 INFO L93 Difference]: Finished difference Result 27 states and 30 transitions. [2022-04-08 04:44:10,831 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2022-04-08 04:44:10,832 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:44:10,832 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:44:10,832 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 04:44:10,832 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 04:44:10,832 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-08 04:44:10,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 30 transitions. [2022-04-08 04:44:10,851 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 30 transitions. Word has length 23 [2022-04-08 04:44:10,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 04:44:10,851 INFO L478 AbstractCegarLoop]: Abstraction has 27 states and 30 transitions. [2022-04-08 04:44:10,852 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-08 04:44:10,852 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 27 states and 30 transitions. [2022-04-08 04:44:10,907 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 04:44:10,908 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2022-04-08 04:44:10,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-08 04:44:10,910 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 04:44:10,911 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 04:44:10,911 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-08 04:44:10,911 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 04:44:10,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 04:44:10,913 INFO L85 PathProgramCache]: Analyzing trace with hash 1827672217, now seen corresponding path program 1 times [2022-04-08 04:44:10,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 04:44:10,914 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1258989821] [2022-04-08 04:44:10,915 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 04:44:10,916 INFO L85 PathProgramCache]: Analyzing trace with hash 1827672217, now seen corresponding path program 2 times [2022-04-08 04:44:10,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 04:44:10,916 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1990208654] [2022-04-08 04:44:10,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 04:44:10,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 04:44:10,949 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 04:44:10,950 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2080451403] [2022-04-08 04:44:10,950 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 04:44:10,950 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 04:44:10,950 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 04:44:10,956 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 04:44:10,986 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-08 04:44:11,006 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-08 04:44:11,006 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 04:44:11,007 INFO L263 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-08 04:44:11,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:44:11,029 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 04:44:11,248 INFO L272 TraceCheckUtils]: 0: Hoare triple {273#true} call ULTIMATE.init(); {273#true} is VALID [2022-04-08 04:44:11,248 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-08 04:44:11,248 INFO L290 TraceCheckUtils]: 2: Hoare triple {273#true} assume true; {273#true} is VALID [2022-04-08 04:44:11,248 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {273#true} {273#true} #69#return; {273#true} is VALID [2022-04-08 04:44:11,249 INFO L272 TraceCheckUtils]: 4: Hoare triple {273#true} call #t~ret8 := main(); {273#true} is VALID [2022-04-08 04:44:11,249 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-08 04:44:11,249 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-08 04:44:11,249 INFO L290 TraceCheckUtils]: 7: Hoare triple {273#true} ~cond := #in~cond; {273#true} is VALID [2022-04-08 04:44:11,249 INFO L290 TraceCheckUtils]: 8: Hoare triple {273#true} assume !(0 == ~cond); {273#true} is VALID [2022-04-08 04:44:11,250 INFO L290 TraceCheckUtils]: 9: Hoare triple {273#true} assume true; {273#true} is VALID [2022-04-08 04:44:11,251 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {273#true} {273#true} #61#return; {273#true} is VALID [2022-04-08 04:44:11,251 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-08 04:44:11,251 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-08 04:44:11,251 INFO L290 TraceCheckUtils]: 13: Hoare triple {273#true} ~cond := #in~cond; {273#true} is VALID [2022-04-08 04:44:11,255 INFO L290 TraceCheckUtils]: 14: Hoare triple {273#true} assume !(0 == ~cond); {273#true} is VALID [2022-04-08 04:44:11,255 INFO L290 TraceCheckUtils]: 15: Hoare triple {273#true} assume true; {273#true} is VALID [2022-04-08 04:44:11,255 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {273#true} {273#true} #63#return; {273#true} is VALID [2022-04-08 04:44:11,257 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-08 04:44:11,258 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-08 04:44:11,259 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-08 04:44:11,259 INFO L290 TraceCheckUtils]: 20: Hoare triple {337#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {341#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 04:44:11,261 INFO L290 TraceCheckUtils]: 21: Hoare triple {341#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {274#false} is VALID [2022-04-08 04:44:11,262 INFO L290 TraceCheckUtils]: 22: Hoare triple {274#false} assume !false; {274#false} is VALID [2022-04-08 04:44:11,262 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-08 04:44:11,263 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-08 04:44:11,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 04:44:11,263 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1990208654] [2022-04-08 04:44:11,263 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 04:44:11,263 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2080451403] [2022-04-08 04:44:11,264 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2080451403] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 04:44:11,265 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 04:44:11,265 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 04:44:11,266 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 04:44:11,266 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1258989821] [2022-04-08 04:44:11,266 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1258989821] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 04:44:11,266 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 04:44:11,266 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 04:44:11,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [961895939] [2022-04-08 04:44:11,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 04:44:11,268 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-08 04:44:11,269 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 04:44:11,269 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-08 04:44:11,289 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 04:44:11,290 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-08 04:44:11,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 04:44:11,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-08 04:44:11,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-08 04:44:11,293 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-08 04:44:11,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:44:11,550 INFO L93 Difference]: Finished difference Result 39 states and 44 transitions. [2022-04-08 04:44:11,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-08 04:44:11,550 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-08 04:44:11,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 04:44:11,551 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-08 04:44:11,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 44 transitions. [2022-04-08 04:44:11,554 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-08 04:44:11,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 44 transitions. [2022-04-08 04:44:11,556 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 44 transitions. [2022-04-08 04:44:11,601 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-08 04:44:11,608 INFO L225 Difference]: With dead ends: 39 [2022-04-08 04:44:11,608 INFO L226 Difference]: Without dead ends: 35 [2022-04-08 04:44:11,609 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-04-08 04:44:11,612 INFO L913 BasicCegarLoop]: 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-08 04:44:11,616 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 91 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 04:44:11,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-04-08 04:44:11,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 34. [2022-04-08 04:44:11,631 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 04:44:11,631 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-08 04:44:11,632 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-08 04:44:11,632 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-08 04:44:11,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:44:11,635 INFO L93 Difference]: Finished difference Result 35 states and 39 transitions. [2022-04-08 04:44:11,635 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2022-04-08 04:44:11,636 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:44:11,636 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:44:11,636 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-08 04:44:11,636 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-08 04:44:11,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:44:11,641 INFO L93 Difference]: Finished difference Result 35 states and 39 transitions. [2022-04-08 04:44:11,641 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2022-04-08 04:44:11,641 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:44:11,641 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:44:11,642 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 04:44:11,642 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 04:44:11,642 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-08 04:44:11,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 37 transitions. [2022-04-08 04:44:11,644 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 37 transitions. Word has length 23 [2022-04-08 04:44:11,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 04:44:11,644 INFO L478 AbstractCegarLoop]: Abstraction has 34 states and 37 transitions. [2022-04-08 04:44:11,645 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-08 04:44:11,645 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 34 states and 37 transitions. [2022-04-08 04:44:11,685 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-08 04:44:11,685 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 37 transitions. [2022-04-08 04:44:11,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-08 04:44:11,689 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 04:44:11,689 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 04:44:11,718 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-08 04:44:11,907 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 04:44:11,908 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 04:44:11,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 04:44:11,909 INFO L85 PathProgramCache]: Analyzing trace with hash -1419291471, now seen corresponding path program 1 times [2022-04-08 04:44:11,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 04:44:11,909 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1015693313] [2022-04-08 04:44:11,909 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 04:44:11,910 INFO L85 PathProgramCache]: Analyzing trace with hash -1419291471, now seen corresponding path program 2 times [2022-04-08 04:44:11,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 04:44:11,910 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1459682821] [2022-04-08 04:44:11,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 04:44:11,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 04:44:11,937 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 04:44:11,938 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2123944051] [2022-04-08 04:44:11,938 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 04:44:11,938 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 04:44:11,938 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 04:44:11,942 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 04:44:11,971 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-08 04:44:11,995 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 04:44:11,995 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 04:44:11,996 INFO L263 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 24 conjunts are in the unsatisfiable core [2022-04-08 04:44:12,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:44:12,010 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 04:44:12,391 INFO L272 TraceCheckUtils]: 0: Hoare triple {567#true} call ULTIMATE.init(); {567#true} is VALID [2022-04-08 04:44:12,391 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-08 04:44:12,392 INFO L290 TraceCheckUtils]: 2: Hoare triple {567#true} assume true; {567#true} is VALID [2022-04-08 04:44:12,392 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {567#true} {567#true} #69#return; {567#true} is VALID [2022-04-08 04:44:12,392 INFO L272 TraceCheckUtils]: 4: Hoare triple {567#true} call #t~ret8 := main(); {567#true} is VALID [2022-04-08 04:44:12,392 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-08 04:44:12,392 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-08 04:44:12,393 INFO L290 TraceCheckUtils]: 7: Hoare triple {567#true} ~cond := #in~cond; {567#true} is VALID [2022-04-08 04:44:12,393 INFO L290 TraceCheckUtils]: 8: Hoare triple {567#true} assume !(0 == ~cond); {567#true} is VALID [2022-04-08 04:44:12,393 INFO L290 TraceCheckUtils]: 9: Hoare triple {567#true} assume true; {567#true} is VALID [2022-04-08 04:44:12,393 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {567#true} {567#true} #61#return; {567#true} is VALID [2022-04-08 04:44:12,393 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-08 04:44:12,394 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-08 04:44:12,394 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-08 04:44:12,395 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-08 04:44:12,395 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-08 04:44:12,396 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-08 04:44:12,396 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-08 04:44:12,397 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-08 04:44:12,397 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-08 04:44:12,397 INFO L290 TraceCheckUtils]: 20: Hoare triple {567#true} ~cond := #in~cond; {567#true} is VALID [2022-04-08 04:44:12,398 INFO L290 TraceCheckUtils]: 21: Hoare triple {567#true} assume !(0 == ~cond); {567#true} is VALID [2022-04-08 04:44:12,398 INFO L290 TraceCheckUtils]: 22: Hoare triple {567#true} assume true; {567#true} is VALID [2022-04-08 04:44:12,399 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-08 04:44:12,399 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-08 04:44:12,400 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-08 04:44:12,401 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-08 04:44:12,402 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-08 04:44:12,403 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-08 04:44:12,403 INFO L290 TraceCheckUtils]: 29: Hoare triple {663#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {667#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 04:44:12,404 INFO L290 TraceCheckUtils]: 30: Hoare triple {667#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {568#false} is VALID [2022-04-08 04:44:12,404 INFO L290 TraceCheckUtils]: 31: Hoare triple {568#false} assume !false; {568#false} is VALID [2022-04-08 04:44:12,404 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-08 04:44:12,404 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 04:44:12,679 INFO L290 TraceCheckUtils]: 31: Hoare triple {568#false} assume !false; {568#false} is VALID [2022-04-08 04:44:12,679 INFO L290 TraceCheckUtils]: 30: Hoare triple {667#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {568#false} is VALID [2022-04-08 04:44:12,680 INFO L290 TraceCheckUtils]: 29: Hoare triple {663#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {667#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 04:44:12,681 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-08 04:44:12,682 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-08 04:44:12,683 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-08 04:44:12,684 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-08 04:44:12,687 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-08 04:44:12,688 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-08 04:44:12,688 INFO L290 TraceCheckUtils]: 22: Hoare triple {567#true} assume true; {567#true} is VALID [2022-04-08 04:44:12,688 INFO L290 TraceCheckUtils]: 21: Hoare triple {567#true} assume !(0 == ~cond); {567#true} is VALID [2022-04-08 04:44:12,688 INFO L290 TraceCheckUtils]: 20: Hoare triple {567#true} ~cond := #in~cond; {567#true} is VALID [2022-04-08 04:44:12,691 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-08 04:44:12,692 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-08 04:44:12,692 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-08 04:44:12,692 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {567#true} {567#true} #63#return; {567#true} is VALID [2022-04-08 04:44:12,693 INFO L290 TraceCheckUtils]: 15: Hoare triple {567#true} assume true; {567#true} is VALID [2022-04-08 04:44:12,693 INFO L290 TraceCheckUtils]: 14: Hoare triple {567#true} assume !(0 == ~cond); {567#true} is VALID [2022-04-08 04:44:12,693 INFO L290 TraceCheckUtils]: 13: Hoare triple {567#true} ~cond := #in~cond; {567#true} is VALID [2022-04-08 04:44:12,693 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-08 04:44:12,693 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-08 04:44:12,694 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {567#true} {567#true} #61#return; {567#true} is VALID [2022-04-08 04:44:12,694 INFO L290 TraceCheckUtils]: 9: Hoare triple {567#true} assume true; {567#true} is VALID [2022-04-08 04:44:12,694 INFO L290 TraceCheckUtils]: 8: Hoare triple {567#true} assume !(0 == ~cond); {567#true} is VALID [2022-04-08 04:44:12,694 INFO L290 TraceCheckUtils]: 7: Hoare triple {567#true} ~cond := #in~cond; {567#true} is VALID [2022-04-08 04:44:12,695 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-08 04:44:12,695 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-08 04:44:12,695 INFO L272 TraceCheckUtils]: 4: Hoare triple {567#true} call #t~ret8 := main(); {567#true} is VALID [2022-04-08 04:44:12,697 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {567#true} {567#true} #69#return; {567#true} is VALID [2022-04-08 04:44:12,697 INFO L290 TraceCheckUtils]: 2: Hoare triple {567#true} assume true; {567#true} is VALID [2022-04-08 04:44:12,707 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-08 04:44:12,707 INFO L272 TraceCheckUtils]: 0: Hoare triple {567#true} call ULTIMATE.init(); {567#true} is VALID [2022-04-08 04:44:12,708 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-08 04:44:12,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 04:44:12,708 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1459682821] [2022-04-08 04:44:12,708 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 04:44:12,708 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2123944051] [2022-04-08 04:44:12,708 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2123944051] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 04:44:12,709 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 04:44:12,709 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7] total 14 [2022-04-08 04:44:12,709 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 04:44:12,709 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1015693313] [2022-04-08 04:44:12,709 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1015693313] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 04:44:12,709 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 04:44:12,709 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-08 04:44:12,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1228470181] [2022-04-08 04:44:12,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 04:44:12,710 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-08 04:44:12,711 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 04:44:12,711 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-08 04:44:12,745 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-08 04:44:12,745 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-08 04:44:12,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 04:44:12,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-08 04:44:12,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2022-04-08 04:44:12,747 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-08 04:44:13,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:44:13,340 INFO L93 Difference]: Finished difference Result 48 states and 54 transitions. [2022-04-08 04:44:13,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-08 04:44:13,340 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-08 04:44:13,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 04:44:13,341 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-08 04:44:13,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 51 transitions. [2022-04-08 04:44:13,344 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-08 04:44:13,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 51 transitions. [2022-04-08 04:44:13,346 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 51 transitions. [2022-04-08 04:44:13,395 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-08 04:44:13,397 INFO L225 Difference]: With dead ends: 48 [2022-04-08 04:44:13,397 INFO L226 Difference]: Without dead ends: 44 [2022-04-08 04:44:13,398 INFO L912 BasicCegarLoop]: 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-08 04:44:13,399 INFO L913 BasicCegarLoop]: 22 mSDtfsCounter, 22 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 211 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 222 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 211 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-08 04:44:13,399 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [23 Valid, 150 Invalid, 222 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 211 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-08 04:44:13,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-04-08 04:44:13,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 43. [2022-04-08 04:44:13,438 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 04:44:13,439 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-08 04:44:13,439 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-08 04:44:13,440 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-08 04:44:13,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:44:13,451 INFO L93 Difference]: Finished difference Result 44 states and 49 transitions. [2022-04-08 04:44:13,451 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 49 transitions. [2022-04-08 04:44:13,454 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:44:13,454 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:44:13,455 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-08 04:44:13,455 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-08 04:44:13,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:44:13,457 INFO L93 Difference]: Finished difference Result 44 states and 49 transitions. [2022-04-08 04:44:13,457 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 49 transitions. [2022-04-08 04:44:13,458 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:44:13,458 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:44:13,458 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 04:44:13,458 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 04:44:13,458 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-08 04:44:13,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 47 transitions. [2022-04-08 04:44:13,460 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 47 transitions. Word has length 32 [2022-04-08 04:44:13,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 04:44:13,461 INFO L478 AbstractCegarLoop]: Abstraction has 43 states and 47 transitions. [2022-04-08 04:44:13,461 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.2) internal successors, (22), 9 states have internal predecessors, (22), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-08 04:44:13,461 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 43 states and 47 transitions. [2022-04-08 04:44:13,516 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-08 04:44:13,517 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2022-04-08 04:44:13,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-08 04:44:13,520 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 04:44:13,520 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 04:44:13,546 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-08 04:44:13,733 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-04-08 04:44:13,734 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 04:44:13,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 04:44:13,734 INFO L85 PathProgramCache]: Analyzing trace with hash 355715891, now seen corresponding path program 1 times [2022-04-08 04:44:13,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 04:44:13,735 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [253005232] [2022-04-08 04:44:13,735 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 04:44:13,735 INFO L85 PathProgramCache]: Analyzing trace with hash 355715891, now seen corresponding path program 2 times [2022-04-08 04:44:13,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 04:44:13,735 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1380276618] [2022-04-08 04:44:13,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 04:44:13,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 04:44:13,750 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 04:44:13,751 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1022072462] [2022-04-08 04:44:13,751 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 04:44:13,751 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 04:44:13,751 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 04:44:13,752 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 04:44:13,761 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-08 04:44:13,803 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 04:44:13,803 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 04:44:13,804 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 24 conjunts are in the unsatisfiable core [2022-04-08 04:44:13,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:44:13,820 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 04:44:14,065 INFO L272 TraceCheckUtils]: 0: Hoare triple {1048#true} call ULTIMATE.init(); {1048#true} is VALID [2022-04-08 04:44:14,065 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-08 04:44:14,066 INFO L290 TraceCheckUtils]: 2: Hoare triple {1048#true} assume true; {1048#true} is VALID [2022-04-08 04:44:14,066 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1048#true} {1048#true} #69#return; {1048#true} is VALID [2022-04-08 04:44:14,066 INFO L272 TraceCheckUtils]: 4: Hoare triple {1048#true} call #t~ret8 := main(); {1048#true} is VALID [2022-04-08 04:44:14,066 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-08 04:44:14,066 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-08 04:44:14,066 INFO L290 TraceCheckUtils]: 7: Hoare triple {1048#true} ~cond := #in~cond; {1048#true} is VALID [2022-04-08 04:44:14,067 INFO L290 TraceCheckUtils]: 8: Hoare triple {1048#true} assume !(0 == ~cond); {1048#true} is VALID [2022-04-08 04:44:14,067 INFO L290 TraceCheckUtils]: 9: Hoare triple {1048#true} assume true; {1048#true} is VALID [2022-04-08 04:44:14,067 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1048#true} {1048#true} #61#return; {1048#true} is VALID [2022-04-08 04:44:14,067 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-08 04:44:14,067 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-08 04:44:14,067 INFO L290 TraceCheckUtils]: 13: Hoare triple {1048#true} ~cond := #in~cond; {1048#true} is VALID [2022-04-08 04:44:14,067 INFO L290 TraceCheckUtils]: 14: Hoare triple {1048#true} assume !(0 == ~cond); {1048#true} is VALID [2022-04-08 04:44:14,068 INFO L290 TraceCheckUtils]: 15: Hoare triple {1048#true} assume true; {1048#true} is VALID [2022-04-08 04:44:14,068 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {1048#true} {1048#true} #63#return; {1048#true} is VALID [2022-04-08 04:44:14,068 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-08 04:44:14,069 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-08 04:44:14,069 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-08 04:44:14,069 INFO L290 TraceCheckUtils]: 20: Hoare triple {1048#true} ~cond := #in~cond; {1048#true} is VALID [2022-04-08 04:44:14,069 INFO L290 TraceCheckUtils]: 21: Hoare triple {1048#true} assume !(0 == ~cond); {1048#true} is VALID [2022-04-08 04:44:14,070 INFO L290 TraceCheckUtils]: 22: Hoare triple {1048#true} assume true; {1048#true} is VALID [2022-04-08 04:44:14,070 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-08 04:44:14,071 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-08 04:44:14,072 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-08 04:44:14,072 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-08 04:44:14,073 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-08 04:44:14,074 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-08 04:44:14,074 INFO L290 TraceCheckUtils]: 29: Hoare triple {1142#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1146#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 04:44:14,075 INFO L290 TraceCheckUtils]: 30: Hoare triple {1146#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1049#false} is VALID [2022-04-08 04:44:14,075 INFO L290 TraceCheckUtils]: 31: Hoare triple {1049#false} assume !false; {1049#false} is VALID [2022-04-08 04:44:14,075 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-08 04:44:14,075 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 04:44:14,307 INFO L290 TraceCheckUtils]: 31: Hoare triple {1049#false} assume !false; {1049#false} is VALID [2022-04-08 04:44:14,307 INFO L290 TraceCheckUtils]: 30: Hoare triple {1146#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1049#false} is VALID [2022-04-08 04:44:14,308 INFO L290 TraceCheckUtils]: 29: Hoare triple {1142#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1146#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 04:44:14,309 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-08 04:44:14,309 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-08 04:44:14,434 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-08 04:44:14,440 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-08 04:44:14,441 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-08 04:44:14,442 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-08 04:44:14,442 INFO L290 TraceCheckUtils]: 22: Hoare triple {1048#true} assume true; {1048#true} is VALID [2022-04-08 04:44:14,442 INFO L290 TraceCheckUtils]: 21: Hoare triple {1048#true} assume !(0 == ~cond); {1048#true} is VALID [2022-04-08 04:44:14,442 INFO L290 TraceCheckUtils]: 20: Hoare triple {1048#true} ~cond := #in~cond; {1048#true} is VALID [2022-04-08 04:44:14,442 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-08 04:44:14,443 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-08 04:44:14,443 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-08 04:44:14,444 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {1048#true} {1048#true} #63#return; {1048#true} is VALID [2022-04-08 04:44:14,444 INFO L290 TraceCheckUtils]: 15: Hoare triple {1048#true} assume true; {1048#true} is VALID [2022-04-08 04:44:14,444 INFO L290 TraceCheckUtils]: 14: Hoare triple {1048#true} assume !(0 == ~cond); {1048#true} is VALID [2022-04-08 04:44:14,444 INFO L290 TraceCheckUtils]: 13: Hoare triple {1048#true} ~cond := #in~cond; {1048#true} is VALID [2022-04-08 04:44:14,444 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-08 04:44:14,444 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-08 04:44:14,445 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1048#true} {1048#true} #61#return; {1048#true} is VALID [2022-04-08 04:44:14,445 INFO L290 TraceCheckUtils]: 9: Hoare triple {1048#true} assume true; {1048#true} is VALID [2022-04-08 04:44:14,445 INFO L290 TraceCheckUtils]: 8: Hoare triple {1048#true} assume !(0 == ~cond); {1048#true} is VALID [2022-04-08 04:44:14,445 INFO L290 TraceCheckUtils]: 7: Hoare triple {1048#true} ~cond := #in~cond; {1048#true} is VALID [2022-04-08 04:44:14,445 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-08 04:44:14,445 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-08 04:44:14,446 INFO L272 TraceCheckUtils]: 4: Hoare triple {1048#true} call #t~ret8 := main(); {1048#true} is VALID [2022-04-08 04:44:14,446 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1048#true} {1048#true} #69#return; {1048#true} is VALID [2022-04-08 04:44:14,446 INFO L290 TraceCheckUtils]: 2: Hoare triple {1048#true} assume true; {1048#true} is VALID [2022-04-08 04:44:14,446 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-08 04:44:14,446 INFO L272 TraceCheckUtils]: 0: Hoare triple {1048#true} call ULTIMATE.init(); {1048#true} is VALID [2022-04-08 04:44:14,446 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-08 04:44:14,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 04:44:14,447 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1380276618] [2022-04-08 04:44:14,447 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 04:44:14,447 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1022072462] [2022-04-08 04:44:14,447 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1022072462] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 04:44:14,447 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 04:44:14,448 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 13 [2022-04-08 04:44:14,448 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 04:44:14,448 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [253005232] [2022-04-08 04:44:14,448 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [253005232] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 04:44:14,448 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 04:44:14,448 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-08 04:44:14,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1746840114] [2022-04-08 04:44:14,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 04:44:14,449 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-08 04:44:14,449 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 04:44:14,450 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-08 04:44:14,478 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-08 04:44:14,478 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-08 04:44:14,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 04:44:14,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-08 04:44:14,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2022-04-08 04:44:14,479 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-08 04:44:14,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:44:14,893 INFO L93 Difference]: Finished difference Result 56 states and 62 transitions. [2022-04-08 04:44:14,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-08 04:44:14,894 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-08 04:44:14,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 04:44:14,894 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-08 04:44:14,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 51 transitions. [2022-04-08 04:44:14,896 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-08 04:44:14,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 51 transitions. [2022-04-08 04:44:14,898 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 51 transitions. [2022-04-08 04:44:14,941 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-08 04:44:14,943 INFO L225 Difference]: With dead ends: 56 [2022-04-08 04:44:14,943 INFO L226 Difference]: Without dead ends: 54 [2022-04-08 04:44:14,943 INFO L912 BasicCegarLoop]: 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-08 04:44:14,944 INFO L913 BasicCegarLoop]: 27 mSDtfsCounter, 11 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 04:44:14,945 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 138 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 04:44:14,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2022-04-08 04:44:14,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 50. [2022-04-08 04:44:14,987 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 04:44:14,988 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-08 04:44:14,988 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-08 04:44:14,989 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-08 04:44:14,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:44:14,991 INFO L93 Difference]: Finished difference Result 54 states and 60 transitions. [2022-04-08 04:44:14,991 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 60 transitions. [2022-04-08 04:44:14,992 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:44:14,992 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:44:14,992 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-08 04:44:14,992 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-08 04:44:14,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:44:14,995 INFO L93 Difference]: Finished difference Result 54 states and 60 transitions. [2022-04-08 04:44:14,995 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 60 transitions. [2022-04-08 04:44:14,995 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:44:14,995 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:44:14,995 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 04:44:14,995 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 04:44:14,996 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-08 04:44:14,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 54 transitions. [2022-04-08 04:44:14,998 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 54 transitions. Word has length 32 [2022-04-08 04:44:14,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 04:44:14,998 INFO L478 AbstractCegarLoop]: Abstraction has 50 states and 54 transitions. [2022-04-08 04:44:14,998 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.375) internal successors, (19), 8 states have internal predecessors, (19), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-08 04:44:14,999 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 50 states and 54 transitions. [2022-04-08 04:44:15,059 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-08 04:44:15,060 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2022-04-08 04:44:15,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-04-08 04:44:15,061 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 04:44:15,061 INFO L499 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 04:44:15,086 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-08 04:44:15,283 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 04:44:15,284 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 04:44:15,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 04:44:15,284 INFO L85 PathProgramCache]: Analyzing trace with hash 125050924, now seen corresponding path program 1 times [2022-04-08 04:44:15,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 04:44:15,284 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [303689012] [2022-04-08 04:44:15,285 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 04:44:15,285 INFO L85 PathProgramCache]: Analyzing trace with hash 125050924, now seen corresponding path program 2 times [2022-04-08 04:44:15,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 04:44:15,285 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [195026811] [2022-04-08 04:44:15,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 04:44:15,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 04:44:15,299 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 04:44:15,299 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1929108514] [2022-04-08 04:44:15,299 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 04:44:15,300 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 04:44:15,300 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 04:44:15,301 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 04:44:15,325 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-04-08 04:44:15,353 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 04:44:15,353 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 04:44:15,354 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 30 conjunts are in the unsatisfiable core [2022-04-08 04:44:15,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:44:15,373 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 04:44:32,635 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-08 04:44:40,968 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-08 04:44:45,189 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-08 04:44:56,860 INFO L272 TraceCheckUtils]: 0: Hoare triple {1576#true} call ULTIMATE.init(); {1576#true} is VALID [2022-04-08 04:44:56,861 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-08 04:44:56,861 INFO L290 TraceCheckUtils]: 2: Hoare triple {1576#true} assume true; {1576#true} is VALID [2022-04-08 04:44:56,861 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1576#true} {1576#true} #69#return; {1576#true} is VALID [2022-04-08 04:44:56,861 INFO L272 TraceCheckUtils]: 4: Hoare triple {1576#true} call #t~ret8 := main(); {1576#true} is VALID [2022-04-08 04:44:56,861 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-08 04:44:56,862 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-08 04:44:56,862 INFO L290 TraceCheckUtils]: 7: Hoare triple {1576#true} ~cond := #in~cond; {1576#true} is VALID [2022-04-08 04:44:56,862 INFO L290 TraceCheckUtils]: 8: Hoare triple {1576#true} assume !(0 == ~cond); {1576#true} is VALID [2022-04-08 04:44:56,862 INFO L290 TraceCheckUtils]: 9: Hoare triple {1576#true} assume true; {1576#true} is VALID [2022-04-08 04:44:56,862 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1576#true} {1576#true} #61#return; {1576#true} is VALID [2022-04-08 04:44:56,864 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-08 04:44:56,864 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-08 04:44:56,868 INFO L290 TraceCheckUtils]: 13: Hoare triple {1576#true} ~cond := #in~cond; {1576#true} is VALID [2022-04-08 04:44:56,868 INFO L290 TraceCheckUtils]: 14: Hoare triple {1576#true} assume !(0 == ~cond); {1576#true} is VALID [2022-04-08 04:44:56,868 INFO L290 TraceCheckUtils]: 15: Hoare triple {1576#true} assume true; {1576#true} is VALID [2022-04-08 04:44:56,869 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {1576#true} {1576#true} #63#return; {1576#true} is VALID [2022-04-08 04:44:56,869 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-08 04:44:56,870 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-08 04:44:56,897 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-08 04:44:56,898 INFO L290 TraceCheckUtils]: 20: Hoare triple {1576#true} ~cond := #in~cond; {1642#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 04:44:56,898 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-08 04:44:56,899 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-08 04:44:56,900 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-08 04:44:56,900 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-08 04:44:56,901 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-08 04:44:56,901 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-08 04:44:56,902 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-08 04:44:56,902 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-08 04:44:56,903 INFO L290 TraceCheckUtils]: 29: Hoare triple {1576#true} ~cond := #in~cond; {1642#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 04:44:56,903 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-08 04:44:56,903 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-08 04:44:56,905 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-08 04:44:56,906 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-08 04:44:56,914 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-08 04:44:56,917 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-08 04:44:56,917 INFO L290 TraceCheckUtils]: 36: Hoare triple {1696#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1700#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 04:44:56,918 INFO L290 TraceCheckUtils]: 37: Hoare triple {1700#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1577#false} is VALID [2022-04-08 04:44:56,918 INFO L290 TraceCheckUtils]: 38: Hoare triple {1577#false} assume !false; {1577#false} is VALID [2022-04-08 04:44:56,919 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-08 04:44:56,919 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 04:45:04,164 INFO L290 TraceCheckUtils]: 38: Hoare triple {1577#false} assume !false; {1577#false} is VALID [2022-04-08 04:45:04,164 INFO L290 TraceCheckUtils]: 37: Hoare triple {1700#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1577#false} is VALID [2022-04-08 04:45:04,165 INFO L290 TraceCheckUtils]: 36: Hoare triple {1696#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1700#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 04:45:04,166 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-08 04:45:04,167 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-08 04:45:04,167 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-08 04:45:04,169 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-08 04:45:04,169 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-08 04:45:04,170 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-08 04:45:04,171 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-08 04:45:04,171 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-08 04:45:04,172 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-08 04:45:04,173 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-08 04:45:04,176 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-08 04:45:04,178 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-08 04:45:04,179 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {1576#true} {1576#true} #65#return; {1576#true} is VALID [2022-04-08 04:45:04,179 INFO L290 TraceCheckUtils]: 22: Hoare triple {1576#true} assume true; {1576#true} is VALID [2022-04-08 04:45:04,179 INFO L290 TraceCheckUtils]: 21: Hoare triple {1576#true} assume !(0 == ~cond); {1576#true} is VALID [2022-04-08 04:45:04,179 INFO L290 TraceCheckUtils]: 20: Hoare triple {1576#true} ~cond := #in~cond; {1576#true} is VALID [2022-04-08 04:45:04,180 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-08 04:45:04,180 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-08 04:45:04,180 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-08 04:45:04,185 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {1576#true} {1576#true} #63#return; {1576#true} is VALID [2022-04-08 04:45:04,186 INFO L290 TraceCheckUtils]: 15: Hoare triple {1576#true} assume true; {1576#true} is VALID [2022-04-08 04:45:04,193 INFO L290 TraceCheckUtils]: 14: Hoare triple {1576#true} assume !(0 == ~cond); {1576#true} is VALID [2022-04-08 04:45:04,193 INFO L290 TraceCheckUtils]: 13: Hoare triple {1576#true} ~cond := #in~cond; {1576#true} is VALID [2022-04-08 04:45:04,193 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-08 04:45:04,193 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-08 04:45:04,193 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1576#true} {1576#true} #61#return; {1576#true} is VALID [2022-04-08 04:45:04,194 INFO L290 TraceCheckUtils]: 9: Hoare triple {1576#true} assume true; {1576#true} is VALID [2022-04-08 04:45:04,194 INFO L290 TraceCheckUtils]: 8: Hoare triple {1576#true} assume !(0 == ~cond); {1576#true} is VALID [2022-04-08 04:45:04,194 INFO L290 TraceCheckUtils]: 7: Hoare triple {1576#true} ~cond := #in~cond; {1576#true} is VALID [2022-04-08 04:45:04,194 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-08 04:45:04,194 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-08 04:45:04,194 INFO L272 TraceCheckUtils]: 4: Hoare triple {1576#true} call #t~ret8 := main(); {1576#true} is VALID [2022-04-08 04:45:04,194 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1576#true} {1576#true} #69#return; {1576#true} is VALID [2022-04-08 04:45:04,194 INFO L290 TraceCheckUtils]: 2: Hoare triple {1576#true} assume true; {1576#true} is VALID [2022-04-08 04:45:04,194 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-08 04:45:04,195 INFO L272 TraceCheckUtils]: 0: Hoare triple {1576#true} call ULTIMATE.init(); {1576#true} is VALID [2022-04-08 04:45:04,195 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-08 04:45:04,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 04:45:04,195 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [195026811] [2022-04-08 04:45:04,195 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 04:45:04,195 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1929108514] [2022-04-08 04:45:04,196 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1929108514] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 04:45:04,196 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 04:45:04,196 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 22 [2022-04-08 04:45:04,196 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 04:45:04,196 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [303689012] [2022-04-08 04:45:04,196 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [303689012] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 04:45:04,196 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 04:45:04,196 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-08 04:45:04,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1688865109] [2022-04-08 04:45:04,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 04:45:04,197 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-08 04:45:04,197 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 04:45:04,197 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-08 04:45:04,246 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 04:45:04,246 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-08 04:45:04,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 04:45:04,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-08 04:45:04,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=388, Unknown=0, NotChecked=0, Total=462 [2022-04-08 04:45:04,247 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-08 04:45:06,912 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-08 04:45:09,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:45:09,568 INFO L93 Difference]: Finished difference Result 61 states and 66 transitions. [2022-04-08 04:45:09,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-08 04:45:09,568 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-08 04:45:09,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 04:45:09,569 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-08 04:45:09,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 53 transitions. [2022-04-08 04:45:09,576 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-08 04:45:09,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 53 transitions. [2022-04-08 04:45:09,578 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 53 transitions. [2022-04-08 04:45:09,640 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 04:45:09,641 INFO L225 Difference]: With dead ends: 61 [2022-04-08 04:45:09,641 INFO L226 Difference]: Without dead ends: 53 [2022-04-08 04:45:09,642 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 56 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 131 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=116, Invalid=586, Unknown=0, NotChecked=0, Total=702 [2022-04-08 04:45:09,643 INFO L913 BasicCegarLoop]: 23 mSDtfsCounter, 16 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 294 mSolverCounterSat, 4 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.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, 294 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-04-08 04:45:09,643 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [17 Valid, 219 Invalid, 299 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 294 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-04-08 04:45:09,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-04-08 04:45:09,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 43. [2022-04-08 04:45:09,685 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 04:45:09,686 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-08 04:45:09,687 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-08 04:45:09,687 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-08 04:45:09,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:45:09,689 INFO L93 Difference]: Finished difference Result 53 states and 58 transitions. [2022-04-08 04:45:09,690 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 58 transitions. [2022-04-08 04:45:09,690 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:45:09,690 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:45:09,690 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-08 04:45:09,690 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-08 04:45:09,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:45:09,697 INFO L93 Difference]: Finished difference Result 53 states and 58 transitions. [2022-04-08 04:45:09,697 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 58 transitions. [2022-04-08 04:45:09,697 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:45:09,697 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:45:09,697 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 04:45:09,697 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 04:45:09,698 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-08 04:45:09,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 47 transitions. [2022-04-08 04:45:09,699 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 47 transitions. Word has length 39 [2022-04-08 04:45:09,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 04:45:09,700 INFO L478 AbstractCegarLoop]: Abstraction has 43 states and 47 transitions. [2022-04-08 04:45:09,700 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 1.75) internal successors, (21), 12 states have internal predecessors, (21), 4 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-08 04:45:09,700 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 43 states and 47 transitions. [2022-04-08 04:45:09,765 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-08 04:45:09,766 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2022-04-08 04:45:09,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-04-08 04:45:09,766 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 04:45:09,766 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 04:45:09,790 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-04-08 04:45:09,975 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 04:45:09,975 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 04:45:09,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 04:45:09,976 INFO L85 PathProgramCache]: Analyzing trace with hash 733948825, now seen corresponding path program 3 times [2022-04-08 04:45:09,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 04:45:09,976 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [821769250] [2022-04-08 04:45:09,976 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 04:45:09,976 INFO L85 PathProgramCache]: Analyzing trace with hash 733948825, now seen corresponding path program 4 times [2022-04-08 04:45:09,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 04:45:09,977 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [206574397] [2022-04-08 04:45:09,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 04:45:09,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 04:45:09,999 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 04:45:09,999 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1552881212] [2022-04-08 04:45:09,999 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 04:45:10,000 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 04:45:10,000 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 04:45:10,002 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 04:45:10,003 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-04-08 04:45:10,045 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 04:45:10,045 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 04:45:10,046 INFO L263 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 40 conjunts are in the unsatisfiable core [2022-04-08 04:45:10,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:45:10,062 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 04:45:26,796 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-08 04:45:32,811 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-08 04:45:34,125 INFO L272 TraceCheckUtils]: 0: Hoare triple {2155#true} call ULTIMATE.init(); {2155#true} is VALID [2022-04-08 04:45:34,126 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-08 04:45:34,126 INFO L290 TraceCheckUtils]: 2: Hoare triple {2155#true} assume true; {2155#true} is VALID [2022-04-08 04:45:34,126 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2155#true} {2155#true} #69#return; {2155#true} is VALID [2022-04-08 04:45:34,126 INFO L272 TraceCheckUtils]: 4: Hoare triple {2155#true} call #t~ret8 := main(); {2155#true} is VALID [2022-04-08 04:45:34,126 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-08 04:45:34,126 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-08 04:45:34,127 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-08 04:45:34,127 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-08 04:45:34,128 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-08 04:45:34,128 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-08 04:45:34,129 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-08 04:45:34,129 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-08 04:45:34,129 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-08 04:45:34,130 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-08 04:45:34,130 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-08 04:45:34,131 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-08 04:45:34,131 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-08 04:45:34,132 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-08 04:45:34,132 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-08 04:45:34,132 INFO L290 TraceCheckUtils]: 20: Hoare triple {2155#true} ~cond := #in~cond; {2155#true} is VALID [2022-04-08 04:45:34,132 INFO L290 TraceCheckUtils]: 21: Hoare triple {2155#true} assume !(0 == ~cond); {2155#true} is VALID [2022-04-08 04:45:34,133 INFO L290 TraceCheckUtils]: 22: Hoare triple {2155#true} assume true; {2155#true} is VALID [2022-04-08 04:45:34,133 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-08 04:45:34,134 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-08 04:45:34,135 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-08 04:45:34,136 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-08 04:45:34,136 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-08 04:45:34,136 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-08 04:45:34,137 INFO L290 TraceCheckUtils]: 29: Hoare triple {2155#true} ~cond := #in~cond; {2255#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 04:45:34,137 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-08 04:45:34,138 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-08 04:45:34,140 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-08 04:45:34,141 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-08 04:45:34,142 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-08 04:45:34,144 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-08 04:45:34,147 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-08 04:45:34,151 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-08 04:45:34,151 INFO L290 TraceCheckUtils]: 38: Hoare triple {2285#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2289#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 04:45:34,152 INFO L290 TraceCheckUtils]: 39: Hoare triple {2289#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2156#false} is VALID [2022-04-08 04:45:34,152 INFO L290 TraceCheckUtils]: 40: Hoare triple {2156#false} assume !false; {2156#false} is VALID [2022-04-08 04:45:34,152 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-08 04:45:34,152 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 04:45:40,923 INFO L290 TraceCheckUtils]: 40: Hoare triple {2156#false} assume !false; {2156#false} is VALID [2022-04-08 04:45:40,924 INFO L290 TraceCheckUtils]: 39: Hoare triple {2289#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2156#false} is VALID [2022-04-08 04:45:40,924 INFO L290 TraceCheckUtils]: 38: Hoare triple {2285#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2289#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 04:45:40,928 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-08 04:45:40,929 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-08 04:45:40,945 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-08 04:45:40,946 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-08 04:45:40,946 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-08 04:45:40,948 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-08 04:45:40,949 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-08 04:45:40,949 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-08 04:45:40,950 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-08 04:45:40,950 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-08 04:45:40,950 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-08 04:45:40,951 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-08 04:45:40,951 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-08 04:45:40,951 INFO L290 TraceCheckUtils]: 24: Hoare triple {2155#true} assume !!(~x~0 <= ~X~0); {2155#true} is VALID [2022-04-08 04:45:40,951 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {2155#true} {2155#true} #65#return; {2155#true} is VALID [2022-04-08 04:45:40,951 INFO L290 TraceCheckUtils]: 22: Hoare triple {2155#true} assume true; {2155#true} is VALID [2022-04-08 04:45:40,951 INFO L290 TraceCheckUtils]: 21: Hoare triple {2155#true} assume !(0 == ~cond); {2155#true} is VALID [2022-04-08 04:45:40,951 INFO L290 TraceCheckUtils]: 20: Hoare triple {2155#true} ~cond := #in~cond; {2155#true} is VALID [2022-04-08 04:45:40,951 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-08 04:45:40,951 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-08 04:45:40,951 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-08 04:45:40,952 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {2155#true} {2155#true} #63#return; {2155#true} is VALID [2022-04-08 04:45:40,952 INFO L290 TraceCheckUtils]: 15: Hoare triple {2155#true} assume true; {2155#true} is VALID [2022-04-08 04:45:40,952 INFO L290 TraceCheckUtils]: 14: Hoare triple {2155#true} assume !(0 == ~cond); {2155#true} is VALID [2022-04-08 04:45:40,952 INFO L290 TraceCheckUtils]: 13: Hoare triple {2155#true} ~cond := #in~cond; {2155#true} is VALID [2022-04-08 04:45:40,952 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-08 04:45:40,952 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-08 04:45:40,952 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2155#true} {2155#true} #61#return; {2155#true} is VALID [2022-04-08 04:45:40,952 INFO L290 TraceCheckUtils]: 9: Hoare triple {2155#true} assume true; {2155#true} is VALID [2022-04-08 04:45:40,952 INFO L290 TraceCheckUtils]: 8: Hoare triple {2155#true} assume !(0 == ~cond); {2155#true} is VALID [2022-04-08 04:45:40,952 INFO L290 TraceCheckUtils]: 7: Hoare triple {2155#true} ~cond := #in~cond; {2155#true} is VALID [2022-04-08 04:45:40,952 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-08 04:45:40,952 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-08 04:45:40,953 INFO L272 TraceCheckUtils]: 4: Hoare triple {2155#true} call #t~ret8 := main(); {2155#true} is VALID [2022-04-08 04:45:40,953 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2155#true} {2155#true} #69#return; {2155#true} is VALID [2022-04-08 04:45:40,953 INFO L290 TraceCheckUtils]: 2: Hoare triple {2155#true} assume true; {2155#true} is VALID [2022-04-08 04:45:40,953 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-08 04:45:40,953 INFO L272 TraceCheckUtils]: 0: Hoare triple {2155#true} call ULTIMATE.init(); {2155#true} is VALID [2022-04-08 04:45:40,953 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-08 04:45:40,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 04:45:40,953 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [206574397] [2022-04-08 04:45:40,953 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 04:45:40,954 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1552881212] [2022-04-08 04:45:40,954 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1552881212] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 04:45:40,954 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 04:45:40,954 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 11] total 24 [2022-04-08 04:45:40,954 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 04:45:40,954 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [821769250] [2022-04-08 04:45:40,954 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [821769250] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 04:45:40,954 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 04:45:40,954 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-04-08 04:45:40,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [365644941] [2022-04-08 04:45:40,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 04:45:40,955 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-08 04:45:40,955 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 04:45:40,956 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-08 04:45:41,002 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-08 04:45:41,003 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-04-08 04:45:41,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 04:45:41,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-04-08 04:45:41,004 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=466, Unknown=0, NotChecked=0, Total=552 [2022-04-08 04:45:41,004 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-08 04:45:43,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:45:43,493 INFO L93 Difference]: Finished difference Result 81 states and 94 transitions. [2022-04-08 04:45:43,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-04-08 04:45:43,493 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-08 04:45:43,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 04:45:43,494 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-08 04:45:43,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 80 transitions. [2022-04-08 04:45:43,496 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-08 04:45:43,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 80 transitions. [2022-04-08 04:45:43,498 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 80 transitions. [2022-04-08 04:45:43,600 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-08 04:45:43,601 INFO L225 Difference]: With dead ends: 81 [2022-04-08 04:45:43,601 INFO L226 Difference]: Without dead ends: 61 [2022-04-08 04:45:43,602 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 58 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 163 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=141, Invalid=729, Unknown=0, NotChecked=0, Total=870 [2022-04-08 04:45:43,602 INFO L913 BasicCegarLoop]: 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-08 04:45:43,603 INFO L914 BasicCegarLoop]: 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-08 04:45:43,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2022-04-08 04:45:43,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2022-04-08 04:45:43,709 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 04:45:43,709 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-08 04:45:43,709 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-08 04:45:43,710 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-08 04:45:43,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:45:43,712 INFO L93 Difference]: Finished difference Result 61 states and 66 transitions. [2022-04-08 04:45:43,712 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 66 transitions. [2022-04-08 04:45:43,712 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:45:43,712 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:45:43,713 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-08 04:45:43,713 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-08 04:45:43,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:45:43,715 INFO L93 Difference]: Finished difference Result 61 states and 66 transitions. [2022-04-08 04:45:43,715 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 66 transitions. [2022-04-08 04:45:43,715 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:45:43,715 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:45:43,715 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 04:45:43,715 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 04:45:43,716 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-08 04:45:43,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 66 transitions. [2022-04-08 04:45:43,718 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 66 transitions. Word has length 41 [2022-04-08 04:45:43,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 04:45:43,718 INFO L478 AbstractCegarLoop]: Abstraction has 61 states and 66 transitions. [2022-04-08 04:45:43,718 INFO L479 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-08 04:45:43,718 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 61 states and 66 transitions. [2022-04-08 04:45:43,816 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 04:45:43,816 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 66 transitions. [2022-04-08 04:45:43,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-04-08 04:45:43,817 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 04:45:43,817 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 04:45:43,835 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-04-08 04:45:44,023 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 04:45:44,023 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 04:45:44,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 04:45:44,024 INFO L85 PathProgramCache]: Analyzing trace with hash -1786011109, now seen corresponding path program 1 times [2022-04-08 04:45:44,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 04:45:44,024 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1026484414] [2022-04-08 04:45:44,024 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 04:45:44,025 INFO L85 PathProgramCache]: Analyzing trace with hash -1786011109, now seen corresponding path program 2 times [2022-04-08 04:45:44,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 04:45:44,025 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [829297287] [2022-04-08 04:45:44,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 04:45:44,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 04:45:44,046 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 04:45:44,046 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1673486323] [2022-04-08 04:45:44,046 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 04:45:44,046 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 04:45:44,047 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 04:45:44,047 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 04:45:44,079 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-04-08 04:45:44,115 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 04:45:44,115 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 04:45:44,116 INFO L263 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 43 conjunts are in the unsatisfiable core [2022-04-08 04:45:44,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:45:44,130 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 04:45:44,753 INFO L272 TraceCheckUtils]: 0: Hoare triple {2842#true} call ULTIMATE.init(); {2842#true} is VALID [2022-04-08 04:45:44,754 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-08 04:45:44,754 INFO L290 TraceCheckUtils]: 2: Hoare triple {2842#true} assume true; {2842#true} is VALID [2022-04-08 04:45:44,754 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2842#true} {2842#true} #69#return; {2842#true} is VALID [2022-04-08 04:45:44,754 INFO L272 TraceCheckUtils]: 4: Hoare triple {2842#true} call #t~ret8 := main(); {2842#true} is VALID [2022-04-08 04:45:44,754 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-08 04:45:44,754 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-08 04:45:44,754 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-08 04:45:44,755 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-08 04:45:44,755 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-08 04:45:44,756 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-08 04:45:44,756 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-08 04:45:44,756 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-08 04:45:44,756 INFO L290 TraceCheckUtils]: 13: Hoare triple {2842#true} ~cond := #in~cond; {2842#true} is VALID [2022-04-08 04:45:44,756 INFO L290 TraceCheckUtils]: 14: Hoare triple {2842#true} assume !(0 == ~cond); {2842#true} is VALID [2022-04-08 04:45:44,756 INFO L290 TraceCheckUtils]: 15: Hoare triple {2842#true} assume true; {2842#true} is VALID [2022-04-08 04:45:44,757 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-08 04:45:44,757 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-08 04:45:44,758 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-08 04:45:44,758 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-08 04:45:44,758 INFO L290 TraceCheckUtils]: 20: Hoare triple {2842#true} ~cond := #in~cond; {2842#true} is VALID [2022-04-08 04:45:44,758 INFO L290 TraceCheckUtils]: 21: Hoare triple {2842#true} assume !(0 == ~cond); {2842#true} is VALID [2022-04-08 04:45:44,758 INFO L290 TraceCheckUtils]: 22: Hoare triple {2842#true} assume true; {2842#true} is VALID [2022-04-08 04:45:44,759 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-08 04:45:44,759 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-08 04:45:44,760 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-08 04:45:44,760 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-08 04:45:44,762 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-08 04:45:44,762 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-08 04:45:44,764 INFO L290 TraceCheckUtils]: 29: Hoare triple {2842#true} ~cond := #in~cond; {2941#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 04:45:44,765 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-08 04:45:44,766 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-08 04:45:44,767 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-08 04:45:44,773 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-08 04:45:44,774 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-08 04:45:44,775 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-08 04:45:44,775 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-08 04:45:44,776 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-08 04:45:44,779 INFO L290 TraceCheckUtils]: 38: Hoare triple {2970#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2974#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 04:45:44,779 INFO L290 TraceCheckUtils]: 39: Hoare triple {2974#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2843#false} is VALID [2022-04-08 04:45:44,779 INFO L290 TraceCheckUtils]: 40: Hoare triple {2843#false} assume !false; {2843#false} is VALID [2022-04-08 04:45:44,780 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-08 04:45:44,780 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 04:45:47,191 INFO L290 TraceCheckUtils]: 40: Hoare triple {2843#false} assume !false; {2843#false} is VALID [2022-04-08 04:45:47,192 INFO L290 TraceCheckUtils]: 39: Hoare triple {2974#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2843#false} is VALID [2022-04-08 04:45:47,192 INFO L290 TraceCheckUtils]: 38: Hoare triple {2970#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2974#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 04:45:47,193 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-08 04:45:47,194 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-08 04:45:47,196 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-08 04:45:47,198 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-08 04:45:47,199 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-08 04:45:47,200 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-08 04:45:47,200 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-08 04:45:47,201 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-08 04:45:47,201 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-08 04:45:47,201 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-08 04:45:47,202 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-08 04:45:47,202 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-08 04:45:47,202 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-08 04:45:47,202 INFO L290 TraceCheckUtils]: 24: Hoare triple {2842#true} assume !!(~x~0 <= ~X~0); {2842#true} is VALID [2022-04-08 04:45:47,203 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {2842#true} {2842#true} #65#return; {2842#true} is VALID [2022-04-08 04:45:47,203 INFO L290 TraceCheckUtils]: 22: Hoare triple {2842#true} assume true; {2842#true} is VALID [2022-04-08 04:45:47,203 INFO L290 TraceCheckUtils]: 21: Hoare triple {2842#true} assume !(0 == ~cond); {2842#true} is VALID [2022-04-08 04:45:47,203 INFO L290 TraceCheckUtils]: 20: Hoare triple {2842#true} ~cond := #in~cond; {2842#true} is VALID [2022-04-08 04:45:47,203 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-08 04:45:47,203 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-08 04:45:47,203 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-08 04:45:47,203 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {2842#true} {2842#true} #63#return; {2842#true} is VALID [2022-04-08 04:45:47,203 INFO L290 TraceCheckUtils]: 15: Hoare triple {2842#true} assume true; {2842#true} is VALID [2022-04-08 04:45:47,204 INFO L290 TraceCheckUtils]: 14: Hoare triple {2842#true} assume !(0 == ~cond); {2842#true} is VALID [2022-04-08 04:45:47,204 INFO L290 TraceCheckUtils]: 13: Hoare triple {2842#true} ~cond := #in~cond; {2842#true} is VALID [2022-04-08 04:45:47,204 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-08 04:45:47,204 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-08 04:45:47,204 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2842#true} {2842#true} #61#return; {2842#true} is VALID [2022-04-08 04:45:47,204 INFO L290 TraceCheckUtils]: 9: Hoare triple {2842#true} assume true; {2842#true} is VALID [2022-04-08 04:45:47,204 INFO L290 TraceCheckUtils]: 8: Hoare triple {2842#true} assume !(0 == ~cond); {2842#true} is VALID [2022-04-08 04:45:47,204 INFO L290 TraceCheckUtils]: 7: Hoare triple {2842#true} ~cond := #in~cond; {2842#true} is VALID [2022-04-08 04:45:47,204 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-08 04:45:47,205 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-08 04:45:47,205 INFO L272 TraceCheckUtils]: 4: Hoare triple {2842#true} call #t~ret8 := main(); {2842#true} is VALID [2022-04-08 04:45:47,205 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2842#true} {2842#true} #69#return; {2842#true} is VALID [2022-04-08 04:45:47,205 INFO L290 TraceCheckUtils]: 2: Hoare triple {2842#true} assume true; {2842#true} is VALID [2022-04-08 04:45:47,205 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-08 04:45:47,205 INFO L272 TraceCheckUtils]: 0: Hoare triple {2842#true} call ULTIMATE.init(); {2842#true} is VALID [2022-04-08 04:45:47,205 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-08 04:45:47,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 04:45:47,206 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [829297287] [2022-04-08 04:45:47,206 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 04:45:47,206 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1673486323] [2022-04-08 04:45:47,206 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1673486323] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 04:45:47,206 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 04:45:47,206 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 11] total 22 [2022-04-08 04:45:47,207 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 04:45:47,207 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1026484414] [2022-04-08 04:45:47,207 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1026484414] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 04:45:47,207 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 04:45:47,207 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-04-08 04:45:47,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1252708822] [2022-04-08 04:45:47,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 04:45:47,208 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-08 04:45:47,208 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 04:45:47,208 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-08 04:45:47,250 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-08 04:45:47,251 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-08 04:45:47,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 04:45:47,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-08 04:45:47,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=386, Unknown=0, NotChecked=0, Total=462 [2022-04-08 04:45:47,252 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-08 04:45:48,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:45:48,267 INFO L93 Difference]: Finished difference Result 83 states and 93 transitions. [2022-04-08 04:45:48,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-04-08 04:45:48,267 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-08 04:45:48,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 04:45:48,268 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-08 04:45:48,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 70 transitions. [2022-04-08 04:45:48,270 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-08 04:45:48,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 70 transitions. [2022-04-08 04:45:48,271 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 70 transitions. [2022-04-08 04:45:48,336 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-08 04:45:48,338 INFO L225 Difference]: With dead ends: 83 [2022-04-08 04:45:48,338 INFO L226 Difference]: Without dead ends: 70 [2022-04-08 04:45:48,338 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 59 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=102, Invalid=548, Unknown=0, NotChecked=0, Total=650 [2022-04-08 04:45:48,339 INFO L913 BasicCegarLoop]: 20 mSDtfsCounter, 29 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 353 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s 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.4s IncrementalHoareTripleChecker+Time [2022-04-08 04:45:48,339 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [31 Valid, 140 Invalid, 367 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 353 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-08 04:45:48,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2022-04-08 04:45:48,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2022-04-08 04:45:48,464 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 04:45:48,465 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-08 04:45:48,465 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-08 04:45:48,465 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-08 04:45:48,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:45:48,467 INFO L93 Difference]: Finished difference Result 70 states and 75 transitions. [2022-04-08 04:45:48,467 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 75 transitions. [2022-04-08 04:45:48,468 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:45:48,468 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:45:48,468 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-08 04:45:48,468 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-08 04:45:48,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:45:48,470 INFO L93 Difference]: Finished difference Result 70 states and 75 transitions. [2022-04-08 04:45:48,470 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 75 transitions. [2022-04-08 04:45:48,470 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:45:48,470 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:45:48,471 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 04:45:48,471 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 04:45:48,471 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-08 04:45:48,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 75 transitions. [2022-04-08 04:45:48,473 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 75 transitions. Word has length 41 [2022-04-08 04:45:48,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 04:45:48,473 INFO L478 AbstractCegarLoop]: Abstraction has 70 states and 75 transitions. [2022-04-08 04:45:48,473 INFO L479 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-08 04:45:48,473 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 70 states and 75 transitions. [2022-04-08 04:45:48,593 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-08 04:45:48,593 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 75 transitions. [2022-04-08 04:45:48,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-04-08 04:45:48,594 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 04:45:48,594 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 04:45:48,615 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-04-08 04:45:48,794 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 04:45:48,795 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 04:45:48,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 04:45:48,795 INFO L85 PathProgramCache]: Analyzing trace with hash -287119529, now seen corresponding path program 3 times [2022-04-08 04:45:48,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 04:45:48,795 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [997500837] [2022-04-08 04:45:48,796 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 04:45:48,796 INFO L85 PathProgramCache]: Analyzing trace with hash -287119529, now seen corresponding path program 4 times [2022-04-08 04:45:48,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 04:45:48,796 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1689111770] [2022-04-08 04:45:48,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 04:45:48,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 04:45:48,808 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 04:45:48,808 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [788808945] [2022-04-08 04:45:48,808 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 04:45:48,808 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 04:45:48,808 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 04:45:48,809 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 04:45:48,810 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-04-08 04:45:48,845 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 04:45:48,846 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 04:45:48,846 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 32 conjunts are in the unsatisfiable core [2022-04-08 04:45:48,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:45:48,856 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 04:45:49,126 INFO L272 TraceCheckUtils]: 0: Hoare triple {3563#true} call ULTIMATE.init(); {3563#true} is VALID [2022-04-08 04:45:49,126 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-08 04:45:49,126 INFO L290 TraceCheckUtils]: 2: Hoare triple {3563#true} assume true; {3563#true} is VALID [2022-04-08 04:45:49,126 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3563#true} {3563#true} #69#return; {3563#true} is VALID [2022-04-08 04:45:49,126 INFO L272 TraceCheckUtils]: 4: Hoare triple {3563#true} call #t~ret8 := main(); {3563#true} is VALID [2022-04-08 04:45:49,126 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-08 04:45:49,126 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-08 04:45:49,126 INFO L290 TraceCheckUtils]: 7: Hoare triple {3563#true} ~cond := #in~cond; {3563#true} is VALID [2022-04-08 04:45:49,126 INFO L290 TraceCheckUtils]: 8: Hoare triple {3563#true} assume !(0 == ~cond); {3563#true} is VALID [2022-04-08 04:45:49,127 INFO L290 TraceCheckUtils]: 9: Hoare triple {3563#true} assume true; {3563#true} is VALID [2022-04-08 04:45:49,127 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3563#true} {3563#true} #61#return; {3563#true} is VALID [2022-04-08 04:45:49,127 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-08 04:45:49,127 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-08 04:45:49,127 INFO L290 TraceCheckUtils]: 13: Hoare triple {3563#true} ~cond := #in~cond; {3563#true} is VALID [2022-04-08 04:45:49,127 INFO L290 TraceCheckUtils]: 14: Hoare triple {3563#true} assume !(0 == ~cond); {3563#true} is VALID [2022-04-08 04:45:49,127 INFO L290 TraceCheckUtils]: 15: Hoare triple {3563#true} assume true; {3563#true} is VALID [2022-04-08 04:45:49,127 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {3563#true} {3563#true} #63#return; {3563#true} is VALID [2022-04-08 04:45:49,127 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-08 04:45:49,128 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-08 04:45:49,128 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-08 04:45:49,128 INFO L290 TraceCheckUtils]: 20: Hoare triple {3563#true} ~cond := #in~cond; {3563#true} is VALID [2022-04-08 04:45:49,128 INFO L290 TraceCheckUtils]: 21: Hoare triple {3563#true} assume !(0 == ~cond); {3563#true} is VALID [2022-04-08 04:45:49,128 INFO L290 TraceCheckUtils]: 22: Hoare triple {3563#true} assume true; {3563#true} is VALID [2022-04-08 04:45:49,129 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-08 04:45:49,129 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-08 04:45:49,130 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-08 04:45:49,130 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-08 04:45:49,131 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-08 04:45:49,131 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-08 04:45:49,131 INFO L290 TraceCheckUtils]: 29: Hoare triple {3563#true} ~cond := #in~cond; {3659#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 04:45:49,132 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-08 04:45:49,132 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-08 04:45:49,133 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-08 04:45:49,133 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-08 04:45:49,134 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-08 04:45:49,134 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-08 04:45:49,135 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-08 04:45:49,136 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-08 04:45:49,136 INFO L290 TraceCheckUtils]: 38: Hoare triple {3688#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3692#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 04:45:49,136 INFO L290 TraceCheckUtils]: 39: Hoare triple {3692#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3564#false} is VALID [2022-04-08 04:45:49,136 INFO L290 TraceCheckUtils]: 40: Hoare triple {3564#false} assume !false; {3564#false} is VALID [2022-04-08 04:45:49,137 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-08 04:45:49,137 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 04:45:53,546 INFO L290 TraceCheckUtils]: 40: Hoare triple {3564#false} assume !false; {3564#false} is VALID [2022-04-08 04:45:53,546 INFO L290 TraceCheckUtils]: 39: Hoare triple {3692#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3564#false} is VALID [2022-04-08 04:45:53,547 INFO L290 TraceCheckUtils]: 38: Hoare triple {3688#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3692#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 04:45:53,547 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-08 04:45:53,548 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-08 04:45:53,550 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-08 04:45:53,551 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-08 04:45:53,551 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-08 04:45:53,552 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-08 04:45:53,552 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-08 04:45:53,553 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-08 04:45:53,553 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-08 04:45:53,553 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-08 04:45:53,554 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-08 04:45:53,554 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-08 04:45:53,554 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-08 04:45:53,554 INFO L290 TraceCheckUtils]: 24: Hoare triple {3563#true} assume !!(~x~0 <= ~X~0); {3563#true} is VALID [2022-04-08 04:45:53,554 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {3563#true} {3563#true} #65#return; {3563#true} is VALID [2022-04-08 04:45:53,554 INFO L290 TraceCheckUtils]: 22: Hoare triple {3563#true} assume true; {3563#true} is VALID [2022-04-08 04:45:53,554 INFO L290 TraceCheckUtils]: 21: Hoare triple {3563#true} assume !(0 == ~cond); {3563#true} is VALID [2022-04-08 04:45:53,554 INFO L290 TraceCheckUtils]: 20: Hoare triple {3563#true} ~cond := #in~cond; {3563#true} is VALID [2022-04-08 04:45:53,554 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-08 04:45:53,554 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-08 04:45:53,554 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-08 04:45:53,555 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {3563#true} {3563#true} #63#return; {3563#true} is VALID [2022-04-08 04:45:53,555 INFO L290 TraceCheckUtils]: 15: Hoare triple {3563#true} assume true; {3563#true} is VALID [2022-04-08 04:45:53,555 INFO L290 TraceCheckUtils]: 14: Hoare triple {3563#true} assume !(0 == ~cond); {3563#true} is VALID [2022-04-08 04:45:53,555 INFO L290 TraceCheckUtils]: 13: Hoare triple {3563#true} ~cond := #in~cond; {3563#true} is VALID [2022-04-08 04:45:53,555 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-08 04:45:53,555 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-08 04:45:53,555 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3563#true} {3563#true} #61#return; {3563#true} is VALID [2022-04-08 04:45:53,555 INFO L290 TraceCheckUtils]: 9: Hoare triple {3563#true} assume true; {3563#true} is VALID [2022-04-08 04:45:53,555 INFO L290 TraceCheckUtils]: 8: Hoare triple {3563#true} assume !(0 == ~cond); {3563#true} is VALID [2022-04-08 04:45:53,555 INFO L290 TraceCheckUtils]: 7: Hoare triple {3563#true} ~cond := #in~cond; {3563#true} is VALID [2022-04-08 04:45:53,555 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-08 04:45:53,555 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-08 04:45:53,555 INFO L272 TraceCheckUtils]: 4: Hoare triple {3563#true} call #t~ret8 := main(); {3563#true} is VALID [2022-04-08 04:45:53,555 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3563#true} {3563#true} #69#return; {3563#true} is VALID [2022-04-08 04:45:53,556 INFO L290 TraceCheckUtils]: 2: Hoare triple {3563#true} assume true; {3563#true} is VALID [2022-04-08 04:45:53,556 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-08 04:45:53,556 INFO L272 TraceCheckUtils]: 0: Hoare triple {3563#true} call ULTIMATE.init(); {3563#true} is VALID [2022-04-08 04:45:53,556 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-08 04:45:53,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 04:45:53,556 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1689111770] [2022-04-08 04:45:53,556 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 04:45:53,556 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [788808945] [2022-04-08 04:45:53,556 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [788808945] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 04:45:53,556 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 04:45:53,556 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10] total 18 [2022-04-08 04:45:53,557 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 04:45:53,557 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [997500837] [2022-04-08 04:45:53,557 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [997500837] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 04:45:53,557 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 04:45:53,557 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-08 04:45:53,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [533032937] [2022-04-08 04:45:53,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 04:45:53,558 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-08 04:45:53,558 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 04:45:53,558 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-08 04:45:53,591 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-08 04:45:53,591 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-08 04:45:53,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 04:45:53,591 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-08 04:45:53,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=255, Unknown=0, NotChecked=0, Total=306 [2022-04-08 04:45:53,592 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-08 04:45:54,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:45:54,557 INFO L93 Difference]: Finished difference Result 84 states and 92 transitions. [2022-04-08 04:45:54,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-08 04:45:54,557 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-08 04:45:54,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 04:45:54,557 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-08 04:45:54,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 58 transitions. [2022-04-08 04:45:54,559 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-08 04:45:54,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 58 transitions. [2022-04-08 04:45:54,560 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 58 transitions. [2022-04-08 04:45:54,607 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-08 04:45:54,608 INFO L225 Difference]: With dead ends: 84 [2022-04-08 04:45:54,608 INFO L226 Difference]: Without dead ends: 82 [2022-04-08 04:45:54,609 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 62 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=71, Invalid=349, Unknown=0, NotChecked=0, Total=420 [2022-04-08 04:45:54,609 INFO L913 BasicCegarLoop]: 24 mSDtfsCounter, 16 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 344 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s 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.4s IncrementalHoareTripleChecker+Time [2022-04-08 04:45:54,609 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [17 Valid, 192 Invalid, 349 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 344 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-08 04:45:54,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2022-04-08 04:45:54,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 78. [2022-04-08 04:45:54,736 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 04:45:54,736 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-08 04:45:54,737 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-08 04:45:54,737 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-08 04:45:54,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:45:54,739 INFO L93 Difference]: Finished difference Result 82 states and 90 transitions. [2022-04-08 04:45:54,740 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 90 transitions. [2022-04-08 04:45:54,740 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:45:54,740 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:45:54,740 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-08 04:45:54,741 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-08 04:45:54,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:45:54,743 INFO L93 Difference]: Finished difference Result 82 states and 90 transitions. [2022-04-08 04:45:54,743 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 90 transitions. [2022-04-08 04:45:54,743 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:45:54,743 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:45:54,743 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 04:45:54,743 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 04:45:54,744 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-08 04:45:54,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 84 transitions. [2022-04-08 04:45:54,746 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 84 transitions. Word has length 41 [2022-04-08 04:45:54,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 04:45:54,746 INFO L478 AbstractCegarLoop]: Abstraction has 78 states and 84 transitions. [2022-04-08 04:45:54,746 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 12 states have internal predecessors, (26), 4 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-08 04:45:54,746 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 78 states and 84 transitions. [2022-04-08 04:45:54,897 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-08 04:45:54,897 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 84 transitions. [2022-04-08 04:45:54,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-04-08 04:45:54,897 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 04:45:54,898 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 04:45:54,915 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-04-08 04:45:55,103 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 04:45:55,104 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 04:45:55,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 04:45:55,104 INFO L85 PathProgramCache]: Analyzing trace with hash 1487887833, now seen corresponding path program 3 times [2022-04-08 04:45:55,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 04:45:55,104 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1916429417] [2022-04-08 04:45:55,104 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 04:45:55,105 INFO L85 PathProgramCache]: Analyzing trace with hash 1487887833, now seen corresponding path program 4 times [2022-04-08 04:45:55,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 04:45:55,105 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1969185387] [2022-04-08 04:45:55,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 04:45:55,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 04:45:55,116 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 04:45:55,116 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [247110309] [2022-04-08 04:45:55,116 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 04:45:55,117 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 04:45:55,117 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 04:45:55,118 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 04:45:55,119 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-04-08 04:45:55,166 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 04:45:55,167 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 04:45:55,167 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 29 conjunts are in the unsatisfiable core [2022-04-08 04:45:55,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:45:55,178 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 04:45:55,554 INFO L272 TraceCheckUtils]: 0: Hoare triple {4320#true} call ULTIMATE.init(); {4320#true} is VALID [2022-04-08 04:45:55,554 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-08 04:45:55,554 INFO L290 TraceCheckUtils]: 2: Hoare triple {4320#true} assume true; {4320#true} is VALID [2022-04-08 04:45:55,554 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4320#true} {4320#true} #69#return; {4320#true} is VALID [2022-04-08 04:45:55,554 INFO L272 TraceCheckUtils]: 4: Hoare triple {4320#true} call #t~ret8 := main(); {4320#true} is VALID [2022-04-08 04:45:55,555 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-08 04:45:55,555 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-08 04:45:55,555 INFO L290 TraceCheckUtils]: 7: Hoare triple {4320#true} ~cond := #in~cond; {4320#true} is VALID [2022-04-08 04:45:55,555 INFO L290 TraceCheckUtils]: 8: Hoare triple {4320#true} assume !(0 == ~cond); {4320#true} is VALID [2022-04-08 04:45:55,555 INFO L290 TraceCheckUtils]: 9: Hoare triple {4320#true} assume true; {4320#true} is VALID [2022-04-08 04:45:55,555 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4320#true} {4320#true} #61#return; {4320#true} is VALID [2022-04-08 04:45:55,555 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-08 04:45:55,555 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-08 04:45:55,555 INFO L290 TraceCheckUtils]: 13: Hoare triple {4320#true} ~cond := #in~cond; {4320#true} is VALID [2022-04-08 04:45:55,556 INFO L290 TraceCheckUtils]: 14: Hoare triple {4320#true} assume !(0 == ~cond); {4320#true} is VALID [2022-04-08 04:45:55,556 INFO L290 TraceCheckUtils]: 15: Hoare triple {4320#true} assume true; {4320#true} is VALID [2022-04-08 04:45:55,556 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {4320#true} {4320#true} #63#return; {4320#true} is VALID [2022-04-08 04:45:55,556 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-08 04:45:55,557 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-08 04:45:55,557 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-08 04:45:55,557 INFO L290 TraceCheckUtils]: 20: Hoare triple {4320#true} ~cond := #in~cond; {4320#true} is VALID [2022-04-08 04:45:55,557 INFO L290 TraceCheckUtils]: 21: Hoare triple {4320#true} assume !(0 == ~cond); {4320#true} is VALID [2022-04-08 04:45:55,557 INFO L290 TraceCheckUtils]: 22: Hoare triple {4320#true} assume true; {4320#true} is VALID [2022-04-08 04:45:55,558 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-08 04:45:55,558 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-08 04:45:55,559 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-08 04:45:55,560 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-08 04:45:55,560 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-08 04:45:55,561 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-08 04:45:55,561 INFO L290 TraceCheckUtils]: 29: Hoare triple {4320#true} ~cond := #in~cond; {4320#true} is VALID [2022-04-08 04:45:55,561 INFO L290 TraceCheckUtils]: 30: Hoare triple {4320#true} assume !(0 == ~cond); {4320#true} is VALID [2022-04-08 04:45:55,561 INFO L290 TraceCheckUtils]: 31: Hoare triple {4320#true} assume true; {4320#true} is VALID [2022-04-08 04:45:55,562 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-08 04:45:55,562 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-08 04:45:55,563 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-08 04:45:55,564 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-08 04:45:55,564 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-08 04:45:55,566 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-08 04:45:55,566 INFO L290 TraceCheckUtils]: 38: Hoare triple {4443#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4447#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 04:45:55,567 INFO L290 TraceCheckUtils]: 39: Hoare triple {4447#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4321#false} is VALID [2022-04-08 04:45:55,567 INFO L290 TraceCheckUtils]: 40: Hoare triple {4321#false} assume !false; {4321#false} is VALID [2022-04-08 04:45:55,567 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-08 04:45:55,567 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 04:45:55,908 INFO L290 TraceCheckUtils]: 40: Hoare triple {4321#false} assume !false; {4321#false} is VALID [2022-04-08 04:45:55,909 INFO L290 TraceCheckUtils]: 39: Hoare triple {4447#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4321#false} is VALID [2022-04-08 04:45:55,909 INFO L290 TraceCheckUtils]: 38: Hoare triple {4443#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4447#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 04:45:55,910 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-08 04:45:55,911 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-08 04:45:55,912 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-08 04:45:55,914 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-08 04:45:55,914 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-08 04:45:55,915 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-08 04:45:55,915 INFO L290 TraceCheckUtils]: 31: Hoare triple {4320#true} assume true; {4320#true} is VALID [2022-04-08 04:45:55,915 INFO L290 TraceCheckUtils]: 30: Hoare triple {4320#true} assume !(0 == ~cond); {4320#true} is VALID [2022-04-08 04:45:55,915 INFO L290 TraceCheckUtils]: 29: Hoare triple {4320#true} ~cond := #in~cond; {4320#true} is VALID [2022-04-08 04:45:55,915 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-08 04:45:55,915 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-08 04:45:55,917 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-08 04:45:55,918 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-08 04:45:55,919 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-08 04:45:55,920 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-08 04:45:55,920 INFO L290 TraceCheckUtils]: 22: Hoare triple {4320#true} assume true; {4320#true} is VALID [2022-04-08 04:45:55,920 INFO L290 TraceCheckUtils]: 21: Hoare triple {4320#true} assume !(0 == ~cond); {4320#true} is VALID [2022-04-08 04:45:55,920 INFO L290 TraceCheckUtils]: 20: Hoare triple {4320#true} ~cond := #in~cond; {4320#true} is VALID [2022-04-08 04:45:55,920 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-08 04:45:55,924 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-08 04:45:55,925 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-08 04:45:55,925 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {4320#true} {4320#true} #63#return; {4320#true} is VALID [2022-04-08 04:45:55,925 INFO L290 TraceCheckUtils]: 15: Hoare triple {4320#true} assume true; {4320#true} is VALID [2022-04-08 04:45:55,925 INFO L290 TraceCheckUtils]: 14: Hoare triple {4320#true} assume !(0 == ~cond); {4320#true} is VALID [2022-04-08 04:45:55,925 INFO L290 TraceCheckUtils]: 13: Hoare triple {4320#true} ~cond := #in~cond; {4320#true} is VALID [2022-04-08 04:45:55,925 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-08 04:45:55,925 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-08 04:45:55,925 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4320#true} {4320#true} #61#return; {4320#true} is VALID [2022-04-08 04:45:55,926 INFO L290 TraceCheckUtils]: 9: Hoare triple {4320#true} assume true; {4320#true} is VALID [2022-04-08 04:45:55,926 INFO L290 TraceCheckUtils]: 8: Hoare triple {4320#true} assume !(0 == ~cond); {4320#true} is VALID [2022-04-08 04:45:55,926 INFO L290 TraceCheckUtils]: 7: Hoare triple {4320#true} ~cond := #in~cond; {4320#true} is VALID [2022-04-08 04:45:55,926 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-08 04:45:55,926 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-08 04:45:55,926 INFO L272 TraceCheckUtils]: 4: Hoare triple {4320#true} call #t~ret8 := main(); {4320#true} is VALID [2022-04-08 04:45:55,926 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4320#true} {4320#true} #69#return; {4320#true} is VALID [2022-04-08 04:45:55,926 INFO L290 TraceCheckUtils]: 2: Hoare triple {4320#true} assume true; {4320#true} is VALID [2022-04-08 04:45:55,926 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-08 04:45:55,926 INFO L272 TraceCheckUtils]: 0: Hoare triple {4320#true} call ULTIMATE.init(); {4320#true} is VALID [2022-04-08 04:45:55,927 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-08 04:45:55,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 04:45:55,927 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1969185387] [2022-04-08 04:45:55,927 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 04:45:55,927 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [247110309] [2022-04-08 04:45:55,927 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [247110309] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 04:45:55,927 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 04:45:55,927 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 17 [2022-04-08 04:45:55,928 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 04:45:55,928 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1916429417] [2022-04-08 04:45:55,928 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1916429417] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 04:45:55,928 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 04:45:55,928 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-08 04:45:55,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538345925] [2022-04-08 04:45:55,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 04:45:55,929 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-08 04:45:55,929 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 04:45:55,930 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-08 04:45:55,960 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-08 04:45:55,960 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-08 04:45:55,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 04:45:55,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-08 04:45:55,961 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=219, Unknown=0, NotChecked=0, Total=272 [2022-04-08 04:45:55,961 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-08 04:45:56,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:45:56,706 INFO L93 Difference]: Finished difference Result 91 states and 99 transitions. [2022-04-08 04:45:56,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-08 04:45:56,707 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-08 04:45:56,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 04:45:56,707 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-08 04:45:56,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 58 transitions. [2022-04-08 04:45:56,708 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-08 04:45:56,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 58 transitions. [2022-04-08 04:45:56,709 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 58 transitions. [2022-04-08 04:45:56,766 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-08 04:45:56,768 INFO L225 Difference]: With dead ends: 91 [2022-04-08 04:45:56,768 INFO L226 Difference]: Without dead ends: 89 [2022-04-08 04:45:56,768 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 62 SyntacticMatches, 4 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=65, Invalid=277, Unknown=0, NotChecked=0, Total=342 [2022-04-08 04:45:56,769 INFO L913 BasicCegarLoop]: 32 mSDtfsCounter, 11 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 254 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-08 04:45:56,769 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 184 Invalid, 257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 254 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-08 04:45:56,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2022-04-08 04:45:56,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 78. [2022-04-08 04:45:56,884 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 04:45:56,884 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-08 04:45:56,884 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-08 04:45:56,885 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-08 04:45:56,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:45:56,888 INFO L93 Difference]: Finished difference Result 89 states and 97 transitions. [2022-04-08 04:45:56,888 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 97 transitions. [2022-04-08 04:45:56,888 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:45:56,888 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:45:56,889 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-08 04:45:56,889 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-08 04:45:56,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:45:56,891 INFO L93 Difference]: Finished difference Result 89 states and 97 transitions. [2022-04-08 04:45:56,891 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 97 transitions. [2022-04-08 04:45:56,891 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:45:56,891 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:45:56,891 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 04:45:56,891 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 04:45:56,892 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-08 04:45:56,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 84 transitions. [2022-04-08 04:45:56,893 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 84 transitions. Word has length 41 [2022-04-08 04:45:56,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 04:45:56,893 INFO L478 AbstractCegarLoop]: Abstraction has 78 states and 84 transitions. [2022-04-08 04:45:56,894 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 4 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-08 04:45:56,894 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 78 states and 84 transitions. [2022-04-08 04:45:57,026 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-08 04:45:57,027 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 84 transitions. [2022-04-08 04:45:57,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-04-08 04:45:57,027 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 04:45:57,027 INFO L499 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 04:45:57,043 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-08 04:45:57,231 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2022-04-08 04:45:57,232 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 04:45:57,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 04:45:57,232 INFO L85 PathProgramCache]: Analyzing trace with hash -143142008, now seen corresponding path program 1 times [2022-04-08 04:45:57,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 04:45:57,232 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1919833743] [2022-04-08 04:45:57,232 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 04:45:57,232 INFO L85 PathProgramCache]: Analyzing trace with hash -143142008, now seen corresponding path program 2 times [2022-04-08 04:45:57,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 04:45:57,233 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [167160973] [2022-04-08 04:45:57,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 04:45:57,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 04:45:57,244 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 04:45:57,244 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [921560474] [2022-04-08 04:45:57,244 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 04:45:57,245 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 04:45:57,245 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 04:45:57,245 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 04:45:57,250 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-04-08 04:45:57,304 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 04:45:57,305 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 04:45:57,305 INFO L263 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-08 04:45:57,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:45:57,317 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 04:45:59,584 INFO L272 TraceCheckUtils]: 0: Hoare triple {5102#true} call ULTIMATE.init(); {5102#true} is VALID [2022-04-08 04:45:59,584 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-08 04:45:59,584 INFO L290 TraceCheckUtils]: 2: Hoare triple {5102#true} assume true; {5102#true} is VALID [2022-04-08 04:45:59,584 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5102#true} {5102#true} #69#return; {5102#true} is VALID [2022-04-08 04:45:59,584 INFO L272 TraceCheckUtils]: 4: Hoare triple {5102#true} call #t~ret8 := main(); {5102#true} is VALID [2022-04-08 04:45:59,584 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-08 04:45:59,584 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-08 04:45:59,585 INFO L290 TraceCheckUtils]: 7: Hoare triple {5102#true} ~cond := #in~cond; {5102#true} is VALID [2022-04-08 04:45:59,585 INFO L290 TraceCheckUtils]: 8: Hoare triple {5102#true} assume !(0 == ~cond); {5102#true} is VALID [2022-04-08 04:45:59,585 INFO L290 TraceCheckUtils]: 9: Hoare triple {5102#true} assume true; {5102#true} is VALID [2022-04-08 04:45:59,585 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {5102#true} {5102#true} #61#return; {5102#true} is VALID [2022-04-08 04:45:59,585 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-08 04:45:59,585 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-08 04:45:59,585 INFO L290 TraceCheckUtils]: 13: Hoare triple {5102#true} ~cond := #in~cond; {5102#true} is VALID [2022-04-08 04:45:59,585 INFO L290 TraceCheckUtils]: 14: Hoare triple {5102#true} assume !(0 == ~cond); {5102#true} is VALID [2022-04-08 04:45:59,585 INFO L290 TraceCheckUtils]: 15: Hoare triple {5102#true} assume true; {5102#true} is VALID [2022-04-08 04:45:59,586 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {5102#true} {5102#true} #63#return; {5102#true} is VALID [2022-04-08 04:45:59,586 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-08 04:45:59,587 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-08 04:45:59,587 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-08 04:45:59,587 INFO L290 TraceCheckUtils]: 20: Hoare triple {5102#true} ~cond := #in~cond; {5102#true} is VALID [2022-04-08 04:45:59,587 INFO L290 TraceCheckUtils]: 21: Hoare triple {5102#true} assume !(0 == ~cond); {5102#true} is VALID [2022-04-08 04:45:59,587 INFO L290 TraceCheckUtils]: 22: Hoare triple {5102#true} assume true; {5102#true} is VALID [2022-04-08 04:45:59,588 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-08 04:45:59,588 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-08 04:45:59,590 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-08 04:45:59,591 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-08 04:45:59,591 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-08 04:45:59,591 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-08 04:45:59,591 INFO L290 TraceCheckUtils]: 29: Hoare triple {5102#true} ~cond := #in~cond; {5102#true} is VALID [2022-04-08 04:45:59,591 INFO L290 TraceCheckUtils]: 30: Hoare triple {5102#true} assume !(0 == ~cond); {5102#true} is VALID [2022-04-08 04:45:59,592 INFO L290 TraceCheckUtils]: 31: Hoare triple {5102#true} assume true; {5102#true} is VALID [2022-04-08 04:45:59,592 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-08 04:45:59,593 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-08 04:45:59,594 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-08 04:45:59,594 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-08 04:45:59,595 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-08 04:45:59,595 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-08 04:45:59,595 INFO L290 TraceCheckUtils]: 38: Hoare triple {5102#true} ~cond := #in~cond; {5102#true} is VALID [2022-04-08 04:45:59,595 INFO L290 TraceCheckUtils]: 39: Hoare triple {5102#true} assume !(0 == ~cond); {5102#true} is VALID [2022-04-08 04:45:59,595 INFO L290 TraceCheckUtils]: 40: Hoare triple {5102#true} assume true; {5102#true} is VALID [2022-04-08 04:45:59,596 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-08 04:45:59,597 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-08 04:45:59,597 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-08 04:45:59,597 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-08 04:45:59,597 INFO L290 TraceCheckUtils]: 45: Hoare triple {5103#false} ~cond := #in~cond; {5103#false} is VALID [2022-04-08 04:45:59,597 INFO L290 TraceCheckUtils]: 46: Hoare triple {5103#false} assume 0 == ~cond; {5103#false} is VALID [2022-04-08 04:45:59,598 INFO L290 TraceCheckUtils]: 47: Hoare triple {5103#false} assume !false; {5103#false} is VALID [2022-04-08 04:45:59,598 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-08 04:45:59,598 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 04:45:59,915 INFO L290 TraceCheckUtils]: 47: Hoare triple {5103#false} assume !false; {5103#false} is VALID [2022-04-08 04:45:59,915 INFO L290 TraceCheckUtils]: 46: Hoare triple {5103#false} assume 0 == ~cond; {5103#false} is VALID [2022-04-08 04:45:59,915 INFO L290 TraceCheckUtils]: 45: Hoare triple {5103#false} ~cond := #in~cond; {5103#false} is VALID [2022-04-08 04:45:59,915 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-08 04:45:59,915 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-08 04:45:59,916 INFO L290 TraceCheckUtils]: 42: Hoare triple {5268#(<= main_~x~0 main_~X~0)} assume !(~x~0 <= ~X~0); {5103#false} is VALID [2022-04-08 04:45:59,916 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-08 04:45:59,916 INFO L290 TraceCheckUtils]: 40: Hoare triple {5102#true} assume true; {5102#true} is VALID [2022-04-08 04:45:59,916 INFO L290 TraceCheckUtils]: 39: Hoare triple {5102#true} assume !(0 == ~cond); {5102#true} is VALID [2022-04-08 04:45:59,917 INFO L290 TraceCheckUtils]: 38: Hoare triple {5102#true} ~cond := #in~cond; {5102#true} is VALID [2022-04-08 04:45:59,917 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-08 04:45:59,927 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-08 04:45:59,928 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-08 04:45:59,929 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-08 04:45:59,929 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-08 04:45:59,930 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-08 04:45:59,930 INFO L290 TraceCheckUtils]: 31: Hoare triple {5102#true} assume true; {5102#true} is VALID [2022-04-08 04:45:59,930 INFO L290 TraceCheckUtils]: 30: Hoare triple {5102#true} assume !(0 == ~cond); {5102#true} is VALID [2022-04-08 04:45:59,930 INFO L290 TraceCheckUtils]: 29: Hoare triple {5102#true} ~cond := #in~cond; {5102#true} is VALID [2022-04-08 04:45:59,930 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-08 04:45:59,931 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-08 04:45:59,931 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-08 04:45:59,932 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-08 04:45:59,933 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-08 04:45:59,933 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-08 04:45:59,934 INFO L290 TraceCheckUtils]: 22: Hoare triple {5102#true} assume true; {5102#true} is VALID [2022-04-08 04:45:59,934 INFO L290 TraceCheckUtils]: 21: Hoare triple {5102#true} assume !(0 == ~cond); {5102#true} is VALID [2022-04-08 04:45:59,934 INFO L290 TraceCheckUtils]: 20: Hoare triple {5102#true} ~cond := #in~cond; {5102#true} is VALID [2022-04-08 04:45:59,934 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-08 04:45:59,934 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-08 04:45:59,935 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-08 04:45:59,935 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {5102#true} {5102#true} #63#return; {5102#true} is VALID [2022-04-08 04:45:59,935 INFO L290 TraceCheckUtils]: 15: Hoare triple {5102#true} assume true; {5102#true} is VALID [2022-04-08 04:45:59,936 INFO L290 TraceCheckUtils]: 14: Hoare triple {5102#true} assume !(0 == ~cond); {5102#true} is VALID [2022-04-08 04:45:59,936 INFO L290 TraceCheckUtils]: 13: Hoare triple {5102#true} ~cond := #in~cond; {5102#true} is VALID [2022-04-08 04:45:59,936 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-08 04:45:59,936 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-08 04:45:59,936 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {5102#true} {5102#true} #61#return; {5102#true} is VALID [2022-04-08 04:45:59,936 INFO L290 TraceCheckUtils]: 9: Hoare triple {5102#true} assume true; {5102#true} is VALID [2022-04-08 04:45:59,936 INFO L290 TraceCheckUtils]: 8: Hoare triple {5102#true} assume !(0 == ~cond); {5102#true} is VALID [2022-04-08 04:45:59,936 INFO L290 TraceCheckUtils]: 7: Hoare triple {5102#true} ~cond := #in~cond; {5102#true} is VALID [2022-04-08 04:45:59,936 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-08 04:45:59,936 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-08 04:45:59,937 INFO L272 TraceCheckUtils]: 4: Hoare triple {5102#true} call #t~ret8 := main(); {5102#true} is VALID [2022-04-08 04:45:59,937 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5102#true} {5102#true} #69#return; {5102#true} is VALID [2022-04-08 04:45:59,937 INFO L290 TraceCheckUtils]: 2: Hoare triple {5102#true} assume true; {5102#true} is VALID [2022-04-08 04:45:59,937 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-08 04:45:59,937 INFO L272 TraceCheckUtils]: 0: Hoare triple {5102#true} call ULTIMATE.init(); {5102#true} is VALID [2022-04-08 04:45:59,937 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-08 04:45:59,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 04:45:59,937 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [167160973] [2022-04-08 04:45:59,938 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 04:45:59,938 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [921560474] [2022-04-08 04:45:59,938 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [921560474] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 04:45:59,938 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 04:45:59,938 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2022-04-08 04:45:59,938 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 04:45:59,938 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1919833743] [2022-04-08 04:45:59,938 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1919833743] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 04:45:59,938 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 04:45:59,939 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-08 04:45:59,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [98778935] [2022-04-08 04:45:59,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 04:45:59,939 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-08 04:45:59,939 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 04:45:59,939 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-08 04:45:59,970 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 04:45:59,970 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-08 04:45:59,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 04:45:59,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-08 04:45:59,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2022-04-08 04:45:59,971 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-08 04:46:00,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:46:00,354 INFO L93 Difference]: Finished difference Result 92 states and 100 transitions. [2022-04-08 04:46:00,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-08 04:46:00,354 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-08 04:46:00,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 04:46:00,354 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-08 04:46:00,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 59 transitions. [2022-04-08 04:46:00,355 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-08 04:46:00,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 59 transitions. [2022-04-08 04:46:00,356 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 59 transitions. [2022-04-08 04:46:00,401 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-08 04:46:00,402 INFO L225 Difference]: With dead ends: 92 [2022-04-08 04:46:00,402 INFO L226 Difference]: Without dead ends: 84 [2022-04-08 04:46:00,403 INFO L912 BasicCegarLoop]: 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-08 04:46:00,403 INFO L913 BasicCegarLoop]: 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-08 04:46:00,403 INFO L914 BasicCegarLoop]: 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-08 04:46:00,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2022-04-08 04:46:00,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 82. [2022-04-08 04:46:00,542 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 04:46:00,542 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-08 04:46:00,542 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-08 04:46:00,542 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-08 04:46:00,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:46:00,544 INFO L93 Difference]: Finished difference Result 84 states and 92 transitions. [2022-04-08 04:46:00,544 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 92 transitions. [2022-04-08 04:46:00,544 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:46:00,544 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:46:00,545 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-08 04:46:00,545 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-08 04:46:00,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:46:00,546 INFO L93 Difference]: Finished difference Result 84 states and 92 transitions. [2022-04-08 04:46:00,546 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 92 transitions. [2022-04-08 04:46:00,546 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:46:00,546 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:46:00,546 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 04:46:00,547 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 04:46:00,547 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-08 04:46:00,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 89 transitions. [2022-04-08 04:46:00,549 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 89 transitions. Word has length 48 [2022-04-08 04:46:00,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 04:46:00,549 INFO L478 AbstractCegarLoop]: Abstraction has 82 states and 89 transitions. [2022-04-08 04:46:00,549 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 5 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-08 04:46:00,549 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 82 states and 89 transitions. [2022-04-08 04:46:00,703 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-08 04:46:00,703 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 89 transitions. [2022-04-08 04:46:00,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-04-08 04:46:00,703 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 04:46:00,703 INFO L499 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 04:46:00,719 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-04-08 04:46:00,904 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-04-08 04:46:00,904 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 04:46:00,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 04:46:00,905 INFO L85 PathProgramCache]: Analyzing trace with hash -1154259258, now seen corresponding path program 3 times [2022-04-08 04:46:00,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 04:46:00,905 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [976445821] [2022-04-08 04:46:00,905 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 04:46:00,905 INFO L85 PathProgramCache]: Analyzing trace with hash -1154259258, now seen corresponding path program 4 times [2022-04-08 04:46:00,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 04:46:00,905 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1237544517] [2022-04-08 04:46:00,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 04:46:00,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 04:46:00,919 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 04:46:00,919 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1097045607] [2022-04-08 04:46:00,919 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 04:46:00,919 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 04:46:00,920 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 04:46:00,920 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 04:46:00,922 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-04-08 04:46:00,971 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 04:46:00,971 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 04:46:00,972 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 41 conjunts are in the unsatisfiable core [2022-04-08 04:46:00,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:46:00,983 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 04:46:01,722 INFO L272 TraceCheckUtils]: 0: Hoare triple {5917#true} call ULTIMATE.init(); {5917#true} is VALID [2022-04-08 04:46:01,722 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-08 04:46:01,722 INFO L290 TraceCheckUtils]: 2: Hoare triple {5917#true} assume true; {5917#true} is VALID [2022-04-08 04:46:01,722 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5917#true} {5917#true} #69#return; {5917#true} is VALID [2022-04-08 04:46:01,722 INFO L272 TraceCheckUtils]: 4: Hoare triple {5917#true} call #t~ret8 := main(); {5917#true} is VALID [2022-04-08 04:46:01,722 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-08 04:46:01,722 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-08 04:46:01,722 INFO L290 TraceCheckUtils]: 7: Hoare triple {5917#true} ~cond := #in~cond; {5917#true} is VALID [2022-04-08 04:46:01,722 INFO L290 TraceCheckUtils]: 8: Hoare triple {5917#true} assume !(0 == ~cond); {5917#true} is VALID [2022-04-08 04:46:01,723 INFO L290 TraceCheckUtils]: 9: Hoare triple {5917#true} assume true; {5917#true} is VALID [2022-04-08 04:46:01,723 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {5917#true} {5917#true} #61#return; {5917#true} is VALID [2022-04-08 04:46:01,723 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-08 04:46:01,723 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-08 04:46:01,723 INFO L290 TraceCheckUtils]: 13: Hoare triple {5917#true} ~cond := #in~cond; {5917#true} is VALID [2022-04-08 04:46:01,723 INFO L290 TraceCheckUtils]: 14: Hoare triple {5917#true} assume !(0 == ~cond); {5917#true} is VALID [2022-04-08 04:46:01,723 INFO L290 TraceCheckUtils]: 15: Hoare triple {5917#true} assume true; {5917#true} is VALID [2022-04-08 04:46:01,723 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {5917#true} {5917#true} #63#return; {5917#true} is VALID [2022-04-08 04:46:01,723 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-08 04:46:01,724 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-08 04:46:01,724 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-08 04:46:01,724 INFO L290 TraceCheckUtils]: 20: Hoare triple {5917#true} ~cond := #in~cond; {5917#true} is VALID [2022-04-08 04:46:01,724 INFO L290 TraceCheckUtils]: 21: Hoare triple {5917#true} assume !(0 == ~cond); {5917#true} is VALID [2022-04-08 04:46:01,724 INFO L290 TraceCheckUtils]: 22: Hoare triple {5917#true} assume true; {5917#true} is VALID [2022-04-08 04:46:01,725 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-08 04:46:01,725 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-08 04:46:01,726 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-08 04:46:01,727 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-08 04:46:01,728 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-08 04:46:01,728 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-08 04:46:01,728 INFO L290 TraceCheckUtils]: 29: Hoare triple {5917#true} ~cond := #in~cond; {6012#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 04:46:01,729 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-08 04:46:01,729 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-08 04:46:01,730 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-08 04:46:01,731 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-08 04:46:01,732 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-08 04:46:01,732 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-08 04:46:01,733 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-08 04:46:01,733 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-08 04:46:01,733 INFO L290 TraceCheckUtils]: 38: Hoare triple {5917#true} ~cond := #in~cond; {6012#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 04:46:01,734 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-08 04:46:01,734 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-08 04:46:01,735 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-08 04:46:01,736 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-08 04:46:01,736 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-08 04:46:01,737 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-08 04:46:01,738 INFO L290 TraceCheckUtils]: 45: Hoare triple {6065#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {6069#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 04:46:01,738 INFO L290 TraceCheckUtils]: 46: Hoare triple {6069#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {5918#false} is VALID [2022-04-08 04:46:01,738 INFO L290 TraceCheckUtils]: 47: Hoare triple {5918#false} assume !false; {5918#false} is VALID [2022-04-08 04:46:01,738 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-08 04:46:01,738 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 04:46:02,474 INFO L290 TraceCheckUtils]: 47: Hoare triple {5918#false} assume !false; {5918#false} is VALID [2022-04-08 04:46:02,475 INFO L290 TraceCheckUtils]: 46: Hoare triple {6069#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {5918#false} is VALID [2022-04-08 04:46:02,475 INFO L290 TraceCheckUtils]: 45: Hoare triple {6065#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {6069#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 04:46:02,476 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-08 04:46:02,477 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-08 04:46:02,478 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-08 04:46:02,479 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-08 04:46:02,479 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-08 04:46:02,480 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-08 04:46:02,480 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-08 04:46:02,480 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-08 04:46:02,481 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-08 04:46:02,562 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-08 04:46:02,595 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-08 04:46:02,597 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-08 04:46:02,597 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {5917#true} {5917#true} #65#return; {5917#true} is VALID [2022-04-08 04:46:02,597 INFO L290 TraceCheckUtils]: 31: Hoare triple {5917#true} assume true; {5917#true} is VALID [2022-04-08 04:46:02,597 INFO L290 TraceCheckUtils]: 30: Hoare triple {5917#true} assume !(0 == ~cond); {5917#true} is VALID [2022-04-08 04:46:02,597 INFO L290 TraceCheckUtils]: 29: Hoare triple {5917#true} ~cond := #in~cond; {5917#true} is VALID [2022-04-08 04:46:02,597 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-08 04:46:02,597 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-08 04:46:02,597 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-08 04:46:02,598 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-08 04:46:02,598 INFO L290 TraceCheckUtils]: 24: Hoare triple {5917#true} assume !!(~x~0 <= ~X~0); {5917#true} is VALID [2022-04-08 04:46:02,598 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {5917#true} {5917#true} #65#return; {5917#true} is VALID [2022-04-08 04:46:02,598 INFO L290 TraceCheckUtils]: 22: Hoare triple {5917#true} assume true; {5917#true} is VALID [2022-04-08 04:46:02,598 INFO L290 TraceCheckUtils]: 21: Hoare triple {5917#true} assume !(0 == ~cond); {5917#true} is VALID [2022-04-08 04:46:02,598 INFO L290 TraceCheckUtils]: 20: Hoare triple {5917#true} ~cond := #in~cond; {5917#true} is VALID [2022-04-08 04:46:02,598 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-08 04:46:02,598 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-08 04:46:02,598 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-08 04:46:02,598 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {5917#true} {5917#true} #63#return; {5917#true} is VALID [2022-04-08 04:46:02,598 INFO L290 TraceCheckUtils]: 15: Hoare triple {5917#true} assume true; {5917#true} is VALID [2022-04-08 04:46:02,599 INFO L290 TraceCheckUtils]: 14: Hoare triple {5917#true} assume !(0 == ~cond); {5917#true} is VALID [2022-04-08 04:46:02,599 INFO L290 TraceCheckUtils]: 13: Hoare triple {5917#true} ~cond := #in~cond; {5917#true} is VALID [2022-04-08 04:46:02,599 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-08 04:46:02,599 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-08 04:46:02,599 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {5917#true} {5917#true} #61#return; {5917#true} is VALID [2022-04-08 04:46:02,599 INFO L290 TraceCheckUtils]: 9: Hoare triple {5917#true} assume true; {5917#true} is VALID [2022-04-08 04:46:02,599 INFO L290 TraceCheckUtils]: 8: Hoare triple {5917#true} assume !(0 == ~cond); {5917#true} is VALID [2022-04-08 04:46:02,599 INFO L290 TraceCheckUtils]: 7: Hoare triple {5917#true} ~cond := #in~cond; {5917#true} is VALID [2022-04-08 04:46:02,600 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-08 04:46:02,600 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-08 04:46:02,600 INFO L272 TraceCheckUtils]: 4: Hoare triple {5917#true} call #t~ret8 := main(); {5917#true} is VALID [2022-04-08 04:46:02,600 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5917#true} {5917#true} #69#return; {5917#true} is VALID [2022-04-08 04:46:02,600 INFO L290 TraceCheckUtils]: 2: Hoare triple {5917#true} assume true; {5917#true} is VALID [2022-04-08 04:46:02,600 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-08 04:46:02,600 INFO L272 TraceCheckUtils]: 0: Hoare triple {5917#true} call ULTIMATE.init(); {5917#true} is VALID [2022-04-08 04:46:02,601 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-08 04:46:02,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 04:46:02,601 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1237544517] [2022-04-08 04:46:02,601 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 04:46:02,601 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1097045607] [2022-04-08 04:46:02,601 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1097045607] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 04:46:02,601 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 04:46:02,601 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13] total 23 [2022-04-08 04:46:02,602 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 04:46:02,602 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [976445821] [2022-04-08 04:46:02,603 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [976445821] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 04:46:02,603 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 04:46:02,603 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-04-08 04:46:02,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1282604645] [2022-04-08 04:46:02,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 04:46:02,603 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-08 04:46:02,604 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 04:46:02,604 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-08 04:46:02,645 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-08 04:46:02,645 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-08 04:46:02,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 04:46:02,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-08 04:46:02,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=424, Unknown=0, NotChecked=0, Total=506 [2022-04-08 04:46:02,646 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-08 04:46:03,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:46:03,693 INFO L93 Difference]: Finished difference Result 96 states and 103 transitions. [2022-04-08 04:46:03,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-08 04:46:03,694 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-08 04:46:03,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 04:46:03,694 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-08 04:46:03,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 58 transitions. [2022-04-08 04:46:03,695 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-08 04:46:03,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 58 transitions. [2022-04-08 04:46:03,696 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 58 transitions. [2022-04-08 04:46:03,762 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-08 04:46:03,764 INFO L225 Difference]: With dead ends: 96 [2022-04-08 04:46:03,764 INFO L226 Difference]: Without dead ends: 88 [2022-04-08 04:46:03,764 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 71 SyntacticMatches, 3 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=114, Invalid=588, Unknown=0, NotChecked=0, Total=702 [2022-04-08 04:46:03,765 INFO L913 BasicCegarLoop]: 24 mSDtfsCounter, 14 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 361 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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.3s IncrementalHoareTripleChecker+Time [2022-04-08 04:46:03,765 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 189 Invalid, 365 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 361 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-08 04:46:03,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2022-04-08 04:46:03,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 79. [2022-04-08 04:46:03,902 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 04:46:03,902 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-08 04:46:03,902 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-08 04:46:03,902 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-08 04:46:03,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:46:03,904 INFO L93 Difference]: Finished difference Result 88 states and 95 transitions. [2022-04-08 04:46:03,904 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 95 transitions. [2022-04-08 04:46:03,904 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:46:03,904 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:46:03,905 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-08 04:46:03,905 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-08 04:46:03,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:46:03,907 INFO L93 Difference]: Finished difference Result 88 states and 95 transitions. [2022-04-08 04:46:03,907 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 95 transitions. [2022-04-08 04:46:03,907 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:46:03,907 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:46:03,907 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 04:46:03,907 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 04:46:03,907 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-08 04:46:03,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 85 transitions. [2022-04-08 04:46:03,909 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 85 transitions. Word has length 48 [2022-04-08 04:46:03,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 04:46:03,909 INFO L478 AbstractCegarLoop]: Abstraction has 79 states and 85 transitions. [2022-04-08 04:46:03,909 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 2.1538461538461537) internal successors, (28), 14 states have internal predecessors, (28), 5 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-08 04:46:03,909 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 79 states and 85 transitions. [2022-04-08 04:46:04,047 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-08 04:46:04,047 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 85 transitions. [2022-04-08 04:46:04,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-04-08 04:46:04,048 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 04:46:04,048 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 04:46:04,063 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2022-04-08 04:46:04,248 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-04-08 04:46:04,249 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 04:46:04,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 04:46:04,249 INFO L85 PathProgramCache]: Analyzing trace with hash 1311969331, now seen corresponding path program 5 times [2022-04-08 04:46:04,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 04:46:04,249 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2012663851] [2022-04-08 04:46:04,250 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 04:46:04,250 INFO L85 PathProgramCache]: Analyzing trace with hash 1311969331, now seen corresponding path program 6 times [2022-04-08 04:46:04,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 04:46:04,250 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1513337418] [2022-04-08 04:46:04,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 04:46:04,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 04:46:04,270 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 04:46:04,271 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [663575842] [2022-04-08 04:46:04,271 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 04:46:04,271 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 04:46:04,271 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 04:46:04,289 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-08 04:46:04,293 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-08 04:46:04,342 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-04-08 04:46:04,342 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 04:46:04,343 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 60 conjunts are in the unsatisfiable core [2022-04-08 04:46:04,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:46:04,361 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 04:46:14,666 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-08 04:46:31,314 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-08 04:46:31,674 INFO L272 TraceCheckUtils]: 0: Hoare triple {6761#true} call ULTIMATE.init(); {6761#true} is VALID [2022-04-08 04:46:31,674 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-08 04:46:31,674 INFO L290 TraceCheckUtils]: 2: Hoare triple {6761#true} assume true; {6761#true} is VALID [2022-04-08 04:46:31,674 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6761#true} {6761#true} #69#return; {6761#true} is VALID [2022-04-08 04:46:31,674 INFO L272 TraceCheckUtils]: 4: Hoare triple {6761#true} call #t~ret8 := main(); {6761#true} is VALID [2022-04-08 04:46:31,674 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-08 04:46:31,674 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-08 04:46:31,674 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-08 04:46:31,675 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-08 04:46:31,675 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-08 04:46:31,676 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-08 04:46:31,676 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-08 04:46:31,676 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-08 04:46:31,676 INFO L290 TraceCheckUtils]: 13: Hoare triple {6761#true} ~cond := #in~cond; {6761#true} is VALID [2022-04-08 04:46:31,676 INFO L290 TraceCheckUtils]: 14: Hoare triple {6761#true} assume !(0 == ~cond); {6761#true} is VALID [2022-04-08 04:46:31,676 INFO L290 TraceCheckUtils]: 15: Hoare triple {6761#true} assume true; {6761#true} is VALID [2022-04-08 04:46:31,677 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-08 04:46:31,677 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-08 04:46:31,677 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-08 04:46:31,678 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-08 04:46:31,678 INFO L290 TraceCheckUtils]: 20: Hoare triple {6761#true} ~cond := #in~cond; {6831#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 04:46:31,678 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-08 04:46:31,678 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-08 04:46:31,679 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-08 04:46:31,680 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-08 04:46:31,680 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-08 04:46:31,681 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-08 04:46:33,682 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-08 04:46:33,683 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-08 04:46:33,683 INFO L290 TraceCheckUtils]: 29: Hoare triple {6761#true} ~cond := #in~cond; {6831#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 04:46:33,683 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-08 04:46:33,684 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-08 04:46:33,684 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-08 04:46:33,685 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-08 04:46:33,686 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-08 04:46:33,686 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-08 04:46:33,686 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-08 04:46:33,687 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-08 04:46:33,687 INFO L290 TraceCheckUtils]: 38: Hoare triple {6761#true} ~cond := #in~cond; {6831#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 04:46:33,687 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-08 04:46:33,687 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-08 04:46:33,689 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-08 04:46:33,689 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-08 04:46:33,690 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-08 04:46:33,692 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-08 04:46:33,694 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-08 04:46:33,695 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-08 04:46:33,695 INFO L290 TraceCheckUtils]: 47: Hoare triple {6921#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {6925#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 04:46:33,696 INFO L290 TraceCheckUtils]: 48: Hoare triple {6925#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {6762#false} is VALID [2022-04-08 04:46:33,696 INFO L290 TraceCheckUtils]: 49: Hoare triple {6762#false} assume !false; {6762#false} is VALID [2022-04-08 04:46:33,696 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-08 04:46:33,696 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 04:46:39,686 INFO L290 TraceCheckUtils]: 49: Hoare triple {6762#false} assume !false; {6762#false} is VALID [2022-04-08 04:46:39,686 INFO L290 TraceCheckUtils]: 48: Hoare triple {6925#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {6762#false} is VALID [2022-04-08 04:46:39,687 INFO L290 TraceCheckUtils]: 47: Hoare triple {6921#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {6925#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 04:46:39,687 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-08 04:46:39,689 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-08 04:46:39,691 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-08 04:46:39,693 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-08 04:46:39,693 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-08 04:46:39,694 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-08 04:46:39,695 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-08 04:46:39,695 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-08 04:46:39,696 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-08 04:46:39,696 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-08 04:46:39,697 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-08 04:46:39,697 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-08 04:46:39,697 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-08 04:46:39,697 INFO L290 TraceCheckUtils]: 33: Hoare triple {6761#true} assume !!(~x~0 <= ~X~0); {6761#true} is VALID [2022-04-08 04:46:39,697 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {6761#true} {6761#true} #65#return; {6761#true} is VALID [2022-04-08 04:46:39,697 INFO L290 TraceCheckUtils]: 31: Hoare triple {6761#true} assume true; {6761#true} is VALID [2022-04-08 04:46:39,697 INFO L290 TraceCheckUtils]: 30: Hoare triple {6761#true} assume !(0 == ~cond); {6761#true} is VALID [2022-04-08 04:46:39,697 INFO L290 TraceCheckUtils]: 29: Hoare triple {6761#true} ~cond := #in~cond; {6761#true} is VALID [2022-04-08 04:46:39,697 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-08 04:46:39,698 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-08 04:46:39,698 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-08 04:46:39,698 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-08 04:46:39,698 INFO L290 TraceCheckUtils]: 24: Hoare triple {6761#true} assume !!(~x~0 <= ~X~0); {6761#true} is VALID [2022-04-08 04:46:39,698 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {6761#true} {6761#true} #65#return; {6761#true} is VALID [2022-04-08 04:46:39,698 INFO L290 TraceCheckUtils]: 22: Hoare triple {6761#true} assume true; {6761#true} is VALID [2022-04-08 04:46:39,698 INFO L290 TraceCheckUtils]: 21: Hoare triple {6761#true} assume !(0 == ~cond); {6761#true} is VALID [2022-04-08 04:46:39,698 INFO L290 TraceCheckUtils]: 20: Hoare triple {6761#true} ~cond := #in~cond; {6761#true} is VALID [2022-04-08 04:46:39,698 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-08 04:46:39,698 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-08 04:46:39,698 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-08 04:46:39,699 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {6761#true} {6761#true} #63#return; {6761#true} is VALID [2022-04-08 04:46:39,699 INFO L290 TraceCheckUtils]: 15: Hoare triple {6761#true} assume true; {6761#true} is VALID [2022-04-08 04:46:39,699 INFO L290 TraceCheckUtils]: 14: Hoare triple {6761#true} assume !(0 == ~cond); {6761#true} is VALID [2022-04-08 04:46:39,699 INFO L290 TraceCheckUtils]: 13: Hoare triple {6761#true} ~cond := #in~cond; {6761#true} is VALID [2022-04-08 04:46:39,699 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-08 04:46:39,699 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-08 04:46:39,699 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {6761#true} {6761#true} #61#return; {6761#true} is VALID [2022-04-08 04:46:39,699 INFO L290 TraceCheckUtils]: 9: Hoare triple {6761#true} assume true; {6761#true} is VALID [2022-04-08 04:46:39,699 INFO L290 TraceCheckUtils]: 8: Hoare triple {6761#true} assume !(0 == ~cond); {6761#true} is VALID [2022-04-08 04:46:39,699 INFO L290 TraceCheckUtils]: 7: Hoare triple {6761#true} ~cond := #in~cond; {6761#true} is VALID [2022-04-08 04:46:39,700 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-08 04:46:39,700 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-08 04:46:39,700 INFO L272 TraceCheckUtils]: 4: Hoare triple {6761#true} call #t~ret8 := main(); {6761#true} is VALID [2022-04-08 04:46:39,700 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6761#true} {6761#true} #69#return; {6761#true} is VALID [2022-04-08 04:46:39,700 INFO L290 TraceCheckUtils]: 2: Hoare triple {6761#true} assume true; {6761#true} is VALID [2022-04-08 04:46:39,700 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-08 04:46:39,700 INFO L272 TraceCheckUtils]: 0: Hoare triple {6761#true} call ULTIMATE.init(); {6761#true} is VALID [2022-04-08 04:46:39,700 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-08 04:46:39,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 04:46:39,701 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1513337418] [2022-04-08 04:46:39,701 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 04:46:39,701 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [663575842] [2022-04-08 04:46:39,701 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [663575842] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 04:46:39,701 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 04:46:39,701 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 11] total 27 [2022-04-08 04:46:39,701 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 04:46:39,701 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2012663851] [2022-04-08 04:46:39,702 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2012663851] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 04:46:39,702 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 04:46:39,702 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2022-04-08 04:46:39,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [227616884] [2022-04-08 04:46:39,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 04:46:39,702 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-08 04:46:39,703 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 04:46:39,703 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-08 04:46:41,756 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-08 04:46:41,756 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-04-08 04:46:41,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 04:46:41,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-04-08 04:46:41,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=604, Unknown=0, NotChecked=0, Total=702 [2022-04-08 04:46:41,757 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-08 04:46:47,651 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-08 04:46:47,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:46:47,773 INFO L93 Difference]: Finished difference Result 101 states and 112 transitions. [2022-04-08 04:46:47,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-04-08 04:46:47,773 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-08 04:46:47,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 04:46:47,773 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-08 04:46:47,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 76 transitions. [2022-04-08 04:46:47,775 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-08 04:46:47,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 76 transitions. [2022-04-08 04:46:47,776 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 76 transitions. [2022-04-08 04:46:49,872 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-08 04:46:49,874 INFO L225 Difference]: With dead ends: 101 [2022-04-08 04:46:49,874 INFO L226 Difference]: Without dead ends: 88 [2022-04-08 04:46:49,874 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 72 SyntacticMatches, 2 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 253 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=149, Invalid=973, Unknown=0, NotChecked=0, Total=1122 [2022-04-08 04:46:49,875 INFO L913 BasicCegarLoop]: 20 mSDtfsCounter, 32 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 538 mSolverCounterSat, 17 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 556 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 538 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2022-04-08 04:46:49,875 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [35 Valid, 163 Invalid, 556 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 538 Invalid, 1 Unknown, 0 Unchecked, 2.8s Time] [2022-04-08 04:46:49,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2022-04-08 04:46:50,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 79. [2022-04-08 04:46:50,018 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 04:46:50,018 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-08 04:46:50,018 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-08 04:46:50,018 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-08 04:46:50,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:46:50,020 INFO L93 Difference]: Finished difference Result 88 states and 94 transitions. [2022-04-08 04:46:50,020 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 94 transitions. [2022-04-08 04:46:50,021 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:46:50,021 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:46:50,021 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-08 04:46:50,021 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-08 04:46:50,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:46:50,023 INFO L93 Difference]: Finished difference Result 88 states and 94 transitions. [2022-04-08 04:46:50,023 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 94 transitions. [2022-04-08 04:46:50,023 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:46:50,023 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:46:50,023 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 04:46:50,024 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 04:46:50,024 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-08 04:46:50,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 85 transitions. [2022-04-08 04:46:50,025 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 85 transitions. Word has length 50 [2022-04-08 04:46:50,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 04:46:50,025 INFO L478 AbstractCegarLoop]: Abstraction has 79 states and 85 transitions. [2022-04-08 04:46:50,026 INFO L479 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-08 04:46:50,026 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 79 states and 85 transitions. [2022-04-08 04:46:50,174 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-08 04:46:50,174 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 85 transitions. [2022-04-08 04:46:50,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-04-08 04:46:50,174 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 04:46:50,174 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 04:46:50,192 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-08 04:46:50,375 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-04-08 04:46:50,375 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 04:46:50,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 04:46:50,376 INFO L85 PathProgramCache]: Analyzing trace with hash -1484106385, now seen corresponding path program 7 times [2022-04-08 04:46:50,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 04:46:50,376 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [510759623] [2022-04-08 04:46:50,376 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 04:46:50,376 INFO L85 PathProgramCache]: Analyzing trace with hash -1484106385, now seen corresponding path program 8 times [2022-04-08 04:46:50,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 04:46:50,376 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [994407031] [2022-04-08 04:46:50,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 04:46:50,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 04:46:50,388 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 04:46:50,388 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [975195126] [2022-04-08 04:46:50,388 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 04:46:50,389 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 04:46:50,389 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 04:46:50,390 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-08 04:46:50,405 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-08 04:46:50,455 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 04:46:50,455 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 04:46:50,456 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 41 conjunts are in the unsatisfiable core [2022-04-08 04:46:50,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:46:50,469 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 04:47:06,821 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-08 04:47:12,843 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-08 04:47:16,151 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-08 04:47:29,917 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-08 04:47:37,970 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-08 04:47:58,616 INFO L272 TraceCheckUtils]: 0: Hoare triple {7637#true} call ULTIMATE.init(); {7637#true} is VALID [2022-04-08 04:47:58,616 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-08 04:47:58,616 INFO L290 TraceCheckUtils]: 2: Hoare triple {7637#true} assume true; {7637#true} is VALID [2022-04-08 04:47:58,616 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7637#true} {7637#true} #69#return; {7637#true} is VALID [2022-04-08 04:47:58,616 INFO L272 TraceCheckUtils]: 4: Hoare triple {7637#true} call #t~ret8 := main(); {7637#true} is VALID [2022-04-08 04:47:58,616 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-08 04:47:58,617 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-08 04:47:58,617 INFO L290 TraceCheckUtils]: 7: Hoare triple {7637#true} ~cond := #in~cond; {7637#true} is VALID [2022-04-08 04:47:58,617 INFO L290 TraceCheckUtils]: 8: Hoare triple {7637#true} assume !(0 == ~cond); {7637#true} is VALID [2022-04-08 04:47:58,617 INFO L290 TraceCheckUtils]: 9: Hoare triple {7637#true} assume true; {7637#true} is VALID [2022-04-08 04:47:58,617 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {7637#true} {7637#true} #61#return; {7637#true} is VALID [2022-04-08 04:47:58,617 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-08 04:47:58,617 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-08 04:47:58,617 INFO L290 TraceCheckUtils]: 13: Hoare triple {7637#true} ~cond := #in~cond; {7637#true} is VALID [2022-04-08 04:47:58,617 INFO L290 TraceCheckUtils]: 14: Hoare triple {7637#true} assume !(0 == ~cond); {7637#true} is VALID [2022-04-08 04:47:58,617 INFO L290 TraceCheckUtils]: 15: Hoare triple {7637#true} assume true; {7637#true} is VALID [2022-04-08 04:47:58,617 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {7637#true} {7637#true} #63#return; {7637#true} is VALID [2022-04-08 04:47:58,618 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-08 04:47:58,618 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-08 04:47:58,618 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-08 04:47:58,618 INFO L290 TraceCheckUtils]: 20: Hoare triple {7637#true} ~cond := #in~cond; {7637#true} is VALID [2022-04-08 04:47:58,618 INFO L290 TraceCheckUtils]: 21: Hoare triple {7637#true} assume !(0 == ~cond); {7637#true} is VALID [2022-04-08 04:47:58,618 INFO L290 TraceCheckUtils]: 22: Hoare triple {7637#true} assume true; {7637#true} is VALID [2022-04-08 04:47:58,619 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-08 04:47:58,619 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-08 04:47:58,620 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-08 04:47:58,620 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-08 04:47:58,621 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-08 04:47:58,621 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-08 04:47:58,621 INFO L290 TraceCheckUtils]: 29: Hoare triple {7637#true} ~cond := #in~cond; {7732#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 04:47:58,621 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-08 04:47:58,622 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-08 04:47:58,622 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-08 04:47:58,622 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-08 04:47:58,623 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-08 04:47:58,624 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-08 04:47:58,624 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-08 04:47:58,624 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-08 04:47:58,624 INFO L290 TraceCheckUtils]: 38: Hoare triple {7637#true} ~cond := #in~cond; {7732#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 04:47:58,625 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-08 04:47:58,625 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-08 04:47:58,626 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-08 04:47:58,627 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-08 04:47:58,627 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-08 04:47:58,629 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-08 04:48:00,631 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-08 04:48:00,639 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-08 04:48:00,640 INFO L290 TraceCheckUtils]: 47: Hoare triple {7792#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {7796#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 04:48:00,640 INFO L290 TraceCheckUtils]: 48: Hoare triple {7796#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {7638#false} is VALID [2022-04-08 04:48:00,640 INFO L290 TraceCheckUtils]: 49: Hoare triple {7638#false} assume !false; {7638#false} is VALID [2022-04-08 04:48:00,641 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-08 04:48:00,641 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 04:48:03,854 INFO L290 TraceCheckUtils]: 49: Hoare triple {7638#false} assume !false; {7638#false} is VALID [2022-04-08 04:48:03,855 INFO L290 TraceCheckUtils]: 48: Hoare triple {7796#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {7638#false} is VALID [2022-04-08 04:48:03,855 INFO L290 TraceCheckUtils]: 47: Hoare triple {7792#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {7796#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 04:48:03,856 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-08 04:48:03,857 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-08 04:48:03,858 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-08 04:48:03,859 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-08 04:48:03,859 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-08 04:48:03,860 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-08 04:48:03,860 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-08 04:48:03,861 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-08 04:48:03,861 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-08 04:48:03,861 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-08 04:48:03,862 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-08 04:48:03,862 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-08 04:48:03,862 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-08 04:48:03,862 INFO L290 TraceCheckUtils]: 33: Hoare triple {7637#true} assume !!(~x~0 <= ~X~0); {7637#true} is VALID [2022-04-08 04:48:03,862 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {7637#true} {7637#true} #65#return; {7637#true} is VALID [2022-04-08 04:48:03,862 INFO L290 TraceCheckUtils]: 31: Hoare triple {7637#true} assume true; {7637#true} is VALID [2022-04-08 04:48:03,862 INFO L290 TraceCheckUtils]: 30: Hoare triple {7637#true} assume !(0 == ~cond); {7637#true} is VALID [2022-04-08 04:48:03,862 INFO L290 TraceCheckUtils]: 29: Hoare triple {7637#true} ~cond := #in~cond; {7637#true} is VALID [2022-04-08 04:48:03,862 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-08 04:48:03,863 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-08 04:48:03,863 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-08 04:48:03,863 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-08 04:48:03,863 INFO L290 TraceCheckUtils]: 24: Hoare triple {7637#true} assume !!(~x~0 <= ~X~0); {7637#true} is VALID [2022-04-08 04:48:03,863 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {7637#true} {7637#true} #65#return; {7637#true} is VALID [2022-04-08 04:48:03,863 INFO L290 TraceCheckUtils]: 22: Hoare triple {7637#true} assume true; {7637#true} is VALID [2022-04-08 04:48:03,863 INFO L290 TraceCheckUtils]: 21: Hoare triple {7637#true} assume !(0 == ~cond); {7637#true} is VALID [2022-04-08 04:48:03,863 INFO L290 TraceCheckUtils]: 20: Hoare triple {7637#true} ~cond := #in~cond; {7637#true} is VALID [2022-04-08 04:48:03,863 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-08 04:48:03,863 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-08 04:48:03,863 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-08 04:48:03,863 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {7637#true} {7637#true} #63#return; {7637#true} is VALID [2022-04-08 04:48:03,863 INFO L290 TraceCheckUtils]: 15: Hoare triple {7637#true} assume true; {7637#true} is VALID [2022-04-08 04:48:03,863 INFO L290 TraceCheckUtils]: 14: Hoare triple {7637#true} assume !(0 == ~cond); {7637#true} is VALID [2022-04-08 04:48:03,864 INFO L290 TraceCheckUtils]: 13: Hoare triple {7637#true} ~cond := #in~cond; {7637#true} is VALID [2022-04-08 04:48:03,864 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-08 04:48:03,864 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-08 04:48:03,864 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {7637#true} {7637#true} #61#return; {7637#true} is VALID [2022-04-08 04:48:03,864 INFO L290 TraceCheckUtils]: 9: Hoare triple {7637#true} assume true; {7637#true} is VALID [2022-04-08 04:48:03,864 INFO L290 TraceCheckUtils]: 8: Hoare triple {7637#true} assume !(0 == ~cond); {7637#true} is VALID [2022-04-08 04:48:03,864 INFO L290 TraceCheckUtils]: 7: Hoare triple {7637#true} ~cond := #in~cond; {7637#true} is VALID [2022-04-08 04:48:03,864 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-08 04:48:03,864 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-08 04:48:03,864 INFO L272 TraceCheckUtils]: 4: Hoare triple {7637#true} call #t~ret8 := main(); {7637#true} is VALID [2022-04-08 04:48:03,864 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7637#true} {7637#true} #69#return; {7637#true} is VALID [2022-04-08 04:48:03,864 INFO L290 TraceCheckUtils]: 2: Hoare triple {7637#true} assume true; {7637#true} is VALID [2022-04-08 04:48:03,864 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-08 04:48:03,864 INFO L272 TraceCheckUtils]: 0: Hoare triple {7637#true} call ULTIMATE.init(); {7637#true} is VALID [2022-04-08 04:48:03,865 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-08 04:48:03,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 04:48:03,865 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [994407031] [2022-04-08 04:48:03,865 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 04:48:03,865 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [975195126] [2022-04-08 04:48:03,865 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [975195126] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 04:48:03,865 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 04:48:03,865 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 10] total 21 [2022-04-08 04:48:03,866 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 04:48:03,866 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [510759623] [2022-04-08 04:48:03,866 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [510759623] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 04:48:03,866 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 04:48:03,866 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-04-08 04:48:03,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [42608138] [2022-04-08 04:48:03,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 04:48:03,867 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-08 04:48:03,867 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 04:48:03,867 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-08 04:48:05,914 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-08 04:48:05,914 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-08 04:48:05,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 04:48:05,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-08 04:48:05,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=364, Unknown=1, NotChecked=0, Total=420 [2022-04-08 04:48:05,915 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-08 04:48:14,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:48:14,936 INFO L93 Difference]: Finished difference Result 93 states and 100 transitions. [2022-04-08 04:48:14,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-08 04:48:14,936 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-08 04:48:14,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 04:48:14,937 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-08 04:48:14,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 58 transitions. [2022-04-08 04:48:14,938 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-08 04:48:14,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 58 transitions. [2022-04-08 04:48:14,938 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 58 transitions. [2022-04-08 04:48:17,010 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-08 04:48:17,011 INFO L225 Difference]: With dead ends: 93 [2022-04-08 04:48:17,011 INFO L226 Difference]: Without dead ends: 91 [2022-04-08 04:48:17,012 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 78 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 10.6s TimeCoverageRelationStatistics Valid=88, Invalid=560, Unknown=2, NotChecked=0, Total=650 [2022-04-08 04:48:17,012 INFO L913 BasicCegarLoop]: 28 mSDtfsCounter, 18 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 302 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s 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.6s IncrementalHoareTripleChecker+Time [2022-04-08 04:48:17,013 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [19 Valid, 210 Invalid, 344 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 302 Invalid, 0 Unknown, 39 Unchecked, 0.6s Time] [2022-04-08 04:48:17,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2022-04-08 04:48:17,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2022-04-08 04:48:17,180 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 04:48:17,180 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-08 04:48:17,180 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-08 04:48:17,181 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-08 04:48:17,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:48:17,183 INFO L93 Difference]: Finished difference Result 91 states and 98 transitions. [2022-04-08 04:48:17,183 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 98 transitions. [2022-04-08 04:48:17,183 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:48:17,183 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:48:17,183 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-08 04:48:17,184 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-08 04:48:17,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:48:17,185 INFO L93 Difference]: Finished difference Result 91 states and 98 transitions. [2022-04-08 04:48:17,186 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 98 transitions. [2022-04-08 04:48:17,186 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:48:17,186 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:48:17,186 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 04:48:17,186 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 04:48:17,186 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-08 04:48:17,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 98 transitions. [2022-04-08 04:48:17,188 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 98 transitions. Word has length 50 [2022-04-08 04:48:17,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 04:48:17,188 INFO L478 AbstractCegarLoop]: Abstraction has 91 states and 98 transitions. [2022-04-08 04:48:17,188 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 15 states have internal predecessors, (30), 5 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-08 04:48:17,189 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 91 states and 98 transitions. [2022-04-08 04:48:19,394 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-08 04:48:19,395 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 98 transitions. [2022-04-08 04:48:19,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-04-08 04:48:19,396 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 04:48:19,396 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 04:48:19,412 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-08 04:48:19,596 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-04-08 04:48:19,596 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 04:48:19,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 04:48:19,597 INFO L85 PathProgramCache]: Analyzing trace with hash -322489421, now seen corresponding path program 9 times [2022-04-08 04:48:19,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 04:48:19,597 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1668448001] [2022-04-08 04:48:19,597 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 04:48:19,597 INFO L85 PathProgramCache]: Analyzing trace with hash -322489421, now seen corresponding path program 10 times [2022-04-08 04:48:19,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 04:48:19,597 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1854788830] [2022-04-08 04:48:19,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 04:48:19,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 04:48:19,608 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 04:48:19,608 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2078411948] [2022-04-08 04:48:19,608 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 04:48:19,608 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 04:48:19,609 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 04:48:19,609 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-08 04:48:19,614 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-08 04:48:19,652 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 04:48:19,652 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 04:48:19,652 INFO L263 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-08 04:48:19,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:48:19,662 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 04:48:20,026 INFO L272 TraceCheckUtils]: 0: Hoare triple {8517#true} call ULTIMATE.init(); {8517#true} is VALID [2022-04-08 04:48:20,026 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-08 04:48:20,026 INFO L290 TraceCheckUtils]: 2: Hoare triple {8517#true} assume true; {8517#true} is VALID [2022-04-08 04:48:20,026 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8517#true} {8517#true} #69#return; {8517#true} is VALID [2022-04-08 04:48:20,027 INFO L272 TraceCheckUtils]: 4: Hoare triple {8517#true} call #t~ret8 := main(); {8517#true} is VALID [2022-04-08 04:48:20,027 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-08 04:48:20,027 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-08 04:48:20,027 INFO L290 TraceCheckUtils]: 7: Hoare triple {8517#true} ~cond := #in~cond; {8517#true} is VALID [2022-04-08 04:48:20,027 INFO L290 TraceCheckUtils]: 8: Hoare triple {8517#true} assume !(0 == ~cond); {8517#true} is VALID [2022-04-08 04:48:20,027 INFO L290 TraceCheckUtils]: 9: Hoare triple {8517#true} assume true; {8517#true} is VALID [2022-04-08 04:48:20,027 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {8517#true} {8517#true} #61#return; {8517#true} is VALID [2022-04-08 04:48:20,027 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-08 04:48:20,027 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-08 04:48:20,027 INFO L290 TraceCheckUtils]: 13: Hoare triple {8517#true} ~cond := #in~cond; {8517#true} is VALID [2022-04-08 04:48:20,027 INFO L290 TraceCheckUtils]: 14: Hoare triple {8517#true} assume !(0 == ~cond); {8517#true} is VALID [2022-04-08 04:48:20,027 INFO L290 TraceCheckUtils]: 15: Hoare triple {8517#true} assume true; {8517#true} is VALID [2022-04-08 04:48:20,027 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {8517#true} {8517#true} #63#return; {8517#true} is VALID [2022-04-08 04:48:20,028 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-08 04:48:20,028 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-08 04:48:20,028 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-08 04:48:20,028 INFO L290 TraceCheckUtils]: 20: Hoare triple {8517#true} ~cond := #in~cond; {8517#true} is VALID [2022-04-08 04:48:20,028 INFO L290 TraceCheckUtils]: 21: Hoare triple {8517#true} assume !(0 == ~cond); {8517#true} is VALID [2022-04-08 04:48:20,028 INFO L290 TraceCheckUtils]: 22: Hoare triple {8517#true} assume true; {8517#true} is VALID [2022-04-08 04:48:20,029 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-08 04:48:20,029 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-08 04:48:20,030 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-08 04:48:20,030 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-08 04:48:20,031 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-08 04:48:20,031 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-08 04:48:20,031 INFO L290 TraceCheckUtils]: 29: Hoare triple {8517#true} ~cond := #in~cond; {8517#true} is VALID [2022-04-08 04:48:20,031 INFO L290 TraceCheckUtils]: 30: Hoare triple {8517#true} assume !(0 == ~cond); {8517#true} is VALID [2022-04-08 04:48:20,031 INFO L290 TraceCheckUtils]: 31: Hoare triple {8517#true} assume true; {8517#true} is VALID [2022-04-08 04:48:20,032 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-08 04:48:20,032 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-08 04:48:20,033 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-08 04:48:20,033 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-08 04:48:20,033 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-08 04:48:20,033 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-08 04:48:20,033 INFO L290 TraceCheckUtils]: 38: Hoare triple {8517#true} ~cond := #in~cond; {8517#true} is VALID [2022-04-08 04:48:20,033 INFO L290 TraceCheckUtils]: 39: Hoare triple {8517#true} assume !(0 == ~cond); {8517#true} is VALID [2022-04-08 04:48:20,033 INFO L290 TraceCheckUtils]: 40: Hoare triple {8517#true} assume true; {8517#true} is VALID [2022-04-08 04:48:20,034 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-08 04:48:20,034 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-08 04:48:20,035 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-08 04:48:20,035 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-08 04:48:20,035 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-08 04:48:20,035 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-08 04:48:20,035 INFO L290 TraceCheckUtils]: 47: Hoare triple {8518#false} ~cond := #in~cond; {8518#false} is VALID [2022-04-08 04:48:20,035 INFO L290 TraceCheckUtils]: 48: Hoare triple {8518#false} assume 0 == ~cond; {8518#false} is VALID [2022-04-08 04:48:20,035 INFO L290 TraceCheckUtils]: 49: Hoare triple {8518#false} assume !false; {8518#false} is VALID [2022-04-08 04:48:20,036 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-08 04:48:20,036 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 04:48:20,514 INFO L290 TraceCheckUtils]: 49: Hoare triple {8518#false} assume !false; {8518#false} is VALID [2022-04-08 04:48:20,514 INFO L290 TraceCheckUtils]: 48: Hoare triple {8518#false} assume 0 == ~cond; {8518#false} is VALID [2022-04-08 04:48:20,514 INFO L290 TraceCheckUtils]: 47: Hoare triple {8518#false} ~cond := #in~cond; {8518#false} is VALID [2022-04-08 04:48:20,514 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-08 04:48:20,514 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-08 04:48:20,515 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-08 04:48:20,515 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-08 04:48:20,515 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-08 04:48:20,516 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-08 04:48:20,516 INFO L290 TraceCheckUtils]: 40: Hoare triple {8517#true} assume true; {8517#true} is VALID [2022-04-08 04:48:20,516 INFO L290 TraceCheckUtils]: 39: Hoare triple {8517#true} assume !(0 == ~cond); {8517#true} is VALID [2022-04-08 04:48:20,516 INFO L290 TraceCheckUtils]: 38: Hoare triple {8517#true} ~cond := #in~cond; {8517#true} is VALID [2022-04-08 04:48:20,516 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-08 04:48:20,517 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-08 04:48:20,517 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-08 04:48:20,518 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-08 04:48:20,518 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-08 04:48:20,518 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-08 04:48:20,518 INFO L290 TraceCheckUtils]: 31: Hoare triple {8517#true} assume true; {8517#true} is VALID [2022-04-08 04:48:20,518 INFO L290 TraceCheckUtils]: 30: Hoare triple {8517#true} assume !(0 == ~cond); {8517#true} is VALID [2022-04-08 04:48:20,519 INFO L290 TraceCheckUtils]: 29: Hoare triple {8517#true} ~cond := #in~cond; {8517#true} is VALID [2022-04-08 04:48:20,519 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-08 04:48:20,519 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-08 04:48:20,519 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-08 04:48:20,520 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-08 04:48:20,520 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-08 04:48:20,521 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-08 04:48:20,521 INFO L290 TraceCheckUtils]: 22: Hoare triple {8517#true} assume true; {8517#true} is VALID [2022-04-08 04:48:20,521 INFO L290 TraceCheckUtils]: 21: Hoare triple {8517#true} assume !(0 == ~cond); {8517#true} is VALID [2022-04-08 04:48:20,521 INFO L290 TraceCheckUtils]: 20: Hoare triple {8517#true} ~cond := #in~cond; {8517#true} is VALID [2022-04-08 04:48:20,521 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-08 04:48:20,522 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-08 04:48:20,522 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-08 04:48:20,522 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {8517#true} {8517#true} #63#return; {8517#true} is VALID [2022-04-08 04:48:20,522 INFO L290 TraceCheckUtils]: 15: Hoare triple {8517#true} assume true; {8517#true} is VALID [2022-04-08 04:48:20,522 INFO L290 TraceCheckUtils]: 14: Hoare triple {8517#true} assume !(0 == ~cond); {8517#true} is VALID [2022-04-08 04:48:20,523 INFO L290 TraceCheckUtils]: 13: Hoare triple {8517#true} ~cond := #in~cond; {8517#true} is VALID [2022-04-08 04:48:20,523 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-08 04:48:20,523 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-08 04:48:20,523 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {8517#true} {8517#true} #61#return; {8517#true} is VALID [2022-04-08 04:48:20,523 INFO L290 TraceCheckUtils]: 9: Hoare triple {8517#true} assume true; {8517#true} is VALID [2022-04-08 04:48:20,523 INFO L290 TraceCheckUtils]: 8: Hoare triple {8517#true} assume !(0 == ~cond); {8517#true} is VALID [2022-04-08 04:48:20,523 INFO L290 TraceCheckUtils]: 7: Hoare triple {8517#true} ~cond := #in~cond; {8517#true} is VALID [2022-04-08 04:48:20,523 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-08 04:48:20,523 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-08 04:48:20,523 INFO L272 TraceCheckUtils]: 4: Hoare triple {8517#true} call #t~ret8 := main(); {8517#true} is VALID [2022-04-08 04:48:20,523 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8517#true} {8517#true} #69#return; {8517#true} is VALID [2022-04-08 04:48:20,523 INFO L290 TraceCheckUtils]: 2: Hoare triple {8517#true} assume true; {8517#true} is VALID [2022-04-08 04:48:20,523 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-08 04:48:20,523 INFO L272 TraceCheckUtils]: 0: Hoare triple {8517#true} call ULTIMATE.init(); {8517#true} is VALID [2022-04-08 04:48:20,524 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-08 04:48:20,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 04:48:20,524 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1854788830] [2022-04-08 04:48:20,524 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 04:48:20,524 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2078411948] [2022-04-08 04:48:20,524 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2078411948] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 04:48:20,524 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 04:48:20,524 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2022-04-08 04:48:20,524 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 04:48:20,524 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1668448001] [2022-04-08 04:48:20,524 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1668448001] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 04:48:20,525 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 04:48:20,525 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 04:48:20,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [534961233] [2022-04-08 04:48:20,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 04:48:20,525 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-08 04:48:20,525 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 04:48:20,525 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-08 04:48:20,557 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-08 04:48:20,557 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 04:48:20,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 04:48:20,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 04:48:20,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-04-08 04:48:20,558 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-08 04:48:20,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:48:20,997 INFO L93 Difference]: Finished difference Result 109 states and 120 transitions. [2022-04-08 04:48:20,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 04:48:20,997 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-08 04:48:20,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 04:48:20,997 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-08 04:48:20,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 65 transitions. [2022-04-08 04:48:20,998 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-08 04:48:20,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 65 transitions. [2022-04-08 04:48:20,999 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 65 transitions. [2022-04-08 04:48:21,049 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-08 04:48:21,051 INFO L225 Difference]: With dead ends: 109 [2022-04-08 04:48:21,051 INFO L226 Difference]: Without dead ends: 96 [2022-04-08 04:48:21,051 INFO L912 BasicCegarLoop]: 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-08 04:48:21,052 INFO L913 BasicCegarLoop]: 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-08 04:48:21,052 INFO L914 BasicCegarLoop]: 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-08 04:48:21,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2022-04-08 04:48:21,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2022-04-08 04:48:21,267 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 04:48:21,267 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-08 04:48:21,267 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-08 04:48:21,267 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-08 04:48:21,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:48:21,270 INFO L93 Difference]: Finished difference Result 96 states and 104 transitions. [2022-04-08 04:48:21,270 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 104 transitions. [2022-04-08 04:48:21,271 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:48:21,271 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:48:21,271 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-08 04:48:21,271 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-08 04:48:21,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:48:21,273 INFO L93 Difference]: Finished difference Result 96 states and 104 transitions. [2022-04-08 04:48:21,273 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 104 transitions. [2022-04-08 04:48:21,273 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:48:21,273 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:48:21,274 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 04:48:21,274 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 04:48:21,274 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-08 04:48:21,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 104 transitions. [2022-04-08 04:48:21,276 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 104 transitions. Word has length 50 [2022-04-08 04:48:21,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 04:48:21,276 INFO L478 AbstractCegarLoop]: Abstraction has 96 states and 104 transitions. [2022-04-08 04:48:21,276 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 5 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-08 04:48:21,276 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 96 states and 104 transitions. [2022-04-08 04:48:23,495 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-08 04:48:23,496 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 104 transitions. [2022-04-08 04:48:23,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-04-08 04:48:23,496 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 04:48:23,496 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 04:48:23,514 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-04-08 04:48:23,703 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-04-08 04:48:23,703 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 04:48:23,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 04:48:23,704 INFO L85 PathProgramCache]: Analyzing trace with hash 1452517941, now seen corresponding path program 11 times [2022-04-08 04:48:23,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 04:48:23,704 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [319230010] [2022-04-08 04:48:23,704 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 04:48:23,704 INFO L85 PathProgramCache]: Analyzing trace with hash 1452517941, now seen corresponding path program 12 times [2022-04-08 04:48:23,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 04:48:23,704 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1728141374] [2022-04-08 04:48:23,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 04:48:23,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 04:48:23,714 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 04:48:23,715 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1952612499] [2022-04-08 04:48:23,715 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 04:48:23,715 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 04:48:23,715 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 04:48:23,716 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-08 04:48:23,724 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-08 04:48:23,772 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-04-08 04:48:23,772 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 04:48:23,773 INFO L263 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 42 conjunts are in the unsatisfiable core [2022-04-08 04:48:23,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:48:23,784 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 04:48:24,143 INFO L272 TraceCheckUtils]: 0: Hoare triple {9426#true} call ULTIMATE.init(); {9426#true} is VALID [2022-04-08 04:48:24,143 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-08 04:48:24,143 INFO L290 TraceCheckUtils]: 2: Hoare triple {9426#true} assume true; {9426#true} is VALID [2022-04-08 04:48:24,143 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9426#true} {9426#true} #69#return; {9426#true} is VALID [2022-04-08 04:48:24,144 INFO L272 TraceCheckUtils]: 4: Hoare triple {9426#true} call #t~ret8 := main(); {9426#true} is VALID [2022-04-08 04:48:24,144 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-08 04:48:24,144 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-08 04:48:24,144 INFO L290 TraceCheckUtils]: 7: Hoare triple {9426#true} ~cond := #in~cond; {9426#true} is VALID [2022-04-08 04:48:24,144 INFO L290 TraceCheckUtils]: 8: Hoare triple {9426#true} assume !(0 == ~cond); {9426#true} is VALID [2022-04-08 04:48:24,144 INFO L290 TraceCheckUtils]: 9: Hoare triple {9426#true} assume true; {9426#true} is VALID [2022-04-08 04:48:24,144 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {9426#true} {9426#true} #61#return; {9426#true} is VALID [2022-04-08 04:48:24,144 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-08 04:48:24,144 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-08 04:48:24,144 INFO L290 TraceCheckUtils]: 13: Hoare triple {9426#true} ~cond := #in~cond; {9426#true} is VALID [2022-04-08 04:48:24,144 INFO L290 TraceCheckUtils]: 14: Hoare triple {9426#true} assume !(0 == ~cond); {9426#true} is VALID [2022-04-08 04:48:24,144 INFO L290 TraceCheckUtils]: 15: Hoare triple {9426#true} assume true; {9426#true} is VALID [2022-04-08 04:48:24,144 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {9426#true} {9426#true} #63#return; {9426#true} is VALID [2022-04-08 04:48:24,145 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-08 04:48:24,145 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-08 04:48:24,145 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-08 04:48:24,145 INFO L290 TraceCheckUtils]: 20: Hoare triple {9426#true} ~cond := #in~cond; {9426#true} is VALID [2022-04-08 04:48:24,145 INFO L290 TraceCheckUtils]: 21: Hoare triple {9426#true} assume !(0 == ~cond); {9426#true} is VALID [2022-04-08 04:48:24,146 INFO L290 TraceCheckUtils]: 22: Hoare triple {9426#true} assume true; {9426#true} is VALID [2022-04-08 04:48:24,146 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-08 04:48:24,146 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-08 04:48:24,147 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-08 04:48:24,148 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-08 04:48:24,148 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-08 04:48:24,148 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-08 04:48:24,148 INFO L290 TraceCheckUtils]: 29: Hoare triple {9426#true} ~cond := #in~cond; {9522#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 04:48:24,149 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-08 04:48:24,149 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-08 04:48:24,150 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-08 04:48:24,150 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-08 04:48:24,151 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-08 04:48:24,151 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-08 04:48:24,151 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-08 04:48:24,152 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-08 04:48:24,152 INFO L290 TraceCheckUtils]: 38: Hoare triple {9426#true} ~cond := #in~cond; {9426#true} is VALID [2022-04-08 04:48:24,152 INFO L290 TraceCheckUtils]: 39: Hoare triple {9426#true} assume !(0 == ~cond); {9426#true} is VALID [2022-04-08 04:48:24,152 INFO L290 TraceCheckUtils]: 40: Hoare triple {9426#true} assume true; {9426#true} is VALID [2022-04-08 04:48:24,152 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-08 04:48:24,153 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-08 04:48:24,153 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-08 04:48:24,154 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-08 04:48:24,154 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-08 04:48:24,155 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-08 04:48:24,155 INFO L290 TraceCheckUtils]: 47: Hoare triple {9580#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {9584#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 04:48:24,156 INFO L290 TraceCheckUtils]: 48: Hoare triple {9584#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {9427#false} is VALID [2022-04-08 04:48:24,156 INFO L290 TraceCheckUtils]: 49: Hoare triple {9427#false} assume !false; {9427#false} is VALID [2022-04-08 04:48:24,156 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-08 04:48:24,156 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 04:48:28,529 INFO L290 TraceCheckUtils]: 49: Hoare triple {9427#false} assume !false; {9427#false} is VALID [2022-04-08 04:48:28,529 INFO L290 TraceCheckUtils]: 48: Hoare triple {9584#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {9427#false} is VALID [2022-04-08 04:48:28,530 INFO L290 TraceCheckUtils]: 47: Hoare triple {9580#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {9584#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 04:48:28,530 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-08 04:48:28,531 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-08 04:48:28,533 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-08 04:48:28,535 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-08 04:48:28,535 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-08 04:48:28,536 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-08 04:48:28,536 INFO L290 TraceCheckUtils]: 40: Hoare triple {9426#true} assume true; {9426#true} is VALID [2022-04-08 04:48:28,536 INFO L290 TraceCheckUtils]: 39: Hoare triple {9426#true} assume !(0 == ~cond); {9426#true} is VALID [2022-04-08 04:48:28,536 INFO L290 TraceCheckUtils]: 38: Hoare triple {9426#true} ~cond := #in~cond; {9426#true} is VALID [2022-04-08 04:48:28,536 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-08 04:48:28,536 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-08 04:48:28,538 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-08 04:48:28,538 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-08 04:48:28,539 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-08 04:48:28,540 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-08 04:48:28,540 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-08 04:48:28,540 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-08 04:48:28,541 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-08 04:48:28,541 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-08 04:48:28,542 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-08 04:48:28,542 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-08 04:48:28,542 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-08 04:48:28,542 INFO L290 TraceCheckUtils]: 24: Hoare triple {9426#true} assume !!(~x~0 <= ~X~0); {9426#true} is VALID [2022-04-08 04:48:28,542 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {9426#true} {9426#true} #65#return; {9426#true} is VALID [2022-04-08 04:48:28,542 INFO L290 TraceCheckUtils]: 22: Hoare triple {9426#true} assume true; {9426#true} is VALID [2022-04-08 04:48:28,543 INFO L290 TraceCheckUtils]: 21: Hoare triple {9426#true} assume !(0 == ~cond); {9426#true} is VALID [2022-04-08 04:48:28,543 INFO L290 TraceCheckUtils]: 20: Hoare triple {9426#true} ~cond := #in~cond; {9426#true} is VALID [2022-04-08 04:48:28,543 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-08 04:48:28,543 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-08 04:48:28,543 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-08 04:48:28,543 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {9426#true} {9426#true} #63#return; {9426#true} is VALID [2022-04-08 04:48:28,543 INFO L290 TraceCheckUtils]: 15: Hoare triple {9426#true} assume true; {9426#true} is VALID [2022-04-08 04:48:28,543 INFO L290 TraceCheckUtils]: 14: Hoare triple {9426#true} assume !(0 == ~cond); {9426#true} is VALID [2022-04-08 04:48:28,543 INFO L290 TraceCheckUtils]: 13: Hoare triple {9426#true} ~cond := #in~cond; {9426#true} is VALID [2022-04-08 04:48:28,543 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-08 04:48:28,544 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-08 04:48:28,544 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {9426#true} {9426#true} #61#return; {9426#true} is VALID [2022-04-08 04:48:28,544 INFO L290 TraceCheckUtils]: 9: Hoare triple {9426#true} assume true; {9426#true} is VALID [2022-04-08 04:48:28,544 INFO L290 TraceCheckUtils]: 8: Hoare triple {9426#true} assume !(0 == ~cond); {9426#true} is VALID [2022-04-08 04:48:28,544 INFO L290 TraceCheckUtils]: 7: Hoare triple {9426#true} ~cond := #in~cond; {9426#true} is VALID [2022-04-08 04:48:28,544 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-08 04:48:28,544 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-08 04:48:28,544 INFO L272 TraceCheckUtils]: 4: Hoare triple {9426#true} call #t~ret8 := main(); {9426#true} is VALID [2022-04-08 04:48:28,544 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9426#true} {9426#true} #69#return; {9426#true} is VALID [2022-04-08 04:48:28,544 INFO L290 TraceCheckUtils]: 2: Hoare triple {9426#true} assume true; {9426#true} is VALID [2022-04-08 04:48:28,544 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-08 04:48:28,545 INFO L272 TraceCheckUtils]: 0: Hoare triple {9426#true} call ULTIMATE.init(); {9426#true} is VALID [2022-04-08 04:48:28,545 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-08 04:48:28,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 04:48:28,545 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1728141374] [2022-04-08 04:48:28,545 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 04:48:28,545 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1952612499] [2022-04-08 04:48:28,546 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1952612499] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 04:48:28,546 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 04:48:28,546 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 10] total 20 [2022-04-08 04:48:28,546 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 04:48:28,546 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [319230010] [2022-04-08 04:48:28,546 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [319230010] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 04:48:28,546 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 04:48:28,546 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-04-08 04:48:28,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304919399] [2022-04-08 04:48:28,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 04:48:28,547 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-08 04:48:28,547 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 04:48:28,547 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-08 04:48:28,585 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-08 04:48:28,585 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-08 04:48:28,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 04:48:28,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-08 04:48:28,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=322, Unknown=0, NotChecked=0, Total=380 [2022-04-08 04:48:28,586 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-08 04:48:29,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:48:29,952 INFO L93 Difference]: Finished difference Result 109 states and 119 transitions. [2022-04-08 04:48:29,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-08 04:48:29,952 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-08 04:48:29,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 04:48:29,953 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-08 04:48:29,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 64 transitions. [2022-04-08 04:48:29,954 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-08 04:48:29,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 64 transitions. [2022-04-08 04:48:29,955 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 64 transitions. [2022-04-08 04:48:30,022 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 04:48:30,024 INFO L225 Difference]: With dead ends: 109 [2022-04-08 04:48:30,024 INFO L226 Difference]: Without dead ends: 107 [2022-04-08 04:48:30,024 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 76 SyntacticMatches, 5 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=78, Invalid=428, Unknown=0, NotChecked=0, Total=506 [2022-04-08 04:48:30,025 INFO L913 BasicCegarLoop]: 28 mSDtfsCounter, 16 mSDsluCounter, 205 mSDsCounter, 0 mSdLazyCounter, 517 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s 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.5s IncrementalHoareTripleChecker+Time [2022-04-08 04:48:30,025 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [17 Valid, 233 Invalid, 522 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 517 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-08 04:48:30,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2022-04-08 04:48:30,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 96. [2022-04-08 04:48:30,230 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 04:48:30,231 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-08 04:48:30,231 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-08 04:48:30,231 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-08 04:48:30,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:48:30,233 INFO L93 Difference]: Finished difference Result 107 states and 117 transitions. [2022-04-08 04:48:30,234 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 117 transitions. [2022-04-08 04:48:30,234 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:48:30,234 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:48:30,234 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-08 04:48:30,234 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-08 04:48:30,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:48:30,237 INFO L93 Difference]: Finished difference Result 107 states and 117 transitions. [2022-04-08 04:48:30,237 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 117 transitions. [2022-04-08 04:48:30,237 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:48:30,237 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:48:30,237 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 04:48:30,237 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 04:48:30,238 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-08 04:48:30,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 104 transitions. [2022-04-08 04:48:30,240 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 104 transitions. Word has length 50 [2022-04-08 04:48:30,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 04:48:30,240 INFO L478 AbstractCegarLoop]: Abstraction has 96 states and 104 transitions. [2022-04-08 04:48:30,240 INFO L479 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-08 04:48:30,240 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 96 states and 104 transitions. [2022-04-08 04:48:32,470 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-08 04:48:32,471 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 104 transitions. [2022-04-08 04:48:32,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-04-08 04:48:32,473 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 04:48:32,473 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 04:48:32,490 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-08 04:48:32,679 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 04:48:32,679 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 04:48:32,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 04:48:32,680 INFO L85 PathProgramCache]: Analyzing trace with hash -1343557775, now seen corresponding path program 13 times [2022-04-08 04:48:32,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 04:48:32,680 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1433523007] [2022-04-08 04:48:32,680 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 04:48:32,680 INFO L85 PathProgramCache]: Analyzing trace with hash -1343557775, now seen corresponding path program 14 times [2022-04-08 04:48:32,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 04:48:32,681 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [591046780] [2022-04-08 04:48:32,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 04:48:32,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 04:48:32,690 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 04:48:32,691 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [184306057] [2022-04-08 04:48:32,691 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 04:48:32,691 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 04:48:32,691 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 04:48:32,692 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-08 04:48:32,703 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-08 04:48:32,738 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 04:48:32,739 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 04:48:32,739 INFO L263 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 39 conjunts are in the unsatisfiable core [2022-04-08 04:48:32,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:48:32,751 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 04:48:46,570 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-08 04:48:50,694 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-08 04:49:03,753 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-08 04:49:27,395 INFO L272 TraceCheckUtils]: 0: Hoare triple {10375#true} call ULTIMATE.init(); {10375#true} is VALID [2022-04-08 04:49:27,395 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-08 04:49:27,395 INFO L290 TraceCheckUtils]: 2: Hoare triple {10375#true} assume true; {10375#true} is VALID [2022-04-08 04:49:27,395 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10375#true} {10375#true} #69#return; {10375#true} is VALID [2022-04-08 04:49:27,395 INFO L272 TraceCheckUtils]: 4: Hoare triple {10375#true} call #t~ret8 := main(); {10375#true} is VALID [2022-04-08 04:49:27,395 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-08 04:49:27,395 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-08 04:49:27,396 INFO L290 TraceCheckUtils]: 7: Hoare triple {10375#true} ~cond := #in~cond; {10375#true} is VALID [2022-04-08 04:49:27,396 INFO L290 TraceCheckUtils]: 8: Hoare triple {10375#true} assume !(0 == ~cond); {10375#true} is VALID [2022-04-08 04:49:27,396 INFO L290 TraceCheckUtils]: 9: Hoare triple {10375#true} assume true; {10375#true} is VALID [2022-04-08 04:49:27,396 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {10375#true} {10375#true} #61#return; {10375#true} is VALID [2022-04-08 04:49:27,396 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-08 04:49:27,396 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-08 04:49:27,396 INFO L290 TraceCheckUtils]: 13: Hoare triple {10375#true} ~cond := #in~cond; {10375#true} is VALID [2022-04-08 04:49:27,396 INFO L290 TraceCheckUtils]: 14: Hoare triple {10375#true} assume !(0 == ~cond); {10375#true} is VALID [2022-04-08 04:49:27,396 INFO L290 TraceCheckUtils]: 15: Hoare triple {10375#true} assume true; {10375#true} is VALID [2022-04-08 04:49:27,396 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {10375#true} {10375#true} #63#return; {10375#true} is VALID [2022-04-08 04:49:27,397 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-08 04:49:27,397 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-08 04:49:27,397 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-08 04:49:27,397 INFO L290 TraceCheckUtils]: 20: Hoare triple {10375#true} ~cond := #in~cond; {10375#true} is VALID [2022-04-08 04:49:27,397 INFO L290 TraceCheckUtils]: 21: Hoare triple {10375#true} assume !(0 == ~cond); {10375#true} is VALID [2022-04-08 04:49:27,397 INFO L290 TraceCheckUtils]: 22: Hoare triple {10375#true} assume true; {10375#true} is VALID [2022-04-08 04:49:27,398 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-08 04:49:27,398 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-08 04:49:27,399 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-08 04:49:27,399 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-08 04:49:27,400 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-08 04:49:27,400 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-08 04:49:27,400 INFO L290 TraceCheckUtils]: 29: Hoare triple {10375#true} ~cond := #in~cond; {10469#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 04:49:27,400 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-08 04:49:27,401 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-08 04:49:27,401 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-08 04:49:27,401 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-08 04:49:27,402 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-08 04:49:27,403 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-08 04:49:27,403 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-08 04:49:27,403 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-08 04:49:27,403 INFO L290 TraceCheckUtils]: 38: Hoare triple {10375#true} ~cond := #in~cond; {10469#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 04:49:27,404 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-08 04:49:27,404 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-08 04:49:27,405 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-08 04:49:27,405 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-08 04:49:27,406 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-08 04:49:27,408 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-08 04:49:29,410 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-08 04:49:29,414 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-08 04:49:29,415 INFO L290 TraceCheckUtils]: 47: Hoare triple {10528#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {10532#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 04:49:29,415 INFO L290 TraceCheckUtils]: 48: Hoare triple {10532#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {10376#false} is VALID [2022-04-08 04:49:29,415 INFO L290 TraceCheckUtils]: 49: Hoare triple {10376#false} assume !false; {10376#false} is VALID [2022-04-08 04:49:29,415 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-08 04:49:29,415 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 04:49:34,648 INFO L290 TraceCheckUtils]: 49: Hoare triple {10376#false} assume !false; {10376#false} is VALID [2022-04-08 04:49:34,649 INFO L290 TraceCheckUtils]: 48: Hoare triple {10532#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {10376#false} is VALID [2022-04-08 04:49:34,649 INFO L290 TraceCheckUtils]: 47: Hoare triple {10528#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {10532#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 04:49:34,650 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-08 04:49:34,651 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-08 04:49:34,653 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-08 04:49:34,653 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-08 04:49:34,654 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-08 04:49:34,655 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-08 04:49:34,655 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-08 04:49:34,655 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-08 04:49:34,655 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-08 04:49:34,656 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-08 04:49:34,656 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-08 04:49:34,656 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-08 04:49:34,656 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-08 04:49:34,657 INFO L290 TraceCheckUtils]: 33: Hoare triple {10375#true} assume !!(~x~0 <= ~X~0); {10375#true} is VALID [2022-04-08 04:49:34,657 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {10375#true} {10375#true} #65#return; {10375#true} is VALID [2022-04-08 04:49:34,657 INFO L290 TraceCheckUtils]: 31: Hoare triple {10375#true} assume true; {10375#true} is VALID [2022-04-08 04:49:34,657 INFO L290 TraceCheckUtils]: 30: Hoare triple {10375#true} assume !(0 == ~cond); {10375#true} is VALID [2022-04-08 04:49:34,657 INFO L290 TraceCheckUtils]: 29: Hoare triple {10375#true} ~cond := #in~cond; {10375#true} is VALID [2022-04-08 04:49:34,657 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-08 04:49:34,657 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-08 04:49:34,657 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-08 04:49:34,657 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-08 04:49:34,657 INFO L290 TraceCheckUtils]: 24: Hoare triple {10375#true} assume !!(~x~0 <= ~X~0); {10375#true} is VALID [2022-04-08 04:49:34,657 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {10375#true} {10375#true} #65#return; {10375#true} is VALID [2022-04-08 04:49:34,657 INFO L290 TraceCheckUtils]: 22: Hoare triple {10375#true} assume true; {10375#true} is VALID [2022-04-08 04:49:34,657 INFO L290 TraceCheckUtils]: 21: Hoare triple {10375#true} assume !(0 == ~cond); {10375#true} is VALID [2022-04-08 04:49:34,657 INFO L290 TraceCheckUtils]: 20: Hoare triple {10375#true} ~cond := #in~cond; {10375#true} is VALID [2022-04-08 04:49:34,658 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-08 04:49:34,658 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-08 04:49:34,658 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-08 04:49:34,658 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {10375#true} {10375#true} #63#return; {10375#true} is VALID [2022-04-08 04:49:34,658 INFO L290 TraceCheckUtils]: 15: Hoare triple {10375#true} assume true; {10375#true} is VALID [2022-04-08 04:49:34,658 INFO L290 TraceCheckUtils]: 14: Hoare triple {10375#true} assume !(0 == ~cond); {10375#true} is VALID [2022-04-08 04:49:34,658 INFO L290 TraceCheckUtils]: 13: Hoare triple {10375#true} ~cond := #in~cond; {10375#true} is VALID [2022-04-08 04:49:34,658 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-08 04:49:34,658 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-08 04:49:34,658 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {10375#true} {10375#true} #61#return; {10375#true} is VALID [2022-04-08 04:49:34,658 INFO L290 TraceCheckUtils]: 9: Hoare triple {10375#true} assume true; {10375#true} is VALID [2022-04-08 04:49:34,658 INFO L290 TraceCheckUtils]: 8: Hoare triple {10375#true} assume !(0 == ~cond); {10375#true} is VALID [2022-04-08 04:49:34,658 INFO L290 TraceCheckUtils]: 7: Hoare triple {10375#true} ~cond := #in~cond; {10375#true} is VALID [2022-04-08 04:49:34,658 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-08 04:49:34,659 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-08 04:49:34,659 INFO L272 TraceCheckUtils]: 4: Hoare triple {10375#true} call #t~ret8 := main(); {10375#true} is VALID [2022-04-08 04:49:34,659 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10375#true} {10375#true} #69#return; {10375#true} is VALID [2022-04-08 04:49:34,659 INFO L290 TraceCheckUtils]: 2: Hoare triple {10375#true} assume true; {10375#true} is VALID [2022-04-08 04:49:34,659 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-08 04:49:34,659 INFO L272 TraceCheckUtils]: 0: Hoare triple {10375#true} call ULTIMATE.init(); {10375#true} is VALID [2022-04-08 04:49:34,659 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-08 04:49:34,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 04:49:34,659 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [591046780] [2022-04-08 04:49:34,659 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 04:49:34,659 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [184306057] [2022-04-08 04:49:34,660 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [184306057] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 04:49:34,660 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 04:49:34,660 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10] total 19 [2022-04-08 04:49:34,660 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 04:49:34,660 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1433523007] [2022-04-08 04:49:34,660 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1433523007] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 04:49:34,660 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 04:49:34,660 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-08 04:49:34,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906461553] [2022-04-08 04:49:34,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 04:49:34,660 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-08 04:49:34,661 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 04:49:34,661 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-08 04:49:36,710 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-08 04:49:36,710 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-08 04:49:36,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 04:49:36,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-08 04:49:36,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=293, Unknown=0, NotChecked=0, Total=342 [2022-04-08 04:49:36,711 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-08 04:49:48,627 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-08 04:49:57,719 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-08 04:50:01,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:50:01,341 INFO L93 Difference]: Finished difference Result 110 states and 121 transitions. [2022-04-08 04:50:01,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-08 04:50:01,341 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-08 04:50:01,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 04:50:01,342 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-08 04:50:01,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 65 transitions. [2022-04-08 04:50:01,343 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-08 04:50:01,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 65 transitions. [2022-04-08 04:50:01,344 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 65 transitions. [2022-04-08 04:50:03,428 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-08 04:50:03,430 INFO L225 Difference]: With dead ends: 110 [2022-04-08 04:50:03,430 INFO L226 Difference]: Without dead ends: 108 [2022-04-08 04:50:03,430 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 79 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=77, Invalid=429, Unknown=0, NotChecked=0, Total=506 [2022-04-08 04:50:03,431 INFO L913 BasicCegarLoop]: 30 mSDtfsCounter, 17 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 388 mSolverCounterSat, 5 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 210 SdHoareTripleChecker+Invalid, 395 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 388 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.6s IncrementalHoareTripleChecker+Time [2022-04-08 04:50:03,431 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [18 Valid, 210 Invalid, 395 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 388 Invalid, 2 Unknown, 0 Unchecked, 7.6s Time] [2022-04-08 04:50:03,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2022-04-08 04:50:03,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 97. [2022-04-08 04:50:03,631 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 04:50:03,631 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-08 04:50:03,632 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-08 04:50:03,632 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-08 04:50:03,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:50:03,634 INFO L93 Difference]: Finished difference Result 108 states and 119 transitions. [2022-04-08 04:50:03,634 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 119 transitions. [2022-04-08 04:50:03,635 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:50:03,635 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:50:03,635 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-08 04:50:03,635 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-08 04:50:03,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:50:03,637 INFO L93 Difference]: Finished difference Result 108 states and 119 transitions. [2022-04-08 04:50:03,638 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 119 transitions. [2022-04-08 04:50:03,638 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:50:03,638 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:50:03,638 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 04:50:03,638 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 04:50:03,638 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-08 04:50:03,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 106 transitions. [2022-04-08 04:50:03,640 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 106 transitions. Word has length 50 [2022-04-08 04:50:03,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 04:50:03,640 INFO L478 AbstractCegarLoop]: Abstraction has 97 states and 106 transitions. [2022-04-08 04:50:03,641 INFO L479 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-08 04:50:03,641 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 97 states and 106 transitions. [2022-04-08 04:50:05,875 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-08 04:50:05,876 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 106 transitions. [2022-04-08 04:50:05,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-04-08 04:50:05,876 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 04:50:05,876 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 04:50:05,893 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-08 04:50:06,077 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-04-08 04:50:06,077 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 04:50:06,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 04:50:06,077 INFO L85 PathProgramCache]: Analyzing trace with hash 431449587, now seen corresponding path program 5 times [2022-04-08 04:50:06,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 04:50:06,077 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1658186772] [2022-04-08 04:50:06,078 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 04:50:06,078 INFO L85 PathProgramCache]: Analyzing trace with hash 431449587, now seen corresponding path program 6 times [2022-04-08 04:50:06,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 04:50:06,078 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [138475228] [2022-04-08 04:50:06,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 04:50:06,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 04:50:06,091 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 04:50:06,091 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [518228913] [2022-04-08 04:50:06,092 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 04:50:06,092 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 04:50:06,092 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 04:50:06,093 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-08 04:50:06,103 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-08 04:50:06,146 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-04-08 04:50:06,147 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 04:50:06,148 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 33 conjunts are in the unsatisfiable core [2022-04-08 04:50:06,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:50:06,158 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 04:50:06,538 INFO L272 TraceCheckUtils]: 0: Hoare triple {11331#true} call ULTIMATE.init(); {11331#true} is VALID [2022-04-08 04:50:06,538 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-08 04:50:06,538 INFO L290 TraceCheckUtils]: 2: Hoare triple {11331#true} assume true; {11331#true} is VALID [2022-04-08 04:50:06,538 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11331#true} {11331#true} #69#return; {11331#true} is VALID [2022-04-08 04:50:06,538 INFO L272 TraceCheckUtils]: 4: Hoare triple {11331#true} call #t~ret8 := main(); {11331#true} is VALID [2022-04-08 04:50:06,538 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-08 04:50:06,538 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-08 04:50:06,538 INFO L290 TraceCheckUtils]: 7: Hoare triple {11331#true} ~cond := #in~cond; {11331#true} is VALID [2022-04-08 04:50:06,539 INFO L290 TraceCheckUtils]: 8: Hoare triple {11331#true} assume !(0 == ~cond); {11331#true} is VALID [2022-04-08 04:50:06,539 INFO L290 TraceCheckUtils]: 9: Hoare triple {11331#true} assume true; {11331#true} is VALID [2022-04-08 04:50:06,539 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {11331#true} {11331#true} #61#return; {11331#true} is VALID [2022-04-08 04:50:06,539 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-08 04:50:06,539 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-08 04:50:06,539 INFO L290 TraceCheckUtils]: 13: Hoare triple {11331#true} ~cond := #in~cond; {11331#true} is VALID [2022-04-08 04:50:06,539 INFO L290 TraceCheckUtils]: 14: Hoare triple {11331#true} assume !(0 == ~cond); {11331#true} is VALID [2022-04-08 04:50:06,539 INFO L290 TraceCheckUtils]: 15: Hoare triple {11331#true} assume true; {11331#true} is VALID [2022-04-08 04:50:06,539 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {11331#true} {11331#true} #63#return; {11331#true} is VALID [2022-04-08 04:50:06,540 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-08 04:50:06,540 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-08 04:50:06,540 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-08 04:50:06,540 INFO L290 TraceCheckUtils]: 20: Hoare triple {11331#true} ~cond := #in~cond; {11331#true} is VALID [2022-04-08 04:50:06,540 INFO L290 TraceCheckUtils]: 21: Hoare triple {11331#true} assume !(0 == ~cond); {11331#true} is VALID [2022-04-08 04:50:06,540 INFO L290 TraceCheckUtils]: 22: Hoare triple {11331#true} assume true; {11331#true} is VALID [2022-04-08 04:50:06,541 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-08 04:50:06,541 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-08 04:50:06,542 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-08 04:50:06,542 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-08 04:50:06,543 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-08 04:50:06,543 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-08 04:50:06,543 INFO L290 TraceCheckUtils]: 29: Hoare triple {11331#true} ~cond := #in~cond; {11331#true} is VALID [2022-04-08 04:50:06,543 INFO L290 TraceCheckUtils]: 30: Hoare triple {11331#true} assume !(0 == ~cond); {11331#true} is VALID [2022-04-08 04:50:06,543 INFO L290 TraceCheckUtils]: 31: Hoare triple {11331#true} assume true; {11331#true} is VALID [2022-04-08 04:50:06,544 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-08 04:50:06,544 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-08 04:50:06,545 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-08 04:50:06,545 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-08 04:50:06,546 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-08 04:50:06,546 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-08 04:50:06,546 INFO L290 TraceCheckUtils]: 38: Hoare triple {11331#true} ~cond := #in~cond; {11331#true} is VALID [2022-04-08 04:50:06,546 INFO L290 TraceCheckUtils]: 39: Hoare triple {11331#true} assume !(0 == ~cond); {11331#true} is VALID [2022-04-08 04:50:06,546 INFO L290 TraceCheckUtils]: 40: Hoare triple {11331#true} assume true; {11331#true} is VALID [2022-04-08 04:50:06,547 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-08 04:50:06,547 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-08 04:50:06,548 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-08 04:50:06,548 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-08 04:50:06,549 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-08 04:50:06,550 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-08 04:50:06,550 INFO L290 TraceCheckUtils]: 47: Hoare triple {11483#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {11487#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 04:50:06,550 INFO L290 TraceCheckUtils]: 48: Hoare triple {11487#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {11332#false} is VALID [2022-04-08 04:50:06,550 INFO L290 TraceCheckUtils]: 49: Hoare triple {11332#false} assume !false; {11332#false} is VALID [2022-04-08 04:50:06,551 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-08 04:50:06,551 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 04:50:07,104 INFO L290 TraceCheckUtils]: 49: Hoare triple {11332#false} assume !false; {11332#false} is VALID [2022-04-08 04:50:07,104 INFO L290 TraceCheckUtils]: 48: Hoare triple {11487#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {11332#false} is VALID [2022-04-08 04:50:07,105 INFO L290 TraceCheckUtils]: 47: Hoare triple {11483#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {11487#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 04:50:07,108 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-08 04:50:07,109 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-08 04:50:07,111 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-08 04:50:07,113 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-08 04:50:07,114 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-08 04:50:07,115 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-08 04:50:07,115 INFO L290 TraceCheckUtils]: 40: Hoare triple {11331#true} assume true; {11331#true} is VALID [2022-04-08 04:50:07,115 INFO L290 TraceCheckUtils]: 39: Hoare triple {11331#true} assume !(0 == ~cond); {11331#true} is VALID [2022-04-08 04:50:07,115 INFO L290 TraceCheckUtils]: 38: Hoare triple {11331#true} ~cond := #in~cond; {11331#true} is VALID [2022-04-08 04:50:07,115 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-08 04:50:07,116 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-08 04:50:07,118 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-08 04:50:07,120 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-08 04:50:07,121 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-08 04:50:07,122 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-08 04:50:07,122 INFO L290 TraceCheckUtils]: 31: Hoare triple {11331#true} assume true; {11331#true} is VALID [2022-04-08 04:50:07,122 INFO L290 TraceCheckUtils]: 30: Hoare triple {11331#true} assume !(0 == ~cond); {11331#true} is VALID [2022-04-08 04:50:07,122 INFO L290 TraceCheckUtils]: 29: Hoare triple {11331#true} ~cond := #in~cond; {11331#true} is VALID [2022-04-08 04:50:07,122 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-08 04:50:07,123 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-08 04:50:07,125 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-08 04:50:07,127 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-08 04:50:07,127 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-08 04:50:07,128 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-08 04:50:07,128 INFO L290 TraceCheckUtils]: 22: Hoare triple {11331#true} assume true; {11331#true} is VALID [2022-04-08 04:50:07,128 INFO L290 TraceCheckUtils]: 21: Hoare triple {11331#true} assume !(0 == ~cond); {11331#true} is VALID [2022-04-08 04:50:07,128 INFO L290 TraceCheckUtils]: 20: Hoare triple {11331#true} ~cond := #in~cond; {11331#true} is VALID [2022-04-08 04:50:07,128 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-08 04:50:07,128 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-08 04:50:07,129 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-08 04:50:07,129 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {11331#true} {11331#true} #63#return; {11331#true} is VALID [2022-04-08 04:50:07,129 INFO L290 TraceCheckUtils]: 15: Hoare triple {11331#true} assume true; {11331#true} is VALID [2022-04-08 04:50:07,129 INFO L290 TraceCheckUtils]: 14: Hoare triple {11331#true} assume !(0 == ~cond); {11331#true} is VALID [2022-04-08 04:50:07,129 INFO L290 TraceCheckUtils]: 13: Hoare triple {11331#true} ~cond := #in~cond; {11331#true} is VALID [2022-04-08 04:50:07,129 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-08 04:50:07,129 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-08 04:50:07,129 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {11331#true} {11331#true} #61#return; {11331#true} is VALID [2022-04-08 04:50:07,130 INFO L290 TraceCheckUtils]: 9: Hoare triple {11331#true} assume true; {11331#true} is VALID [2022-04-08 04:50:07,130 INFO L290 TraceCheckUtils]: 8: Hoare triple {11331#true} assume !(0 == ~cond); {11331#true} is VALID [2022-04-08 04:50:07,130 INFO L290 TraceCheckUtils]: 7: Hoare triple {11331#true} ~cond := #in~cond; {11331#true} is VALID [2022-04-08 04:50:07,130 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-08 04:50:07,130 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-08 04:50:07,130 INFO L272 TraceCheckUtils]: 4: Hoare triple {11331#true} call #t~ret8 := main(); {11331#true} is VALID [2022-04-08 04:50:07,130 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11331#true} {11331#true} #69#return; {11331#true} is VALID [2022-04-08 04:50:07,130 INFO L290 TraceCheckUtils]: 2: Hoare triple {11331#true} assume true; {11331#true} is VALID [2022-04-08 04:50:07,130 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-08 04:50:07,130 INFO L272 TraceCheckUtils]: 0: Hoare triple {11331#true} call ULTIMATE.init(); {11331#true} is VALID [2022-04-08 04:50:07,130 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-08 04:50:07,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 04:50:07,131 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [138475228] [2022-04-08 04:50:07,131 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 04:50:07,131 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [518228913] [2022-04-08 04:50:07,131 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [518228913] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 04:50:07,131 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 04:50:07,131 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 22 [2022-04-08 04:50:07,131 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 04:50:07,131 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1658186772] [2022-04-08 04:50:07,131 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1658186772] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 04:50:07,131 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 04:50:07,132 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-08 04:50:07,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [253285468] [2022-04-08 04:50:07,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 04:50:07,132 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-08 04:50:07,132 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 04:50:07,132 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-08 04:50:07,166 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-08 04:50:07,167 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-08 04:50:07,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 04:50:07,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-08 04:50:07,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=378, Unknown=0, NotChecked=0, Total=462 [2022-04-08 04:50:07,167 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-08 04:50:08,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:50:08,376 INFO L93 Difference]: Finished difference Result 110 states and 121 transitions. [2022-04-08 04:50:08,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-08 04:50:08,376 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-08 04:50:08,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 04:50:08,377 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-08 04:50:08,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 65 transitions. [2022-04-08 04:50:08,378 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-08 04:50:08,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 65 transitions. [2022-04-08 04:50:08,379 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 65 transitions. [2022-04-08 04:50:08,453 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-08 04:50:08,458 INFO L225 Difference]: With dead ends: 110 [2022-04-08 04:50:08,458 INFO L226 Difference]: Without dead ends: 108 [2022-04-08 04:50:08,458 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 78 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=98, Invalid=454, Unknown=0, NotChecked=0, Total=552 [2022-04-08 04:50:08,459 INFO L913 BasicCegarLoop]: 34 mSDtfsCounter, 11 mSDsluCounter, 205 mSDsCounter, 0 mSdLazyCounter, 427 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s 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.4s IncrementalHoareTripleChecker+Time [2022-04-08 04:50:08,459 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 239 Invalid, 430 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 427 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-08 04:50:08,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2022-04-08 04:50:08,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 97. [2022-04-08 04:50:08,691 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 04:50:08,691 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-08 04:50:08,691 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-08 04:50:08,691 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-08 04:50:08,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:50:08,693 INFO L93 Difference]: Finished difference Result 108 states and 119 transitions. [2022-04-08 04:50:08,693 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 119 transitions. [2022-04-08 04:50:08,694 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:50:08,694 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:50:08,694 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-08 04:50:08,694 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-08 04:50:08,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:50:08,696 INFO L93 Difference]: Finished difference Result 108 states and 119 transitions. [2022-04-08 04:50:08,697 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 119 transitions. [2022-04-08 04:50:08,697 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:50:08,697 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:50:08,697 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 04:50:08,697 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 04:50:08,697 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-08 04:50:08,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 106 transitions. [2022-04-08 04:50:08,699 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 106 transitions. Word has length 50 [2022-04-08 04:50:08,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 04:50:08,700 INFO L478 AbstractCegarLoop]: Abstraction has 97 states and 106 transitions. [2022-04-08 04:50:08,700 INFO L479 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-08 04:50:08,700 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 97 states and 106 transitions. [2022-04-08 04:50:10,956 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-08 04:50:10,956 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 106 transitions. [2022-04-08 04:50:10,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-04-08 04:50:10,957 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 04:50:10,957 INFO L499 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 04:50:10,973 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-04-08 04:50:11,159 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-04-08 04:50:11,159 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 04:50:11,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 04:50:11,160 INFO L85 PathProgramCache]: Analyzing trace with hash 55892592, now seen corresponding path program 3 times [2022-04-08 04:50:11,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 04:50:11,160 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1469527838] [2022-04-08 04:50:11,161 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 04:50:11,161 INFO L85 PathProgramCache]: Analyzing trace with hash 55892592, now seen corresponding path program 4 times [2022-04-08 04:50:11,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 04:50:11,161 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [616264989] [2022-04-08 04:50:11,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 04:50:11,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 04:50:11,174 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 04:50:11,174 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1479272253] [2022-04-08 04:50:11,174 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 04:50:11,174 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 04:50:11,174 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 04:50:11,175 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-08 04:50:11,177 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-08 04:50:11,212 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 04:50:11,212 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 04:50:11,213 INFO L263 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-08 04:50:11,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:50:11,224 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 04:50:12,082 INFO L272 TraceCheckUtils]: 0: Hoare triple {12286#true} call ULTIMATE.init(); {12286#true} is VALID [2022-04-08 04:50:12,082 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-08 04:50:12,082 INFO L290 TraceCheckUtils]: 2: Hoare triple {12286#true} assume true; {12286#true} is VALID [2022-04-08 04:50:12,083 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12286#true} {12286#true} #69#return; {12286#true} is VALID [2022-04-08 04:50:12,083 INFO L272 TraceCheckUtils]: 4: Hoare triple {12286#true} call #t~ret8 := main(); {12286#true} is VALID [2022-04-08 04:50:12,083 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-08 04:50:12,083 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-08 04:50:12,083 INFO L290 TraceCheckUtils]: 7: Hoare triple {12286#true} ~cond := #in~cond; {12286#true} is VALID [2022-04-08 04:50:12,083 INFO L290 TraceCheckUtils]: 8: Hoare triple {12286#true} assume !(0 == ~cond); {12286#true} is VALID [2022-04-08 04:50:12,083 INFO L290 TraceCheckUtils]: 9: Hoare triple {12286#true} assume true; {12286#true} is VALID [2022-04-08 04:50:12,083 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {12286#true} {12286#true} #61#return; {12286#true} is VALID [2022-04-08 04:50:12,083 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-08 04:50:12,083 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-08 04:50:12,084 INFO L290 TraceCheckUtils]: 13: Hoare triple {12286#true} ~cond := #in~cond; {12286#true} is VALID [2022-04-08 04:50:12,084 INFO L290 TraceCheckUtils]: 14: Hoare triple {12286#true} assume !(0 == ~cond); {12286#true} is VALID [2022-04-08 04:50:12,084 INFO L290 TraceCheckUtils]: 15: Hoare triple {12286#true} assume true; {12286#true} is VALID [2022-04-08 04:50:12,084 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {12286#true} {12286#true} #63#return; {12286#true} is VALID [2022-04-08 04:50:12,087 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-08 04:50:12,088 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-08 04:50:12,088 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-08 04:50:12,088 INFO L290 TraceCheckUtils]: 20: Hoare triple {12286#true} ~cond := #in~cond; {12286#true} is VALID [2022-04-08 04:50:12,088 INFO L290 TraceCheckUtils]: 21: Hoare triple {12286#true} assume !(0 == ~cond); {12286#true} is VALID [2022-04-08 04:50:12,088 INFO L290 TraceCheckUtils]: 22: Hoare triple {12286#true} assume true; {12286#true} is VALID [2022-04-08 04:50:12,089 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-08 04:50:12,090 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-08 04:50:12,091 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-08 04:50:12,093 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-08 04:50:12,093 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-08 04:50:12,094 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-08 04:50:12,094 INFO L290 TraceCheckUtils]: 29: Hoare triple {12286#true} ~cond := #in~cond; {12286#true} is VALID [2022-04-08 04:50:12,094 INFO L290 TraceCheckUtils]: 30: Hoare triple {12286#true} assume !(0 == ~cond); {12286#true} is VALID [2022-04-08 04:50:12,094 INFO L290 TraceCheckUtils]: 31: Hoare triple {12286#true} assume true; {12286#true} is VALID [2022-04-08 04:50:12,095 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-08 04:50:12,095 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-08 04:50:12,096 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-08 04:50:12,098 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-08 04:50:12,098 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-08 04:50:12,098 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-08 04:50:12,099 INFO L290 TraceCheckUtils]: 38: Hoare triple {12286#true} ~cond := #in~cond; {12286#true} is VALID [2022-04-08 04:50:12,099 INFO L290 TraceCheckUtils]: 39: Hoare triple {12286#true} assume !(0 == ~cond); {12286#true} is VALID [2022-04-08 04:50:12,099 INFO L290 TraceCheckUtils]: 40: Hoare triple {12286#true} assume true; {12286#true} is VALID [2022-04-08 04:50:12,100 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-08 04:50:12,100 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-08 04:50:12,100 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-08 04:50:12,102 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-08 04:50:12,102 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-08 04:50:12,102 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-08 04:50:12,103 INFO L290 TraceCheckUtils]: 47: Hoare triple {12286#true} ~cond := #in~cond; {12286#true} is VALID [2022-04-08 04:50:12,103 INFO L290 TraceCheckUtils]: 48: Hoare triple {12286#true} assume !(0 == ~cond); {12286#true} is VALID [2022-04-08 04:50:12,103 INFO L290 TraceCheckUtils]: 49: Hoare triple {12286#true} assume true; {12286#true} is VALID [2022-04-08 04:50:12,103 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-08 04:50:12,105 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-08 04:50:12,105 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-08 04:50:12,105 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-08 04:50:12,105 INFO L290 TraceCheckUtils]: 54: Hoare triple {12287#false} ~cond := #in~cond; {12287#false} is VALID [2022-04-08 04:50:12,105 INFO L290 TraceCheckUtils]: 55: Hoare triple {12287#false} assume 0 == ~cond; {12287#false} is VALID [2022-04-08 04:50:12,105 INFO L290 TraceCheckUtils]: 56: Hoare triple {12287#false} assume !false; {12287#false} is VALID [2022-04-08 04:50:12,106 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-08 04:50:12,106 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 04:50:12,481 INFO L290 TraceCheckUtils]: 56: Hoare triple {12287#false} assume !false; {12287#false} is VALID [2022-04-08 04:50:12,482 INFO L290 TraceCheckUtils]: 55: Hoare triple {12287#false} assume 0 == ~cond; {12287#false} is VALID [2022-04-08 04:50:12,482 INFO L290 TraceCheckUtils]: 54: Hoare triple {12287#false} ~cond := #in~cond; {12287#false} is VALID [2022-04-08 04:50:12,482 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-08 04:50:12,482 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-08 04:50:12,482 INFO L290 TraceCheckUtils]: 51: Hoare triple {12480#(<= main_~x~0 main_~X~0)} assume !(~x~0 <= ~X~0); {12287#false} is VALID [2022-04-08 04:50:12,483 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-08 04:50:12,483 INFO L290 TraceCheckUtils]: 49: Hoare triple {12286#true} assume true; {12286#true} is VALID [2022-04-08 04:50:12,483 INFO L290 TraceCheckUtils]: 48: Hoare triple {12286#true} assume !(0 == ~cond); {12286#true} is VALID [2022-04-08 04:50:12,483 INFO L290 TraceCheckUtils]: 47: Hoare triple {12286#true} ~cond := #in~cond; {12286#true} is VALID [2022-04-08 04:50:12,483 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-08 04:50:12,483 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-08 04:50:12,485 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-08 04:50:12,485 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-08 04:50:12,485 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-08 04:50:12,486 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-08 04:50:12,486 INFO L290 TraceCheckUtils]: 40: Hoare triple {12286#true} assume true; {12286#true} is VALID [2022-04-08 04:50:12,486 INFO L290 TraceCheckUtils]: 39: Hoare triple {12286#true} assume !(0 == ~cond); {12286#true} is VALID [2022-04-08 04:50:12,486 INFO L290 TraceCheckUtils]: 38: Hoare triple {12286#true} ~cond := #in~cond; {12286#true} is VALID [2022-04-08 04:50:12,486 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-08 04:50:12,486 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-08 04:50:12,488 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-08 04:50:12,497 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-08 04:50:12,497 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-08 04:50:12,498 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-08 04:50:12,498 INFO L290 TraceCheckUtils]: 31: Hoare triple {12286#true} assume true; {12286#true} is VALID [2022-04-08 04:50:12,498 INFO L290 TraceCheckUtils]: 30: Hoare triple {12286#true} assume !(0 == ~cond); {12286#true} is VALID [2022-04-08 04:50:12,498 INFO L290 TraceCheckUtils]: 29: Hoare triple {12286#true} ~cond := #in~cond; {12286#true} is VALID [2022-04-08 04:50:12,498 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-08 04:50:12,499 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-08 04:50:12,500 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-08 04:50:12,501 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-08 04:50:12,501 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-08 04:50:12,502 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-08 04:50:12,502 INFO L290 TraceCheckUtils]: 22: Hoare triple {12286#true} assume true; {12286#true} is VALID [2022-04-08 04:50:12,502 INFO L290 TraceCheckUtils]: 21: Hoare triple {12286#true} assume !(0 == ~cond); {12286#true} is VALID [2022-04-08 04:50:12,502 INFO L290 TraceCheckUtils]: 20: Hoare triple {12286#true} ~cond := #in~cond; {12286#true} is VALID [2022-04-08 04:50:12,502 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-08 04:50:12,503 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-08 04:50:12,505 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-08 04:50:12,505 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {12286#true} {12286#true} #63#return; {12286#true} is VALID [2022-04-08 04:50:12,505 INFO L290 TraceCheckUtils]: 15: Hoare triple {12286#true} assume true; {12286#true} is VALID [2022-04-08 04:50:12,505 INFO L290 TraceCheckUtils]: 14: Hoare triple {12286#true} assume !(0 == ~cond); {12286#true} is VALID [2022-04-08 04:50:12,505 INFO L290 TraceCheckUtils]: 13: Hoare triple {12286#true} ~cond := #in~cond; {12286#true} is VALID [2022-04-08 04:50:12,505 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-08 04:50:12,505 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-08 04:50:12,505 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {12286#true} {12286#true} #61#return; {12286#true} is VALID [2022-04-08 04:50:12,505 INFO L290 TraceCheckUtils]: 9: Hoare triple {12286#true} assume true; {12286#true} is VALID [2022-04-08 04:50:12,506 INFO L290 TraceCheckUtils]: 8: Hoare triple {12286#true} assume !(0 == ~cond); {12286#true} is VALID [2022-04-08 04:50:12,506 INFO L290 TraceCheckUtils]: 7: Hoare triple {12286#true} ~cond := #in~cond; {12286#true} is VALID [2022-04-08 04:50:12,506 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-08 04:50:12,506 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-08 04:50:12,506 INFO L272 TraceCheckUtils]: 4: Hoare triple {12286#true} call #t~ret8 := main(); {12286#true} is VALID [2022-04-08 04:50:12,506 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12286#true} {12286#true} #69#return; {12286#true} is VALID [2022-04-08 04:50:12,506 INFO L290 TraceCheckUtils]: 2: Hoare triple {12286#true} assume true; {12286#true} is VALID [2022-04-08 04:50:12,506 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-08 04:50:12,506 INFO L272 TraceCheckUtils]: 0: Hoare triple {12286#true} call ULTIMATE.init(); {12286#true} is VALID [2022-04-08 04:50:12,507 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-08 04:50:12,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 04:50:12,507 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [616264989] [2022-04-08 04:50:12,507 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 04:50:12,507 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1479272253] [2022-04-08 04:50:12,507 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1479272253] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 04:50:12,507 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 04:50:12,507 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2022-04-08 04:50:12,508 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 04:50:12,508 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1469527838] [2022-04-08 04:50:12,508 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1469527838] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 04:50:12,508 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 04:50:12,508 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-08 04:50:12,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1942053763] [2022-04-08 04:50:12,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 04:50:12,508 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-08 04:50:12,509 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 04:50:12,509 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-08 04:50:12,558 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-08 04:50:12,558 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-08 04:50:12,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 04:50:12,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-08 04:50:12,559 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2022-04-08 04:50:12,559 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-08 04:50:13,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:50:13,146 INFO L93 Difference]: Finished difference Result 111 states and 122 transitions. [2022-04-08 04:50:13,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-08 04:50:13,146 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-08 04:50:13,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 04:50:13,146 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-08 04:50:13,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 65 transitions. [2022-04-08 04:50:13,149 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-08 04:50:13,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 65 transitions. [2022-04-08 04:50:13,150 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 65 transitions. [2022-04-08 04:50:13,214 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-08 04:50:13,215 INFO L225 Difference]: With dead ends: 111 [2022-04-08 04:50:13,215 INFO L226 Difference]: Without dead ends: 103 [2022-04-08 04:50:13,215 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2022-04-08 04:50:13,216 INFO L913 BasicCegarLoop]: 32 mSDtfsCounter, 5 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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.1s IncrementalHoareTripleChecker+Time [2022-04-08 04:50:13,216 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [5 Valid, 104 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 04:50:13,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2022-04-08 04:50:13,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 101. [2022-04-08 04:50:13,455 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 04:50:13,455 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-08 04:50:13,455 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-08 04:50:13,456 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-08 04:50:13,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:50:13,457 INFO L93 Difference]: Finished difference Result 103 states and 114 transitions. [2022-04-08 04:50:13,457 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 114 transitions. [2022-04-08 04:50:13,458 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:50:13,458 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:50:13,458 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-08 04:50:13,458 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-08 04:50:13,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:50:13,460 INFO L93 Difference]: Finished difference Result 103 states and 114 transitions. [2022-04-08 04:50:13,460 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 114 transitions. [2022-04-08 04:50:13,460 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:50:13,460 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:50:13,461 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 04:50:13,461 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 04:50:13,461 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-08 04:50:13,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 111 transitions. [2022-04-08 04:50:13,463 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 111 transitions. Word has length 57 [2022-04-08 04:50:13,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 04:50:13,463 INFO L478 AbstractCegarLoop]: Abstraction has 101 states and 111 transitions. [2022-04-08 04:50:13,463 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 6 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2022-04-08 04:50:13,464 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 101 states and 111 transitions. [2022-04-08 04:50:17,786 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-08 04:50:17,786 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 111 transitions. [2022-04-08 04:50:17,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-04-08 04:50:17,787 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 04:50:17,787 INFO L499 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 04:50:17,805 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-08 04:50:17,995 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-04-08 04:50:17,995 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 04:50:17,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 04:50:17,996 INFO L85 PathProgramCache]: Analyzing trace with hash 1124973290, now seen corresponding path program 5 times [2022-04-08 04:50:17,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 04:50:17,996 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1438527348] [2022-04-08 04:50:17,996 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 04:50:17,996 INFO L85 PathProgramCache]: Analyzing trace with hash 1124973290, now seen corresponding path program 6 times [2022-04-08 04:50:17,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 04:50:17,996 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [751527525] [2022-04-08 04:50:17,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 04:50:17,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 04:50:18,006 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 04:50:18,006 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1857073986] [2022-04-08 04:50:18,007 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 04:50:18,007 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 04:50:18,007 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 04:50:18,008 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-08 04:50:18,011 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-08 04:50:18,052 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-04-08 04:50:18,052 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 04:50:18,053 INFO L263 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 29 conjunts are in the unsatisfiable core [2022-04-08 04:50:18,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:50:18,069 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 04:50:36,294 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-08 04:50:42,736 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-08 04:50:46,776 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-08 04:51:11,309 INFO L272 TraceCheckUtils]: 0: Hoare triple {13271#true} call ULTIMATE.init(); {13271#true} is VALID [2022-04-08 04:51:11,309 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-08 04:51:11,309 INFO L290 TraceCheckUtils]: 2: Hoare triple {13271#true} assume true; {13271#true} is VALID [2022-04-08 04:51:11,309 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13271#true} {13271#true} #69#return; {13271#true} is VALID [2022-04-08 04:51:11,309 INFO L272 TraceCheckUtils]: 4: Hoare triple {13271#true} call #t~ret8 := main(); {13271#true} is VALID [2022-04-08 04:51:11,309 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-08 04:51:11,310 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-08 04:51:11,310 INFO L290 TraceCheckUtils]: 7: Hoare triple {13271#true} ~cond := #in~cond; {13271#true} is VALID [2022-04-08 04:51:11,310 INFO L290 TraceCheckUtils]: 8: Hoare triple {13271#true} assume !(0 == ~cond); {13271#true} is VALID [2022-04-08 04:51:11,310 INFO L290 TraceCheckUtils]: 9: Hoare triple {13271#true} assume true; {13271#true} is VALID [2022-04-08 04:51:11,310 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {13271#true} {13271#true} #61#return; {13271#true} is VALID [2022-04-08 04:51:11,310 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-08 04:51:11,310 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-08 04:51:11,310 INFO L290 TraceCheckUtils]: 13: Hoare triple {13271#true} ~cond := #in~cond; {13271#true} is VALID [2022-04-08 04:51:11,310 INFO L290 TraceCheckUtils]: 14: Hoare triple {13271#true} assume !(0 == ~cond); {13271#true} is VALID [2022-04-08 04:51:11,310 INFO L290 TraceCheckUtils]: 15: Hoare triple {13271#true} assume true; {13271#true} is VALID [2022-04-08 04:51:11,310 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {13271#true} {13271#true} #63#return; {13271#true} is VALID [2022-04-08 04:51:11,311 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-08 04:51:11,311 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-08 04:51:11,311 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-08 04:51:11,311 INFO L290 TraceCheckUtils]: 20: Hoare triple {13271#true} ~cond := #in~cond; {13271#true} is VALID [2022-04-08 04:51:11,311 INFO L290 TraceCheckUtils]: 21: Hoare triple {13271#true} assume !(0 == ~cond); {13271#true} is VALID [2022-04-08 04:51:11,311 INFO L290 TraceCheckUtils]: 22: Hoare triple {13271#true} assume true; {13271#true} is VALID [2022-04-08 04:51:11,312 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-08 04:51:11,313 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-08 04:51:11,313 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-08 04:51:11,313 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-08 04:51:11,314 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-08 04:51:11,314 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-08 04:51:11,314 INFO L290 TraceCheckUtils]: 29: Hoare triple {13271#true} ~cond := #in~cond; {13271#true} is VALID [2022-04-08 04:51:11,314 INFO L290 TraceCheckUtils]: 30: Hoare triple {13271#true} assume !(0 == ~cond); {13271#true} is VALID [2022-04-08 04:51:11,314 INFO L290 TraceCheckUtils]: 31: Hoare triple {13271#true} assume true; {13271#true} is VALID [2022-04-08 04:51:11,315 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-08 04:51:11,315 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-08 04:51:11,316 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-08 04:51:11,316 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-08 04:51:11,316 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-08 04:51:11,316 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-08 04:51:11,316 INFO L290 TraceCheckUtils]: 38: Hoare triple {13271#true} ~cond := #in~cond; {13271#true} is VALID [2022-04-08 04:51:11,316 INFO L290 TraceCheckUtils]: 39: Hoare triple {13271#true} assume !(0 == ~cond); {13271#true} is VALID [2022-04-08 04:51:11,317 INFO L290 TraceCheckUtils]: 40: Hoare triple {13271#true} assume true; {13271#true} is VALID [2022-04-08 04:51:11,317 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-08 04:51:11,317 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-08 04:51:11,318 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-08 04:51:11,319 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-08 04:51:11,319 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-08 04:51:11,319 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-08 04:51:11,319 INFO L290 TraceCheckUtils]: 47: Hoare triple {13271#true} ~cond := #in~cond; {13424#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 04:51:11,320 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-08 04:51:11,320 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-08 04:51:11,321 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-08 04:51:11,322 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-08 04:51:13,323 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-08 04:51:13,326 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-08 04:51:13,326 INFO L290 TraceCheckUtils]: 54: Hoare triple {13447#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {13451#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 04:51:13,326 INFO L290 TraceCheckUtils]: 55: Hoare triple {13451#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {13272#false} is VALID [2022-04-08 04:51:13,327 INFO L290 TraceCheckUtils]: 56: Hoare triple {13272#false} assume !false; {13272#false} is VALID [2022-04-08 04:51:13,327 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-08 04:51:13,327 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 04:51:16,981 INFO L290 TraceCheckUtils]: 56: Hoare triple {13272#false} assume !false; {13272#false} is VALID [2022-04-08 04:51:16,982 INFO L290 TraceCheckUtils]: 55: Hoare triple {13451#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {13272#false} is VALID [2022-04-08 04:51:16,982 INFO L290 TraceCheckUtils]: 54: Hoare triple {13447#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {13451#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 04:51:16,983 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-08 04:51:16,984 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-08 04:51:16,985 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-08 04:51:16,986 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-08 04:51:16,986 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-08 04:51:16,986 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-08 04:51:16,987 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-08 04:51:16,987 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-08 04:51:16,988 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-08 04:51:16,989 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-08 04:51:16,992 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-08 04:51:16,994 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-08 04:51:16,994 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {13271#true} {13271#true} #65#return; {13271#true} is VALID [2022-04-08 04:51:16,994 INFO L290 TraceCheckUtils]: 40: Hoare triple {13271#true} assume true; {13271#true} is VALID [2022-04-08 04:51:16,994 INFO L290 TraceCheckUtils]: 39: Hoare triple {13271#true} assume !(0 == ~cond); {13271#true} is VALID [2022-04-08 04:51:16,994 INFO L290 TraceCheckUtils]: 38: Hoare triple {13271#true} ~cond := #in~cond; {13271#true} is VALID [2022-04-08 04:51:16,994 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-08 04:51:16,994 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-08 04:51:16,994 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-08 04:51:16,995 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-08 04:51:16,995 INFO L290 TraceCheckUtils]: 33: Hoare triple {13271#true} assume !!(~x~0 <= ~X~0); {13271#true} is VALID [2022-04-08 04:51:16,995 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {13271#true} {13271#true} #65#return; {13271#true} is VALID [2022-04-08 04:51:16,995 INFO L290 TraceCheckUtils]: 31: Hoare triple {13271#true} assume true; {13271#true} is VALID [2022-04-08 04:51:16,995 INFO L290 TraceCheckUtils]: 30: Hoare triple {13271#true} assume !(0 == ~cond); {13271#true} is VALID [2022-04-08 04:51:16,995 INFO L290 TraceCheckUtils]: 29: Hoare triple {13271#true} ~cond := #in~cond; {13271#true} is VALID [2022-04-08 04:51:16,995 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-08 04:51:16,995 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-08 04:51:16,995 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-08 04:51:16,995 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-08 04:51:16,995 INFO L290 TraceCheckUtils]: 24: Hoare triple {13271#true} assume !!(~x~0 <= ~X~0); {13271#true} is VALID [2022-04-08 04:51:16,995 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {13271#true} {13271#true} #65#return; {13271#true} is VALID [2022-04-08 04:51:16,995 INFO L290 TraceCheckUtils]: 22: Hoare triple {13271#true} assume true; {13271#true} is VALID [2022-04-08 04:51:16,995 INFO L290 TraceCheckUtils]: 21: Hoare triple {13271#true} assume !(0 == ~cond); {13271#true} is VALID [2022-04-08 04:51:16,996 INFO L290 TraceCheckUtils]: 20: Hoare triple {13271#true} ~cond := #in~cond; {13271#true} is VALID [2022-04-08 04:51:16,996 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-08 04:51:16,996 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-08 04:51:16,996 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-08 04:51:16,996 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {13271#true} {13271#true} #63#return; {13271#true} is VALID [2022-04-08 04:51:16,996 INFO L290 TraceCheckUtils]: 15: Hoare triple {13271#true} assume true; {13271#true} is VALID [2022-04-08 04:51:16,996 INFO L290 TraceCheckUtils]: 14: Hoare triple {13271#true} assume !(0 == ~cond); {13271#true} is VALID [2022-04-08 04:51:16,996 INFO L290 TraceCheckUtils]: 13: Hoare triple {13271#true} ~cond := #in~cond; {13271#true} is VALID [2022-04-08 04:51:16,996 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-08 04:51:16,996 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-08 04:51:16,996 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {13271#true} {13271#true} #61#return; {13271#true} is VALID [2022-04-08 04:51:16,996 INFO L290 TraceCheckUtils]: 9: Hoare triple {13271#true} assume true; {13271#true} is VALID [2022-04-08 04:51:16,996 INFO L290 TraceCheckUtils]: 8: Hoare triple {13271#true} assume !(0 == ~cond); {13271#true} is VALID [2022-04-08 04:51:16,996 INFO L290 TraceCheckUtils]: 7: Hoare triple {13271#true} ~cond := #in~cond; {13271#true} is VALID [2022-04-08 04:51:16,996 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-08 04:51:16,997 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-08 04:51:16,997 INFO L272 TraceCheckUtils]: 4: Hoare triple {13271#true} call #t~ret8 := main(); {13271#true} is VALID [2022-04-08 04:51:16,997 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13271#true} {13271#true} #69#return; {13271#true} is VALID [2022-04-08 04:51:16,997 INFO L290 TraceCheckUtils]: 2: Hoare triple {13271#true} assume true; {13271#true} is VALID [2022-04-08 04:51:16,997 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-08 04:51:16,997 INFO L272 TraceCheckUtils]: 0: Hoare triple {13271#true} call ULTIMATE.init(); {13271#true} is VALID [2022-04-08 04:51:17,004 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-08 04:51:17,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 04:51:17,004 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [751527525] [2022-04-08 04:51:17,004 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 04:51:17,004 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1857073986] [2022-04-08 04:51:17,004 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1857073986] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 04:51:17,004 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 04:51:17,004 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 13] total 24 [2022-04-08 04:51:17,005 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 04:51:17,005 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1438527348] [2022-04-08 04:51:17,005 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1438527348] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 04:51:17,005 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 04:51:17,005 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-04-08 04:51:17,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [666447240] [2022-04-08 04:51:17,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 04:51:17,005 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-08 04:51:17,006 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 04:51:17,006 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-08 04:51:19,047 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-08 04:51:19,047 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-08 04:51:19,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 04:51:19,048 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-08 04:51:19,048 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=472, Unknown=0, NotChecked=0, Total=552 [2022-04-08 04:51:19,048 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-08 04:51:31,525 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-08 04:51:33,528 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-08 04:51:34,997 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.46s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-08 04:51:37,138 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-08 04:51:39,141 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-08 04:51:41,144 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-08 04:51:43,147 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-08 04:51:45,425 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-08 04:51:45,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:51:45,971 INFO L93 Difference]: Finished difference Result 126 states and 142 transitions. [2022-04-08 04:51:45,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-04-08 04:51:45,971 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-08 04:51:45,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 04:51:45,971 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-08 04:51:45,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 68 transitions. [2022-04-08 04:51:45,973 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-08 04:51:45,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 68 transitions. [2022-04-08 04:51:45,974 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 68 transitions. [2022-04-08 04:51:50,043 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 66 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-08 04:51:50,044 INFO L225 Difference]: With dead ends: 126 [2022-04-08 04:51:50,045 INFO L226 Difference]: Without dead ends: 118 [2022-04-08 04:51:50,045 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 90 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 161 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=151, Invalid=841, Unknown=0, NotChecked=0, Total=992 [2022-04-08 04:51:50,046 INFO L913 BasicCegarLoop]: 31 mSDtfsCounter, 21 mSDsluCounter, 251 mSDsCounter, 0 mSdLazyCounter, 539 mSolverCounterSat, 8 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 282 SdHoareTripleChecker+Invalid, 554 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 539 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 16.7s IncrementalHoareTripleChecker+Time [2022-04-08 04:51:50,046 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 282 Invalid, 554 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 539 Invalid, 7 Unknown, 0 Unchecked, 16.7s Time] [2022-04-08 04:51:50,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2022-04-08 04:51:50,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 114. [2022-04-08 04:51:50,329 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 04:51:50,329 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-08 04:51:50,329 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-08 04:51:50,329 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-08 04:51:50,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:51:50,331 INFO L93 Difference]: Finished difference Result 118 states and 134 transitions. [2022-04-08 04:51:50,332 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 134 transitions. [2022-04-08 04:51:50,332 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:51:50,332 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:51:50,332 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-08 04:51:50,333 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-08 04:51:50,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:51:50,335 INFO L93 Difference]: Finished difference Result 118 states and 134 transitions. [2022-04-08 04:51:50,335 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 134 transitions. [2022-04-08 04:51:50,335 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:51:50,335 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:51:50,335 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 04:51:50,335 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 04:51:50,336 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-08 04:51:50,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 130 transitions. [2022-04-08 04:51:50,338 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 130 transitions. Word has length 57 [2022-04-08 04:51:50,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 04:51:50,338 INFO L478 AbstractCegarLoop]: Abstraction has 114 states and 130 transitions. [2022-04-08 04:51:50,338 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 2.142857142857143) internal successors, (30), 14 states have internal predecessors, (30), 5 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-08 04:51:50,338 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 114 states and 130 transitions. [2022-04-08 04:51:52,732 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-08 04:51:52,732 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 130 transitions. [2022-04-08 04:51:52,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-04-08 04:51:52,733 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 04:51:52,733 INFO L499 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 04:51:52,761 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-08 04:51:52,955 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 04:51:52,955 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 04:51:52,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 04:51:52,956 INFO L85 PathProgramCache]: Analyzing trace with hash -680465044, now seen corresponding path program 5 times [2022-04-08 04:51:52,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 04:51:52,956 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [897428671] [2022-04-08 04:51:52,956 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 04:51:52,957 INFO L85 PathProgramCache]: Analyzing trace with hash -680465044, now seen corresponding path program 6 times [2022-04-08 04:51:52,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 04:51:52,957 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [593804978] [2022-04-08 04:51:52,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 04:51:52,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 04:51:52,968 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 04:51:52,968 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1443182138] [2022-04-08 04:51:52,968 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 04:51:52,968 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 04:51:52,968 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 04:51:52,969 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-08 04:51:52,973 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-08 04:51:53,090 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-04-08 04:51:53,090 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 04:51:53,091 INFO L263 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 33 conjunts are in the unsatisfiable core [2022-04-08 04:51:53,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:51:53,112 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 04:52:10,480 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-08 04:52:20,508 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-08 04:52:25,318 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-08 04:52:49,985 INFO L272 TraceCheckUtils]: 0: Hoare triple {14368#true} call ULTIMATE.init(); {14368#true} is VALID [2022-04-08 04:52:49,985 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-08 04:52:49,986 INFO L290 TraceCheckUtils]: 2: Hoare triple {14368#true} assume true; {14368#true} is VALID [2022-04-08 04:52:49,986 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14368#true} {14368#true} #69#return; {14368#true} is VALID [2022-04-08 04:52:49,986 INFO L272 TraceCheckUtils]: 4: Hoare triple {14368#true} call #t~ret8 := main(); {14368#true} is VALID [2022-04-08 04:52:49,986 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-08 04:52:49,986 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-08 04:52:49,986 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-08 04:52:49,986 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-08 04:52:49,987 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-08 04:52:49,987 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-08 04:52:49,988 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-08 04:52:49,988 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-08 04:52:49,988 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-08 04:52:49,988 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-08 04:52:49,988 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-08 04:52:49,989 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-08 04:52:49,989 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-08 04:52:49,990 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-08 04:52:49,990 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-08 04:52:49,990 INFO L290 TraceCheckUtils]: 20: Hoare triple {14368#true} ~cond := #in~cond; {14368#true} is VALID [2022-04-08 04:52:49,990 INFO L290 TraceCheckUtils]: 21: Hoare triple {14368#true} assume !(0 == ~cond); {14368#true} is VALID [2022-04-08 04:52:49,990 INFO L290 TraceCheckUtils]: 22: Hoare triple {14368#true} assume true; {14368#true} is VALID [2022-04-08 04:52:49,991 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-08 04:52:49,991 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-08 04:52:49,991 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-08 04:52:49,992 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-08 04:52:49,992 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-08 04:52:49,992 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-08 04:52:49,992 INFO L290 TraceCheckUtils]: 29: Hoare triple {14368#true} ~cond := #in~cond; {14368#true} is VALID [2022-04-08 04:52:49,992 INFO L290 TraceCheckUtils]: 30: Hoare triple {14368#true} assume !(0 == ~cond); {14368#true} is VALID [2022-04-08 04:52:49,992 INFO L290 TraceCheckUtils]: 31: Hoare triple {14368#true} assume true; {14368#true} is VALID [2022-04-08 04:52:49,993 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-08 04:52:49,993 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-08 04:52:49,994 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-08 04:52:49,994 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-08 04:52:49,994 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-08 04:52:49,994 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-08 04:52:49,995 INFO L290 TraceCheckUtils]: 38: Hoare triple {14368#true} ~cond := #in~cond; {14368#true} is VALID [2022-04-08 04:52:49,995 INFO L290 TraceCheckUtils]: 39: Hoare triple {14368#true} assume !(0 == ~cond); {14368#true} is VALID [2022-04-08 04:52:49,995 INFO L290 TraceCheckUtils]: 40: Hoare triple {14368#true} assume true; {14368#true} is VALID [2022-04-08 04:52:49,995 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-08 04:52:49,996 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-08 04:52:49,996 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-08 04:52:49,998 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-08 04:52:49,998 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-08 04:52:49,998 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-08 04:52:49,999 INFO L290 TraceCheckUtils]: 47: Hoare triple {14368#true} ~cond := #in~cond; {14523#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 04:52:49,999 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-08 04:52:49,999 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-08 04:52:50,001 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-08 04:52:50,001 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-08 04:52:50,032 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-08 04:52:50,049 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-08 04:52:50,050 INFO L290 TraceCheckUtils]: 54: Hoare triple {14546#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {14550#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 04:52:50,050 INFO L290 TraceCheckUtils]: 55: Hoare triple {14550#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {14369#false} is VALID [2022-04-08 04:52:50,050 INFO L290 TraceCheckUtils]: 56: Hoare triple {14369#false} assume !false; {14369#false} is VALID [2022-04-08 04:52:50,050 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-08 04:52:50,051 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 04:52:54,822 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-08 04:53:00,938 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-08 04:53:55,914 INFO L290 TraceCheckUtils]: 56: Hoare triple {14369#false} assume !false; {14369#false} is VALID [2022-04-08 04:53:55,915 INFO L290 TraceCheckUtils]: 55: Hoare triple {14550#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {14369#false} is VALID [2022-04-08 04:53:55,915 INFO L290 TraceCheckUtils]: 54: Hoare triple {14546#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {14550#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 04:53:55,916 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-08 04:53:55,918 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-08 04:53:55,918 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-08 04:53:55,919 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-08 04:53:55,919 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-08 04:53:55,920 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-08 04:53:55,920 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-08 04:53:55,920 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-08 04:53:57,924 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-08 04:53:57,941 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-08 04:53:59,947 WARN L290 TraceCheckUtils]: 43: Hoare triple {14603#(forall ((v_main_~x~0_72 Int)) (or (<= v_main_~x~0_72 main_~X~0) (and (or (forall ((aux_div_v_main_~v~0_110_41 Int)) (or (and (or (forall ((aux_div_aux_mod_v_main_~v~0_110_41_79 Int)) (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) (<= (+ 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))))) (<= 0 (+ (div (+ (- 1) (* (- 1) main_~X~0)) 2) main_~Y~0 aux_div_v_main_~v~0_110_41))) (or (forall ((aux_div_aux_mod_v_main_~v~0_110_41_79 Int)) (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 (+ (div (+ (- 1) (* (- 1) main_~X~0)) 2) main_~Y~0 aux_div_v_main_~v~0_110_41)))) (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)))) (= main_~X~0 0)) (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))) (not (<= v_main_~x~0_72 (+ main_~x~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; {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 UNKNOWN [2022-04-08 04:54:00,250 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) (and (or (forall ((aux_div_v_main_~v~0_110_41 Int)) (or (and (or (forall ((aux_div_aux_mod_v_main_~v~0_110_41_79 Int)) (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) (<= (+ 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))))) (<= 0 (+ (div (+ (- 1) (* (- 1) main_~X~0)) 2) main_~Y~0 aux_div_v_main_~v~0_110_41))) (or (forall ((aux_div_aux_mod_v_main_~v~0_110_41_79 Int)) (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 (+ (div (+ (- 1) (* (- 1) main_~X~0)) 2) main_~Y~0 aux_div_v_main_~v~0_110_41)))) (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)))) (= main_~X~0 0)) (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))) (not (<= v_main_~x~0_72 (+ main_~x~0 1)))))} is VALID [2022-04-08 04:54:00,250 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {14368#true} {14368#true} #65#return; {14368#true} is VALID [2022-04-08 04:54:00,251 INFO L290 TraceCheckUtils]: 40: Hoare triple {14368#true} assume true; {14368#true} is VALID [2022-04-08 04:54:00,251 INFO L290 TraceCheckUtils]: 39: Hoare triple {14368#true} assume !(0 == ~cond); {14368#true} is VALID [2022-04-08 04:54:00,251 INFO L290 TraceCheckUtils]: 38: Hoare triple {14368#true} ~cond := #in~cond; {14368#true} is VALID [2022-04-08 04:54:00,251 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-08 04:54:00,251 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-08 04:54:00,251 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-08 04:54:00,251 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-08 04:54:00,251 INFO L290 TraceCheckUtils]: 33: Hoare triple {14368#true} assume !!(~x~0 <= ~X~0); {14368#true} is VALID [2022-04-08 04:54:00,251 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {14368#true} {14368#true} #65#return; {14368#true} is VALID [2022-04-08 04:54:00,251 INFO L290 TraceCheckUtils]: 31: Hoare triple {14368#true} assume true; {14368#true} is VALID [2022-04-08 04:54:00,251 INFO L290 TraceCheckUtils]: 30: Hoare triple {14368#true} assume !(0 == ~cond); {14368#true} is VALID [2022-04-08 04:54:00,251 INFO L290 TraceCheckUtils]: 29: Hoare triple {14368#true} ~cond := #in~cond; {14368#true} is VALID [2022-04-08 04:54:00,251 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-08 04:54:00,251 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-08 04:54:00,252 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-08 04:54:00,252 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-08 04:54:00,252 INFO L290 TraceCheckUtils]: 24: Hoare triple {14368#true} assume !!(~x~0 <= ~X~0); {14368#true} is VALID [2022-04-08 04:54:00,252 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {14368#true} {14368#true} #65#return; {14368#true} is VALID [2022-04-08 04:54:00,252 INFO L290 TraceCheckUtils]: 22: Hoare triple {14368#true} assume true; {14368#true} is VALID [2022-04-08 04:54:00,252 INFO L290 TraceCheckUtils]: 21: Hoare triple {14368#true} assume !(0 == ~cond); {14368#true} is VALID [2022-04-08 04:54:00,252 INFO L290 TraceCheckUtils]: 20: Hoare triple {14368#true} ~cond := #in~cond; {14368#true} is VALID [2022-04-08 04:54:00,252 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-08 04:54:00,252 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-08 04:54:00,252 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-08 04:54:00,252 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {14368#true} {14368#true} #63#return; {14368#true} is VALID [2022-04-08 04:54:00,252 INFO L290 TraceCheckUtils]: 15: Hoare triple {14368#true} assume true; {14368#true} is VALID [2022-04-08 04:54:00,252 INFO L290 TraceCheckUtils]: 14: Hoare triple {14368#true} assume !(0 == ~cond); {14368#true} is VALID [2022-04-08 04:54:00,252 INFO L290 TraceCheckUtils]: 13: Hoare triple {14368#true} ~cond := #in~cond; {14368#true} is VALID [2022-04-08 04:54:00,252 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-08 04:54:00,253 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-08 04:54:00,253 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {14368#true} {14368#true} #61#return; {14368#true} is VALID [2022-04-08 04:54:00,253 INFO L290 TraceCheckUtils]: 9: Hoare triple {14368#true} assume true; {14368#true} is VALID [2022-04-08 04:54:00,253 INFO L290 TraceCheckUtils]: 8: Hoare triple {14368#true} assume !(0 == ~cond); {14368#true} is VALID [2022-04-08 04:54:00,253 INFO L290 TraceCheckUtils]: 7: Hoare triple {14368#true} ~cond := #in~cond; {14368#true} is VALID [2022-04-08 04:54:00,253 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-08 04:54:00,253 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-08 04:54:00,253 INFO L272 TraceCheckUtils]: 4: Hoare triple {14368#true} call #t~ret8 := main(); {14368#true} is VALID [2022-04-08 04:54:00,253 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14368#true} {14368#true} #69#return; {14368#true} is VALID [2022-04-08 04:54:00,253 INFO L290 TraceCheckUtils]: 2: Hoare triple {14368#true} assume true; {14368#true} is VALID [2022-04-08 04:54:00,253 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-08 04:54:00,253 INFO L272 TraceCheckUtils]: 0: Hoare triple {14368#true} call ULTIMATE.init(); {14368#true} is VALID [2022-04-08 04:54:00,254 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-08 04:54:00,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 04:54:00,254 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [593804978] [2022-04-08 04:54:00,254 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 04:54:00,254 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1443182138] [2022-04-08 04:54:00,254 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1443182138] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 04:54:00,254 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 04:54:00,254 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 13] total 26 [2022-04-08 04:54:00,254 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 04:54:00,254 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [897428671] [2022-04-08 04:54:00,255 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [897428671] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 04:54:00,255 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 04:54:00,255 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-04-08 04:54:00,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [859415256] [2022-04-08 04:54:00,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 04:54:00,255 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-08 04:54:00,255 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 04:54:00,256 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-08 04:54:00,340 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 04:54:00,340 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-04-08 04:54:00,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 04:54:00,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-04-08 04:54:00,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=542, Unknown=6, NotChecked=0, Total=650 [2022-04-08 04:54:00,341 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-08 04:54:06,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:54:06,279 INFO L93 Difference]: Finished difference Result 123 states and 138 transitions. [2022-04-08 04:54:06,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-04-08 04:54:06,279 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-08 04:54:06,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 04:54:06,280 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-08 04:54:06,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 40 transitions. [2022-04-08 04:54:06,281 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-08 04:54:06,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 40 transitions. [2022-04-08 04:54:06,292 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 40 transitions. [2022-04-08 04:54:06,458 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-08 04:54:06,459 INFO L225 Difference]: With dead ends: 123 [2022-04-08 04:54:06,459 INFO L226 Difference]: Without dead ends: 115 [2022-04-08 04:54:06,460 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 88 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 284 ImplicationChecksByTransitivity, 19.6s TimeCoverageRelationStatistics Valid=249, Invalid=1151, Unknown=6, NotChecked=0, Total=1406 [2022-04-08 04:54:06,461 INFO L913 BasicCegarLoop]: 15 mSDtfsCounter, 33 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 175 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s 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.1s IncrementalHoareTripleChecker+Time [2022-04-08 04:54:06,461 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [34 Valid, 101 Invalid, 201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 175 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-04-08 04:54:06,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2022-04-08 04:54:06,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 95. [2022-04-08 04:54:06,787 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 04:54:06,788 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-08 04:54:06,788 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-08 04:54:06,788 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-08 04:54:06,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:54:06,791 INFO L93 Difference]: Finished difference Result 115 states and 129 transitions. [2022-04-08 04:54:06,791 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 129 transitions. [2022-04-08 04:54:06,792 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:54:06,792 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:54:06,792 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-08 04:54:06,792 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-08 04:54:06,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:54:06,795 INFO L93 Difference]: Finished difference Result 115 states and 129 transitions. [2022-04-08 04:54:06,795 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 129 transitions. [2022-04-08 04:54:06,796 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:54:06,796 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:54:06,796 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 04:54:06,796 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 04:54:06,796 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-08 04:54:06,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 103 transitions. [2022-04-08 04:54:06,798 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 103 transitions. Word has length 57 [2022-04-08 04:54:06,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 04:54:06,798 INFO L478 AbstractCegarLoop]: Abstraction has 95 states and 103 transitions. [2022-04-08 04:54:06,799 INFO L479 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-08 04:54:06,799 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 95 states and 103 transitions. [2022-04-08 04:54:07,383 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-08 04:54:07,384 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 103 transitions. [2022-04-08 04:54:07,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-04-08 04:54:07,384 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 04:54:07,384 INFO L499 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 04:54:07,391 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2022-04-08 04:54:07,589 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 04:54:07,589 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 04:54:07,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 04:54:07,589 INFO L85 PathProgramCache]: Analyzing trace with hash 809583191, now seen corresponding path program 15 times [2022-04-08 04:54:07,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 04:54:07,590 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1640901536] [2022-04-08 04:54:07,590 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 04:54:07,590 INFO L85 PathProgramCache]: Analyzing trace with hash 809583191, now seen corresponding path program 16 times [2022-04-08 04:54:07,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 04:54:07,590 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [667408469] [2022-04-08 04:54:07,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 04:54:07,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 04:54:07,602 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 04:54:07,602 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1253346153] [2022-04-08 04:54:07,602 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 04:54:07,602 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 04:54:07,603 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 04:54:07,604 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-08 04:54:07,605 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-08 04:54:07,645 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 04:54:07,646 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 04:54:07,646 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 36 conjunts are in the unsatisfiable core [2022-04-08 04:54:07,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:54:07,664 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 04:54:24,754 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-08 04:54:29,272 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-08 04:54:37,426 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-08 04:54:43,041 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-08 04:55:51,460 INFO L272 TraceCheckUtils]: 0: Hoare triple {15425#true} call ULTIMATE.init(); {15425#true} is VALID [2022-04-08 04:55:51,460 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-08 04:55:51,460 INFO L290 TraceCheckUtils]: 2: Hoare triple {15425#true} assume true; {15425#true} is VALID [2022-04-08 04:55:51,460 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15425#true} {15425#true} #69#return; {15425#true} is VALID [2022-04-08 04:55:51,460 INFO L272 TraceCheckUtils]: 4: Hoare triple {15425#true} call #t~ret8 := main(); {15425#true} is VALID [2022-04-08 04:55:51,461 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-08 04:55:51,461 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-08 04:55:51,461 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-08 04:55:51,461 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-08 04:55:51,461 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-08 04:55:51,462 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-08 04:55:51,462 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-08 04:55:51,462 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-08 04:55:51,463 INFO L290 TraceCheckUtils]: 13: Hoare triple {15425#true} ~cond := #in~cond; {15425#true} is VALID [2022-04-08 04:55:51,463 INFO L290 TraceCheckUtils]: 14: Hoare triple {15425#true} assume !(0 == ~cond); {15425#true} is VALID [2022-04-08 04:55:51,463 INFO L290 TraceCheckUtils]: 15: Hoare triple {15425#true} assume true; {15425#true} is VALID [2022-04-08 04:55:51,463 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-08 04:55:51,463 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-08 04:55:51,464 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-08 04:55:51,464 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-08 04:55:51,464 INFO L290 TraceCheckUtils]: 20: Hoare triple {15425#true} ~cond := #in~cond; {15425#true} is VALID [2022-04-08 04:55:51,464 INFO L290 TraceCheckUtils]: 21: Hoare triple {15425#true} assume !(0 == ~cond); {15425#true} is VALID [2022-04-08 04:55:51,464 INFO L290 TraceCheckUtils]: 22: Hoare triple {15425#true} assume true; {15425#true} is VALID [2022-04-08 04:55:51,465 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-08 04:55:51,465 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-08 04:55:51,466 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-08 04:55:51,468 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-08 04:55:51,468 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-08 04:55:51,469 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-08 04:55:51,469 INFO L290 TraceCheckUtils]: 29: Hoare triple {15425#true} ~cond := #in~cond; {15425#true} is VALID [2022-04-08 04:55:51,469 INFO L290 TraceCheckUtils]: 30: Hoare triple {15425#true} assume !(0 == ~cond); {15425#true} is VALID [2022-04-08 04:55:51,469 INFO L290 TraceCheckUtils]: 31: Hoare triple {15425#true} assume true; {15425#true} is VALID [2022-04-08 04:55:51,470 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-08 04:55:51,470 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-08 04:55:51,472 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-08 04:55:51,473 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-08 04:55:51,473 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-08 04:55:51,473 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-08 04:55:51,473 INFO L290 TraceCheckUtils]: 38: Hoare triple {15425#true} ~cond := #in~cond; {15425#true} is VALID [2022-04-08 04:55:51,473 INFO L290 TraceCheckUtils]: 39: Hoare triple {15425#true} assume !(0 == ~cond); {15425#true} is VALID [2022-04-08 04:55:51,474 INFO L290 TraceCheckUtils]: 40: Hoare triple {15425#true} assume true; {15425#true} is VALID [2022-04-08 04:55:51,474 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-08 04:55:51,474 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-08 04:55:51,476 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-08 04:55:51,476 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-08 04:55:51,477 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-08 04:55:51,477 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-08 04:55:51,477 INFO L290 TraceCheckUtils]: 47: Hoare triple {15425#true} ~cond := #in~cond; {15582#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 04:55:51,478 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-08 04:55:51,478 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-08 04:55:51,480 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-08 04:55:51,480 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-08 04:55:51,481 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-08 04:55:51,483 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-08 04:55:52,052 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-08 04:55:52,055 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-08 04:55:52,056 INFO L290 TraceCheckUtils]: 56: Hoare triple {15612#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {15616#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 04:55:52,056 INFO L290 TraceCheckUtils]: 57: Hoare triple {15616#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {15426#false} is VALID [2022-04-08 04:55:52,056 INFO L290 TraceCheckUtils]: 58: Hoare triple {15426#false} assume !false; {15426#false} is VALID [2022-04-08 04:55:52,057 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-08 04:55:52,057 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 04:55:59,421 INFO L290 TraceCheckUtils]: 58: Hoare triple {15426#false} assume !false; {15426#false} is VALID [2022-04-08 04:55:59,422 INFO L290 TraceCheckUtils]: 57: Hoare triple {15616#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {15426#false} is VALID [2022-04-08 04:55:59,422 INFO L290 TraceCheckUtils]: 56: Hoare triple {15612#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {15616#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 04:55:59,422 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-08 04:55:59,424 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-08 04:55:59,426 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-08 04:55:59,427 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-08 04:55:59,427 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-08 04:55:59,428 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-08 04:55:59,429 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-08 04:55:59,429 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-08 04:55:59,429 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-08 04:55:59,429 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-08 04:55:59,431 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-08 04:55:59,431 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-08 04:55:59,431 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-08 04:55:59,431 INFO L290 TraceCheckUtils]: 42: Hoare triple {15425#true} assume !!(~x~0 <= ~X~0); {15425#true} is VALID [2022-04-08 04:55:59,431 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {15425#true} {15425#true} #65#return; {15425#true} is VALID [2022-04-08 04:55:59,431 INFO L290 TraceCheckUtils]: 40: Hoare triple {15425#true} assume true; {15425#true} is VALID [2022-04-08 04:55:59,431 INFO L290 TraceCheckUtils]: 39: Hoare triple {15425#true} assume !(0 == ~cond); {15425#true} is VALID [2022-04-08 04:55:59,431 INFO L290 TraceCheckUtils]: 38: Hoare triple {15425#true} ~cond := #in~cond; {15425#true} is VALID [2022-04-08 04:55:59,431 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-08 04:55:59,431 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-08 04:55:59,431 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-08 04:55:59,431 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-08 04:55:59,432 INFO L290 TraceCheckUtils]: 33: Hoare triple {15425#true} assume !!(~x~0 <= ~X~0); {15425#true} is VALID [2022-04-08 04:55:59,432 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {15425#true} {15425#true} #65#return; {15425#true} is VALID [2022-04-08 04:55:59,432 INFO L290 TraceCheckUtils]: 31: Hoare triple {15425#true} assume true; {15425#true} is VALID [2022-04-08 04:55:59,432 INFO L290 TraceCheckUtils]: 30: Hoare triple {15425#true} assume !(0 == ~cond); {15425#true} is VALID [2022-04-08 04:55:59,432 INFO L290 TraceCheckUtils]: 29: Hoare triple {15425#true} ~cond := #in~cond; {15425#true} is VALID [2022-04-08 04:55:59,432 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-08 04:55:59,432 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-08 04:55:59,432 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-08 04:55:59,432 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-08 04:55:59,432 INFO L290 TraceCheckUtils]: 24: Hoare triple {15425#true} assume !!(~x~0 <= ~X~0); {15425#true} is VALID [2022-04-08 04:55:59,432 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {15425#true} {15425#true} #65#return; {15425#true} is VALID [2022-04-08 04:55:59,432 INFO L290 TraceCheckUtils]: 22: Hoare triple {15425#true} assume true; {15425#true} is VALID [2022-04-08 04:55:59,432 INFO L290 TraceCheckUtils]: 21: Hoare triple {15425#true} assume !(0 == ~cond); {15425#true} is VALID [2022-04-08 04:55:59,432 INFO L290 TraceCheckUtils]: 20: Hoare triple {15425#true} ~cond := #in~cond; {15425#true} is VALID [2022-04-08 04:55:59,432 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-08 04:55:59,433 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-08 04:55:59,433 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-08 04:55:59,433 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {15425#true} {15425#true} #63#return; {15425#true} is VALID [2022-04-08 04:55:59,433 INFO L290 TraceCheckUtils]: 15: Hoare triple {15425#true} assume true; {15425#true} is VALID [2022-04-08 04:55:59,433 INFO L290 TraceCheckUtils]: 14: Hoare triple {15425#true} assume !(0 == ~cond); {15425#true} is VALID [2022-04-08 04:55:59,433 INFO L290 TraceCheckUtils]: 13: Hoare triple {15425#true} ~cond := #in~cond; {15425#true} is VALID [2022-04-08 04:55:59,433 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-08 04:55:59,433 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-08 04:55:59,433 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {15425#true} {15425#true} #61#return; {15425#true} is VALID [2022-04-08 04:55:59,433 INFO L290 TraceCheckUtils]: 9: Hoare triple {15425#true} assume true; {15425#true} is VALID [2022-04-08 04:55:59,433 INFO L290 TraceCheckUtils]: 8: Hoare triple {15425#true} assume !(0 == ~cond); {15425#true} is VALID [2022-04-08 04:55:59,433 INFO L290 TraceCheckUtils]: 7: Hoare triple {15425#true} ~cond := #in~cond; {15425#true} is VALID [2022-04-08 04:55:59,433 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-08 04:55:59,433 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-08 04:55:59,433 INFO L272 TraceCheckUtils]: 4: Hoare triple {15425#true} call #t~ret8 := main(); {15425#true} is VALID [2022-04-08 04:55:59,434 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15425#true} {15425#true} #69#return; {15425#true} is VALID [2022-04-08 04:55:59,434 INFO L290 TraceCheckUtils]: 2: Hoare triple {15425#true} assume true; {15425#true} is VALID [2022-04-08 04:55:59,434 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-08 04:55:59,434 INFO L272 TraceCheckUtils]: 0: Hoare triple {15425#true} call ULTIMATE.init(); {15425#true} is VALID [2022-04-08 04:55:59,434 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-08 04:55:59,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 04:55:59,434 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [667408469] [2022-04-08 04:55:59,434 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 04:55:59,434 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1253346153] [2022-04-08 04:55:59,434 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1253346153] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 04:55:59,435 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 04:55:59,435 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 10] total 26 [2022-04-08 04:55:59,435 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 04:55:59,435 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1640901536] [2022-04-08 04:55:59,435 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1640901536] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 04:55:59,435 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 04:55:59,435 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2022-04-08 04:55:59,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1060305733] [2022-04-08 04:55:59,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 04:55:59,436 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-08 04:55:59,436 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 04:55:59,436 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-08 04:56:00,002 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 04:56:00,003 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-04-08 04:56:00,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 04:56:00,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-04-08 04:56:00,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=567, Unknown=1, NotChecked=0, Total=650 [2022-04-08 04:56:00,004 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-08 04:56:02,698 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-08 04:56:05,574 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-08 04:56:08,471 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-08 04:56:30,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:56:30,608 INFO L93 Difference]: Finished difference Result 107 states and 116 transitions. [2022-04-08 04:56:30,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-04-08 04:56:30,608 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-08 04:56:30,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 04:56:30,608 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-08 04:56:30,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 65 transitions. [2022-04-08 04:56:30,609 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-08 04:56:30,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 65 transitions. [2022-04-08 04:56:30,610 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 22 states and 65 transitions. [2022-04-08 04:56:31,527 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-08 04:56:31,528 INFO L225 Difference]: With dead ends: 107 [2022-04-08 04:56:31,528 INFO L226 Difference]: Without dead ends: 81 [2022-04-08 04:56:31,529 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 91 SyntacticMatches, 2 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 265 ImplicationChecksByTransitivity, 14.7s TimeCoverageRelationStatistics Valid=196, Invalid=1134, Unknown=2, NotChecked=0, Total=1332 [2022-04-08 04:56:31,529 INFO L913 BasicCegarLoop]: 20 mSDtfsCounter, 34 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 445 mSolverCounterSat, 37 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.4s 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, 13.4s IncrementalHoareTripleChecker+Time [2022-04-08 04:56:31,530 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [35 Valid, 103 Invalid, 485 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 445 Invalid, 3 Unknown, 0 Unchecked, 13.4s Time] [2022-04-08 04:56:31,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2022-04-08 04:56:31,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2022-04-08 04:56:31,753 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 04:56:31,753 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-08 04:56:31,753 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-08 04:56:31,754 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-08 04:56:31,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:56:31,755 INFO L93 Difference]: Finished difference Result 81 states and 87 transitions. [2022-04-08 04:56:31,755 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 87 transitions. [2022-04-08 04:56:31,755 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:56:31,755 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:56:31,755 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-08 04:56:31,756 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-08 04:56:31,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:56:31,757 INFO L93 Difference]: Finished difference Result 81 states and 87 transitions. [2022-04-08 04:56:31,757 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 87 transitions. [2022-04-08 04:56:31,757 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:56:31,757 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:56:31,757 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 04:56:31,757 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 04:56:31,758 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-08 04:56:31,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 87 transitions. [2022-04-08 04:56:31,759 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 87 transitions. Word has length 59 [2022-04-08 04:56:31,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 04:56:31,759 INFO L478 AbstractCegarLoop]: Abstraction has 81 states and 87 transitions. [2022-04-08 04:56:31,759 INFO L479 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-08 04:56:31,759 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 81 states and 87 transitions. [2022-04-08 04:56:32,363 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 87 edges. 87 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 04:56:32,363 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 87 transitions. [2022-04-08 04:56:32,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-04-08 04:56:32,363 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 04:56:32,363 INFO L499 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 04:56:32,379 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-08 04:56:32,564 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2022-04-08 04:56:32,564 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 04:56:32,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 04:56:32,564 INFO L85 PathProgramCache]: Analyzing trace with hash 1971200155, now seen corresponding path program 17 times [2022-04-08 04:56:32,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 04:56:32,564 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [90207964] [2022-04-08 04:56:32,565 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 04:56:32,565 INFO L85 PathProgramCache]: Analyzing trace with hash 1971200155, now seen corresponding path program 18 times [2022-04-08 04:56:32,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 04:56:32,565 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [956328572] [2022-04-08 04:56:32,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 04:56:32,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 04:56:32,581 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 04:56:32,582 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1937959618] [2022-04-08 04:56:32,582 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 04:56:32,582 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 04:56:32,583 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 04:56:32,583 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-08 04:56:32,584 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-08 04:56:32,650 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-04-08 04:56:32,650 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 04:56:32,651 INFO L263 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 52 conjunts are in the unsatisfiable core [2022-04-08 04:56:32,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:56:32,666 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 04:57:02,399 WARN L232 SmtUtils]: Spent 6.04s 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-08 04:57:19,855 WARN L232 SmtUtils]: Spent 6.05s 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-08 04:57:37,349 WARN L232 SmtUtils]: Spent 6.05s 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) [2022-04-08 04:57:52,109 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-08 04:57:57,219 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-08 04:58:09,259 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-08 04:58:13,287 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful