/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf -i ../../../trunk/examples/svcomp/nla-digbench-scaling/egcd-ll_valuebound5.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-08 12:13:13,003 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-08 12:13:13,004 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-08 12:13:13,030 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-08 12:13:13,030 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-08 12:13:13,031 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-08 12:13:13,036 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-08 12:13:13,039 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-08 12:13:13,041 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-08 12:13:13,044 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-08 12:13:13,044 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-08 12:13:13,045 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-08 12:13:13,045 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-08 12:13:13,049 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-08 12:13:13,050 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-08 12:13:13,050 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-08 12:13:13,051 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-08 12:13:13,051 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-08 12:13:13,054 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-08 12:13:13,058 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-08 12:13:13,059 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-08 12:13:13,060 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-08 12:13:13,060 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-08 12:13:13,061 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-08 12:13:13,062 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-08 12:13:13,066 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-08 12:13:13,066 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-08 12:13:13,066 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-08 12:13:13,067 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-08 12:13:13,067 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-08 12:13:13,068 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-08 12:13:13,068 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-08 12:13:13,070 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-08 12:13:13,070 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-08 12:13:13,070 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-08 12:13:13,071 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-08 12:13:13,071 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-08 12:13:13,071 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-08 12:13:13,072 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-08 12:13:13,072 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-08 12:13:13,072 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-08 12:13:13,073 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-08 12:13:13,074 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-04-08 12:13:13,080 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-08 12:13:13,080 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-08 12:13:13,081 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-08 12:13:13,081 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-08 12:13:13,081 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-08 12:13:13,082 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-08 12:13:13,082 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-08 12:13:13,082 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-08 12:13:13,082 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-08 12:13:13,082 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-08 12:13:13,083 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-08 12:13:13,083 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-08 12:13:13,083 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-08 12:13:13,083 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-08 12:13:13,083 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-08 12:13:13,083 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 12:13:13,083 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-08 12:13:13,083 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-08 12:13:13,084 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-08 12:13:13,084 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-08 12:13:13,084 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-08 12:13:13,084 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-08 12:13:13,084 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 12:13:13,258 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-08 12:13:13,274 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-08 12:13:13,275 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-08 12:13:13,276 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-08 12:13:13,276 INFO L275 PluginConnector]: CDTParser initialized [2022-04-08 12:13:13,277 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/egcd-ll_valuebound5.c [2022-04-08 12:13:13,314 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/94e0ade62/aedd1a4c83af4bc981341496b3fd6b66/FLAGe4da3501c [2022-04-08 12:13:13,630 INFO L306 CDTParser]: Found 1 translation units. [2022-04-08 12:13:13,631 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/egcd-ll_valuebound5.c [2022-04-08 12:13:13,635 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/94e0ade62/aedd1a4c83af4bc981341496b3fd6b66/FLAGe4da3501c [2022-04-08 12:13:14,063 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/94e0ade62/aedd1a4c83af4bc981341496b3fd6b66 [2022-04-08 12:13:14,065 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-08 12:13:14,066 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-08 12:13:14,071 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-08 12:13:14,072 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-08 12:13:14,074 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-08 12:13:14,075 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 12:13:14" (1/1) ... [2022-04-08 12:13:14,076 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7b57df4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 12:13:14, skipping insertion in model container [2022-04-08 12:13:14,076 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 12:13:14" (1/1) ... [2022-04-08 12:13:14,089 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-08 12:13:14,098 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-08 12:13:14,209 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/egcd-ll_valuebound5.c[489,502] [2022-04-08 12:13:14,222 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 12:13:14,227 INFO L203 MainTranslator]: Completed pre-run [2022-04-08 12:13:14,235 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/egcd-ll_valuebound5.c[489,502] [2022-04-08 12:13:14,247 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 12:13:14,254 INFO L208 MainTranslator]: Completed translation [2022-04-08 12:13:14,255 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 12:13:14 WrapperNode [2022-04-08 12:13:14,255 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-08 12:13:14,255 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-08 12:13:14,256 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-08 12:13:14,256 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-08 12:13:14,262 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 12:13:14" (1/1) ... [2022-04-08 12:13:14,275 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 12:13:14" (1/1) ... [2022-04-08 12:13:14,279 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 12:13:14" (1/1) ... [2022-04-08 12:13:14,279 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 12:13:14" (1/1) ... [2022-04-08 12:13:14,284 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 12:13:14" (1/1) ... [2022-04-08 12:13:14,291 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 12:13:14" (1/1) ... [2022-04-08 12:13:14,292 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 12:13:14" (1/1) ... [2022-04-08 12:13:14,293 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-08 12:13:14,293 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-08 12:13:14,293 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-08 12:13:14,293 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-08 12:13:14,296 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 12:13:14" (1/1) ... [2022-04-08 12:13:14,305 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 12:13:14,313 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 12:13:14,326 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 12:13:14,345 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 12:13:14,354 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-08 12:13:14,355 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-08 12:13:14,355 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-08 12:13:14,355 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-08 12:13:14,355 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-08 12:13:14,355 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-08 12:13:14,355 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-08 12:13:14,355 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-08 12:13:14,355 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-08 12:13:14,355 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-08 12:13:14,355 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-08 12:13:14,356 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-08 12:13:14,356 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-08 12:13:14,356 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-08 12:13:14,356 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-08 12:13:14,356 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-08 12:13:14,356 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-08 12:13:14,356 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-08 12:13:14,356 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-08 12:13:14,356 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-08 12:13:14,395 INFO L234 CfgBuilder]: Building ICFG [2022-04-08 12:13:14,396 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-08 12:13:14,517 INFO L275 CfgBuilder]: Performing block encoding [2022-04-08 12:13:14,526 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-08 12:13:14,526 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-08 12:13:14,528 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 12:13:14 BoogieIcfgContainer [2022-04-08 12:13:14,528 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-08 12:13:14,529 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-08 12:13:14,529 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-08 12:13:14,531 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-08 12:13:14,532 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.04 12:13:14" (1/3) ... [2022-04-08 12:13:14,532 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@189b8a41 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 12:13:14, skipping insertion in model container [2022-04-08 12:13:14,532 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 12:13:14" (2/3) ... [2022-04-08 12:13:14,532 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@189b8a41 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 12:13:14, skipping insertion in model container [2022-04-08 12:13:14,532 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 12:13:14" (3/3) ... [2022-04-08 12:13:14,533 INFO L111 eAbstractionObserver]: Analyzing ICFG egcd-ll_valuebound5.c [2022-04-08 12:13:14,536 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-08 12:13:14,536 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-08 12:13:14,564 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-08 12:13:14,569 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 12:13:14,569 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-08 12:13:14,594 INFO L276 IsEmpty]: Start isEmpty. Operand has 37 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 19 states have internal predecessors, (25), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-08 12:13:14,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-04-08 12:13:14,599 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 12:13:14,599 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 12:13:14,600 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 12:13:14,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 12:13:14,603 INFO L85 PathProgramCache]: Analyzing trace with hash 870870740, now seen corresponding path program 1 times [2022-04-08 12:13:14,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 12:13:14,613 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1478452202] [2022-04-08 12:13:14,624 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 12:13:14,625 INFO L85 PathProgramCache]: Analyzing trace with hash 870870740, now seen corresponding path program 2 times [2022-04-08 12:13:14,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 12:13:14,628 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1668718011] [2022-04-08 12:13:14,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 12:13:14,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 12:13:14,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 12:13:14,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 12:13:14,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 12:13:14,834 INFO L290 TraceCheckUtils]: 0: Hoare triple {61#(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(10, 2);call #Ultimate.allocInit(12, 3); {40#true} is VALID [2022-04-08 12:13:14,834 INFO L290 TraceCheckUtils]: 1: Hoare triple {40#true} assume true; {40#true} is VALID [2022-04-08 12:13:14,834 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {40#true} {40#true} #88#return; {40#true} is VALID [2022-04-08 12:13:14,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-08 12:13:14,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 12:13:14,843 INFO L290 TraceCheckUtils]: 0: Hoare triple {40#true} ~cond := #in~cond; {40#true} is VALID [2022-04-08 12:13:14,844 INFO L290 TraceCheckUtils]: 1: Hoare triple {40#true} assume 0 == ~cond;assume false; {41#false} is VALID [2022-04-08 12:13:14,844 INFO L290 TraceCheckUtils]: 2: Hoare triple {41#false} assume true; {41#false} is VALID [2022-04-08 12:13:14,844 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {41#false} {40#true} #66#return; {41#false} is VALID [2022-04-08 12:13:14,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-08 12:13:14,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 12:13:14,850 INFO L290 TraceCheckUtils]: 0: Hoare triple {40#true} ~cond := #in~cond; {40#true} is VALID [2022-04-08 12:13:14,851 INFO L290 TraceCheckUtils]: 1: Hoare triple {40#true} assume 0 == ~cond;assume false; {41#false} is VALID [2022-04-08 12:13:14,851 INFO L290 TraceCheckUtils]: 2: Hoare triple {41#false} assume true; {41#false} is VALID [2022-04-08 12:13:14,851 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {41#false} {41#false} #68#return; {41#false} is VALID [2022-04-08 12:13:14,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-04-08 12:13:14,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 12:13:14,856 INFO L290 TraceCheckUtils]: 0: Hoare triple {40#true} ~cond := #in~cond; {40#true} is VALID [2022-04-08 12:13:14,856 INFO L290 TraceCheckUtils]: 1: Hoare triple {40#true} assume 0 == ~cond;assume false; {41#false} is VALID [2022-04-08 12:13:14,857 INFO L290 TraceCheckUtils]: 2: Hoare triple {41#false} assume true; {41#false} is VALID [2022-04-08 12:13:14,857 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {41#false} {41#false} #70#return; {41#false} is VALID [2022-04-08 12:13:14,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-04-08 12:13:14,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 12:13:14,862 INFO L290 TraceCheckUtils]: 0: Hoare triple {40#true} ~cond := #in~cond; {40#true} is VALID [2022-04-08 12:13:14,862 INFO L290 TraceCheckUtils]: 1: Hoare triple {40#true} assume 0 == ~cond;assume false; {41#false} is VALID [2022-04-08 12:13:14,863 INFO L290 TraceCheckUtils]: 2: Hoare triple {41#false} assume true; {41#false} is VALID [2022-04-08 12:13:14,863 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {41#false} {41#false} #72#return; {41#false} is VALID [2022-04-08 12:13:14,864 INFO L272 TraceCheckUtils]: 0: Hoare triple {40#true} call ULTIMATE.init(); {61#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 12:13:14,864 INFO L290 TraceCheckUtils]: 1: Hoare triple {61#(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(10, 2);call #Ultimate.allocInit(12, 3); {40#true} is VALID [2022-04-08 12:13:14,864 INFO L290 TraceCheckUtils]: 2: Hoare triple {40#true} assume true; {40#true} is VALID [2022-04-08 12:13:14,864 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {40#true} {40#true} #88#return; {40#true} is VALID [2022-04-08 12:13:14,864 INFO L272 TraceCheckUtils]: 4: Hoare triple {40#true} call #t~ret6 := main(); {40#true} is VALID [2022-04-08 12:13:14,865 INFO L290 TraceCheckUtils]: 5: Hoare triple {40#true} havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~x~0;havoc ~y~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {40#true} is VALID [2022-04-08 12:13:14,865 INFO L272 TraceCheckUtils]: 6: Hoare triple {40#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 5 then 1 else 0)); {40#true} is VALID [2022-04-08 12:13:14,865 INFO L290 TraceCheckUtils]: 7: Hoare triple {40#true} ~cond := #in~cond; {40#true} is VALID [2022-04-08 12:13:14,865 INFO L290 TraceCheckUtils]: 8: Hoare triple {40#true} assume 0 == ~cond;assume false; {41#false} is VALID [2022-04-08 12:13:14,865 INFO L290 TraceCheckUtils]: 9: Hoare triple {41#false} assume true; {41#false} is VALID [2022-04-08 12:13:14,866 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {41#false} {40#true} #66#return; {41#false} is VALID [2022-04-08 12:13:14,866 INFO L290 TraceCheckUtils]: 11: Hoare triple {41#false} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {41#false} is VALID [2022-04-08 12:13:14,866 INFO L272 TraceCheckUtils]: 12: Hoare triple {41#false} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 5 then 1 else 0)); {40#true} is VALID [2022-04-08 12:13:14,866 INFO L290 TraceCheckUtils]: 13: Hoare triple {40#true} ~cond := #in~cond; {40#true} is VALID [2022-04-08 12:13:14,866 INFO L290 TraceCheckUtils]: 14: Hoare triple {40#true} assume 0 == ~cond;assume false; {41#false} is VALID [2022-04-08 12:13:14,867 INFO L290 TraceCheckUtils]: 15: Hoare triple {41#false} assume true; {41#false} is VALID [2022-04-08 12:13:14,867 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {41#false} {41#false} #68#return; {41#false} is VALID [2022-04-08 12:13:14,867 INFO L272 TraceCheckUtils]: 17: Hoare triple {41#false} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {40#true} is VALID [2022-04-08 12:13:14,867 INFO L290 TraceCheckUtils]: 18: Hoare triple {40#true} ~cond := #in~cond; {40#true} is VALID [2022-04-08 12:13:14,867 INFO L290 TraceCheckUtils]: 19: Hoare triple {40#true} assume 0 == ~cond;assume false; {41#false} is VALID [2022-04-08 12:13:14,868 INFO L290 TraceCheckUtils]: 20: Hoare triple {41#false} assume true; {41#false} is VALID [2022-04-08 12:13:14,868 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {41#false} {41#false} #70#return; {41#false} is VALID [2022-04-08 12:13:14,868 INFO L272 TraceCheckUtils]: 22: Hoare triple {41#false} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {40#true} is VALID [2022-04-08 12:13:14,868 INFO L290 TraceCheckUtils]: 23: Hoare triple {40#true} ~cond := #in~cond; {40#true} is VALID [2022-04-08 12:13:14,868 INFO L290 TraceCheckUtils]: 24: Hoare triple {40#true} assume 0 == ~cond;assume false; {41#false} is VALID [2022-04-08 12:13:14,869 INFO L290 TraceCheckUtils]: 25: Hoare triple {41#false} assume true; {41#false} is VALID [2022-04-08 12:13:14,869 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {41#false} {41#false} #72#return; {41#false} is VALID [2022-04-08 12:13:14,869 INFO L290 TraceCheckUtils]: 27: Hoare triple {41#false} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {41#false} is VALID [2022-04-08 12:13:14,869 INFO L290 TraceCheckUtils]: 28: Hoare triple {41#false} assume false; {41#false} is VALID [2022-04-08 12:13:14,869 INFO L272 TraceCheckUtils]: 29: Hoare triple {41#false} call __VERIFIER_assert((if 0 == ~a~0 - ~b~0 then 1 else 0)); {41#false} is VALID [2022-04-08 12:13:14,869 INFO L290 TraceCheckUtils]: 30: Hoare triple {41#false} ~cond := #in~cond; {41#false} is VALID [2022-04-08 12:13:14,870 INFO L290 TraceCheckUtils]: 31: Hoare triple {41#false} assume 0 == ~cond; {41#false} is VALID [2022-04-08 12:13:14,870 INFO L290 TraceCheckUtils]: 32: Hoare triple {41#false} assume !false; {41#false} is VALID [2022-04-08 12:13:14,870 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-08 12:13:14,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 12:13:14,871 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1668718011] [2022-04-08 12:13:14,871 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1668718011] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 12:13:14,871 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 12:13:14,871 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-08 12:13:14,873 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 12:13:14,873 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1478452202] [2022-04-08 12:13:14,874 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1478452202] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 12:13:14,874 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 12:13:14,874 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-08 12:13:14,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [912091934] [2022-04-08 12:13:14,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 12:13:14,878 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, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 33 [2022-04-08 12:13:14,879 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 12:13:14,881 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, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-08 12:13:14,903 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 12:13:14,903 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-08 12:13:14,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 12:13:14,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-08 12:13:14,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-08 12:13:14,919 INFO L87 Difference]: Start difference. First operand has 37 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 19 states have internal predecessors, (25), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) 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, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-08 12:13:15,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:13:15,039 INFO L93 Difference]: Finished difference Result 67 states and 105 transitions. [2022-04-08 12:13:15,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-08 12:13:15,040 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, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 33 [2022-04-08 12:13:15,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 12:13:15,041 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, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-08 12:13:15,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 105 transitions. [2022-04-08 12:13:15,048 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, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-08 12:13:15,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 105 transitions. [2022-04-08 12:13:15,054 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 105 transitions. [2022-04-08 12:13:15,162 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 105 edges. 105 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 12:13:15,173 INFO L225 Difference]: With dead ends: 67 [2022-04-08 12:13:15,173 INFO L226 Difference]: Without dead ends: 32 [2022-04-08 12:13:15,176 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 15 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 12:13:15,181 INFO L913 BasicCegarLoop]: 36 mSDtfsCounter, 18 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 12:13:15,182 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [29 Valid, 39 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 12:13:15,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-04-08 12:13:15,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2022-04-08 12:13:15,218 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 12:13:15,219 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand has 32 states, 15 states have (on average 1.2) internal successors, (18), 16 states have internal predecessors, (18), 13 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-08 12:13:15,220 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand has 32 states, 15 states have (on average 1.2) internal successors, (18), 16 states have internal predecessors, (18), 13 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-08 12:13:15,221 INFO L87 Difference]: Start difference. First operand 32 states. Second operand has 32 states, 15 states have (on average 1.2) internal successors, (18), 16 states have internal predecessors, (18), 13 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-08 12:13:15,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:13:15,229 INFO L93 Difference]: Finished difference Result 32 states and 42 transitions. [2022-04-08 12:13:15,229 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 42 transitions. [2022-04-08 12:13:15,229 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:13:15,229 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 12:13:15,230 INFO L74 IsIncluded]: Start isIncluded. First operand has 32 states, 15 states have (on average 1.2) internal successors, (18), 16 states have internal predecessors, (18), 13 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 32 states. [2022-04-08 12:13:15,231 INFO L87 Difference]: Start difference. First operand has 32 states, 15 states have (on average 1.2) internal successors, (18), 16 states have internal predecessors, (18), 13 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 32 states. [2022-04-08 12:13:15,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:13:15,238 INFO L93 Difference]: Finished difference Result 32 states and 42 transitions. [2022-04-08 12:13:15,238 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 42 transitions. [2022-04-08 12:13:15,238 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:13:15,239 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 12:13:15,239 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 12:13:15,239 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 12:13:15,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 15 states have (on average 1.2) internal successors, (18), 16 states have internal predecessors, (18), 13 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-08 12:13:15,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 42 transitions. [2022-04-08 12:13:15,247 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 42 transitions. Word has length 33 [2022-04-08 12:13:15,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 12:13:15,247 INFO L478 AbstractCegarLoop]: Abstraction has 32 states and 42 transitions. [2022-04-08 12:13:15,247 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, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-08 12:13:15,247 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 32 states and 42 transitions. [2022-04-08 12:13:15,292 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 12:13:15,292 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 42 transitions. [2022-04-08 12:13:15,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-04-08 12:13:15,295 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 12:13:15,295 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 12:13:15,295 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-08 12:13:15,296 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 12:13:15,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 12:13:15,297 INFO L85 PathProgramCache]: Analyzing trace with hash -1006914976, now seen corresponding path program 1 times [2022-04-08 12:13:15,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 12:13:15,297 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [651483569] [2022-04-08 12:13:15,298 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 12:13:15,299 INFO L85 PathProgramCache]: Analyzing trace with hash -1006914976, now seen corresponding path program 2 times [2022-04-08 12:13:15,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 12:13:15,299 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [265179677] [2022-04-08 12:13:15,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 12:13:15,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 12:13:15,349 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 12:13:15,349 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1954933114] [2022-04-08 12:13:15,349 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 12:13:15,350 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 12:13:15,350 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 12:13:15,352 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 12:13:15,354 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 12:13:15,420 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-08 12:13:15,420 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 12:13:15,422 INFO L263 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-08 12:13:15,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 12:13:15,437 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 12:13:15,657 INFO L272 TraceCheckUtils]: 0: Hoare triple {326#true} call ULTIMATE.init(); {326#true} is VALID [2022-04-08 12:13:15,658 INFO L290 TraceCheckUtils]: 1: Hoare triple {326#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(10, 2);call #Ultimate.allocInit(12, 3); {326#true} is VALID [2022-04-08 12:13:15,658 INFO L290 TraceCheckUtils]: 2: Hoare triple {326#true} assume true; {326#true} is VALID [2022-04-08 12:13:15,659 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {326#true} {326#true} #88#return; {326#true} is VALID [2022-04-08 12:13:15,660 INFO L272 TraceCheckUtils]: 4: Hoare triple {326#true} call #t~ret6 := main(); {326#true} is VALID [2022-04-08 12:13:15,660 INFO L290 TraceCheckUtils]: 5: Hoare triple {326#true} havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~x~0;havoc ~y~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {326#true} is VALID [2022-04-08 12:13:15,660 INFO L272 TraceCheckUtils]: 6: Hoare triple {326#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 5 then 1 else 0)); {326#true} is VALID [2022-04-08 12:13:15,660 INFO L290 TraceCheckUtils]: 7: Hoare triple {326#true} ~cond := #in~cond; {326#true} is VALID [2022-04-08 12:13:15,661 INFO L290 TraceCheckUtils]: 8: Hoare triple {326#true} assume !(0 == ~cond); {326#true} is VALID [2022-04-08 12:13:15,661 INFO L290 TraceCheckUtils]: 9: Hoare triple {326#true} assume true; {326#true} is VALID [2022-04-08 12:13:15,661 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {326#true} {326#true} #66#return; {326#true} is VALID [2022-04-08 12:13:15,661 INFO L290 TraceCheckUtils]: 11: Hoare triple {326#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {326#true} is VALID [2022-04-08 12:13:15,661 INFO L272 TraceCheckUtils]: 12: Hoare triple {326#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 5 then 1 else 0)); {326#true} is VALID [2022-04-08 12:13:15,661 INFO L290 TraceCheckUtils]: 13: Hoare triple {326#true} ~cond := #in~cond; {326#true} is VALID [2022-04-08 12:13:15,662 INFO L290 TraceCheckUtils]: 14: Hoare triple {326#true} assume !(0 == ~cond); {326#true} is VALID [2022-04-08 12:13:15,662 INFO L290 TraceCheckUtils]: 15: Hoare triple {326#true} assume true; {326#true} is VALID [2022-04-08 12:13:15,662 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {326#true} {326#true} #68#return; {326#true} is VALID [2022-04-08 12:13:15,662 INFO L272 TraceCheckUtils]: 17: Hoare triple {326#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {326#true} is VALID [2022-04-08 12:13:15,662 INFO L290 TraceCheckUtils]: 18: Hoare triple {326#true} ~cond := #in~cond; {326#true} is VALID [2022-04-08 12:13:15,662 INFO L290 TraceCheckUtils]: 19: Hoare triple {326#true} assume !(0 == ~cond); {326#true} is VALID [2022-04-08 12:13:15,663 INFO L290 TraceCheckUtils]: 20: Hoare triple {326#true} assume true; {326#true} is VALID [2022-04-08 12:13:15,663 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {326#true} {326#true} #70#return; {326#true} is VALID [2022-04-08 12:13:15,663 INFO L272 TraceCheckUtils]: 22: Hoare triple {326#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {326#true} is VALID [2022-04-08 12:13:15,663 INFO L290 TraceCheckUtils]: 23: Hoare triple {326#true} ~cond := #in~cond; {326#true} is VALID [2022-04-08 12:13:15,663 INFO L290 TraceCheckUtils]: 24: Hoare triple {326#true} assume !(0 == ~cond); {326#true} is VALID [2022-04-08 12:13:15,663 INFO L290 TraceCheckUtils]: 25: Hoare triple {326#true} assume true; {326#true} is VALID [2022-04-08 12:13:15,668 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {326#true} {326#true} #72#return; {326#true} is VALID [2022-04-08 12:13:15,669 INFO L290 TraceCheckUtils]: 27: Hoare triple {326#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {412#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~p~0 1))} is VALID [2022-04-08 12:13:15,670 INFO L290 TraceCheckUtils]: 28: Hoare triple {412#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~p~0 1))} assume !false; {412#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~p~0 1))} is VALID [2022-04-08 12:13:15,670 INFO L272 TraceCheckUtils]: 29: Hoare triple {412#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~p~0 1))} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {419#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 12:13:15,671 INFO L290 TraceCheckUtils]: 30: Hoare triple {419#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {423#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 12:13:15,671 INFO L290 TraceCheckUtils]: 31: Hoare triple {423#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {327#false} is VALID [2022-04-08 12:13:15,672 INFO L290 TraceCheckUtils]: 32: Hoare triple {327#false} assume !false; {327#false} is VALID [2022-04-08 12:13:15,672 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-08 12:13:15,672 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-08 12:13:15,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 12:13:15,672 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [265179677] [2022-04-08 12:13:15,673 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 12:13:15,673 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1954933114] [2022-04-08 12:13:15,673 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1954933114] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 12:13:15,673 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 12:13:15,673 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 12:13:15,674 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 12:13:15,674 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [651483569] [2022-04-08 12:13:15,674 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [651483569] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 12:13:15,674 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 12:13:15,674 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 12:13:15,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1360165110] [2022-04-08 12:13:15,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 12:13:15,675 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 33 [2022-04-08 12:13:15,675 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 12:13:15,675 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-08 12:13:15,692 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 12:13:15,693 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 12:13:15,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 12:13:15,693 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 12:13:15,693 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 12:13:15,694 INFO L87 Difference]: Start difference. First operand 32 states and 42 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-08 12:13:15,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:13:15,876 INFO L93 Difference]: Finished difference Result 48 states and 65 transitions. [2022-04-08 12:13:15,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 12:13:15,876 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 33 [2022-04-08 12:13:15,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 12:13:15,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-08 12:13:15,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 65 transitions. [2022-04-08 12:13:15,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-08 12:13:15,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 65 transitions. [2022-04-08 12:13:15,880 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 65 transitions. [2022-04-08 12:13:15,925 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 12:13:15,927 INFO L225 Difference]: With dead ends: 48 [2022-04-08 12:13:15,927 INFO L226 Difference]: Without dead ends: 46 [2022-04-08 12:13:15,927 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-08 12:13:15,928 INFO L913 BasicCegarLoop]: 42 mSDtfsCounter, 7 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 12:13:15,928 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 143 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 12:13:15,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2022-04-08 12:13:15,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 45. [2022-04-08 12:13:15,939 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 12:13:15,939 INFO L82 GeneralOperation]: Start isEquivalent. First operand 46 states. Second operand has 45 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 23 states have internal predecessors, (26), 19 states have call successors, (19), 5 states have call predecessors, (19), 4 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-08 12:13:15,940 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand has 45 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 23 states have internal predecessors, (26), 19 states have call successors, (19), 5 states have call predecessors, (19), 4 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-08 12:13:15,940 INFO L87 Difference]: Start difference. First operand 46 states. Second operand has 45 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 23 states have internal predecessors, (26), 19 states have call successors, (19), 5 states have call predecessors, (19), 4 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-08 12:13:15,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:13:15,942 INFO L93 Difference]: Finished difference Result 46 states and 63 transitions. [2022-04-08 12:13:15,942 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 63 transitions. [2022-04-08 12:13:15,943 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:13:15,943 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 12:13:15,944 INFO L74 IsIncluded]: Start isIncluded. First operand has 45 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 23 states have internal predecessors, (26), 19 states have call successors, (19), 5 states have call predecessors, (19), 4 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) Second operand 46 states. [2022-04-08 12:13:15,944 INFO L87 Difference]: Start difference. First operand has 45 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 23 states have internal predecessors, (26), 19 states have call successors, (19), 5 states have call predecessors, (19), 4 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) Second operand 46 states. [2022-04-08 12:13:15,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:13:15,946 INFO L93 Difference]: Finished difference Result 46 states and 63 transitions. [2022-04-08 12:13:15,946 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 63 transitions. [2022-04-08 12:13:15,947 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:13:15,947 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 12:13:15,947 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 12:13:15,947 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 12:13:15,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 23 states have internal predecessors, (26), 19 states have call successors, (19), 5 states have call predecessors, (19), 4 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-08 12:13:15,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 62 transitions. [2022-04-08 12:13:15,949 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 62 transitions. Word has length 33 [2022-04-08 12:13:15,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 12:13:15,950 INFO L478 AbstractCegarLoop]: Abstraction has 45 states and 62 transitions. [2022-04-08 12:13:15,950 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-08 12:13:15,950 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 45 states and 62 transitions. [2022-04-08 12:13:16,004 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 12:13:16,005 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 62 transitions. [2022-04-08 12:13:16,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-04-08 12:13:16,005 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 12:13:16,005 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 12:13:16,023 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-04-08 12:13:16,219 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 12:13:16,219 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 12:13:16,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 12:13:16,219 INFO L85 PathProgramCache]: Analyzing trace with hash -124657161, now seen corresponding path program 1 times [2022-04-08 12:13:16,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 12:13:16,220 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [9596024] [2022-04-08 12:13:16,220 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 12:13:16,220 INFO L85 PathProgramCache]: Analyzing trace with hash -124657161, now seen corresponding path program 2 times [2022-04-08 12:13:16,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 12:13:16,220 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [596084119] [2022-04-08 12:13:16,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 12:13:16,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 12:13:16,237 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 12:13:16,238 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1010762395] [2022-04-08 12:13:16,238 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 12:13:16,238 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 12:13:16,238 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 12:13:16,239 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 12:13:16,240 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 12:13:16,276 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 12:13:16,276 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 12:13:16,277 INFO L263 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-08 12:13:16,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 12:13:16,289 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 12:13:16,417 INFO L272 TraceCheckUtils]: 0: Hoare triple {709#true} call ULTIMATE.init(); {709#true} is VALID [2022-04-08 12:13:16,418 INFO L290 TraceCheckUtils]: 1: Hoare triple {709#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(10, 2);call #Ultimate.allocInit(12, 3); {709#true} is VALID [2022-04-08 12:13:16,418 INFO L290 TraceCheckUtils]: 2: Hoare triple {709#true} assume true; {709#true} is VALID [2022-04-08 12:13:16,418 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {709#true} {709#true} #88#return; {709#true} is VALID [2022-04-08 12:13:16,418 INFO L272 TraceCheckUtils]: 4: Hoare triple {709#true} call #t~ret6 := main(); {709#true} is VALID [2022-04-08 12:13:16,418 INFO L290 TraceCheckUtils]: 5: Hoare triple {709#true} havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~x~0;havoc ~y~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {709#true} is VALID [2022-04-08 12:13:16,418 INFO L272 TraceCheckUtils]: 6: Hoare triple {709#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 5 then 1 else 0)); {709#true} is VALID [2022-04-08 12:13:16,418 INFO L290 TraceCheckUtils]: 7: Hoare triple {709#true} ~cond := #in~cond; {709#true} is VALID [2022-04-08 12:13:16,418 INFO L290 TraceCheckUtils]: 8: Hoare triple {709#true} assume !(0 == ~cond); {709#true} is VALID [2022-04-08 12:13:16,418 INFO L290 TraceCheckUtils]: 9: Hoare triple {709#true} assume true; {709#true} is VALID [2022-04-08 12:13:16,419 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {709#true} {709#true} #66#return; {709#true} is VALID [2022-04-08 12:13:16,419 INFO L290 TraceCheckUtils]: 11: Hoare triple {709#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {709#true} is VALID [2022-04-08 12:13:16,419 INFO L272 TraceCheckUtils]: 12: Hoare triple {709#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 5 then 1 else 0)); {709#true} is VALID [2022-04-08 12:13:16,419 INFO L290 TraceCheckUtils]: 13: Hoare triple {709#true} ~cond := #in~cond; {709#true} is VALID [2022-04-08 12:13:16,419 INFO L290 TraceCheckUtils]: 14: Hoare triple {709#true} assume !(0 == ~cond); {709#true} is VALID [2022-04-08 12:13:16,419 INFO L290 TraceCheckUtils]: 15: Hoare triple {709#true} assume true; {709#true} is VALID [2022-04-08 12:13:16,419 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {709#true} {709#true} #68#return; {709#true} is VALID [2022-04-08 12:13:16,419 INFO L272 TraceCheckUtils]: 17: Hoare triple {709#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {709#true} is VALID [2022-04-08 12:13:16,419 INFO L290 TraceCheckUtils]: 18: Hoare triple {709#true} ~cond := #in~cond; {709#true} is VALID [2022-04-08 12:13:16,420 INFO L290 TraceCheckUtils]: 19: Hoare triple {709#true} assume !(0 == ~cond); {709#true} is VALID [2022-04-08 12:13:16,420 INFO L290 TraceCheckUtils]: 20: Hoare triple {709#true} assume true; {709#true} is VALID [2022-04-08 12:13:16,420 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {709#true} {709#true} #70#return; {709#true} is VALID [2022-04-08 12:13:16,420 INFO L272 TraceCheckUtils]: 22: Hoare triple {709#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {709#true} is VALID [2022-04-08 12:13:16,420 INFO L290 TraceCheckUtils]: 23: Hoare triple {709#true} ~cond := #in~cond; {709#true} is VALID [2022-04-08 12:13:16,420 INFO L290 TraceCheckUtils]: 24: Hoare triple {709#true} assume !(0 == ~cond); {709#true} is VALID [2022-04-08 12:13:16,420 INFO L290 TraceCheckUtils]: 25: Hoare triple {709#true} assume true; {709#true} is VALID [2022-04-08 12:13:16,420 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {709#true} {709#true} #72#return; {709#true} is VALID [2022-04-08 12:13:16,421 INFO L290 TraceCheckUtils]: 27: Hoare triple {709#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {795#(and (= main_~r~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-08 12:13:16,421 INFO L290 TraceCheckUtils]: 28: Hoare triple {795#(and (= main_~r~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !false; {795#(and (= main_~r~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-08 12:13:16,422 INFO L272 TraceCheckUtils]: 29: Hoare triple {795#(and (= main_~r~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {709#true} is VALID [2022-04-08 12:13:16,422 INFO L290 TraceCheckUtils]: 30: Hoare triple {709#true} ~cond := #in~cond; {709#true} is VALID [2022-04-08 12:13:16,422 INFO L290 TraceCheckUtils]: 31: Hoare triple {709#true} assume !(0 == ~cond); {709#true} is VALID [2022-04-08 12:13:16,422 INFO L290 TraceCheckUtils]: 32: Hoare triple {709#true} assume true; {709#true} is VALID [2022-04-08 12:13:16,424 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {709#true} {795#(and (= main_~r~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #74#return; {795#(and (= main_~r~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-08 12:13:16,424 INFO L272 TraceCheckUtils]: 34: Hoare triple {795#(and (= main_~r~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {817#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 12:13:16,431 INFO L290 TraceCheckUtils]: 35: Hoare triple {817#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {821#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 12:13:16,432 INFO L290 TraceCheckUtils]: 36: Hoare triple {821#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {710#false} is VALID [2022-04-08 12:13:16,432 INFO L290 TraceCheckUtils]: 37: Hoare triple {710#false} assume !false; {710#false} is VALID [2022-04-08 12:13:16,432 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-08 12:13:16,432 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-08 12:13:16,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 12:13:16,432 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [596084119] [2022-04-08 12:13:16,432 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 12:13:16,432 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1010762395] [2022-04-08 12:13:16,433 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1010762395] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 12:13:16,433 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 12:13:16,433 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 12:13:16,433 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 12:13:16,433 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [9596024] [2022-04-08 12:13:16,433 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [9596024] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 12:13:16,433 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 12:13:16,433 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 12:13:16,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1191849889] [2022-04-08 12:13:16,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 12:13:16,434 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 38 [2022-04-08 12:13:16,434 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 12:13:16,434 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-04-08 12:13:16,453 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 12:13:16,453 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 12:13:16,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 12:13:16,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 12:13:16,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 12:13:16,454 INFO L87 Difference]: Start difference. First operand 45 states and 62 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-04-08 12:13:16,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:13:16,642 INFO L93 Difference]: Finished difference Result 52 states and 68 transitions. [2022-04-08 12:13:16,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 12:13:16,642 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 38 [2022-04-08 12:13:16,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 12:13:16,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-04-08 12:13:16,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 65 transitions. [2022-04-08 12:13:16,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-04-08 12:13:16,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 65 transitions. [2022-04-08 12:13:16,645 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 65 transitions. [2022-04-08 12:13:16,699 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 12:13:16,700 INFO L225 Difference]: With dead ends: 52 [2022-04-08 12:13:16,700 INFO L226 Difference]: Without dead ends: 50 [2022-04-08 12:13:16,701 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-08 12:13:16,701 INFO L913 BasicCegarLoop]: 44 mSDtfsCounter, 8 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 12:13:16,702 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 140 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 12:13:16,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-04-08 12:13:16,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 49. [2022-04-08 12:13:16,714 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 12:13:16,714 INFO L82 GeneralOperation]: Start isEquivalent. First operand 50 states. Second operand has 49 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 26 states have internal predecessors, (29), 19 states have call successors, (19), 6 states have call predecessors, (19), 5 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-08 12:13:16,714 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand has 49 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 26 states have internal predecessors, (29), 19 states have call successors, (19), 6 states have call predecessors, (19), 5 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-08 12:13:16,714 INFO L87 Difference]: Start difference. First operand 50 states. Second operand has 49 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 26 states have internal predecessors, (29), 19 states have call successors, (19), 6 states have call predecessors, (19), 5 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-08 12:13:16,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:13:16,717 INFO L93 Difference]: Finished difference Result 50 states and 66 transitions. [2022-04-08 12:13:16,717 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 66 transitions. [2022-04-08 12:13:16,717 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:13:16,717 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 12:13:16,718 INFO L74 IsIncluded]: Start isIncluded. First operand has 49 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 26 states have internal predecessors, (29), 19 states have call successors, (19), 6 states have call predecessors, (19), 5 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) Second operand 50 states. [2022-04-08 12:13:16,718 INFO L87 Difference]: Start difference. First operand has 49 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 26 states have internal predecessors, (29), 19 states have call successors, (19), 6 states have call predecessors, (19), 5 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) Second operand 50 states. [2022-04-08 12:13:16,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:13:16,720 INFO L93 Difference]: Finished difference Result 50 states and 66 transitions. [2022-04-08 12:13:16,720 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 66 transitions. [2022-04-08 12:13:16,720 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:13:16,720 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 12:13:16,720 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 12:13:16,720 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 12:13:16,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 26 states have internal predecessors, (29), 19 states have call successors, (19), 6 states have call predecessors, (19), 5 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-08 12:13:16,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 65 transitions. [2022-04-08 12:13:16,722 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 65 transitions. Word has length 38 [2022-04-08 12:13:16,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 12:13:16,722 INFO L478 AbstractCegarLoop]: Abstraction has 49 states and 65 transitions. [2022-04-08 12:13:16,723 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-04-08 12:13:16,723 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 49 states and 65 transitions. [2022-04-08 12:13:16,787 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 12:13:16,787 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 65 transitions. [2022-04-08 12:13:16,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-04-08 12:13:16,788 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 12:13:16,788 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 12:13:16,816 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 12:13:17,004 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 12:13:17,005 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 12:13:17,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 12:13:17,005 INFO L85 PathProgramCache]: Analyzing trace with hash 1732898944, now seen corresponding path program 1 times [2022-04-08 12:13:17,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 12:13:17,005 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2146358917] [2022-04-08 12:13:17,005 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 12:13:17,006 INFO L85 PathProgramCache]: Analyzing trace with hash 1732898944, now seen corresponding path program 2 times [2022-04-08 12:13:17,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 12:13:17,006 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1585651721] [2022-04-08 12:13:17,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 12:13:17,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 12:13:17,031 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 12:13:17,032 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [605061160] [2022-04-08 12:13:17,032 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 12:13:17,032 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 12:13:17,032 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 12:13:17,033 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 12:13:17,045 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 12:13:17,081 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 12:13:17,081 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 12:13:17,082 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-08 12:13:17,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 12:13:17,093 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 12:13:17,236 INFO L272 TraceCheckUtils]: 0: Hoare triple {1131#true} call ULTIMATE.init(); {1131#true} is VALID [2022-04-08 12:13:17,236 INFO L290 TraceCheckUtils]: 1: Hoare triple {1131#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(10, 2);call #Ultimate.allocInit(12, 3); {1131#true} is VALID [2022-04-08 12:13:17,236 INFO L290 TraceCheckUtils]: 2: Hoare triple {1131#true} assume true; {1131#true} is VALID [2022-04-08 12:13:17,236 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1131#true} {1131#true} #88#return; {1131#true} is VALID [2022-04-08 12:13:17,236 INFO L272 TraceCheckUtils]: 4: Hoare triple {1131#true} call #t~ret6 := main(); {1131#true} is VALID [2022-04-08 12:13:17,236 INFO L290 TraceCheckUtils]: 5: Hoare triple {1131#true} havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~x~0;havoc ~y~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {1131#true} is VALID [2022-04-08 12:13:17,236 INFO L272 TraceCheckUtils]: 6: Hoare triple {1131#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 5 then 1 else 0)); {1131#true} is VALID [2022-04-08 12:13:17,236 INFO L290 TraceCheckUtils]: 7: Hoare triple {1131#true} ~cond := #in~cond; {1131#true} is VALID [2022-04-08 12:13:17,237 INFO L290 TraceCheckUtils]: 8: Hoare triple {1131#true} assume !(0 == ~cond); {1131#true} is VALID [2022-04-08 12:13:17,237 INFO L290 TraceCheckUtils]: 9: Hoare triple {1131#true} assume true; {1131#true} is VALID [2022-04-08 12:13:17,237 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1131#true} {1131#true} #66#return; {1131#true} is VALID [2022-04-08 12:13:17,237 INFO L290 TraceCheckUtils]: 11: Hoare triple {1131#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {1131#true} is VALID [2022-04-08 12:13:17,237 INFO L272 TraceCheckUtils]: 12: Hoare triple {1131#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 5 then 1 else 0)); {1131#true} is VALID [2022-04-08 12:13:17,237 INFO L290 TraceCheckUtils]: 13: Hoare triple {1131#true} ~cond := #in~cond; {1131#true} is VALID [2022-04-08 12:13:17,237 INFO L290 TraceCheckUtils]: 14: Hoare triple {1131#true} assume !(0 == ~cond); {1131#true} is VALID [2022-04-08 12:13:17,237 INFO L290 TraceCheckUtils]: 15: Hoare triple {1131#true} assume true; {1131#true} is VALID [2022-04-08 12:13:17,237 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {1131#true} {1131#true} #68#return; {1131#true} is VALID [2022-04-08 12:13:17,237 INFO L272 TraceCheckUtils]: 17: Hoare triple {1131#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {1131#true} is VALID [2022-04-08 12:13:17,237 INFO L290 TraceCheckUtils]: 18: Hoare triple {1131#true} ~cond := #in~cond; {1131#true} is VALID [2022-04-08 12:13:17,238 INFO L290 TraceCheckUtils]: 19: Hoare triple {1131#true} assume !(0 == ~cond); {1131#true} is VALID [2022-04-08 12:13:17,238 INFO L290 TraceCheckUtils]: 20: Hoare triple {1131#true} assume true; {1131#true} is VALID [2022-04-08 12:13:17,238 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {1131#true} {1131#true} #70#return; {1131#true} is VALID [2022-04-08 12:13:17,238 INFO L272 TraceCheckUtils]: 22: Hoare triple {1131#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {1131#true} is VALID [2022-04-08 12:13:17,238 INFO L290 TraceCheckUtils]: 23: Hoare triple {1131#true} ~cond := #in~cond; {1131#true} is VALID [2022-04-08 12:13:17,238 INFO L290 TraceCheckUtils]: 24: Hoare triple {1131#true} assume !(0 == ~cond); {1131#true} is VALID [2022-04-08 12:13:17,238 INFO L290 TraceCheckUtils]: 25: Hoare triple {1131#true} assume true; {1131#true} is VALID [2022-04-08 12:13:17,238 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {1131#true} {1131#true} #72#return; {1131#true} is VALID [2022-04-08 12:13:17,239 INFO L290 TraceCheckUtils]: 27: Hoare triple {1131#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {1217#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-08 12:13:17,239 INFO L290 TraceCheckUtils]: 28: Hoare triple {1217#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} assume !false; {1217#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-08 12:13:17,239 INFO L272 TraceCheckUtils]: 29: Hoare triple {1217#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {1131#true} is VALID [2022-04-08 12:13:17,239 INFO L290 TraceCheckUtils]: 30: Hoare triple {1131#true} ~cond := #in~cond; {1131#true} is VALID [2022-04-08 12:13:17,239 INFO L290 TraceCheckUtils]: 31: Hoare triple {1131#true} assume !(0 == ~cond); {1131#true} is VALID [2022-04-08 12:13:17,239 INFO L290 TraceCheckUtils]: 32: Hoare triple {1131#true} assume true; {1131#true} is VALID [2022-04-08 12:13:17,240 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {1131#true} {1217#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} #74#return; {1217#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-08 12:13:17,240 INFO L272 TraceCheckUtils]: 34: Hoare triple {1217#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {1131#true} is VALID [2022-04-08 12:13:17,240 INFO L290 TraceCheckUtils]: 35: Hoare triple {1131#true} ~cond := #in~cond; {1131#true} is VALID [2022-04-08 12:13:17,240 INFO L290 TraceCheckUtils]: 36: Hoare triple {1131#true} assume !(0 == ~cond); {1131#true} is VALID [2022-04-08 12:13:17,241 INFO L290 TraceCheckUtils]: 37: Hoare triple {1131#true} assume true; {1131#true} is VALID [2022-04-08 12:13:17,241 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {1131#true} {1217#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} #76#return; {1217#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-08 12:13:17,242 INFO L272 TraceCheckUtils]: 39: Hoare triple {1217#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {1254#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 12:13:17,242 INFO L290 TraceCheckUtils]: 40: Hoare triple {1254#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1258#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 12:13:17,243 INFO L290 TraceCheckUtils]: 41: Hoare triple {1258#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1132#false} is VALID [2022-04-08 12:13:17,243 INFO L290 TraceCheckUtils]: 42: Hoare triple {1132#false} assume !false; {1132#false} is VALID [2022-04-08 12:13:17,243 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-04-08 12:13:17,243 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-08 12:13:17,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 12:13:17,243 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1585651721] [2022-04-08 12:13:17,243 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 12:13:17,243 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [605061160] [2022-04-08 12:13:17,244 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [605061160] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 12:13:17,244 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 12:13:17,244 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 12:13:17,244 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 12:13:17,244 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2146358917] [2022-04-08 12:13:17,244 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2146358917] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 12:13:17,244 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 12:13:17,244 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 12:13:17,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [478189639] [2022-04-08 12:13:17,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 12:13:17,245 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 43 [2022-04-08 12:13:17,245 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 12:13:17,245 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-08 12:13:17,272 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 12:13:17,272 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 12:13:17,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 12:13:17,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 12:13:17,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 12:13:17,273 INFO L87 Difference]: Start difference. First operand 49 states and 65 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-08 12:13:17,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:13:17,466 INFO L93 Difference]: Finished difference Result 74 states and 105 transitions. [2022-04-08 12:13:17,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 12:13:17,467 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 43 [2022-04-08 12:13:17,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 12:13:17,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-08 12:13:17,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 65 transitions. [2022-04-08 12:13:17,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-08 12:13:17,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 65 transitions. [2022-04-08 12:13:17,469 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 65 transitions. [2022-04-08 12:13:17,517 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 12:13:17,518 INFO L225 Difference]: With dead ends: 74 [2022-04-08 12:13:17,518 INFO L226 Difference]: Without dead ends: 70 [2022-04-08 12:13:17,519 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-08 12:13:17,519 INFO L913 BasicCegarLoop]: 44 mSDtfsCounter, 8 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 12:13:17,520 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 139 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 12:13:17,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2022-04-08 12:13:17,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2022-04-08 12:13:17,536 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 12:13:17,537 INFO L82 GeneralOperation]: Start isEquivalent. First operand 70 states. Second operand has 70 states, 33 states have (on average 1.2727272727272727) internal successors, (42), 37 states have internal predecessors, (42), 30 states have call successors, (30), 7 states have call predecessors, (30), 6 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2022-04-08 12:13:17,537 INFO L74 IsIncluded]: Start isIncluded. First operand 70 states. Second operand has 70 states, 33 states have (on average 1.2727272727272727) internal successors, (42), 37 states have internal predecessors, (42), 30 states have call successors, (30), 7 states have call predecessors, (30), 6 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2022-04-08 12:13:17,537 INFO L87 Difference]: Start difference. First operand 70 states. Second operand has 70 states, 33 states have (on average 1.2727272727272727) internal successors, (42), 37 states have internal predecessors, (42), 30 states have call successors, (30), 7 states have call predecessors, (30), 6 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2022-04-08 12:13:17,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:13:17,540 INFO L93 Difference]: Finished difference Result 70 states and 98 transitions. [2022-04-08 12:13:17,540 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 98 transitions. [2022-04-08 12:13:17,541 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:13:17,541 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 12:13:17,541 INFO L74 IsIncluded]: Start isIncluded. First operand has 70 states, 33 states have (on average 1.2727272727272727) internal successors, (42), 37 states have internal predecessors, (42), 30 states have call successors, (30), 7 states have call predecessors, (30), 6 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) Second operand 70 states. [2022-04-08 12:13:17,541 INFO L87 Difference]: Start difference. First operand has 70 states, 33 states have (on average 1.2727272727272727) internal successors, (42), 37 states have internal predecessors, (42), 30 states have call successors, (30), 7 states have call predecessors, (30), 6 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) Second operand 70 states. [2022-04-08 12:13:17,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:13:17,544 INFO L93 Difference]: Finished difference Result 70 states and 98 transitions. [2022-04-08 12:13:17,544 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 98 transitions. [2022-04-08 12:13:17,544 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:13:17,544 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 12:13:17,544 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 12:13:17,544 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 12:13:17,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 33 states have (on average 1.2727272727272727) internal successors, (42), 37 states have internal predecessors, (42), 30 states have call successors, (30), 7 states have call predecessors, (30), 6 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2022-04-08 12:13:17,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 98 transitions. [2022-04-08 12:13:17,547 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 98 transitions. Word has length 43 [2022-04-08 12:13:17,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 12:13:17,547 INFO L478 AbstractCegarLoop]: Abstraction has 70 states and 98 transitions. [2022-04-08 12:13:17,547 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-08 12:13:17,547 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 70 states and 98 transitions. [2022-04-08 12:13:17,644 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 98 edges. 98 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 12:13:17,644 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 98 transitions. [2022-04-08 12:13:17,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-04-08 12:13:17,645 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 12:13:17,645 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 12:13:17,677 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 12:13:17,859 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 12:13:17,860 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 12:13:17,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 12:13:17,860 INFO L85 PathProgramCache]: Analyzing trace with hash -301191846, now seen corresponding path program 1 times [2022-04-08 12:13:17,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 12:13:17,860 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1538742506] [2022-04-08 12:13:17,861 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 12:13:17,861 INFO L85 PathProgramCache]: Analyzing trace with hash -301191846, now seen corresponding path program 2 times [2022-04-08 12:13:17,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 12:13:17,861 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1201703904] [2022-04-08 12:13:17,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 12:13:17,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 12:13:17,872 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 12:13:17,872 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1178223155] [2022-04-08 12:13:17,873 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 12:13:17,873 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 12:13:17,873 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 12:13:17,874 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 12:13:17,910 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 12:13:17,929 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 12:13:17,929 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 12:13:17,929 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-08 12:13:17,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 12:13:17,939 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 12:13:18,014 INFO L272 TraceCheckUtils]: 0: Hoare triple {1694#true} call ULTIMATE.init(); {1694#true} is VALID [2022-04-08 12:13:18,014 INFO L290 TraceCheckUtils]: 1: Hoare triple {1694#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(10, 2);call #Ultimate.allocInit(12, 3); {1694#true} is VALID [2022-04-08 12:13:18,014 INFO L290 TraceCheckUtils]: 2: Hoare triple {1694#true} assume true; {1694#true} is VALID [2022-04-08 12:13:18,014 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1694#true} {1694#true} #88#return; {1694#true} is VALID [2022-04-08 12:13:18,015 INFO L272 TraceCheckUtils]: 4: Hoare triple {1694#true} call #t~ret6 := main(); {1694#true} is VALID [2022-04-08 12:13:18,015 INFO L290 TraceCheckUtils]: 5: Hoare triple {1694#true} havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~x~0;havoc ~y~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {1694#true} is VALID [2022-04-08 12:13:18,015 INFO L272 TraceCheckUtils]: 6: Hoare triple {1694#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 5 then 1 else 0)); {1694#true} is VALID [2022-04-08 12:13:18,015 INFO L290 TraceCheckUtils]: 7: Hoare triple {1694#true} ~cond := #in~cond; {1694#true} is VALID [2022-04-08 12:13:18,015 INFO L290 TraceCheckUtils]: 8: Hoare triple {1694#true} assume !(0 == ~cond); {1694#true} is VALID [2022-04-08 12:13:18,015 INFO L290 TraceCheckUtils]: 9: Hoare triple {1694#true} assume true; {1694#true} is VALID [2022-04-08 12:13:18,015 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1694#true} {1694#true} #66#return; {1694#true} is VALID [2022-04-08 12:13:18,015 INFO L290 TraceCheckUtils]: 11: Hoare triple {1694#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {1694#true} is VALID [2022-04-08 12:13:18,015 INFO L272 TraceCheckUtils]: 12: Hoare triple {1694#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 5 then 1 else 0)); {1694#true} is VALID [2022-04-08 12:13:18,015 INFO L290 TraceCheckUtils]: 13: Hoare triple {1694#true} ~cond := #in~cond; {1694#true} is VALID [2022-04-08 12:13:18,015 INFO L290 TraceCheckUtils]: 14: Hoare triple {1694#true} assume !(0 == ~cond); {1694#true} is VALID [2022-04-08 12:13:18,016 INFO L290 TraceCheckUtils]: 15: Hoare triple {1694#true} assume true; {1694#true} is VALID [2022-04-08 12:13:18,016 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {1694#true} {1694#true} #68#return; {1694#true} is VALID [2022-04-08 12:13:18,016 INFO L272 TraceCheckUtils]: 17: Hoare triple {1694#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {1694#true} is VALID [2022-04-08 12:13:18,016 INFO L290 TraceCheckUtils]: 18: Hoare triple {1694#true} ~cond := #in~cond; {1694#true} is VALID [2022-04-08 12:13:18,016 INFO L290 TraceCheckUtils]: 19: Hoare triple {1694#true} assume !(0 == ~cond); {1694#true} is VALID [2022-04-08 12:13:18,016 INFO L290 TraceCheckUtils]: 20: Hoare triple {1694#true} assume true; {1694#true} is VALID [2022-04-08 12:13:18,016 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {1694#true} {1694#true} #70#return; {1694#true} is VALID [2022-04-08 12:13:18,016 INFO L272 TraceCheckUtils]: 22: Hoare triple {1694#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {1694#true} is VALID [2022-04-08 12:13:18,016 INFO L290 TraceCheckUtils]: 23: Hoare triple {1694#true} ~cond := #in~cond; {1694#true} is VALID [2022-04-08 12:13:18,016 INFO L290 TraceCheckUtils]: 24: Hoare triple {1694#true} assume !(0 == ~cond); {1694#true} is VALID [2022-04-08 12:13:18,016 INFO L290 TraceCheckUtils]: 25: Hoare triple {1694#true} assume true; {1694#true} is VALID [2022-04-08 12:13:18,016 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {1694#true} {1694#true} #72#return; {1694#true} is VALID [2022-04-08 12:13:18,017 INFO L290 TraceCheckUtils]: 27: Hoare triple {1694#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {1694#true} is VALID [2022-04-08 12:13:18,017 INFO L290 TraceCheckUtils]: 28: Hoare triple {1694#true} assume !false; {1694#true} is VALID [2022-04-08 12:13:18,017 INFO L272 TraceCheckUtils]: 29: Hoare triple {1694#true} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {1694#true} is VALID [2022-04-08 12:13:18,017 INFO L290 TraceCheckUtils]: 30: Hoare triple {1694#true} ~cond := #in~cond; {1694#true} is VALID [2022-04-08 12:13:18,017 INFO L290 TraceCheckUtils]: 31: Hoare triple {1694#true} assume !(0 == ~cond); {1694#true} is VALID [2022-04-08 12:13:18,017 INFO L290 TraceCheckUtils]: 32: Hoare triple {1694#true} assume true; {1694#true} is VALID [2022-04-08 12:13:18,017 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {1694#true} {1694#true} #74#return; {1694#true} is VALID [2022-04-08 12:13:18,017 INFO L272 TraceCheckUtils]: 34: Hoare triple {1694#true} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {1694#true} is VALID [2022-04-08 12:13:18,017 INFO L290 TraceCheckUtils]: 35: Hoare triple {1694#true} ~cond := #in~cond; {1694#true} is VALID [2022-04-08 12:13:18,017 INFO L290 TraceCheckUtils]: 36: Hoare triple {1694#true} assume !(0 == ~cond); {1694#true} is VALID [2022-04-08 12:13:18,017 INFO L290 TraceCheckUtils]: 37: Hoare triple {1694#true} assume true; {1694#true} is VALID [2022-04-08 12:13:18,017 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {1694#true} {1694#true} #76#return; {1694#true} is VALID [2022-04-08 12:13:18,018 INFO L272 TraceCheckUtils]: 39: Hoare triple {1694#true} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {1694#true} is VALID [2022-04-08 12:13:18,018 INFO L290 TraceCheckUtils]: 40: Hoare triple {1694#true} ~cond := #in~cond; {1694#true} is VALID [2022-04-08 12:13:18,018 INFO L290 TraceCheckUtils]: 41: Hoare triple {1694#true} assume !(0 == ~cond); {1694#true} is VALID [2022-04-08 12:13:18,018 INFO L290 TraceCheckUtils]: 42: Hoare triple {1694#true} assume true; {1694#true} is VALID [2022-04-08 12:13:18,018 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {1694#true} {1694#true} #78#return; {1694#true} is VALID [2022-04-08 12:13:18,018 INFO L290 TraceCheckUtils]: 44: Hoare triple {1694#true} assume !(~a~0 != ~b~0); {1831#(= main_~b~0 main_~a~0)} is VALID [2022-04-08 12:13:18,019 INFO L272 TraceCheckUtils]: 45: Hoare triple {1831#(= main_~b~0 main_~a~0)} call __VERIFIER_assert((if 0 == ~a~0 - ~b~0 then 1 else 0)); {1835#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 12:13:18,019 INFO L290 TraceCheckUtils]: 46: Hoare triple {1835#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1839#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 12:13:18,019 INFO L290 TraceCheckUtils]: 47: Hoare triple {1839#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1695#false} is VALID [2022-04-08 12:13:18,019 INFO L290 TraceCheckUtils]: 48: Hoare triple {1695#false} assume !false; {1695#false} is VALID [2022-04-08 12:13:18,020 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-04-08 12:13:18,020 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-08 12:13:18,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 12:13:18,020 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1201703904] [2022-04-08 12:13:18,020 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 12:13:18,020 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1178223155] [2022-04-08 12:13:18,020 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1178223155] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 12:13:18,020 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 12:13:18,020 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 12:13:18,020 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 12:13:18,020 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1538742506] [2022-04-08 12:13:18,020 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1538742506] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 12:13:18,021 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 12:13:18,021 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 12:13:18,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1904773828] [2022-04-08 12:13:18,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 12:13:18,021 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 49 [2022-04-08 12:13:18,021 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 12:13:18,021 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2022-04-08 12:13:18,038 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 12:13:18,038 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 12:13:18,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 12:13:18,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 12:13:18,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 12:13:18,039 INFO L87 Difference]: Start difference. First operand 70 states and 98 transitions. Second operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2022-04-08 12:13:18,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:13:18,167 INFO L93 Difference]: Finished difference Result 76 states and 103 transitions. [2022-04-08 12:13:18,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 12:13:18,167 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 49 [2022-04-08 12:13:18,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 12:13:18,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2022-04-08 12:13:18,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 47 transitions. [2022-04-08 12:13:18,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2022-04-08 12:13:18,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 47 transitions. [2022-04-08 12:13:18,169 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 47 transitions. [2022-04-08 12:13:18,206 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 12:13:18,209 INFO L225 Difference]: With dead ends: 76 [2022-04-08 12:13:18,209 INFO L226 Difference]: Without dead ends: 74 [2022-04-08 12:13:18,209 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-08 12:13:18,212 INFO L913 BasicCegarLoop]: 42 mSDtfsCounter, 5 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 12:13:18,212 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 139 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 12:13:18,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2022-04-08 12:13:18,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2022-04-08 12:13:18,245 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 12:13:18,246 INFO L82 GeneralOperation]: Start isEquivalent. First operand 74 states. Second operand has 74 states, 36 states have (on average 1.25) internal successors, (45), 40 states have internal predecessors, (45), 30 states have call successors, (30), 8 states have call predecessors, (30), 7 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2022-04-08 12:13:18,246 INFO L74 IsIncluded]: Start isIncluded. First operand 74 states. Second operand has 74 states, 36 states have (on average 1.25) internal successors, (45), 40 states have internal predecessors, (45), 30 states have call successors, (30), 8 states have call predecessors, (30), 7 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2022-04-08 12:13:18,247 INFO L87 Difference]: Start difference. First operand 74 states. Second operand has 74 states, 36 states have (on average 1.25) internal successors, (45), 40 states have internal predecessors, (45), 30 states have call successors, (30), 8 states have call predecessors, (30), 7 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2022-04-08 12:13:18,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:13:18,251 INFO L93 Difference]: Finished difference Result 74 states and 101 transitions. [2022-04-08 12:13:18,251 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 101 transitions. [2022-04-08 12:13:18,252 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:13:18,252 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 12:13:18,252 INFO L74 IsIncluded]: Start isIncluded. First operand has 74 states, 36 states have (on average 1.25) internal successors, (45), 40 states have internal predecessors, (45), 30 states have call successors, (30), 8 states have call predecessors, (30), 7 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) Second operand 74 states. [2022-04-08 12:13:18,253 INFO L87 Difference]: Start difference. First operand has 74 states, 36 states have (on average 1.25) internal successors, (45), 40 states have internal predecessors, (45), 30 states have call successors, (30), 8 states have call predecessors, (30), 7 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) Second operand 74 states. [2022-04-08 12:13:18,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:13:18,255 INFO L93 Difference]: Finished difference Result 74 states and 101 transitions. [2022-04-08 12:13:18,255 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 101 transitions. [2022-04-08 12:13:18,256 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:13:18,256 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 12:13:18,256 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 12:13:18,256 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 12:13:18,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 36 states have (on average 1.25) internal successors, (45), 40 states have internal predecessors, (45), 30 states have call successors, (30), 8 states have call predecessors, (30), 7 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2022-04-08 12:13:18,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 101 transitions. [2022-04-08 12:13:18,259 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 101 transitions. Word has length 49 [2022-04-08 12:13:18,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 12:13:18,259 INFO L478 AbstractCegarLoop]: Abstraction has 74 states and 101 transitions. [2022-04-08 12:13:18,260 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2022-04-08 12:13:18,260 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 74 states and 101 transitions. [2022-04-08 12:13:18,352 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 101 edges. 101 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 12:13:18,352 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 101 transitions. [2022-04-08 12:13:18,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-04-08 12:13:18,352 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 12:13:18,353 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 12:13:18,373 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 12:13:18,568 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 12:13:18,569 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 12:13:18,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 12:13:18,569 INFO L85 PathProgramCache]: Analyzing trace with hash -1164909737, now seen corresponding path program 1 times [2022-04-08 12:13:18,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 12:13:18,569 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [415931120] [2022-04-08 12:13:18,570 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 12:13:18,570 INFO L85 PathProgramCache]: Analyzing trace with hash -1164909737, now seen corresponding path program 2 times [2022-04-08 12:13:18,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 12:13:18,570 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1855441490] [2022-04-08 12:13:18,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 12:13:18,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 12:13:18,585 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 12:13:18,585 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1077956451] [2022-04-08 12:13:18,585 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 12:13:18,585 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 12:13:18,585 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 12:13:18,586 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 12:13:18,587 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 12:13:18,621 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 12:13:18,621 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 12:13:18,622 INFO L263 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-08 12:13:18,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 12:13:18,634 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 12:13:18,778 INFO L272 TraceCheckUtils]: 0: Hoare triple {2295#true} call ULTIMATE.init(); {2295#true} is VALID [2022-04-08 12:13:18,779 INFO L290 TraceCheckUtils]: 1: Hoare triple {2295#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(10, 2);call #Ultimate.allocInit(12, 3); {2295#true} is VALID [2022-04-08 12:13:18,779 INFO L290 TraceCheckUtils]: 2: Hoare triple {2295#true} assume true; {2295#true} is VALID [2022-04-08 12:13:18,779 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2295#true} {2295#true} #88#return; {2295#true} is VALID [2022-04-08 12:13:18,779 INFO L272 TraceCheckUtils]: 4: Hoare triple {2295#true} call #t~ret6 := main(); {2295#true} is VALID [2022-04-08 12:13:18,779 INFO L290 TraceCheckUtils]: 5: Hoare triple {2295#true} havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~x~0;havoc ~y~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {2295#true} is VALID [2022-04-08 12:13:18,779 INFO L272 TraceCheckUtils]: 6: Hoare triple {2295#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 5 then 1 else 0)); {2295#true} is VALID [2022-04-08 12:13:18,779 INFO L290 TraceCheckUtils]: 7: Hoare triple {2295#true} ~cond := #in~cond; {2295#true} is VALID [2022-04-08 12:13:18,779 INFO L290 TraceCheckUtils]: 8: Hoare triple {2295#true} assume !(0 == ~cond); {2295#true} is VALID [2022-04-08 12:13:18,779 INFO L290 TraceCheckUtils]: 9: Hoare triple {2295#true} assume true; {2295#true} is VALID [2022-04-08 12:13:18,779 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2295#true} {2295#true} #66#return; {2295#true} is VALID [2022-04-08 12:13:18,779 INFO L290 TraceCheckUtils]: 11: Hoare triple {2295#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {2295#true} is VALID [2022-04-08 12:13:18,779 INFO L272 TraceCheckUtils]: 12: Hoare triple {2295#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 5 then 1 else 0)); {2295#true} is VALID [2022-04-08 12:13:18,779 INFO L290 TraceCheckUtils]: 13: Hoare triple {2295#true} ~cond := #in~cond; {2295#true} is VALID [2022-04-08 12:13:18,780 INFO L290 TraceCheckUtils]: 14: Hoare triple {2295#true} assume !(0 == ~cond); {2295#true} is VALID [2022-04-08 12:13:18,780 INFO L290 TraceCheckUtils]: 15: Hoare triple {2295#true} assume true; {2295#true} is VALID [2022-04-08 12:13:18,780 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {2295#true} {2295#true} #68#return; {2295#true} is VALID [2022-04-08 12:13:18,780 INFO L272 TraceCheckUtils]: 17: Hoare triple {2295#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {2295#true} is VALID [2022-04-08 12:13:18,780 INFO L290 TraceCheckUtils]: 18: Hoare triple {2295#true} ~cond := #in~cond; {2295#true} is VALID [2022-04-08 12:13:18,780 INFO L290 TraceCheckUtils]: 19: Hoare triple {2295#true} assume !(0 == ~cond); {2295#true} is VALID [2022-04-08 12:13:18,780 INFO L290 TraceCheckUtils]: 20: Hoare triple {2295#true} assume true; {2295#true} is VALID [2022-04-08 12:13:18,780 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {2295#true} {2295#true} #70#return; {2295#true} is VALID [2022-04-08 12:13:18,780 INFO L272 TraceCheckUtils]: 22: Hoare triple {2295#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {2295#true} is VALID [2022-04-08 12:13:18,780 INFO L290 TraceCheckUtils]: 23: Hoare triple {2295#true} ~cond := #in~cond; {2295#true} is VALID [2022-04-08 12:13:18,780 INFO L290 TraceCheckUtils]: 24: Hoare triple {2295#true} assume !(0 == ~cond); {2295#true} is VALID [2022-04-08 12:13:18,780 INFO L290 TraceCheckUtils]: 25: Hoare triple {2295#true} assume true; {2295#true} is VALID [2022-04-08 12:13:18,780 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {2295#true} {2295#true} #72#return; {2295#true} is VALID [2022-04-08 12:13:18,781 INFO L290 TraceCheckUtils]: 27: Hoare triple {2295#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {2381#(and (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-08 12:13:18,781 INFO L290 TraceCheckUtils]: 28: Hoare triple {2381#(and (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} assume !false; {2381#(and (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-08 12:13:18,781 INFO L272 TraceCheckUtils]: 29: Hoare triple {2381#(and (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {2295#true} is VALID [2022-04-08 12:13:18,781 INFO L290 TraceCheckUtils]: 30: Hoare triple {2295#true} ~cond := #in~cond; {2295#true} is VALID [2022-04-08 12:13:18,781 INFO L290 TraceCheckUtils]: 31: Hoare triple {2295#true} assume !(0 == ~cond); {2295#true} is VALID [2022-04-08 12:13:18,781 INFO L290 TraceCheckUtils]: 32: Hoare triple {2295#true} assume true; {2295#true} is VALID [2022-04-08 12:13:18,782 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {2295#true} {2381#(and (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} #74#return; {2381#(and (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-08 12:13:18,783 INFO L272 TraceCheckUtils]: 34: Hoare triple {2381#(and (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {2295#true} is VALID [2022-04-08 12:13:18,783 INFO L290 TraceCheckUtils]: 35: Hoare triple {2295#true} ~cond := #in~cond; {2295#true} is VALID [2022-04-08 12:13:18,783 INFO L290 TraceCheckUtils]: 36: Hoare triple {2295#true} assume !(0 == ~cond); {2295#true} is VALID [2022-04-08 12:13:18,783 INFO L290 TraceCheckUtils]: 37: Hoare triple {2295#true} assume true; {2295#true} is VALID [2022-04-08 12:13:18,784 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {2295#true} {2381#(and (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} #76#return; {2381#(and (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-08 12:13:18,784 INFO L272 TraceCheckUtils]: 39: Hoare triple {2381#(and (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {2295#true} is VALID [2022-04-08 12:13:18,784 INFO L290 TraceCheckUtils]: 40: Hoare triple {2295#true} ~cond := #in~cond; {2295#true} is VALID [2022-04-08 12:13:18,784 INFO L290 TraceCheckUtils]: 41: Hoare triple {2295#true} assume !(0 == ~cond); {2295#true} is VALID [2022-04-08 12:13:18,784 INFO L290 TraceCheckUtils]: 42: Hoare triple {2295#true} assume true; {2295#true} is VALID [2022-04-08 12:13:18,788 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {2295#true} {2381#(and (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} #78#return; {2381#(and (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-08 12:13:18,789 INFO L290 TraceCheckUtils]: 44: Hoare triple {2381#(and (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} assume !!(~a~0 != ~b~0); {2381#(and (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-08 12:13:18,789 INFO L290 TraceCheckUtils]: 45: Hoare triple {2381#(and (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} assume ~a~0 > ~b~0;~a~0 := ~a~0 - ~b~0;~p~0 := ~p~0 - ~q~0;~r~0 := ~r~0 - ~s~0; {2381#(and (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-08 12:13:18,789 INFO L290 TraceCheckUtils]: 46: Hoare triple {2381#(and (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} assume !false; {2381#(and (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-08 12:13:18,790 INFO L272 TraceCheckUtils]: 47: Hoare triple {2381#(and (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {2442#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 12:13:18,790 INFO L290 TraceCheckUtils]: 48: Hoare triple {2442#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2446#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 12:13:18,791 INFO L290 TraceCheckUtils]: 49: Hoare triple {2446#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2296#false} is VALID [2022-04-08 12:13:18,791 INFO L290 TraceCheckUtils]: 50: Hoare triple {2296#false} assume !false; {2296#false} is VALID [2022-04-08 12:13:18,791 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2022-04-08 12:13:18,791 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-08 12:13:18,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 12:13:18,791 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1855441490] [2022-04-08 12:13:18,791 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 12:13:18,791 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1077956451] [2022-04-08 12:13:18,791 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1077956451] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 12:13:18,791 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 12:13:18,791 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 12:13:18,792 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 12:13:18,792 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [415931120] [2022-04-08 12:13:18,792 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [415931120] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 12:13:18,792 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 12:13:18,792 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 12:13:18,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [200776593] [2022-04-08 12:13:18,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 12:13:18,792 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 51 [2022-04-08 12:13:18,792 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 12:13:18,792 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-04-08 12:13:18,812 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 12:13:18,812 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 12:13:18,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 12:13:18,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 12:13:18,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 12:13:18,813 INFO L87 Difference]: Start difference. First operand 74 states and 101 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-04-08 12:13:18,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:13:18,973 INFO L93 Difference]: Finished difference Result 84 states and 109 transitions. [2022-04-08 12:13:18,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 12:13:18,974 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 51 [2022-04-08 12:13:18,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 12:13:18,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-04-08 12:13:18,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 63 transitions. [2022-04-08 12:13:18,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-04-08 12:13:18,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 63 transitions. [2022-04-08 12:13:18,976 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 63 transitions. [2022-04-08 12:13:19,019 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 12:13:19,020 INFO L225 Difference]: With dead ends: 84 [2022-04-08 12:13:19,020 INFO L226 Difference]: Without dead ends: 81 [2022-04-08 12:13:19,021 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 46 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-08 12:13:19,021 INFO L913 BasicCegarLoop]: 43 mSDtfsCounter, 6 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 12:13:19,021 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 146 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 12:13:19,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2022-04-08 12:13:19,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 79. [2022-04-08 12:13:19,045 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 12:13:19,045 INFO L82 GeneralOperation]: Start isEquivalent. First operand 81 states. Second operand has 79 states, 42 states have (on average 1.2142857142857142) internal successors, (51), 45 states have internal predecessors, (51), 27 states have call successors, (27), 10 states have call predecessors, (27), 9 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-08 12:13:19,045 INFO L74 IsIncluded]: Start isIncluded. First operand 81 states. Second operand has 79 states, 42 states have (on average 1.2142857142857142) internal successors, (51), 45 states have internal predecessors, (51), 27 states have call successors, (27), 10 states have call predecessors, (27), 9 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-08 12:13:19,046 INFO L87 Difference]: Start difference. First operand 81 states. Second operand has 79 states, 42 states have (on average 1.2142857142857142) internal successors, (51), 45 states have internal predecessors, (51), 27 states have call successors, (27), 10 states have call predecessors, (27), 9 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-08 12:13:19,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:13:19,048 INFO L93 Difference]: Finished difference Result 81 states and 105 transitions. [2022-04-08 12:13:19,048 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 105 transitions. [2022-04-08 12:13:19,048 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:13:19,048 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 12:13:19,048 INFO L74 IsIncluded]: Start isIncluded. First operand has 79 states, 42 states have (on average 1.2142857142857142) internal successors, (51), 45 states have internal predecessors, (51), 27 states have call successors, (27), 10 states have call predecessors, (27), 9 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) Second operand 81 states. [2022-04-08 12:13:19,049 INFO L87 Difference]: Start difference. First operand has 79 states, 42 states have (on average 1.2142857142857142) internal successors, (51), 45 states have internal predecessors, (51), 27 states have call successors, (27), 10 states have call predecessors, (27), 9 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) Second operand 81 states. [2022-04-08 12:13:19,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:13:19,051 INFO L93 Difference]: Finished difference Result 81 states and 105 transitions. [2022-04-08 12:13:19,051 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 105 transitions. [2022-04-08 12:13:19,051 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:13:19,051 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 12:13:19,051 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 12:13:19,051 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 12:13:19,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 42 states have (on average 1.2142857142857142) internal successors, (51), 45 states have internal predecessors, (51), 27 states have call successors, (27), 10 states have call predecessors, (27), 9 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-08 12:13:19,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 102 transitions. [2022-04-08 12:13:19,053 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 102 transitions. Word has length 51 [2022-04-08 12:13:19,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 12:13:19,054 INFO L478 AbstractCegarLoop]: Abstraction has 79 states and 102 transitions. [2022-04-08 12:13:19,054 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-04-08 12:13:19,054 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 79 states and 102 transitions. [2022-04-08 12:13:19,150 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 102 edges. 102 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 12:13:19,150 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 102 transitions. [2022-04-08 12:13:19,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-04-08 12:13:19,150 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 12:13:19,151 INFO L499 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 12:13:19,193 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 12:13:19,351 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 12:13:19,351 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 12:13:19,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 12:13:19,352 INFO L85 PathProgramCache]: Analyzing trace with hash 1924168317, now seen corresponding path program 1 times [2022-04-08 12:13:19,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 12:13:19,352 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [193099204] [2022-04-08 12:13:19,352 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 12:13:19,352 INFO L85 PathProgramCache]: Analyzing trace with hash 1924168317, now seen corresponding path program 2 times [2022-04-08 12:13:19,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 12:13:19,352 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [228520506] [2022-04-08 12:13:19,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 12:13:19,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 12:13:19,365 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 12:13:19,366 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [429218658] [2022-04-08 12:13:19,366 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 12:13:19,366 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 12:13:19,366 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 12:13:19,371 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 12:13:19,372 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 12:13:19,405 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 12:13:19,406 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 12:13:19,406 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-08 12:13:19,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 12:13:19,415 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 12:13:19,590 INFO L272 TraceCheckUtils]: 0: Hoare triple {2942#true} call ULTIMATE.init(); {2942#true} is VALID [2022-04-08 12:13:19,590 INFO L290 TraceCheckUtils]: 1: Hoare triple {2942#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(10, 2);call #Ultimate.allocInit(12, 3); {2942#true} is VALID [2022-04-08 12:13:19,590 INFO L290 TraceCheckUtils]: 2: Hoare triple {2942#true} assume true; {2942#true} is VALID [2022-04-08 12:13:19,591 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2942#true} {2942#true} #88#return; {2942#true} is VALID [2022-04-08 12:13:19,591 INFO L272 TraceCheckUtils]: 4: Hoare triple {2942#true} call #t~ret6 := main(); {2942#true} is VALID [2022-04-08 12:13:19,591 INFO L290 TraceCheckUtils]: 5: Hoare triple {2942#true} havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~x~0;havoc ~y~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {2942#true} is VALID [2022-04-08 12:13:19,591 INFO L272 TraceCheckUtils]: 6: Hoare triple {2942#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 5 then 1 else 0)); {2942#true} is VALID [2022-04-08 12:13:19,591 INFO L290 TraceCheckUtils]: 7: Hoare triple {2942#true} ~cond := #in~cond; {2942#true} is VALID [2022-04-08 12:13:19,591 INFO L290 TraceCheckUtils]: 8: Hoare triple {2942#true} assume !(0 == ~cond); {2942#true} is VALID [2022-04-08 12:13:19,591 INFO L290 TraceCheckUtils]: 9: Hoare triple {2942#true} assume true; {2942#true} is VALID [2022-04-08 12:13:19,591 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2942#true} {2942#true} #66#return; {2942#true} is VALID [2022-04-08 12:13:19,591 INFO L290 TraceCheckUtils]: 11: Hoare triple {2942#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {2942#true} is VALID [2022-04-08 12:13:19,591 INFO L272 TraceCheckUtils]: 12: Hoare triple {2942#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 5 then 1 else 0)); {2942#true} is VALID [2022-04-08 12:13:19,591 INFO L290 TraceCheckUtils]: 13: Hoare triple {2942#true} ~cond := #in~cond; {2942#true} is VALID [2022-04-08 12:13:19,591 INFO L290 TraceCheckUtils]: 14: Hoare triple {2942#true} assume !(0 == ~cond); {2942#true} is VALID [2022-04-08 12:13:19,591 INFO L290 TraceCheckUtils]: 15: Hoare triple {2942#true} assume true; {2942#true} is VALID [2022-04-08 12:13:19,591 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {2942#true} {2942#true} #68#return; {2942#true} is VALID [2022-04-08 12:13:19,592 INFO L272 TraceCheckUtils]: 17: Hoare triple {2942#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {2942#true} is VALID [2022-04-08 12:13:19,592 INFO L290 TraceCheckUtils]: 18: Hoare triple {2942#true} ~cond := #in~cond; {2942#true} is VALID [2022-04-08 12:13:19,592 INFO L290 TraceCheckUtils]: 19: Hoare triple {2942#true} assume !(0 == ~cond); {2942#true} is VALID [2022-04-08 12:13:19,592 INFO L290 TraceCheckUtils]: 20: Hoare triple {2942#true} assume true; {2942#true} is VALID [2022-04-08 12:13:19,592 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {2942#true} {2942#true} #70#return; {2942#true} is VALID [2022-04-08 12:13:19,592 INFO L272 TraceCheckUtils]: 22: Hoare triple {2942#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {2942#true} is VALID [2022-04-08 12:13:19,592 INFO L290 TraceCheckUtils]: 23: Hoare triple {2942#true} ~cond := #in~cond; {2942#true} is VALID [2022-04-08 12:13:19,592 INFO L290 TraceCheckUtils]: 24: Hoare triple {2942#true} assume !(0 == ~cond); {2942#true} is VALID [2022-04-08 12:13:19,592 INFO L290 TraceCheckUtils]: 25: Hoare triple {2942#true} assume true; {2942#true} is VALID [2022-04-08 12:13:19,592 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {2942#true} {2942#true} #72#return; {2942#true} is VALID [2022-04-08 12:13:19,592 INFO L290 TraceCheckUtils]: 27: Hoare triple {2942#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {2942#true} is VALID [2022-04-08 12:13:19,592 INFO L290 TraceCheckUtils]: 28: Hoare triple {2942#true} assume !false; {2942#true} is VALID [2022-04-08 12:13:19,592 INFO L272 TraceCheckUtils]: 29: Hoare triple {2942#true} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {2942#true} is VALID [2022-04-08 12:13:19,592 INFO L290 TraceCheckUtils]: 30: Hoare triple {2942#true} ~cond := #in~cond; {2942#true} is VALID [2022-04-08 12:13:19,593 INFO L290 TraceCheckUtils]: 31: Hoare triple {2942#true} assume !(0 == ~cond); {2942#true} is VALID [2022-04-08 12:13:19,593 INFO L290 TraceCheckUtils]: 32: Hoare triple {2942#true} assume true; {2942#true} is VALID [2022-04-08 12:13:19,593 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {2942#true} {2942#true} #74#return; {2942#true} is VALID [2022-04-08 12:13:19,593 INFO L272 TraceCheckUtils]: 34: Hoare triple {2942#true} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {2942#true} is VALID [2022-04-08 12:13:19,593 INFO L290 TraceCheckUtils]: 35: Hoare triple {2942#true} ~cond := #in~cond; {3052#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 12:13:19,594 INFO L290 TraceCheckUtils]: 36: Hoare triple {3052#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {3056#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 12:13:19,594 INFO L290 TraceCheckUtils]: 37: Hoare triple {3056#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {3056#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 12:13:19,595 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {3056#(not (= |__VERIFIER_assert_#in~cond| 0))} {2942#true} #76#return; {3063#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-08 12:13:19,595 INFO L272 TraceCheckUtils]: 39: Hoare triple {3063#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {2942#true} is VALID [2022-04-08 12:13:19,595 INFO L290 TraceCheckUtils]: 40: Hoare triple {2942#true} ~cond := #in~cond; {2942#true} is VALID [2022-04-08 12:13:19,595 INFO L290 TraceCheckUtils]: 41: Hoare triple {2942#true} assume !(0 == ~cond); {2942#true} is VALID [2022-04-08 12:13:19,595 INFO L290 TraceCheckUtils]: 42: Hoare triple {2942#true} assume true; {2942#true} is VALID [2022-04-08 12:13:19,600 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {2942#true} {3063#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} #78#return; {3063#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-08 12:13:19,601 INFO L290 TraceCheckUtils]: 44: Hoare triple {3063#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} assume !(~a~0 != ~b~0); {3082#(= main_~b~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-08 12:13:19,601 INFO L272 TraceCheckUtils]: 45: Hoare triple {3082#(= main_~b~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} call __VERIFIER_assert((if 0 == ~a~0 - ~b~0 then 1 else 0)); {2942#true} is VALID [2022-04-08 12:13:19,601 INFO L290 TraceCheckUtils]: 46: Hoare triple {2942#true} ~cond := #in~cond; {2942#true} is VALID [2022-04-08 12:13:19,601 INFO L290 TraceCheckUtils]: 47: Hoare triple {2942#true} assume !(0 == ~cond); {2942#true} is VALID [2022-04-08 12:13:19,601 INFO L290 TraceCheckUtils]: 48: Hoare triple {2942#true} assume true; {2942#true} is VALID [2022-04-08 12:13:19,602 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {2942#true} {3082#(= main_~b~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} #80#return; {3082#(= main_~b~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-08 12:13:19,602 INFO L272 TraceCheckUtils]: 50: Hoare triple {3082#(= main_~b~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} call __VERIFIER_assert((if 0 == ~p~0 * ~x~0 + ~r~0 * ~y~0 - ~b~0 then 1 else 0)); {3101#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 12:13:19,603 INFO L290 TraceCheckUtils]: 51: Hoare triple {3101#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3105#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 12:13:19,603 INFO L290 TraceCheckUtils]: 52: Hoare triple {3105#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2943#false} is VALID [2022-04-08 12:13:19,603 INFO L290 TraceCheckUtils]: 53: Hoare triple {2943#false} assume !false; {2943#false} is VALID [2022-04-08 12:13:19,603 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 10 proven. 7 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2022-04-08 12:13:19,603 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 12:13:36,098 INFO L290 TraceCheckUtils]: 53: Hoare triple {2943#false} assume !false; {2943#false} is VALID [2022-04-08 12:13:36,098 INFO L290 TraceCheckUtils]: 52: Hoare triple {3105#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2943#false} is VALID [2022-04-08 12:13:36,099 INFO L290 TraceCheckUtils]: 51: Hoare triple {3101#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3105#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 12:13:36,100 INFO L272 TraceCheckUtils]: 50: Hoare triple {3082#(= main_~b~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} call __VERIFIER_assert((if 0 == ~p~0 * ~x~0 + ~r~0 * ~y~0 - ~b~0 then 1 else 0)); {3101#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 12:13:36,101 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {2942#true} {3082#(= main_~b~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} #80#return; {3082#(= main_~b~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-08 12:13:36,101 INFO L290 TraceCheckUtils]: 48: Hoare triple {2942#true} assume true; {2942#true} is VALID [2022-04-08 12:13:36,101 INFO L290 TraceCheckUtils]: 47: Hoare triple {2942#true} assume !(0 == ~cond); {2942#true} is VALID [2022-04-08 12:13:36,101 INFO L290 TraceCheckUtils]: 46: Hoare triple {2942#true} ~cond := #in~cond; {2942#true} is VALID [2022-04-08 12:13:36,101 INFO L272 TraceCheckUtils]: 45: Hoare triple {3082#(= main_~b~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} call __VERIFIER_assert((if 0 == ~a~0 - ~b~0 then 1 else 0)); {2942#true} is VALID [2022-04-08 12:13:36,102 INFO L290 TraceCheckUtils]: 44: Hoare triple {3063#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} assume !(~a~0 != ~b~0); {3082#(= main_~b~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-08 12:13:36,103 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {2942#true} {3063#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} #78#return; {3063#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-08 12:13:36,103 INFO L290 TraceCheckUtils]: 42: Hoare triple {2942#true} assume true; {2942#true} is VALID [2022-04-08 12:13:36,103 INFO L290 TraceCheckUtils]: 41: Hoare triple {2942#true} assume !(0 == ~cond); {2942#true} is VALID [2022-04-08 12:13:36,103 INFO L290 TraceCheckUtils]: 40: Hoare triple {2942#true} ~cond := #in~cond; {2942#true} is VALID [2022-04-08 12:13:36,103 INFO L272 TraceCheckUtils]: 39: Hoare triple {3063#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {2942#true} is VALID [2022-04-08 12:13:36,103 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {3056#(not (= |__VERIFIER_assert_#in~cond| 0))} {2942#true} #76#return; {3063#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-08 12:13:36,106 INFO L290 TraceCheckUtils]: 37: Hoare triple {3056#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {3056#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 12:13:36,108 INFO L290 TraceCheckUtils]: 36: Hoare triple {3166#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {3056#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 12:13:36,108 INFO L290 TraceCheckUtils]: 35: Hoare triple {2942#true} ~cond := #in~cond; {3166#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 12:13:36,108 INFO L272 TraceCheckUtils]: 34: Hoare triple {2942#true} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {2942#true} is VALID [2022-04-08 12:13:36,108 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {2942#true} {2942#true} #74#return; {2942#true} is VALID [2022-04-08 12:13:36,109 INFO L290 TraceCheckUtils]: 32: Hoare triple {2942#true} assume true; {2942#true} is VALID [2022-04-08 12:13:36,109 INFO L290 TraceCheckUtils]: 31: Hoare triple {2942#true} assume !(0 == ~cond); {2942#true} is VALID [2022-04-08 12:13:36,109 INFO L290 TraceCheckUtils]: 30: Hoare triple {2942#true} ~cond := #in~cond; {2942#true} is VALID [2022-04-08 12:13:36,109 INFO L272 TraceCheckUtils]: 29: Hoare triple {2942#true} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {2942#true} is VALID [2022-04-08 12:13:36,109 INFO L290 TraceCheckUtils]: 28: Hoare triple {2942#true} assume !false; {2942#true} is VALID [2022-04-08 12:13:36,109 INFO L290 TraceCheckUtils]: 27: Hoare triple {2942#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {2942#true} is VALID [2022-04-08 12:13:36,109 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {2942#true} {2942#true} #72#return; {2942#true} is VALID [2022-04-08 12:13:36,109 INFO L290 TraceCheckUtils]: 25: Hoare triple {2942#true} assume true; {2942#true} is VALID [2022-04-08 12:13:36,109 INFO L290 TraceCheckUtils]: 24: Hoare triple {2942#true} assume !(0 == ~cond); {2942#true} is VALID [2022-04-08 12:13:36,109 INFO L290 TraceCheckUtils]: 23: Hoare triple {2942#true} ~cond := #in~cond; {2942#true} is VALID [2022-04-08 12:13:36,109 INFO L272 TraceCheckUtils]: 22: Hoare triple {2942#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {2942#true} is VALID [2022-04-08 12:13:36,109 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {2942#true} {2942#true} #70#return; {2942#true} is VALID [2022-04-08 12:13:36,109 INFO L290 TraceCheckUtils]: 20: Hoare triple {2942#true} assume true; {2942#true} is VALID [2022-04-08 12:13:36,109 INFO L290 TraceCheckUtils]: 19: Hoare triple {2942#true} assume !(0 == ~cond); {2942#true} is VALID [2022-04-08 12:13:36,109 INFO L290 TraceCheckUtils]: 18: Hoare triple {2942#true} ~cond := #in~cond; {2942#true} is VALID [2022-04-08 12:13:36,109 INFO L272 TraceCheckUtils]: 17: Hoare triple {2942#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {2942#true} is VALID [2022-04-08 12:13:36,110 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {2942#true} {2942#true} #68#return; {2942#true} is VALID [2022-04-08 12:13:36,110 INFO L290 TraceCheckUtils]: 15: Hoare triple {2942#true} assume true; {2942#true} is VALID [2022-04-08 12:13:36,110 INFO L290 TraceCheckUtils]: 14: Hoare triple {2942#true} assume !(0 == ~cond); {2942#true} is VALID [2022-04-08 12:13:36,110 INFO L290 TraceCheckUtils]: 13: Hoare triple {2942#true} ~cond := #in~cond; {2942#true} is VALID [2022-04-08 12:13:36,110 INFO L272 TraceCheckUtils]: 12: Hoare triple {2942#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 5 then 1 else 0)); {2942#true} is VALID [2022-04-08 12:13:36,110 INFO L290 TraceCheckUtils]: 11: Hoare triple {2942#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {2942#true} is VALID [2022-04-08 12:13:36,110 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2942#true} {2942#true} #66#return; {2942#true} is VALID [2022-04-08 12:13:36,110 INFO L290 TraceCheckUtils]: 9: Hoare triple {2942#true} assume true; {2942#true} is VALID [2022-04-08 12:13:36,110 INFO L290 TraceCheckUtils]: 8: Hoare triple {2942#true} assume !(0 == ~cond); {2942#true} is VALID [2022-04-08 12:13:36,110 INFO L290 TraceCheckUtils]: 7: Hoare triple {2942#true} ~cond := #in~cond; {2942#true} is VALID [2022-04-08 12:13:36,110 INFO L272 TraceCheckUtils]: 6: Hoare triple {2942#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 5 then 1 else 0)); {2942#true} is VALID [2022-04-08 12:13:36,110 INFO L290 TraceCheckUtils]: 5: Hoare triple {2942#true} havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~x~0;havoc ~y~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {2942#true} is VALID [2022-04-08 12:13:36,110 INFO L272 TraceCheckUtils]: 4: Hoare triple {2942#true} call #t~ret6 := main(); {2942#true} is VALID [2022-04-08 12:13:36,110 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2942#true} {2942#true} #88#return; {2942#true} is VALID [2022-04-08 12:13:36,110 INFO L290 TraceCheckUtils]: 2: Hoare triple {2942#true} assume true; {2942#true} is VALID [2022-04-08 12:13:36,111 INFO L290 TraceCheckUtils]: 1: Hoare triple {2942#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(10, 2);call #Ultimate.allocInit(12, 3); {2942#true} is VALID [2022-04-08 12:13:36,111 INFO L272 TraceCheckUtils]: 0: Hoare triple {2942#true} call ULTIMATE.init(); {2942#true} is VALID [2022-04-08 12:13:36,111 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 10 proven. 7 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2022-04-08 12:13:36,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 12:13:36,111 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [228520506] [2022-04-08 12:13:36,111 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 12:13:36,111 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [429218658] [2022-04-08 12:13:36,111 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [429218658] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 12:13:36,111 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 12:13:36,111 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2022-04-08 12:13:36,111 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 12:13:36,112 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [193099204] [2022-04-08 12:13:36,112 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [193099204] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 12:13:36,112 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 12:13:36,112 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-08 12:13:36,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [265943433] [2022-04-08 12:13:36,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 12:13:36,112 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 54 [2022-04-08 12:13:36,112 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 12:13:36,112 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-04-08 12:13:36,152 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 12:13:36,152 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-08 12:13:36,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 12:13:36,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-08 12:13:36,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-04-08 12:13:36,153 INFO L87 Difference]: Start difference. First operand 79 states and 102 transitions. Second operand has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-04-08 12:13:36,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:13:36,958 INFO L93 Difference]: Finished difference Result 88 states and 112 transitions. [2022-04-08 12:13:36,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-08 12:13:36,959 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 54 [2022-04-08 12:13:36,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 12:13:36,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-04-08 12:13:36,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 52 transitions. [2022-04-08 12:13:36,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-04-08 12:13:36,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 52 transitions. [2022-04-08 12:13:36,961 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 52 transitions. [2022-04-08 12:13:37,017 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 12:13:37,019 INFO L225 Difference]: With dead ends: 88 [2022-04-08 12:13:37,019 INFO L226 Difference]: Without dead ends: 84 [2022-04-08 12:13:37,019 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 99 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2022-04-08 12:13:37,020 INFO L913 BasicCegarLoop]: 31 mSDtfsCounter, 14 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-08 12:13:37,020 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 129 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-08 12:13:37,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2022-04-08 12:13:37,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2022-04-08 12:13:37,062 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 12:13:37,063 INFO L82 GeneralOperation]: Start isEquivalent. First operand 84 states. Second operand has 84 states, 46 states have (on average 1.1521739130434783) internal successors, (53), 49 states have internal predecessors, (53), 27 states have call successors, (27), 11 states have call predecessors, (27), 10 states have return successors, (25), 23 states have call predecessors, (25), 25 states have call successors, (25) [2022-04-08 12:13:37,063 INFO L74 IsIncluded]: Start isIncluded. First operand 84 states. Second operand has 84 states, 46 states have (on average 1.1521739130434783) internal successors, (53), 49 states have internal predecessors, (53), 27 states have call successors, (27), 11 states have call predecessors, (27), 10 states have return successors, (25), 23 states have call predecessors, (25), 25 states have call successors, (25) [2022-04-08 12:13:37,064 INFO L87 Difference]: Start difference. First operand 84 states. Second operand has 84 states, 46 states have (on average 1.1521739130434783) internal successors, (53), 49 states have internal predecessors, (53), 27 states have call successors, (27), 11 states have call predecessors, (27), 10 states have return successors, (25), 23 states have call predecessors, (25), 25 states have call successors, (25) [2022-04-08 12:13:37,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:13:37,066 INFO L93 Difference]: Finished difference Result 84 states and 105 transitions. [2022-04-08 12:13:37,066 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 105 transitions. [2022-04-08 12:13:37,066 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:13:37,067 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 12:13:37,067 INFO L74 IsIncluded]: Start isIncluded. First operand has 84 states, 46 states have (on average 1.1521739130434783) internal successors, (53), 49 states have internal predecessors, (53), 27 states have call successors, (27), 11 states have call predecessors, (27), 10 states have return successors, (25), 23 states have call predecessors, (25), 25 states have call successors, (25) Second operand 84 states. [2022-04-08 12:13:37,067 INFO L87 Difference]: Start difference. First operand has 84 states, 46 states have (on average 1.1521739130434783) internal successors, (53), 49 states have internal predecessors, (53), 27 states have call successors, (27), 11 states have call predecessors, (27), 10 states have return successors, (25), 23 states have call predecessors, (25), 25 states have call successors, (25) Second operand 84 states. [2022-04-08 12:13:37,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:13:37,069 INFO L93 Difference]: Finished difference Result 84 states and 105 transitions. [2022-04-08 12:13:37,069 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 105 transitions. [2022-04-08 12:13:37,070 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:13:37,070 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 12:13:37,070 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 12:13:37,070 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 12:13:37,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 46 states have (on average 1.1521739130434783) internal successors, (53), 49 states have internal predecessors, (53), 27 states have call successors, (27), 11 states have call predecessors, (27), 10 states have return successors, (25), 23 states have call predecessors, (25), 25 states have call successors, (25) [2022-04-08 12:13:37,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 105 transitions. [2022-04-08 12:13:37,072 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 105 transitions. Word has length 54 [2022-04-08 12:13:37,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 12:13:37,072 INFO L478 AbstractCegarLoop]: Abstraction has 84 states and 105 transitions. [2022-04-08 12:13:37,072 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-04-08 12:13:37,072 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 84 states and 105 transitions. [2022-04-08 12:13:37,238 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 105 edges. 105 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 12:13:37,238 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 105 transitions. [2022-04-08 12:13:37,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-04-08 12:13:37,239 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 12:13:37,239 INFO L499 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 12:13:37,273 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 12:13:37,439 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 12:13:37,439 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 12:13:37,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 12:13:37,440 INFO L85 PathProgramCache]: Analyzing trace with hash 1698149216, now seen corresponding path program 3 times [2022-04-08 12:13:37,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 12:13:37,440 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1698798238] [2022-04-08 12:13:37,440 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 12:13:37,440 INFO L85 PathProgramCache]: Analyzing trace with hash 1698149216, now seen corresponding path program 4 times [2022-04-08 12:13:37,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 12:13:37,440 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [843323968] [2022-04-08 12:13:37,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 12:13:37,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 12:13:37,453 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 12:13:37,453 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [412074051] [2022-04-08 12:13:37,453 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 12:13:37,453 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 12:13:37,453 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 12:13:37,476 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 12:13:37,479 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 12:13:37,538 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 12:13:37,538 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 12:13:37,539 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 26 conjunts are in the unsatisfiable core [2022-04-08 12:13:37,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 12:13:37,549 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 12:13:38,086 INFO L272 TraceCheckUtils]: 0: Hoare triple {3792#true} call ULTIMATE.init(); {3792#true} is VALID [2022-04-08 12:13:38,087 INFO L290 TraceCheckUtils]: 1: Hoare triple {3792#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(10, 2);call #Ultimate.allocInit(12, 3); {3792#true} is VALID [2022-04-08 12:13:38,087 INFO L290 TraceCheckUtils]: 2: Hoare triple {3792#true} assume true; {3792#true} is VALID [2022-04-08 12:13:38,087 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3792#true} {3792#true} #88#return; {3792#true} is VALID [2022-04-08 12:13:38,087 INFO L272 TraceCheckUtils]: 4: Hoare triple {3792#true} call #t~ret6 := main(); {3792#true} is VALID [2022-04-08 12:13:38,087 INFO L290 TraceCheckUtils]: 5: Hoare triple {3792#true} havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~x~0;havoc ~y~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {3792#true} is VALID [2022-04-08 12:13:38,087 INFO L272 TraceCheckUtils]: 6: Hoare triple {3792#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 5 then 1 else 0)); {3792#true} is VALID [2022-04-08 12:13:38,087 INFO L290 TraceCheckUtils]: 7: Hoare triple {3792#true} ~cond := #in~cond; {3792#true} is VALID [2022-04-08 12:13:38,087 INFO L290 TraceCheckUtils]: 8: Hoare triple {3792#true} assume !(0 == ~cond); {3792#true} is VALID [2022-04-08 12:13:38,087 INFO L290 TraceCheckUtils]: 9: Hoare triple {3792#true} assume true; {3792#true} is VALID [2022-04-08 12:13:38,088 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3792#true} {3792#true} #66#return; {3792#true} is VALID [2022-04-08 12:13:38,088 INFO L290 TraceCheckUtils]: 11: Hoare triple {3792#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {3792#true} is VALID [2022-04-08 12:13:38,088 INFO L272 TraceCheckUtils]: 12: Hoare triple {3792#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 5 then 1 else 0)); {3792#true} is VALID [2022-04-08 12:13:38,088 INFO L290 TraceCheckUtils]: 13: Hoare triple {3792#true} ~cond := #in~cond; {3792#true} is VALID [2022-04-08 12:13:38,088 INFO L290 TraceCheckUtils]: 14: Hoare triple {3792#true} assume !(0 == ~cond); {3792#true} is VALID [2022-04-08 12:13:38,088 INFO L290 TraceCheckUtils]: 15: Hoare triple {3792#true} assume true; {3792#true} is VALID [2022-04-08 12:13:38,088 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {3792#true} {3792#true} #68#return; {3792#true} is VALID [2022-04-08 12:13:38,088 INFO L272 TraceCheckUtils]: 17: Hoare triple {3792#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {3792#true} is VALID [2022-04-08 12:13:38,088 INFO L290 TraceCheckUtils]: 18: Hoare triple {3792#true} ~cond := #in~cond; {3792#true} is VALID [2022-04-08 12:13:38,088 INFO L290 TraceCheckUtils]: 19: Hoare triple {3792#true} assume !(0 == ~cond); {3792#true} is VALID [2022-04-08 12:13:38,088 INFO L290 TraceCheckUtils]: 20: Hoare triple {3792#true} assume true; {3792#true} is VALID [2022-04-08 12:13:38,088 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {3792#true} {3792#true} #70#return; {3792#true} is VALID [2022-04-08 12:13:38,089 INFO L272 TraceCheckUtils]: 22: Hoare triple {3792#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {3792#true} is VALID [2022-04-08 12:13:38,092 INFO L290 TraceCheckUtils]: 23: Hoare triple {3792#true} ~cond := #in~cond; {3866#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-08 12:13:38,092 INFO L290 TraceCheckUtils]: 24: Hoare triple {3866#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {3870#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-08 12:13:38,093 INFO L290 TraceCheckUtils]: 25: Hoare triple {3870#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {3870#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-08 12:13:38,093 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {3870#(not (= |assume_abort_if_not_#in~cond| 0))} {3792#true} #72#return; {3877#(<= 1 main_~y~0)} is VALID [2022-04-08 12:13:38,094 INFO L290 TraceCheckUtils]: 27: Hoare triple {3877#(<= 1 main_~y~0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {3881#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-08 12:13:38,095 INFO L290 TraceCheckUtils]: 28: Hoare triple {3881#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !false; {3881#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-08 12:13:38,095 INFO L272 TraceCheckUtils]: 29: Hoare triple {3881#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {3792#true} is VALID [2022-04-08 12:13:38,095 INFO L290 TraceCheckUtils]: 30: Hoare triple {3792#true} ~cond := #in~cond; {3792#true} is VALID [2022-04-08 12:13:38,095 INFO L290 TraceCheckUtils]: 31: Hoare triple {3792#true} assume !(0 == ~cond); {3792#true} is VALID [2022-04-08 12:13:38,095 INFO L290 TraceCheckUtils]: 32: Hoare triple {3792#true} assume true; {3792#true} is VALID [2022-04-08 12:13:38,096 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {3792#true} {3881#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #74#return; {3881#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-08 12:13:38,096 INFO L272 TraceCheckUtils]: 34: Hoare triple {3881#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {3792#true} is VALID [2022-04-08 12:13:38,096 INFO L290 TraceCheckUtils]: 35: Hoare triple {3792#true} ~cond := #in~cond; {3792#true} is VALID [2022-04-08 12:13:38,096 INFO L290 TraceCheckUtils]: 36: Hoare triple {3792#true} assume !(0 == ~cond); {3792#true} is VALID [2022-04-08 12:13:38,096 INFO L290 TraceCheckUtils]: 37: Hoare triple {3792#true} assume true; {3792#true} is VALID [2022-04-08 12:13:38,097 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {3792#true} {3881#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #76#return; {3881#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-08 12:13:38,097 INFO L272 TraceCheckUtils]: 39: Hoare triple {3881#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {3792#true} is VALID [2022-04-08 12:13:38,097 INFO L290 TraceCheckUtils]: 40: Hoare triple {3792#true} ~cond := #in~cond; {3792#true} is VALID [2022-04-08 12:13:38,097 INFO L290 TraceCheckUtils]: 41: Hoare triple {3792#true} assume !(0 == ~cond); {3792#true} is VALID [2022-04-08 12:13:38,097 INFO L290 TraceCheckUtils]: 42: Hoare triple {3792#true} assume true; {3792#true} is VALID [2022-04-08 12:13:38,098 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {3792#true} {3881#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #78#return; {3881#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-08 12:13:38,098 INFO L290 TraceCheckUtils]: 44: Hoare triple {3881#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !!(~a~0 != ~b~0); {3881#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-08 12:13:38,099 INFO L290 TraceCheckUtils]: 45: Hoare triple {3881#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume ~a~0 > ~b~0;~a~0 := ~a~0 - ~b~0;~p~0 := ~p~0 - ~q~0;~r~0 := ~r~0 - ~s~0; {3936#(and (= (+ (* (- 1) main_~p~0) 1) 0) (= main_~y~0 (+ (* (- 1) main_~a~0) main_~x~0)) (= (- 1) main_~r~0) (<= 1 main_~y~0))} is VALID [2022-04-08 12:13:38,099 INFO L290 TraceCheckUtils]: 46: Hoare triple {3936#(and (= (+ (* (- 1) main_~p~0) 1) 0) (= main_~y~0 (+ (* (- 1) main_~a~0) main_~x~0)) (= (- 1) main_~r~0) (<= 1 main_~y~0))} assume !false; {3936#(and (= (+ (* (- 1) main_~p~0) 1) 0) (= main_~y~0 (+ (* (- 1) main_~a~0) main_~x~0)) (= (- 1) main_~r~0) (<= 1 main_~y~0))} is VALID [2022-04-08 12:13:38,099 INFO L272 TraceCheckUtils]: 47: Hoare triple {3936#(and (= (+ (* (- 1) main_~p~0) 1) 0) (= main_~y~0 (+ (* (- 1) main_~a~0) main_~x~0)) (= (- 1) main_~r~0) (<= 1 main_~y~0))} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {3792#true} is VALID [2022-04-08 12:13:38,099 INFO L290 TraceCheckUtils]: 48: Hoare triple {3792#true} ~cond := #in~cond; {3792#true} is VALID [2022-04-08 12:13:38,099 INFO L290 TraceCheckUtils]: 49: Hoare triple {3792#true} assume !(0 == ~cond); {3792#true} is VALID [2022-04-08 12:13:38,099 INFO L290 TraceCheckUtils]: 50: Hoare triple {3792#true} assume true; {3792#true} is VALID [2022-04-08 12:13:38,100 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {3792#true} {3936#(and (= (+ (* (- 1) main_~p~0) 1) 0) (= main_~y~0 (+ (* (- 1) main_~a~0) main_~x~0)) (= (- 1) main_~r~0) (<= 1 main_~y~0))} #74#return; {3936#(and (= (+ (* (- 1) main_~p~0) 1) 0) (= main_~y~0 (+ (* (- 1) main_~a~0) main_~x~0)) (= (- 1) main_~r~0) (<= 1 main_~y~0))} is VALID [2022-04-08 12:13:38,100 INFO L272 TraceCheckUtils]: 52: Hoare triple {3936#(and (= (+ (* (- 1) main_~p~0) 1) 0) (= main_~y~0 (+ (* (- 1) main_~a~0) main_~x~0)) (= (- 1) main_~r~0) (<= 1 main_~y~0))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {3958#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 12:13:38,101 INFO L290 TraceCheckUtils]: 53: Hoare triple {3958#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3962#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 12:13:38,101 INFO L290 TraceCheckUtils]: 54: Hoare triple {3962#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3793#false} is VALID [2022-04-08 12:13:38,101 INFO L290 TraceCheckUtils]: 55: Hoare triple {3793#false} assume !false; {3793#false} is VALID [2022-04-08 12:13:38,101 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 17 proven. 3 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2022-04-08 12:13:38,102 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 12:13:38,421 INFO L290 TraceCheckUtils]: 55: Hoare triple {3793#false} assume !false; {3793#false} is VALID [2022-04-08 12:13:38,422 INFO L290 TraceCheckUtils]: 54: Hoare triple {3962#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3793#false} is VALID [2022-04-08 12:13:38,422 INFO L290 TraceCheckUtils]: 53: Hoare triple {3958#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3962#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 12:13:38,422 INFO L272 TraceCheckUtils]: 52: Hoare triple {3978#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {3958#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 12:13:38,423 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {3792#true} {3978#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} #74#return; {3978#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-08 12:13:38,423 INFO L290 TraceCheckUtils]: 50: Hoare triple {3792#true} assume true; {3792#true} is VALID [2022-04-08 12:13:38,423 INFO L290 TraceCheckUtils]: 49: Hoare triple {3792#true} assume !(0 == ~cond); {3792#true} is VALID [2022-04-08 12:13:38,423 INFO L290 TraceCheckUtils]: 48: Hoare triple {3792#true} ~cond := #in~cond; {3792#true} is VALID [2022-04-08 12:13:38,424 INFO L272 TraceCheckUtils]: 47: Hoare triple {3978#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {3792#true} is VALID [2022-04-08 12:13:38,424 INFO L290 TraceCheckUtils]: 46: Hoare triple {3978#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} assume !false; {3978#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-08 12:13:38,628 INFO L290 TraceCheckUtils]: 45: Hoare triple {4000#(= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))))} assume ~a~0 > ~b~0;~a~0 := ~a~0 - ~b~0;~p~0 := ~p~0 - ~q~0;~r~0 := ~r~0 - ~s~0; {3978#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-08 12:13:38,628 INFO L290 TraceCheckUtils]: 44: Hoare triple {4000#(= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))))} assume !!(~a~0 != ~b~0); {4000#(= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))))} is VALID [2022-04-08 12:13:38,629 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {3792#true} {4000#(= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))))} #78#return; {4000#(= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))))} is VALID [2022-04-08 12:13:38,629 INFO L290 TraceCheckUtils]: 42: Hoare triple {3792#true} assume true; {3792#true} is VALID [2022-04-08 12:13:38,629 INFO L290 TraceCheckUtils]: 41: Hoare triple {3792#true} assume !(0 == ~cond); {3792#true} is VALID [2022-04-08 12:13:38,629 INFO L290 TraceCheckUtils]: 40: Hoare triple {3792#true} ~cond := #in~cond; {3792#true} is VALID [2022-04-08 12:13:38,629 INFO L272 TraceCheckUtils]: 39: Hoare triple {4000#(= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {3792#true} is VALID [2022-04-08 12:13:38,630 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {3792#true} {4000#(= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))))} #76#return; {4000#(= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))))} is VALID [2022-04-08 12:13:38,630 INFO L290 TraceCheckUtils]: 37: Hoare triple {3792#true} assume true; {3792#true} is VALID [2022-04-08 12:13:38,630 INFO L290 TraceCheckUtils]: 36: Hoare triple {3792#true} assume !(0 == ~cond); {3792#true} is VALID [2022-04-08 12:13:38,630 INFO L290 TraceCheckUtils]: 35: Hoare triple {3792#true} ~cond := #in~cond; {3792#true} is VALID [2022-04-08 12:13:38,630 INFO L272 TraceCheckUtils]: 34: Hoare triple {4000#(= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {3792#true} is VALID [2022-04-08 12:13:38,631 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {3792#true} {4000#(= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))))} #74#return; {4000#(= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))))} is VALID [2022-04-08 12:13:38,631 INFO L290 TraceCheckUtils]: 32: Hoare triple {3792#true} assume true; {3792#true} is VALID [2022-04-08 12:13:38,631 INFO L290 TraceCheckUtils]: 31: Hoare triple {3792#true} assume !(0 == ~cond); {3792#true} is VALID [2022-04-08 12:13:38,631 INFO L290 TraceCheckUtils]: 30: Hoare triple {3792#true} ~cond := #in~cond; {3792#true} is VALID [2022-04-08 12:13:38,631 INFO L272 TraceCheckUtils]: 29: Hoare triple {4000#(= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))))} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {3792#true} is VALID [2022-04-08 12:13:38,631 INFO L290 TraceCheckUtils]: 28: Hoare triple {4000#(= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))))} assume !false; {4000#(= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))))} is VALID [2022-04-08 12:13:38,632 INFO L290 TraceCheckUtils]: 27: Hoare triple {3792#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {4000#(= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))))} is VALID [2022-04-08 12:13:38,632 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {3792#true} {3792#true} #72#return; {3792#true} is VALID [2022-04-08 12:13:38,632 INFO L290 TraceCheckUtils]: 25: Hoare triple {3792#true} assume true; {3792#true} is VALID [2022-04-08 12:13:38,632 INFO L290 TraceCheckUtils]: 24: Hoare triple {3792#true} assume !(0 == ~cond); {3792#true} is VALID [2022-04-08 12:13:38,632 INFO L290 TraceCheckUtils]: 23: Hoare triple {3792#true} ~cond := #in~cond; {3792#true} is VALID [2022-04-08 12:13:38,632 INFO L272 TraceCheckUtils]: 22: Hoare triple {3792#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {3792#true} is VALID [2022-04-08 12:13:38,632 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {3792#true} {3792#true} #70#return; {3792#true} is VALID [2022-04-08 12:13:38,632 INFO L290 TraceCheckUtils]: 20: Hoare triple {3792#true} assume true; {3792#true} is VALID [2022-04-08 12:13:38,632 INFO L290 TraceCheckUtils]: 19: Hoare triple {3792#true} assume !(0 == ~cond); {3792#true} is VALID [2022-04-08 12:13:38,632 INFO L290 TraceCheckUtils]: 18: Hoare triple {3792#true} ~cond := #in~cond; {3792#true} is VALID [2022-04-08 12:13:38,632 INFO L272 TraceCheckUtils]: 17: Hoare triple {3792#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {3792#true} is VALID [2022-04-08 12:13:38,632 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {3792#true} {3792#true} #68#return; {3792#true} is VALID [2022-04-08 12:13:38,633 INFO L290 TraceCheckUtils]: 15: Hoare triple {3792#true} assume true; {3792#true} is VALID [2022-04-08 12:13:38,633 INFO L290 TraceCheckUtils]: 14: Hoare triple {3792#true} assume !(0 == ~cond); {3792#true} is VALID [2022-04-08 12:13:38,633 INFO L290 TraceCheckUtils]: 13: Hoare triple {3792#true} ~cond := #in~cond; {3792#true} is VALID [2022-04-08 12:13:38,633 INFO L272 TraceCheckUtils]: 12: Hoare triple {3792#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 5 then 1 else 0)); {3792#true} is VALID [2022-04-08 12:13:38,633 INFO L290 TraceCheckUtils]: 11: Hoare triple {3792#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {3792#true} is VALID [2022-04-08 12:13:38,633 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3792#true} {3792#true} #66#return; {3792#true} is VALID [2022-04-08 12:13:38,633 INFO L290 TraceCheckUtils]: 9: Hoare triple {3792#true} assume true; {3792#true} is VALID [2022-04-08 12:13:38,633 INFO L290 TraceCheckUtils]: 8: Hoare triple {3792#true} assume !(0 == ~cond); {3792#true} is VALID [2022-04-08 12:13:38,633 INFO L290 TraceCheckUtils]: 7: Hoare triple {3792#true} ~cond := #in~cond; {3792#true} is VALID [2022-04-08 12:13:38,633 INFO L272 TraceCheckUtils]: 6: Hoare triple {3792#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 5 then 1 else 0)); {3792#true} is VALID [2022-04-08 12:13:38,633 INFO L290 TraceCheckUtils]: 5: Hoare triple {3792#true} havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~x~0;havoc ~y~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {3792#true} is VALID [2022-04-08 12:13:38,633 INFO L272 TraceCheckUtils]: 4: Hoare triple {3792#true} call #t~ret6 := main(); {3792#true} is VALID [2022-04-08 12:13:38,633 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3792#true} {3792#true} #88#return; {3792#true} is VALID [2022-04-08 12:13:38,633 INFO L290 TraceCheckUtils]: 2: Hoare triple {3792#true} assume true; {3792#true} is VALID [2022-04-08 12:13:38,633 INFO L290 TraceCheckUtils]: 1: Hoare triple {3792#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(10, 2);call #Ultimate.allocInit(12, 3); {3792#true} is VALID [2022-04-08 12:13:38,633 INFO L272 TraceCheckUtils]: 0: Hoare triple {3792#true} call ULTIMATE.init(); {3792#true} is VALID [2022-04-08 12:13:38,634 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2022-04-08 12:13:38,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 12:13:38,634 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [843323968] [2022-04-08 12:13:38,634 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 12:13:38,634 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [412074051] [2022-04-08 12:13:38,634 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [412074051] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 12:13:38,634 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 12:13:38,634 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6] total 11 [2022-04-08 12:13:38,634 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 12:13:38,634 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1698798238] [2022-04-08 12:13:38,634 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1698798238] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 12:13:38,634 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 12:13:38,634 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-08 12:13:38,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2124383281] [2022-04-08 12:13:38,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 12:13:38,635 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 7 states have internal predecessors, (21), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 4 states have call predecessors, (9), 3 states have call successors, (9) Word has length 56 [2022-04-08 12:13:38,635 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 12:13:38,635 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 7 states have internal predecessors, (21), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 4 states have call predecessors, (9), 3 states have call successors, (9) [2022-04-08 12:13:38,677 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 12:13:38,677 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-08 12:13:38,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 12:13:38,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-08 12:13:38,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2022-04-08 12:13:38,678 INFO L87 Difference]: Start difference. First operand 84 states and 105 transitions. Second operand has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 7 states have internal predecessors, (21), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 4 states have call predecessors, (9), 3 states have call successors, (9) [2022-04-08 12:13:39,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:13:39,554 INFO L93 Difference]: Finished difference Result 118 states and 147 transitions. [2022-04-08 12:13:39,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-08 12:13:39,555 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 7 states have internal predecessors, (21), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 4 states have call predecessors, (9), 3 states have call successors, (9) Word has length 56 [2022-04-08 12:13:39,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 12:13:39,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 7 states have internal predecessors, (21), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 4 states have call predecessors, (9), 3 states have call successors, (9) [2022-04-08 12:13:39,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 75 transitions. [2022-04-08 12:13:39,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 7 states have internal predecessors, (21), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 4 states have call predecessors, (9), 3 states have call successors, (9) [2022-04-08 12:13:39,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 75 transitions. [2022-04-08 12:13:39,557 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 75 transitions. [2022-04-08 12:13:39,619 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 12:13:39,621 INFO L225 Difference]: With dead ends: 118 [2022-04-08 12:13:39,621 INFO L226 Difference]: Without dead ends: 116 [2022-04-08 12:13:39,621 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 101 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2022-04-08 12:13:39,622 INFO L913 BasicCegarLoop]: 44 mSDtfsCounter, 19 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 232 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 242 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 232 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-08 12:13:39,622 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [30 Valid, 184 Invalid, 242 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 232 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-08 12:13:39,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2022-04-08 12:13:39,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 112. [2022-04-08 12:13:39,684 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 12:13:39,685 INFO L82 GeneralOperation]: Start isEquivalent. First operand 116 states. Second operand has 112 states, 64 states have (on average 1.15625) internal successors, (74), 67 states have internal predecessors, (74), 33 states have call successors, (33), 15 states have call predecessors, (33), 14 states have return successors, (31), 29 states have call predecessors, (31), 31 states have call successors, (31) [2022-04-08 12:13:39,685 INFO L74 IsIncluded]: Start isIncluded. First operand 116 states. Second operand has 112 states, 64 states have (on average 1.15625) internal successors, (74), 67 states have internal predecessors, (74), 33 states have call successors, (33), 15 states have call predecessors, (33), 14 states have return successors, (31), 29 states have call predecessors, (31), 31 states have call successors, (31) [2022-04-08 12:13:39,685 INFO L87 Difference]: Start difference. First operand 116 states. Second operand has 112 states, 64 states have (on average 1.15625) internal successors, (74), 67 states have internal predecessors, (74), 33 states have call successors, (33), 15 states have call predecessors, (33), 14 states have return successors, (31), 29 states have call predecessors, (31), 31 states have call successors, (31) [2022-04-08 12:13:39,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:13:39,688 INFO L93 Difference]: Finished difference Result 116 states and 145 transitions. [2022-04-08 12:13:39,688 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 145 transitions. [2022-04-08 12:13:39,688 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:13:39,688 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 12:13:39,688 INFO L74 IsIncluded]: Start isIncluded. First operand has 112 states, 64 states have (on average 1.15625) internal successors, (74), 67 states have internal predecessors, (74), 33 states have call successors, (33), 15 states have call predecessors, (33), 14 states have return successors, (31), 29 states have call predecessors, (31), 31 states have call successors, (31) Second operand 116 states. [2022-04-08 12:13:39,689 INFO L87 Difference]: Start difference. First operand has 112 states, 64 states have (on average 1.15625) internal successors, (74), 67 states have internal predecessors, (74), 33 states have call successors, (33), 15 states have call predecessors, (33), 14 states have return successors, (31), 29 states have call predecessors, (31), 31 states have call successors, (31) Second operand 116 states. [2022-04-08 12:13:39,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:13:39,691 INFO L93 Difference]: Finished difference Result 116 states and 145 transitions. [2022-04-08 12:13:39,691 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 145 transitions. [2022-04-08 12:13:39,692 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:13:39,692 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 12:13:39,692 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 12:13:39,692 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 12:13:39,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 64 states have (on average 1.15625) internal successors, (74), 67 states have internal predecessors, (74), 33 states have call successors, (33), 15 states have call predecessors, (33), 14 states have return successors, (31), 29 states have call predecessors, (31), 31 states have call successors, (31) [2022-04-08 12:13:39,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 138 transitions. [2022-04-08 12:13:39,695 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 138 transitions. Word has length 56 [2022-04-08 12:13:39,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 12:13:39,695 INFO L478 AbstractCegarLoop]: Abstraction has 112 states and 138 transitions. [2022-04-08 12:13:39,695 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 7 states have internal predecessors, (21), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 4 states have call predecessors, (9), 3 states have call successors, (9) [2022-04-08 12:13:39,695 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 112 states and 138 transitions. [2022-04-08 12:13:39,838 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 138 edges. 138 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 12:13:39,838 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 138 transitions. [2022-04-08 12:13:39,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-04-08 12:13:39,838 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 12:13:39,839 INFO L499 BasicCegarLoop]: trace histogram [6, 5, 5, 4, 4, 4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 12:13:39,857 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 12:13:40,039 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 12:13:40,039 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 12:13:40,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 12:13:40,040 INFO L85 PathProgramCache]: Analyzing trace with hash 888099957, now seen corresponding path program 1 times [2022-04-08 12:13:40,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 12:13:40,040 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1674953180] [2022-04-08 12:13:40,040 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 12:13:40,040 INFO L85 PathProgramCache]: Analyzing trace with hash 888099957, now seen corresponding path program 2 times [2022-04-08 12:13:40,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 12:13:40,040 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1978682782] [2022-04-08 12:13:40,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 12:13:40,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 12:13:40,071 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 12:13:40,071 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1644146910] [2022-04-08 12:13:40,072 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 12:13:40,072 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 12:13:40,072 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 12:13:40,072 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 12:13:40,073 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 12:13:40,110 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 12:13:40,110 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 12:13:40,111 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 23 conjunts are in the unsatisfiable core [2022-04-08 12:13:40,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 12:13:40,120 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 12:13:40,411 INFO L272 TraceCheckUtils]: 0: Hoare triple {4834#true} call ULTIMATE.init(); {4834#true} is VALID [2022-04-08 12:13:40,411 INFO L290 TraceCheckUtils]: 1: Hoare triple {4834#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(10, 2);call #Ultimate.allocInit(12, 3); {4834#true} is VALID [2022-04-08 12:13:40,411 INFO L290 TraceCheckUtils]: 2: Hoare triple {4834#true} assume true; {4834#true} is VALID [2022-04-08 12:13:40,411 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4834#true} {4834#true} #88#return; {4834#true} is VALID [2022-04-08 12:13:40,411 INFO L272 TraceCheckUtils]: 4: Hoare triple {4834#true} call #t~ret6 := main(); {4834#true} is VALID [2022-04-08 12:13:40,411 INFO L290 TraceCheckUtils]: 5: Hoare triple {4834#true} havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~x~0;havoc ~y~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {4834#true} is VALID [2022-04-08 12:13:40,411 INFO L272 TraceCheckUtils]: 6: Hoare triple {4834#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 5 then 1 else 0)); {4834#true} is VALID [2022-04-08 12:13:40,411 INFO L290 TraceCheckUtils]: 7: Hoare triple {4834#true} ~cond := #in~cond; {4834#true} is VALID [2022-04-08 12:13:40,411 INFO L290 TraceCheckUtils]: 8: Hoare triple {4834#true} assume !(0 == ~cond); {4834#true} is VALID [2022-04-08 12:13:40,411 INFO L290 TraceCheckUtils]: 9: Hoare triple {4834#true} assume true; {4834#true} is VALID [2022-04-08 12:13:40,412 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4834#true} {4834#true} #66#return; {4834#true} is VALID [2022-04-08 12:13:40,412 INFO L290 TraceCheckUtils]: 11: Hoare triple {4834#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {4834#true} is VALID [2022-04-08 12:13:40,412 INFO L272 TraceCheckUtils]: 12: Hoare triple {4834#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 5 then 1 else 0)); {4834#true} is VALID [2022-04-08 12:13:40,412 INFO L290 TraceCheckUtils]: 13: Hoare triple {4834#true} ~cond := #in~cond; {4834#true} is VALID [2022-04-08 12:13:40,412 INFO L290 TraceCheckUtils]: 14: Hoare triple {4834#true} assume !(0 == ~cond); {4834#true} is VALID [2022-04-08 12:13:40,412 INFO L290 TraceCheckUtils]: 15: Hoare triple {4834#true} assume true; {4834#true} is VALID [2022-04-08 12:13:40,412 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {4834#true} {4834#true} #68#return; {4834#true} is VALID [2022-04-08 12:13:40,414 INFO L272 TraceCheckUtils]: 17: Hoare triple {4834#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {4834#true} is VALID [2022-04-08 12:13:40,415 INFO L290 TraceCheckUtils]: 18: Hoare triple {4834#true} ~cond := #in~cond; {4834#true} is VALID [2022-04-08 12:13:40,415 INFO L290 TraceCheckUtils]: 19: Hoare triple {4834#true} assume !(0 == ~cond); {4834#true} is VALID [2022-04-08 12:13:40,415 INFO L290 TraceCheckUtils]: 20: Hoare triple {4834#true} assume true; {4834#true} is VALID [2022-04-08 12:13:40,415 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {4834#true} {4834#true} #70#return; {4834#true} is VALID [2022-04-08 12:13:40,420 INFO L272 TraceCheckUtils]: 22: Hoare triple {4834#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {4834#true} is VALID [2022-04-08 12:13:40,420 INFO L290 TraceCheckUtils]: 23: Hoare triple {4834#true} ~cond := #in~cond; {4834#true} is VALID [2022-04-08 12:13:40,420 INFO L290 TraceCheckUtils]: 24: Hoare triple {4834#true} assume !(0 == ~cond); {4834#true} is VALID [2022-04-08 12:13:40,420 INFO L290 TraceCheckUtils]: 25: Hoare triple {4834#true} assume true; {4834#true} is VALID [2022-04-08 12:13:40,420 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {4834#true} {4834#true} #72#return; {4834#true} is VALID [2022-04-08 12:13:40,421 INFO L290 TraceCheckUtils]: 27: Hoare triple {4834#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {4920#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-08 12:13:40,421 INFO L290 TraceCheckUtils]: 28: Hoare triple {4920#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !false; {4920#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-08 12:13:40,421 INFO L272 TraceCheckUtils]: 29: Hoare triple {4920#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {4834#true} is VALID [2022-04-08 12:13:40,421 INFO L290 TraceCheckUtils]: 30: Hoare triple {4834#true} ~cond := #in~cond; {4834#true} is VALID [2022-04-08 12:13:40,421 INFO L290 TraceCheckUtils]: 31: Hoare triple {4834#true} assume !(0 == ~cond); {4834#true} is VALID [2022-04-08 12:13:40,421 INFO L290 TraceCheckUtils]: 32: Hoare triple {4834#true} assume true; {4834#true} is VALID [2022-04-08 12:13:40,422 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {4834#true} {4920#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #74#return; {4920#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-08 12:13:40,422 INFO L272 TraceCheckUtils]: 34: Hoare triple {4920#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {4834#true} is VALID [2022-04-08 12:13:40,422 INFO L290 TraceCheckUtils]: 35: Hoare triple {4834#true} ~cond := #in~cond; {4834#true} is VALID [2022-04-08 12:13:40,422 INFO L290 TraceCheckUtils]: 36: Hoare triple {4834#true} assume !(0 == ~cond); {4834#true} is VALID [2022-04-08 12:13:40,422 INFO L290 TraceCheckUtils]: 37: Hoare triple {4834#true} assume true; {4834#true} is VALID [2022-04-08 12:13:40,423 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {4834#true} {4920#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #76#return; {4920#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-08 12:13:40,423 INFO L272 TraceCheckUtils]: 39: Hoare triple {4920#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {4834#true} is VALID [2022-04-08 12:13:40,423 INFO L290 TraceCheckUtils]: 40: Hoare triple {4834#true} ~cond := #in~cond; {4834#true} is VALID [2022-04-08 12:13:40,423 INFO L290 TraceCheckUtils]: 41: Hoare triple {4834#true} assume !(0 == ~cond); {4834#true} is VALID [2022-04-08 12:13:40,423 INFO L290 TraceCheckUtils]: 42: Hoare triple {4834#true} assume true; {4834#true} is VALID [2022-04-08 12:13:40,424 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {4834#true} {4920#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #78#return; {4920#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-08 12:13:40,424 INFO L290 TraceCheckUtils]: 44: Hoare triple {4920#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !!(~a~0 != ~b~0); {4920#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-08 12:13:40,425 INFO L290 TraceCheckUtils]: 45: Hoare triple {4920#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !(~a~0 > ~b~0);~b~0 := ~b~0 - ~a~0;~q~0 := ~q~0 - ~p~0;~s~0 := ~s~0 - ~r~0; {4975#(and (= main_~s~0 1) (= (+ main_~y~0 (* (- 1) main_~b~0)) main_~x~0) (= (* (- 1) main_~q~0) 1))} is VALID [2022-04-08 12:13:40,425 INFO L290 TraceCheckUtils]: 46: Hoare triple {4975#(and (= main_~s~0 1) (= (+ main_~y~0 (* (- 1) main_~b~0)) main_~x~0) (= (* (- 1) main_~q~0) 1))} assume !false; {4975#(and (= main_~s~0 1) (= (+ main_~y~0 (* (- 1) main_~b~0)) main_~x~0) (= (* (- 1) main_~q~0) 1))} is VALID [2022-04-08 12:13:40,425 INFO L272 TraceCheckUtils]: 47: Hoare triple {4975#(and (= main_~s~0 1) (= (+ main_~y~0 (* (- 1) main_~b~0)) main_~x~0) (= (* (- 1) main_~q~0) 1))} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {4834#true} is VALID [2022-04-08 12:13:40,425 INFO L290 TraceCheckUtils]: 48: Hoare triple {4834#true} ~cond := #in~cond; {4834#true} is VALID [2022-04-08 12:13:40,425 INFO L290 TraceCheckUtils]: 49: Hoare triple {4834#true} assume !(0 == ~cond); {4834#true} is VALID [2022-04-08 12:13:40,425 INFO L290 TraceCheckUtils]: 50: Hoare triple {4834#true} assume true; {4834#true} is VALID [2022-04-08 12:13:40,426 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {4834#true} {4975#(and (= main_~s~0 1) (= (+ main_~y~0 (* (- 1) main_~b~0)) main_~x~0) (= (* (- 1) main_~q~0) 1))} #74#return; {4975#(and (= main_~s~0 1) (= (+ main_~y~0 (* (- 1) main_~b~0)) main_~x~0) (= (* (- 1) main_~q~0) 1))} is VALID [2022-04-08 12:13:40,426 INFO L272 TraceCheckUtils]: 52: Hoare triple {4975#(and (= main_~s~0 1) (= (+ main_~y~0 (* (- 1) main_~b~0)) main_~x~0) (= (* (- 1) main_~q~0) 1))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {4834#true} is VALID [2022-04-08 12:13:40,426 INFO L290 TraceCheckUtils]: 53: Hoare triple {4834#true} ~cond := #in~cond; {4834#true} is VALID [2022-04-08 12:13:40,426 INFO L290 TraceCheckUtils]: 54: Hoare triple {4834#true} assume !(0 == ~cond); {4834#true} is VALID [2022-04-08 12:13:40,426 INFO L290 TraceCheckUtils]: 55: Hoare triple {4834#true} assume true; {4834#true} is VALID [2022-04-08 12:13:40,427 INFO L284 TraceCheckUtils]: 56: Hoare quadruple {4834#true} {4975#(and (= main_~s~0 1) (= (+ main_~y~0 (* (- 1) main_~b~0)) main_~x~0) (= (* (- 1) main_~q~0) 1))} #76#return; {4975#(and (= main_~s~0 1) (= (+ main_~y~0 (* (- 1) main_~b~0)) main_~x~0) (= (* (- 1) main_~q~0) 1))} is VALID [2022-04-08 12:13:40,427 INFO L272 TraceCheckUtils]: 57: Hoare triple {4975#(and (= main_~s~0 1) (= (+ main_~y~0 (* (- 1) main_~b~0)) main_~x~0) (= (* (- 1) main_~q~0) 1))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {5012#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 12:13:40,428 INFO L290 TraceCheckUtils]: 58: Hoare triple {5012#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {5016#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 12:13:40,428 INFO L290 TraceCheckUtils]: 59: Hoare triple {5016#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4835#false} is VALID [2022-04-08 12:13:40,428 INFO L290 TraceCheckUtils]: 60: Hoare triple {4835#false} assume !false; {4835#false} is VALID [2022-04-08 12:13:40,428 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 10 proven. 4 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2022-04-08 12:13:40,428 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 12:13:40,646 INFO L290 TraceCheckUtils]: 60: Hoare triple {4835#false} assume !false; {4835#false} is VALID [2022-04-08 12:13:40,647 INFO L290 TraceCheckUtils]: 59: Hoare triple {5016#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4835#false} is VALID [2022-04-08 12:13:40,647 INFO L290 TraceCheckUtils]: 58: Hoare triple {5012#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {5016#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 12:13:40,648 INFO L272 TraceCheckUtils]: 57: Hoare triple {5032#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {5012#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 12:13:40,648 INFO L284 TraceCheckUtils]: 56: Hoare quadruple {4834#true} {5032#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} #76#return; {5032#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-08 12:13:40,648 INFO L290 TraceCheckUtils]: 55: Hoare triple {4834#true} assume true; {4834#true} is VALID [2022-04-08 12:13:40,648 INFO L290 TraceCheckUtils]: 54: Hoare triple {4834#true} assume !(0 == ~cond); {4834#true} is VALID [2022-04-08 12:13:40,648 INFO L290 TraceCheckUtils]: 53: Hoare triple {4834#true} ~cond := #in~cond; {4834#true} is VALID [2022-04-08 12:13:40,648 INFO L272 TraceCheckUtils]: 52: Hoare triple {5032#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {4834#true} is VALID [2022-04-08 12:13:40,649 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {4834#true} {5032#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} #74#return; {5032#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-08 12:13:40,649 INFO L290 TraceCheckUtils]: 50: Hoare triple {4834#true} assume true; {4834#true} is VALID [2022-04-08 12:13:40,649 INFO L290 TraceCheckUtils]: 49: Hoare triple {4834#true} assume !(0 == ~cond); {4834#true} is VALID [2022-04-08 12:13:40,649 INFO L290 TraceCheckUtils]: 48: Hoare triple {4834#true} ~cond := #in~cond; {4834#true} is VALID [2022-04-08 12:13:40,649 INFO L272 TraceCheckUtils]: 47: Hoare triple {5032#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {4834#true} is VALID [2022-04-08 12:13:40,649 INFO L290 TraceCheckUtils]: 46: Hoare triple {5032#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} assume !false; {5032#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-08 12:13:41,006 INFO L290 TraceCheckUtils]: 45: Hoare triple {5069#(= (+ (* (+ main_~s~0 (* (- 1) main_~r~0)) main_~y~0) (* main_~x~0 (+ main_~q~0 (* (- 1) main_~p~0)))) (+ (* (- 1) main_~a~0) main_~b~0))} assume !(~a~0 > ~b~0);~b~0 := ~b~0 - ~a~0;~q~0 := ~q~0 - ~p~0;~s~0 := ~s~0 - ~r~0; {5032#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-08 12:13:41,007 INFO L290 TraceCheckUtils]: 44: Hoare triple {5069#(= (+ (* (+ main_~s~0 (* (- 1) main_~r~0)) main_~y~0) (* main_~x~0 (+ main_~q~0 (* (- 1) main_~p~0)))) (+ (* (- 1) main_~a~0) main_~b~0))} assume !!(~a~0 != ~b~0); {5069#(= (+ (* (+ main_~s~0 (* (- 1) main_~r~0)) main_~y~0) (* main_~x~0 (+ main_~q~0 (* (- 1) main_~p~0)))) (+ (* (- 1) main_~a~0) main_~b~0))} is VALID [2022-04-08 12:13:41,008 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {4834#true} {5069#(= (+ (* (+ main_~s~0 (* (- 1) main_~r~0)) main_~y~0) (* main_~x~0 (+ main_~q~0 (* (- 1) main_~p~0)))) (+ (* (- 1) main_~a~0) main_~b~0))} #78#return; {5069#(= (+ (* (+ main_~s~0 (* (- 1) main_~r~0)) main_~y~0) (* main_~x~0 (+ main_~q~0 (* (- 1) main_~p~0)))) (+ (* (- 1) main_~a~0) main_~b~0))} is VALID [2022-04-08 12:13:41,008 INFO L290 TraceCheckUtils]: 42: Hoare triple {4834#true} assume true; {4834#true} is VALID [2022-04-08 12:13:41,008 INFO L290 TraceCheckUtils]: 41: Hoare triple {4834#true} assume !(0 == ~cond); {4834#true} is VALID [2022-04-08 12:13:41,008 INFO L290 TraceCheckUtils]: 40: Hoare triple {4834#true} ~cond := #in~cond; {4834#true} is VALID [2022-04-08 12:13:41,008 INFO L272 TraceCheckUtils]: 39: Hoare triple {5069#(= (+ (* (+ main_~s~0 (* (- 1) main_~r~0)) main_~y~0) (* main_~x~0 (+ main_~q~0 (* (- 1) main_~p~0)))) (+ (* (- 1) main_~a~0) main_~b~0))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {4834#true} is VALID [2022-04-08 12:13:41,009 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {4834#true} {5069#(= (+ (* (+ main_~s~0 (* (- 1) main_~r~0)) main_~y~0) (* main_~x~0 (+ main_~q~0 (* (- 1) main_~p~0)))) (+ (* (- 1) main_~a~0) main_~b~0))} #76#return; {5069#(= (+ (* (+ main_~s~0 (* (- 1) main_~r~0)) main_~y~0) (* main_~x~0 (+ main_~q~0 (* (- 1) main_~p~0)))) (+ (* (- 1) main_~a~0) main_~b~0))} is VALID [2022-04-08 12:13:41,009 INFO L290 TraceCheckUtils]: 37: Hoare triple {4834#true} assume true; {4834#true} is VALID [2022-04-08 12:13:41,009 INFO L290 TraceCheckUtils]: 36: Hoare triple {4834#true} assume !(0 == ~cond); {4834#true} is VALID [2022-04-08 12:13:41,009 INFO L290 TraceCheckUtils]: 35: Hoare triple {4834#true} ~cond := #in~cond; {4834#true} is VALID [2022-04-08 12:13:41,009 INFO L272 TraceCheckUtils]: 34: Hoare triple {5069#(= (+ (* (+ main_~s~0 (* (- 1) main_~r~0)) main_~y~0) (* main_~x~0 (+ main_~q~0 (* (- 1) main_~p~0)))) (+ (* (- 1) main_~a~0) main_~b~0))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {4834#true} is VALID [2022-04-08 12:13:41,010 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {4834#true} {5069#(= (+ (* (+ main_~s~0 (* (- 1) main_~r~0)) main_~y~0) (* main_~x~0 (+ main_~q~0 (* (- 1) main_~p~0)))) (+ (* (- 1) main_~a~0) main_~b~0))} #74#return; {5069#(= (+ (* (+ main_~s~0 (* (- 1) main_~r~0)) main_~y~0) (* main_~x~0 (+ main_~q~0 (* (- 1) main_~p~0)))) (+ (* (- 1) main_~a~0) main_~b~0))} is VALID [2022-04-08 12:13:41,010 INFO L290 TraceCheckUtils]: 32: Hoare triple {4834#true} assume true; {4834#true} is VALID [2022-04-08 12:13:41,010 INFO L290 TraceCheckUtils]: 31: Hoare triple {4834#true} assume !(0 == ~cond); {4834#true} is VALID [2022-04-08 12:13:41,010 INFO L290 TraceCheckUtils]: 30: Hoare triple {4834#true} ~cond := #in~cond; {4834#true} is VALID [2022-04-08 12:13:41,010 INFO L272 TraceCheckUtils]: 29: Hoare triple {5069#(= (+ (* (+ main_~s~0 (* (- 1) main_~r~0)) main_~y~0) (* main_~x~0 (+ main_~q~0 (* (- 1) main_~p~0)))) (+ (* (- 1) main_~a~0) main_~b~0))} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {4834#true} is VALID [2022-04-08 12:13:41,010 INFO L290 TraceCheckUtils]: 28: Hoare triple {5069#(= (+ (* (+ main_~s~0 (* (- 1) main_~r~0)) main_~y~0) (* main_~x~0 (+ main_~q~0 (* (- 1) main_~p~0)))) (+ (* (- 1) main_~a~0) main_~b~0))} assume !false; {5069#(= (+ (* (+ main_~s~0 (* (- 1) main_~r~0)) main_~y~0) (* main_~x~0 (+ main_~q~0 (* (- 1) main_~p~0)))) (+ (* (- 1) main_~a~0) main_~b~0))} is VALID [2022-04-08 12:13:41,010 INFO L290 TraceCheckUtils]: 27: Hoare triple {4834#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {5069#(= (+ (* (+ main_~s~0 (* (- 1) main_~r~0)) main_~y~0) (* main_~x~0 (+ main_~q~0 (* (- 1) main_~p~0)))) (+ (* (- 1) main_~a~0) main_~b~0))} is VALID [2022-04-08 12:13:41,011 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {4834#true} {4834#true} #72#return; {4834#true} is VALID [2022-04-08 12:13:41,011 INFO L290 TraceCheckUtils]: 25: Hoare triple {4834#true} assume true; {4834#true} is VALID [2022-04-08 12:13:41,011 INFO L290 TraceCheckUtils]: 24: Hoare triple {4834#true} assume !(0 == ~cond); {4834#true} is VALID [2022-04-08 12:13:41,011 INFO L290 TraceCheckUtils]: 23: Hoare triple {4834#true} ~cond := #in~cond; {4834#true} is VALID [2022-04-08 12:13:41,011 INFO L272 TraceCheckUtils]: 22: Hoare triple {4834#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {4834#true} is VALID [2022-04-08 12:13:41,011 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {4834#true} {4834#true} #70#return; {4834#true} is VALID [2022-04-08 12:13:41,011 INFO L290 TraceCheckUtils]: 20: Hoare triple {4834#true} assume true; {4834#true} is VALID [2022-04-08 12:13:41,011 INFO L290 TraceCheckUtils]: 19: Hoare triple {4834#true} assume !(0 == ~cond); {4834#true} is VALID [2022-04-08 12:13:41,011 INFO L290 TraceCheckUtils]: 18: Hoare triple {4834#true} ~cond := #in~cond; {4834#true} is VALID [2022-04-08 12:13:41,011 INFO L272 TraceCheckUtils]: 17: Hoare triple {4834#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {4834#true} is VALID [2022-04-08 12:13:41,011 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {4834#true} {4834#true} #68#return; {4834#true} is VALID [2022-04-08 12:13:41,011 INFO L290 TraceCheckUtils]: 15: Hoare triple {4834#true} assume true; {4834#true} is VALID [2022-04-08 12:13:41,011 INFO L290 TraceCheckUtils]: 14: Hoare triple {4834#true} assume !(0 == ~cond); {4834#true} is VALID [2022-04-08 12:13:41,011 INFO L290 TraceCheckUtils]: 13: Hoare triple {4834#true} ~cond := #in~cond; {4834#true} is VALID [2022-04-08 12:13:41,011 INFO L272 TraceCheckUtils]: 12: Hoare triple {4834#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 5 then 1 else 0)); {4834#true} is VALID [2022-04-08 12:13:41,011 INFO L290 TraceCheckUtils]: 11: Hoare triple {4834#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {4834#true} is VALID [2022-04-08 12:13:41,011 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4834#true} {4834#true} #66#return; {4834#true} is VALID [2022-04-08 12:13:41,012 INFO L290 TraceCheckUtils]: 9: Hoare triple {4834#true} assume true; {4834#true} is VALID [2022-04-08 12:13:41,012 INFO L290 TraceCheckUtils]: 8: Hoare triple {4834#true} assume !(0 == ~cond); {4834#true} is VALID [2022-04-08 12:13:41,012 INFO L290 TraceCheckUtils]: 7: Hoare triple {4834#true} ~cond := #in~cond; {4834#true} is VALID [2022-04-08 12:13:41,012 INFO L272 TraceCheckUtils]: 6: Hoare triple {4834#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 5 then 1 else 0)); {4834#true} is VALID [2022-04-08 12:13:41,012 INFO L290 TraceCheckUtils]: 5: Hoare triple {4834#true} havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~x~0;havoc ~y~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {4834#true} is VALID [2022-04-08 12:13:41,012 INFO L272 TraceCheckUtils]: 4: Hoare triple {4834#true} call #t~ret6 := main(); {4834#true} is VALID [2022-04-08 12:13:41,012 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4834#true} {4834#true} #88#return; {4834#true} is VALID [2022-04-08 12:13:41,012 INFO L290 TraceCheckUtils]: 2: Hoare triple {4834#true} assume true; {4834#true} is VALID [2022-04-08 12:13:41,012 INFO L290 TraceCheckUtils]: 1: Hoare triple {4834#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(10, 2);call #Ultimate.allocInit(12, 3); {4834#true} is VALID [2022-04-08 12:13:41,012 INFO L272 TraceCheckUtils]: 0: Hoare triple {4834#true} call ULTIMATE.init(); {4834#true} is VALID [2022-04-08 12:13:41,012 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 10 proven. 4 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2022-04-08 12:13:41,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 12:13:41,012 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1978682782] [2022-04-08 12:13:41,013 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 12:13:41,013 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1644146910] [2022-04-08 12:13:41,013 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1644146910] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 12:13:41,013 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 12:13:41,013 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2022-04-08 12:13:41,013 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 12:13:41,013 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1674953180] [2022-04-08 12:13:41,013 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1674953180] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 12:13:41,013 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 12:13:41,013 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 12:13:41,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1587920316] [2022-04-08 12:13:41,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 12:13:41,015 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 3 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 61 [2022-04-08 12:13:41,015 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 12:13:41,015 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 3 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2022-04-08 12:13:41,045 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 12:13:41,045 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-08 12:13:41,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 12:13:41,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-08 12:13:41,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-04-08 12:13:41,046 INFO L87 Difference]: Start difference. First operand 112 states and 138 transitions. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 3 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2022-04-08 12:13:41,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:13:41,904 INFO L93 Difference]: Finished difference Result 137 states and 178 transitions. [2022-04-08 12:13:41,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-08 12:13:41,905 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 3 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 61 [2022-04-08 12:13:41,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 12:13:41,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 3 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2022-04-08 12:13:41,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 75 transitions. [2022-04-08 12:13:41,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 3 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2022-04-08 12:13:41,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 75 transitions. [2022-04-08 12:13:41,913 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 75 transitions. [2022-04-08 12:13:41,973 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 12:13:41,975 INFO L225 Difference]: With dead ends: 137 [2022-04-08 12:13:41,975 INFO L226 Difference]: Without dead ends: 131 [2022-04-08 12:13:41,976 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 114 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2022-04-08 12:13:41,976 INFO L913 BasicCegarLoop]: 45 mSDtfsCounter, 8 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-08 12:13:41,976 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 160 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-08 12:13:41,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2022-04-08 12:13:42,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2022-04-08 12:13:42,048 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 12:13:42,051 INFO L82 GeneralOperation]: Start isEquivalent. First operand 131 states. Second operand has 131 states, 73 states have (on average 1.178082191780822) internal successors, (86), 77 states have internal predecessors, (86), 42 states have call successors, (42), 16 states have call predecessors, (42), 15 states have return successors, (39), 37 states have call predecessors, (39), 39 states have call successors, (39) [2022-04-08 12:13:42,052 INFO L74 IsIncluded]: Start isIncluded. First operand 131 states. Second operand has 131 states, 73 states have (on average 1.178082191780822) internal successors, (86), 77 states have internal predecessors, (86), 42 states have call successors, (42), 16 states have call predecessors, (42), 15 states have return successors, (39), 37 states have call predecessors, (39), 39 states have call successors, (39) [2022-04-08 12:13:42,052 INFO L87 Difference]: Start difference. First operand 131 states. Second operand has 131 states, 73 states have (on average 1.178082191780822) internal successors, (86), 77 states have internal predecessors, (86), 42 states have call successors, (42), 16 states have call predecessors, (42), 15 states have return successors, (39), 37 states have call predecessors, (39), 39 states have call successors, (39) [2022-04-08 12:13:42,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:13:42,057 INFO L93 Difference]: Finished difference Result 131 states and 167 transitions. [2022-04-08 12:13:42,057 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 167 transitions. [2022-04-08 12:13:42,057 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:13:42,057 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 12:13:42,057 INFO L74 IsIncluded]: Start isIncluded. First operand has 131 states, 73 states have (on average 1.178082191780822) internal successors, (86), 77 states have internal predecessors, (86), 42 states have call successors, (42), 16 states have call predecessors, (42), 15 states have return successors, (39), 37 states have call predecessors, (39), 39 states have call successors, (39) Second operand 131 states. [2022-04-08 12:13:42,058 INFO L87 Difference]: Start difference. First operand has 131 states, 73 states have (on average 1.178082191780822) internal successors, (86), 77 states have internal predecessors, (86), 42 states have call successors, (42), 16 states have call predecessors, (42), 15 states have return successors, (39), 37 states have call predecessors, (39), 39 states have call successors, (39) Second operand 131 states. [2022-04-08 12:13:42,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:13:42,062 INFO L93 Difference]: Finished difference Result 131 states and 167 transitions. [2022-04-08 12:13:42,062 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 167 transitions. [2022-04-08 12:13:42,062 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:13:42,062 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 12:13:42,062 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 12:13:42,062 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 12:13:42,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 73 states have (on average 1.178082191780822) internal successors, (86), 77 states have internal predecessors, (86), 42 states have call successors, (42), 16 states have call predecessors, (42), 15 states have return successors, (39), 37 states have call predecessors, (39), 39 states have call successors, (39) [2022-04-08 12:13:42,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 167 transitions. [2022-04-08 12:13:42,065 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 167 transitions. Word has length 61 [2022-04-08 12:13:42,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 12:13:42,066 INFO L478 AbstractCegarLoop]: Abstraction has 131 states and 167 transitions. [2022-04-08 12:13:42,066 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 3 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2022-04-08 12:13:42,066 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 131 states and 167 transitions. [2022-04-08 12:13:42,267 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 167 edges. 167 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 12:13:42,267 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 167 transitions. [2022-04-08 12:13:42,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-04-08 12:13:42,267 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 12:13:42,268 INFO L499 BasicCegarLoop]: trace histogram [7, 6, 6, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 12:13:42,286 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 12:13:42,468 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 12:13:42,468 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 12:13:42,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 12:13:42,469 INFO L85 PathProgramCache]: Analyzing trace with hash 2064127436, now seen corresponding path program 1 times [2022-04-08 12:13:42,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 12:13:42,469 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1433654179] [2022-04-08 12:13:42,469 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 12:13:42,469 INFO L85 PathProgramCache]: Analyzing trace with hash 2064127436, now seen corresponding path program 2 times [2022-04-08 12:13:42,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 12:13:42,469 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1316993341] [2022-04-08 12:13:42,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 12:13:42,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 12:13:42,480 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 12:13:42,481 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [785383595] [2022-04-08 12:13:42,481 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 12:13:42,481 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 12:13:42,481 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 12:13:42,488 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 12:13:42,489 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 12:13:42,553 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 12:13:42,554 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 12:13:42,554 INFO L263 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 19 conjunts are in the unsatisfiable core [2022-04-08 12:13:42,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 12:13:42,566 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 12:13:42,962 INFO L272 TraceCheckUtils]: 0: Hoare triple {6007#true} call ULTIMATE.init(); {6007#true} is VALID [2022-04-08 12:13:42,962 INFO L290 TraceCheckUtils]: 1: Hoare triple {6007#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(10, 2);call #Ultimate.allocInit(12, 3); {6007#true} is VALID [2022-04-08 12:13:42,962 INFO L290 TraceCheckUtils]: 2: Hoare triple {6007#true} assume true; {6007#true} is VALID [2022-04-08 12:13:42,962 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6007#true} {6007#true} #88#return; {6007#true} is VALID [2022-04-08 12:13:42,962 INFO L272 TraceCheckUtils]: 4: Hoare triple {6007#true} call #t~ret6 := main(); {6007#true} is VALID [2022-04-08 12:13:42,962 INFO L290 TraceCheckUtils]: 5: Hoare triple {6007#true} havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~x~0;havoc ~y~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {6007#true} is VALID [2022-04-08 12:13:42,962 INFO L272 TraceCheckUtils]: 6: Hoare triple {6007#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 5 then 1 else 0)); {6007#true} is VALID [2022-04-08 12:13:42,962 INFO L290 TraceCheckUtils]: 7: Hoare triple {6007#true} ~cond := #in~cond; {6007#true} is VALID [2022-04-08 12:13:42,963 INFO L290 TraceCheckUtils]: 8: Hoare triple {6007#true} assume !(0 == ~cond); {6007#true} is VALID [2022-04-08 12:13:42,963 INFO L290 TraceCheckUtils]: 9: Hoare triple {6007#true} assume true; {6007#true} is VALID [2022-04-08 12:13:42,963 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {6007#true} {6007#true} #66#return; {6007#true} is VALID [2022-04-08 12:13:42,963 INFO L290 TraceCheckUtils]: 11: Hoare triple {6007#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {6007#true} is VALID [2022-04-08 12:13:42,963 INFO L272 TraceCheckUtils]: 12: Hoare triple {6007#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 5 then 1 else 0)); {6007#true} is VALID [2022-04-08 12:13:42,963 INFO L290 TraceCheckUtils]: 13: Hoare triple {6007#true} ~cond := #in~cond; {6007#true} is VALID [2022-04-08 12:13:42,963 INFO L290 TraceCheckUtils]: 14: Hoare triple {6007#true} assume !(0 == ~cond); {6007#true} is VALID [2022-04-08 12:13:42,963 INFO L290 TraceCheckUtils]: 15: Hoare triple {6007#true} assume true; {6007#true} is VALID [2022-04-08 12:13:42,963 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {6007#true} {6007#true} #68#return; {6007#true} is VALID [2022-04-08 12:13:42,963 INFO L272 TraceCheckUtils]: 17: Hoare triple {6007#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {6007#true} is VALID [2022-04-08 12:13:42,963 INFO L290 TraceCheckUtils]: 18: Hoare triple {6007#true} ~cond := #in~cond; {6007#true} is VALID [2022-04-08 12:13:42,963 INFO L290 TraceCheckUtils]: 19: Hoare triple {6007#true} assume !(0 == ~cond); {6007#true} is VALID [2022-04-08 12:13:42,963 INFO L290 TraceCheckUtils]: 20: Hoare triple {6007#true} assume true; {6007#true} is VALID [2022-04-08 12:13:42,963 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {6007#true} {6007#true} #70#return; {6007#true} is VALID [2022-04-08 12:13:42,963 INFO L272 TraceCheckUtils]: 22: Hoare triple {6007#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {6007#true} is VALID [2022-04-08 12:13:42,963 INFO L290 TraceCheckUtils]: 23: Hoare triple {6007#true} ~cond := #in~cond; {6007#true} is VALID [2022-04-08 12:13:42,963 INFO L290 TraceCheckUtils]: 24: Hoare triple {6007#true} assume !(0 == ~cond); {6007#true} is VALID [2022-04-08 12:13:42,963 INFO L290 TraceCheckUtils]: 25: Hoare triple {6007#true} assume true; {6007#true} is VALID [2022-04-08 12:13:42,964 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {6007#true} {6007#true} #72#return; {6007#true} is VALID [2022-04-08 12:13:42,964 INFO L290 TraceCheckUtils]: 27: Hoare triple {6007#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {6093#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-08 12:13:42,964 INFO L290 TraceCheckUtils]: 28: Hoare triple {6093#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} assume !false; {6093#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-08 12:13:42,964 INFO L272 TraceCheckUtils]: 29: Hoare triple {6093#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {6007#true} is VALID [2022-04-08 12:13:42,964 INFO L290 TraceCheckUtils]: 30: Hoare triple {6007#true} ~cond := #in~cond; {6007#true} is VALID [2022-04-08 12:13:42,964 INFO L290 TraceCheckUtils]: 31: Hoare triple {6007#true} assume !(0 == ~cond); {6007#true} is VALID [2022-04-08 12:13:42,964 INFO L290 TraceCheckUtils]: 32: Hoare triple {6007#true} assume true; {6007#true} is VALID [2022-04-08 12:13:42,965 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {6007#true} {6093#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} #74#return; {6093#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-08 12:13:42,965 INFO L272 TraceCheckUtils]: 34: Hoare triple {6093#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {6007#true} is VALID [2022-04-08 12:13:42,965 INFO L290 TraceCheckUtils]: 35: Hoare triple {6007#true} ~cond := #in~cond; {6007#true} is VALID [2022-04-08 12:13:42,965 INFO L290 TraceCheckUtils]: 36: Hoare triple {6007#true} assume !(0 == ~cond); {6007#true} is VALID [2022-04-08 12:13:42,966 INFO L290 TraceCheckUtils]: 37: Hoare triple {6007#true} assume true; {6007#true} is VALID [2022-04-08 12:13:42,987 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {6007#true} {6093#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} #76#return; {6093#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-08 12:13:42,987 INFO L272 TraceCheckUtils]: 39: Hoare triple {6093#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {6007#true} is VALID [2022-04-08 12:13:42,987 INFO L290 TraceCheckUtils]: 40: Hoare triple {6007#true} ~cond := #in~cond; {6007#true} is VALID [2022-04-08 12:13:42,987 INFO L290 TraceCheckUtils]: 41: Hoare triple {6007#true} assume !(0 == ~cond); {6007#true} is VALID [2022-04-08 12:13:42,987 INFO L290 TraceCheckUtils]: 42: Hoare triple {6007#true} assume true; {6007#true} is VALID [2022-04-08 12:13:42,988 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {6007#true} {6093#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} #78#return; {6093#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-08 12:13:42,988 INFO L290 TraceCheckUtils]: 44: Hoare triple {6093#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} assume !!(~a~0 != ~b~0); {6093#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-08 12:13:42,989 INFO L290 TraceCheckUtils]: 45: Hoare triple {6093#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} assume ~a~0 > ~b~0;~a~0 := ~a~0 - ~b~0;~p~0 := ~p~0 - ~q~0;~r~0 := ~r~0 - ~s~0; {6148#(and (= main_~s~0 1) (= main_~p~0 (+ (* (- 1) main_~q~0) 1)) (= main_~r~0 (* (- 1) main_~s~0)) (= main_~q~0 0))} is VALID [2022-04-08 12:13:42,989 INFO L290 TraceCheckUtils]: 46: Hoare triple {6148#(and (= main_~s~0 1) (= main_~p~0 (+ (* (- 1) main_~q~0) 1)) (= main_~r~0 (* (- 1) main_~s~0)) (= main_~q~0 0))} assume !false; {6148#(and (= main_~s~0 1) (= main_~p~0 (+ (* (- 1) main_~q~0) 1)) (= main_~r~0 (* (- 1) main_~s~0)) (= main_~q~0 0))} is VALID [2022-04-08 12:13:42,989 INFO L272 TraceCheckUtils]: 47: Hoare triple {6148#(and (= main_~s~0 1) (= main_~p~0 (+ (* (- 1) main_~q~0) 1)) (= main_~r~0 (* (- 1) main_~s~0)) (= main_~q~0 0))} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {6007#true} is VALID [2022-04-08 12:13:42,989 INFO L290 TraceCheckUtils]: 48: Hoare triple {6007#true} ~cond := #in~cond; {6007#true} is VALID [2022-04-08 12:13:42,989 INFO L290 TraceCheckUtils]: 49: Hoare triple {6007#true} assume !(0 == ~cond); {6007#true} is VALID [2022-04-08 12:13:42,989 INFO L290 TraceCheckUtils]: 50: Hoare triple {6007#true} assume true; {6007#true} is VALID [2022-04-08 12:13:42,990 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {6007#true} {6148#(and (= main_~s~0 1) (= main_~p~0 (+ (* (- 1) main_~q~0) 1)) (= main_~r~0 (* (- 1) main_~s~0)) (= main_~q~0 0))} #74#return; {6148#(and (= main_~s~0 1) (= main_~p~0 (+ (* (- 1) main_~q~0) 1)) (= main_~r~0 (* (- 1) main_~s~0)) (= main_~q~0 0))} is VALID [2022-04-08 12:13:42,990 INFO L272 TraceCheckUtils]: 52: Hoare triple {6148#(and (= main_~s~0 1) (= main_~p~0 (+ (* (- 1) main_~q~0) 1)) (= main_~r~0 (* (- 1) main_~s~0)) (= main_~q~0 0))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {6007#true} is VALID [2022-04-08 12:13:42,990 INFO L290 TraceCheckUtils]: 53: Hoare triple {6007#true} ~cond := #in~cond; {6007#true} is VALID [2022-04-08 12:13:42,990 INFO L290 TraceCheckUtils]: 54: Hoare triple {6007#true} assume !(0 == ~cond); {6007#true} is VALID [2022-04-08 12:13:42,990 INFO L290 TraceCheckUtils]: 55: Hoare triple {6007#true} assume true; {6007#true} is VALID [2022-04-08 12:13:42,991 INFO L284 TraceCheckUtils]: 56: Hoare quadruple {6007#true} {6148#(and (= main_~s~0 1) (= main_~p~0 (+ (* (- 1) main_~q~0) 1)) (= main_~r~0 (* (- 1) main_~s~0)) (= main_~q~0 0))} #76#return; {6148#(and (= main_~s~0 1) (= main_~p~0 (+ (* (- 1) main_~q~0) 1)) (= main_~r~0 (* (- 1) main_~s~0)) (= main_~q~0 0))} is VALID [2022-04-08 12:13:42,991 INFO L272 TraceCheckUtils]: 57: Hoare triple {6148#(and (= main_~s~0 1) (= main_~p~0 (+ (* (- 1) main_~q~0) 1)) (= main_~r~0 (* (- 1) main_~s~0)) (= main_~q~0 0))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {6007#true} is VALID [2022-04-08 12:13:42,991 INFO L290 TraceCheckUtils]: 58: Hoare triple {6007#true} ~cond := #in~cond; {6007#true} is VALID [2022-04-08 12:13:42,991 INFO L290 TraceCheckUtils]: 59: Hoare triple {6007#true} assume !(0 == ~cond); {6007#true} is VALID [2022-04-08 12:13:42,991 INFO L290 TraceCheckUtils]: 60: Hoare triple {6007#true} assume true; {6007#true} is VALID [2022-04-08 12:13:42,991 INFO L284 TraceCheckUtils]: 61: Hoare quadruple {6007#true} {6148#(and (= main_~s~0 1) (= main_~p~0 (+ (* (- 1) main_~q~0) 1)) (= main_~r~0 (* (- 1) main_~s~0)) (= main_~q~0 0))} #78#return; {6148#(and (= main_~s~0 1) (= main_~p~0 (+ (* (- 1) main_~q~0) 1)) (= main_~r~0 (* (- 1) main_~s~0)) (= main_~q~0 0))} is VALID [2022-04-08 12:13:42,992 INFO L290 TraceCheckUtils]: 62: Hoare triple {6148#(and (= main_~s~0 1) (= main_~p~0 (+ (* (- 1) main_~q~0) 1)) (= main_~r~0 (* (- 1) main_~s~0)) (= main_~q~0 0))} assume !!(~a~0 != ~b~0); {6148#(and (= main_~s~0 1) (= main_~p~0 (+ (* (- 1) main_~q~0) 1)) (= main_~r~0 (* (- 1) main_~s~0)) (= main_~q~0 0))} is VALID [2022-04-08 12:13:42,992 INFO L290 TraceCheckUtils]: 63: Hoare triple {6148#(and (= main_~s~0 1) (= main_~p~0 (+ (* (- 1) main_~q~0) 1)) (= main_~r~0 (* (- 1) main_~s~0)) (= main_~q~0 0))} assume !(~a~0 > ~b~0);~b~0 := ~b~0 - ~a~0;~q~0 := ~q~0 - ~p~0;~s~0 := ~s~0 - ~r~0; {6203#(and (= (+ (* (- 1) main_~r~0) 1) main_~s~0) (= (- 1) main_~r~0) (= main_~q~0 (* (- 1) main_~p~0)) (= main_~p~0 1))} is VALID [2022-04-08 12:13:42,993 INFO L290 TraceCheckUtils]: 64: Hoare triple {6203#(and (= (+ (* (- 1) main_~r~0) 1) main_~s~0) (= (- 1) main_~r~0) (= main_~q~0 (* (- 1) main_~p~0)) (= main_~p~0 1))} assume !false; {6203#(and (= (+ (* (- 1) main_~r~0) 1) main_~s~0) (= (- 1) main_~r~0) (= main_~q~0 (* (- 1) main_~p~0)) (= main_~p~0 1))} is VALID [2022-04-08 12:13:42,993 INFO L272 TraceCheckUtils]: 65: Hoare triple {6203#(and (= (+ (* (- 1) main_~r~0) 1) main_~s~0) (= (- 1) main_~r~0) (= main_~q~0 (* (- 1) main_~p~0)) (= main_~p~0 1))} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {6210#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 12:13:42,993 INFO L290 TraceCheckUtils]: 66: Hoare triple {6210#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {6214#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 12:13:42,994 INFO L290 TraceCheckUtils]: 67: Hoare triple {6214#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {6008#false} is VALID [2022-04-08 12:13:42,994 INFO L290 TraceCheckUtils]: 68: Hoare triple {6008#false} assume !false; {6008#false} is VALID [2022-04-08 12:13:42,994 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 12 proven. 10 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2022-04-08 12:13:42,994 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 12:13:43,337 INFO L290 TraceCheckUtils]: 68: Hoare triple {6008#false} assume !false; {6008#false} is VALID [2022-04-08 12:13:43,339 INFO L290 TraceCheckUtils]: 67: Hoare triple {6214#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {6008#false} is VALID [2022-04-08 12:13:43,339 INFO L290 TraceCheckUtils]: 66: Hoare triple {6210#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {6214#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 12:13:43,340 INFO L272 TraceCheckUtils]: 65: Hoare triple {6230#(= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1))} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {6210#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 12:13:43,340 INFO L290 TraceCheckUtils]: 64: Hoare triple {6230#(= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1))} assume !false; {6230#(= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1))} is VALID [2022-04-08 12:13:43,342 INFO L290 TraceCheckUtils]: 63: Hoare triple {6230#(= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1))} assume !(~a~0 > ~b~0);~b~0 := ~b~0 - ~a~0;~q~0 := ~q~0 - ~p~0;~s~0 := ~s~0 - ~r~0; {6230#(= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1))} is VALID [2022-04-08 12:13:43,343 INFO L290 TraceCheckUtils]: 62: Hoare triple {6230#(= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1))} assume !!(~a~0 != ~b~0); {6230#(= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1))} is VALID [2022-04-08 12:13:43,343 INFO L284 TraceCheckUtils]: 61: Hoare quadruple {6007#true} {6230#(= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1))} #78#return; {6230#(= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1))} is VALID [2022-04-08 12:13:43,343 INFO L290 TraceCheckUtils]: 60: Hoare triple {6007#true} assume true; {6007#true} is VALID [2022-04-08 12:13:43,343 INFO L290 TraceCheckUtils]: 59: Hoare triple {6007#true} assume !(0 == ~cond); {6007#true} is VALID [2022-04-08 12:13:43,343 INFO L290 TraceCheckUtils]: 58: Hoare triple {6007#true} ~cond := #in~cond; {6007#true} is VALID [2022-04-08 12:13:43,343 INFO L272 TraceCheckUtils]: 57: Hoare triple {6230#(= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {6007#true} is VALID [2022-04-08 12:13:43,344 INFO L284 TraceCheckUtils]: 56: Hoare quadruple {6007#true} {6230#(= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1))} #76#return; {6230#(= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1))} is VALID [2022-04-08 12:13:43,344 INFO L290 TraceCheckUtils]: 55: Hoare triple {6007#true} assume true; {6007#true} is VALID [2022-04-08 12:13:43,344 INFO L290 TraceCheckUtils]: 54: Hoare triple {6007#true} assume !(0 == ~cond); {6007#true} is VALID [2022-04-08 12:13:43,344 INFO L290 TraceCheckUtils]: 53: Hoare triple {6007#true} ~cond := #in~cond; {6007#true} is VALID [2022-04-08 12:13:43,344 INFO L272 TraceCheckUtils]: 52: Hoare triple {6230#(= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {6007#true} is VALID [2022-04-08 12:13:43,345 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {6007#true} {6230#(= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1))} #74#return; {6230#(= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1))} is VALID [2022-04-08 12:13:43,345 INFO L290 TraceCheckUtils]: 50: Hoare triple {6007#true} assume true; {6007#true} is VALID [2022-04-08 12:13:43,345 INFO L290 TraceCheckUtils]: 49: Hoare triple {6007#true} assume !(0 == ~cond); {6007#true} is VALID [2022-04-08 12:13:43,345 INFO L290 TraceCheckUtils]: 48: Hoare triple {6007#true} ~cond := #in~cond; {6007#true} is VALID [2022-04-08 12:13:43,345 INFO L272 TraceCheckUtils]: 47: Hoare triple {6230#(= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1))} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {6007#true} is VALID [2022-04-08 12:13:43,345 INFO L290 TraceCheckUtils]: 46: Hoare triple {6230#(= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1))} assume !false; {6230#(= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1))} is VALID [2022-04-08 12:13:43,347 INFO L290 TraceCheckUtils]: 45: Hoare triple {6230#(= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1))} assume ~a~0 > ~b~0;~a~0 := ~a~0 - ~b~0;~p~0 := ~p~0 - ~q~0;~r~0 := ~r~0 - ~s~0; {6230#(= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1))} is VALID [2022-04-08 12:13:43,347 INFO L290 TraceCheckUtils]: 44: Hoare triple {6230#(= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1))} assume !!(~a~0 != ~b~0); {6230#(= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1))} is VALID [2022-04-08 12:13:43,348 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {6007#true} {6230#(= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1))} #78#return; {6230#(= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1))} is VALID [2022-04-08 12:13:43,348 INFO L290 TraceCheckUtils]: 42: Hoare triple {6007#true} assume true; {6007#true} is VALID [2022-04-08 12:13:43,348 INFO L290 TraceCheckUtils]: 41: Hoare triple {6007#true} assume !(0 == ~cond); {6007#true} is VALID [2022-04-08 12:13:43,348 INFO L290 TraceCheckUtils]: 40: Hoare triple {6007#true} ~cond := #in~cond; {6007#true} is VALID [2022-04-08 12:13:43,348 INFO L272 TraceCheckUtils]: 39: Hoare triple {6230#(= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {6007#true} is VALID [2022-04-08 12:13:43,359 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {6007#true} {6230#(= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1))} #76#return; {6230#(= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1))} is VALID [2022-04-08 12:13:43,359 INFO L290 TraceCheckUtils]: 37: Hoare triple {6007#true} assume true; {6007#true} is VALID [2022-04-08 12:13:43,359 INFO L290 TraceCheckUtils]: 36: Hoare triple {6007#true} assume !(0 == ~cond); {6007#true} is VALID [2022-04-08 12:13:43,359 INFO L290 TraceCheckUtils]: 35: Hoare triple {6007#true} ~cond := #in~cond; {6007#true} is VALID [2022-04-08 12:13:43,359 INFO L272 TraceCheckUtils]: 34: Hoare triple {6230#(= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {6007#true} is VALID [2022-04-08 12:13:43,360 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {6007#true} {6230#(= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1))} #74#return; {6230#(= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1))} is VALID [2022-04-08 12:13:43,360 INFO L290 TraceCheckUtils]: 32: Hoare triple {6007#true} assume true; {6007#true} is VALID [2022-04-08 12:13:43,360 INFO L290 TraceCheckUtils]: 31: Hoare triple {6007#true} assume !(0 == ~cond); {6007#true} is VALID [2022-04-08 12:13:43,360 INFO L290 TraceCheckUtils]: 30: Hoare triple {6007#true} ~cond := #in~cond; {6007#true} is VALID [2022-04-08 12:13:43,360 INFO L272 TraceCheckUtils]: 29: Hoare triple {6230#(= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1))} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {6007#true} is VALID [2022-04-08 12:13:43,360 INFO L290 TraceCheckUtils]: 28: Hoare triple {6230#(= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1))} assume !false; {6230#(= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1))} is VALID [2022-04-08 12:13:43,360 INFO L290 TraceCheckUtils]: 27: Hoare triple {6007#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {6230#(= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1))} is VALID [2022-04-08 12:13:43,361 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {6007#true} {6007#true} #72#return; {6007#true} is VALID [2022-04-08 12:13:43,361 INFO L290 TraceCheckUtils]: 25: Hoare triple {6007#true} assume true; {6007#true} is VALID [2022-04-08 12:13:43,361 INFO L290 TraceCheckUtils]: 24: Hoare triple {6007#true} assume !(0 == ~cond); {6007#true} is VALID [2022-04-08 12:13:43,361 INFO L290 TraceCheckUtils]: 23: Hoare triple {6007#true} ~cond := #in~cond; {6007#true} is VALID [2022-04-08 12:13:43,361 INFO L272 TraceCheckUtils]: 22: Hoare triple {6007#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {6007#true} is VALID [2022-04-08 12:13:43,361 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {6007#true} {6007#true} #70#return; {6007#true} is VALID [2022-04-08 12:13:43,361 INFO L290 TraceCheckUtils]: 20: Hoare triple {6007#true} assume true; {6007#true} is VALID [2022-04-08 12:13:43,361 INFO L290 TraceCheckUtils]: 19: Hoare triple {6007#true} assume !(0 == ~cond); {6007#true} is VALID [2022-04-08 12:13:43,361 INFO L290 TraceCheckUtils]: 18: Hoare triple {6007#true} ~cond := #in~cond; {6007#true} is VALID [2022-04-08 12:13:43,361 INFO L272 TraceCheckUtils]: 17: Hoare triple {6007#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {6007#true} is VALID [2022-04-08 12:13:43,361 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {6007#true} {6007#true} #68#return; {6007#true} is VALID [2022-04-08 12:13:43,361 INFO L290 TraceCheckUtils]: 15: Hoare triple {6007#true} assume true; {6007#true} is VALID [2022-04-08 12:13:43,361 INFO L290 TraceCheckUtils]: 14: Hoare triple {6007#true} assume !(0 == ~cond); {6007#true} is VALID [2022-04-08 12:13:43,361 INFO L290 TraceCheckUtils]: 13: Hoare triple {6007#true} ~cond := #in~cond; {6007#true} is VALID [2022-04-08 12:13:43,361 INFO L272 TraceCheckUtils]: 12: Hoare triple {6007#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 5 then 1 else 0)); {6007#true} is VALID [2022-04-08 12:13:43,361 INFO L290 TraceCheckUtils]: 11: Hoare triple {6007#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {6007#true} is VALID [2022-04-08 12:13:43,361 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {6007#true} {6007#true} #66#return; {6007#true} is VALID [2022-04-08 12:13:43,361 INFO L290 TraceCheckUtils]: 9: Hoare triple {6007#true} assume true; {6007#true} is VALID [2022-04-08 12:13:43,362 INFO L290 TraceCheckUtils]: 8: Hoare triple {6007#true} assume !(0 == ~cond); {6007#true} is VALID [2022-04-08 12:13:43,362 INFO L290 TraceCheckUtils]: 7: Hoare triple {6007#true} ~cond := #in~cond; {6007#true} is VALID [2022-04-08 12:13:43,362 INFO L272 TraceCheckUtils]: 6: Hoare triple {6007#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 5 then 1 else 0)); {6007#true} is VALID [2022-04-08 12:13:43,362 INFO L290 TraceCheckUtils]: 5: Hoare triple {6007#true} havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~x~0;havoc ~y~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {6007#true} is VALID [2022-04-08 12:13:43,362 INFO L272 TraceCheckUtils]: 4: Hoare triple {6007#true} call #t~ret6 := main(); {6007#true} is VALID [2022-04-08 12:13:43,362 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6007#true} {6007#true} #88#return; {6007#true} is VALID [2022-04-08 12:13:43,362 INFO L290 TraceCheckUtils]: 2: Hoare triple {6007#true} assume true; {6007#true} is VALID [2022-04-08 12:13:43,362 INFO L290 TraceCheckUtils]: 1: Hoare triple {6007#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(10, 2);call #Ultimate.allocInit(12, 3); {6007#true} is VALID [2022-04-08 12:13:43,362 INFO L272 TraceCheckUtils]: 0: Hoare triple {6007#true} call ULTIMATE.init(); {6007#true} is VALID [2022-04-08 12:13:43,362 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2022-04-08 12:13:43,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 12:13:43,362 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1316993341] [2022-04-08 12:13:43,362 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 12:13:43,362 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [785383595] [2022-04-08 12:13:43,363 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [785383595] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-08 12:13:43,363 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-08 12:13:43,363 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 8 [2022-04-08 12:13:43,363 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 12:13:43,363 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1433654179] [2022-04-08 12:13:43,363 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1433654179] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 12:13:43,363 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 12:13:43,363 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 12:13:43,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1123244370] [2022-04-08 12:13:43,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 12:13:43,364 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 69 [2022-04-08 12:13:43,364 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 12:13:43,364 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-04-08 12:13:43,394 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 12:13:43,394 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 12:13:43,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 12:13:43,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 12:13:43,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-04-08 12:13:43,394 INFO L87 Difference]: Start difference. First operand 131 states and 167 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-04-08 12:13:43,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:13:43,658 INFO L93 Difference]: Finished difference Result 137 states and 172 transitions. [2022-04-08 12:13:43,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 12:13:43,658 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 69 [2022-04-08 12:13:43,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 12:13:43,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-04-08 12:13:43,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 47 transitions. [2022-04-08 12:13:43,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-04-08 12:13:43,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 47 transitions. [2022-04-08 12:13:43,660 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 47 transitions. [2022-04-08 12:13:43,729 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 12:13:43,731 INFO L225 Difference]: With dead ends: 137 [2022-04-08 12:13:43,731 INFO L226 Difference]: Without dead ends: 132 [2022-04-08 12:13:43,731 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 128 SyntacticMatches, 3 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2022-04-08 12:13:43,732 INFO L913 BasicCegarLoop]: 36 mSDtfsCounter, 6 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 12:13:43,732 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 116 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 12:13:43,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2022-04-08 12:13:43,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 132. [2022-04-08 12:13:43,828 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 12:13:43,829 INFO L82 GeneralOperation]: Start isEquivalent. First operand 132 states. Second operand has 132 states, 76 states have (on average 1.1578947368421053) internal successors, (88), 79 states have internal predecessors, (88), 39 states have call successors, (39), 17 states have call predecessors, (39), 16 states have return successors, (37), 35 states have call predecessors, (37), 37 states have call successors, (37) [2022-04-08 12:13:43,829 INFO L74 IsIncluded]: Start isIncluded. First operand 132 states. Second operand has 132 states, 76 states have (on average 1.1578947368421053) internal successors, (88), 79 states have internal predecessors, (88), 39 states have call successors, (39), 17 states have call predecessors, (39), 16 states have return successors, (37), 35 states have call predecessors, (37), 37 states have call successors, (37) [2022-04-08 12:13:43,829 INFO L87 Difference]: Start difference. First operand 132 states. Second operand has 132 states, 76 states have (on average 1.1578947368421053) internal successors, (88), 79 states have internal predecessors, (88), 39 states have call successors, (39), 17 states have call predecessors, (39), 16 states have return successors, (37), 35 states have call predecessors, (37), 37 states have call successors, (37) [2022-04-08 12:13:43,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:13:43,832 INFO L93 Difference]: Finished difference Result 132 states and 164 transitions. [2022-04-08 12:13:43,832 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 164 transitions. [2022-04-08 12:13:43,832 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:13:43,832 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 12:13:43,832 INFO L74 IsIncluded]: Start isIncluded. First operand has 132 states, 76 states have (on average 1.1578947368421053) internal successors, (88), 79 states have internal predecessors, (88), 39 states have call successors, (39), 17 states have call predecessors, (39), 16 states have return successors, (37), 35 states have call predecessors, (37), 37 states have call successors, (37) Second operand 132 states. [2022-04-08 12:13:43,833 INFO L87 Difference]: Start difference. First operand has 132 states, 76 states have (on average 1.1578947368421053) internal successors, (88), 79 states have internal predecessors, (88), 39 states have call successors, (39), 17 states have call predecessors, (39), 16 states have return successors, (37), 35 states have call predecessors, (37), 37 states have call successors, (37) Second operand 132 states. [2022-04-08 12:13:43,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:13:43,835 INFO L93 Difference]: Finished difference Result 132 states and 164 transitions. [2022-04-08 12:13:43,835 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 164 transitions. [2022-04-08 12:13:43,835 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:13:43,835 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 12:13:43,835 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 12:13:43,835 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 12:13:43,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 76 states have (on average 1.1578947368421053) internal successors, (88), 79 states have internal predecessors, (88), 39 states have call successors, (39), 17 states have call predecessors, (39), 16 states have return successors, (37), 35 states have call predecessors, (37), 37 states have call successors, (37) [2022-04-08 12:13:43,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 164 transitions. [2022-04-08 12:13:43,838 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 164 transitions. Word has length 69 [2022-04-08 12:13:43,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 12:13:43,838 INFO L478 AbstractCegarLoop]: Abstraction has 132 states and 164 transitions. [2022-04-08 12:13:43,838 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-04-08 12:13:43,838 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 132 states and 164 transitions. [2022-04-08 12:13:44,130 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 164 edges. 164 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 12:13:44,130 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 164 transitions. [2022-04-08 12:13:44,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-04-08 12:13:44,131 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 12:13:44,131 INFO L499 BasicCegarLoop]: trace histogram [8, 7, 7, 4, 4, 4, 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] [2022-04-08 12:13:44,155 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 12:13:44,332 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 12:13:44,332 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 12:13:44,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 12:13:44,332 INFO L85 PathProgramCache]: Analyzing trace with hash 1196252297, now seen corresponding path program 5 times [2022-04-08 12:13:44,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 12:13:44,332 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [707144214] [2022-04-08 12:13:44,333 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 12:13:44,333 INFO L85 PathProgramCache]: Analyzing trace with hash 1196252297, now seen corresponding path program 6 times [2022-04-08 12:13:44,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 12:13:44,333 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [214074146] [2022-04-08 12:13:44,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 12:13:44,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 12:13:44,376 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 12:13:44,376 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [195382788] [2022-04-08 12:13:44,376 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 12:13:44,376 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 12:13:44,376 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 12:13:44,389 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 12:13:44,423 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 12:13:44,443 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-04-08 12:13:44,443 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 12:13:44,444 INFO L263 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 48 conjunts are in the unsatisfiable core [2022-04-08 12:13:44,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 12:13:44,474 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 12:13:47,239 INFO L272 TraceCheckUtils]: 0: Hoare triple {7232#true} call ULTIMATE.init(); {7232#true} is VALID [2022-04-08 12:13:47,239 INFO L290 TraceCheckUtils]: 1: Hoare triple {7232#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(10, 2);call #Ultimate.allocInit(12, 3); {7232#true} is VALID [2022-04-08 12:13:47,239 INFO L290 TraceCheckUtils]: 2: Hoare triple {7232#true} assume true; {7232#true} is VALID [2022-04-08 12:13:47,239 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7232#true} {7232#true} #88#return; {7232#true} is VALID [2022-04-08 12:13:47,239 INFO L272 TraceCheckUtils]: 4: Hoare triple {7232#true} call #t~ret6 := main(); {7232#true} is VALID [2022-04-08 12:13:47,239 INFO L290 TraceCheckUtils]: 5: Hoare triple {7232#true} havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~x~0;havoc ~y~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {7232#true} is VALID [2022-04-08 12:13:47,239 INFO L272 TraceCheckUtils]: 6: Hoare triple {7232#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 5 then 1 else 0)); {7232#true} is VALID [2022-04-08 12:13:47,240 INFO L290 TraceCheckUtils]: 7: Hoare triple {7232#true} ~cond := #in~cond; {7258#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-08 12:13:47,240 INFO L290 TraceCheckUtils]: 8: Hoare triple {7258#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {7262#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-08 12:13:47,240 INFO L290 TraceCheckUtils]: 9: Hoare triple {7262#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {7262#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-08 12:13:47,241 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {7262#(not (= |assume_abort_if_not_#in~cond| 0))} {7232#true} #66#return; {7269#(and (<= 0 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-08 12:13:47,241 INFO L290 TraceCheckUtils]: 11: Hoare triple {7269#(and (<= 0 main_~x~0) (<= main_~x~0 5))} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {7269#(and (<= 0 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-08 12:13:47,241 INFO L272 TraceCheckUtils]: 12: Hoare triple {7269#(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)); {7232#true} is VALID [2022-04-08 12:13:47,241 INFO L290 TraceCheckUtils]: 13: Hoare triple {7232#true} ~cond := #in~cond; {7232#true} is VALID [2022-04-08 12:13:47,241 INFO L290 TraceCheckUtils]: 14: Hoare triple {7232#true} assume !(0 == ~cond); {7232#true} is VALID [2022-04-08 12:13:47,241 INFO L290 TraceCheckUtils]: 15: Hoare triple {7232#true} assume true; {7232#true} is VALID [2022-04-08 12:13:47,242 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {7232#true} {7269#(and (<= 0 main_~x~0) (<= main_~x~0 5))} #68#return; {7269#(and (<= 0 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-08 12:13:47,242 INFO L272 TraceCheckUtils]: 17: Hoare triple {7269#(and (<= 0 main_~x~0) (<= main_~x~0 5))} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {7232#true} is VALID [2022-04-08 12:13:47,242 INFO L290 TraceCheckUtils]: 18: Hoare triple {7232#true} ~cond := #in~cond; {7232#true} is VALID [2022-04-08 12:13:47,242 INFO L290 TraceCheckUtils]: 19: Hoare triple {7232#true} assume !(0 == ~cond); {7232#true} is VALID [2022-04-08 12:13:47,242 INFO L290 TraceCheckUtils]: 20: Hoare triple {7232#true} assume true; {7232#true} is VALID [2022-04-08 12:13:47,242 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {7232#true} {7269#(and (<= 0 main_~x~0) (<= main_~x~0 5))} #70#return; {7269#(and (<= 0 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-08 12:13:47,242 INFO L272 TraceCheckUtils]: 22: Hoare triple {7269#(and (<= 0 main_~x~0) (<= main_~x~0 5))} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {7232#true} is VALID [2022-04-08 12:13:47,243 INFO L290 TraceCheckUtils]: 23: Hoare triple {7232#true} ~cond := #in~cond; {7258#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-08 12:13:47,243 INFO L290 TraceCheckUtils]: 24: Hoare triple {7258#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {7262#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-08 12:13:47,243 INFO L290 TraceCheckUtils]: 25: Hoare triple {7262#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {7262#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-08 12:13:47,244 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {7262#(not (= |assume_abort_if_not_#in~cond| 0))} {7269#(and (<= 0 main_~x~0) (<= main_~x~0 5))} #72#return; {7318#(and (<= 0 main_~x~0) (<= main_~x~0 5) (<= 1 main_~y~0))} is VALID [2022-04-08 12:13:47,244 INFO L290 TraceCheckUtils]: 27: Hoare triple {7318#(and (<= 0 main_~x~0) (<= main_~x~0 5) (<= 1 main_~y~0))} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {7322#(and (= main_~s~0 1) (<= 0 main_~x~0) (<= main_~x~0 5) (<= main_~r~0 0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= main_~x~0 main_~a~0) (<= 1 main_~y~0) (= main_~p~0 1))} is VALID [2022-04-08 12:13:47,245 INFO L290 TraceCheckUtils]: 28: Hoare triple {7322#(and (= main_~s~0 1) (<= 0 main_~x~0) (<= main_~x~0 5) (<= main_~r~0 0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= main_~x~0 main_~a~0) (<= 1 main_~y~0) (= main_~p~0 1))} assume !false; {7322#(and (= main_~s~0 1) (<= 0 main_~x~0) (<= main_~x~0 5) (<= main_~r~0 0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= main_~x~0 main_~a~0) (<= 1 main_~y~0) (= main_~p~0 1))} is VALID [2022-04-08 12:13:47,245 INFO L272 TraceCheckUtils]: 29: Hoare triple {7322#(and (= main_~s~0 1) (<= 0 main_~x~0) (<= main_~x~0 5) (<= main_~r~0 0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= main_~x~0 main_~a~0) (<= 1 main_~y~0) (= main_~p~0 1))} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {7232#true} is VALID [2022-04-08 12:13:47,245 INFO L290 TraceCheckUtils]: 30: Hoare triple {7232#true} ~cond := #in~cond; {7232#true} is VALID [2022-04-08 12:13:47,245 INFO L290 TraceCheckUtils]: 31: Hoare triple {7232#true} assume !(0 == ~cond); {7232#true} is VALID [2022-04-08 12:13:47,245 INFO L290 TraceCheckUtils]: 32: Hoare triple {7232#true} assume true; {7232#true} is VALID [2022-04-08 12:13:47,245 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {7232#true} {7322#(and (= main_~s~0 1) (<= 0 main_~x~0) (<= main_~x~0 5) (<= main_~r~0 0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= main_~x~0 main_~a~0) (<= 1 main_~y~0) (= main_~p~0 1))} #74#return; {7322#(and (= main_~s~0 1) (<= 0 main_~x~0) (<= main_~x~0 5) (<= main_~r~0 0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= main_~x~0 main_~a~0) (<= 1 main_~y~0) (= main_~p~0 1))} is VALID [2022-04-08 12:13:47,246 INFO L272 TraceCheckUtils]: 34: Hoare triple {7322#(and (= main_~s~0 1) (<= 0 main_~x~0) (<= main_~x~0 5) (<= main_~r~0 0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= main_~x~0 main_~a~0) (<= 1 main_~y~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {7232#true} is VALID [2022-04-08 12:13:47,246 INFO L290 TraceCheckUtils]: 35: Hoare triple {7232#true} ~cond := #in~cond; {7232#true} is VALID [2022-04-08 12:13:47,246 INFO L290 TraceCheckUtils]: 36: Hoare triple {7232#true} assume !(0 == ~cond); {7232#true} is VALID [2022-04-08 12:13:47,246 INFO L290 TraceCheckUtils]: 37: Hoare triple {7232#true} assume true; {7232#true} is VALID [2022-04-08 12:13:47,246 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {7232#true} {7322#(and (= main_~s~0 1) (<= 0 main_~x~0) (<= main_~x~0 5) (<= main_~r~0 0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= main_~x~0 main_~a~0) (<= 1 main_~y~0) (= main_~p~0 1))} #76#return; {7322#(and (= main_~s~0 1) (<= 0 main_~x~0) (<= main_~x~0 5) (<= main_~r~0 0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= main_~x~0 main_~a~0) (<= 1 main_~y~0) (= main_~p~0 1))} is VALID [2022-04-08 12:13:47,246 INFO L272 TraceCheckUtils]: 39: Hoare triple {7322#(and (= main_~s~0 1) (<= 0 main_~x~0) (<= main_~x~0 5) (<= main_~r~0 0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= main_~x~0 main_~a~0) (<= 1 main_~y~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {7232#true} is VALID [2022-04-08 12:13:47,246 INFO L290 TraceCheckUtils]: 40: Hoare triple {7232#true} ~cond := #in~cond; {7232#true} is VALID [2022-04-08 12:13:47,246 INFO L290 TraceCheckUtils]: 41: Hoare triple {7232#true} assume !(0 == ~cond); {7232#true} is VALID [2022-04-08 12:13:47,247 INFO L290 TraceCheckUtils]: 42: Hoare triple {7232#true} assume true; {7232#true} is VALID [2022-04-08 12:13:47,247 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {7232#true} {7322#(and (= main_~s~0 1) (<= 0 main_~x~0) (<= main_~x~0 5) (<= main_~r~0 0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= main_~x~0 main_~a~0) (<= 1 main_~y~0) (= main_~p~0 1))} #78#return; {7322#(and (= main_~s~0 1) (<= 0 main_~x~0) (<= main_~x~0 5) (<= main_~r~0 0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= main_~x~0 main_~a~0) (<= 1 main_~y~0) (= main_~p~0 1))} is VALID [2022-04-08 12:13:47,248 INFO L290 TraceCheckUtils]: 44: Hoare triple {7322#(and (= main_~s~0 1) (<= 0 main_~x~0) (<= main_~x~0 5) (<= main_~r~0 0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= main_~x~0 main_~a~0) (<= 1 main_~y~0) (= main_~p~0 1))} assume !!(~a~0 != ~b~0); {7322#(and (= main_~s~0 1) (<= 0 main_~x~0) (<= main_~x~0 5) (<= main_~r~0 0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= main_~x~0 main_~a~0) (<= 1 main_~y~0) (= main_~p~0 1))} is VALID [2022-04-08 12:13:47,248 INFO L290 TraceCheckUtils]: 45: Hoare triple {7322#(and (= main_~s~0 1) (<= 0 main_~x~0) (<= main_~x~0 5) (<= main_~r~0 0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= main_~x~0 main_~a~0) (<= 1 main_~y~0) (= main_~p~0 1))} assume ~a~0 > ~b~0;~a~0 := ~a~0 - ~b~0;~p~0 := ~p~0 - ~q~0;~r~0 := ~r~0 - ~s~0; {7377#(and (<= main_~x~0 (+ main_~b~0 main_~a~0)) (= main_~s~0 1) (<= 0 main_~x~0) (= main_~p~0 (+ (* (- 1) main_~q~0) 1)) (<= main_~x~0 5) (= main_~b~0 main_~y~0) (<= (+ main_~s~0 main_~r~0) 0) (= main_~q~0 0) (<= 1 main_~y~0))} is VALID [2022-04-08 12:13:47,249 INFO L290 TraceCheckUtils]: 46: Hoare triple {7377#(and (<= main_~x~0 (+ main_~b~0 main_~a~0)) (= main_~s~0 1) (<= 0 main_~x~0) (= main_~p~0 (+ (* (- 1) main_~q~0) 1)) (<= main_~x~0 5) (= main_~b~0 main_~y~0) (<= (+ main_~s~0 main_~r~0) 0) (= main_~q~0 0) (<= 1 main_~y~0))} assume !false; {7377#(and (<= main_~x~0 (+ main_~b~0 main_~a~0)) (= main_~s~0 1) (<= 0 main_~x~0) (= main_~p~0 (+ (* (- 1) main_~q~0) 1)) (<= main_~x~0 5) (= main_~b~0 main_~y~0) (<= (+ main_~s~0 main_~r~0) 0) (= main_~q~0 0) (<= 1 main_~y~0))} is VALID [2022-04-08 12:13:47,249 INFO L272 TraceCheckUtils]: 47: Hoare triple {7377#(and (<= main_~x~0 (+ main_~b~0 main_~a~0)) (= main_~s~0 1) (<= 0 main_~x~0) (= main_~p~0 (+ (* (- 1) main_~q~0) 1)) (<= main_~x~0 5) (= main_~b~0 main_~y~0) (<= (+ main_~s~0 main_~r~0) 0) (= main_~q~0 0) (<= 1 main_~y~0))} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {7232#true} is VALID [2022-04-08 12:13:47,249 INFO L290 TraceCheckUtils]: 48: Hoare triple {7232#true} ~cond := #in~cond; {7232#true} is VALID [2022-04-08 12:13:47,249 INFO L290 TraceCheckUtils]: 49: Hoare triple {7232#true} assume !(0 == ~cond); {7232#true} is VALID [2022-04-08 12:13:47,249 INFO L290 TraceCheckUtils]: 50: Hoare triple {7232#true} assume true; {7232#true} is VALID [2022-04-08 12:13:47,250 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {7232#true} {7377#(and (<= main_~x~0 (+ main_~b~0 main_~a~0)) (= main_~s~0 1) (<= 0 main_~x~0) (= main_~p~0 (+ (* (- 1) main_~q~0) 1)) (<= main_~x~0 5) (= main_~b~0 main_~y~0) (<= (+ main_~s~0 main_~r~0) 0) (= main_~q~0 0) (<= 1 main_~y~0))} #74#return; {7377#(and (<= main_~x~0 (+ main_~b~0 main_~a~0)) (= main_~s~0 1) (<= 0 main_~x~0) (= main_~p~0 (+ (* (- 1) main_~q~0) 1)) (<= main_~x~0 5) (= main_~b~0 main_~y~0) (<= (+ main_~s~0 main_~r~0) 0) (= main_~q~0 0) (<= 1 main_~y~0))} is VALID [2022-04-08 12:13:47,250 INFO L272 TraceCheckUtils]: 52: Hoare triple {7377#(and (<= main_~x~0 (+ main_~b~0 main_~a~0)) (= main_~s~0 1) (<= 0 main_~x~0) (= main_~p~0 (+ (* (- 1) main_~q~0) 1)) (<= main_~x~0 5) (= main_~b~0 main_~y~0) (<= (+ main_~s~0 main_~r~0) 0) (= main_~q~0 0) (<= 1 main_~y~0))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {7232#true} is VALID [2022-04-08 12:13:47,250 INFO L290 TraceCheckUtils]: 53: Hoare triple {7232#true} ~cond := #in~cond; {7402#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 12:13:47,250 INFO L290 TraceCheckUtils]: 54: Hoare triple {7402#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {7406#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 12:13:47,251 INFO L290 TraceCheckUtils]: 55: Hoare triple {7406#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {7406#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 12:13:47,251 INFO L284 TraceCheckUtils]: 56: Hoare quadruple {7406#(not (= |__VERIFIER_assert_#in~cond| 0))} {7377#(and (<= main_~x~0 (+ main_~b~0 main_~a~0)) (= main_~s~0 1) (<= 0 main_~x~0) (= main_~p~0 (+ (* (- 1) main_~q~0) 1)) (<= main_~x~0 5) (= main_~b~0 main_~y~0) (<= (+ main_~s~0 main_~r~0) 0) (= main_~q~0 0) (<= 1 main_~y~0))} #76#return; {7413#(and (<= main_~x~0 (+ main_~b~0 main_~a~0)) (= main_~s~0 1) (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (<= 0 main_~x~0) (= main_~p~0 (+ (* (- 1) main_~q~0) 1)) (<= main_~x~0 5) (= main_~b~0 main_~y~0) (<= (+ main_~s~0 main_~r~0) 0) (= main_~q~0 0) (<= 1 main_~y~0))} is VALID [2022-04-08 12:13:47,252 INFO L272 TraceCheckUtils]: 57: Hoare triple {7413#(and (<= main_~x~0 (+ main_~b~0 main_~a~0)) (= main_~s~0 1) (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (<= 0 main_~x~0) (= main_~p~0 (+ (* (- 1) main_~q~0) 1)) (<= main_~x~0 5) (= main_~b~0 main_~y~0) (<= (+ main_~s~0 main_~r~0) 0) (= main_~q~0 0) (<= 1 main_~y~0))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {7232#true} is VALID [2022-04-08 12:13:47,252 INFO L290 TraceCheckUtils]: 58: Hoare triple {7232#true} ~cond := #in~cond; {7232#true} is VALID [2022-04-08 12:13:47,252 INFO L290 TraceCheckUtils]: 59: Hoare triple {7232#true} assume !(0 == ~cond); {7232#true} is VALID [2022-04-08 12:13:47,252 INFO L290 TraceCheckUtils]: 60: Hoare triple {7232#true} assume true; {7232#true} is VALID [2022-04-08 12:13:47,267 INFO L284 TraceCheckUtils]: 61: Hoare quadruple {7232#true} {7413#(and (<= main_~x~0 (+ main_~b~0 main_~a~0)) (= main_~s~0 1) (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (<= 0 main_~x~0) (= main_~p~0 (+ (* (- 1) main_~q~0) 1)) (<= main_~x~0 5) (= main_~b~0 main_~y~0) (<= (+ main_~s~0 main_~r~0) 0) (= main_~q~0 0) (<= 1 main_~y~0))} #78#return; {7413#(and (<= main_~x~0 (+ main_~b~0 main_~a~0)) (= main_~s~0 1) (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (<= 0 main_~x~0) (= main_~p~0 (+ (* (- 1) main_~q~0) 1)) (<= main_~x~0 5) (= main_~b~0 main_~y~0) (<= (+ main_~s~0 main_~r~0) 0) (= main_~q~0 0) (<= 1 main_~y~0))} is VALID [2022-04-08 12:13:47,268 INFO L290 TraceCheckUtils]: 62: Hoare triple {7413#(and (<= main_~x~0 (+ main_~b~0 main_~a~0)) (= main_~s~0 1) (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (<= 0 main_~x~0) (= main_~p~0 (+ (* (- 1) main_~q~0) 1)) (<= main_~x~0 5) (= main_~b~0 main_~y~0) (<= (+ main_~s~0 main_~r~0) 0) (= main_~q~0 0) (<= 1 main_~y~0))} assume !!(~a~0 != ~b~0); {7413#(and (<= main_~x~0 (+ main_~b~0 main_~a~0)) (= main_~s~0 1) (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (<= 0 main_~x~0) (= main_~p~0 (+ (* (- 1) main_~q~0) 1)) (<= main_~x~0 5) (= main_~b~0 main_~y~0) (<= (+ main_~s~0 main_~r~0) 0) (= main_~q~0 0) (<= 1 main_~y~0))} is VALID [2022-04-08 12:13:47,270 INFO L290 TraceCheckUtils]: 63: Hoare triple {7413#(and (<= main_~x~0 (+ main_~b~0 main_~a~0)) (= main_~s~0 1) (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (<= 0 main_~x~0) (= main_~p~0 (+ (* (- 1) main_~q~0) 1)) (<= main_~x~0 5) (= main_~b~0 main_~y~0) (<= (+ main_~s~0 main_~r~0) 0) (= main_~q~0 0) (<= 1 main_~y~0))} assume ~a~0 > ~b~0;~a~0 := ~a~0 - ~b~0;~p~0 := ~p~0 - ~q~0;~r~0 := ~r~0 - ~s~0; {7435#(and (<= (+ main_~r~0 (* main_~s~0 2)) 0) (= main_~s~0 1) (= (+ main_~p~0 (* main_~q~0 2)) 1) (<= main_~x~0 5) (= (+ (* main_~q~0 main_~x~0) main_~a~0 main_~y~0) (+ (* main_~y~0 main_~r~0) main_~x~0 (* main_~y~0 main_~s~0))) (< 0 main_~a~0) (= main_~q~0 0) (<= 1 main_~y~0) (<= (+ (* (* main_~q~0 main_~x~0) 2) main_~a~0) (+ (* 2 (* main_~y~0 main_~s~0)) main_~x~0 (* (* main_~y~0 main_~r~0) 2))))} is VALID [2022-04-08 12:13:47,270 INFO L290 TraceCheckUtils]: 64: Hoare triple {7435#(and (<= (+ main_~r~0 (* main_~s~0 2)) 0) (= main_~s~0 1) (= (+ main_~p~0 (* main_~q~0 2)) 1) (<= main_~x~0 5) (= (+ (* main_~q~0 main_~x~0) main_~a~0 main_~y~0) (+ (* main_~y~0 main_~r~0) main_~x~0 (* main_~y~0 main_~s~0))) (< 0 main_~a~0) (= main_~q~0 0) (<= 1 main_~y~0) (<= (+ (* (* main_~q~0 main_~x~0) 2) main_~a~0) (+ (* 2 (* main_~y~0 main_~s~0)) main_~x~0 (* (* main_~y~0 main_~r~0) 2))))} assume !false; {7435#(and (<= (+ main_~r~0 (* main_~s~0 2)) 0) (= main_~s~0 1) (= (+ main_~p~0 (* main_~q~0 2)) 1) (<= main_~x~0 5) (= (+ (* main_~q~0 main_~x~0) main_~a~0 main_~y~0) (+ (* main_~y~0 main_~r~0) main_~x~0 (* main_~y~0 main_~s~0))) (< 0 main_~a~0) (= main_~q~0 0) (<= 1 main_~y~0) (<= (+ (* (* main_~q~0 main_~x~0) 2) main_~a~0) (+ (* 2 (* main_~y~0 main_~s~0)) main_~x~0 (* (* main_~y~0 main_~r~0) 2))))} is VALID [2022-04-08 12:13:47,271 INFO L272 TraceCheckUtils]: 65: Hoare triple {7435#(and (<= (+ main_~r~0 (* main_~s~0 2)) 0) (= main_~s~0 1) (= (+ main_~p~0 (* main_~q~0 2)) 1) (<= main_~x~0 5) (= (+ (* main_~q~0 main_~x~0) main_~a~0 main_~y~0) (+ (* main_~y~0 main_~r~0) main_~x~0 (* main_~y~0 main_~s~0))) (< 0 main_~a~0) (= main_~q~0 0) (<= 1 main_~y~0) (<= (+ (* (* main_~q~0 main_~x~0) 2) main_~a~0) (+ (* 2 (* main_~y~0 main_~s~0)) main_~x~0 (* (* main_~y~0 main_~r~0) 2))))} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {7232#true} is VALID [2022-04-08 12:13:47,271 INFO L290 TraceCheckUtils]: 66: Hoare triple {7232#true} ~cond := #in~cond; {7402#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 12:13:47,271 INFO L290 TraceCheckUtils]: 67: Hoare triple {7402#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {7406#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 12:13:47,271 INFO L290 TraceCheckUtils]: 68: Hoare triple {7406#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {7406#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 12:13:47,273 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {7406#(not (= |__VERIFIER_assert_#in~cond| 0))} {7435#(and (<= (+ main_~r~0 (* main_~s~0 2)) 0) (= main_~s~0 1) (= (+ main_~p~0 (* main_~q~0 2)) 1) (<= main_~x~0 5) (= (+ (* main_~q~0 main_~x~0) main_~a~0 main_~y~0) (+ (* main_~y~0 main_~r~0) main_~x~0 (* main_~y~0 main_~s~0))) (< 0 main_~a~0) (= main_~q~0 0) (<= 1 main_~y~0) (<= (+ (* (* main_~q~0 main_~x~0) 2) main_~a~0) (+ (* 2 (* main_~y~0 main_~s~0)) main_~x~0 (* (* main_~y~0 main_~r~0) 2))))} #74#return; {7454#(and (= (+ main_~a~0 main_~y~0) (+ (* main_~y~0 main_~r~0) main_~y~0 main_~x~0)) (<= (+ main_~r~0 2) 0) (<= main_~a~0 (+ main_~x~0 (* (* main_~y~0 main_~r~0) 2) (* main_~y~0 2))) (<= main_~x~0 5) (< 0 main_~a~0) (<= 1 main_~y~0) (= main_~p~0 1))} is VALID [2022-04-08 12:13:47,275 INFO L272 TraceCheckUtils]: 70: Hoare triple {7454#(and (= (+ main_~a~0 main_~y~0) (+ (* main_~y~0 main_~r~0) main_~y~0 main_~x~0)) (<= (+ main_~r~0 2) 0) (<= main_~a~0 (+ main_~x~0 (* (* main_~y~0 main_~r~0) 2) (* main_~y~0 2))) (<= main_~x~0 5) (< 0 main_~a~0) (<= 1 main_~y~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {7458#(exists ((v_main_~y~0_BEFORE_CALL_41 Int) (v_main_~r~0_BEFORE_CALL_47 Int) (v_main_~a~0_BEFORE_CALL_30 Int)) (and (<= (+ v_main_~r~0_BEFORE_CALL_47 2) 0) (< 0 v_main_~a~0_BEFORE_CALL_30) (<= 1 v_main_~y~0_BEFORE_CALL_41) (<= v_main_~a~0_BEFORE_CALL_30 (+ (* v_main_~r~0_BEFORE_CALL_47 v_main_~y~0_BEFORE_CALL_41) 5)) (<= 1 |__VERIFIER_assert_#in~cond|) (<= 0 (+ (* v_main_~r~0_BEFORE_CALL_47 v_main_~y~0_BEFORE_CALL_41) (* 2 v_main_~y~0_BEFORE_CALL_41)))))} is VALID [2022-04-08 12:13:47,275 INFO L290 TraceCheckUtils]: 71: Hoare triple {7458#(exists ((v_main_~y~0_BEFORE_CALL_41 Int) (v_main_~r~0_BEFORE_CALL_47 Int) (v_main_~a~0_BEFORE_CALL_30 Int)) (and (<= (+ v_main_~r~0_BEFORE_CALL_47 2) 0) (< 0 v_main_~a~0_BEFORE_CALL_30) (<= 1 v_main_~y~0_BEFORE_CALL_41) (<= v_main_~a~0_BEFORE_CALL_30 (+ (* v_main_~r~0_BEFORE_CALL_47 v_main_~y~0_BEFORE_CALL_41) 5)) (<= 1 |__VERIFIER_assert_#in~cond|) (<= 0 (+ (* v_main_~r~0_BEFORE_CALL_47 v_main_~y~0_BEFORE_CALL_41) (* 2 v_main_~y~0_BEFORE_CALL_41)))))} ~cond := #in~cond; {7462#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 12:13:47,276 INFO L290 TraceCheckUtils]: 72: Hoare triple {7462#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {7233#false} is VALID [2022-04-08 12:13:47,276 INFO L290 TraceCheckUtils]: 73: Hoare triple {7233#false} assume !false; {7233#false} is VALID [2022-04-08 12:13:47,276 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 45 proven. 23 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2022-04-08 12:13:47,276 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 12:15:57,941 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-08 12:16:05,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 12:16:05,267 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [214074146] [2022-04-08 12:16:05,267 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 12:16:05,267 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [195382788] [2022-04-08 12:16:05,267 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [195382788] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 12:16:05,267 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-08 12:16:05,267 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2022-04-08 12:16:05,268 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 12:16:05,268 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [707144214] [2022-04-08 12:16:05,268 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [707144214] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 12:16:05,268 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 12:16:05,268 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-04-08 12:16:05,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1129342537] [2022-04-08 12:16:05,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 12:16:05,268 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 12 states have internal predecessors, (27), 7 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (12), 7 states have call predecessors, (12), 6 states have call successors, (12) Word has length 74 [2022-04-08 12:16:05,268 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 12:16:05,269 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 15 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 12 states have internal predecessors, (27), 7 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (12), 7 states have call predecessors, (12), 6 states have call successors, (12) [2022-04-08 12:16:05,348 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 12:16:05,348 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-08 12:16:05,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 12:16:05,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-08 12:16:05,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=381, Unknown=3, NotChecked=0, Total=462 [2022-04-08 12:16:05,349 INFO L87 Difference]: Start difference. First operand 132 states and 164 transitions. Second operand has 15 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 12 states have internal predecessors, (27), 7 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (12), 7 states have call predecessors, (12), 6 states have call successors, (12) [2022-04-08 12:16:07,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:16:07,939 INFO L93 Difference]: Finished difference Result 162 states and 204 transitions. [2022-04-08 12:16:07,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-04-08 12:16:07,939 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 12 states have internal predecessors, (27), 7 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (12), 7 states have call predecessors, (12), 6 states have call successors, (12) Word has length 74 [2022-04-08 12:16:07,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 12:16:07,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 12 states have internal predecessors, (27), 7 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (12), 7 states have call predecessors, (12), 6 states have call successors, (12) [2022-04-08 12:16:07,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 97 transitions. [2022-04-08 12:16:07,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 12 states have internal predecessors, (27), 7 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (12), 7 states have call predecessors, (12), 6 states have call successors, (12) [2022-04-08 12:16:07,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 97 transitions. [2022-04-08 12:16:07,954 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 97 transitions. [2022-04-08 12:16:08,102 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 97 edges. 97 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 12:16:08,105 INFO L225 Difference]: With dead ends: 162 [2022-04-08 12:16:08,105 INFO L226 Difference]: Without dead ends: 160 [2022-04-08 12:16:08,105 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 83 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=96, Invalid=501, Unknown=3, NotChecked=0, Total=600 [2022-04-08 12:16:08,106 INFO L913 BasicCegarLoop]: 37 mSDtfsCounter, 36 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 498 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 557 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 498 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 9 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-04-08 12:16:08,106 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [53 Valid, 157 Invalid, 557 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 498 Invalid, 0 Unknown, 9 Unchecked, 1.2s Time] [2022-04-08 12:16:08,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2022-04-08 12:16:08,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 142. [2022-04-08 12:16:08,277 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 12:16:08,278 INFO L82 GeneralOperation]: Start isEquivalent. First operand 160 states. Second operand has 142 states, 82 states have (on average 1.1585365853658536) internal successors, (95), 85 states have internal predecessors, (95), 42 states have call successors, (42), 18 states have call predecessors, (42), 17 states have return successors, (40), 38 states have call predecessors, (40), 40 states have call successors, (40) [2022-04-08 12:16:08,279 INFO L74 IsIncluded]: Start isIncluded. First operand 160 states. Second operand has 142 states, 82 states have (on average 1.1585365853658536) internal successors, (95), 85 states have internal predecessors, (95), 42 states have call successors, (42), 18 states have call predecessors, (42), 17 states have return successors, (40), 38 states have call predecessors, (40), 40 states have call successors, (40) [2022-04-08 12:16:08,279 INFO L87 Difference]: Start difference. First operand 160 states. Second operand has 142 states, 82 states have (on average 1.1585365853658536) internal successors, (95), 85 states have internal predecessors, (95), 42 states have call successors, (42), 18 states have call predecessors, (42), 17 states have return successors, (40), 38 states have call predecessors, (40), 40 states have call successors, (40) [2022-04-08 12:16:08,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:16:08,297 INFO L93 Difference]: Finished difference Result 160 states and 202 transitions. [2022-04-08 12:16:08,297 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 202 transitions. [2022-04-08 12:16:08,300 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:16:08,300 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 12:16:08,301 INFO L74 IsIncluded]: Start isIncluded. First operand has 142 states, 82 states have (on average 1.1585365853658536) internal successors, (95), 85 states have internal predecessors, (95), 42 states have call successors, (42), 18 states have call predecessors, (42), 17 states have return successors, (40), 38 states have call predecessors, (40), 40 states have call successors, (40) Second operand 160 states. [2022-04-08 12:16:08,301 INFO L87 Difference]: Start difference. First operand has 142 states, 82 states have (on average 1.1585365853658536) internal successors, (95), 85 states have internal predecessors, (95), 42 states have call successors, (42), 18 states have call predecessors, (42), 17 states have return successors, (40), 38 states have call predecessors, (40), 40 states have call successors, (40) Second operand 160 states. [2022-04-08 12:16:08,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:16:08,304 INFO L93 Difference]: Finished difference Result 160 states and 202 transitions. [2022-04-08 12:16:08,304 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 202 transitions. [2022-04-08 12:16:08,304 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:16:08,304 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 12:16:08,304 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 12:16:08,304 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 12:16:08,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 82 states have (on average 1.1585365853658536) internal successors, (95), 85 states have internal predecessors, (95), 42 states have call successors, (42), 18 states have call predecessors, (42), 17 states have return successors, (40), 38 states have call predecessors, (40), 40 states have call successors, (40) [2022-04-08 12:16:08,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 177 transitions. [2022-04-08 12:16:08,307 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 177 transitions. Word has length 74 [2022-04-08 12:16:08,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 12:16:08,307 INFO L478 AbstractCegarLoop]: Abstraction has 142 states and 177 transitions. [2022-04-08 12:16:08,307 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 12 states have internal predecessors, (27), 7 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (12), 7 states have call predecessors, (12), 6 states have call successors, (12) [2022-04-08 12:16:08,307 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 142 states and 177 transitions. [2022-04-08 12:16:08,570 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 177 edges. 177 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 12:16:08,570 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 177 transitions. [2022-04-08 12:16:08,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-04-08 12:16:08,571 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 12:16:08,571 INFO L499 BasicCegarLoop]: trace histogram [8, 7, 7, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 12:16:08,593 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-04-08 12:16:08,771 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 12:16:08,771 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 12:16:08,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 12:16:08,772 INFO L85 PathProgramCache]: Analyzing trace with hash -1712511605, now seen corresponding path program 3 times [2022-04-08 12:16:08,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 12:16:08,772 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1800674548] [2022-04-08 12:16:08,772 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 12:16:08,772 INFO L85 PathProgramCache]: Analyzing trace with hash -1712511605, now seen corresponding path program 4 times [2022-04-08 12:16:08,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 12:16:08,772 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799433638] [2022-04-08 12:16:08,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 12:16:08,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 12:16:08,784 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 12:16:08,785 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1742474408] [2022-04-08 12:16:08,785 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 12:16:08,785 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 12:16:08,785 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 12:16:08,790 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 12:16:08,791 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 12:16:08,846 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 12:16:08,846 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 12:16:08,847 INFO L263 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 40 conjunts are in the unsatisfiable core [2022-04-08 12:16:08,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 12:16:08,859 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 12:16:09,925 INFO L272 TraceCheckUtils]: 0: Hoare triple {8503#true} call ULTIMATE.init(); {8503#true} is VALID [2022-04-08 12:16:09,925 INFO L290 TraceCheckUtils]: 1: Hoare triple {8503#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(10, 2);call #Ultimate.allocInit(12, 3); {8503#true} is VALID [2022-04-08 12:16:09,925 INFO L290 TraceCheckUtils]: 2: Hoare triple {8503#true} assume true; {8503#true} is VALID [2022-04-08 12:16:09,925 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8503#true} {8503#true} #88#return; {8503#true} is VALID [2022-04-08 12:16:09,925 INFO L272 TraceCheckUtils]: 4: Hoare triple {8503#true} call #t~ret6 := main(); {8503#true} is VALID [2022-04-08 12:16:09,926 INFO L290 TraceCheckUtils]: 5: Hoare triple {8503#true} havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~x~0;havoc ~y~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {8503#true} is VALID [2022-04-08 12:16:09,926 INFO L272 TraceCheckUtils]: 6: Hoare triple {8503#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 5 then 1 else 0)); {8503#true} is VALID [2022-04-08 12:16:09,926 INFO L290 TraceCheckUtils]: 7: Hoare triple {8503#true} ~cond := #in~cond; {8503#true} is VALID [2022-04-08 12:16:09,926 INFO L290 TraceCheckUtils]: 8: Hoare triple {8503#true} assume !(0 == ~cond); {8503#true} is VALID [2022-04-08 12:16:09,926 INFO L290 TraceCheckUtils]: 9: Hoare triple {8503#true} assume true; {8503#true} is VALID [2022-04-08 12:16:09,926 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {8503#true} {8503#true} #66#return; {8503#true} is VALID [2022-04-08 12:16:09,926 INFO L290 TraceCheckUtils]: 11: Hoare triple {8503#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {8503#true} is VALID [2022-04-08 12:16:09,926 INFO L272 TraceCheckUtils]: 12: Hoare triple {8503#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 5 then 1 else 0)); {8503#true} is VALID [2022-04-08 12:16:09,926 INFO L290 TraceCheckUtils]: 13: Hoare triple {8503#true} ~cond := #in~cond; {8503#true} is VALID [2022-04-08 12:16:09,926 INFO L290 TraceCheckUtils]: 14: Hoare triple {8503#true} assume !(0 == ~cond); {8503#true} is VALID [2022-04-08 12:16:09,926 INFO L290 TraceCheckUtils]: 15: Hoare triple {8503#true} assume true; {8503#true} is VALID [2022-04-08 12:16:09,926 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {8503#true} {8503#true} #68#return; {8503#true} is VALID [2022-04-08 12:16:09,926 INFO L272 TraceCheckUtils]: 17: Hoare triple {8503#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {8503#true} is VALID [2022-04-08 12:16:09,926 INFO L290 TraceCheckUtils]: 18: Hoare triple {8503#true} ~cond := #in~cond; {8562#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-08 12:16:09,927 INFO L290 TraceCheckUtils]: 19: Hoare triple {8562#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {8566#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-08 12:16:09,927 INFO L290 TraceCheckUtils]: 20: Hoare triple {8566#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {8566#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-08 12:16:09,927 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {8566#(not (= |assume_abort_if_not_#in~cond| 0))} {8503#true} #70#return; {8573#(<= 1 main_~x~0)} is VALID [2022-04-08 12:16:09,927 INFO L272 TraceCheckUtils]: 22: Hoare triple {8573#(<= 1 main_~x~0)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {8503#true} is VALID [2022-04-08 12:16:09,928 INFO L290 TraceCheckUtils]: 23: Hoare triple {8503#true} ~cond := #in~cond; {8503#true} is VALID [2022-04-08 12:16:09,928 INFO L290 TraceCheckUtils]: 24: Hoare triple {8503#true} assume !(0 == ~cond); {8503#true} is VALID [2022-04-08 12:16:09,928 INFO L290 TraceCheckUtils]: 25: Hoare triple {8503#true} assume true; {8503#true} is VALID [2022-04-08 12:16:09,928 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {8503#true} {8573#(<= 1 main_~x~0)} #72#return; {8573#(<= 1 main_~x~0)} is VALID [2022-04-08 12:16:09,928 INFO L290 TraceCheckUtils]: 27: Hoare triple {8573#(<= 1 main_~x~0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {8592#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-08 12:16:09,929 INFO L290 TraceCheckUtils]: 28: Hoare triple {8592#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !false; {8592#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-08 12:16:09,929 INFO L272 TraceCheckUtils]: 29: Hoare triple {8592#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {8503#true} is VALID [2022-04-08 12:16:09,929 INFO L290 TraceCheckUtils]: 30: Hoare triple {8503#true} ~cond := #in~cond; {8503#true} is VALID [2022-04-08 12:16:09,929 INFO L290 TraceCheckUtils]: 31: Hoare triple {8503#true} assume !(0 == ~cond); {8503#true} is VALID [2022-04-08 12:16:09,929 INFO L290 TraceCheckUtils]: 32: Hoare triple {8503#true} assume true; {8503#true} is VALID [2022-04-08 12:16:09,930 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {8503#true} {8592#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #74#return; {8592#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-08 12:16:09,930 INFO L272 TraceCheckUtils]: 34: Hoare triple {8592#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {8503#true} is VALID [2022-04-08 12:16:09,930 INFO L290 TraceCheckUtils]: 35: Hoare triple {8503#true} ~cond := #in~cond; {8503#true} is VALID [2022-04-08 12:16:09,930 INFO L290 TraceCheckUtils]: 36: Hoare triple {8503#true} assume !(0 == ~cond); {8503#true} is VALID [2022-04-08 12:16:09,930 INFO L290 TraceCheckUtils]: 37: Hoare triple {8503#true} assume true; {8503#true} is VALID [2022-04-08 12:16:09,930 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {8503#true} {8592#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #76#return; {8592#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-08 12:16:09,930 INFO L272 TraceCheckUtils]: 39: Hoare triple {8592#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {8503#true} is VALID [2022-04-08 12:16:09,931 INFO L290 TraceCheckUtils]: 40: Hoare triple {8503#true} ~cond := #in~cond; {8503#true} is VALID [2022-04-08 12:16:09,931 INFO L290 TraceCheckUtils]: 41: Hoare triple {8503#true} assume !(0 == ~cond); {8503#true} is VALID [2022-04-08 12:16:09,931 INFO L290 TraceCheckUtils]: 42: Hoare triple {8503#true} assume true; {8503#true} is VALID [2022-04-08 12:16:09,931 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {8503#true} {8592#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #78#return; {8592#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-08 12:16:09,932 INFO L290 TraceCheckUtils]: 44: Hoare triple {8592#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !!(~a~0 != ~b~0); {8644#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (not (= main_~b~0 main_~a~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-08 12:16:09,932 INFO L290 TraceCheckUtils]: 45: Hoare triple {8644#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (not (= main_~b~0 main_~a~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !(~a~0 > ~b~0);~b~0 := ~b~0 - ~a~0;~q~0 := ~q~0 - ~p~0;~s~0 := ~s~0 - ~r~0; {8648#(and (= main_~r~0 0) (= (+ main_~s~0 main_~r~0) 1) (= main_~y~0 (+ main_~b~0 main_~a~0)) (<= 1 main_~x~0) (not (= main_~a~0 (+ main_~b~0 main_~a~0))) (not (< main_~b~0 0)) (= main_~a~0 main_~x~0) (= (+ main_~q~0 main_~p~0) 0) (= main_~p~0 1))} is VALID [2022-04-08 12:16:09,933 INFO L290 TraceCheckUtils]: 46: Hoare triple {8648#(and (= main_~r~0 0) (= (+ main_~s~0 main_~r~0) 1) (= main_~y~0 (+ main_~b~0 main_~a~0)) (<= 1 main_~x~0) (not (= main_~a~0 (+ main_~b~0 main_~a~0))) (not (< main_~b~0 0)) (= main_~a~0 main_~x~0) (= (+ main_~q~0 main_~p~0) 0) (= main_~p~0 1))} assume !false; {8648#(and (= main_~r~0 0) (= (+ main_~s~0 main_~r~0) 1) (= main_~y~0 (+ main_~b~0 main_~a~0)) (<= 1 main_~x~0) (not (= main_~a~0 (+ main_~b~0 main_~a~0))) (not (< main_~b~0 0)) (= main_~a~0 main_~x~0) (= (+ main_~q~0 main_~p~0) 0) (= main_~p~0 1))} is VALID [2022-04-08 12:16:09,933 INFO L272 TraceCheckUtils]: 47: Hoare triple {8648#(and (= main_~r~0 0) (= (+ main_~s~0 main_~r~0) 1) (= main_~y~0 (+ main_~b~0 main_~a~0)) (<= 1 main_~x~0) (not (= main_~a~0 (+ main_~b~0 main_~a~0))) (not (< main_~b~0 0)) (= main_~a~0 main_~x~0) (= (+ main_~q~0 main_~p~0) 0) (= main_~p~0 1))} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {8503#true} is VALID [2022-04-08 12:16:09,933 INFO L290 TraceCheckUtils]: 48: Hoare triple {8503#true} ~cond := #in~cond; {8503#true} is VALID [2022-04-08 12:16:09,933 INFO L290 TraceCheckUtils]: 49: Hoare triple {8503#true} assume !(0 == ~cond); {8503#true} is VALID [2022-04-08 12:16:09,933 INFO L290 TraceCheckUtils]: 50: Hoare triple {8503#true} assume true; {8503#true} is VALID [2022-04-08 12:16:09,934 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {8503#true} {8648#(and (= main_~r~0 0) (= (+ main_~s~0 main_~r~0) 1) (= main_~y~0 (+ main_~b~0 main_~a~0)) (<= 1 main_~x~0) (not (= main_~a~0 (+ main_~b~0 main_~a~0))) (not (< main_~b~0 0)) (= main_~a~0 main_~x~0) (= (+ main_~q~0 main_~p~0) 0) (= main_~p~0 1))} #74#return; {8648#(and (= main_~r~0 0) (= (+ main_~s~0 main_~r~0) 1) (= main_~y~0 (+ main_~b~0 main_~a~0)) (<= 1 main_~x~0) (not (= main_~a~0 (+ main_~b~0 main_~a~0))) (not (< main_~b~0 0)) (= main_~a~0 main_~x~0) (= (+ main_~q~0 main_~p~0) 0) (= main_~p~0 1))} is VALID [2022-04-08 12:16:09,934 INFO L272 TraceCheckUtils]: 52: Hoare triple {8648#(and (= main_~r~0 0) (= (+ main_~s~0 main_~r~0) 1) (= main_~y~0 (+ main_~b~0 main_~a~0)) (<= 1 main_~x~0) (not (= main_~a~0 (+ main_~b~0 main_~a~0))) (not (< main_~b~0 0)) (= main_~a~0 main_~x~0) (= (+ main_~q~0 main_~p~0) 0) (= main_~p~0 1))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {8503#true} is VALID [2022-04-08 12:16:09,934 INFO L290 TraceCheckUtils]: 53: Hoare triple {8503#true} ~cond := #in~cond; {8503#true} is VALID [2022-04-08 12:16:09,934 INFO L290 TraceCheckUtils]: 54: Hoare triple {8503#true} assume !(0 == ~cond); {8503#true} is VALID [2022-04-08 12:16:09,934 INFO L290 TraceCheckUtils]: 55: Hoare triple {8503#true} assume true; {8503#true} is VALID [2022-04-08 12:16:09,934 INFO L284 TraceCheckUtils]: 56: Hoare quadruple {8503#true} {8648#(and (= main_~r~0 0) (= (+ main_~s~0 main_~r~0) 1) (= main_~y~0 (+ main_~b~0 main_~a~0)) (<= 1 main_~x~0) (not (= main_~a~0 (+ main_~b~0 main_~a~0))) (not (< main_~b~0 0)) (= main_~a~0 main_~x~0) (= (+ main_~q~0 main_~p~0) 0) (= main_~p~0 1))} #76#return; {8648#(and (= main_~r~0 0) (= (+ main_~s~0 main_~r~0) 1) (= main_~y~0 (+ main_~b~0 main_~a~0)) (<= 1 main_~x~0) (not (= main_~a~0 (+ main_~b~0 main_~a~0))) (not (< main_~b~0 0)) (= main_~a~0 main_~x~0) (= (+ main_~q~0 main_~p~0) 0) (= main_~p~0 1))} is VALID [2022-04-08 12:16:09,935 INFO L272 TraceCheckUtils]: 57: Hoare triple {8648#(and (= main_~r~0 0) (= (+ main_~s~0 main_~r~0) 1) (= main_~y~0 (+ main_~b~0 main_~a~0)) (<= 1 main_~x~0) (not (= main_~a~0 (+ main_~b~0 main_~a~0))) (not (< main_~b~0 0)) (= main_~a~0 main_~x~0) (= (+ main_~q~0 main_~p~0) 0) (= main_~p~0 1))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {8503#true} is VALID [2022-04-08 12:16:09,935 INFO L290 TraceCheckUtils]: 58: Hoare triple {8503#true} ~cond := #in~cond; {8688#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 12:16:09,935 INFO L290 TraceCheckUtils]: 59: Hoare triple {8688#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {8692#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 12:16:09,935 INFO L290 TraceCheckUtils]: 60: Hoare triple {8692#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {8692#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 12:16:09,936 INFO L284 TraceCheckUtils]: 61: Hoare quadruple {8692#(not (= |__VERIFIER_assert_#in~cond| 0))} {8648#(and (= main_~r~0 0) (= (+ main_~s~0 main_~r~0) 1) (= main_~y~0 (+ main_~b~0 main_~a~0)) (<= 1 main_~x~0) (not (= main_~a~0 (+ main_~b~0 main_~a~0))) (not (< main_~b~0 0)) (= main_~a~0 main_~x~0) (= (+ main_~q~0 main_~p~0) 0) (= main_~p~0 1))} #78#return; {8648#(and (= main_~r~0 0) (= (+ main_~s~0 main_~r~0) 1) (= main_~y~0 (+ main_~b~0 main_~a~0)) (<= 1 main_~x~0) (not (= main_~a~0 (+ main_~b~0 main_~a~0))) (not (< main_~b~0 0)) (= main_~a~0 main_~x~0) (= (+ main_~q~0 main_~p~0) 0) (= main_~p~0 1))} is VALID [2022-04-08 12:16:09,936 INFO L290 TraceCheckUtils]: 62: Hoare triple {8648#(and (= main_~r~0 0) (= (+ main_~s~0 main_~r~0) 1) (= main_~y~0 (+ main_~b~0 main_~a~0)) (<= 1 main_~x~0) (not (= main_~a~0 (+ main_~b~0 main_~a~0))) (not (< main_~b~0 0)) (= main_~a~0 main_~x~0) (= (+ main_~q~0 main_~p~0) 0) (= main_~p~0 1))} assume !!(~a~0 != ~b~0); {8648#(and (= main_~r~0 0) (= (+ main_~s~0 main_~r~0) 1) (= main_~y~0 (+ main_~b~0 main_~a~0)) (<= 1 main_~x~0) (not (= main_~a~0 (+ main_~b~0 main_~a~0))) (not (< main_~b~0 0)) (= main_~a~0 main_~x~0) (= (+ main_~q~0 main_~p~0) 0) (= main_~p~0 1))} is VALID [2022-04-08 12:16:09,937 INFO L290 TraceCheckUtils]: 63: Hoare triple {8648#(and (= main_~r~0 0) (= (+ main_~s~0 main_~r~0) 1) (= main_~y~0 (+ main_~b~0 main_~a~0)) (<= 1 main_~x~0) (not (= main_~a~0 (+ main_~b~0 main_~a~0))) (not (< main_~b~0 0)) (= main_~a~0 main_~x~0) (= (+ main_~q~0 main_~p~0) 0) (= main_~p~0 1))} assume ~a~0 > ~b~0;~a~0 := ~a~0 - ~b~0;~p~0 := ~p~0 - ~q~0;~r~0 := ~r~0 - ~s~0; {8705#(and (< main_~y~0 (* main_~x~0 2)) (<= main_~x~0 main_~y~0) (= (+ main_~r~0 1) 0) (= main_~p~0 2) (not (= main_~y~0 main_~x~0)) (= (* main_~x~0 2) (+ main_~a~0 main_~y~0)))} is VALID [2022-04-08 12:16:09,938 INFO L290 TraceCheckUtils]: 64: Hoare triple {8705#(and (< main_~y~0 (* main_~x~0 2)) (<= main_~x~0 main_~y~0) (= (+ main_~r~0 1) 0) (= main_~p~0 2) (not (= main_~y~0 main_~x~0)) (= (* main_~x~0 2) (+ main_~a~0 main_~y~0)))} assume !false; {8705#(and (< main_~y~0 (* main_~x~0 2)) (<= main_~x~0 main_~y~0) (= (+ main_~r~0 1) 0) (= main_~p~0 2) (not (= main_~y~0 main_~x~0)) (= (* main_~x~0 2) (+ main_~a~0 main_~y~0)))} is VALID [2022-04-08 12:16:09,938 INFO L272 TraceCheckUtils]: 65: Hoare triple {8705#(and (< main_~y~0 (* main_~x~0 2)) (<= main_~x~0 main_~y~0) (= (+ main_~r~0 1) 0) (= main_~p~0 2) (not (= main_~y~0 main_~x~0)) (= (* main_~x~0 2) (+ main_~a~0 main_~y~0)))} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {8503#true} is VALID [2022-04-08 12:16:09,938 INFO L290 TraceCheckUtils]: 66: Hoare triple {8503#true} ~cond := #in~cond; {8503#true} is VALID [2022-04-08 12:16:09,938 INFO L290 TraceCheckUtils]: 67: Hoare triple {8503#true} assume !(0 == ~cond); {8503#true} is VALID [2022-04-08 12:16:09,938 INFO L290 TraceCheckUtils]: 68: Hoare triple {8503#true} assume true; {8503#true} is VALID [2022-04-08 12:16:09,938 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {8503#true} {8705#(and (< main_~y~0 (* main_~x~0 2)) (<= main_~x~0 main_~y~0) (= (+ main_~r~0 1) 0) (= main_~p~0 2) (not (= main_~y~0 main_~x~0)) (= (* main_~x~0 2) (+ main_~a~0 main_~y~0)))} #74#return; {8705#(and (< main_~y~0 (* main_~x~0 2)) (<= main_~x~0 main_~y~0) (= (+ main_~r~0 1) 0) (= main_~p~0 2) (not (= main_~y~0 main_~x~0)) (= (* main_~x~0 2) (+ main_~a~0 main_~y~0)))} is VALID [2022-04-08 12:16:09,939 INFO L272 TraceCheckUtils]: 70: Hoare triple {8705#(and (< main_~y~0 (* main_~x~0 2)) (<= main_~x~0 main_~y~0) (= (+ main_~r~0 1) 0) (= main_~p~0 2) (not (= main_~y~0 main_~x~0)) (= (* main_~x~0 2) (+ main_~a~0 main_~y~0)))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {8727#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 12:16:09,939 INFO L290 TraceCheckUtils]: 71: Hoare triple {8727#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {8731#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 12:16:09,940 INFO L290 TraceCheckUtils]: 72: Hoare triple {8731#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {8504#false} is VALID [2022-04-08 12:16:09,940 INFO L290 TraceCheckUtils]: 73: Hoare triple {8504#false} assume !false; {8504#false} is VALID [2022-04-08 12:16:09,941 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 34 proven. 19 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2022-04-08 12:16:09,941 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 12:16:38,040 INFO L290 TraceCheckUtils]: 73: Hoare triple {8504#false} assume !false; {8504#false} is VALID [2022-04-08 12:16:38,040 INFO L290 TraceCheckUtils]: 72: Hoare triple {8731#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {8504#false} is VALID [2022-04-08 12:16:38,040 INFO L290 TraceCheckUtils]: 71: Hoare triple {8727#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {8731#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 12:16:38,041 INFO L272 TraceCheckUtils]: 70: Hoare triple {8747#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {8727#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 12:16:38,042 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {8503#true} {8747#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} #74#return; {8747#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-08 12:16:38,042 INFO L290 TraceCheckUtils]: 68: Hoare triple {8503#true} assume true; {8503#true} is VALID [2022-04-08 12:16:38,042 INFO L290 TraceCheckUtils]: 67: Hoare triple {8503#true} assume !(0 == ~cond); {8503#true} is VALID [2022-04-08 12:16:38,042 INFO L290 TraceCheckUtils]: 66: Hoare triple {8503#true} ~cond := #in~cond; {8503#true} is VALID [2022-04-08 12:16:38,042 INFO L272 TraceCheckUtils]: 65: Hoare triple {8747#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {8503#true} is VALID [2022-04-08 12:16:38,042 INFO L290 TraceCheckUtils]: 64: Hoare triple {8747#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} assume !false; {8747#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-08 12:16:38,758 INFO L290 TraceCheckUtils]: 63: Hoare triple {8769#(or (= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0))))) (not (< main_~b~0 main_~a~0)))} assume ~a~0 > ~b~0;~a~0 := ~a~0 - ~b~0;~p~0 := ~p~0 - ~q~0;~r~0 := ~r~0 - ~s~0; {8747#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-08 12:16:38,759 INFO L290 TraceCheckUtils]: 62: Hoare triple {8769#(or (= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0))))) (not (< main_~b~0 main_~a~0)))} assume !!(~a~0 != ~b~0); {8769#(or (= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0))))) (not (< main_~b~0 main_~a~0)))} is VALID [2022-04-08 12:16:38,759 INFO L284 TraceCheckUtils]: 61: Hoare quadruple {8692#(not (= |__VERIFIER_assert_#in~cond| 0))} {8776#(or (= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0))))) (not (< main_~b~0 main_~a~0)) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} #78#return; {8769#(or (= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0))))) (not (< main_~b~0 main_~a~0)))} is VALID [2022-04-08 12:16:38,760 INFO L290 TraceCheckUtils]: 60: Hoare triple {8692#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {8692#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 12:16:38,760 INFO L290 TraceCheckUtils]: 59: Hoare triple {8786#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {8692#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 12:16:38,760 INFO L290 TraceCheckUtils]: 58: Hoare triple {8503#true} ~cond := #in~cond; {8786#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 12:16:38,761 INFO L272 TraceCheckUtils]: 57: Hoare triple {8776#(or (= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0))))) (not (< main_~b~0 main_~a~0)) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {8503#true} is VALID [2022-04-08 12:16:38,761 INFO L284 TraceCheckUtils]: 56: Hoare quadruple {8503#true} {8776#(or (= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0))))) (not (< main_~b~0 main_~a~0)) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} #76#return; {8776#(or (= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0))))) (not (< main_~b~0 main_~a~0)) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} is VALID [2022-04-08 12:16:38,761 INFO L290 TraceCheckUtils]: 55: Hoare triple {8503#true} assume true; {8503#true} is VALID [2022-04-08 12:16:38,761 INFO L290 TraceCheckUtils]: 54: Hoare triple {8503#true} assume !(0 == ~cond); {8503#true} is VALID [2022-04-08 12:16:38,761 INFO L290 TraceCheckUtils]: 53: Hoare triple {8503#true} ~cond := #in~cond; {8503#true} is VALID [2022-04-08 12:16:38,762 INFO L272 TraceCheckUtils]: 52: Hoare triple {8776#(or (= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0))))) (not (< main_~b~0 main_~a~0)) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {8503#true} is VALID [2022-04-08 12:16:38,763 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {8503#true} {8776#(or (= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0))))) (not (< main_~b~0 main_~a~0)) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} #74#return; {8776#(or (= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0))))) (not (< main_~b~0 main_~a~0)) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} is VALID [2022-04-08 12:16:38,763 INFO L290 TraceCheckUtils]: 50: Hoare triple {8503#true} assume true; {8503#true} is VALID [2022-04-08 12:16:38,763 INFO L290 TraceCheckUtils]: 49: Hoare triple {8503#true} assume !(0 == ~cond); {8503#true} is VALID [2022-04-08 12:16:38,763 INFO L290 TraceCheckUtils]: 48: Hoare triple {8503#true} ~cond := #in~cond; {8503#true} is VALID [2022-04-08 12:16:38,763 INFO L272 TraceCheckUtils]: 47: Hoare triple {8776#(or (= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0))))) (not (< main_~b~0 main_~a~0)) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {8503#true} is VALID [2022-04-08 12:16:38,764 INFO L290 TraceCheckUtils]: 46: Hoare triple {8776#(or (= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0))))) (not (< main_~b~0 main_~a~0)) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} assume !false; {8776#(or (= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0))))) (not (< main_~b~0 main_~a~0)) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} is VALID [2022-04-08 12:16:38,912 INFO L290 TraceCheckUtils]: 45: Hoare triple {8826#(or (not (< main_~b~0 (* main_~a~0 2))) (< main_~b~0 main_~a~0) (not (= (+ (* (+ main_~s~0 (* (- 1) main_~r~0)) main_~y~0) (* main_~x~0 (+ main_~q~0 (* (- 1) main_~p~0)))) (+ (* (- 1) main_~a~0) main_~b~0))) (= (+ (* (+ (* main_~p~0 2) (* (- 1) main_~q~0)) main_~x~0) (* (+ (* (- 1) main_~s~0) (* main_~r~0 2)) main_~y~0)) (+ (* main_~a~0 2) (* (- 1) main_~b~0))))} assume !(~a~0 > ~b~0);~b~0 := ~b~0 - ~a~0;~q~0 := ~q~0 - ~p~0;~s~0 := ~s~0 - ~r~0; {8776#(or (= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0))))) (not (< main_~b~0 main_~a~0)) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} is VALID [2022-04-08 12:16:38,913 INFO L290 TraceCheckUtils]: 44: Hoare triple {8830#(or (not (< main_~b~0 (* main_~a~0 2))) (< main_~b~0 main_~a~0) (= main_~b~0 main_~a~0) (not (= (+ (* (+ main_~s~0 (* (- 1) main_~r~0)) main_~y~0) (* main_~x~0 (+ main_~q~0 (* (- 1) main_~p~0)))) (+ (* (- 1) main_~a~0) main_~b~0))) (= (+ (* (+ (* main_~p~0 2) (* (- 1) main_~q~0)) main_~x~0) (* (+ (* (- 1) main_~s~0) (* main_~r~0 2)) main_~y~0)) (+ (* main_~a~0 2) (* (- 1) main_~b~0))))} assume !!(~a~0 != ~b~0); {8826#(or (not (< main_~b~0 (* main_~a~0 2))) (< main_~b~0 main_~a~0) (not (= (+ (* (+ main_~s~0 (* (- 1) main_~r~0)) main_~y~0) (* main_~x~0 (+ main_~q~0 (* (- 1) main_~p~0)))) (+ (* (- 1) main_~a~0) main_~b~0))) (= (+ (* (+ (* main_~p~0 2) (* (- 1) main_~q~0)) main_~x~0) (* (+ (* (- 1) main_~s~0) (* main_~r~0 2)) main_~y~0)) (+ (* main_~a~0 2) (* (- 1) main_~b~0))))} is VALID [2022-04-08 12:16:38,914 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {8503#true} {8830#(or (not (< main_~b~0 (* main_~a~0 2))) (< main_~b~0 main_~a~0) (= main_~b~0 main_~a~0) (not (= (+ (* (+ main_~s~0 (* (- 1) main_~r~0)) main_~y~0) (* main_~x~0 (+ main_~q~0 (* (- 1) main_~p~0)))) (+ (* (- 1) main_~a~0) main_~b~0))) (= (+ (* (+ (* main_~p~0 2) (* (- 1) main_~q~0)) main_~x~0) (* (+ (* (- 1) main_~s~0) (* main_~r~0 2)) main_~y~0)) (+ (* main_~a~0 2) (* (- 1) main_~b~0))))} #78#return; {8830#(or (not (< main_~b~0 (* main_~a~0 2))) (< main_~b~0 main_~a~0) (= main_~b~0 main_~a~0) (not (= (+ (* (+ main_~s~0 (* (- 1) main_~r~0)) main_~y~0) (* main_~x~0 (+ main_~q~0 (* (- 1) main_~p~0)))) (+ (* (- 1) main_~a~0) main_~b~0))) (= (+ (* (+ (* main_~p~0 2) (* (- 1) main_~q~0)) main_~x~0) (* (+ (* (- 1) main_~s~0) (* main_~r~0 2)) main_~y~0)) (+ (* main_~a~0 2) (* (- 1) main_~b~0))))} is VALID [2022-04-08 12:16:38,914 INFO L290 TraceCheckUtils]: 42: Hoare triple {8503#true} assume true; {8503#true} is VALID [2022-04-08 12:16:38,914 INFO L290 TraceCheckUtils]: 41: Hoare triple {8503#true} assume !(0 == ~cond); {8503#true} is VALID [2022-04-08 12:16:38,914 INFO L290 TraceCheckUtils]: 40: Hoare triple {8503#true} ~cond := #in~cond; {8503#true} is VALID [2022-04-08 12:16:38,914 INFO L272 TraceCheckUtils]: 39: Hoare triple {8830#(or (not (< main_~b~0 (* main_~a~0 2))) (< main_~b~0 main_~a~0) (= main_~b~0 main_~a~0) (not (= (+ (* (+ main_~s~0 (* (- 1) main_~r~0)) main_~y~0) (* main_~x~0 (+ main_~q~0 (* (- 1) main_~p~0)))) (+ (* (- 1) main_~a~0) main_~b~0))) (= (+ (* (+ (* main_~p~0 2) (* (- 1) main_~q~0)) main_~x~0) (* (+ (* (- 1) main_~s~0) (* main_~r~0 2)) main_~y~0)) (+ (* main_~a~0 2) (* (- 1) main_~b~0))))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {8503#true} is VALID [2022-04-08 12:16:38,915 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {8503#true} {8830#(or (not (< main_~b~0 (* main_~a~0 2))) (< main_~b~0 main_~a~0) (= main_~b~0 main_~a~0) (not (= (+ (* (+ main_~s~0 (* (- 1) main_~r~0)) main_~y~0) (* main_~x~0 (+ main_~q~0 (* (- 1) main_~p~0)))) (+ (* (- 1) main_~a~0) main_~b~0))) (= (+ (* (+ (* main_~p~0 2) (* (- 1) main_~q~0)) main_~x~0) (* (+ (* (- 1) main_~s~0) (* main_~r~0 2)) main_~y~0)) (+ (* main_~a~0 2) (* (- 1) main_~b~0))))} #76#return; {8830#(or (not (< main_~b~0 (* main_~a~0 2))) (< main_~b~0 main_~a~0) (= main_~b~0 main_~a~0) (not (= (+ (* (+ main_~s~0 (* (- 1) main_~r~0)) main_~y~0) (* main_~x~0 (+ main_~q~0 (* (- 1) main_~p~0)))) (+ (* (- 1) main_~a~0) main_~b~0))) (= (+ (* (+ (* main_~p~0 2) (* (- 1) main_~q~0)) main_~x~0) (* (+ (* (- 1) main_~s~0) (* main_~r~0 2)) main_~y~0)) (+ (* main_~a~0 2) (* (- 1) main_~b~0))))} is VALID [2022-04-08 12:16:38,915 INFO L290 TraceCheckUtils]: 37: Hoare triple {8503#true} assume true; {8503#true} is VALID [2022-04-08 12:16:38,915 INFO L290 TraceCheckUtils]: 36: Hoare triple {8503#true} assume !(0 == ~cond); {8503#true} is VALID [2022-04-08 12:16:38,915 INFO L290 TraceCheckUtils]: 35: Hoare triple {8503#true} ~cond := #in~cond; {8503#true} is VALID [2022-04-08 12:16:38,915 INFO L272 TraceCheckUtils]: 34: Hoare triple {8830#(or (not (< main_~b~0 (* main_~a~0 2))) (< main_~b~0 main_~a~0) (= main_~b~0 main_~a~0) (not (= (+ (* (+ main_~s~0 (* (- 1) main_~r~0)) main_~y~0) (* main_~x~0 (+ main_~q~0 (* (- 1) main_~p~0)))) (+ (* (- 1) main_~a~0) main_~b~0))) (= (+ (* (+ (* main_~p~0 2) (* (- 1) main_~q~0)) main_~x~0) (* (+ (* (- 1) main_~s~0) (* main_~r~0 2)) main_~y~0)) (+ (* main_~a~0 2) (* (- 1) main_~b~0))))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {8503#true} is VALID [2022-04-08 12:16:38,915 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {8503#true} {8830#(or (not (< main_~b~0 (* main_~a~0 2))) (< main_~b~0 main_~a~0) (= main_~b~0 main_~a~0) (not (= (+ (* (+ main_~s~0 (* (- 1) main_~r~0)) main_~y~0) (* main_~x~0 (+ main_~q~0 (* (- 1) main_~p~0)))) (+ (* (- 1) main_~a~0) main_~b~0))) (= (+ (* (+ (* main_~p~0 2) (* (- 1) main_~q~0)) main_~x~0) (* (+ (* (- 1) main_~s~0) (* main_~r~0 2)) main_~y~0)) (+ (* main_~a~0 2) (* (- 1) main_~b~0))))} #74#return; {8830#(or (not (< main_~b~0 (* main_~a~0 2))) (< main_~b~0 main_~a~0) (= main_~b~0 main_~a~0) (not (= (+ (* (+ main_~s~0 (* (- 1) main_~r~0)) main_~y~0) (* main_~x~0 (+ main_~q~0 (* (- 1) main_~p~0)))) (+ (* (- 1) main_~a~0) main_~b~0))) (= (+ (* (+ (* main_~p~0 2) (* (- 1) main_~q~0)) main_~x~0) (* (+ (* (- 1) main_~s~0) (* main_~r~0 2)) main_~y~0)) (+ (* main_~a~0 2) (* (- 1) main_~b~0))))} is VALID [2022-04-08 12:16:38,915 INFO L290 TraceCheckUtils]: 32: Hoare triple {8503#true} assume true; {8503#true} is VALID [2022-04-08 12:16:38,916 INFO L290 TraceCheckUtils]: 31: Hoare triple {8503#true} assume !(0 == ~cond); {8503#true} is VALID [2022-04-08 12:16:38,916 INFO L290 TraceCheckUtils]: 30: Hoare triple {8503#true} ~cond := #in~cond; {8503#true} is VALID [2022-04-08 12:16:38,916 INFO L272 TraceCheckUtils]: 29: Hoare triple {8830#(or (not (< main_~b~0 (* main_~a~0 2))) (< main_~b~0 main_~a~0) (= main_~b~0 main_~a~0) (not (= (+ (* (+ main_~s~0 (* (- 1) main_~r~0)) main_~y~0) (* main_~x~0 (+ main_~q~0 (* (- 1) main_~p~0)))) (+ (* (- 1) main_~a~0) main_~b~0))) (= (+ (* (+ (* main_~p~0 2) (* (- 1) main_~q~0)) main_~x~0) (* (+ (* (- 1) main_~s~0) (* main_~r~0 2)) main_~y~0)) (+ (* main_~a~0 2) (* (- 1) main_~b~0))))} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {8503#true} is VALID [2022-04-08 12:16:38,916 INFO L290 TraceCheckUtils]: 28: Hoare triple {8830#(or (not (< main_~b~0 (* main_~a~0 2))) (< main_~b~0 main_~a~0) (= main_~b~0 main_~a~0) (not (= (+ (* (+ main_~s~0 (* (- 1) main_~r~0)) main_~y~0) (* main_~x~0 (+ main_~q~0 (* (- 1) main_~p~0)))) (+ (* (- 1) main_~a~0) main_~b~0))) (= (+ (* (+ (* main_~p~0 2) (* (- 1) main_~q~0)) main_~x~0) (* (+ (* (- 1) main_~s~0) (* main_~r~0 2)) main_~y~0)) (+ (* main_~a~0 2) (* (- 1) main_~b~0))))} assume !false; {8830#(or (not (< main_~b~0 (* main_~a~0 2))) (< main_~b~0 main_~a~0) (= main_~b~0 main_~a~0) (not (= (+ (* (+ main_~s~0 (* (- 1) main_~r~0)) main_~y~0) (* main_~x~0 (+ main_~q~0 (* (- 1) main_~p~0)))) (+ (* (- 1) main_~a~0) main_~b~0))) (= (+ (* (+ (* main_~p~0 2) (* (- 1) main_~q~0)) main_~x~0) (* (+ (* (- 1) main_~s~0) (* main_~r~0 2)) main_~y~0)) (+ (* main_~a~0 2) (* (- 1) main_~b~0))))} is VALID [2022-04-08 12:16:38,917 INFO L290 TraceCheckUtils]: 27: Hoare triple {8503#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {8830#(or (not (< main_~b~0 (* main_~a~0 2))) (< main_~b~0 main_~a~0) (= main_~b~0 main_~a~0) (not (= (+ (* (+ main_~s~0 (* (- 1) main_~r~0)) main_~y~0) (* main_~x~0 (+ main_~q~0 (* (- 1) main_~p~0)))) (+ (* (- 1) main_~a~0) main_~b~0))) (= (+ (* (+ (* main_~p~0 2) (* (- 1) main_~q~0)) main_~x~0) (* (+ (* (- 1) main_~s~0) (* main_~r~0 2)) main_~y~0)) (+ (* main_~a~0 2) (* (- 1) main_~b~0))))} is VALID [2022-04-08 12:16:38,917 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {8503#true} {8503#true} #72#return; {8503#true} is VALID [2022-04-08 12:16:38,917 INFO L290 TraceCheckUtils]: 25: Hoare triple {8503#true} assume true; {8503#true} is VALID [2022-04-08 12:16:38,917 INFO L290 TraceCheckUtils]: 24: Hoare triple {8503#true} assume !(0 == ~cond); {8503#true} is VALID [2022-04-08 12:16:38,917 INFO L290 TraceCheckUtils]: 23: Hoare triple {8503#true} ~cond := #in~cond; {8503#true} is VALID [2022-04-08 12:16:38,917 INFO L272 TraceCheckUtils]: 22: Hoare triple {8503#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {8503#true} is VALID [2022-04-08 12:16:38,917 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {8503#true} {8503#true} #70#return; {8503#true} is VALID [2022-04-08 12:16:38,917 INFO L290 TraceCheckUtils]: 20: Hoare triple {8503#true} assume true; {8503#true} is VALID [2022-04-08 12:16:38,917 INFO L290 TraceCheckUtils]: 19: Hoare triple {8503#true} assume !(0 == ~cond); {8503#true} is VALID [2022-04-08 12:16:38,917 INFO L290 TraceCheckUtils]: 18: Hoare triple {8503#true} ~cond := #in~cond; {8503#true} is VALID [2022-04-08 12:16:38,917 INFO L272 TraceCheckUtils]: 17: Hoare triple {8503#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {8503#true} is VALID [2022-04-08 12:16:38,917 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {8503#true} {8503#true} #68#return; {8503#true} is VALID [2022-04-08 12:16:38,917 INFO L290 TraceCheckUtils]: 15: Hoare triple {8503#true} assume true; {8503#true} is VALID [2022-04-08 12:16:38,917 INFO L290 TraceCheckUtils]: 14: Hoare triple {8503#true} assume !(0 == ~cond); {8503#true} is VALID [2022-04-08 12:16:38,917 INFO L290 TraceCheckUtils]: 13: Hoare triple {8503#true} ~cond := #in~cond; {8503#true} is VALID [2022-04-08 12:16:38,918 INFO L272 TraceCheckUtils]: 12: Hoare triple {8503#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 5 then 1 else 0)); {8503#true} is VALID [2022-04-08 12:16:38,918 INFO L290 TraceCheckUtils]: 11: Hoare triple {8503#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {8503#true} is VALID [2022-04-08 12:16:38,918 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {8503#true} {8503#true} #66#return; {8503#true} is VALID [2022-04-08 12:16:38,918 INFO L290 TraceCheckUtils]: 9: Hoare triple {8503#true} assume true; {8503#true} is VALID [2022-04-08 12:16:38,918 INFO L290 TraceCheckUtils]: 8: Hoare triple {8503#true} assume !(0 == ~cond); {8503#true} is VALID [2022-04-08 12:16:38,918 INFO L290 TraceCheckUtils]: 7: Hoare triple {8503#true} ~cond := #in~cond; {8503#true} is VALID [2022-04-08 12:16:38,918 INFO L272 TraceCheckUtils]: 6: Hoare triple {8503#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 5 then 1 else 0)); {8503#true} is VALID [2022-04-08 12:16:38,918 INFO L290 TraceCheckUtils]: 5: Hoare triple {8503#true} havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~x~0;havoc ~y~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {8503#true} is VALID [2022-04-08 12:16:38,918 INFO L272 TraceCheckUtils]: 4: Hoare triple {8503#true} call #t~ret6 := main(); {8503#true} is VALID [2022-04-08 12:16:38,918 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8503#true} {8503#true} #88#return; {8503#true} is VALID [2022-04-08 12:16:38,918 INFO L290 TraceCheckUtils]: 2: Hoare triple {8503#true} assume true; {8503#true} is VALID [2022-04-08 12:16:38,918 INFO L290 TraceCheckUtils]: 1: Hoare triple {8503#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(10, 2);call #Ultimate.allocInit(12, 3); {8503#true} is VALID [2022-04-08 12:16:38,918 INFO L272 TraceCheckUtils]: 0: Hoare triple {8503#true} call ULTIMATE.init(); {8503#true} is VALID [2022-04-08 12:16:38,919 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 34 proven. 10 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2022-04-08 12:16:38,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 12:16:38,919 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1799433638] [2022-04-08 12:16:38,919 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 12:16:38,919 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1742474408] [2022-04-08 12:16:38,919 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1742474408] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 12:16:38,919 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 12:16:38,919 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11] total 19 [2022-04-08 12:16:38,919 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 12:16:38,919 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1800674548] [2022-04-08 12:16:38,919 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1800674548] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 12:16:38,919 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 12:16:38,919 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-08 12:16:38,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [866328618] [2022-04-08 12:16:38,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 12:16:38,920 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.076923076923077) internal successors, (27), 11 states have internal predecessors, (27), 5 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (12), 5 states have call predecessors, (12), 5 states have call successors, (12) Word has length 74 [2022-04-08 12:16:38,920 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 12:16:38,920 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 13 states have (on average 2.076923076923077) internal successors, (27), 11 states have internal predecessors, (27), 5 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (12), 5 states have call predecessors, (12), 5 states have call successors, (12) [2022-04-08 12:16:38,972 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 12:16:38,973 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-08 12:16:38,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 12:16:38,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-08 12:16:38,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=274, Unknown=0, NotChecked=0, Total=342 [2022-04-08 12:16:38,973 INFO L87 Difference]: Start difference. First operand 142 states and 177 transitions. Second operand has 13 states, 13 states have (on average 2.076923076923077) internal successors, (27), 11 states have internal predecessors, (27), 5 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (12), 5 states have call predecessors, (12), 5 states have call successors, (12) [2022-04-08 12:16:41,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:16:41,201 INFO L93 Difference]: Finished difference Result 180 states and 222 transitions. [2022-04-08 12:16:41,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-08 12:16:41,201 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.076923076923077) internal successors, (27), 11 states have internal predecessors, (27), 5 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (12), 5 states have call predecessors, (12), 5 states have call successors, (12) Word has length 74 [2022-04-08 12:16:41,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 12:16:41,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 2.076923076923077) internal successors, (27), 11 states have internal predecessors, (27), 5 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (12), 5 states have call predecessors, (12), 5 states have call successors, (12) [2022-04-08 12:16:41,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 85 transitions. [2022-04-08 12:16:41,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 2.076923076923077) internal successors, (27), 11 states have internal predecessors, (27), 5 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (12), 5 states have call predecessors, (12), 5 states have call successors, (12) [2022-04-08 12:16:41,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 85 transitions. [2022-04-08 12:16:41,216 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 85 transitions. [2022-04-08 12:16:41,330 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 12:16:41,333 INFO L225 Difference]: With dead ends: 180 [2022-04-08 12:16:41,333 INFO L226 Difference]: Without dead ends: 178 [2022-04-08 12:16:41,333 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 128 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=85, Invalid=377, Unknown=0, NotChecked=0, Total=462 [2022-04-08 12:16:41,333 INFO L913 BasicCegarLoop]: 36 mSDtfsCounter, 25 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 465 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 492 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 465 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-04-08 12:16:41,333 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [36 Valid, 163 Invalid, 492 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 465 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-04-08 12:16:41,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2022-04-08 12:16:41,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 164. [2022-04-08 12:16:41,577 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 12:16:41,577 INFO L82 GeneralOperation]: Start isEquivalent. First operand 178 states. Second operand has 164 states, 97 states have (on average 1.1443298969072164) internal successors, (111), 100 states have internal predecessors, (111), 45 states have call successors, (45), 22 states have call predecessors, (45), 21 states have return successors, (43), 41 states have call predecessors, (43), 43 states have call successors, (43) [2022-04-08 12:16:41,578 INFO L74 IsIncluded]: Start isIncluded. First operand 178 states. Second operand has 164 states, 97 states have (on average 1.1443298969072164) internal successors, (111), 100 states have internal predecessors, (111), 45 states have call successors, (45), 22 states have call predecessors, (45), 21 states have return successors, (43), 41 states have call predecessors, (43), 43 states have call successors, (43) [2022-04-08 12:16:41,587 INFO L87 Difference]: Start difference. First operand 178 states. Second operand has 164 states, 97 states have (on average 1.1443298969072164) internal successors, (111), 100 states have internal predecessors, (111), 45 states have call successors, (45), 22 states have call predecessors, (45), 21 states have return successors, (43), 41 states have call predecessors, (43), 43 states have call successors, (43) [2022-04-08 12:16:41,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:16:41,595 INFO L93 Difference]: Finished difference Result 178 states and 220 transitions. [2022-04-08 12:16:41,595 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 220 transitions. [2022-04-08 12:16:41,595 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:16:41,595 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 12:16:41,595 INFO L74 IsIncluded]: Start isIncluded. First operand has 164 states, 97 states have (on average 1.1443298969072164) internal successors, (111), 100 states have internal predecessors, (111), 45 states have call successors, (45), 22 states have call predecessors, (45), 21 states have return successors, (43), 41 states have call predecessors, (43), 43 states have call successors, (43) Second operand 178 states. [2022-04-08 12:16:41,595 INFO L87 Difference]: Start difference. First operand has 164 states, 97 states have (on average 1.1443298969072164) internal successors, (111), 100 states have internal predecessors, (111), 45 states have call successors, (45), 22 states have call predecessors, (45), 21 states have return successors, (43), 41 states have call predecessors, (43), 43 states have call successors, (43) Second operand 178 states. [2022-04-08 12:16:41,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:16:41,598 INFO L93 Difference]: Finished difference Result 178 states and 220 transitions. [2022-04-08 12:16:41,599 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 220 transitions. [2022-04-08 12:16:41,599 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:16:41,599 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 12:16:41,599 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 12:16:41,599 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 12:16:41,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 97 states have (on average 1.1443298969072164) internal successors, (111), 100 states have internal predecessors, (111), 45 states have call successors, (45), 22 states have call predecessors, (45), 21 states have return successors, (43), 41 states have call predecessors, (43), 43 states have call successors, (43) [2022-04-08 12:16:41,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 199 transitions. [2022-04-08 12:16:41,624 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 199 transitions. Word has length 74 [2022-04-08 12:16:41,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 12:16:41,625 INFO L478 AbstractCegarLoop]: Abstraction has 164 states and 199 transitions. [2022-04-08 12:16:41,626 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.076923076923077) internal successors, (27), 11 states have internal predecessors, (27), 5 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (12), 5 states have call predecessors, (12), 5 states have call successors, (12) [2022-04-08 12:16:41,626 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 164 states and 199 transitions. [2022-04-08 12:16:41,945 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 199 edges. 199 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 12:16:41,945 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 199 transitions. [2022-04-08 12:16:41,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2022-04-08 12:16:41,945 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 12:16:41,945 INFO L499 BasicCegarLoop]: trace histogram [9, 8, 8, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 12:16:41,968 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 12:16:42,146 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 12:16:42,146 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 12:16:42,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 12:16:42,146 INFO L85 PathProgramCache]: Analyzing trace with hash 15858924, now seen corresponding path program 5 times [2022-04-08 12:16:42,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 12:16:42,146 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [251194985] [2022-04-08 12:16:42,147 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 12:16:42,147 INFO L85 PathProgramCache]: Analyzing trace with hash 15858924, now seen corresponding path program 6 times [2022-04-08 12:16:42,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 12:16:42,147 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1710902724] [2022-04-08 12:16:42,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 12:16:42,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 12:16:42,158 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 12:16:42,179 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [593402935] [2022-04-08 12:16:42,179 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 12:16:42,179 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 12:16:42,179 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 12:16:42,180 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 12:16:42,226 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 12:16:42,250 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-04-08 12:16:42,250 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 12:16:42,251 INFO L263 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 24 conjunts are in the unsatisfiable core [2022-04-08 12:16:42,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 12:16:42,282 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 12:16:42,583 INFO L272 TraceCheckUtils]: 0: Hoare triple {10015#true} call ULTIMATE.init(); {10015#true} is VALID [2022-04-08 12:16:42,584 INFO L290 TraceCheckUtils]: 1: Hoare triple {10015#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(10, 2);call #Ultimate.allocInit(12, 3); {10015#true} is VALID [2022-04-08 12:16:42,584 INFO L290 TraceCheckUtils]: 2: Hoare triple {10015#true} assume true; {10015#true} is VALID [2022-04-08 12:16:42,584 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10015#true} {10015#true} #88#return; {10015#true} is VALID [2022-04-08 12:16:42,584 INFO L272 TraceCheckUtils]: 4: Hoare triple {10015#true} call #t~ret6 := main(); {10015#true} is VALID [2022-04-08 12:16:42,584 INFO L290 TraceCheckUtils]: 5: Hoare triple {10015#true} havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~x~0;havoc ~y~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {10015#true} is VALID [2022-04-08 12:16:42,584 INFO L272 TraceCheckUtils]: 6: Hoare triple {10015#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 5 then 1 else 0)); {10015#true} is VALID [2022-04-08 12:16:42,584 INFO L290 TraceCheckUtils]: 7: Hoare triple {10015#true} ~cond := #in~cond; {10015#true} is VALID [2022-04-08 12:16:42,584 INFO L290 TraceCheckUtils]: 8: Hoare triple {10015#true} assume !(0 == ~cond); {10015#true} is VALID [2022-04-08 12:16:42,584 INFO L290 TraceCheckUtils]: 9: Hoare triple {10015#true} assume true; {10015#true} is VALID [2022-04-08 12:16:42,584 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {10015#true} {10015#true} #66#return; {10015#true} is VALID [2022-04-08 12:16:42,584 INFO L290 TraceCheckUtils]: 11: Hoare triple {10015#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {10015#true} is VALID [2022-04-08 12:16:42,584 INFO L272 TraceCheckUtils]: 12: Hoare triple {10015#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 5 then 1 else 0)); {10015#true} is VALID [2022-04-08 12:16:42,584 INFO L290 TraceCheckUtils]: 13: Hoare triple {10015#true} ~cond := #in~cond; {10015#true} is VALID [2022-04-08 12:16:42,585 INFO L290 TraceCheckUtils]: 14: Hoare triple {10015#true} assume !(0 == ~cond); {10015#true} is VALID [2022-04-08 12:16:42,585 INFO L290 TraceCheckUtils]: 15: Hoare triple {10015#true} assume true; {10015#true} is VALID [2022-04-08 12:16:42,585 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {10015#true} {10015#true} #68#return; {10015#true} is VALID [2022-04-08 12:16:42,585 INFO L272 TraceCheckUtils]: 17: Hoare triple {10015#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {10015#true} is VALID [2022-04-08 12:16:42,585 INFO L290 TraceCheckUtils]: 18: Hoare triple {10015#true} ~cond := #in~cond; {10015#true} is VALID [2022-04-08 12:16:42,585 INFO L290 TraceCheckUtils]: 19: Hoare triple {10015#true} assume !(0 == ~cond); {10015#true} is VALID [2022-04-08 12:16:42,585 INFO L290 TraceCheckUtils]: 20: Hoare triple {10015#true} assume true; {10015#true} is VALID [2022-04-08 12:16:42,585 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {10015#true} {10015#true} #70#return; {10015#true} is VALID [2022-04-08 12:16:42,585 INFO L272 TraceCheckUtils]: 22: Hoare triple {10015#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {10015#true} is VALID [2022-04-08 12:16:42,585 INFO L290 TraceCheckUtils]: 23: Hoare triple {10015#true} ~cond := #in~cond; {10015#true} is VALID [2022-04-08 12:16:42,585 INFO L290 TraceCheckUtils]: 24: Hoare triple {10015#true} assume !(0 == ~cond); {10015#true} is VALID [2022-04-08 12:16:42,585 INFO L290 TraceCheckUtils]: 25: Hoare triple {10015#true} assume true; {10015#true} is VALID [2022-04-08 12:16:42,585 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {10015#true} {10015#true} #72#return; {10015#true} is VALID [2022-04-08 12:16:42,599 INFO L290 TraceCheckUtils]: 27: Hoare triple {10015#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {10101#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-08 12:16:42,600 INFO L290 TraceCheckUtils]: 28: Hoare triple {10101#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} assume !false; {10101#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-08 12:16:42,600 INFO L272 TraceCheckUtils]: 29: Hoare triple {10101#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {10015#true} is VALID [2022-04-08 12:16:42,600 INFO L290 TraceCheckUtils]: 30: Hoare triple {10015#true} ~cond := #in~cond; {10015#true} is VALID [2022-04-08 12:16:42,600 INFO L290 TraceCheckUtils]: 31: Hoare triple {10015#true} assume !(0 == ~cond); {10015#true} is VALID [2022-04-08 12:16:42,600 INFO L290 TraceCheckUtils]: 32: Hoare triple {10015#true} assume true; {10015#true} is VALID [2022-04-08 12:16:42,600 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {10015#true} {10101#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} #74#return; {10101#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-08 12:16:42,600 INFO L272 TraceCheckUtils]: 34: Hoare triple {10101#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {10015#true} is VALID [2022-04-08 12:16:42,600 INFO L290 TraceCheckUtils]: 35: Hoare triple {10015#true} ~cond := #in~cond; {10015#true} is VALID [2022-04-08 12:16:42,601 INFO L290 TraceCheckUtils]: 36: Hoare triple {10015#true} assume !(0 == ~cond); {10015#true} is VALID [2022-04-08 12:16:42,601 INFO L290 TraceCheckUtils]: 37: Hoare triple {10015#true} assume true; {10015#true} is VALID [2022-04-08 12:16:42,601 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {10015#true} {10101#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} #76#return; {10101#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-08 12:16:42,601 INFO L272 TraceCheckUtils]: 39: Hoare triple {10101#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {10015#true} is VALID [2022-04-08 12:16:42,601 INFO L290 TraceCheckUtils]: 40: Hoare triple {10015#true} ~cond := #in~cond; {10015#true} is VALID [2022-04-08 12:16:42,601 INFO L290 TraceCheckUtils]: 41: Hoare triple {10015#true} assume !(0 == ~cond); {10015#true} is VALID [2022-04-08 12:16:42,601 INFO L290 TraceCheckUtils]: 42: Hoare triple {10015#true} assume true; {10015#true} is VALID [2022-04-08 12:16:42,602 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {10015#true} {10101#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} #78#return; {10101#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-08 12:16:42,603 INFO L290 TraceCheckUtils]: 44: Hoare triple {10101#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} assume !!(~a~0 != ~b~0); {10101#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-08 12:16:42,603 INFO L290 TraceCheckUtils]: 45: Hoare triple {10101#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} assume ~a~0 > ~b~0;~a~0 := ~a~0 - ~b~0;~p~0 := ~p~0 - ~q~0;~r~0 := ~r~0 - ~s~0; {10101#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-08 12:16:42,604 INFO L290 TraceCheckUtils]: 46: Hoare triple {10101#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} assume !false; {10101#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-08 12:16:42,605 INFO L272 TraceCheckUtils]: 47: Hoare triple {10101#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {10015#true} is VALID [2022-04-08 12:16:42,605 INFO L290 TraceCheckUtils]: 48: Hoare triple {10015#true} ~cond := #in~cond; {10015#true} is VALID [2022-04-08 12:16:42,605 INFO L290 TraceCheckUtils]: 49: Hoare triple {10015#true} assume !(0 == ~cond); {10015#true} is VALID [2022-04-08 12:16:42,605 INFO L290 TraceCheckUtils]: 50: Hoare triple {10015#true} assume true; {10015#true} is VALID [2022-04-08 12:16:42,608 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {10015#true} {10101#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} #74#return; {10101#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-08 12:16:42,608 INFO L272 TraceCheckUtils]: 52: Hoare triple {10101#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {10015#true} is VALID [2022-04-08 12:16:42,608 INFO L290 TraceCheckUtils]: 53: Hoare triple {10015#true} ~cond := #in~cond; {10180#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 12:16:42,609 INFO L290 TraceCheckUtils]: 54: Hoare triple {10180#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {10184#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 12:16:42,609 INFO L290 TraceCheckUtils]: 55: Hoare triple {10184#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {10184#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 12:16:42,610 INFO L284 TraceCheckUtils]: 56: Hoare quadruple {10184#(not (= |__VERIFIER_assert_#in~cond| 0))} {10101#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} #76#return; {10191#(and (= main_~s~0 1) (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-08 12:16:42,610 INFO L272 TraceCheckUtils]: 57: Hoare triple {10191#(and (= main_~s~0 1) (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (= main_~b~0 main_~y~0) (= main_~q~0 0))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {10015#true} is VALID [2022-04-08 12:16:42,610 INFO L290 TraceCheckUtils]: 58: Hoare triple {10015#true} ~cond := #in~cond; {10015#true} is VALID [2022-04-08 12:16:42,610 INFO L290 TraceCheckUtils]: 59: Hoare triple {10015#true} assume !(0 == ~cond); {10015#true} is VALID [2022-04-08 12:16:42,610 INFO L290 TraceCheckUtils]: 60: Hoare triple {10015#true} assume true; {10015#true} is VALID [2022-04-08 12:16:42,611 INFO L284 TraceCheckUtils]: 61: Hoare quadruple {10015#true} {10191#(and (= main_~s~0 1) (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (= main_~b~0 main_~y~0) (= main_~q~0 0))} #78#return; {10191#(and (= main_~s~0 1) (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-08 12:16:42,612 INFO L290 TraceCheckUtils]: 62: Hoare triple {10191#(and (= main_~s~0 1) (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (= main_~b~0 main_~y~0) (= main_~q~0 0))} assume !!(~a~0 != ~b~0); {10191#(and (= main_~s~0 1) (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-08 12:16:42,628 INFO L290 TraceCheckUtils]: 63: Hoare triple {10191#(and (= main_~s~0 1) (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (= main_~b~0 main_~y~0) (= main_~q~0 0))} assume !(~a~0 > ~b~0);~b~0 := ~b~0 - ~a~0;~q~0 := ~q~0 - ~p~0;~s~0 := ~s~0 - ~r~0; {10213#(= (+ main_~y~0 (* (- 1) main_~b~0)) (+ (* main_~x~0 (* (- 1) main_~q~0)) (* main_~y~0 (+ (* (- 1) main_~s~0) 1))))} is VALID [2022-04-08 12:16:42,628 INFO L290 TraceCheckUtils]: 64: Hoare triple {10213#(= (+ main_~y~0 (* (- 1) main_~b~0)) (+ (* main_~x~0 (* (- 1) main_~q~0)) (* main_~y~0 (+ (* (- 1) main_~s~0) 1))))} assume !false; {10213#(= (+ main_~y~0 (* (- 1) main_~b~0)) (+ (* main_~x~0 (* (- 1) main_~q~0)) (* main_~y~0 (+ (* (- 1) main_~s~0) 1))))} is VALID [2022-04-08 12:16:42,628 INFO L272 TraceCheckUtils]: 65: Hoare triple {10213#(= (+ main_~y~0 (* (- 1) main_~b~0)) (+ (* main_~x~0 (* (- 1) main_~q~0)) (* main_~y~0 (+ (* (- 1) main_~s~0) 1))))} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {10015#true} is VALID [2022-04-08 12:16:42,628 INFO L290 TraceCheckUtils]: 66: Hoare triple {10015#true} ~cond := #in~cond; {10015#true} is VALID [2022-04-08 12:16:42,628 INFO L290 TraceCheckUtils]: 67: Hoare triple {10015#true} assume !(0 == ~cond); {10015#true} is VALID [2022-04-08 12:16:42,628 INFO L290 TraceCheckUtils]: 68: Hoare triple {10015#true} assume true; {10015#true} is VALID [2022-04-08 12:16:42,629 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {10015#true} {10213#(= (+ main_~y~0 (* (- 1) main_~b~0)) (+ (* main_~x~0 (* (- 1) main_~q~0)) (* main_~y~0 (+ (* (- 1) main_~s~0) 1))))} #74#return; {10213#(= (+ main_~y~0 (* (- 1) main_~b~0)) (+ (* main_~x~0 (* (- 1) main_~q~0)) (* main_~y~0 (+ (* (- 1) main_~s~0) 1))))} is VALID [2022-04-08 12:16:42,629 INFO L272 TraceCheckUtils]: 70: Hoare triple {10213#(= (+ main_~y~0 (* (- 1) main_~b~0)) (+ (* main_~x~0 (* (- 1) main_~q~0)) (* main_~y~0 (+ (* (- 1) main_~s~0) 1))))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {10015#true} is VALID [2022-04-08 12:16:42,629 INFO L290 TraceCheckUtils]: 71: Hoare triple {10015#true} ~cond := #in~cond; {10015#true} is VALID [2022-04-08 12:16:42,629 INFO L290 TraceCheckUtils]: 72: Hoare triple {10015#true} assume !(0 == ~cond); {10015#true} is VALID [2022-04-08 12:16:42,629 INFO L290 TraceCheckUtils]: 73: Hoare triple {10015#true} assume true; {10015#true} is VALID [2022-04-08 12:16:42,630 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {10015#true} {10213#(= (+ main_~y~0 (* (- 1) main_~b~0)) (+ (* main_~x~0 (* (- 1) main_~q~0)) (* main_~y~0 (+ (* (- 1) main_~s~0) 1))))} #76#return; {10213#(= (+ main_~y~0 (* (- 1) main_~b~0)) (+ (* main_~x~0 (* (- 1) main_~q~0)) (* main_~y~0 (+ (* (- 1) main_~s~0) 1))))} is VALID [2022-04-08 12:16:42,631 INFO L272 TraceCheckUtils]: 75: Hoare triple {10213#(= (+ main_~y~0 (* (- 1) main_~b~0)) (+ (* main_~x~0 (* (- 1) main_~q~0)) (* main_~y~0 (+ (* (- 1) main_~s~0) 1))))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {10250#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 12:16:42,631 INFO L290 TraceCheckUtils]: 76: Hoare triple {10250#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {10254#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 12:16:42,631 INFO L290 TraceCheckUtils]: 77: Hoare triple {10254#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {10016#false} is VALID [2022-04-08 12:16:42,631 INFO L290 TraceCheckUtils]: 78: Hoare triple {10016#false} assume !false; {10016#false} is VALID [2022-04-08 12:16:42,632 INFO L134 CoverageAnalysis]: Checked inductivity of 166 backedges. 30 proven. 18 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2022-04-08 12:16:42,632 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 12:17:03,030 INFO L290 TraceCheckUtils]: 78: Hoare triple {10016#false} assume !false; {10016#false} is VALID [2022-04-08 12:17:03,031 INFO L290 TraceCheckUtils]: 77: Hoare triple {10254#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {10016#false} is VALID [2022-04-08 12:17:03,032 INFO L290 TraceCheckUtils]: 76: Hoare triple {10250#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {10254#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 12:17:03,032 INFO L272 TraceCheckUtils]: 75: Hoare triple {10213#(= (+ main_~y~0 (* (- 1) main_~b~0)) (+ (* main_~x~0 (* (- 1) main_~q~0)) (* main_~y~0 (+ (* (- 1) main_~s~0) 1))))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {10250#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 12:17:03,033 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {10015#true} {10213#(= (+ main_~y~0 (* (- 1) main_~b~0)) (+ (* main_~x~0 (* (- 1) main_~q~0)) (* main_~y~0 (+ (* (- 1) main_~s~0) 1))))} #76#return; {10213#(= (+ main_~y~0 (* (- 1) main_~b~0)) (+ (* main_~x~0 (* (- 1) main_~q~0)) (* main_~y~0 (+ (* (- 1) main_~s~0) 1))))} is VALID [2022-04-08 12:17:03,033 INFO L290 TraceCheckUtils]: 73: Hoare triple {10015#true} assume true; {10015#true} is VALID [2022-04-08 12:17:03,033 INFO L290 TraceCheckUtils]: 72: Hoare triple {10015#true} assume !(0 == ~cond); {10015#true} is VALID [2022-04-08 12:17:03,033 INFO L290 TraceCheckUtils]: 71: Hoare triple {10015#true} ~cond := #in~cond; {10015#true} is VALID [2022-04-08 12:17:03,033 INFO L272 TraceCheckUtils]: 70: Hoare triple {10213#(= (+ main_~y~0 (* (- 1) main_~b~0)) (+ (* main_~x~0 (* (- 1) main_~q~0)) (* main_~y~0 (+ (* (- 1) main_~s~0) 1))))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {10015#true} is VALID [2022-04-08 12:17:03,034 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {10015#true} {10213#(= (+ main_~y~0 (* (- 1) main_~b~0)) (+ (* main_~x~0 (* (- 1) main_~q~0)) (* main_~y~0 (+ (* (- 1) main_~s~0) 1))))} #74#return; {10213#(= (+ main_~y~0 (* (- 1) main_~b~0)) (+ (* main_~x~0 (* (- 1) main_~q~0)) (* main_~y~0 (+ (* (- 1) main_~s~0) 1))))} is VALID [2022-04-08 12:17:03,034 INFO L290 TraceCheckUtils]: 68: Hoare triple {10015#true} assume true; {10015#true} is VALID [2022-04-08 12:17:03,034 INFO L290 TraceCheckUtils]: 67: Hoare triple {10015#true} assume !(0 == ~cond); {10015#true} is VALID [2022-04-08 12:17:03,034 INFO L290 TraceCheckUtils]: 66: Hoare triple {10015#true} ~cond := #in~cond; {10015#true} is VALID [2022-04-08 12:17:03,034 INFO L272 TraceCheckUtils]: 65: Hoare triple {10213#(= (+ main_~y~0 (* (- 1) main_~b~0)) (+ (* main_~x~0 (* (- 1) main_~q~0)) (* main_~y~0 (+ (* (- 1) main_~s~0) 1))))} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {10015#true} is VALID [2022-04-08 12:17:03,034 INFO L290 TraceCheckUtils]: 64: Hoare triple {10213#(= (+ main_~y~0 (* (- 1) main_~b~0)) (+ (* main_~x~0 (* (- 1) main_~q~0)) (* main_~y~0 (+ (* (- 1) main_~s~0) 1))))} assume !false; {10213#(= (+ main_~y~0 (* (- 1) main_~b~0)) (+ (* main_~x~0 (* (- 1) main_~q~0)) (* main_~y~0 (+ (* (- 1) main_~s~0) 1))))} is VALID [2022-04-08 12:17:05,036 WARN L290 TraceCheckUtils]: 63: Hoare triple {10306#(= (+ main_~a~0 main_~y~0 (* (- 1) main_~b~0)) (+ (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0))) (* (+ main_~r~0 (* (- 1) main_~s~0) 1) main_~y~0)))} assume !(~a~0 > ~b~0);~b~0 := ~b~0 - ~a~0;~q~0 := ~q~0 - ~p~0;~s~0 := ~s~0 - ~r~0; {10213#(= (+ main_~y~0 (* (- 1) main_~b~0)) (+ (* main_~x~0 (* (- 1) main_~q~0)) (* main_~y~0 (+ (* (- 1) main_~s~0) 1))))} is UNKNOWN [2022-04-08 12:17:05,037 INFO L290 TraceCheckUtils]: 62: Hoare triple {10306#(= (+ main_~a~0 main_~y~0 (* (- 1) main_~b~0)) (+ (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0))) (* (+ main_~r~0 (* (- 1) main_~s~0) 1) main_~y~0)))} assume !!(~a~0 != ~b~0); {10306#(= (+ main_~a~0 main_~y~0 (* (- 1) main_~b~0)) (+ (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0))) (* (+ main_~r~0 (* (- 1) main_~s~0) 1) main_~y~0)))} is VALID [2022-04-08 12:17:05,038 INFO L284 TraceCheckUtils]: 61: Hoare quadruple {10015#true} {10306#(= (+ main_~a~0 main_~y~0 (* (- 1) main_~b~0)) (+ (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0))) (* (+ main_~r~0 (* (- 1) main_~s~0) 1) main_~y~0)))} #78#return; {10306#(= (+ main_~a~0 main_~y~0 (* (- 1) main_~b~0)) (+ (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0))) (* (+ main_~r~0 (* (- 1) main_~s~0) 1) main_~y~0)))} is VALID [2022-04-08 12:17:05,038 INFO L290 TraceCheckUtils]: 60: Hoare triple {10015#true} assume true; {10015#true} is VALID [2022-04-08 12:17:05,038 INFO L290 TraceCheckUtils]: 59: Hoare triple {10015#true} assume !(0 == ~cond); {10015#true} is VALID [2022-04-08 12:17:05,038 INFO L290 TraceCheckUtils]: 58: Hoare triple {10015#true} ~cond := #in~cond; {10015#true} is VALID [2022-04-08 12:17:05,038 INFO L272 TraceCheckUtils]: 57: Hoare triple {10306#(= (+ main_~a~0 main_~y~0 (* (- 1) main_~b~0)) (+ (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0))) (* (+ main_~r~0 (* (- 1) main_~s~0) 1) main_~y~0)))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {10015#true} is VALID [2022-04-08 12:17:05,039 INFO L284 TraceCheckUtils]: 56: Hoare quadruple {10184#(not (= |__VERIFIER_assert_#in~cond| 0))} {10213#(= (+ main_~y~0 (* (- 1) main_~b~0)) (+ (* main_~x~0 (* (- 1) main_~q~0)) (* main_~y~0 (+ (* (- 1) main_~s~0) 1))))} #76#return; {10306#(= (+ main_~a~0 main_~y~0 (* (- 1) main_~b~0)) (+ (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0))) (* (+ main_~r~0 (* (- 1) main_~s~0) 1) main_~y~0)))} is VALID [2022-04-08 12:17:05,039 INFO L290 TraceCheckUtils]: 55: Hoare triple {10184#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {10184#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 12:17:05,040 INFO L290 TraceCheckUtils]: 54: Hoare triple {10337#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {10184#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 12:17:05,040 INFO L290 TraceCheckUtils]: 53: Hoare triple {10015#true} ~cond := #in~cond; {10337#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 12:17:05,040 INFO L272 TraceCheckUtils]: 52: Hoare triple {10213#(= (+ main_~y~0 (* (- 1) main_~b~0)) (+ (* main_~x~0 (* (- 1) main_~q~0)) (* main_~y~0 (+ (* (- 1) main_~s~0) 1))))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {10015#true} is VALID [2022-04-08 12:17:05,041 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {10015#true} {10213#(= (+ main_~y~0 (* (- 1) main_~b~0)) (+ (* main_~x~0 (* (- 1) main_~q~0)) (* main_~y~0 (+ (* (- 1) main_~s~0) 1))))} #74#return; {10213#(= (+ main_~y~0 (* (- 1) main_~b~0)) (+ (* main_~x~0 (* (- 1) main_~q~0)) (* main_~y~0 (+ (* (- 1) main_~s~0) 1))))} is VALID [2022-04-08 12:17:05,041 INFO L290 TraceCheckUtils]: 50: Hoare triple {10015#true} assume true; {10015#true} is VALID [2022-04-08 12:17:05,041 INFO L290 TraceCheckUtils]: 49: Hoare triple {10015#true} assume !(0 == ~cond); {10015#true} is VALID [2022-04-08 12:17:05,041 INFO L290 TraceCheckUtils]: 48: Hoare triple {10015#true} ~cond := #in~cond; {10015#true} is VALID [2022-04-08 12:17:05,041 INFO L272 TraceCheckUtils]: 47: Hoare triple {10213#(= (+ main_~y~0 (* (- 1) main_~b~0)) (+ (* main_~x~0 (* (- 1) main_~q~0)) (* main_~y~0 (+ (* (- 1) main_~s~0) 1))))} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {10015#true} is VALID [2022-04-08 12:17:05,041 INFO L290 TraceCheckUtils]: 46: Hoare triple {10213#(= (+ main_~y~0 (* (- 1) main_~b~0)) (+ (* main_~x~0 (* (- 1) main_~q~0)) (* main_~y~0 (+ (* (- 1) main_~s~0) 1))))} assume !false; {10213#(= (+ main_~y~0 (* (- 1) main_~b~0)) (+ (* main_~x~0 (* (- 1) main_~q~0)) (* main_~y~0 (+ (* (- 1) main_~s~0) 1))))} is VALID [2022-04-08 12:17:05,042 INFO L290 TraceCheckUtils]: 45: Hoare triple {10213#(= (+ main_~y~0 (* (- 1) main_~b~0)) (+ (* main_~x~0 (* (- 1) main_~q~0)) (* main_~y~0 (+ (* (- 1) main_~s~0) 1))))} assume ~a~0 > ~b~0;~a~0 := ~a~0 - ~b~0;~p~0 := ~p~0 - ~q~0;~r~0 := ~r~0 - ~s~0; {10213#(= (+ main_~y~0 (* (- 1) main_~b~0)) (+ (* main_~x~0 (* (- 1) main_~q~0)) (* main_~y~0 (+ (* (- 1) main_~s~0) 1))))} is VALID [2022-04-08 12:17:05,042 INFO L290 TraceCheckUtils]: 44: Hoare triple {10213#(= (+ main_~y~0 (* (- 1) main_~b~0)) (+ (* main_~x~0 (* (- 1) main_~q~0)) (* main_~y~0 (+ (* (- 1) main_~s~0) 1))))} assume !!(~a~0 != ~b~0); {10213#(= (+ main_~y~0 (* (- 1) main_~b~0)) (+ (* main_~x~0 (* (- 1) main_~q~0)) (* main_~y~0 (+ (* (- 1) main_~s~0) 1))))} is VALID [2022-04-08 12:17:05,043 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {10015#true} {10213#(= (+ main_~y~0 (* (- 1) main_~b~0)) (+ (* main_~x~0 (* (- 1) main_~q~0)) (* main_~y~0 (+ (* (- 1) main_~s~0) 1))))} #78#return; {10213#(= (+ main_~y~0 (* (- 1) main_~b~0)) (+ (* main_~x~0 (* (- 1) main_~q~0)) (* main_~y~0 (+ (* (- 1) main_~s~0) 1))))} is VALID [2022-04-08 12:17:05,043 INFO L290 TraceCheckUtils]: 42: Hoare triple {10015#true} assume true; {10015#true} is VALID [2022-04-08 12:17:05,043 INFO L290 TraceCheckUtils]: 41: Hoare triple {10015#true} assume !(0 == ~cond); {10015#true} is VALID [2022-04-08 12:17:05,043 INFO L290 TraceCheckUtils]: 40: Hoare triple {10015#true} ~cond := #in~cond; {10015#true} is VALID [2022-04-08 12:17:05,043 INFO L272 TraceCheckUtils]: 39: Hoare triple {10213#(= (+ main_~y~0 (* (- 1) main_~b~0)) (+ (* main_~x~0 (* (- 1) main_~q~0)) (* main_~y~0 (+ (* (- 1) main_~s~0) 1))))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {10015#true} is VALID [2022-04-08 12:17:05,043 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {10015#true} {10213#(= (+ main_~y~0 (* (- 1) main_~b~0)) (+ (* main_~x~0 (* (- 1) main_~q~0)) (* main_~y~0 (+ (* (- 1) main_~s~0) 1))))} #76#return; {10213#(= (+ main_~y~0 (* (- 1) main_~b~0)) (+ (* main_~x~0 (* (- 1) main_~q~0)) (* main_~y~0 (+ (* (- 1) main_~s~0) 1))))} is VALID [2022-04-08 12:17:05,044 INFO L290 TraceCheckUtils]: 37: Hoare triple {10015#true} assume true; {10015#true} is VALID [2022-04-08 12:17:05,044 INFO L290 TraceCheckUtils]: 36: Hoare triple {10015#true} assume !(0 == ~cond); {10015#true} is VALID [2022-04-08 12:17:05,044 INFO L290 TraceCheckUtils]: 35: Hoare triple {10015#true} ~cond := #in~cond; {10015#true} is VALID [2022-04-08 12:17:05,044 INFO L272 TraceCheckUtils]: 34: Hoare triple {10213#(= (+ main_~y~0 (* (- 1) main_~b~0)) (+ (* main_~x~0 (* (- 1) main_~q~0)) (* main_~y~0 (+ (* (- 1) main_~s~0) 1))))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {10015#true} is VALID [2022-04-08 12:17:05,044 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {10015#true} {10213#(= (+ main_~y~0 (* (- 1) main_~b~0)) (+ (* main_~x~0 (* (- 1) main_~q~0)) (* main_~y~0 (+ (* (- 1) main_~s~0) 1))))} #74#return; {10213#(= (+ main_~y~0 (* (- 1) main_~b~0)) (+ (* main_~x~0 (* (- 1) main_~q~0)) (* main_~y~0 (+ (* (- 1) main_~s~0) 1))))} is VALID [2022-04-08 12:17:05,044 INFO L290 TraceCheckUtils]: 32: Hoare triple {10015#true} assume true; {10015#true} is VALID [2022-04-08 12:17:05,044 INFO L290 TraceCheckUtils]: 31: Hoare triple {10015#true} assume !(0 == ~cond); {10015#true} is VALID [2022-04-08 12:17:05,044 INFO L290 TraceCheckUtils]: 30: Hoare triple {10015#true} ~cond := #in~cond; {10015#true} is VALID [2022-04-08 12:17:05,044 INFO L272 TraceCheckUtils]: 29: Hoare triple {10213#(= (+ main_~y~0 (* (- 1) main_~b~0)) (+ (* main_~x~0 (* (- 1) main_~q~0)) (* main_~y~0 (+ (* (- 1) main_~s~0) 1))))} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {10015#true} is VALID [2022-04-08 12:17:05,045 INFO L290 TraceCheckUtils]: 28: Hoare triple {10213#(= (+ main_~y~0 (* (- 1) main_~b~0)) (+ (* main_~x~0 (* (- 1) main_~q~0)) (* main_~y~0 (+ (* (- 1) main_~s~0) 1))))} assume !false; {10213#(= (+ main_~y~0 (* (- 1) main_~b~0)) (+ (* main_~x~0 (* (- 1) main_~q~0)) (* main_~y~0 (+ (* (- 1) main_~s~0) 1))))} is VALID [2022-04-08 12:17:05,045 INFO L290 TraceCheckUtils]: 27: Hoare triple {10015#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {10213#(= (+ main_~y~0 (* (- 1) main_~b~0)) (+ (* main_~x~0 (* (- 1) main_~q~0)) (* main_~y~0 (+ (* (- 1) main_~s~0) 1))))} is VALID [2022-04-08 12:17:05,045 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {10015#true} {10015#true} #72#return; {10015#true} is VALID [2022-04-08 12:17:05,045 INFO L290 TraceCheckUtils]: 25: Hoare triple {10015#true} assume true; {10015#true} is VALID [2022-04-08 12:17:05,045 INFO L290 TraceCheckUtils]: 24: Hoare triple {10015#true} assume !(0 == ~cond); {10015#true} is VALID [2022-04-08 12:17:05,045 INFO L290 TraceCheckUtils]: 23: Hoare triple {10015#true} ~cond := #in~cond; {10015#true} is VALID [2022-04-08 12:17:05,045 INFO L272 TraceCheckUtils]: 22: Hoare triple {10015#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {10015#true} is VALID [2022-04-08 12:17:05,046 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {10015#true} {10015#true} #70#return; {10015#true} is VALID [2022-04-08 12:17:05,046 INFO L290 TraceCheckUtils]: 20: Hoare triple {10015#true} assume true; {10015#true} is VALID [2022-04-08 12:17:05,046 INFO L290 TraceCheckUtils]: 19: Hoare triple {10015#true} assume !(0 == ~cond); {10015#true} is VALID [2022-04-08 12:17:05,046 INFO L290 TraceCheckUtils]: 18: Hoare triple {10015#true} ~cond := #in~cond; {10015#true} is VALID [2022-04-08 12:17:05,046 INFO L272 TraceCheckUtils]: 17: Hoare triple {10015#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {10015#true} is VALID [2022-04-08 12:17:05,046 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {10015#true} {10015#true} #68#return; {10015#true} is VALID [2022-04-08 12:17:05,046 INFO L290 TraceCheckUtils]: 15: Hoare triple {10015#true} assume true; {10015#true} is VALID [2022-04-08 12:17:05,046 INFO L290 TraceCheckUtils]: 14: Hoare triple {10015#true} assume !(0 == ~cond); {10015#true} is VALID [2022-04-08 12:17:05,046 INFO L290 TraceCheckUtils]: 13: Hoare triple {10015#true} ~cond := #in~cond; {10015#true} is VALID [2022-04-08 12:17:05,046 INFO L272 TraceCheckUtils]: 12: Hoare triple {10015#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 5 then 1 else 0)); {10015#true} is VALID [2022-04-08 12:17:05,046 INFO L290 TraceCheckUtils]: 11: Hoare triple {10015#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {10015#true} is VALID [2022-04-08 12:17:05,046 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {10015#true} {10015#true} #66#return; {10015#true} is VALID [2022-04-08 12:17:05,046 INFO L290 TraceCheckUtils]: 9: Hoare triple {10015#true} assume true; {10015#true} is VALID [2022-04-08 12:17:05,046 INFO L290 TraceCheckUtils]: 8: Hoare triple {10015#true} assume !(0 == ~cond); {10015#true} is VALID [2022-04-08 12:17:05,046 INFO L290 TraceCheckUtils]: 7: Hoare triple {10015#true} ~cond := #in~cond; {10015#true} is VALID [2022-04-08 12:17:05,046 INFO L272 TraceCheckUtils]: 6: Hoare triple {10015#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 5 then 1 else 0)); {10015#true} is VALID [2022-04-08 12:17:05,046 INFO L290 TraceCheckUtils]: 5: Hoare triple {10015#true} havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~x~0;havoc ~y~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {10015#true} is VALID [2022-04-08 12:17:05,046 INFO L272 TraceCheckUtils]: 4: Hoare triple {10015#true} call #t~ret6 := main(); {10015#true} is VALID [2022-04-08 12:17:05,046 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10015#true} {10015#true} #88#return; {10015#true} is VALID [2022-04-08 12:17:05,047 INFO L290 TraceCheckUtils]: 2: Hoare triple {10015#true} assume true; {10015#true} is VALID [2022-04-08 12:17:05,047 INFO L290 TraceCheckUtils]: 1: Hoare triple {10015#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(10, 2);call #Ultimate.allocInit(12, 3); {10015#true} is VALID [2022-04-08 12:17:05,047 INFO L272 TraceCheckUtils]: 0: Hoare triple {10015#true} call ULTIMATE.init(); {10015#true} is VALID [2022-04-08 12:17:05,047 INFO L134 CoverageAnalysis]: Checked inductivity of 166 backedges. 27 proven. 14 refuted. 0 times theorem prover too weak. 125 trivial. 0 not checked. [2022-04-08 12:17:05,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 12:17:05,047 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1710902724] [2022-04-08 12:17:05,047 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 12:17:05,047 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [593402935] [2022-04-08 12:17:05,047 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [593402935] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 12:17:05,047 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 12:17:05,047 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 11 [2022-04-08 12:17:05,048 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 12:17:05,048 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [251194985] [2022-04-08 12:17:05,048 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [251194985] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 12:17:05,048 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 12:17:05,048 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-08 12:17:05,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [447236872] [2022-04-08 12:17:05,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 12:17:05,049 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 8 states have internal predecessors, (23), 4 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) Word has length 79 [2022-04-08 12:17:05,049 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 12:17:05,050 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 8 states have internal predecessors, (23), 4 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) [2022-04-08 12:17:05,099 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 12:17:05,099 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-08 12:17:05,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 12:17:05,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-08 12:17:05,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-04-08 12:17:05,100 INFO L87 Difference]: Start difference. First operand 164 states and 199 transitions. Second operand has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 8 states have internal predecessors, (23), 4 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) [2022-04-08 12:17:06,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:17:06,251 INFO L93 Difference]: Finished difference Result 178 states and 218 transitions. [2022-04-08 12:17:06,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-08 12:17:06,251 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 8 states have internal predecessors, (23), 4 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) Word has length 79 [2022-04-08 12:17:06,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 12:17:06,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 8 states have internal predecessors, (23), 4 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) [2022-04-08 12:17:06,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 64 transitions. [2022-04-08 12:17:06,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 8 states have internal predecessors, (23), 4 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) [2022-04-08 12:17:06,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 64 transitions. [2022-04-08 12:17:06,253 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 64 transitions. [2022-04-08 12:17:06,354 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 12:17:06,357 INFO L225 Difference]: With dead ends: 178 [2022-04-08 12:17:06,357 INFO L226 Difference]: Without dead ends: 165 [2022-04-08 12:17:06,357 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 145 SyntacticMatches, 3 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2022-04-08 12:17:06,358 INFO L913 BasicCegarLoop]: 31 mSDtfsCounter, 14 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 196 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-08 12:17:06,358 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [19 Valid, 169 Invalid, 204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 196 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-08 12:17:06,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2022-04-08 12:17:06,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 145. [2022-04-08 12:17:06,576 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 12:17:06,579 INFO L82 GeneralOperation]: Start isEquivalent. First operand 165 states. Second operand has 145 states, 88 states have (on average 1.0909090909090908) internal successors, (96), 92 states have internal predecessors, (96), 36 states have call successors, (36), 21 states have call predecessors, (36), 20 states have return successors, (35), 31 states have call predecessors, (35), 35 states have call successors, (35) [2022-04-08 12:17:06,580 INFO L74 IsIncluded]: Start isIncluded. First operand 165 states. Second operand has 145 states, 88 states have (on average 1.0909090909090908) internal successors, (96), 92 states have internal predecessors, (96), 36 states have call successors, (36), 21 states have call predecessors, (36), 20 states have return successors, (35), 31 states have call predecessors, (35), 35 states have call successors, (35) [2022-04-08 12:17:06,580 INFO L87 Difference]: Start difference. First operand 165 states. Second operand has 145 states, 88 states have (on average 1.0909090909090908) internal successors, (96), 92 states have internal predecessors, (96), 36 states have call successors, (36), 21 states have call predecessors, (36), 20 states have return successors, (35), 31 states have call predecessors, (35), 35 states have call successors, (35) [2022-04-08 12:17:06,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:17:06,601 INFO L93 Difference]: Finished difference Result 165 states and 197 transitions. [2022-04-08 12:17:06,601 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 197 transitions. [2022-04-08 12:17:06,602 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:17:06,602 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 12:17:06,602 INFO L74 IsIncluded]: Start isIncluded. First operand has 145 states, 88 states have (on average 1.0909090909090908) internal successors, (96), 92 states have internal predecessors, (96), 36 states have call successors, (36), 21 states have call predecessors, (36), 20 states have return successors, (35), 31 states have call predecessors, (35), 35 states have call successors, (35) Second operand 165 states. [2022-04-08 12:17:06,602 INFO L87 Difference]: Start difference. First operand has 145 states, 88 states have (on average 1.0909090909090908) internal successors, (96), 92 states have internal predecessors, (96), 36 states have call successors, (36), 21 states have call predecessors, (36), 20 states have return successors, (35), 31 states have call predecessors, (35), 35 states have call successors, (35) Second operand 165 states. [2022-04-08 12:17:06,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:17:06,605 INFO L93 Difference]: Finished difference Result 165 states and 197 transitions. [2022-04-08 12:17:06,605 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 197 transitions. [2022-04-08 12:17:06,605 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:17:06,605 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 12:17:06,605 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 12:17:06,605 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 12:17:06,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 88 states have (on average 1.0909090909090908) internal successors, (96), 92 states have internal predecessors, (96), 36 states have call successors, (36), 21 states have call predecessors, (36), 20 states have return successors, (35), 31 states have call predecessors, (35), 35 states have call successors, (35) [2022-04-08 12:17:06,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 167 transitions. [2022-04-08 12:17:06,608 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 167 transitions. Word has length 79 [2022-04-08 12:17:06,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 12:17:06,608 INFO L478 AbstractCegarLoop]: Abstraction has 145 states and 167 transitions. [2022-04-08 12:17:06,608 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 8 states have internal predecessors, (23), 4 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) [2022-04-08 12:17:06,608 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 145 states and 167 transitions. [2022-04-08 12:17:08,918 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 167 edges. 166 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-08 12:17:08,918 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 167 transitions. [2022-04-08 12:17:08,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2022-04-08 12:17:08,919 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 12:17:08,919 INFO L499 BasicCegarLoop]: trace histogram [9, 8, 8, 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, 1, 1, 1, 1] [2022-04-08 12:17:08,938 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 12:17:09,119 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 12:17:09,120 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 12:17:09,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 12:17:09,120 INFO L85 PathProgramCache]: Analyzing trace with hash 2066842922, now seen corresponding path program 3 times [2022-04-08 12:17:09,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 12:17:09,120 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [850473607] [2022-04-08 12:17:09,120 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 12:17:09,120 INFO L85 PathProgramCache]: Analyzing trace with hash 2066842922, now seen corresponding path program 4 times [2022-04-08 12:17:09,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 12:17:09,121 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [818464662] [2022-04-08 12:17:09,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 12:17:09,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 12:17:09,137 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 12:17:09,137 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1480318699] [2022-04-08 12:17:09,137 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 12:17:09,137 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 12:17:09,137 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 12:17:09,140 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 12:17:09,141 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 12:17:09,489 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 12:17:09,489 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 12:17:09,490 INFO L263 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 41 conjunts are in the unsatisfiable core [2022-04-08 12:17:09,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 12:17:09,979 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 12:17:12,944 INFO L272 TraceCheckUtils]: 0: Hoare triple {11479#true} call ULTIMATE.init(); {11479#true} is VALID [2022-04-08 12:17:12,944 INFO L290 TraceCheckUtils]: 1: Hoare triple {11479#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(10, 2);call #Ultimate.allocInit(12, 3); {11479#true} is VALID [2022-04-08 12:17:12,944 INFO L290 TraceCheckUtils]: 2: Hoare triple {11479#true} assume true; {11479#true} is VALID [2022-04-08 12:17:12,944 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11479#true} {11479#true} #88#return; {11479#true} is VALID [2022-04-08 12:17:12,945 INFO L272 TraceCheckUtils]: 4: Hoare triple {11479#true} call #t~ret6 := main(); {11479#true} is VALID [2022-04-08 12:17:12,945 INFO L290 TraceCheckUtils]: 5: Hoare triple {11479#true} havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~x~0;havoc ~y~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {11479#true} is VALID [2022-04-08 12:17:12,945 INFO L272 TraceCheckUtils]: 6: Hoare triple {11479#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 5 then 1 else 0)); {11479#true} is VALID [2022-04-08 12:17:12,945 INFO L290 TraceCheckUtils]: 7: Hoare triple {11479#true} ~cond := #in~cond; {11479#true} is VALID [2022-04-08 12:17:12,945 INFO L290 TraceCheckUtils]: 8: Hoare triple {11479#true} assume !(0 == ~cond); {11479#true} is VALID [2022-04-08 12:17:12,945 INFO L290 TraceCheckUtils]: 9: Hoare triple {11479#true} assume true; {11479#true} is VALID [2022-04-08 12:17:12,945 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {11479#true} {11479#true} #66#return; {11479#true} is VALID [2022-04-08 12:17:12,945 INFO L290 TraceCheckUtils]: 11: Hoare triple {11479#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {11479#true} is VALID [2022-04-08 12:17:12,945 INFO L272 TraceCheckUtils]: 12: Hoare triple {11479#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 5 then 1 else 0)); {11479#true} is VALID [2022-04-08 12:17:12,945 INFO L290 TraceCheckUtils]: 13: Hoare triple {11479#true} ~cond := #in~cond; {11479#true} is VALID [2022-04-08 12:17:12,945 INFO L290 TraceCheckUtils]: 14: Hoare triple {11479#true} assume !(0 == ~cond); {11479#true} is VALID [2022-04-08 12:17:12,945 INFO L290 TraceCheckUtils]: 15: Hoare triple {11479#true} assume true; {11479#true} is VALID [2022-04-08 12:17:12,945 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {11479#true} {11479#true} #68#return; {11479#true} is VALID [2022-04-08 12:17:12,945 INFO L272 TraceCheckUtils]: 17: Hoare triple {11479#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {11479#true} is VALID [2022-04-08 12:17:12,946 INFO L290 TraceCheckUtils]: 18: Hoare triple {11479#true} ~cond := #in~cond; {11538#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-08 12:17:12,946 INFO L290 TraceCheckUtils]: 19: Hoare triple {11538#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {11542#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-08 12:17:12,946 INFO L290 TraceCheckUtils]: 20: Hoare triple {11542#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {11542#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-08 12:17:12,947 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {11542#(not (= |assume_abort_if_not_#in~cond| 0))} {11479#true} #70#return; {11549#(<= 1 main_~x~0)} is VALID [2022-04-08 12:17:12,947 INFO L272 TraceCheckUtils]: 22: Hoare triple {11549#(<= 1 main_~x~0)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {11479#true} is VALID [2022-04-08 12:17:12,947 INFO L290 TraceCheckUtils]: 23: Hoare triple {11479#true} ~cond := #in~cond; {11479#true} is VALID [2022-04-08 12:17:12,947 INFO L290 TraceCheckUtils]: 24: Hoare triple {11479#true} assume !(0 == ~cond); {11479#true} is VALID [2022-04-08 12:17:12,947 INFO L290 TraceCheckUtils]: 25: Hoare triple {11479#true} assume true; {11479#true} is VALID [2022-04-08 12:17:12,947 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {11479#true} {11549#(<= 1 main_~x~0)} #72#return; {11549#(<= 1 main_~x~0)} is VALID [2022-04-08 12:17:12,948 INFO L290 TraceCheckUtils]: 27: Hoare triple {11549#(<= 1 main_~x~0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {11568#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (<= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-08 12:17:12,948 INFO L290 TraceCheckUtils]: 28: Hoare triple {11568#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (<= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !false; {11568#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (<= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-08 12:17:12,948 INFO L272 TraceCheckUtils]: 29: Hoare triple {11568#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (<= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {11479#true} is VALID [2022-04-08 12:17:12,948 INFO L290 TraceCheckUtils]: 30: Hoare triple {11479#true} ~cond := #in~cond; {11479#true} is VALID [2022-04-08 12:17:12,948 INFO L290 TraceCheckUtils]: 31: Hoare triple {11479#true} assume !(0 == ~cond); {11479#true} is VALID [2022-04-08 12:17:12,948 INFO L290 TraceCheckUtils]: 32: Hoare triple {11479#true} assume true; {11479#true} is VALID [2022-04-08 12:17:12,949 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {11479#true} {11568#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (<= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #74#return; {11568#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (<= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-08 12:17:12,949 INFO L272 TraceCheckUtils]: 34: Hoare triple {11568#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (<= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {11479#true} is VALID [2022-04-08 12:17:12,949 INFO L290 TraceCheckUtils]: 35: Hoare triple {11479#true} ~cond := #in~cond; {11479#true} is VALID [2022-04-08 12:17:12,949 INFO L290 TraceCheckUtils]: 36: Hoare triple {11479#true} assume !(0 == ~cond); {11479#true} is VALID [2022-04-08 12:17:12,949 INFO L290 TraceCheckUtils]: 37: Hoare triple {11479#true} assume true; {11479#true} is VALID [2022-04-08 12:17:12,950 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {11479#true} {11568#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (<= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #76#return; {11568#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (<= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-08 12:17:12,950 INFO L272 TraceCheckUtils]: 39: Hoare triple {11568#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (<= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {11479#true} is VALID [2022-04-08 12:17:12,950 INFO L290 TraceCheckUtils]: 40: Hoare triple {11479#true} ~cond := #in~cond; {11608#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 12:17:12,950 INFO L290 TraceCheckUtils]: 41: Hoare triple {11608#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {11612#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 12:17:12,951 INFO L290 TraceCheckUtils]: 42: Hoare triple {11612#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {11612#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 12:17:12,951 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {11612#(not (= |__VERIFIER_assert_#in~cond| 0))} {11568#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (<= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #78#return; {11619#(and (= main_~r~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (<= 1 main_~x~0) (= main_~s~0 1) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-08 12:17:12,952 INFO L290 TraceCheckUtils]: 44: Hoare triple {11619#(and (= main_~r~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (<= 1 main_~x~0) (= main_~s~0 1) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !!(~a~0 != ~b~0); {11619#(and (= main_~r~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (<= 1 main_~x~0) (= main_~s~0 1) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-08 12:17:12,953 INFO L290 TraceCheckUtils]: 45: Hoare triple {11619#(and (= main_~r~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (<= 1 main_~x~0) (= main_~s~0 1) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !(~a~0 > ~b~0);~b~0 := ~b~0 - ~a~0;~q~0 := ~q~0 - ~p~0;~s~0 := ~s~0 - ~r~0; {11626#(and (= main_~r~0 0) (= (+ main_~s~0 main_~r~0) 1) (= main_~b~0 (+ (* (- 1) main_~a~0) (* (+ main_~s~0 main_~r~0) main_~y~0) (* (+ main_~q~0 main_~p~0) main_~x~0))) (<= 1 main_~x~0) (= main_~a~0 main_~x~0) (= (+ main_~q~0 main_~p~0) 0) (= main_~p~0 1))} is VALID [2022-04-08 12:17:12,953 INFO L290 TraceCheckUtils]: 46: Hoare triple {11626#(and (= main_~r~0 0) (= (+ main_~s~0 main_~r~0) 1) (= main_~b~0 (+ (* (- 1) main_~a~0) (* (+ main_~s~0 main_~r~0) main_~y~0) (* (+ main_~q~0 main_~p~0) main_~x~0))) (<= 1 main_~x~0) (= main_~a~0 main_~x~0) (= (+ main_~q~0 main_~p~0) 0) (= main_~p~0 1))} assume !false; {11626#(and (= main_~r~0 0) (= (+ main_~s~0 main_~r~0) 1) (= main_~b~0 (+ (* (- 1) main_~a~0) (* (+ main_~s~0 main_~r~0) main_~y~0) (* (+ main_~q~0 main_~p~0) main_~x~0))) (<= 1 main_~x~0) (= main_~a~0 main_~x~0) (= (+ main_~q~0 main_~p~0) 0) (= main_~p~0 1))} is VALID [2022-04-08 12:17:12,953 INFO L272 TraceCheckUtils]: 47: Hoare triple {11626#(and (= main_~r~0 0) (= (+ main_~s~0 main_~r~0) 1) (= main_~b~0 (+ (* (- 1) main_~a~0) (* (+ main_~s~0 main_~r~0) main_~y~0) (* (+ main_~q~0 main_~p~0) main_~x~0))) (<= 1 main_~x~0) (= main_~a~0 main_~x~0) (= (+ main_~q~0 main_~p~0) 0) (= main_~p~0 1))} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {11479#true} is VALID [2022-04-08 12:17:12,953 INFO L290 TraceCheckUtils]: 48: Hoare triple {11479#true} ~cond := #in~cond; {11479#true} is VALID [2022-04-08 12:17:12,953 INFO L290 TraceCheckUtils]: 49: Hoare triple {11479#true} assume !(0 == ~cond); {11479#true} is VALID [2022-04-08 12:17:12,953 INFO L290 TraceCheckUtils]: 50: Hoare triple {11479#true} assume true; {11479#true} is VALID [2022-04-08 12:17:12,954 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {11479#true} {11626#(and (= main_~r~0 0) (= (+ main_~s~0 main_~r~0) 1) (= main_~b~0 (+ (* (- 1) main_~a~0) (* (+ main_~s~0 main_~r~0) main_~y~0) (* (+ main_~q~0 main_~p~0) main_~x~0))) (<= 1 main_~x~0) (= main_~a~0 main_~x~0) (= (+ main_~q~0 main_~p~0) 0) (= main_~p~0 1))} #74#return; {11626#(and (= main_~r~0 0) (= (+ main_~s~0 main_~r~0) 1) (= main_~b~0 (+ (* (- 1) main_~a~0) (* (+ main_~s~0 main_~r~0) main_~y~0) (* (+ main_~q~0 main_~p~0) main_~x~0))) (<= 1 main_~x~0) (= main_~a~0 main_~x~0) (= (+ main_~q~0 main_~p~0) 0) (= main_~p~0 1))} is VALID [2022-04-08 12:17:12,954 INFO L272 TraceCheckUtils]: 52: Hoare triple {11626#(and (= main_~r~0 0) (= (+ main_~s~0 main_~r~0) 1) (= main_~b~0 (+ (* (- 1) main_~a~0) (* (+ main_~s~0 main_~r~0) main_~y~0) (* (+ main_~q~0 main_~p~0) main_~x~0))) (<= 1 main_~x~0) (= main_~a~0 main_~x~0) (= (+ main_~q~0 main_~p~0) 0) (= main_~p~0 1))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {11479#true} is VALID [2022-04-08 12:17:12,954 INFO L290 TraceCheckUtils]: 53: Hoare triple {11479#true} ~cond := #in~cond; {11479#true} is VALID [2022-04-08 12:17:12,954 INFO L290 TraceCheckUtils]: 54: Hoare triple {11479#true} assume !(0 == ~cond); {11479#true} is VALID [2022-04-08 12:17:12,954 INFO L290 TraceCheckUtils]: 55: Hoare triple {11479#true} assume true; {11479#true} is VALID [2022-04-08 12:17:12,955 INFO L284 TraceCheckUtils]: 56: Hoare quadruple {11479#true} {11626#(and (= main_~r~0 0) (= (+ main_~s~0 main_~r~0) 1) (= main_~b~0 (+ (* (- 1) main_~a~0) (* (+ main_~s~0 main_~r~0) main_~y~0) (* (+ main_~q~0 main_~p~0) main_~x~0))) (<= 1 main_~x~0) (= main_~a~0 main_~x~0) (= (+ main_~q~0 main_~p~0) 0) (= main_~p~0 1))} #76#return; {11626#(and (= main_~r~0 0) (= (+ main_~s~0 main_~r~0) 1) (= main_~b~0 (+ (* (- 1) main_~a~0) (* (+ main_~s~0 main_~r~0) main_~y~0) (* (+ main_~q~0 main_~p~0) main_~x~0))) (<= 1 main_~x~0) (= main_~a~0 main_~x~0) (= (+ main_~q~0 main_~p~0) 0) (= main_~p~0 1))} is VALID [2022-04-08 12:17:12,955 INFO L272 TraceCheckUtils]: 57: Hoare triple {11626#(and (= main_~r~0 0) (= (+ main_~s~0 main_~r~0) 1) (= main_~b~0 (+ (* (- 1) main_~a~0) (* (+ main_~s~0 main_~r~0) main_~y~0) (* (+ main_~q~0 main_~p~0) main_~x~0))) (<= 1 main_~x~0) (= main_~a~0 main_~x~0) (= (+ main_~q~0 main_~p~0) 0) (= main_~p~0 1))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {11479#true} is VALID [2022-04-08 12:17:12,955 INFO L290 TraceCheckUtils]: 58: Hoare triple {11479#true} ~cond := #in~cond; {11608#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 12:17:12,955 INFO L290 TraceCheckUtils]: 59: Hoare triple {11608#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {11612#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 12:17:12,956 INFO L290 TraceCheckUtils]: 60: Hoare triple {11612#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {11612#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 12:17:12,956 INFO L284 TraceCheckUtils]: 61: Hoare quadruple {11612#(not (= |__VERIFIER_assert_#in~cond| 0))} {11626#(and (= main_~r~0 0) (= (+ main_~s~0 main_~r~0) 1) (= main_~b~0 (+ (* (- 1) main_~a~0) (* (+ main_~s~0 main_~r~0) main_~y~0) (* (+ main_~q~0 main_~p~0) main_~x~0))) (<= 1 main_~x~0) (= main_~a~0 main_~x~0) (= (+ main_~q~0 main_~p~0) 0) (= main_~p~0 1))} #78#return; {11626#(and (= main_~r~0 0) (= (+ main_~s~0 main_~r~0) 1) (= main_~b~0 (+ (* (- 1) main_~a~0) (* (+ main_~s~0 main_~r~0) main_~y~0) (* (+ main_~q~0 main_~p~0) main_~x~0))) (<= 1 main_~x~0) (= main_~a~0 main_~x~0) (= (+ main_~q~0 main_~p~0) 0) (= main_~p~0 1))} is VALID [2022-04-08 12:17:12,957 INFO L290 TraceCheckUtils]: 62: Hoare triple {11626#(and (= main_~r~0 0) (= (+ main_~s~0 main_~r~0) 1) (= main_~b~0 (+ (* (- 1) main_~a~0) (* (+ main_~s~0 main_~r~0) main_~y~0) (* (+ main_~q~0 main_~p~0) main_~x~0))) (<= 1 main_~x~0) (= main_~a~0 main_~x~0) (= (+ main_~q~0 main_~p~0) 0) (= main_~p~0 1))} assume !!(~a~0 != ~b~0); {11626#(and (= main_~r~0 0) (= (+ main_~s~0 main_~r~0) 1) (= main_~b~0 (+ (* (- 1) main_~a~0) (* (+ main_~s~0 main_~r~0) main_~y~0) (* (+ main_~q~0 main_~p~0) main_~x~0))) (<= 1 main_~x~0) (= main_~a~0 main_~x~0) (= (+ main_~q~0 main_~p~0) 0) (= main_~p~0 1))} is VALID [2022-04-08 12:17:12,958 INFO L290 TraceCheckUtils]: 63: Hoare triple {11626#(and (= main_~r~0 0) (= (+ main_~s~0 main_~r~0) 1) (= main_~b~0 (+ (* (- 1) main_~a~0) (* (+ main_~s~0 main_~r~0) main_~y~0) (* (+ main_~q~0 main_~p~0) main_~x~0))) (<= 1 main_~x~0) (= main_~a~0 main_~x~0) (= (+ main_~q~0 main_~p~0) 0) (= main_~p~0 1))} assume !(~a~0 > ~b~0);~b~0 := ~b~0 - ~a~0;~q~0 := ~q~0 - ~p~0;~s~0 := ~s~0 - ~r~0; {11681#(and (= (+ (* (- 2) main_~x~0) main_~y~0) main_~b~0) (<= 1 main_~x~0) (= main_~s~0 1) (= (- 2) main_~q~0))} is VALID [2022-04-08 12:17:12,958 INFO L290 TraceCheckUtils]: 64: Hoare triple {11681#(and (= (+ (* (- 2) main_~x~0) main_~y~0) main_~b~0) (<= 1 main_~x~0) (= main_~s~0 1) (= (- 2) main_~q~0))} assume !false; {11681#(and (= (+ (* (- 2) main_~x~0) main_~y~0) main_~b~0) (<= 1 main_~x~0) (= main_~s~0 1) (= (- 2) main_~q~0))} is VALID [2022-04-08 12:17:12,958 INFO L272 TraceCheckUtils]: 65: Hoare triple {11681#(and (= (+ (* (- 2) main_~x~0) main_~y~0) main_~b~0) (<= 1 main_~x~0) (= main_~s~0 1) (= (- 2) main_~q~0))} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {11479#true} is VALID [2022-04-08 12:17:12,958 INFO L290 TraceCheckUtils]: 66: Hoare triple {11479#true} ~cond := #in~cond; {11479#true} is VALID [2022-04-08 12:17:12,959 INFO L290 TraceCheckUtils]: 67: Hoare triple {11479#true} assume !(0 == ~cond); {11479#true} is VALID [2022-04-08 12:17:12,959 INFO L290 TraceCheckUtils]: 68: Hoare triple {11479#true} assume true; {11479#true} is VALID [2022-04-08 12:17:12,959 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {11479#true} {11681#(and (= (+ (* (- 2) main_~x~0) main_~y~0) main_~b~0) (<= 1 main_~x~0) (= main_~s~0 1) (= (- 2) main_~q~0))} #74#return; {11681#(and (= (+ (* (- 2) main_~x~0) main_~y~0) main_~b~0) (<= 1 main_~x~0) (= main_~s~0 1) (= (- 2) main_~q~0))} is VALID [2022-04-08 12:17:12,959 INFO L272 TraceCheckUtils]: 70: Hoare triple {11681#(and (= (+ (* (- 2) main_~x~0) main_~y~0) main_~b~0) (<= 1 main_~x~0) (= main_~s~0 1) (= (- 2) main_~q~0))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {11479#true} is VALID [2022-04-08 12:17:12,960 INFO L290 TraceCheckUtils]: 71: Hoare triple {11479#true} ~cond := #in~cond; {11479#true} is VALID [2022-04-08 12:17:12,960 INFO L290 TraceCheckUtils]: 72: Hoare triple {11479#true} assume !(0 == ~cond); {11479#true} is VALID [2022-04-08 12:17:12,960 INFO L290 TraceCheckUtils]: 73: Hoare triple {11479#true} assume true; {11479#true} is VALID [2022-04-08 12:17:12,960 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {11479#true} {11681#(and (= (+ (* (- 2) main_~x~0) main_~y~0) main_~b~0) (<= 1 main_~x~0) (= main_~s~0 1) (= (- 2) main_~q~0))} #76#return; {11681#(and (= (+ (* (- 2) main_~x~0) main_~y~0) main_~b~0) (<= 1 main_~x~0) (= main_~s~0 1) (= (- 2) main_~q~0))} is VALID [2022-04-08 12:17:12,961 INFO L272 TraceCheckUtils]: 75: Hoare triple {11681#(and (= (+ (* (- 2) main_~x~0) main_~y~0) main_~b~0) (<= 1 main_~x~0) (= main_~s~0 1) (= (- 2) main_~q~0))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {11718#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 12:17:12,961 INFO L290 TraceCheckUtils]: 76: Hoare triple {11718#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {11722#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 12:17:12,962 INFO L290 TraceCheckUtils]: 77: Hoare triple {11722#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {11480#false} is VALID [2022-04-08 12:17:12,962 INFO L290 TraceCheckUtils]: 78: Hoare triple {11480#false} assume !false; {11480#false} is VALID [2022-04-08 12:17:12,962 INFO L134 CoverageAnalysis]: Checked inductivity of 166 backedges. 38 proven. 37 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2022-04-08 12:17:12,962 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 12:17:39,951 INFO L290 TraceCheckUtils]: 78: Hoare triple {11480#false} assume !false; {11480#false} is VALID [2022-04-08 12:17:39,951 INFO L290 TraceCheckUtils]: 77: Hoare triple {11722#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {11480#false} is VALID [2022-04-08 12:17:39,952 INFO L290 TraceCheckUtils]: 76: Hoare triple {11718#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {11722#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 12:17:39,952 INFO L272 TraceCheckUtils]: 75: Hoare triple {11738#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {11718#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 12:17:39,953 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {11479#true} {11738#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} #76#return; {11738#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-08 12:17:39,953 INFO L290 TraceCheckUtils]: 73: Hoare triple {11479#true} assume true; {11479#true} is VALID [2022-04-08 12:17:39,953 INFO L290 TraceCheckUtils]: 72: Hoare triple {11479#true} assume !(0 == ~cond); {11479#true} is VALID [2022-04-08 12:17:39,953 INFO L290 TraceCheckUtils]: 71: Hoare triple {11479#true} ~cond := #in~cond; {11479#true} is VALID [2022-04-08 12:17:39,953 INFO L272 TraceCheckUtils]: 70: Hoare triple {11738#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {11479#true} is VALID [2022-04-08 12:17:39,954 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {11479#true} {11738#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} #74#return; {11738#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-08 12:17:39,954 INFO L290 TraceCheckUtils]: 68: Hoare triple {11479#true} assume true; {11479#true} is VALID [2022-04-08 12:17:39,954 INFO L290 TraceCheckUtils]: 67: Hoare triple {11479#true} assume !(0 == ~cond); {11479#true} is VALID [2022-04-08 12:17:39,954 INFO L290 TraceCheckUtils]: 66: Hoare triple {11479#true} ~cond := #in~cond; {11479#true} is VALID [2022-04-08 12:17:39,954 INFO L272 TraceCheckUtils]: 65: Hoare triple {11738#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {11479#true} is VALID [2022-04-08 12:17:39,954 INFO L290 TraceCheckUtils]: 64: Hoare triple {11738#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} assume !false; {11738#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-08 12:17:40,142 INFO L290 TraceCheckUtils]: 63: Hoare triple {11775#(= (+ (* (+ main_~s~0 (* (- 1) main_~r~0)) main_~y~0) (* main_~x~0 (+ main_~q~0 (* (- 1) main_~p~0)))) (+ (* (- 1) main_~a~0) main_~b~0))} assume !(~a~0 > ~b~0);~b~0 := ~b~0 - ~a~0;~q~0 := ~q~0 - ~p~0;~s~0 := ~s~0 - ~r~0; {11738#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-08 12:17:40,143 INFO L290 TraceCheckUtils]: 62: Hoare triple {11775#(= (+ (* (+ main_~s~0 (* (- 1) main_~r~0)) main_~y~0) (* main_~x~0 (+ main_~q~0 (* (- 1) main_~p~0)))) (+ (* (- 1) main_~a~0) main_~b~0))} assume !!(~a~0 != ~b~0); {11775#(= (+ (* (+ main_~s~0 (* (- 1) main_~r~0)) main_~y~0) (* main_~x~0 (+ main_~q~0 (* (- 1) main_~p~0)))) (+ (* (- 1) main_~a~0) main_~b~0))} is VALID [2022-04-08 12:17:40,143 INFO L284 TraceCheckUtils]: 61: Hoare quadruple {11612#(not (= |__VERIFIER_assert_#in~cond| 0))} {11782#(or (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ (* (+ main_~s~0 (* (- 1) main_~r~0)) main_~y~0) (* main_~x~0 (+ main_~q~0 (* (- 1) main_~p~0)))) (+ (* (- 1) main_~a~0) main_~b~0)))} #78#return; {11775#(= (+ (* (+ main_~s~0 (* (- 1) main_~r~0)) main_~y~0) (* main_~x~0 (+ main_~q~0 (* (- 1) main_~p~0)))) (+ (* (- 1) main_~a~0) main_~b~0))} is VALID [2022-04-08 12:17:40,144 INFO L290 TraceCheckUtils]: 60: Hoare triple {11612#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {11612#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 12:17:40,144 INFO L290 TraceCheckUtils]: 59: Hoare triple {11792#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {11612#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 12:17:40,144 INFO L290 TraceCheckUtils]: 58: Hoare triple {11479#true} ~cond := #in~cond; {11792#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 12:17:40,144 INFO L272 TraceCheckUtils]: 57: Hoare triple {11782#(or (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ (* (+ main_~s~0 (* (- 1) main_~r~0)) main_~y~0) (* main_~x~0 (+ main_~q~0 (* (- 1) main_~p~0)))) (+ (* (- 1) main_~a~0) main_~b~0)))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {11479#true} is VALID [2022-04-08 12:17:40,145 INFO L284 TraceCheckUtils]: 56: Hoare quadruple {11479#true} {11782#(or (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ (* (+ main_~s~0 (* (- 1) main_~r~0)) main_~y~0) (* main_~x~0 (+ main_~q~0 (* (- 1) main_~p~0)))) (+ (* (- 1) main_~a~0) main_~b~0)))} #76#return; {11782#(or (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ (* (+ main_~s~0 (* (- 1) main_~r~0)) main_~y~0) (* main_~x~0 (+ main_~q~0 (* (- 1) main_~p~0)))) (+ (* (- 1) main_~a~0) main_~b~0)))} is VALID [2022-04-08 12:17:40,145 INFO L290 TraceCheckUtils]: 55: Hoare triple {11479#true} assume true; {11479#true} is VALID [2022-04-08 12:17:40,145 INFO L290 TraceCheckUtils]: 54: Hoare triple {11479#true} assume !(0 == ~cond); {11479#true} is VALID [2022-04-08 12:17:40,145 INFO L290 TraceCheckUtils]: 53: Hoare triple {11479#true} ~cond := #in~cond; {11479#true} is VALID [2022-04-08 12:17:40,145 INFO L272 TraceCheckUtils]: 52: Hoare triple {11782#(or (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ (* (+ main_~s~0 (* (- 1) main_~r~0)) main_~y~0) (* main_~x~0 (+ main_~q~0 (* (- 1) main_~p~0)))) (+ (* (- 1) main_~a~0) main_~b~0)))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {11479#true} is VALID [2022-04-08 12:17:40,147 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {11479#true} {11782#(or (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ (* (+ main_~s~0 (* (- 1) main_~r~0)) main_~y~0) (* main_~x~0 (+ main_~q~0 (* (- 1) main_~p~0)))) (+ (* (- 1) main_~a~0) main_~b~0)))} #74#return; {11782#(or (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ (* (+ main_~s~0 (* (- 1) main_~r~0)) main_~y~0) (* main_~x~0 (+ main_~q~0 (* (- 1) main_~p~0)))) (+ (* (- 1) main_~a~0) main_~b~0)))} is VALID [2022-04-08 12:17:40,147 INFO L290 TraceCheckUtils]: 50: Hoare triple {11479#true} assume true; {11479#true} is VALID [2022-04-08 12:17:40,147 INFO L290 TraceCheckUtils]: 49: Hoare triple {11479#true} assume !(0 == ~cond); {11479#true} is VALID [2022-04-08 12:17:40,147 INFO L290 TraceCheckUtils]: 48: Hoare triple {11479#true} ~cond := #in~cond; {11479#true} is VALID [2022-04-08 12:17:40,147 INFO L272 TraceCheckUtils]: 47: Hoare triple {11782#(or (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ (* (+ main_~s~0 (* (- 1) main_~r~0)) main_~y~0) (* main_~x~0 (+ main_~q~0 (* (- 1) main_~p~0)))) (+ (* (- 1) main_~a~0) main_~b~0)))} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {11479#true} is VALID [2022-04-08 12:17:40,147 INFO L290 TraceCheckUtils]: 46: Hoare triple {11782#(or (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ (* (+ main_~s~0 (* (- 1) main_~r~0)) main_~y~0) (* main_~x~0 (+ main_~q~0 (* (- 1) main_~p~0)))) (+ (* (- 1) main_~a~0) main_~b~0)))} assume !false; {11782#(or (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ (* (+ main_~s~0 (* (- 1) main_~r~0)) main_~y~0) (* main_~x~0 (+ main_~q~0 (* (- 1) main_~p~0)))) (+ (* (- 1) main_~a~0) main_~b~0)))} is VALID [2022-04-08 12:17:41,202 INFO L290 TraceCheckUtils]: 45: Hoare triple {11832#(or (not (= (+ (* (+ main_~s~0 (* (- 1) main_~r~0)) main_~y~0) (* main_~x~0 (+ main_~q~0 (* (- 1) main_~p~0)))) (+ (* (- 1) main_~a~0) main_~b~0))) (= (+ (* main_~y~0 (+ (* (- 2) main_~r~0) main_~s~0)) (* main_~x~0 (+ main_~q~0 (* (- 2) main_~p~0)))) (+ main_~b~0 (* (- 2) main_~a~0))))} assume !(~a~0 > ~b~0);~b~0 := ~b~0 - ~a~0;~q~0 := ~q~0 - ~p~0;~s~0 := ~s~0 - ~r~0; {11782#(or (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ (* (+ main_~s~0 (* (- 1) main_~r~0)) main_~y~0) (* main_~x~0 (+ main_~q~0 (* (- 1) main_~p~0)))) (+ (* (- 1) main_~a~0) main_~b~0)))} is VALID [2022-04-08 12:17:41,202 INFO L290 TraceCheckUtils]: 44: Hoare triple {11832#(or (not (= (+ (* (+ main_~s~0 (* (- 1) main_~r~0)) main_~y~0) (* main_~x~0 (+ main_~q~0 (* (- 1) main_~p~0)))) (+ (* (- 1) main_~a~0) main_~b~0))) (= (+ (* main_~y~0 (+ (* (- 2) main_~r~0) main_~s~0)) (* main_~x~0 (+ main_~q~0 (* (- 2) main_~p~0)))) (+ main_~b~0 (* (- 2) main_~a~0))))} assume !!(~a~0 != ~b~0); {11832#(or (not (= (+ (* (+ main_~s~0 (* (- 1) main_~r~0)) main_~y~0) (* main_~x~0 (+ main_~q~0 (* (- 1) main_~p~0)))) (+ (* (- 1) main_~a~0) main_~b~0))) (= (+ (* main_~y~0 (+ (* (- 2) main_~r~0) main_~s~0)) (* main_~x~0 (+ main_~q~0 (* (- 2) main_~p~0)))) (+ main_~b~0 (* (- 2) main_~a~0))))} is VALID [2022-04-08 12:17:41,204 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {11612#(not (= |__VERIFIER_assert_#in~cond| 0))} {11479#true} #78#return; {11832#(or (not (= (+ (* (+ main_~s~0 (* (- 1) main_~r~0)) main_~y~0) (* main_~x~0 (+ main_~q~0 (* (- 1) main_~p~0)))) (+ (* (- 1) main_~a~0) main_~b~0))) (= (+ (* main_~y~0 (+ (* (- 2) main_~r~0) main_~s~0)) (* main_~x~0 (+ main_~q~0 (* (- 2) main_~p~0)))) (+ main_~b~0 (* (- 2) main_~a~0))))} is VALID [2022-04-08 12:17:41,204 INFO L290 TraceCheckUtils]: 42: Hoare triple {11612#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {11612#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 12:17:41,204 INFO L290 TraceCheckUtils]: 41: Hoare triple {11792#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {11612#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 12:17:41,219 INFO L290 TraceCheckUtils]: 40: Hoare triple {11479#true} ~cond := #in~cond; {11792#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 12:17:41,219 INFO L272 TraceCheckUtils]: 39: Hoare triple {11479#true} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {11479#true} is VALID [2022-04-08 12:17:41,219 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {11479#true} {11479#true} #76#return; {11479#true} is VALID [2022-04-08 12:17:41,219 INFO L290 TraceCheckUtils]: 37: Hoare triple {11479#true} assume true; {11479#true} is VALID [2022-04-08 12:17:41,219 INFO L290 TraceCheckUtils]: 36: Hoare triple {11479#true} assume !(0 == ~cond); {11479#true} is VALID [2022-04-08 12:17:41,219 INFO L290 TraceCheckUtils]: 35: Hoare triple {11479#true} ~cond := #in~cond; {11479#true} is VALID [2022-04-08 12:17:41,219 INFO L272 TraceCheckUtils]: 34: Hoare triple {11479#true} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {11479#true} is VALID [2022-04-08 12:17:41,220 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {11479#true} {11479#true} #74#return; {11479#true} is VALID [2022-04-08 12:17:41,220 INFO L290 TraceCheckUtils]: 32: Hoare triple {11479#true} assume true; {11479#true} is VALID [2022-04-08 12:17:41,220 INFO L290 TraceCheckUtils]: 31: Hoare triple {11479#true} assume !(0 == ~cond); {11479#true} is VALID [2022-04-08 12:17:41,220 INFO L290 TraceCheckUtils]: 30: Hoare triple {11479#true} ~cond := #in~cond; {11479#true} is VALID [2022-04-08 12:17:41,220 INFO L272 TraceCheckUtils]: 29: Hoare triple {11479#true} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {11479#true} is VALID [2022-04-08 12:17:41,220 INFO L290 TraceCheckUtils]: 28: Hoare triple {11479#true} assume !false; {11479#true} is VALID [2022-04-08 12:17:41,220 INFO L290 TraceCheckUtils]: 27: Hoare triple {11479#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {11479#true} is VALID [2022-04-08 12:17:41,220 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {11479#true} {11479#true} #72#return; {11479#true} is VALID [2022-04-08 12:17:41,220 INFO L290 TraceCheckUtils]: 25: Hoare triple {11479#true} assume true; {11479#true} is VALID [2022-04-08 12:17:41,220 INFO L290 TraceCheckUtils]: 24: Hoare triple {11479#true} assume !(0 == ~cond); {11479#true} is VALID [2022-04-08 12:17:41,220 INFO L290 TraceCheckUtils]: 23: Hoare triple {11479#true} ~cond := #in~cond; {11479#true} is VALID [2022-04-08 12:17:41,220 INFO L272 TraceCheckUtils]: 22: Hoare triple {11479#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {11479#true} is VALID [2022-04-08 12:17:41,220 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {11479#true} {11479#true} #70#return; {11479#true} is VALID [2022-04-08 12:17:41,220 INFO L290 TraceCheckUtils]: 20: Hoare triple {11479#true} assume true; {11479#true} is VALID [2022-04-08 12:17:41,220 INFO L290 TraceCheckUtils]: 19: Hoare triple {11479#true} assume !(0 == ~cond); {11479#true} is VALID [2022-04-08 12:17:41,220 INFO L290 TraceCheckUtils]: 18: Hoare triple {11479#true} ~cond := #in~cond; {11479#true} is VALID [2022-04-08 12:17:41,220 INFO L272 TraceCheckUtils]: 17: Hoare triple {11479#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {11479#true} is VALID [2022-04-08 12:17:41,220 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {11479#true} {11479#true} #68#return; {11479#true} is VALID [2022-04-08 12:17:41,220 INFO L290 TraceCheckUtils]: 15: Hoare triple {11479#true} assume true; {11479#true} is VALID [2022-04-08 12:17:41,221 INFO L290 TraceCheckUtils]: 14: Hoare triple {11479#true} assume !(0 == ~cond); {11479#true} is VALID [2022-04-08 12:17:41,221 INFO L290 TraceCheckUtils]: 13: Hoare triple {11479#true} ~cond := #in~cond; {11479#true} is VALID [2022-04-08 12:17:41,221 INFO L272 TraceCheckUtils]: 12: Hoare triple {11479#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 5 then 1 else 0)); {11479#true} is VALID [2022-04-08 12:17:41,221 INFO L290 TraceCheckUtils]: 11: Hoare triple {11479#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {11479#true} is VALID [2022-04-08 12:17:41,221 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {11479#true} {11479#true} #66#return; {11479#true} is VALID [2022-04-08 12:17:41,221 INFO L290 TraceCheckUtils]: 9: Hoare triple {11479#true} assume true; {11479#true} is VALID [2022-04-08 12:17:41,221 INFO L290 TraceCheckUtils]: 8: Hoare triple {11479#true} assume !(0 == ~cond); {11479#true} is VALID [2022-04-08 12:17:41,221 INFO L290 TraceCheckUtils]: 7: Hoare triple {11479#true} ~cond := #in~cond; {11479#true} is VALID [2022-04-08 12:17:41,221 INFO L272 TraceCheckUtils]: 6: Hoare triple {11479#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 5 then 1 else 0)); {11479#true} is VALID [2022-04-08 12:17:41,221 INFO L290 TraceCheckUtils]: 5: Hoare triple {11479#true} havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~x~0;havoc ~y~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {11479#true} is VALID [2022-04-08 12:17:41,221 INFO L272 TraceCheckUtils]: 4: Hoare triple {11479#true} call #t~ret6 := main(); {11479#true} is VALID [2022-04-08 12:17:41,221 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11479#true} {11479#true} #88#return; {11479#true} is VALID [2022-04-08 12:17:41,221 INFO L290 TraceCheckUtils]: 2: Hoare triple {11479#true} assume true; {11479#true} is VALID [2022-04-08 12:17:41,221 INFO L290 TraceCheckUtils]: 1: Hoare triple {11479#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(10, 2);call #Ultimate.allocInit(12, 3); {11479#true} is VALID [2022-04-08 12:17:41,221 INFO L272 TraceCheckUtils]: 0: Hoare triple {11479#true} call ULTIMATE.init(); {11479#true} is VALID [2022-04-08 12:17:41,222 INFO L134 CoverageAnalysis]: Checked inductivity of 166 backedges. 40 proven. 26 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2022-04-08 12:17:41,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 12:17:41,222 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [818464662] [2022-04-08 12:17:41,222 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 12:17:41,222 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1480318699] [2022-04-08 12:17:41,222 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1480318699] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 12:17:41,222 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 12:17:41,222 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10] total 18 [2022-04-08 12:17:41,222 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 12:17:41,222 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [850473607] [2022-04-08 12:17:41,222 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [850473607] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 12:17:41,222 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 12:17:41,222 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-08 12:17:41,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1854836685] [2022-04-08 12:17:41,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 12:17:41,223 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.076923076923077) internal successors, (27), 11 states have internal predecessors, (27), 5 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 6 states have call predecessors, (13), 5 states have call successors, (13) Word has length 79 [2022-04-08 12:17:41,223 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 12:17:41,223 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 13 states have (on average 2.076923076923077) internal successors, (27), 11 states have internal predecessors, (27), 5 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 6 states have call predecessors, (13), 5 states have call successors, (13) [2022-04-08 12:17:41,279 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 12:17:41,279 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-08 12:17:41,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 12:17:41,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-08 12:17:41,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=250, Unknown=0, NotChecked=0, Total=306 [2022-04-08 12:17:41,280 INFO L87 Difference]: Start difference. First operand 145 states and 167 transitions. Second operand has 13 states, 13 states have (on average 2.076923076923077) internal successors, (27), 11 states have internal predecessors, (27), 5 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 6 states have call predecessors, (13), 5 states have call successors, (13) [2022-04-08 12:17:42,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:17:42,400 INFO L93 Difference]: Finished difference Result 167 states and 195 transitions. [2022-04-08 12:17:42,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-08 12:17:42,401 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.076923076923077) internal successors, (27), 11 states have internal predecessors, (27), 5 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 6 states have call predecessors, (13), 5 states have call successors, (13) Word has length 79 [2022-04-08 12:17:42,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 12:17:42,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 2.076923076923077) internal successors, (27), 11 states have internal predecessors, (27), 5 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 6 states have call predecessors, (13), 5 states have call successors, (13) [2022-04-08 12:17:42,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 69 transitions. [2022-04-08 12:17:42,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 2.076923076923077) internal successors, (27), 11 states have internal predecessors, (27), 5 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 6 states have call predecessors, (13), 5 states have call successors, (13) [2022-04-08 12:17:42,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 69 transitions. [2022-04-08 12:17:42,404 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 69 transitions. [2022-04-08 12:17:42,475 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 12:17:42,478 INFO L225 Difference]: With dead ends: 167 [2022-04-08 12:17:42,478 INFO L226 Difference]: Without dead ends: 165 [2022-04-08 12:17:42,478 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 139 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=347, Unknown=0, NotChecked=0, Total=420 [2022-04-08 12:17:42,479 INFO L913 BasicCegarLoop]: 27 mSDtfsCounter, 24 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 364 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 388 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 364 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-08 12:17:42,479 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [30 Valid, 149 Invalid, 388 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 364 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-08 12:17:42,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2022-04-08 12:17:42,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 155. [2022-04-08 12:17:42,687 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 12:17:42,687 INFO L82 GeneralOperation]: Start isEquivalent. First operand 165 states. Second operand has 155 states, 94 states have (on average 1.0957446808510638) internal successors, (103), 98 states have internal predecessors, (103), 39 states have call successors, (39), 22 states have call predecessors, (39), 21 states have return successors, (38), 34 states have call predecessors, (38), 38 states have call successors, (38) [2022-04-08 12:17:42,688 INFO L74 IsIncluded]: Start isIncluded. First operand 165 states. Second operand has 155 states, 94 states have (on average 1.0957446808510638) internal successors, (103), 98 states have internal predecessors, (103), 39 states have call successors, (39), 22 states have call predecessors, (39), 21 states have return successors, (38), 34 states have call predecessors, (38), 38 states have call successors, (38) [2022-04-08 12:17:42,688 INFO L87 Difference]: Start difference. First operand 165 states. Second operand has 155 states, 94 states have (on average 1.0957446808510638) internal successors, (103), 98 states have internal predecessors, (103), 39 states have call successors, (39), 22 states have call predecessors, (39), 21 states have return successors, (38), 34 states have call predecessors, (38), 38 states have call successors, (38) [2022-04-08 12:17:42,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:17:42,691 INFO L93 Difference]: Finished difference Result 165 states and 193 transitions. [2022-04-08 12:17:42,691 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 193 transitions. [2022-04-08 12:17:42,692 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:17:42,692 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 12:17:42,692 INFO L74 IsIncluded]: Start isIncluded. First operand has 155 states, 94 states have (on average 1.0957446808510638) internal successors, (103), 98 states have internal predecessors, (103), 39 states have call successors, (39), 22 states have call predecessors, (39), 21 states have return successors, (38), 34 states have call predecessors, (38), 38 states have call successors, (38) Second operand 165 states. [2022-04-08 12:17:42,692 INFO L87 Difference]: Start difference. First operand has 155 states, 94 states have (on average 1.0957446808510638) internal successors, (103), 98 states have internal predecessors, (103), 39 states have call successors, (39), 22 states have call predecessors, (39), 21 states have return successors, (38), 34 states have call predecessors, (38), 38 states have call successors, (38) Second operand 165 states. [2022-04-08 12:17:42,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:17:42,696 INFO L93 Difference]: Finished difference Result 165 states and 193 transitions. [2022-04-08 12:17:42,696 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 193 transitions. [2022-04-08 12:17:42,696 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:17:42,696 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 12:17:42,696 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 12:17:42,696 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 12:17:42,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 94 states have (on average 1.0957446808510638) internal successors, (103), 98 states have internal predecessors, (103), 39 states have call successors, (39), 22 states have call predecessors, (39), 21 states have return successors, (38), 34 states have call predecessors, (38), 38 states have call successors, (38) [2022-04-08 12:17:42,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 180 transitions. [2022-04-08 12:17:42,699 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 180 transitions. Word has length 79 [2022-04-08 12:17:42,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 12:17:42,701 INFO L478 AbstractCegarLoop]: Abstraction has 155 states and 180 transitions. [2022-04-08 12:17:42,701 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.076923076923077) internal successors, (27), 11 states have internal predecessors, (27), 5 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 6 states have call predecessors, (13), 5 states have call successors, (13) [2022-04-08 12:17:42,701 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 155 states and 180 transitions. [2022-04-08 12:17:43,857 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 180 edges. 180 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 12:17:43,858 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 180 transitions. [2022-04-08 12:17:43,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2022-04-08 12:17:43,858 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 12:17:43,858 INFO L499 BasicCegarLoop]: trace histogram [11, 10, 10, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 12:17:43,877 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 12:17:44,059 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 12:17:44,059 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 12:17:44,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 12:17:44,059 INFO L85 PathProgramCache]: Analyzing trace with hash 1804875380, now seen corresponding path program 7 times [2022-04-08 12:17:44,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 12:17:44,059 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1538698271] [2022-04-08 12:17:44,060 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 12:17:44,060 INFO L85 PathProgramCache]: Analyzing trace with hash 1804875380, now seen corresponding path program 8 times [2022-04-08 12:17:44,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 12:17:44,060 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [653873022] [2022-04-08 12:17:44,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 12:17:44,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 12:17:44,070 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 12:17:44,070 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2002021934] [2022-04-08 12:17:44,071 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 12:17:44,071 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 12:17:44,071 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 12:17:44,075 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 12:17:44,076 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 12:17:44,123 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 12:17:44,123 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 12:17:44,124 INFO L263 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 56 conjunts are in the unsatisfiable core [2022-04-08 12:17:44,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 12:17:44,141 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 12:20:41,387 INFO L272 TraceCheckUtils]: 0: Hoare triple {12950#true} call ULTIMATE.init(); {12950#true} is VALID [2022-04-08 12:20:41,387 INFO L290 TraceCheckUtils]: 1: Hoare triple {12950#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(10, 2);call #Ultimate.allocInit(12, 3); {12950#true} is VALID [2022-04-08 12:20:41,387 INFO L290 TraceCheckUtils]: 2: Hoare triple {12950#true} assume true; {12950#true} is VALID [2022-04-08 12:20:41,387 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12950#true} {12950#true} #88#return; {12950#true} is VALID [2022-04-08 12:20:41,387 INFO L272 TraceCheckUtils]: 4: Hoare triple {12950#true} call #t~ret6 := main(); {12950#true} is VALID [2022-04-08 12:20:41,387 INFO L290 TraceCheckUtils]: 5: Hoare triple {12950#true} havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~x~0;havoc ~y~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {12950#true} is VALID [2022-04-08 12:20:41,387 INFO L272 TraceCheckUtils]: 6: Hoare triple {12950#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 5 then 1 else 0)); {12950#true} is VALID [2022-04-08 12:20:41,388 INFO L290 TraceCheckUtils]: 7: Hoare triple {12950#true} ~cond := #in~cond; {12976#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-08 12:20:41,388 INFO L290 TraceCheckUtils]: 8: Hoare triple {12976#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {12980#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-08 12:20:41,388 INFO L290 TraceCheckUtils]: 9: Hoare triple {12980#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {12980#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-08 12:20:41,389 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {12980#(not (= |assume_abort_if_not_#in~cond| 0))} {12950#true} #66#return; {12987#(and (<= 0 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-08 12:20:41,389 INFO L290 TraceCheckUtils]: 11: Hoare triple {12987#(and (<= 0 main_~x~0) (<= main_~x~0 5))} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {12987#(and (<= 0 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-08 12:20:41,389 INFO L272 TraceCheckUtils]: 12: Hoare triple {12987#(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)); {12950#true} is VALID [2022-04-08 12:20:41,389 INFO L290 TraceCheckUtils]: 13: Hoare triple {12950#true} ~cond := #in~cond; {12950#true} is VALID [2022-04-08 12:20:41,389 INFO L290 TraceCheckUtils]: 14: Hoare triple {12950#true} assume !(0 == ~cond); {12950#true} is VALID [2022-04-08 12:20:41,389 INFO L290 TraceCheckUtils]: 15: Hoare triple {12950#true} assume true; {12950#true} is VALID [2022-04-08 12:20:41,390 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {12950#true} {12987#(and (<= 0 main_~x~0) (<= main_~x~0 5))} #68#return; {12987#(and (<= 0 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-08 12:20:41,390 INFO L272 TraceCheckUtils]: 17: Hoare triple {12987#(and (<= 0 main_~x~0) (<= main_~x~0 5))} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {12950#true} is VALID [2022-04-08 12:20:41,390 INFO L290 TraceCheckUtils]: 18: Hoare triple {12950#true} ~cond := #in~cond; {12976#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-08 12:20:41,390 INFO L290 TraceCheckUtils]: 19: Hoare triple {12976#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {12980#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-08 12:20:41,390 INFO L290 TraceCheckUtils]: 20: Hoare triple {12980#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {12980#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-08 12:20:41,391 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {12980#(not (= |assume_abort_if_not_#in~cond| 0))} {12987#(and (<= 0 main_~x~0) (<= main_~x~0 5))} #70#return; {13021#(and (<= 1 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-08 12:20:41,391 INFO L272 TraceCheckUtils]: 22: Hoare triple {13021#(and (<= 1 main_~x~0) (<= main_~x~0 5))} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {12950#true} is VALID [2022-04-08 12:20:41,391 INFO L290 TraceCheckUtils]: 23: Hoare triple {12950#true} ~cond := #in~cond; {12950#true} is VALID [2022-04-08 12:20:41,391 INFO L290 TraceCheckUtils]: 24: Hoare triple {12950#true} assume !(0 == ~cond); {12950#true} is VALID [2022-04-08 12:20:41,391 INFO L290 TraceCheckUtils]: 25: Hoare triple {12950#true} assume true; {12950#true} is VALID [2022-04-08 12:20:41,391 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {12950#true} {13021#(and (<= 1 main_~x~0) (<= main_~x~0 5))} #72#return; {13021#(and (<= 1 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-08 12:20:41,392 INFO L290 TraceCheckUtils]: 27: Hoare triple {13021#(and (<= 1 main_~x~0) (<= main_~x~0 5))} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {13040#(and (<= 1 main_~s~0) (= main_~r~0 0) (<= 1 main_~x~0) (<= main_~x~0 5) (= main_~b~0 main_~y~0) (<= main_~p~0 1) (= main_~q~0 0) (= main_~a~0 main_~x~0))} is VALID [2022-04-08 12:20:41,392 INFO L290 TraceCheckUtils]: 28: Hoare triple {13040#(and (<= 1 main_~s~0) (= main_~r~0 0) (<= 1 main_~x~0) (<= main_~x~0 5) (= main_~b~0 main_~y~0) (<= main_~p~0 1) (= main_~q~0 0) (= main_~a~0 main_~x~0))} assume !false; {13040#(and (<= 1 main_~s~0) (= main_~r~0 0) (<= 1 main_~x~0) (<= main_~x~0 5) (= main_~b~0 main_~y~0) (<= main_~p~0 1) (= main_~q~0 0) (= main_~a~0 main_~x~0))} is VALID [2022-04-08 12:20:41,392 INFO L272 TraceCheckUtils]: 29: Hoare triple {13040#(and (<= 1 main_~s~0) (= main_~r~0 0) (<= 1 main_~x~0) (<= main_~x~0 5) (= main_~b~0 main_~y~0) (<= main_~p~0 1) (= main_~q~0 0) (= main_~a~0 main_~x~0))} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {12950#true} is VALID [2022-04-08 12:20:41,392 INFO L290 TraceCheckUtils]: 30: Hoare triple {12950#true} ~cond := #in~cond; {12950#true} is VALID [2022-04-08 12:20:41,392 INFO L290 TraceCheckUtils]: 31: Hoare triple {12950#true} assume !(0 == ~cond); {12950#true} is VALID [2022-04-08 12:20:41,393 INFO L290 TraceCheckUtils]: 32: Hoare triple {12950#true} assume true; {12950#true} is VALID [2022-04-08 12:20:41,393 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {12950#true} {13040#(and (<= 1 main_~s~0) (= main_~r~0 0) (<= 1 main_~x~0) (<= main_~x~0 5) (= main_~b~0 main_~y~0) (<= main_~p~0 1) (= main_~q~0 0) (= main_~a~0 main_~x~0))} #74#return; {13040#(and (<= 1 main_~s~0) (= main_~r~0 0) (<= 1 main_~x~0) (<= main_~x~0 5) (= main_~b~0 main_~y~0) (<= main_~p~0 1) (= main_~q~0 0) (= main_~a~0 main_~x~0))} is VALID [2022-04-08 12:20:41,393 INFO L272 TraceCheckUtils]: 34: Hoare triple {13040#(and (<= 1 main_~s~0) (= main_~r~0 0) (<= 1 main_~x~0) (<= main_~x~0 5) (= main_~b~0 main_~y~0) (<= main_~p~0 1) (= main_~q~0 0) (= main_~a~0 main_~x~0))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {12950#true} is VALID [2022-04-08 12:20:41,393 INFO L290 TraceCheckUtils]: 35: Hoare triple {12950#true} ~cond := #in~cond; {12950#true} is VALID [2022-04-08 12:20:41,393 INFO L290 TraceCheckUtils]: 36: Hoare triple {12950#true} assume !(0 == ~cond); {12950#true} is VALID [2022-04-08 12:20:41,393 INFO L290 TraceCheckUtils]: 37: Hoare triple {12950#true} assume true; {12950#true} is VALID [2022-04-08 12:20:41,394 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {12950#true} {13040#(and (<= 1 main_~s~0) (= main_~r~0 0) (<= 1 main_~x~0) (<= main_~x~0 5) (= main_~b~0 main_~y~0) (<= main_~p~0 1) (= main_~q~0 0) (= main_~a~0 main_~x~0))} #76#return; {13040#(and (<= 1 main_~s~0) (= main_~r~0 0) (<= 1 main_~x~0) (<= main_~x~0 5) (= main_~b~0 main_~y~0) (<= main_~p~0 1) (= main_~q~0 0) (= main_~a~0 main_~x~0))} is VALID [2022-04-08 12:20:41,394 INFO L272 TraceCheckUtils]: 39: Hoare triple {13040#(and (<= 1 main_~s~0) (= main_~r~0 0) (<= 1 main_~x~0) (<= main_~x~0 5) (= main_~b~0 main_~y~0) (<= main_~p~0 1) (= main_~q~0 0) (= main_~a~0 main_~x~0))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {12950#true} is VALID [2022-04-08 12:20:41,394 INFO L290 TraceCheckUtils]: 40: Hoare triple {12950#true} ~cond := #in~cond; {12950#true} is VALID [2022-04-08 12:20:41,394 INFO L290 TraceCheckUtils]: 41: Hoare triple {12950#true} assume !(0 == ~cond); {12950#true} is VALID [2022-04-08 12:20:41,394 INFO L290 TraceCheckUtils]: 42: Hoare triple {12950#true} assume true; {12950#true} is VALID [2022-04-08 12:20:41,395 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {12950#true} {13040#(and (<= 1 main_~s~0) (= main_~r~0 0) (<= 1 main_~x~0) (<= main_~x~0 5) (= main_~b~0 main_~y~0) (<= main_~p~0 1) (= main_~q~0 0) (= main_~a~0 main_~x~0))} #78#return; {13040#(and (<= 1 main_~s~0) (= main_~r~0 0) (<= 1 main_~x~0) (<= main_~x~0 5) (= main_~b~0 main_~y~0) (<= main_~p~0 1) (= main_~q~0 0) (= main_~a~0 main_~x~0))} is VALID [2022-04-08 12:20:41,395 INFO L290 TraceCheckUtils]: 44: Hoare triple {13040#(and (<= 1 main_~s~0) (= main_~r~0 0) (<= 1 main_~x~0) (<= main_~x~0 5) (= main_~b~0 main_~y~0) (<= main_~p~0 1) (= main_~q~0 0) (= main_~a~0 main_~x~0))} assume !!(~a~0 != ~b~0); {13040#(and (<= 1 main_~s~0) (= main_~r~0 0) (<= 1 main_~x~0) (<= main_~x~0 5) (= main_~b~0 main_~y~0) (<= main_~p~0 1) (= main_~q~0 0) (= main_~a~0 main_~x~0))} is VALID [2022-04-08 12:20:41,396 INFO L290 TraceCheckUtils]: 45: Hoare triple {13040#(and (<= 1 main_~s~0) (= main_~r~0 0) (<= 1 main_~x~0) (<= main_~x~0 5) (= main_~b~0 main_~y~0) (<= main_~p~0 1) (= main_~q~0 0) (= main_~a~0 main_~x~0))} assume ~a~0 > ~b~0;~a~0 := ~a~0 - ~b~0;~p~0 := ~p~0 - ~q~0;~r~0 := ~r~0 - ~s~0; {13095#(and (<= 1 main_~s~0) (= (+ main_~s~0 main_~r~0) 0) (<= 1 main_~x~0) (<= main_~x~0 (+ main_~b~0 main_~a~0)) (< main_~b~0 main_~x~0) (<= main_~x~0 5) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= (+ main_~q~0 main_~p~0) 1))} is VALID [2022-04-08 12:20:41,397 INFO L290 TraceCheckUtils]: 46: Hoare triple {13095#(and (<= 1 main_~s~0) (= (+ main_~s~0 main_~r~0) 0) (<= 1 main_~x~0) (<= main_~x~0 (+ main_~b~0 main_~a~0)) (< main_~b~0 main_~x~0) (<= main_~x~0 5) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= (+ main_~q~0 main_~p~0) 1))} assume !false; {13095#(and (<= 1 main_~s~0) (= (+ main_~s~0 main_~r~0) 0) (<= 1 main_~x~0) (<= main_~x~0 (+ main_~b~0 main_~a~0)) (< main_~b~0 main_~x~0) (<= main_~x~0 5) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= (+ main_~q~0 main_~p~0) 1))} is VALID [2022-04-08 12:20:41,397 INFO L272 TraceCheckUtils]: 47: Hoare triple {13095#(and (<= 1 main_~s~0) (= (+ main_~s~0 main_~r~0) 0) (<= 1 main_~x~0) (<= main_~x~0 (+ main_~b~0 main_~a~0)) (< main_~b~0 main_~x~0) (<= main_~x~0 5) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= (+ main_~q~0 main_~p~0) 1))} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {12950#true} is VALID [2022-04-08 12:20:41,397 INFO L290 TraceCheckUtils]: 48: Hoare triple {12950#true} ~cond := #in~cond; {12950#true} is VALID [2022-04-08 12:20:41,397 INFO L290 TraceCheckUtils]: 49: Hoare triple {12950#true} assume !(0 == ~cond); {12950#true} is VALID [2022-04-08 12:20:41,397 INFO L290 TraceCheckUtils]: 50: Hoare triple {12950#true} assume true; {12950#true} is VALID [2022-04-08 12:20:41,397 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {12950#true} {13095#(and (<= 1 main_~s~0) (= (+ main_~s~0 main_~r~0) 0) (<= 1 main_~x~0) (<= main_~x~0 (+ main_~b~0 main_~a~0)) (< main_~b~0 main_~x~0) (<= main_~x~0 5) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= (+ main_~q~0 main_~p~0) 1))} #74#return; {13095#(and (<= 1 main_~s~0) (= (+ main_~s~0 main_~r~0) 0) (<= 1 main_~x~0) (<= main_~x~0 (+ main_~b~0 main_~a~0)) (< main_~b~0 main_~x~0) (<= main_~x~0 5) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= (+ main_~q~0 main_~p~0) 1))} is VALID [2022-04-08 12:20:41,398 INFO L272 TraceCheckUtils]: 52: Hoare triple {13095#(and (<= 1 main_~s~0) (= (+ main_~s~0 main_~r~0) 0) (<= 1 main_~x~0) (<= main_~x~0 (+ main_~b~0 main_~a~0)) (< main_~b~0 main_~x~0) (<= main_~x~0 5) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= (+ main_~q~0 main_~p~0) 1))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {12950#true} is VALID [2022-04-08 12:20:41,398 INFO L290 TraceCheckUtils]: 53: Hoare triple {12950#true} ~cond := #in~cond; {12950#true} is VALID [2022-04-08 12:20:41,398 INFO L290 TraceCheckUtils]: 54: Hoare triple {12950#true} assume !(0 == ~cond); {12950#true} is VALID [2022-04-08 12:20:41,398 INFO L290 TraceCheckUtils]: 55: Hoare triple {12950#true} assume true; {12950#true} is VALID [2022-04-08 12:20:41,398 INFO L284 TraceCheckUtils]: 56: Hoare quadruple {12950#true} {13095#(and (<= 1 main_~s~0) (= (+ main_~s~0 main_~r~0) 0) (<= 1 main_~x~0) (<= main_~x~0 (+ main_~b~0 main_~a~0)) (< main_~b~0 main_~x~0) (<= main_~x~0 5) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= (+ main_~q~0 main_~p~0) 1))} #76#return; {13095#(and (<= 1 main_~s~0) (= (+ main_~s~0 main_~r~0) 0) (<= 1 main_~x~0) (<= main_~x~0 (+ main_~b~0 main_~a~0)) (< main_~b~0 main_~x~0) (<= main_~x~0 5) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= (+ main_~q~0 main_~p~0) 1))} is VALID [2022-04-08 12:20:41,398 INFO L272 TraceCheckUtils]: 57: Hoare triple {13095#(and (<= 1 main_~s~0) (= (+ main_~s~0 main_~r~0) 0) (<= 1 main_~x~0) (<= main_~x~0 (+ main_~b~0 main_~a~0)) (< main_~b~0 main_~x~0) (<= main_~x~0 5) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= (+ main_~q~0 main_~p~0) 1))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {12950#true} is VALID [2022-04-08 12:20:41,398 INFO L290 TraceCheckUtils]: 58: Hoare triple {12950#true} ~cond := #in~cond; {12950#true} is VALID [2022-04-08 12:20:41,398 INFO L290 TraceCheckUtils]: 59: Hoare triple {12950#true} assume !(0 == ~cond); {12950#true} is VALID [2022-04-08 12:20:41,398 INFO L290 TraceCheckUtils]: 60: Hoare triple {12950#true} assume true; {12950#true} is VALID [2022-04-08 12:20:41,399 INFO L284 TraceCheckUtils]: 61: Hoare quadruple {12950#true} {13095#(and (<= 1 main_~s~0) (= (+ main_~s~0 main_~r~0) 0) (<= 1 main_~x~0) (<= main_~x~0 (+ main_~b~0 main_~a~0)) (< main_~b~0 main_~x~0) (<= main_~x~0 5) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= (+ main_~q~0 main_~p~0) 1))} #78#return; {13095#(and (<= 1 main_~s~0) (= (+ main_~s~0 main_~r~0) 0) (<= 1 main_~x~0) (<= main_~x~0 (+ main_~b~0 main_~a~0)) (< main_~b~0 main_~x~0) (<= main_~x~0 5) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= (+ main_~q~0 main_~p~0) 1))} is VALID [2022-04-08 12:20:41,400 INFO L290 TraceCheckUtils]: 62: Hoare triple {13095#(and (<= 1 main_~s~0) (= (+ main_~s~0 main_~r~0) 0) (<= 1 main_~x~0) (<= main_~x~0 (+ main_~b~0 main_~a~0)) (< main_~b~0 main_~x~0) (<= main_~x~0 5) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= (+ main_~q~0 main_~p~0) 1))} assume !!(~a~0 != ~b~0); {13147#(and (<= 1 main_~s~0) (= (+ main_~s~0 main_~r~0) 0) (<= 1 main_~x~0) (<= main_~x~0 (+ main_~b~0 main_~a~0)) (< main_~b~0 main_~x~0) (<= main_~x~0 5) (= main_~b~0 main_~y~0) (= main_~q~0 0) (not (= main_~b~0 main_~a~0)) (<= (+ main_~q~0 main_~p~0) 1))} is VALID [2022-04-08 12:20:41,401 INFO L290 TraceCheckUtils]: 63: Hoare triple {13147#(and (<= 1 main_~s~0) (= (+ main_~s~0 main_~r~0) 0) (<= 1 main_~x~0) (<= main_~x~0 (+ main_~b~0 main_~a~0)) (< main_~b~0 main_~x~0) (<= main_~x~0 5) (= main_~b~0 main_~y~0) (= main_~q~0 0) (not (= main_~b~0 main_~a~0)) (<= (+ main_~q~0 main_~p~0) 1))} assume !(~a~0 > ~b~0);~b~0 := ~b~0 - ~a~0;~q~0 := ~q~0 - ~p~0;~s~0 := ~s~0 - ~r~0; {13151#(and (<= (+ main_~r~0 1) 0) (<= main_~x~0 (+ (* main_~a~0 2) main_~b~0)) (< (+ main_~b~0 main_~a~0) main_~x~0) (= main_~y~0 (+ main_~b~0 main_~a~0)) (<= main_~x~0 5) (not (= main_~b~0 0)) (<= main_~p~0 1) (<= 0 main_~b~0) (= (+ main_~q~0 main_~p~0) 0) (= (+ main_~s~0 (* main_~r~0 2)) 0))} is VALID [2022-04-08 12:20:41,402 INFO L290 TraceCheckUtils]: 64: Hoare triple {13151#(and (<= (+ main_~r~0 1) 0) (<= main_~x~0 (+ (* main_~a~0 2) main_~b~0)) (< (+ main_~b~0 main_~a~0) main_~x~0) (= main_~y~0 (+ main_~b~0 main_~a~0)) (<= main_~x~0 5) (not (= main_~b~0 0)) (<= main_~p~0 1) (<= 0 main_~b~0) (= (+ main_~q~0 main_~p~0) 0) (= (+ main_~s~0 (* main_~r~0 2)) 0))} assume !false; {13151#(and (<= (+ main_~r~0 1) 0) (<= main_~x~0 (+ (* main_~a~0 2) main_~b~0)) (< (+ main_~b~0 main_~a~0) main_~x~0) (= main_~y~0 (+ main_~b~0 main_~a~0)) (<= main_~x~0 5) (not (= main_~b~0 0)) (<= main_~p~0 1) (<= 0 main_~b~0) (= (+ main_~q~0 main_~p~0) 0) (= (+ main_~s~0 (* main_~r~0 2)) 0))} is VALID [2022-04-08 12:20:41,402 INFO L272 TraceCheckUtils]: 65: Hoare triple {13151#(and (<= (+ main_~r~0 1) 0) (<= main_~x~0 (+ (* main_~a~0 2) main_~b~0)) (< (+ main_~b~0 main_~a~0) main_~x~0) (= main_~y~0 (+ main_~b~0 main_~a~0)) (<= main_~x~0 5) (not (= main_~b~0 0)) (<= main_~p~0 1) (<= 0 main_~b~0) (= (+ main_~q~0 main_~p~0) 0) (= (+ main_~s~0 (* main_~r~0 2)) 0))} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {12950#true} is VALID [2022-04-08 12:20:41,402 INFO L290 TraceCheckUtils]: 66: Hoare triple {12950#true} ~cond := #in~cond; {12950#true} is VALID [2022-04-08 12:20:41,402 INFO L290 TraceCheckUtils]: 67: Hoare triple {12950#true} assume !(0 == ~cond); {12950#true} is VALID [2022-04-08 12:20:41,402 INFO L290 TraceCheckUtils]: 68: Hoare triple {12950#true} assume true; {12950#true} is VALID [2022-04-08 12:20:41,403 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {12950#true} {13151#(and (<= (+ main_~r~0 1) 0) (<= main_~x~0 (+ (* main_~a~0 2) main_~b~0)) (< (+ main_~b~0 main_~a~0) main_~x~0) (= main_~y~0 (+ main_~b~0 main_~a~0)) (<= main_~x~0 5) (not (= main_~b~0 0)) (<= main_~p~0 1) (<= 0 main_~b~0) (= (+ main_~q~0 main_~p~0) 0) (= (+ main_~s~0 (* main_~r~0 2)) 0))} #74#return; {13151#(and (<= (+ main_~r~0 1) 0) (<= main_~x~0 (+ (* main_~a~0 2) main_~b~0)) (< (+ main_~b~0 main_~a~0) main_~x~0) (= main_~y~0 (+ main_~b~0 main_~a~0)) (<= main_~x~0 5) (not (= main_~b~0 0)) (<= main_~p~0 1) (<= 0 main_~b~0) (= (+ main_~q~0 main_~p~0) 0) (= (+ main_~s~0 (* main_~r~0 2)) 0))} is VALID [2022-04-08 12:20:41,403 INFO L272 TraceCheckUtils]: 70: Hoare triple {13151#(and (<= (+ main_~r~0 1) 0) (<= main_~x~0 (+ (* main_~a~0 2) main_~b~0)) (< (+ main_~b~0 main_~a~0) main_~x~0) (= main_~y~0 (+ main_~b~0 main_~a~0)) (<= main_~x~0 5) (not (= main_~b~0 0)) (<= main_~p~0 1) (<= 0 main_~b~0) (= (+ main_~q~0 main_~p~0) 0) (= (+ main_~s~0 (* main_~r~0 2)) 0))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {12950#true} is VALID [2022-04-08 12:20:41,403 INFO L290 TraceCheckUtils]: 71: Hoare triple {12950#true} ~cond := #in~cond; {13176#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 12:20:41,403 INFO L290 TraceCheckUtils]: 72: Hoare triple {13176#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {13180#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 12:20:41,403 INFO L290 TraceCheckUtils]: 73: Hoare triple {13180#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {13180#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 12:20:41,404 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {13180#(not (= |__VERIFIER_assert_#in~cond| 0))} {13151#(and (<= (+ main_~r~0 1) 0) (<= main_~x~0 (+ (* main_~a~0 2) main_~b~0)) (< (+ main_~b~0 main_~a~0) main_~x~0) (= main_~y~0 (+ main_~b~0 main_~a~0)) (<= main_~x~0 5) (not (= main_~b~0 0)) (<= main_~p~0 1) (<= 0 main_~b~0) (= (+ main_~q~0 main_~p~0) 0) (= (+ main_~s~0 (* main_~r~0 2)) 0))} #76#return; {13187#(and (<= (+ main_~r~0 1) 0) (<= main_~x~0 (+ (* main_~a~0 2) main_~b~0)) (< (+ main_~b~0 main_~a~0) main_~x~0) (= main_~y~0 (+ main_~b~0 main_~a~0)) (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (<= main_~x~0 5) (not (= main_~b~0 0)) (<= main_~p~0 1) (<= 0 main_~b~0) (= (+ main_~q~0 main_~p~0) 0) (= (+ main_~s~0 (* main_~r~0 2)) 0))} is VALID [2022-04-08 12:20:41,404 INFO L272 TraceCheckUtils]: 75: Hoare triple {13187#(and (<= (+ main_~r~0 1) 0) (<= main_~x~0 (+ (* main_~a~0 2) main_~b~0)) (< (+ main_~b~0 main_~a~0) main_~x~0) (= main_~y~0 (+ main_~b~0 main_~a~0)) (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (<= main_~x~0 5) (not (= main_~b~0 0)) (<= main_~p~0 1) (<= 0 main_~b~0) (= (+ main_~q~0 main_~p~0) 0) (= (+ main_~s~0 (* main_~r~0 2)) 0))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {12950#true} is VALID [2022-04-08 12:20:41,405 INFO L290 TraceCheckUtils]: 76: Hoare triple {12950#true} ~cond := #in~cond; {13176#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 12:20:41,405 INFO L290 TraceCheckUtils]: 77: Hoare triple {13176#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {13180#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 12:20:41,405 INFO L290 TraceCheckUtils]: 78: Hoare triple {13180#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {13180#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 12:20:41,406 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {13180#(not (= |__VERIFIER_assert_#in~cond| 0))} {13187#(and (<= (+ main_~r~0 1) 0) (<= main_~x~0 (+ (* main_~a~0 2) main_~b~0)) (< (+ main_~b~0 main_~a~0) main_~x~0) (= main_~y~0 (+ main_~b~0 main_~a~0)) (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (<= main_~x~0 5) (not (= main_~b~0 0)) (<= main_~p~0 1) (<= 0 main_~b~0) (= (+ main_~q~0 main_~p~0) 0) (= (+ main_~s~0 (* main_~r~0 2)) 0))} #78#return; {13187#(and (<= (+ main_~r~0 1) 0) (<= main_~x~0 (+ (* main_~a~0 2) main_~b~0)) (< (+ main_~b~0 main_~a~0) main_~x~0) (= main_~y~0 (+ main_~b~0 main_~a~0)) (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (<= main_~x~0 5) (not (= main_~b~0 0)) (<= main_~p~0 1) (<= 0 main_~b~0) (= (+ main_~q~0 main_~p~0) 0) (= (+ main_~s~0 (* main_~r~0 2)) 0))} is VALID [2022-04-08 12:20:41,406 INFO L290 TraceCheckUtils]: 80: Hoare triple {13187#(and (<= (+ main_~r~0 1) 0) (<= main_~x~0 (+ (* main_~a~0 2) main_~b~0)) (< (+ main_~b~0 main_~a~0) main_~x~0) (= main_~y~0 (+ main_~b~0 main_~a~0)) (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (<= main_~x~0 5) (not (= main_~b~0 0)) (<= main_~p~0 1) (<= 0 main_~b~0) (= (+ main_~q~0 main_~p~0) 0) (= (+ main_~s~0 (* main_~r~0 2)) 0))} assume !!(~a~0 != ~b~0); {13187#(and (<= (+ main_~r~0 1) 0) (<= main_~x~0 (+ (* main_~a~0 2) main_~b~0)) (< (+ main_~b~0 main_~a~0) main_~x~0) (= main_~y~0 (+ main_~b~0 main_~a~0)) (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (<= main_~x~0 5) (not (= main_~b~0 0)) (<= main_~p~0 1) (<= 0 main_~b~0) (= (+ main_~q~0 main_~p~0) 0) (= (+ main_~s~0 (* main_~r~0 2)) 0))} is VALID [2022-04-08 12:20:41,411 INFO L290 TraceCheckUtils]: 81: Hoare triple {13187#(and (<= (+ main_~r~0 1) 0) (<= main_~x~0 (+ (* main_~a~0 2) main_~b~0)) (< (+ main_~b~0 main_~a~0) main_~x~0) (= main_~y~0 (+ main_~b~0 main_~a~0)) (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (<= main_~x~0 5) (not (= main_~b~0 0)) (<= main_~p~0 1) (<= 0 main_~b~0) (= (+ main_~q~0 main_~p~0) 0) (= (+ main_~s~0 (* main_~r~0 2)) 0))} assume ~a~0 > ~b~0;~a~0 := ~a~0 - ~b~0;~p~0 := ~p~0 - ~q~0;~r~0 := ~r~0 - ~s~0; {13209#(and (= (mod main_~r~0 3) 0) (< (+ (* (* main_~y~0 main_~r~0) 2) (* 2 (* main_~y~0 (div (* (- 2) main_~r~0) 3)))) (+ (* 2 (* main_~x~0 (div (* (- 1) main_~p~0) 2))) main_~a~0 main_~x~0)) (<= main_~x~0 5) (<= 0 (+ (div (* (- 1) main_~p~0) 2) 1)) (<= (+ main_~a~0 (* main_~x~0 (div (* (- 1) main_~p~0) 2))) (+ (* main_~y~0 main_~r~0) (* main_~y~0 (div (* (- 2) main_~r~0) 3)))) (< 0 main_~a~0) (= (mod main_~p~0 2) 0) (= (+ (* (* main_~y~0 main_~r~0) 2) (* 2 (* main_~y~0 (div (* (- 2) main_~r~0) 3)))) (+ (* 2 (* main_~x~0 (div (* (- 1) main_~p~0) 2))) main_~a~0 main_~y~0)) (not (= (+ main_~a~0 (* main_~x~0 (div (* (- 1) main_~p~0) 2))) (+ (* main_~y~0 main_~r~0) (* main_~y~0 (div (* (- 2) main_~r~0) 3))))) (<= (+ main_~r~0 (div (* (- 2) main_~r~0) 3) 1) 0))} is VALID [2022-04-08 12:20:41,411 INFO L290 TraceCheckUtils]: 82: Hoare triple {13209#(and (= (mod main_~r~0 3) 0) (< (+ (* (* main_~y~0 main_~r~0) 2) (* 2 (* main_~y~0 (div (* (- 2) main_~r~0) 3)))) (+ (* 2 (* main_~x~0 (div (* (- 1) main_~p~0) 2))) main_~a~0 main_~x~0)) (<= main_~x~0 5) (<= 0 (+ (div (* (- 1) main_~p~0) 2) 1)) (<= (+ main_~a~0 (* main_~x~0 (div (* (- 1) main_~p~0) 2))) (+ (* main_~y~0 main_~r~0) (* main_~y~0 (div (* (- 2) main_~r~0) 3)))) (< 0 main_~a~0) (= (mod main_~p~0 2) 0) (= (+ (* (* main_~y~0 main_~r~0) 2) (* 2 (* main_~y~0 (div (* (- 2) main_~r~0) 3)))) (+ (* 2 (* main_~x~0 (div (* (- 1) main_~p~0) 2))) main_~a~0 main_~y~0)) (not (= (+ main_~a~0 (* main_~x~0 (div (* (- 1) main_~p~0) 2))) (+ (* main_~y~0 main_~r~0) (* main_~y~0 (div (* (- 2) main_~r~0) 3))))) (<= (+ main_~r~0 (div (* (- 2) main_~r~0) 3) 1) 0))} assume !false; {13209#(and (= (mod main_~r~0 3) 0) (< (+ (* (* main_~y~0 main_~r~0) 2) (* 2 (* main_~y~0 (div (* (- 2) main_~r~0) 3)))) (+ (* 2 (* main_~x~0 (div (* (- 1) main_~p~0) 2))) main_~a~0 main_~x~0)) (<= main_~x~0 5) (<= 0 (+ (div (* (- 1) main_~p~0) 2) 1)) (<= (+ main_~a~0 (* main_~x~0 (div (* (- 1) main_~p~0) 2))) (+ (* main_~y~0 main_~r~0) (* main_~y~0 (div (* (- 2) main_~r~0) 3)))) (< 0 main_~a~0) (= (mod main_~p~0 2) 0) (= (+ (* (* main_~y~0 main_~r~0) 2) (* 2 (* main_~y~0 (div (* (- 2) main_~r~0) 3)))) (+ (* 2 (* main_~x~0 (div (* (- 1) main_~p~0) 2))) main_~a~0 main_~y~0)) (not (= (+ main_~a~0 (* main_~x~0 (div (* (- 1) main_~p~0) 2))) (+ (* main_~y~0 main_~r~0) (* main_~y~0 (div (* (- 2) main_~r~0) 3))))) (<= (+ main_~r~0 (div (* (- 2) main_~r~0) 3) 1) 0))} is VALID [2022-04-08 12:20:41,411 INFO L272 TraceCheckUtils]: 83: Hoare triple {13209#(and (= (mod main_~r~0 3) 0) (< (+ (* (* main_~y~0 main_~r~0) 2) (* 2 (* main_~y~0 (div (* (- 2) main_~r~0) 3)))) (+ (* 2 (* main_~x~0 (div (* (- 1) main_~p~0) 2))) main_~a~0 main_~x~0)) (<= main_~x~0 5) (<= 0 (+ (div (* (- 1) main_~p~0) 2) 1)) (<= (+ main_~a~0 (* main_~x~0 (div (* (- 1) main_~p~0) 2))) (+ (* main_~y~0 main_~r~0) (* main_~y~0 (div (* (- 2) main_~r~0) 3)))) (< 0 main_~a~0) (= (mod main_~p~0 2) 0) (= (+ (* (* main_~y~0 main_~r~0) 2) (* 2 (* main_~y~0 (div (* (- 2) main_~r~0) 3)))) (+ (* 2 (* main_~x~0 (div (* (- 1) main_~p~0) 2))) main_~a~0 main_~y~0)) (not (= (+ main_~a~0 (* main_~x~0 (div (* (- 1) main_~p~0) 2))) (+ (* main_~y~0 main_~r~0) (* main_~y~0 (div (* (- 2) main_~r~0) 3))))) (<= (+ main_~r~0 (div (* (- 2) main_~r~0) 3) 1) 0))} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {12950#true} is VALID [2022-04-08 12:20:41,412 INFO L290 TraceCheckUtils]: 84: Hoare triple {12950#true} ~cond := #in~cond; {12950#true} is VALID [2022-04-08 12:20:41,412 INFO L290 TraceCheckUtils]: 85: Hoare triple {12950#true} assume !(0 == ~cond); {12950#true} is VALID [2022-04-08 12:20:41,412 INFO L290 TraceCheckUtils]: 86: Hoare triple {12950#true} assume true; {12950#true} is VALID [2022-04-08 12:20:41,412 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {12950#true} {13209#(and (= (mod main_~r~0 3) 0) (< (+ (* (* main_~y~0 main_~r~0) 2) (* 2 (* main_~y~0 (div (* (- 2) main_~r~0) 3)))) (+ (* 2 (* main_~x~0 (div (* (- 1) main_~p~0) 2))) main_~a~0 main_~x~0)) (<= main_~x~0 5) (<= 0 (+ (div (* (- 1) main_~p~0) 2) 1)) (<= (+ main_~a~0 (* main_~x~0 (div (* (- 1) main_~p~0) 2))) (+ (* main_~y~0 main_~r~0) (* main_~y~0 (div (* (- 2) main_~r~0) 3)))) (< 0 main_~a~0) (= (mod main_~p~0 2) 0) (= (+ (* (* main_~y~0 main_~r~0) 2) (* 2 (* main_~y~0 (div (* (- 2) main_~r~0) 3)))) (+ (* 2 (* main_~x~0 (div (* (- 1) main_~p~0) 2))) main_~a~0 main_~y~0)) (not (= (+ main_~a~0 (* main_~x~0 (div (* (- 1) main_~p~0) 2))) (+ (* main_~y~0 main_~r~0) (* main_~y~0 (div (* (- 2) main_~r~0) 3))))) (<= (+ main_~r~0 (div (* (- 2) main_~r~0) 3) 1) 0))} #74#return; {13209#(and (= (mod main_~r~0 3) 0) (< (+ (* (* main_~y~0 main_~r~0) 2) (* 2 (* main_~y~0 (div (* (- 2) main_~r~0) 3)))) (+ (* 2 (* main_~x~0 (div (* (- 1) main_~p~0) 2))) main_~a~0 main_~x~0)) (<= main_~x~0 5) (<= 0 (+ (div (* (- 1) main_~p~0) 2) 1)) (<= (+ main_~a~0 (* main_~x~0 (div (* (- 1) main_~p~0) 2))) (+ (* main_~y~0 main_~r~0) (* main_~y~0 (div (* (- 2) main_~r~0) 3)))) (< 0 main_~a~0) (= (mod main_~p~0 2) 0) (= (+ (* (* main_~y~0 main_~r~0) 2) (* 2 (* main_~y~0 (div (* (- 2) main_~r~0) 3)))) (+ (* 2 (* main_~x~0 (div (* (- 1) main_~p~0) 2))) main_~a~0 main_~y~0)) (not (= (+ main_~a~0 (* main_~x~0 (div (* (- 1) main_~p~0) 2))) (+ (* main_~y~0 main_~r~0) (* main_~y~0 (div (* (- 2) main_~r~0) 3))))) (<= (+ main_~r~0 (div (* (- 2) main_~r~0) 3) 1) 0))} is VALID [2022-04-08 12:20:41,421 INFO L272 TraceCheckUtils]: 88: Hoare triple {13209#(and (= (mod main_~r~0 3) 0) (< (+ (* (* main_~y~0 main_~r~0) 2) (* 2 (* main_~y~0 (div (* (- 2) main_~r~0) 3)))) (+ (* 2 (* main_~x~0 (div (* (- 1) main_~p~0) 2))) main_~a~0 main_~x~0)) (<= main_~x~0 5) (<= 0 (+ (div (* (- 1) main_~p~0) 2) 1)) (<= (+ main_~a~0 (* main_~x~0 (div (* (- 1) main_~p~0) 2))) (+ (* main_~y~0 main_~r~0) (* main_~y~0 (div (* (- 2) main_~r~0) 3)))) (< 0 main_~a~0) (= (mod main_~p~0 2) 0) (= (+ (* (* main_~y~0 main_~r~0) 2) (* 2 (* main_~y~0 (div (* (- 2) main_~r~0) 3)))) (+ (* 2 (* main_~x~0 (div (* (- 1) main_~p~0) 2))) main_~a~0 main_~y~0)) (not (= (+ main_~a~0 (* main_~x~0 (div (* (- 1) main_~p~0) 2))) (+ (* main_~y~0 main_~r~0) (* main_~y~0 (div (* (- 2) main_~r~0) 3))))) (<= (+ main_~r~0 (div (* (- 2) main_~r~0) 3) 1) 0))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {13231#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 12:20:41,421 INFO L290 TraceCheckUtils]: 89: Hoare triple {13231#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {13235#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 12:20:41,422 INFO L290 TraceCheckUtils]: 90: Hoare triple {13235#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {12951#false} is VALID [2022-04-08 12:20:41,422 INFO L290 TraceCheckUtils]: 91: Hoare triple {12951#false} assume !false; {12951#false} is VALID [2022-04-08 12:20:41,422 INFO L134 CoverageAnalysis]: Checked inductivity of 251 backedges. 63 proven. 44 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2022-04-08 12:20:41,422 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 12:21:05,162 INFO L290 TraceCheckUtils]: 91: Hoare triple {12951#false} assume !false; {12951#false} is VALID [2022-04-08 12:21:05,162 INFO L290 TraceCheckUtils]: 90: Hoare triple {13235#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {12951#false} is VALID [2022-04-08 12:21:05,163 INFO L290 TraceCheckUtils]: 89: Hoare triple {13231#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {13235#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 12:21:05,163 INFO L272 TraceCheckUtils]: 88: Hoare triple {13251#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {13231#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 12:21:05,164 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {12950#true} {13251#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} #74#return; {13251#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-08 12:21:05,164 INFO L290 TraceCheckUtils]: 86: Hoare triple {12950#true} assume true; {12950#true} is VALID [2022-04-08 12:21:05,164 INFO L290 TraceCheckUtils]: 85: Hoare triple {12950#true} assume !(0 == ~cond); {12950#true} is VALID [2022-04-08 12:21:05,164 INFO L290 TraceCheckUtils]: 84: Hoare triple {12950#true} ~cond := #in~cond; {12950#true} is VALID [2022-04-08 12:21:05,164 INFO L272 TraceCheckUtils]: 83: Hoare triple {13251#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {12950#true} is VALID [2022-04-08 12:21:05,164 INFO L290 TraceCheckUtils]: 82: Hoare triple {13251#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} assume !false; {13251#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-08 12:21:07,166 WARN L290 TraceCheckUtils]: 81: Hoare triple {13273#(or (= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0))))) (not (< main_~b~0 main_~a~0)))} assume ~a~0 > ~b~0;~a~0 := ~a~0 - ~b~0;~p~0 := ~p~0 - ~q~0;~r~0 := ~r~0 - ~s~0; {13251#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is UNKNOWN [2022-04-08 12:21:07,166 INFO L290 TraceCheckUtils]: 80: Hoare triple {13273#(or (= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0))))) (not (< main_~b~0 main_~a~0)))} assume !!(~a~0 != ~b~0); {13273#(or (= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0))))) (not (< main_~b~0 main_~a~0)))} is VALID [2022-04-08 12:21:07,167 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {13180#(not (= |__VERIFIER_assert_#in~cond| 0))} {13280#(or (= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0))))) (not (< main_~b~0 main_~a~0)) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} #78#return; {13273#(or (= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0))))) (not (< main_~b~0 main_~a~0)))} is VALID [2022-04-08 12:21:07,167 INFO L290 TraceCheckUtils]: 78: Hoare triple {13180#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {13180#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 12:21:07,168 INFO L290 TraceCheckUtils]: 77: Hoare triple {13290#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {13180#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 12:21:07,168 INFO L290 TraceCheckUtils]: 76: Hoare triple {12950#true} ~cond := #in~cond; {13290#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 12:21:07,168 INFO L272 TraceCheckUtils]: 75: Hoare triple {13280#(or (= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0))))) (not (< main_~b~0 main_~a~0)) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {12950#true} is VALID [2022-04-08 12:21:07,169 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {13180#(not (= |__VERIFIER_assert_#in~cond| 0))} {12950#true} #76#return; {13280#(or (= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0))))) (not (< main_~b~0 main_~a~0)) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} is VALID [2022-04-08 12:21:07,170 INFO L290 TraceCheckUtils]: 73: Hoare triple {13180#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {13180#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 12:21:07,170 INFO L290 TraceCheckUtils]: 72: Hoare triple {13290#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {13180#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 12:21:07,170 INFO L290 TraceCheckUtils]: 71: Hoare triple {12950#true} ~cond := #in~cond; {13290#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 12:21:07,170 INFO L272 TraceCheckUtils]: 70: Hoare triple {12950#true} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {12950#true} is VALID [2022-04-08 12:21:07,170 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {12950#true} {12950#true} #74#return; {12950#true} is VALID [2022-04-08 12:21:07,170 INFO L290 TraceCheckUtils]: 68: Hoare triple {12950#true} assume true; {12950#true} is VALID [2022-04-08 12:21:07,170 INFO L290 TraceCheckUtils]: 67: Hoare triple {12950#true} assume !(0 == ~cond); {12950#true} is VALID [2022-04-08 12:21:07,170 INFO L290 TraceCheckUtils]: 66: Hoare triple {12950#true} ~cond := #in~cond; {12950#true} is VALID [2022-04-08 12:21:07,170 INFO L272 TraceCheckUtils]: 65: Hoare triple {12950#true} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {12950#true} is VALID [2022-04-08 12:21:07,171 INFO L290 TraceCheckUtils]: 64: Hoare triple {12950#true} assume !false; {12950#true} is VALID [2022-04-08 12:21:07,171 INFO L290 TraceCheckUtils]: 63: Hoare triple {12950#true} assume !(~a~0 > ~b~0);~b~0 := ~b~0 - ~a~0;~q~0 := ~q~0 - ~p~0;~s~0 := ~s~0 - ~r~0; {12950#true} is VALID [2022-04-08 12:21:07,171 INFO L290 TraceCheckUtils]: 62: Hoare triple {12950#true} assume !!(~a~0 != ~b~0); {12950#true} is VALID [2022-04-08 12:21:07,171 INFO L284 TraceCheckUtils]: 61: Hoare quadruple {12950#true} {12950#true} #78#return; {12950#true} is VALID [2022-04-08 12:21:07,171 INFO L290 TraceCheckUtils]: 60: Hoare triple {12950#true} assume true; {12950#true} is VALID [2022-04-08 12:21:07,171 INFO L290 TraceCheckUtils]: 59: Hoare triple {12950#true} assume !(0 == ~cond); {12950#true} is VALID [2022-04-08 12:21:07,171 INFO L290 TraceCheckUtils]: 58: Hoare triple {12950#true} ~cond := #in~cond; {12950#true} is VALID [2022-04-08 12:21:07,171 INFO L272 TraceCheckUtils]: 57: Hoare triple {12950#true} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {12950#true} is VALID [2022-04-08 12:21:07,171 INFO L284 TraceCheckUtils]: 56: Hoare quadruple {12950#true} {12950#true} #76#return; {12950#true} is VALID [2022-04-08 12:21:07,171 INFO L290 TraceCheckUtils]: 55: Hoare triple {12950#true} assume true; {12950#true} is VALID [2022-04-08 12:21:07,171 INFO L290 TraceCheckUtils]: 54: Hoare triple {12950#true} assume !(0 == ~cond); {12950#true} is VALID [2022-04-08 12:21:07,171 INFO L290 TraceCheckUtils]: 53: Hoare triple {12950#true} ~cond := #in~cond; {12950#true} is VALID [2022-04-08 12:21:07,171 INFO L272 TraceCheckUtils]: 52: Hoare triple {12950#true} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {12950#true} is VALID [2022-04-08 12:21:07,171 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {12950#true} {12950#true} #74#return; {12950#true} is VALID [2022-04-08 12:21:07,171 INFO L290 TraceCheckUtils]: 50: Hoare triple {12950#true} assume true; {12950#true} is VALID [2022-04-08 12:21:07,171 INFO L290 TraceCheckUtils]: 49: Hoare triple {12950#true} assume !(0 == ~cond); {12950#true} is VALID [2022-04-08 12:21:07,171 INFO L290 TraceCheckUtils]: 48: Hoare triple {12950#true} ~cond := #in~cond; {12950#true} is VALID [2022-04-08 12:21:07,171 INFO L272 TraceCheckUtils]: 47: Hoare triple {12950#true} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {12950#true} is VALID [2022-04-08 12:21:07,171 INFO L290 TraceCheckUtils]: 46: Hoare triple {12950#true} assume !false; {12950#true} is VALID [2022-04-08 12:21:07,172 INFO L290 TraceCheckUtils]: 45: Hoare triple {12950#true} assume ~a~0 > ~b~0;~a~0 := ~a~0 - ~b~0;~p~0 := ~p~0 - ~q~0;~r~0 := ~r~0 - ~s~0; {12950#true} is VALID [2022-04-08 12:21:07,172 INFO L290 TraceCheckUtils]: 44: Hoare triple {12950#true} assume !!(~a~0 != ~b~0); {12950#true} is VALID [2022-04-08 12:21:07,172 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {12950#true} {12950#true} #78#return; {12950#true} is VALID [2022-04-08 12:21:07,172 INFO L290 TraceCheckUtils]: 42: Hoare triple {12950#true} assume true; {12950#true} is VALID [2022-04-08 12:21:07,172 INFO L290 TraceCheckUtils]: 41: Hoare triple {12950#true} assume !(0 == ~cond); {12950#true} is VALID [2022-04-08 12:21:07,172 INFO L290 TraceCheckUtils]: 40: Hoare triple {12950#true} ~cond := #in~cond; {12950#true} is VALID [2022-04-08 12:21:07,172 INFO L272 TraceCheckUtils]: 39: Hoare triple {12950#true} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {12950#true} is VALID [2022-04-08 12:21:07,172 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {12950#true} {12950#true} #76#return; {12950#true} is VALID [2022-04-08 12:21:07,172 INFO L290 TraceCheckUtils]: 37: Hoare triple {12950#true} assume true; {12950#true} is VALID [2022-04-08 12:21:07,172 INFO L290 TraceCheckUtils]: 36: Hoare triple {12950#true} assume !(0 == ~cond); {12950#true} is VALID [2022-04-08 12:21:07,172 INFO L290 TraceCheckUtils]: 35: Hoare triple {12950#true} ~cond := #in~cond; {12950#true} is VALID [2022-04-08 12:21:07,172 INFO L272 TraceCheckUtils]: 34: Hoare triple {12950#true} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {12950#true} is VALID [2022-04-08 12:21:07,172 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {12950#true} {12950#true} #74#return; {12950#true} is VALID [2022-04-08 12:21:07,172 INFO L290 TraceCheckUtils]: 32: Hoare triple {12950#true} assume true; {12950#true} is VALID [2022-04-08 12:21:07,172 INFO L290 TraceCheckUtils]: 31: Hoare triple {12950#true} assume !(0 == ~cond); {12950#true} is VALID [2022-04-08 12:21:07,172 INFO L290 TraceCheckUtils]: 30: Hoare triple {12950#true} ~cond := #in~cond; {12950#true} is VALID [2022-04-08 12:21:07,172 INFO L272 TraceCheckUtils]: 29: Hoare triple {12950#true} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {12950#true} is VALID [2022-04-08 12:21:07,172 INFO L290 TraceCheckUtils]: 28: Hoare triple {12950#true} assume !false; {12950#true} is VALID [2022-04-08 12:21:07,172 INFO L290 TraceCheckUtils]: 27: Hoare triple {12950#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {12950#true} is VALID [2022-04-08 12:21:07,173 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {12950#true} {12950#true} #72#return; {12950#true} is VALID [2022-04-08 12:21:07,173 INFO L290 TraceCheckUtils]: 25: Hoare triple {12950#true} assume true; {12950#true} is VALID [2022-04-08 12:21:07,173 INFO L290 TraceCheckUtils]: 24: Hoare triple {12950#true} assume !(0 == ~cond); {12950#true} is VALID [2022-04-08 12:21:07,173 INFO L290 TraceCheckUtils]: 23: Hoare triple {12950#true} ~cond := #in~cond; {12950#true} is VALID [2022-04-08 12:21:07,173 INFO L272 TraceCheckUtils]: 22: Hoare triple {12950#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {12950#true} is VALID [2022-04-08 12:21:07,173 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {12950#true} {12950#true} #70#return; {12950#true} is VALID [2022-04-08 12:21:07,173 INFO L290 TraceCheckUtils]: 20: Hoare triple {12950#true} assume true; {12950#true} is VALID [2022-04-08 12:21:07,173 INFO L290 TraceCheckUtils]: 19: Hoare triple {12950#true} assume !(0 == ~cond); {12950#true} is VALID [2022-04-08 12:21:07,173 INFO L290 TraceCheckUtils]: 18: Hoare triple {12950#true} ~cond := #in~cond; {12950#true} is VALID [2022-04-08 12:21:07,173 INFO L272 TraceCheckUtils]: 17: Hoare triple {12950#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {12950#true} is VALID [2022-04-08 12:21:07,173 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {12950#true} {12950#true} #68#return; {12950#true} is VALID [2022-04-08 12:21:07,173 INFO L290 TraceCheckUtils]: 15: Hoare triple {12950#true} assume true; {12950#true} is VALID [2022-04-08 12:21:07,173 INFO L290 TraceCheckUtils]: 14: Hoare triple {12950#true} assume !(0 == ~cond); {12950#true} is VALID [2022-04-08 12:21:07,173 INFO L290 TraceCheckUtils]: 13: Hoare triple {12950#true} ~cond := #in~cond; {12950#true} is VALID [2022-04-08 12:21:07,173 INFO L272 TraceCheckUtils]: 12: Hoare triple {12950#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 5 then 1 else 0)); {12950#true} is VALID [2022-04-08 12:21:07,173 INFO L290 TraceCheckUtils]: 11: Hoare triple {12950#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {12950#true} is VALID [2022-04-08 12:21:07,173 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {12950#true} {12950#true} #66#return; {12950#true} is VALID [2022-04-08 12:21:07,173 INFO L290 TraceCheckUtils]: 9: Hoare triple {12950#true} assume true; {12950#true} is VALID [2022-04-08 12:21:07,173 INFO L290 TraceCheckUtils]: 8: Hoare triple {12950#true} assume !(0 == ~cond); {12950#true} is VALID [2022-04-08 12:21:07,173 INFO L290 TraceCheckUtils]: 7: Hoare triple {12950#true} ~cond := #in~cond; {12950#true} is VALID [2022-04-08 12:21:07,174 INFO L272 TraceCheckUtils]: 6: Hoare triple {12950#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 5 then 1 else 0)); {12950#true} is VALID [2022-04-08 12:21:07,174 INFO L290 TraceCheckUtils]: 5: Hoare triple {12950#true} havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~x~0;havoc ~y~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {12950#true} is VALID [2022-04-08 12:21:07,174 INFO L272 TraceCheckUtils]: 4: Hoare triple {12950#true} call #t~ret6 := main(); {12950#true} is VALID [2022-04-08 12:21:07,174 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12950#true} {12950#true} #88#return; {12950#true} is VALID [2022-04-08 12:21:07,174 INFO L290 TraceCheckUtils]: 2: Hoare triple {12950#true} assume true; {12950#true} is VALID [2022-04-08 12:21:07,174 INFO L290 TraceCheckUtils]: 1: Hoare triple {12950#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(10, 2);call #Ultimate.allocInit(12, 3); {12950#true} is VALID [2022-04-08 12:21:07,174 INFO L272 TraceCheckUtils]: 0: Hoare triple {12950#true} call ULTIMATE.init(); {12950#true} is VALID [2022-04-08 12:21:07,174 INFO L134 CoverageAnalysis]: Checked inductivity of 251 backedges. 75 proven. 8 refuted. 0 times theorem prover too weak. 168 trivial. 0 not checked. [2022-04-08 12:21:07,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 12:21:07,174 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [653873022] [2022-04-08 12:21:07,174 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 12:21:07,174 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2002021934] [2022-04-08 12:21:07,174 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2002021934] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 12:21:07,174 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 12:21:07,175 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 9] total 20 [2022-04-08 12:21:07,175 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 12:21:07,175 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1538698271] [2022-04-08 12:21:07,175 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1538698271] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 12:21:07,175 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 12:21:07,175 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-04-08 12:21:07,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [783704320] [2022-04-08 12:21:07,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 12:21:07,175 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.875) internal successors, (30), 14 states have internal predecessors, (30), 8 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (15), 8 states have call predecessors, (15), 8 states have call successors, (15) Word has length 92 [2022-04-08 12:21:07,176 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 12:21:07,176 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 16 states, 16 states have (on average 1.875) internal successors, (30), 14 states have internal predecessors, (30), 8 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (15), 8 states have call predecessors, (15), 8 states have call successors, (15) [2022-04-08 12:21:07,272 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 12:21:07,272 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-08 12:21:07,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 12:21:07,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-08 12:21:07,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=316, Unknown=0, NotChecked=0, Total=380 [2022-04-08 12:21:07,273 INFO L87 Difference]: Start difference. First operand 155 states and 180 transitions. Second operand has 16 states, 16 states have (on average 1.875) internal successors, (30), 14 states have internal predecessors, (30), 8 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (15), 8 states have call predecessors, (15), 8 states have call successors, (15) [2022-04-08 12:21:17,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:21:17,966 INFO L93 Difference]: Finished difference Result 185 states and 218 transitions. [2022-04-08 12:21:17,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-04-08 12:21:17,966 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.875) internal successors, (30), 14 states have internal predecessors, (30), 8 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (15), 8 states have call predecessors, (15), 8 states have call successors, (15) Word has length 92 [2022-04-08 12:21:17,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 12:21:17,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.875) internal successors, (30), 14 states have internal predecessors, (30), 8 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (15), 8 states have call predecessors, (15), 8 states have call successors, (15) [2022-04-08 12:21:17,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 79 transitions. [2022-04-08 12:21:17,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.875) internal successors, (30), 14 states have internal predecessors, (30), 8 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (15), 8 states have call predecessors, (15), 8 states have call successors, (15) [2022-04-08 12:21:17,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 79 transitions. [2022-04-08 12:21:17,969 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 79 transitions. [2022-04-08 12:21:18,067 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 79 edges. 79 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 12:21:18,069 INFO L225 Difference]: With dead ends: 185 [2022-04-08 12:21:18,069 INFO L226 Difference]: Without dead ends: 183 [2022-04-08 12:21:18,070 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 163 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=81, Invalid=425, Unknown=0, NotChecked=0, Total=506 [2022-04-08 12:21:18,070 INFO L913 BasicCegarLoop]: 33 mSDtfsCounter, 24 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 506 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 525 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 506 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.8s IncrementalHoareTripleChecker+Time [2022-04-08 12:21:18,070 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [31 Valid, 189 Invalid, 525 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 506 Invalid, 0 Unknown, 0 Unchecked, 4.8s Time] [2022-04-08 12:21:18,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2022-04-08 12:21:18,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 183. [2022-04-08 12:21:18,408 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 12:21:18,408 INFO L82 GeneralOperation]: Start isEquivalent. First operand 183 states. Second operand has 183 states, 110 states have (on average 1.1) internal successors, (121), 115 states have internal predecessors, (121), 48 states have call successors, (48), 25 states have call predecessors, (48), 24 states have return successors, (47), 42 states have call predecessors, (47), 47 states have call successors, (47) [2022-04-08 12:21:18,408 INFO L74 IsIncluded]: Start isIncluded. First operand 183 states. Second operand has 183 states, 110 states have (on average 1.1) internal successors, (121), 115 states have internal predecessors, (121), 48 states have call successors, (48), 25 states have call predecessors, (48), 24 states have return successors, (47), 42 states have call predecessors, (47), 47 states have call successors, (47) [2022-04-08 12:21:18,409 INFO L87 Difference]: Start difference. First operand 183 states. Second operand has 183 states, 110 states have (on average 1.1) internal successors, (121), 115 states have internal predecessors, (121), 48 states have call successors, (48), 25 states have call predecessors, (48), 24 states have return successors, (47), 42 states have call predecessors, (47), 47 states have call successors, (47) [2022-04-08 12:21:18,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:21:18,412 INFO L93 Difference]: Finished difference Result 183 states and 216 transitions. [2022-04-08 12:21:18,412 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 216 transitions. [2022-04-08 12:21:18,412 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:21:18,412 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 12:21:18,412 INFO L74 IsIncluded]: Start isIncluded. First operand has 183 states, 110 states have (on average 1.1) internal successors, (121), 115 states have internal predecessors, (121), 48 states have call successors, (48), 25 states have call predecessors, (48), 24 states have return successors, (47), 42 states have call predecessors, (47), 47 states have call successors, (47) Second operand 183 states. [2022-04-08 12:21:18,412 INFO L87 Difference]: Start difference. First operand has 183 states, 110 states have (on average 1.1) internal successors, (121), 115 states have internal predecessors, (121), 48 states have call successors, (48), 25 states have call predecessors, (48), 24 states have return successors, (47), 42 states have call predecessors, (47), 47 states have call successors, (47) Second operand 183 states. [2022-04-08 12:21:18,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:21:18,415 INFO L93 Difference]: Finished difference Result 183 states and 216 transitions. [2022-04-08 12:21:18,415 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 216 transitions. [2022-04-08 12:21:18,416 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:21:18,416 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 12:21:18,416 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 12:21:18,416 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 12:21:18,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 110 states have (on average 1.1) internal successors, (121), 115 states have internal predecessors, (121), 48 states have call successors, (48), 25 states have call predecessors, (48), 24 states have return successors, (47), 42 states have call predecessors, (47), 47 states have call successors, (47) [2022-04-08 12:21:18,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 216 transitions. [2022-04-08 12:21:18,419 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 216 transitions. Word has length 92 [2022-04-08 12:21:18,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 12:21:18,419 INFO L478 AbstractCegarLoop]: Abstraction has 183 states and 216 transitions. [2022-04-08 12:21:18,419 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 1.875) internal successors, (30), 14 states have internal predecessors, (30), 8 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (15), 8 states have call predecessors, (15), 8 states have call successors, (15) [2022-04-08 12:21:18,420 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 183 states and 216 transitions. [2022-04-08 12:21:18,983 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 216 edges. 216 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 12:21:18,983 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 216 transitions. [2022-04-08 12:21:18,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2022-04-08 12:21:18,984 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 12:21:18,984 INFO L499 BasicCegarLoop]: trace histogram [11, 10, 10, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 12:21:19,000 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 12:21:19,184 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 12:21:19,184 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 12:21:19,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 12:21:19,185 INFO L85 PathProgramCache]: Analyzing trace with hash 65583604, now seen corresponding path program 9 times [2022-04-08 12:21:19,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 12:21:19,185 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [605894869] [2022-04-08 12:21:19,185 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 12:21:19,185 INFO L85 PathProgramCache]: Analyzing trace with hash 65583604, now seen corresponding path program 10 times [2022-04-08 12:21:19,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 12:21:19,185 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779099168] [2022-04-08 12:21:19,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 12:21:19,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 12:21:19,195 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 12:21:19,195 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1614286790] [2022-04-08 12:21:19,195 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 12:21:19,195 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 12:21:19,195 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 12:21:19,196 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 12:21:19,197 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 12:21:19,243 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 12:21:19,243 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 12:21:19,244 INFO L263 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 40 conjunts are in the unsatisfiable core [2022-04-08 12:21:19,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 12:21:19,259 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 12:21:24,810 INFO L272 TraceCheckUtils]: 0: Hoare triple {14629#true} call ULTIMATE.init(); {14629#true} is VALID [2022-04-08 12:21:24,810 INFO L290 TraceCheckUtils]: 1: Hoare triple {14629#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(10, 2);call #Ultimate.allocInit(12, 3); {14629#true} is VALID [2022-04-08 12:21:24,810 INFO L290 TraceCheckUtils]: 2: Hoare triple {14629#true} assume true; {14629#true} is VALID [2022-04-08 12:21:24,810 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14629#true} {14629#true} #88#return; {14629#true} is VALID [2022-04-08 12:21:24,810 INFO L272 TraceCheckUtils]: 4: Hoare triple {14629#true} call #t~ret6 := main(); {14629#true} is VALID [2022-04-08 12:21:24,810 INFO L290 TraceCheckUtils]: 5: Hoare triple {14629#true} havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~x~0;havoc ~y~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {14629#true} is VALID [2022-04-08 12:21:24,810 INFO L272 TraceCheckUtils]: 6: Hoare triple {14629#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 5 then 1 else 0)); {14629#true} is VALID [2022-04-08 12:21:24,810 INFO L290 TraceCheckUtils]: 7: Hoare triple {14629#true} ~cond := #in~cond; {14629#true} is VALID [2022-04-08 12:21:24,810 INFO L290 TraceCheckUtils]: 8: Hoare triple {14629#true} assume !(0 == ~cond); {14629#true} is VALID [2022-04-08 12:21:24,810 INFO L290 TraceCheckUtils]: 9: Hoare triple {14629#true} assume true; {14629#true} is VALID [2022-04-08 12:21:24,810 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {14629#true} {14629#true} #66#return; {14629#true} is VALID [2022-04-08 12:21:24,810 INFO L290 TraceCheckUtils]: 11: Hoare triple {14629#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {14629#true} is VALID [2022-04-08 12:21:24,811 INFO L272 TraceCheckUtils]: 12: Hoare triple {14629#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 5 then 1 else 0)); {14629#true} is VALID [2022-04-08 12:21:24,811 INFO L290 TraceCheckUtils]: 13: Hoare triple {14629#true} ~cond := #in~cond; {14629#true} is VALID [2022-04-08 12:21:24,811 INFO L290 TraceCheckUtils]: 14: Hoare triple {14629#true} assume !(0 == ~cond); {14629#true} is VALID [2022-04-08 12:21:24,811 INFO L290 TraceCheckUtils]: 15: Hoare triple {14629#true} assume true; {14629#true} is VALID [2022-04-08 12:21:24,811 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {14629#true} {14629#true} #68#return; {14629#true} is VALID [2022-04-08 12:21:24,811 INFO L272 TraceCheckUtils]: 17: Hoare triple {14629#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {14629#true} is VALID [2022-04-08 12:21:24,811 INFO L290 TraceCheckUtils]: 18: Hoare triple {14629#true} ~cond := #in~cond; {14629#true} is VALID [2022-04-08 12:21:24,811 INFO L290 TraceCheckUtils]: 19: Hoare triple {14629#true} assume !(0 == ~cond); {14629#true} is VALID [2022-04-08 12:21:24,811 INFO L290 TraceCheckUtils]: 20: Hoare triple {14629#true} assume true; {14629#true} is VALID [2022-04-08 12:21:24,811 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {14629#true} {14629#true} #70#return; {14629#true} is VALID [2022-04-08 12:21:24,811 INFO L272 TraceCheckUtils]: 22: Hoare triple {14629#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {14629#true} is VALID [2022-04-08 12:21:24,811 INFO L290 TraceCheckUtils]: 23: Hoare triple {14629#true} ~cond := #in~cond; {14629#true} is VALID [2022-04-08 12:21:24,811 INFO L290 TraceCheckUtils]: 24: Hoare triple {14629#true} assume !(0 == ~cond); {14629#true} is VALID [2022-04-08 12:21:24,811 INFO L290 TraceCheckUtils]: 25: Hoare triple {14629#true} assume true; {14629#true} is VALID [2022-04-08 12:21:24,811 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {14629#true} {14629#true} #72#return; {14629#true} is VALID [2022-04-08 12:21:24,812 INFO L290 TraceCheckUtils]: 27: Hoare triple {14629#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {14715#(and (<= 1 main_~s~0) (= main_~r~0 0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-08 12:21:24,812 INFO L290 TraceCheckUtils]: 28: Hoare triple {14715#(and (<= 1 main_~s~0) (= main_~r~0 0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !false; {14715#(and (<= 1 main_~s~0) (= main_~r~0 0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-08 12:21:24,812 INFO L272 TraceCheckUtils]: 29: Hoare triple {14715#(and (<= 1 main_~s~0) (= main_~r~0 0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {14629#true} is VALID [2022-04-08 12:21:24,812 INFO L290 TraceCheckUtils]: 30: Hoare triple {14629#true} ~cond := #in~cond; {14629#true} is VALID [2022-04-08 12:21:24,812 INFO L290 TraceCheckUtils]: 31: Hoare triple {14629#true} assume !(0 == ~cond); {14629#true} is VALID [2022-04-08 12:21:24,812 INFO L290 TraceCheckUtils]: 32: Hoare triple {14629#true} assume true; {14629#true} is VALID [2022-04-08 12:21:24,813 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {14629#true} {14715#(and (<= 1 main_~s~0) (= main_~r~0 0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #74#return; {14715#(and (<= 1 main_~s~0) (= main_~r~0 0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-08 12:21:24,813 INFO L272 TraceCheckUtils]: 34: Hoare triple {14715#(and (<= 1 main_~s~0) (= main_~r~0 0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {14629#true} is VALID [2022-04-08 12:21:24,813 INFO L290 TraceCheckUtils]: 35: Hoare triple {14629#true} ~cond := #in~cond; {14629#true} is VALID [2022-04-08 12:21:24,813 INFO L290 TraceCheckUtils]: 36: Hoare triple {14629#true} assume !(0 == ~cond); {14629#true} is VALID [2022-04-08 12:21:24,813 INFO L290 TraceCheckUtils]: 37: Hoare triple {14629#true} assume true; {14629#true} is VALID [2022-04-08 12:21:24,814 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {14629#true} {14715#(and (<= 1 main_~s~0) (= main_~r~0 0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #76#return; {14715#(and (<= 1 main_~s~0) (= main_~r~0 0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-08 12:21:24,814 INFO L272 TraceCheckUtils]: 39: Hoare triple {14715#(and (<= 1 main_~s~0) (= main_~r~0 0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {14629#true} is VALID [2022-04-08 12:21:24,814 INFO L290 TraceCheckUtils]: 40: Hoare triple {14629#true} ~cond := #in~cond; {14629#true} is VALID [2022-04-08 12:21:24,814 INFO L290 TraceCheckUtils]: 41: Hoare triple {14629#true} assume !(0 == ~cond); {14629#true} is VALID [2022-04-08 12:21:24,814 INFO L290 TraceCheckUtils]: 42: Hoare triple {14629#true} assume true; {14629#true} is VALID [2022-04-08 12:21:24,815 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {14629#true} {14715#(and (<= 1 main_~s~0) (= main_~r~0 0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #78#return; {14715#(and (<= 1 main_~s~0) (= main_~r~0 0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-08 12:21:24,815 INFO L290 TraceCheckUtils]: 44: Hoare triple {14715#(and (<= 1 main_~s~0) (= main_~r~0 0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !!(~a~0 != ~b~0); {14767#(and (<= 1 main_~s~0) (= main_~r~0 0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (not (= main_~b~0 main_~a~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-08 12:21:24,816 INFO L290 TraceCheckUtils]: 45: Hoare triple {14767#(and (<= 1 main_~s~0) (= main_~r~0 0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (not (= main_~b~0 main_~a~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !(~a~0 > ~b~0);~b~0 := ~b~0 - ~a~0;~q~0 := ~q~0 - ~p~0;~s~0 := ~s~0 - ~r~0; {14771#(and (= main_~r~0 0) (not (= main_~a~0 main_~y~0)) (<= 1 (+ main_~s~0 main_~r~0)) (not (< main_~y~0 main_~a~0)) (= (+ (* (- 1) main_~a~0) main_~y~0) main_~b~0) (= main_~a~0 main_~x~0) (= (+ main_~q~0 main_~p~0) 0) (= main_~p~0 1))} is VALID [2022-04-08 12:21:24,816 INFO L290 TraceCheckUtils]: 46: Hoare triple {14771#(and (= main_~r~0 0) (not (= main_~a~0 main_~y~0)) (<= 1 (+ main_~s~0 main_~r~0)) (not (< main_~y~0 main_~a~0)) (= (+ (* (- 1) main_~a~0) main_~y~0) main_~b~0) (= main_~a~0 main_~x~0) (= (+ main_~q~0 main_~p~0) 0) (= main_~p~0 1))} assume !false; {14771#(and (= main_~r~0 0) (not (= main_~a~0 main_~y~0)) (<= 1 (+ main_~s~0 main_~r~0)) (not (< main_~y~0 main_~a~0)) (= (+ (* (- 1) main_~a~0) main_~y~0) main_~b~0) (= main_~a~0 main_~x~0) (= (+ main_~q~0 main_~p~0) 0) (= main_~p~0 1))} is VALID [2022-04-08 12:21:24,816 INFO L272 TraceCheckUtils]: 47: Hoare triple {14771#(and (= main_~r~0 0) (not (= main_~a~0 main_~y~0)) (<= 1 (+ main_~s~0 main_~r~0)) (not (< main_~y~0 main_~a~0)) (= (+ (* (- 1) main_~a~0) main_~y~0) main_~b~0) (= main_~a~0 main_~x~0) (= (+ main_~q~0 main_~p~0) 0) (= main_~p~0 1))} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {14629#true} is VALID [2022-04-08 12:21:24,816 INFO L290 TraceCheckUtils]: 48: Hoare triple {14629#true} ~cond := #in~cond; {14629#true} is VALID [2022-04-08 12:21:24,817 INFO L290 TraceCheckUtils]: 49: Hoare triple {14629#true} assume !(0 == ~cond); {14629#true} is VALID [2022-04-08 12:21:24,817 INFO L290 TraceCheckUtils]: 50: Hoare triple {14629#true} assume true; {14629#true} is VALID [2022-04-08 12:21:24,817 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {14629#true} {14771#(and (= main_~r~0 0) (not (= main_~a~0 main_~y~0)) (<= 1 (+ main_~s~0 main_~r~0)) (not (< main_~y~0 main_~a~0)) (= (+ (* (- 1) main_~a~0) main_~y~0) main_~b~0) (= main_~a~0 main_~x~0) (= (+ main_~q~0 main_~p~0) 0) (= main_~p~0 1))} #74#return; {14771#(and (= main_~r~0 0) (not (= main_~a~0 main_~y~0)) (<= 1 (+ main_~s~0 main_~r~0)) (not (< main_~y~0 main_~a~0)) (= (+ (* (- 1) main_~a~0) main_~y~0) main_~b~0) (= main_~a~0 main_~x~0) (= (+ main_~q~0 main_~p~0) 0) (= main_~p~0 1))} is VALID [2022-04-08 12:21:24,817 INFO L272 TraceCheckUtils]: 52: Hoare triple {14771#(and (= main_~r~0 0) (not (= main_~a~0 main_~y~0)) (<= 1 (+ main_~s~0 main_~r~0)) (not (< main_~y~0 main_~a~0)) (= (+ (* (- 1) main_~a~0) main_~y~0) main_~b~0) (= main_~a~0 main_~x~0) (= (+ main_~q~0 main_~p~0) 0) (= main_~p~0 1))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {14629#true} is VALID [2022-04-08 12:21:24,817 INFO L290 TraceCheckUtils]: 53: Hoare triple {14629#true} ~cond := #in~cond; {14629#true} is VALID [2022-04-08 12:21:24,817 INFO L290 TraceCheckUtils]: 54: Hoare triple {14629#true} assume !(0 == ~cond); {14629#true} is VALID [2022-04-08 12:21:24,817 INFO L290 TraceCheckUtils]: 55: Hoare triple {14629#true} assume true; {14629#true} is VALID [2022-04-08 12:21:24,818 INFO L284 TraceCheckUtils]: 56: Hoare quadruple {14629#true} {14771#(and (= main_~r~0 0) (not (= main_~a~0 main_~y~0)) (<= 1 (+ main_~s~0 main_~r~0)) (not (< main_~y~0 main_~a~0)) (= (+ (* (- 1) main_~a~0) main_~y~0) main_~b~0) (= main_~a~0 main_~x~0) (= (+ main_~q~0 main_~p~0) 0) (= main_~p~0 1))} #76#return; {14771#(and (= main_~r~0 0) (not (= main_~a~0 main_~y~0)) (<= 1 (+ main_~s~0 main_~r~0)) (not (< main_~y~0 main_~a~0)) (= (+ (* (- 1) main_~a~0) main_~y~0) main_~b~0) (= main_~a~0 main_~x~0) (= (+ main_~q~0 main_~p~0) 0) (= main_~p~0 1))} is VALID [2022-04-08 12:21:24,818 INFO L272 TraceCheckUtils]: 57: Hoare triple {14771#(and (= main_~r~0 0) (not (= main_~a~0 main_~y~0)) (<= 1 (+ main_~s~0 main_~r~0)) (not (< main_~y~0 main_~a~0)) (= (+ (* (- 1) main_~a~0) main_~y~0) main_~b~0) (= main_~a~0 main_~x~0) (= (+ main_~q~0 main_~p~0) 0) (= main_~p~0 1))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {14629#true} is VALID [2022-04-08 12:21:24,818 INFO L290 TraceCheckUtils]: 58: Hoare triple {14629#true} ~cond := #in~cond; {14629#true} is VALID [2022-04-08 12:21:24,818 INFO L290 TraceCheckUtils]: 59: Hoare triple {14629#true} assume !(0 == ~cond); {14629#true} is VALID [2022-04-08 12:21:24,818 INFO L290 TraceCheckUtils]: 60: Hoare triple {14629#true} assume true; {14629#true} is VALID [2022-04-08 12:21:24,819 INFO L284 TraceCheckUtils]: 61: Hoare quadruple {14629#true} {14771#(and (= main_~r~0 0) (not (= main_~a~0 main_~y~0)) (<= 1 (+ main_~s~0 main_~r~0)) (not (< main_~y~0 main_~a~0)) (= (+ (* (- 1) main_~a~0) main_~y~0) main_~b~0) (= main_~a~0 main_~x~0) (= (+ main_~q~0 main_~p~0) 0) (= main_~p~0 1))} #78#return; {14771#(and (= main_~r~0 0) (not (= main_~a~0 main_~y~0)) (<= 1 (+ main_~s~0 main_~r~0)) (not (< main_~y~0 main_~a~0)) (= (+ (* (- 1) main_~a~0) main_~y~0) main_~b~0) (= main_~a~0 main_~x~0) (= (+ main_~q~0 main_~p~0) 0) (= main_~p~0 1))} is VALID [2022-04-08 12:21:24,819 INFO L290 TraceCheckUtils]: 62: Hoare triple {14771#(and (= main_~r~0 0) (not (= main_~a~0 main_~y~0)) (<= 1 (+ main_~s~0 main_~r~0)) (not (< main_~y~0 main_~a~0)) (= (+ (* (- 1) main_~a~0) main_~y~0) main_~b~0) (= main_~a~0 main_~x~0) (= (+ main_~q~0 main_~p~0) 0) (= main_~p~0 1))} assume !!(~a~0 != ~b~0); {14771#(and (= main_~r~0 0) (not (= main_~a~0 main_~y~0)) (<= 1 (+ main_~s~0 main_~r~0)) (not (< main_~y~0 main_~a~0)) (= (+ (* (- 1) main_~a~0) main_~y~0) main_~b~0) (= main_~a~0 main_~x~0) (= (+ main_~q~0 main_~p~0) 0) (= main_~p~0 1))} is VALID [2022-04-08 12:21:24,820 INFO L290 TraceCheckUtils]: 63: Hoare triple {14771#(and (= main_~r~0 0) (not (= main_~a~0 main_~y~0)) (<= 1 (+ main_~s~0 main_~r~0)) (not (< main_~y~0 main_~a~0)) (= (+ (* (- 1) main_~a~0) main_~y~0) main_~b~0) (= main_~a~0 main_~x~0) (= (+ main_~q~0 main_~p~0) 0) (= main_~p~0 1))} assume ~a~0 > ~b~0;~a~0 := ~a~0 - ~b~0;~p~0 := ~p~0 - ~q~0;~r~0 := ~r~0 - ~s~0; {14826#(and (not (= main_~y~0 (+ main_~b~0 main_~a~0))) (= (+ main_~s~0 main_~r~0) 0) (= main_~p~0 (* (- 2) main_~q~0)) (not (< main_~y~0 (+ main_~b~0 main_~a~0))) (= (+ (* (- 1) main_~a~0) main_~y~0 (* (- 1) main_~b~0)) main_~b~0) (<= 1 (+ main_~r~0 (* main_~s~0 2))) (= (* (- 1) main_~q~0) 1) (= main_~x~0 (+ main_~b~0 main_~a~0)))} is VALID [2022-04-08 12:21:24,821 INFO L290 TraceCheckUtils]: 64: Hoare triple {14826#(and (not (= main_~y~0 (+ main_~b~0 main_~a~0))) (= (+ main_~s~0 main_~r~0) 0) (= main_~p~0 (* (- 2) main_~q~0)) (not (< main_~y~0 (+ main_~b~0 main_~a~0))) (= (+ (* (- 1) main_~a~0) main_~y~0 (* (- 1) main_~b~0)) main_~b~0) (<= 1 (+ main_~r~0 (* main_~s~0 2))) (= (* (- 1) main_~q~0) 1) (= main_~x~0 (+ main_~b~0 main_~a~0)))} assume !false; {14826#(and (not (= main_~y~0 (+ main_~b~0 main_~a~0))) (= (+ main_~s~0 main_~r~0) 0) (= main_~p~0 (* (- 2) main_~q~0)) (not (< main_~y~0 (+ main_~b~0 main_~a~0))) (= (+ (* (- 1) main_~a~0) main_~y~0 (* (- 1) main_~b~0)) main_~b~0) (<= 1 (+ main_~r~0 (* main_~s~0 2))) (= (* (- 1) main_~q~0) 1) (= main_~x~0 (+ main_~b~0 main_~a~0)))} is VALID [2022-04-08 12:21:24,821 INFO L272 TraceCheckUtils]: 65: Hoare triple {14826#(and (not (= main_~y~0 (+ main_~b~0 main_~a~0))) (= (+ main_~s~0 main_~r~0) 0) (= main_~p~0 (* (- 2) main_~q~0)) (not (< main_~y~0 (+ main_~b~0 main_~a~0))) (= (+ (* (- 1) main_~a~0) main_~y~0 (* (- 1) main_~b~0)) main_~b~0) (<= 1 (+ main_~r~0 (* main_~s~0 2))) (= (* (- 1) main_~q~0) 1) (= main_~x~0 (+ main_~b~0 main_~a~0)))} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {14629#true} is VALID [2022-04-08 12:21:24,821 INFO L290 TraceCheckUtils]: 66: Hoare triple {14629#true} ~cond := #in~cond; {14629#true} is VALID [2022-04-08 12:21:24,821 INFO L290 TraceCheckUtils]: 67: Hoare triple {14629#true} assume !(0 == ~cond); {14629#true} is VALID [2022-04-08 12:21:24,821 INFO L290 TraceCheckUtils]: 68: Hoare triple {14629#true} assume true; {14629#true} is VALID [2022-04-08 12:21:24,822 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {14629#true} {14826#(and (not (= main_~y~0 (+ main_~b~0 main_~a~0))) (= (+ main_~s~0 main_~r~0) 0) (= main_~p~0 (* (- 2) main_~q~0)) (not (< main_~y~0 (+ main_~b~0 main_~a~0))) (= (+ (* (- 1) main_~a~0) main_~y~0 (* (- 1) main_~b~0)) main_~b~0) (<= 1 (+ main_~r~0 (* main_~s~0 2))) (= (* (- 1) main_~q~0) 1) (= main_~x~0 (+ main_~b~0 main_~a~0)))} #74#return; {14826#(and (not (= main_~y~0 (+ main_~b~0 main_~a~0))) (= (+ main_~s~0 main_~r~0) 0) (= main_~p~0 (* (- 2) main_~q~0)) (not (< main_~y~0 (+ main_~b~0 main_~a~0))) (= (+ (* (- 1) main_~a~0) main_~y~0 (* (- 1) main_~b~0)) main_~b~0) (<= 1 (+ main_~r~0 (* main_~s~0 2))) (= (* (- 1) main_~q~0) 1) (= main_~x~0 (+ main_~b~0 main_~a~0)))} is VALID [2022-04-08 12:21:24,822 INFO L272 TraceCheckUtils]: 70: Hoare triple {14826#(and (not (= main_~y~0 (+ main_~b~0 main_~a~0))) (= (+ main_~s~0 main_~r~0) 0) (= main_~p~0 (* (- 2) main_~q~0)) (not (< main_~y~0 (+ main_~b~0 main_~a~0))) (= (+ (* (- 1) main_~a~0) main_~y~0 (* (- 1) main_~b~0)) main_~b~0) (<= 1 (+ main_~r~0 (* main_~s~0 2))) (= (* (- 1) main_~q~0) 1) (= main_~x~0 (+ main_~b~0 main_~a~0)))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {14629#true} is VALID [2022-04-08 12:21:24,822 INFO L290 TraceCheckUtils]: 71: Hoare triple {14629#true} ~cond := #in~cond; {14851#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 12:21:24,822 INFO L290 TraceCheckUtils]: 72: Hoare triple {14851#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {14855#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 12:21:24,823 INFO L290 TraceCheckUtils]: 73: Hoare triple {14855#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {14855#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 12:21:24,824 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {14855#(not (= |__VERIFIER_assert_#in~cond| 0))} {14826#(and (not (= main_~y~0 (+ main_~b~0 main_~a~0))) (= (+ main_~s~0 main_~r~0) 0) (= main_~p~0 (* (- 2) main_~q~0)) (not (< main_~y~0 (+ main_~b~0 main_~a~0))) (= (+ (* (- 1) main_~a~0) main_~y~0 (* (- 1) main_~b~0)) main_~b~0) (<= 1 (+ main_~r~0 (* main_~s~0 2))) (= (* (- 1) main_~q~0) 1) (= main_~x~0 (+ main_~b~0 main_~a~0)))} #76#return; {14862#(and (not (= main_~y~0 (+ main_~b~0 main_~a~0))) (= (+ main_~s~0 main_~r~0) 0) (= main_~p~0 (* (- 2) main_~q~0)) (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (< main_~y~0 (+ main_~b~0 main_~a~0))) (= (+ (* (- 1) main_~a~0) main_~y~0 (* (- 1) main_~b~0)) main_~b~0) (<= 1 (+ main_~r~0 (* main_~s~0 2))) (= (* (- 1) main_~q~0) 1) (= main_~x~0 (+ main_~b~0 main_~a~0)))} is VALID [2022-04-08 12:21:24,824 INFO L272 TraceCheckUtils]: 75: Hoare triple {14862#(and (not (= main_~y~0 (+ main_~b~0 main_~a~0))) (= (+ main_~s~0 main_~r~0) 0) (= main_~p~0 (* (- 2) main_~q~0)) (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (< main_~y~0 (+ main_~b~0 main_~a~0))) (= (+ (* (- 1) main_~a~0) main_~y~0 (* (- 1) main_~b~0)) main_~b~0) (<= 1 (+ main_~r~0 (* main_~s~0 2))) (= (* (- 1) main_~q~0) 1) (= main_~x~0 (+ main_~b~0 main_~a~0)))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {14629#true} is VALID [2022-04-08 12:21:24,824 INFO L290 TraceCheckUtils]: 76: Hoare triple {14629#true} ~cond := #in~cond; {14629#true} is VALID [2022-04-08 12:21:24,824 INFO L290 TraceCheckUtils]: 77: Hoare triple {14629#true} assume !(0 == ~cond); {14629#true} is VALID [2022-04-08 12:21:24,824 INFO L290 TraceCheckUtils]: 78: Hoare triple {14629#true} assume true; {14629#true} is VALID [2022-04-08 12:21:24,824 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {14629#true} {14862#(and (not (= main_~y~0 (+ main_~b~0 main_~a~0))) (= (+ main_~s~0 main_~r~0) 0) (= main_~p~0 (* (- 2) main_~q~0)) (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (< main_~y~0 (+ main_~b~0 main_~a~0))) (= (+ (* (- 1) main_~a~0) main_~y~0 (* (- 1) main_~b~0)) main_~b~0) (<= 1 (+ main_~r~0 (* main_~s~0 2))) (= (* (- 1) main_~q~0) 1) (= main_~x~0 (+ main_~b~0 main_~a~0)))} #78#return; {14862#(and (not (= main_~y~0 (+ main_~b~0 main_~a~0))) (= (+ main_~s~0 main_~r~0) 0) (= main_~p~0 (* (- 2) main_~q~0)) (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (< main_~y~0 (+ main_~b~0 main_~a~0))) (= (+ (* (- 1) main_~a~0) main_~y~0 (* (- 1) main_~b~0)) main_~b~0) (<= 1 (+ main_~r~0 (* main_~s~0 2))) (= (* (- 1) main_~q~0) 1) (= main_~x~0 (+ main_~b~0 main_~a~0)))} is VALID [2022-04-08 12:21:24,825 INFO L290 TraceCheckUtils]: 80: Hoare triple {14862#(and (not (= main_~y~0 (+ main_~b~0 main_~a~0))) (= (+ main_~s~0 main_~r~0) 0) (= main_~p~0 (* (- 2) main_~q~0)) (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (< main_~y~0 (+ main_~b~0 main_~a~0))) (= (+ (* (- 1) main_~a~0) main_~y~0 (* (- 1) main_~b~0)) main_~b~0) (<= 1 (+ main_~r~0 (* main_~s~0 2))) (= (* (- 1) main_~q~0) 1) (= main_~x~0 (+ main_~b~0 main_~a~0)))} assume !!(~a~0 != ~b~0); {14862#(and (not (= main_~y~0 (+ main_~b~0 main_~a~0))) (= (+ main_~s~0 main_~r~0) 0) (= main_~p~0 (* (- 2) main_~q~0)) (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (< main_~y~0 (+ main_~b~0 main_~a~0))) (= (+ (* (- 1) main_~a~0) main_~y~0 (* (- 1) main_~b~0)) main_~b~0) (<= 1 (+ main_~r~0 (* main_~s~0 2))) (= (* (- 1) main_~q~0) 1) (= main_~x~0 (+ main_~b~0 main_~a~0)))} is VALID [2022-04-08 12:21:24,828 INFO L290 TraceCheckUtils]: 81: Hoare triple {14862#(and (not (= main_~y~0 (+ main_~b~0 main_~a~0))) (= (+ main_~s~0 main_~r~0) 0) (= main_~p~0 (* (- 2) main_~q~0)) (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (< main_~y~0 (+ main_~b~0 main_~a~0))) (= (+ (* (- 1) main_~a~0) main_~y~0 (* (- 1) main_~b~0)) main_~b~0) (<= 1 (+ main_~r~0 (* main_~s~0 2))) (= (* (- 1) main_~q~0) 1) (= main_~x~0 (+ main_~b~0 main_~a~0)))} assume ~a~0 > ~b~0;~a~0 := ~a~0 - ~b~0;~p~0 := ~p~0 - ~q~0;~r~0 := ~r~0 - ~s~0; {14884#(and (= main_~p~0 3) (<= main_~x~0 main_~y~0) (= (mod main_~r~0 2) 0) (< (* main_~y~0 2) (* main_~x~0 3)) (= (* main_~x~0 3) (+ main_~a~0 (* main_~y~0 2))) (= (+ main_~y~0 (* main_~p~0 main_~x~0)) (+ (* main_~x~0 3) (* main_~y~0 (div main_~r~0 (- 2))))) (not (= main_~y~0 main_~x~0)))} is VALID [2022-04-08 12:21:24,828 INFO L290 TraceCheckUtils]: 82: Hoare triple {14884#(and (= main_~p~0 3) (<= main_~x~0 main_~y~0) (= (mod main_~r~0 2) 0) (< (* main_~y~0 2) (* main_~x~0 3)) (= (* main_~x~0 3) (+ main_~a~0 (* main_~y~0 2))) (= (+ main_~y~0 (* main_~p~0 main_~x~0)) (+ (* main_~x~0 3) (* main_~y~0 (div main_~r~0 (- 2))))) (not (= main_~y~0 main_~x~0)))} assume !false; {14884#(and (= main_~p~0 3) (<= main_~x~0 main_~y~0) (= (mod main_~r~0 2) 0) (< (* main_~y~0 2) (* main_~x~0 3)) (= (* main_~x~0 3) (+ main_~a~0 (* main_~y~0 2))) (= (+ main_~y~0 (* main_~p~0 main_~x~0)) (+ (* main_~x~0 3) (* main_~y~0 (div main_~r~0 (- 2))))) (not (= main_~y~0 main_~x~0)))} is VALID [2022-04-08 12:21:24,828 INFO L272 TraceCheckUtils]: 83: Hoare triple {14884#(and (= main_~p~0 3) (<= main_~x~0 main_~y~0) (= (mod main_~r~0 2) 0) (< (* main_~y~0 2) (* main_~x~0 3)) (= (* main_~x~0 3) (+ main_~a~0 (* main_~y~0 2))) (= (+ main_~y~0 (* main_~p~0 main_~x~0)) (+ (* main_~x~0 3) (* main_~y~0 (div main_~r~0 (- 2))))) (not (= main_~y~0 main_~x~0)))} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {14629#true} is VALID [2022-04-08 12:21:24,828 INFO L290 TraceCheckUtils]: 84: Hoare triple {14629#true} ~cond := #in~cond; {14629#true} is VALID [2022-04-08 12:21:24,828 INFO L290 TraceCheckUtils]: 85: Hoare triple {14629#true} assume !(0 == ~cond); {14629#true} is VALID [2022-04-08 12:21:24,828 INFO L290 TraceCheckUtils]: 86: Hoare triple {14629#true} assume true; {14629#true} is VALID [2022-04-08 12:21:24,829 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {14629#true} {14884#(and (= main_~p~0 3) (<= main_~x~0 main_~y~0) (= (mod main_~r~0 2) 0) (< (* main_~y~0 2) (* main_~x~0 3)) (= (* main_~x~0 3) (+ main_~a~0 (* main_~y~0 2))) (= (+ main_~y~0 (* main_~p~0 main_~x~0)) (+ (* main_~x~0 3) (* main_~y~0 (div main_~r~0 (- 2))))) (not (= main_~y~0 main_~x~0)))} #74#return; {14884#(and (= main_~p~0 3) (<= main_~x~0 main_~y~0) (= (mod main_~r~0 2) 0) (< (* main_~y~0 2) (* main_~x~0 3)) (= (* main_~x~0 3) (+ main_~a~0 (* main_~y~0 2))) (= (+ main_~y~0 (* main_~p~0 main_~x~0)) (+ (* main_~x~0 3) (* main_~y~0 (div main_~r~0 (- 2))))) (not (= main_~y~0 main_~x~0)))} is VALID [2022-04-08 12:21:24,831 INFO L272 TraceCheckUtils]: 88: Hoare triple {14884#(and (= main_~p~0 3) (<= main_~x~0 main_~y~0) (= (mod main_~r~0 2) 0) (< (* main_~y~0 2) (* main_~x~0 3)) (= (* main_~x~0 3) (+ main_~a~0 (* main_~y~0 2))) (= (+ main_~y~0 (* main_~p~0 main_~x~0)) (+ (* main_~x~0 3) (* main_~y~0 (div main_~r~0 (- 2))))) (not (= main_~y~0 main_~x~0)))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {14906#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 12:21:24,831 INFO L290 TraceCheckUtils]: 89: Hoare triple {14906#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {14910#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 12:21:24,832 INFO L290 TraceCheckUtils]: 90: Hoare triple {14910#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {14630#false} is VALID [2022-04-08 12:21:24,832 INFO L290 TraceCheckUtils]: 91: Hoare triple {14630#false} assume !false; {14630#false} is VALID [2022-04-08 12:21:24,832 INFO L134 CoverageAnalysis]: Checked inductivity of 251 backedges. 40 proven. 34 refuted. 0 times theorem prover too weak. 177 trivial. 0 not checked. [2022-04-08 12:21:24,832 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 12:21:42,394 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-08 12:21:42,535 INFO L290 TraceCheckUtils]: 91: Hoare triple {14630#false} assume !false; {14630#false} is VALID [2022-04-08 12:21:42,536 INFO L290 TraceCheckUtils]: 90: Hoare triple {14910#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {14630#false} is VALID [2022-04-08 12:21:42,536 INFO L290 TraceCheckUtils]: 89: Hoare triple {14906#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {14910#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 12:21:42,536 INFO L272 TraceCheckUtils]: 88: Hoare triple {14926#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {14906#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 12:21:42,537 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {14629#true} {14926#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} #74#return; {14926#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-08 12:21:42,537 INFO L290 TraceCheckUtils]: 86: Hoare triple {14629#true} assume true; {14629#true} is VALID [2022-04-08 12:21:42,537 INFO L290 TraceCheckUtils]: 85: Hoare triple {14629#true} assume !(0 == ~cond); {14629#true} is VALID [2022-04-08 12:21:42,537 INFO L290 TraceCheckUtils]: 84: Hoare triple {14629#true} ~cond := #in~cond; {14629#true} is VALID [2022-04-08 12:21:42,537 INFO L272 TraceCheckUtils]: 83: Hoare triple {14926#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {14629#true} is VALID [2022-04-08 12:21:42,537 INFO L290 TraceCheckUtils]: 82: Hoare triple {14926#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} assume !false; {14926#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-08 12:21:42,870 INFO L290 TraceCheckUtils]: 81: Hoare triple {14948#(or (= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0))))) (not (< main_~b~0 main_~a~0)))} assume ~a~0 > ~b~0;~a~0 := ~a~0 - ~b~0;~p~0 := ~p~0 - ~q~0;~r~0 := ~r~0 - ~s~0; {14926#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-08 12:21:42,871 INFO L290 TraceCheckUtils]: 80: Hoare triple {14948#(or (= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0))))) (not (< main_~b~0 main_~a~0)))} assume !!(~a~0 != ~b~0); {14948#(or (= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0))))) (not (< main_~b~0 main_~a~0)))} is VALID [2022-04-08 12:21:42,871 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {14629#true} {14948#(or (= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0))))) (not (< main_~b~0 main_~a~0)))} #78#return; {14948#(or (= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0))))) (not (< main_~b~0 main_~a~0)))} is VALID [2022-04-08 12:21:42,871 INFO L290 TraceCheckUtils]: 78: Hoare triple {14629#true} assume true; {14629#true} is VALID [2022-04-08 12:21:42,872 INFO L290 TraceCheckUtils]: 77: Hoare triple {14629#true} assume !(0 == ~cond); {14629#true} is VALID [2022-04-08 12:21:42,872 INFO L290 TraceCheckUtils]: 76: Hoare triple {14629#true} ~cond := #in~cond; {14629#true} is VALID [2022-04-08 12:21:42,872 INFO L272 TraceCheckUtils]: 75: Hoare triple {14948#(or (= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0))))) (not (< main_~b~0 main_~a~0)))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {14629#true} is VALID [2022-04-08 12:21:42,872 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {14855#(not (= |__VERIFIER_assert_#in~cond| 0))} {14970#(or (= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0))))) (not (< main_~b~0 main_~a~0)) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))))} #76#return; {14948#(or (= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0))))) (not (< main_~b~0 main_~a~0)))} is VALID [2022-04-08 12:21:42,872 INFO L290 TraceCheckUtils]: 73: Hoare triple {14855#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {14855#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 12:21:42,873 INFO L290 TraceCheckUtils]: 72: Hoare triple {14980#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {14855#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 12:21:42,873 INFO L290 TraceCheckUtils]: 71: Hoare triple {14629#true} ~cond := #in~cond; {14980#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 12:21:42,873 INFO L272 TraceCheckUtils]: 70: Hoare triple {14970#(or (= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0))))) (not (< main_~b~0 main_~a~0)) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {14629#true} is VALID [2022-04-08 12:21:42,873 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {14629#true} {14970#(or (= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0))))) (not (< main_~b~0 main_~a~0)) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))))} #74#return; {14970#(or (= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0))))) (not (< main_~b~0 main_~a~0)) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))))} is VALID [2022-04-08 12:21:42,873 INFO L290 TraceCheckUtils]: 68: Hoare triple {14629#true} assume true; {14629#true} is VALID [2022-04-08 12:21:42,874 INFO L290 TraceCheckUtils]: 67: Hoare triple {14629#true} assume !(0 == ~cond); {14629#true} is VALID [2022-04-08 12:21:42,874 INFO L290 TraceCheckUtils]: 66: Hoare triple {14629#true} ~cond := #in~cond; {14629#true} is VALID [2022-04-08 12:21:42,874 INFO L272 TraceCheckUtils]: 65: Hoare triple {14970#(or (= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0))))) (not (< main_~b~0 main_~a~0)) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))))} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {14629#true} is VALID [2022-04-08 12:21:42,878 INFO L290 TraceCheckUtils]: 64: Hoare triple {14970#(or (= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0))))) (not (< main_~b~0 main_~a~0)) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))))} assume !false; {14970#(or (= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0))))) (not (< main_~b~0 main_~a~0)) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))))} is VALID [2022-04-08 12:21:44,880 WARN L290 TraceCheckUtils]: 63: Hoare triple {15005#(or (= (+ (* main_~x~0 (+ main_~p~0 (* (- 2) main_~q~0))) (* (+ (* (- 2) main_~s~0) main_~r~0) main_~y~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* (- 1) main_~b~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0))))) (not (< (+ (* main_~q~0 main_~x~0) main_~b~0 (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))))))} assume ~a~0 > ~b~0;~a~0 := ~a~0 - ~b~0;~p~0 := ~p~0 - ~q~0;~r~0 := ~r~0 - ~s~0; {14970#(or (= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0))))) (not (< main_~b~0 main_~a~0)) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))))} is UNKNOWN [2022-04-08 12:21:44,881 INFO L290 TraceCheckUtils]: 62: Hoare triple {15005#(or (= (+ (* main_~x~0 (+ main_~p~0 (* (- 2) main_~q~0))) (* (+ (* (- 2) main_~s~0) main_~r~0) main_~y~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* (- 1) main_~b~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0))))) (not (< (+ (* main_~q~0 main_~x~0) main_~b~0 (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))))))} assume !!(~a~0 != ~b~0); {15005#(or (= (+ (* main_~x~0 (+ main_~p~0 (* (- 2) main_~q~0))) (* (+ (* (- 2) main_~s~0) main_~r~0) main_~y~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* (- 1) main_~b~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0))))) (not (< (+ (* main_~q~0 main_~x~0) main_~b~0 (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))))))} is VALID [2022-04-08 12:21:44,881 INFO L284 TraceCheckUtils]: 61: Hoare quadruple {14629#true} {15005#(or (= (+ (* main_~x~0 (+ main_~p~0 (* (- 2) main_~q~0))) (* (+ (* (- 2) main_~s~0) main_~r~0) main_~y~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* (- 1) main_~b~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0))))) (not (< (+ (* main_~q~0 main_~x~0) main_~b~0 (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))))))} #78#return; {15005#(or (= (+ (* main_~x~0 (+ main_~p~0 (* (- 2) main_~q~0))) (* (+ (* (- 2) main_~s~0) main_~r~0) main_~y~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* (- 1) main_~b~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0))))) (not (< (+ (* main_~q~0 main_~x~0) main_~b~0 (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))))))} is VALID [2022-04-08 12:21:44,881 INFO L290 TraceCheckUtils]: 60: Hoare triple {14629#true} assume true; {14629#true} is VALID [2022-04-08 12:21:44,881 INFO L290 TraceCheckUtils]: 59: Hoare triple {14629#true} assume !(0 == ~cond); {14629#true} is VALID [2022-04-08 12:21:44,881 INFO L290 TraceCheckUtils]: 58: Hoare triple {14629#true} ~cond := #in~cond; {14629#true} is VALID [2022-04-08 12:21:44,881 INFO L272 TraceCheckUtils]: 57: Hoare triple {15005#(or (= (+ (* main_~x~0 (+ main_~p~0 (* (- 2) main_~q~0))) (* (+ (* (- 2) main_~s~0) main_~r~0) main_~y~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* (- 1) main_~b~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0))))) (not (< (+ (* main_~q~0 main_~x~0) main_~b~0 (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))))))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {14629#true} is VALID [2022-04-08 12:21:44,882 INFO L284 TraceCheckUtils]: 56: Hoare quadruple {14629#true} {15005#(or (= (+ (* main_~x~0 (+ main_~p~0 (* (- 2) main_~q~0))) (* (+ (* (- 2) main_~s~0) main_~r~0) main_~y~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* (- 1) main_~b~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0))))) (not (< (+ (* main_~q~0 main_~x~0) main_~b~0 (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))))))} #76#return; {15005#(or (= (+ (* main_~x~0 (+ main_~p~0 (* (- 2) main_~q~0))) (* (+ (* (- 2) main_~s~0) main_~r~0) main_~y~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* (- 1) main_~b~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0))))) (not (< (+ (* main_~q~0 main_~x~0) main_~b~0 (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))))))} is VALID [2022-04-08 12:21:44,882 INFO L290 TraceCheckUtils]: 55: Hoare triple {14629#true} assume true; {14629#true} is VALID [2022-04-08 12:21:44,882 INFO L290 TraceCheckUtils]: 54: Hoare triple {14629#true} assume !(0 == ~cond); {14629#true} is VALID [2022-04-08 12:21:44,882 INFO L290 TraceCheckUtils]: 53: Hoare triple {14629#true} ~cond := #in~cond; {14629#true} is VALID [2022-04-08 12:21:44,882 INFO L272 TraceCheckUtils]: 52: Hoare triple {15005#(or (= (+ (* main_~x~0 (+ main_~p~0 (* (- 2) main_~q~0))) (* (+ (* (- 2) main_~s~0) main_~r~0) main_~y~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* (- 1) main_~b~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0))))) (not (< (+ (* main_~q~0 main_~x~0) main_~b~0 (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))))))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {14629#true} is VALID [2022-04-08 12:21:44,883 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {14629#true} {15005#(or (= (+ (* main_~x~0 (+ main_~p~0 (* (- 2) main_~q~0))) (* (+ (* (- 2) main_~s~0) main_~r~0) main_~y~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* (- 1) main_~b~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0))))) (not (< (+ (* main_~q~0 main_~x~0) main_~b~0 (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))))))} #74#return; {15005#(or (= (+ (* main_~x~0 (+ main_~p~0 (* (- 2) main_~q~0))) (* (+ (* (- 2) main_~s~0) main_~r~0) main_~y~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* (- 1) main_~b~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0))))) (not (< (+ (* main_~q~0 main_~x~0) main_~b~0 (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))))))} is VALID [2022-04-08 12:21:44,883 INFO L290 TraceCheckUtils]: 50: Hoare triple {14629#true} assume true; {14629#true} is VALID [2022-04-08 12:21:44,883 INFO L290 TraceCheckUtils]: 49: Hoare triple {14629#true} assume !(0 == ~cond); {14629#true} is VALID [2022-04-08 12:21:44,883 INFO L290 TraceCheckUtils]: 48: Hoare triple {14629#true} ~cond := #in~cond; {14629#true} is VALID [2022-04-08 12:21:44,883 INFO L272 TraceCheckUtils]: 47: Hoare triple {15005#(or (= (+ (* main_~x~0 (+ main_~p~0 (* (- 2) main_~q~0))) (* (+ (* (- 2) main_~s~0) main_~r~0) main_~y~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* (- 1) main_~b~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0))))) (not (< (+ (* main_~q~0 main_~x~0) main_~b~0 (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))))))} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {14629#true} is VALID [2022-04-08 12:21:44,883 INFO L290 TraceCheckUtils]: 46: Hoare triple {15005#(or (= (+ (* main_~x~0 (+ main_~p~0 (* (- 2) main_~q~0))) (* (+ (* (- 2) main_~s~0) main_~r~0) main_~y~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* (- 1) main_~b~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0))))) (not (< (+ (* main_~q~0 main_~x~0) main_~b~0 (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))))))} assume !false; {15005#(or (= (+ (* main_~x~0 (+ main_~p~0 (* (- 2) main_~q~0))) (* (+ (* (- 2) main_~s~0) main_~r~0) main_~y~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* (- 1) main_~b~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0))))) (not (< (+ (* main_~q~0 main_~x~0) main_~b~0 (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))))))} is VALID [2022-04-08 12:21:46,886 WARN L290 TraceCheckUtils]: 45: Hoare triple {15060#(or (< main_~b~0 main_~a~0) (not (< (+ (* 2 (* main_~y~0 main_~s~0)) (* (* main_~q~0 main_~x~0) 2) main_~a~0) (+ (* (* main_~y~0 main_~r~0) 4) (* (* main_~p~0 main_~x~0) 4)))) (= (+ (* (- 1) main_~a~0) (* (- 1) (* (- 2) main_~y~0 main_~r~0)) (* (- 1) (* main_~y~0 main_~s~0)) (* (- 1) (* (- 2) main_~p~0 main_~x~0)) (* (+ (* main_~p~0 2) (* (- 1) main_~q~0)) main_~x~0) (* (+ (* (- 1) main_~s~0) (* main_~r~0 2)) main_~y~0) (* (- 1) (* main_~q~0 main_~x~0))) (+ (* (+ (* (- 2) main_~q~0) (* main_~p~0 3)) main_~x~0) (* main_~y~0 (+ (* (- 2) main_~s~0) (* main_~r~0 3))))) (not (= (+ (* (- 1) main_~a~0) main_~b~0) (+ (* main_~q~0 main_~x~0) (* (- 2) main_~y~0 main_~r~0) main_~a~0 (* (- 2) main_~p~0 main_~x~0) (* main_~y~0 main_~s~0)))))} assume !(~a~0 > ~b~0);~b~0 := ~b~0 - ~a~0;~q~0 := ~q~0 - ~p~0;~s~0 := ~s~0 - ~r~0; {15005#(or (= (+ (* main_~x~0 (+ main_~p~0 (* (- 2) main_~q~0))) (* (+ (* (- 2) main_~s~0) main_~r~0) main_~y~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* (- 1) main_~b~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0))))) (not (< (+ (* main_~q~0 main_~x~0) main_~b~0 (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))))))} is UNKNOWN [2022-04-08 12:21:46,887 INFO L290 TraceCheckUtils]: 44: Hoare triple {15064#(or (< main_~b~0 main_~a~0) (= main_~b~0 main_~a~0) (not (< (+ (* 2 (* main_~y~0 main_~s~0)) (* (* main_~q~0 main_~x~0) 2) main_~a~0) (+ (* (* main_~y~0 main_~r~0) 4) (* (* main_~p~0 main_~x~0) 4)))) (= (+ (* (- 1) main_~a~0) (* (- 1) (* (- 2) main_~y~0 main_~r~0)) (* (- 1) (* main_~y~0 main_~s~0)) (* (- 1) (* (- 2) main_~p~0 main_~x~0)) (* (+ (* main_~p~0 2) (* (- 1) main_~q~0)) main_~x~0) (* (+ (* (- 1) main_~s~0) (* main_~r~0 2)) main_~y~0) (* (- 1) (* main_~q~0 main_~x~0))) (+ (* (+ (* (- 2) main_~q~0) (* main_~p~0 3)) main_~x~0) (* main_~y~0 (+ (* (- 2) main_~s~0) (* main_~r~0 3))))) (not (= (+ (* (- 1) main_~a~0) main_~b~0) (+ (* main_~q~0 main_~x~0) (* (- 2) main_~y~0 main_~r~0) main_~a~0 (* (- 2) main_~p~0 main_~x~0) (* main_~y~0 main_~s~0)))))} assume !!(~a~0 != ~b~0); {15060#(or (< main_~b~0 main_~a~0) (not (< (+ (* 2 (* main_~y~0 main_~s~0)) (* (* main_~q~0 main_~x~0) 2) main_~a~0) (+ (* (* main_~y~0 main_~r~0) 4) (* (* main_~p~0 main_~x~0) 4)))) (= (+ (* (- 1) main_~a~0) (* (- 1) (* (- 2) main_~y~0 main_~r~0)) (* (- 1) (* main_~y~0 main_~s~0)) (* (- 1) (* (- 2) main_~p~0 main_~x~0)) (* (+ (* main_~p~0 2) (* (- 1) main_~q~0)) main_~x~0) (* (+ (* (- 1) main_~s~0) (* main_~r~0 2)) main_~y~0) (* (- 1) (* main_~q~0 main_~x~0))) (+ (* (+ (* (- 2) main_~q~0) (* main_~p~0 3)) main_~x~0) (* main_~y~0 (+ (* (- 2) main_~s~0) (* main_~r~0 3))))) (not (= (+ (* (- 1) main_~a~0) main_~b~0) (+ (* main_~q~0 main_~x~0) (* (- 2) main_~y~0 main_~r~0) main_~a~0 (* (- 2) main_~p~0 main_~x~0) (* main_~y~0 main_~s~0)))))} is VALID [2022-04-08 12:21:46,888 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {14629#true} {15064#(or (< main_~b~0 main_~a~0) (= main_~b~0 main_~a~0) (not (< (+ (* 2 (* main_~y~0 main_~s~0)) (* (* main_~q~0 main_~x~0) 2) main_~a~0) (+ (* (* main_~y~0 main_~r~0) 4) (* (* main_~p~0 main_~x~0) 4)))) (= (+ (* (- 1) main_~a~0) (* (- 1) (* (- 2) main_~y~0 main_~r~0)) (* (- 1) (* main_~y~0 main_~s~0)) (* (- 1) (* (- 2) main_~p~0 main_~x~0)) (* (+ (* main_~p~0 2) (* (- 1) main_~q~0)) main_~x~0) (* (+ (* (- 1) main_~s~0) (* main_~r~0 2)) main_~y~0) (* (- 1) (* main_~q~0 main_~x~0))) (+ (* (+ (* (- 2) main_~q~0) (* main_~p~0 3)) main_~x~0) (* main_~y~0 (+ (* (- 2) main_~s~0) (* main_~r~0 3))))) (not (= (+ (* (- 1) main_~a~0) main_~b~0) (+ (* main_~q~0 main_~x~0) (* (- 2) main_~y~0 main_~r~0) main_~a~0 (* (- 2) main_~p~0 main_~x~0) (* main_~y~0 main_~s~0)))))} #78#return; {15064#(or (< main_~b~0 main_~a~0) (= main_~b~0 main_~a~0) (not (< (+ (* 2 (* main_~y~0 main_~s~0)) (* (* main_~q~0 main_~x~0) 2) main_~a~0) (+ (* (* main_~y~0 main_~r~0) 4) (* (* main_~p~0 main_~x~0) 4)))) (= (+ (* (- 1) main_~a~0) (* (- 1) (* (- 2) main_~y~0 main_~r~0)) (* (- 1) (* main_~y~0 main_~s~0)) (* (- 1) (* (- 2) main_~p~0 main_~x~0)) (* (+ (* main_~p~0 2) (* (- 1) main_~q~0)) main_~x~0) (* (+ (* (- 1) main_~s~0) (* main_~r~0 2)) main_~y~0) (* (- 1) (* main_~q~0 main_~x~0))) (+ (* (+ (* (- 2) main_~q~0) (* main_~p~0 3)) main_~x~0) (* main_~y~0 (+ (* (- 2) main_~s~0) (* main_~r~0 3))))) (not (= (+ (* (- 1) main_~a~0) main_~b~0) (+ (* main_~q~0 main_~x~0) (* (- 2) main_~y~0 main_~r~0) main_~a~0 (* (- 2) main_~p~0 main_~x~0) (* main_~y~0 main_~s~0)))))} is VALID [2022-04-08 12:21:46,888 INFO L290 TraceCheckUtils]: 42: Hoare triple {14629#true} assume true; {14629#true} is VALID [2022-04-08 12:21:46,888 INFO L290 TraceCheckUtils]: 41: Hoare triple {14629#true} assume !(0 == ~cond); {14629#true} is VALID [2022-04-08 12:21:46,888 INFO L290 TraceCheckUtils]: 40: Hoare triple {14629#true} ~cond := #in~cond; {14629#true} is VALID [2022-04-08 12:21:46,888 INFO L272 TraceCheckUtils]: 39: Hoare triple {15064#(or (< main_~b~0 main_~a~0) (= main_~b~0 main_~a~0) (not (< (+ (* 2 (* main_~y~0 main_~s~0)) (* (* main_~q~0 main_~x~0) 2) main_~a~0) (+ (* (* main_~y~0 main_~r~0) 4) (* (* main_~p~0 main_~x~0) 4)))) (= (+ (* (- 1) main_~a~0) (* (- 1) (* (- 2) main_~y~0 main_~r~0)) (* (- 1) (* main_~y~0 main_~s~0)) (* (- 1) (* (- 2) main_~p~0 main_~x~0)) (* (+ (* main_~p~0 2) (* (- 1) main_~q~0)) main_~x~0) (* (+ (* (- 1) main_~s~0) (* main_~r~0 2)) main_~y~0) (* (- 1) (* main_~q~0 main_~x~0))) (+ (* (+ (* (- 2) main_~q~0) (* main_~p~0 3)) main_~x~0) (* main_~y~0 (+ (* (- 2) main_~s~0) (* main_~r~0 3))))) (not (= (+ (* (- 1) main_~a~0) main_~b~0) (+ (* main_~q~0 main_~x~0) (* (- 2) main_~y~0 main_~r~0) main_~a~0 (* (- 2) main_~p~0 main_~x~0) (* main_~y~0 main_~s~0)))))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {14629#true} is VALID [2022-04-08 12:21:46,888 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {14629#true} {15064#(or (< main_~b~0 main_~a~0) (= main_~b~0 main_~a~0) (not (< (+ (* 2 (* main_~y~0 main_~s~0)) (* (* main_~q~0 main_~x~0) 2) main_~a~0) (+ (* (* main_~y~0 main_~r~0) 4) (* (* main_~p~0 main_~x~0) 4)))) (= (+ (* (- 1) main_~a~0) (* (- 1) (* (- 2) main_~y~0 main_~r~0)) (* (- 1) (* main_~y~0 main_~s~0)) (* (- 1) (* (- 2) main_~p~0 main_~x~0)) (* (+ (* main_~p~0 2) (* (- 1) main_~q~0)) main_~x~0) (* (+ (* (- 1) main_~s~0) (* main_~r~0 2)) main_~y~0) (* (- 1) (* main_~q~0 main_~x~0))) (+ (* (+ (* (- 2) main_~q~0) (* main_~p~0 3)) main_~x~0) (* main_~y~0 (+ (* (- 2) main_~s~0) (* main_~r~0 3))))) (not (= (+ (* (- 1) main_~a~0) main_~b~0) (+ (* main_~q~0 main_~x~0) (* (- 2) main_~y~0 main_~r~0) main_~a~0 (* (- 2) main_~p~0 main_~x~0) (* main_~y~0 main_~s~0)))))} #76#return; {15064#(or (< main_~b~0 main_~a~0) (= main_~b~0 main_~a~0) (not (< (+ (* 2 (* main_~y~0 main_~s~0)) (* (* main_~q~0 main_~x~0) 2) main_~a~0) (+ (* (* main_~y~0 main_~r~0) 4) (* (* main_~p~0 main_~x~0) 4)))) (= (+ (* (- 1) main_~a~0) (* (- 1) (* (- 2) main_~y~0 main_~r~0)) (* (- 1) (* main_~y~0 main_~s~0)) (* (- 1) (* (- 2) main_~p~0 main_~x~0)) (* (+ (* main_~p~0 2) (* (- 1) main_~q~0)) main_~x~0) (* (+ (* (- 1) main_~s~0) (* main_~r~0 2)) main_~y~0) (* (- 1) (* main_~q~0 main_~x~0))) (+ (* (+ (* (- 2) main_~q~0) (* main_~p~0 3)) main_~x~0) (* main_~y~0 (+ (* (- 2) main_~s~0) (* main_~r~0 3))))) (not (= (+ (* (- 1) main_~a~0) main_~b~0) (+ (* main_~q~0 main_~x~0) (* (- 2) main_~y~0 main_~r~0) main_~a~0 (* (- 2) main_~p~0 main_~x~0) (* main_~y~0 main_~s~0)))))} is VALID [2022-04-08 12:21:46,889 INFO L290 TraceCheckUtils]: 37: Hoare triple {14629#true} assume true; {14629#true} is VALID [2022-04-08 12:21:46,889 INFO L290 TraceCheckUtils]: 36: Hoare triple {14629#true} assume !(0 == ~cond); {14629#true} is VALID [2022-04-08 12:21:46,889 INFO L290 TraceCheckUtils]: 35: Hoare triple {14629#true} ~cond := #in~cond; {14629#true} is VALID [2022-04-08 12:21:46,889 INFO L272 TraceCheckUtils]: 34: Hoare triple {15064#(or (< main_~b~0 main_~a~0) (= main_~b~0 main_~a~0) (not (< (+ (* 2 (* main_~y~0 main_~s~0)) (* (* main_~q~0 main_~x~0) 2) main_~a~0) (+ (* (* main_~y~0 main_~r~0) 4) (* (* main_~p~0 main_~x~0) 4)))) (= (+ (* (- 1) main_~a~0) (* (- 1) (* (- 2) main_~y~0 main_~r~0)) (* (- 1) (* main_~y~0 main_~s~0)) (* (- 1) (* (- 2) main_~p~0 main_~x~0)) (* (+ (* main_~p~0 2) (* (- 1) main_~q~0)) main_~x~0) (* (+ (* (- 1) main_~s~0) (* main_~r~0 2)) main_~y~0) (* (- 1) (* main_~q~0 main_~x~0))) (+ (* (+ (* (- 2) main_~q~0) (* main_~p~0 3)) main_~x~0) (* main_~y~0 (+ (* (- 2) main_~s~0) (* main_~r~0 3))))) (not (= (+ (* (- 1) main_~a~0) main_~b~0) (+ (* main_~q~0 main_~x~0) (* (- 2) main_~y~0 main_~r~0) main_~a~0 (* (- 2) main_~p~0 main_~x~0) (* main_~y~0 main_~s~0)))))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {14629#true} is VALID [2022-04-08 12:21:46,889 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {14629#true} {15064#(or (< main_~b~0 main_~a~0) (= main_~b~0 main_~a~0) (not (< (+ (* 2 (* main_~y~0 main_~s~0)) (* (* main_~q~0 main_~x~0) 2) main_~a~0) (+ (* (* main_~y~0 main_~r~0) 4) (* (* main_~p~0 main_~x~0) 4)))) (= (+ (* (- 1) main_~a~0) (* (- 1) (* (- 2) main_~y~0 main_~r~0)) (* (- 1) (* main_~y~0 main_~s~0)) (* (- 1) (* (- 2) main_~p~0 main_~x~0)) (* (+ (* main_~p~0 2) (* (- 1) main_~q~0)) main_~x~0) (* (+ (* (- 1) main_~s~0) (* main_~r~0 2)) main_~y~0) (* (- 1) (* main_~q~0 main_~x~0))) (+ (* (+ (* (- 2) main_~q~0) (* main_~p~0 3)) main_~x~0) (* main_~y~0 (+ (* (- 2) main_~s~0) (* main_~r~0 3))))) (not (= (+ (* (- 1) main_~a~0) main_~b~0) (+ (* main_~q~0 main_~x~0) (* (- 2) main_~y~0 main_~r~0) main_~a~0 (* (- 2) main_~p~0 main_~x~0) (* main_~y~0 main_~s~0)))))} #74#return; {15064#(or (< main_~b~0 main_~a~0) (= main_~b~0 main_~a~0) (not (< (+ (* 2 (* main_~y~0 main_~s~0)) (* (* main_~q~0 main_~x~0) 2) main_~a~0) (+ (* (* main_~y~0 main_~r~0) 4) (* (* main_~p~0 main_~x~0) 4)))) (= (+ (* (- 1) main_~a~0) (* (- 1) (* (- 2) main_~y~0 main_~r~0)) (* (- 1) (* main_~y~0 main_~s~0)) (* (- 1) (* (- 2) main_~p~0 main_~x~0)) (* (+ (* main_~p~0 2) (* (- 1) main_~q~0)) main_~x~0) (* (+ (* (- 1) main_~s~0) (* main_~r~0 2)) main_~y~0) (* (- 1) (* main_~q~0 main_~x~0))) (+ (* (+ (* (- 2) main_~q~0) (* main_~p~0 3)) main_~x~0) (* main_~y~0 (+ (* (- 2) main_~s~0) (* main_~r~0 3))))) (not (= (+ (* (- 1) main_~a~0) main_~b~0) (+ (* main_~q~0 main_~x~0) (* (- 2) main_~y~0 main_~r~0) main_~a~0 (* (- 2) main_~p~0 main_~x~0) (* main_~y~0 main_~s~0)))))} is VALID [2022-04-08 12:21:46,889 INFO L290 TraceCheckUtils]: 32: Hoare triple {14629#true} assume true; {14629#true} is VALID [2022-04-08 12:21:46,890 INFO L290 TraceCheckUtils]: 31: Hoare triple {14629#true} assume !(0 == ~cond); {14629#true} is VALID [2022-04-08 12:21:46,890 INFO L290 TraceCheckUtils]: 30: Hoare triple {14629#true} ~cond := #in~cond; {14629#true} is VALID [2022-04-08 12:21:46,890 INFO L272 TraceCheckUtils]: 29: Hoare triple {15064#(or (< main_~b~0 main_~a~0) (= main_~b~0 main_~a~0) (not (< (+ (* 2 (* main_~y~0 main_~s~0)) (* (* main_~q~0 main_~x~0) 2) main_~a~0) (+ (* (* main_~y~0 main_~r~0) 4) (* (* main_~p~0 main_~x~0) 4)))) (= (+ (* (- 1) main_~a~0) (* (- 1) (* (- 2) main_~y~0 main_~r~0)) (* (- 1) (* main_~y~0 main_~s~0)) (* (- 1) (* (- 2) main_~p~0 main_~x~0)) (* (+ (* main_~p~0 2) (* (- 1) main_~q~0)) main_~x~0) (* (+ (* (- 1) main_~s~0) (* main_~r~0 2)) main_~y~0) (* (- 1) (* main_~q~0 main_~x~0))) (+ (* (+ (* (- 2) main_~q~0) (* main_~p~0 3)) main_~x~0) (* main_~y~0 (+ (* (- 2) main_~s~0) (* main_~r~0 3))))) (not (= (+ (* (- 1) main_~a~0) main_~b~0) (+ (* main_~q~0 main_~x~0) (* (- 2) main_~y~0 main_~r~0) main_~a~0 (* (- 2) main_~p~0 main_~x~0) (* main_~y~0 main_~s~0)))))} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {14629#true} is VALID [2022-04-08 12:21:46,890 INFO L290 TraceCheckUtils]: 28: Hoare triple {15064#(or (< main_~b~0 main_~a~0) (= main_~b~0 main_~a~0) (not (< (+ (* 2 (* main_~y~0 main_~s~0)) (* (* main_~q~0 main_~x~0) 2) main_~a~0) (+ (* (* main_~y~0 main_~r~0) 4) (* (* main_~p~0 main_~x~0) 4)))) (= (+ (* (- 1) main_~a~0) (* (- 1) (* (- 2) main_~y~0 main_~r~0)) (* (- 1) (* main_~y~0 main_~s~0)) (* (- 1) (* (- 2) main_~p~0 main_~x~0)) (* (+ (* main_~p~0 2) (* (- 1) main_~q~0)) main_~x~0) (* (+ (* (- 1) main_~s~0) (* main_~r~0 2)) main_~y~0) (* (- 1) (* main_~q~0 main_~x~0))) (+ (* (+ (* (- 2) main_~q~0) (* main_~p~0 3)) main_~x~0) (* main_~y~0 (+ (* (- 2) main_~s~0) (* main_~r~0 3))))) (not (= (+ (* (- 1) main_~a~0) main_~b~0) (+ (* main_~q~0 main_~x~0) (* (- 2) main_~y~0 main_~r~0) main_~a~0 (* (- 2) main_~p~0 main_~x~0) (* main_~y~0 main_~s~0)))))} assume !false; {15064#(or (< main_~b~0 main_~a~0) (= main_~b~0 main_~a~0) (not (< (+ (* 2 (* main_~y~0 main_~s~0)) (* (* main_~q~0 main_~x~0) 2) main_~a~0) (+ (* (* main_~y~0 main_~r~0) 4) (* (* main_~p~0 main_~x~0) 4)))) (= (+ (* (- 1) main_~a~0) (* (- 1) (* (- 2) main_~y~0 main_~r~0)) (* (- 1) (* main_~y~0 main_~s~0)) (* (- 1) (* (- 2) main_~p~0 main_~x~0)) (* (+ (* main_~p~0 2) (* (- 1) main_~q~0)) main_~x~0) (* (+ (* (- 1) main_~s~0) (* main_~r~0 2)) main_~y~0) (* (- 1) (* main_~q~0 main_~x~0))) (+ (* (+ (* (- 2) main_~q~0) (* main_~p~0 3)) main_~x~0) (* main_~y~0 (+ (* (- 2) main_~s~0) (* main_~r~0 3))))) (not (= (+ (* (- 1) main_~a~0) main_~b~0) (+ (* main_~q~0 main_~x~0) (* (- 2) main_~y~0 main_~r~0) main_~a~0 (* (- 2) main_~p~0 main_~x~0) (* main_~y~0 main_~s~0)))))} is VALID [2022-04-08 12:21:46,891 INFO L290 TraceCheckUtils]: 27: Hoare triple {14629#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {15064#(or (< main_~b~0 main_~a~0) (= main_~b~0 main_~a~0) (not (< (+ (* 2 (* main_~y~0 main_~s~0)) (* (* main_~q~0 main_~x~0) 2) main_~a~0) (+ (* (* main_~y~0 main_~r~0) 4) (* (* main_~p~0 main_~x~0) 4)))) (= (+ (* (- 1) main_~a~0) (* (- 1) (* (- 2) main_~y~0 main_~r~0)) (* (- 1) (* main_~y~0 main_~s~0)) (* (- 1) (* (- 2) main_~p~0 main_~x~0)) (* (+ (* main_~p~0 2) (* (- 1) main_~q~0)) main_~x~0) (* (+ (* (- 1) main_~s~0) (* main_~r~0 2)) main_~y~0) (* (- 1) (* main_~q~0 main_~x~0))) (+ (* (+ (* (- 2) main_~q~0) (* main_~p~0 3)) main_~x~0) (* main_~y~0 (+ (* (- 2) main_~s~0) (* main_~r~0 3))))) (not (= (+ (* (- 1) main_~a~0) main_~b~0) (+ (* main_~q~0 main_~x~0) (* (- 2) main_~y~0 main_~r~0) main_~a~0 (* (- 2) main_~p~0 main_~x~0) (* main_~y~0 main_~s~0)))))} is VALID [2022-04-08 12:21:46,891 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {14629#true} {14629#true} #72#return; {14629#true} is VALID [2022-04-08 12:21:46,891 INFO L290 TraceCheckUtils]: 25: Hoare triple {14629#true} assume true; {14629#true} is VALID [2022-04-08 12:21:46,891 INFO L290 TraceCheckUtils]: 24: Hoare triple {14629#true} assume !(0 == ~cond); {14629#true} is VALID [2022-04-08 12:21:46,891 INFO L290 TraceCheckUtils]: 23: Hoare triple {14629#true} ~cond := #in~cond; {14629#true} is VALID [2022-04-08 12:21:46,891 INFO L272 TraceCheckUtils]: 22: Hoare triple {14629#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {14629#true} is VALID [2022-04-08 12:21:46,891 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {14629#true} {14629#true} #70#return; {14629#true} is VALID [2022-04-08 12:21:46,891 INFO L290 TraceCheckUtils]: 20: Hoare triple {14629#true} assume true; {14629#true} is VALID [2022-04-08 12:21:46,891 INFO L290 TraceCheckUtils]: 19: Hoare triple {14629#true} assume !(0 == ~cond); {14629#true} is VALID [2022-04-08 12:21:46,892 INFO L290 TraceCheckUtils]: 18: Hoare triple {14629#true} ~cond := #in~cond; {14629#true} is VALID [2022-04-08 12:21:46,892 INFO L272 TraceCheckUtils]: 17: Hoare triple {14629#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {14629#true} is VALID [2022-04-08 12:21:46,892 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {14629#true} {14629#true} #68#return; {14629#true} is VALID [2022-04-08 12:21:46,892 INFO L290 TraceCheckUtils]: 15: Hoare triple {14629#true} assume true; {14629#true} is VALID [2022-04-08 12:21:46,892 INFO L290 TraceCheckUtils]: 14: Hoare triple {14629#true} assume !(0 == ~cond); {14629#true} is VALID [2022-04-08 12:21:46,892 INFO L290 TraceCheckUtils]: 13: Hoare triple {14629#true} ~cond := #in~cond; {14629#true} is VALID [2022-04-08 12:21:46,892 INFO L272 TraceCheckUtils]: 12: Hoare triple {14629#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 5 then 1 else 0)); {14629#true} is VALID [2022-04-08 12:21:46,892 INFO L290 TraceCheckUtils]: 11: Hoare triple {14629#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {14629#true} is VALID [2022-04-08 12:21:46,892 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {14629#true} {14629#true} #66#return; {14629#true} is VALID [2022-04-08 12:21:46,892 INFO L290 TraceCheckUtils]: 9: Hoare triple {14629#true} assume true; {14629#true} is VALID [2022-04-08 12:21:46,892 INFO L290 TraceCheckUtils]: 8: Hoare triple {14629#true} assume !(0 == ~cond); {14629#true} is VALID [2022-04-08 12:21:46,892 INFO L290 TraceCheckUtils]: 7: Hoare triple {14629#true} ~cond := #in~cond; {14629#true} is VALID [2022-04-08 12:21:46,892 INFO L272 TraceCheckUtils]: 6: Hoare triple {14629#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 5 then 1 else 0)); {14629#true} is VALID [2022-04-08 12:21:46,892 INFO L290 TraceCheckUtils]: 5: Hoare triple {14629#true} havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~x~0;havoc ~y~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {14629#true} is VALID [2022-04-08 12:21:46,892 INFO L272 TraceCheckUtils]: 4: Hoare triple {14629#true} call #t~ret6 := main(); {14629#true} is VALID [2022-04-08 12:21:46,892 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14629#true} {14629#true} #88#return; {14629#true} is VALID [2022-04-08 12:21:46,892 INFO L290 TraceCheckUtils]: 2: Hoare triple {14629#true} assume true; {14629#true} is VALID [2022-04-08 12:21:46,892 INFO L290 TraceCheckUtils]: 1: Hoare triple {14629#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(10, 2);call #Ultimate.allocInit(12, 3); {14629#true} is VALID [2022-04-08 12:21:46,892 INFO L272 TraceCheckUtils]: 0: Hoare triple {14629#true} call ULTIMATE.init(); {14629#true} is VALID [2022-04-08 12:21:46,893 INFO L134 CoverageAnalysis]: Checked inductivity of 251 backedges. 46 proven. 28 refuted. 0 times theorem prover too weak. 177 trivial. 0 not checked. [2022-04-08 12:21:46,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 12:21:46,893 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [779099168] [2022-04-08 12:21:46,893 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 12:21:46,893 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1614286790] [2022-04-08 12:21:46,893 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1614286790] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 12:21:46,893 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 12:21:46,893 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 19 [2022-04-08 12:21:46,894 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 12:21:46,894 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [605894869] [2022-04-08 12:21:46,894 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [605894869] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 12:21:46,894 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 12:21:46,894 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-08 12:21:46,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2112860545] [2022-04-08 12:21:46,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 12:21:46,894 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.25) internal successors, (27), 11 states have internal predecessors, (27), 6 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 6 states have call predecessors, (15), 6 states have call successors, (15) Word has length 92 [2022-04-08 12:21:46,894 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 12:21:46,894 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 2.25) internal successors, (27), 11 states have internal predecessors, (27), 6 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 6 states have call predecessors, (15), 6 states have call successors, (15) [2022-04-08 12:21:46,953 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 12:21:46,953 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-08 12:21:46,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 12:21:46,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-08 12:21:46,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=270, Unknown=0, NotChecked=0, Total=342 [2022-04-08 12:21:46,953 INFO L87 Difference]: Start difference. First operand 183 states and 216 transitions. Second operand has 12 states, 12 states have (on average 2.25) internal successors, (27), 11 states have internal predecessors, (27), 6 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 6 states have call predecessors, (15), 6 states have call successors, (15) [2022-04-08 12:21:49,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:21:49,996 INFO L93 Difference]: Finished difference Result 212 states and 252 transitions. [2022-04-08 12:21:49,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-08 12:21:49,996 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.25) internal successors, (27), 11 states have internal predecessors, (27), 6 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 6 states have call predecessors, (15), 6 states have call successors, (15) Word has length 92 [2022-04-08 12:21:49,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 12:21:49,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 2.25) internal successors, (27), 11 states have internal predecessors, (27), 6 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 6 states have call predecessors, (15), 6 states have call successors, (15) [2022-04-08 12:21:49,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 79 transitions. [2022-04-08 12:21:49,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 2.25) internal successors, (27), 11 states have internal predecessors, (27), 6 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 6 states have call predecessors, (15), 6 states have call successors, (15) [2022-04-08 12:21:49,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 79 transitions. [2022-04-08 12:21:49,998 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 79 transitions. [2022-04-08 12:21:50,086 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 79 edges. 79 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 12:21:50,089 INFO L225 Difference]: With dead ends: 212 [2022-04-08 12:21:50,089 INFO L226 Difference]: Without dead ends: 210 [2022-04-08 12:21:50,089 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 165 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=85, Invalid=335, Unknown=0, NotChecked=0, Total=420 [2022-04-08 12:21:50,090 INFO L913 BasicCegarLoop]: 39 mSDtfsCounter, 14 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 382 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 210 SdHoareTripleChecker+Invalid, 394 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 382 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-04-08 12:21:50,090 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [16 Valid, 210 Invalid, 394 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 382 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-04-08 12:21:50,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2022-04-08 12:21:50,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 200. [2022-04-08 12:21:50,500 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 12:21:50,500 INFO L82 GeneralOperation]: Start isEquivalent. First operand 210 states. Second operand has 200 states, 121 states have (on average 1.1074380165289257) internal successors, (134), 125 states have internal predecessors, (134), 52 states have call successors, (52), 27 states have call predecessors, (52), 26 states have return successors, (51), 47 states have call predecessors, (51), 51 states have call successors, (51) [2022-04-08 12:21:50,500 INFO L74 IsIncluded]: Start isIncluded. First operand 210 states. Second operand has 200 states, 121 states have (on average 1.1074380165289257) internal successors, (134), 125 states have internal predecessors, (134), 52 states have call successors, (52), 27 states have call predecessors, (52), 26 states have return successors, (51), 47 states have call predecessors, (51), 51 states have call successors, (51) [2022-04-08 12:21:50,501 INFO L87 Difference]: Start difference. First operand 210 states. Second operand has 200 states, 121 states have (on average 1.1074380165289257) internal successors, (134), 125 states have internal predecessors, (134), 52 states have call successors, (52), 27 states have call predecessors, (52), 26 states have return successors, (51), 47 states have call predecessors, (51), 51 states have call successors, (51) [2022-04-08 12:21:50,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:21:50,504 INFO L93 Difference]: Finished difference Result 210 states and 250 transitions. [2022-04-08 12:21:50,504 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 250 transitions. [2022-04-08 12:21:50,505 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:21:50,505 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 12:21:50,505 INFO L74 IsIncluded]: Start isIncluded. First operand has 200 states, 121 states have (on average 1.1074380165289257) internal successors, (134), 125 states have internal predecessors, (134), 52 states have call successors, (52), 27 states have call predecessors, (52), 26 states have return successors, (51), 47 states have call predecessors, (51), 51 states have call successors, (51) Second operand 210 states. [2022-04-08 12:21:50,505 INFO L87 Difference]: Start difference. First operand has 200 states, 121 states have (on average 1.1074380165289257) internal successors, (134), 125 states have internal predecessors, (134), 52 states have call successors, (52), 27 states have call predecessors, (52), 26 states have return successors, (51), 47 states have call predecessors, (51), 51 states have call successors, (51) Second operand 210 states. [2022-04-08 12:21:50,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:21:50,509 INFO L93 Difference]: Finished difference Result 210 states and 250 transitions. [2022-04-08 12:21:50,509 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 250 transitions. [2022-04-08 12:21:50,509 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:21:50,509 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 12:21:50,509 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 12:21:50,509 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 12:21:50,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 121 states have (on average 1.1074380165289257) internal successors, (134), 125 states have internal predecessors, (134), 52 states have call successors, (52), 27 states have call predecessors, (52), 26 states have return successors, (51), 47 states have call predecessors, (51), 51 states have call successors, (51) [2022-04-08 12:21:50,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 237 transitions. [2022-04-08 12:21:50,513 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 237 transitions. Word has length 92 [2022-04-08 12:21:50,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 12:21:50,513 INFO L478 AbstractCegarLoop]: Abstraction has 200 states and 237 transitions. [2022-04-08 12:21:50,513 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.25) internal successors, (27), 11 states have internal predecessors, (27), 6 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 6 states have call predecessors, (15), 6 states have call successors, (15) [2022-04-08 12:21:50,513 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 200 states and 237 transitions. [2022-04-08 12:21:51,603 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 237 edges. 237 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 12:21:51,603 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 237 transitions. [2022-04-08 12:21:51,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2022-04-08 12:21:51,606 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 12:21:51,606 INFO L499 BasicCegarLoop]: trace histogram [11, 10, 10, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 12:21:51,625 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2022-04-08 12:21:51,826 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 12:21:51,826 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 12:21:51,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 12:21:51,830 INFO L85 PathProgramCache]: Analyzing trace with hash 1451786998, now seen corresponding path program 11 times [2022-04-08 12:21:51,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 12:21:51,830 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [73092921] [2022-04-08 12:21:51,830 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 12:21:51,830 INFO L85 PathProgramCache]: Analyzing trace with hash 1451786998, now seen corresponding path program 12 times [2022-04-08 12:21:51,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 12:21:51,831 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1209052247] [2022-04-08 12:21:51,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 12:21:51,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 12:21:51,853 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 12:21:51,854 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1887374131] [2022-04-08 12:21:51,854 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 12:21:51,854 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 12:21:51,854 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 12:21:51,857 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 12:21:51,858 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 12:21:51,909 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-04-08 12:21:51,910 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 12:21:51,910 INFO L263 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 30 conjunts are in the unsatisfiable core [2022-04-08 12:21:51,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 12:21:51,939 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 12:22:01,364 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-08 12:22:05,183 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-08 12:22:17,765 INFO L272 TraceCheckUtils]: 0: Hoare triple {16447#true} call ULTIMATE.init(); {16447#true} is VALID [2022-04-08 12:22:17,765 INFO L290 TraceCheckUtils]: 1: Hoare triple {16447#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(10, 2);call #Ultimate.allocInit(12, 3); {16447#true} is VALID [2022-04-08 12:22:17,765 INFO L290 TraceCheckUtils]: 2: Hoare triple {16447#true} assume true; {16447#true} is VALID [2022-04-08 12:22:17,765 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16447#true} {16447#true} #88#return; {16447#true} is VALID [2022-04-08 12:22:17,765 INFO L272 TraceCheckUtils]: 4: Hoare triple {16447#true} call #t~ret6 := main(); {16447#true} is VALID [2022-04-08 12:22:17,765 INFO L290 TraceCheckUtils]: 5: Hoare triple {16447#true} havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~x~0;havoc ~y~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {16447#true} is VALID [2022-04-08 12:22:17,765 INFO L272 TraceCheckUtils]: 6: Hoare triple {16447#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 5 then 1 else 0)); {16447#true} is VALID [2022-04-08 12:22:17,766 INFO L290 TraceCheckUtils]: 7: Hoare triple {16447#true} ~cond := #in~cond; {16447#true} is VALID [2022-04-08 12:22:17,766 INFO L290 TraceCheckUtils]: 8: Hoare triple {16447#true} assume !(0 == ~cond); {16447#true} is VALID [2022-04-08 12:22:17,766 INFO L290 TraceCheckUtils]: 9: Hoare triple {16447#true} assume true; {16447#true} is VALID [2022-04-08 12:22:17,766 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {16447#true} {16447#true} #66#return; {16447#true} is VALID [2022-04-08 12:22:17,766 INFO L290 TraceCheckUtils]: 11: Hoare triple {16447#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {16447#true} is VALID [2022-04-08 12:22:17,766 INFO L272 TraceCheckUtils]: 12: Hoare triple {16447#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 5 then 1 else 0)); {16447#true} is VALID [2022-04-08 12:22:17,766 INFO L290 TraceCheckUtils]: 13: Hoare triple {16447#true} ~cond := #in~cond; {16447#true} is VALID [2022-04-08 12:22:17,766 INFO L290 TraceCheckUtils]: 14: Hoare triple {16447#true} assume !(0 == ~cond); {16447#true} is VALID [2022-04-08 12:22:17,766 INFO L290 TraceCheckUtils]: 15: Hoare triple {16447#true} assume true; {16447#true} is VALID [2022-04-08 12:22:17,766 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {16447#true} {16447#true} #68#return; {16447#true} is VALID [2022-04-08 12:22:17,766 INFO L272 TraceCheckUtils]: 17: Hoare triple {16447#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {16447#true} is VALID [2022-04-08 12:22:17,766 INFO L290 TraceCheckUtils]: 18: Hoare triple {16447#true} ~cond := #in~cond; {16447#true} is VALID [2022-04-08 12:22:17,766 INFO L290 TraceCheckUtils]: 19: Hoare triple {16447#true} assume !(0 == ~cond); {16447#true} is VALID [2022-04-08 12:22:17,766 INFO L290 TraceCheckUtils]: 20: Hoare triple {16447#true} assume true; {16447#true} is VALID [2022-04-08 12:22:17,766 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {16447#true} {16447#true} #70#return; {16447#true} is VALID [2022-04-08 12:22:17,766 INFO L272 TraceCheckUtils]: 22: Hoare triple {16447#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {16447#true} is VALID [2022-04-08 12:22:17,766 INFO L290 TraceCheckUtils]: 23: Hoare triple {16447#true} ~cond := #in~cond; {16447#true} is VALID [2022-04-08 12:22:17,766 INFO L290 TraceCheckUtils]: 24: Hoare triple {16447#true} assume !(0 == ~cond); {16447#true} is VALID [2022-04-08 12:22:17,767 INFO L290 TraceCheckUtils]: 25: Hoare triple {16447#true} assume true; {16447#true} is VALID [2022-04-08 12:22:17,767 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {16447#true} {16447#true} #72#return; {16447#true} is VALID [2022-04-08 12:22:17,767 INFO L290 TraceCheckUtils]: 27: Hoare triple {16447#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {16533#(and (= main_~r~0 0) (<= 1 main_~p~0) (= main_~a~0 main_~x~0))} is VALID [2022-04-08 12:22:17,767 INFO L290 TraceCheckUtils]: 28: Hoare triple {16533#(and (= main_~r~0 0) (<= 1 main_~p~0) (= main_~a~0 main_~x~0))} assume !false; {16533#(and (= main_~r~0 0) (<= 1 main_~p~0) (= main_~a~0 main_~x~0))} is VALID [2022-04-08 12:22:17,767 INFO L272 TraceCheckUtils]: 29: Hoare triple {16533#(and (= main_~r~0 0) (<= 1 main_~p~0) (= main_~a~0 main_~x~0))} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {16447#true} is VALID [2022-04-08 12:22:17,767 INFO L290 TraceCheckUtils]: 30: Hoare triple {16447#true} ~cond := #in~cond; {16447#true} is VALID [2022-04-08 12:22:17,767 INFO L290 TraceCheckUtils]: 31: Hoare triple {16447#true} assume !(0 == ~cond); {16447#true} is VALID [2022-04-08 12:22:17,768 INFO L290 TraceCheckUtils]: 32: Hoare triple {16447#true} assume true; {16447#true} is VALID [2022-04-08 12:22:17,768 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {16447#true} {16533#(and (= main_~r~0 0) (<= 1 main_~p~0) (= main_~a~0 main_~x~0))} #74#return; {16533#(and (= main_~r~0 0) (<= 1 main_~p~0) (= main_~a~0 main_~x~0))} is VALID [2022-04-08 12:22:17,768 INFO L272 TraceCheckUtils]: 34: Hoare triple {16533#(and (= main_~r~0 0) (<= 1 main_~p~0) (= main_~a~0 main_~x~0))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {16447#true} is VALID [2022-04-08 12:22:17,768 INFO L290 TraceCheckUtils]: 35: Hoare triple {16447#true} ~cond := #in~cond; {16447#true} is VALID [2022-04-08 12:22:17,768 INFO L290 TraceCheckUtils]: 36: Hoare triple {16447#true} assume !(0 == ~cond); {16447#true} is VALID [2022-04-08 12:22:17,768 INFO L290 TraceCheckUtils]: 37: Hoare triple {16447#true} assume true; {16447#true} is VALID [2022-04-08 12:22:17,769 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {16447#true} {16533#(and (= main_~r~0 0) (<= 1 main_~p~0) (= main_~a~0 main_~x~0))} #76#return; {16533#(and (= main_~r~0 0) (<= 1 main_~p~0) (= main_~a~0 main_~x~0))} is VALID [2022-04-08 12:22:17,769 INFO L272 TraceCheckUtils]: 39: Hoare triple {16533#(and (= main_~r~0 0) (<= 1 main_~p~0) (= main_~a~0 main_~x~0))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {16447#true} is VALID [2022-04-08 12:22:17,769 INFO L290 TraceCheckUtils]: 40: Hoare triple {16447#true} ~cond := #in~cond; {16447#true} is VALID [2022-04-08 12:22:17,769 INFO L290 TraceCheckUtils]: 41: Hoare triple {16447#true} assume !(0 == ~cond); {16447#true} is VALID [2022-04-08 12:22:17,769 INFO L290 TraceCheckUtils]: 42: Hoare triple {16447#true} assume true; {16447#true} is VALID [2022-04-08 12:22:17,770 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {16447#true} {16533#(and (= main_~r~0 0) (<= 1 main_~p~0) (= main_~a~0 main_~x~0))} #78#return; {16533#(and (= main_~r~0 0) (<= 1 main_~p~0) (= main_~a~0 main_~x~0))} is VALID [2022-04-08 12:22:17,770 INFO L290 TraceCheckUtils]: 44: Hoare triple {16533#(and (= main_~r~0 0) (<= 1 main_~p~0) (= main_~a~0 main_~x~0))} assume !!(~a~0 != ~b~0); {16533#(and (= main_~r~0 0) (<= 1 main_~p~0) (= main_~a~0 main_~x~0))} is VALID [2022-04-08 12:22:17,770 INFO L290 TraceCheckUtils]: 45: Hoare triple {16533#(and (= main_~r~0 0) (<= 1 main_~p~0) (= main_~a~0 main_~x~0))} assume !(~a~0 > ~b~0);~b~0 := ~b~0 - ~a~0;~q~0 := ~q~0 - ~p~0;~s~0 := ~s~0 - ~r~0; {16533#(and (= main_~r~0 0) (<= 1 main_~p~0) (= main_~a~0 main_~x~0))} is VALID [2022-04-08 12:22:17,771 INFO L290 TraceCheckUtils]: 46: Hoare triple {16533#(and (= main_~r~0 0) (<= 1 main_~p~0) (= main_~a~0 main_~x~0))} assume !false; {16533#(and (= main_~r~0 0) (<= 1 main_~p~0) (= main_~a~0 main_~x~0))} is VALID [2022-04-08 12:22:17,771 INFO L272 TraceCheckUtils]: 47: Hoare triple {16533#(and (= main_~r~0 0) (<= 1 main_~p~0) (= main_~a~0 main_~x~0))} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {16447#true} is VALID [2022-04-08 12:22:17,771 INFO L290 TraceCheckUtils]: 48: Hoare triple {16447#true} ~cond := #in~cond; {16447#true} is VALID [2022-04-08 12:22:17,771 INFO L290 TraceCheckUtils]: 49: Hoare triple {16447#true} assume !(0 == ~cond); {16447#true} is VALID [2022-04-08 12:22:17,771 INFO L290 TraceCheckUtils]: 50: Hoare triple {16447#true} assume true; {16447#true} is VALID [2022-04-08 12:22:17,771 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {16447#true} {16533#(and (= main_~r~0 0) (<= 1 main_~p~0) (= main_~a~0 main_~x~0))} #74#return; {16533#(and (= main_~r~0 0) (<= 1 main_~p~0) (= main_~a~0 main_~x~0))} is VALID [2022-04-08 12:22:17,771 INFO L272 TraceCheckUtils]: 52: Hoare triple {16533#(and (= main_~r~0 0) (<= 1 main_~p~0) (= main_~a~0 main_~x~0))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {16447#true} is VALID [2022-04-08 12:22:17,771 INFO L290 TraceCheckUtils]: 53: Hoare triple {16447#true} ~cond := #in~cond; {16447#true} is VALID [2022-04-08 12:22:17,772 INFO L290 TraceCheckUtils]: 54: Hoare triple {16447#true} assume !(0 == ~cond); {16447#true} is VALID [2022-04-08 12:22:17,772 INFO L290 TraceCheckUtils]: 55: Hoare triple {16447#true} assume true; {16447#true} is VALID [2022-04-08 12:22:17,772 INFO L284 TraceCheckUtils]: 56: Hoare quadruple {16447#true} {16533#(and (= main_~r~0 0) (<= 1 main_~p~0) (= main_~a~0 main_~x~0))} #76#return; {16533#(and (= main_~r~0 0) (<= 1 main_~p~0) (= main_~a~0 main_~x~0))} is VALID [2022-04-08 12:22:17,772 INFO L272 TraceCheckUtils]: 57: Hoare triple {16533#(and (= main_~r~0 0) (<= 1 main_~p~0) (= main_~a~0 main_~x~0))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {16447#true} is VALID [2022-04-08 12:22:17,772 INFO L290 TraceCheckUtils]: 58: Hoare triple {16447#true} ~cond := #in~cond; {16447#true} is VALID [2022-04-08 12:22:17,772 INFO L290 TraceCheckUtils]: 59: Hoare triple {16447#true} assume !(0 == ~cond); {16447#true} is VALID [2022-04-08 12:22:17,772 INFO L290 TraceCheckUtils]: 60: Hoare triple {16447#true} assume true; {16447#true} is VALID [2022-04-08 12:22:17,773 INFO L284 TraceCheckUtils]: 61: Hoare quadruple {16447#true} {16533#(and (= main_~r~0 0) (<= 1 main_~p~0) (= main_~a~0 main_~x~0))} #78#return; {16533#(and (= main_~r~0 0) (<= 1 main_~p~0) (= main_~a~0 main_~x~0))} is VALID [2022-04-08 12:22:17,773 INFO L290 TraceCheckUtils]: 62: Hoare triple {16533#(and (= main_~r~0 0) (<= 1 main_~p~0) (= main_~a~0 main_~x~0))} assume !!(~a~0 != ~b~0); {16533#(and (= main_~r~0 0) (<= 1 main_~p~0) (= main_~a~0 main_~x~0))} is VALID [2022-04-08 12:22:17,774 INFO L290 TraceCheckUtils]: 63: Hoare triple {16533#(and (= main_~r~0 0) (<= 1 main_~p~0) (= main_~a~0 main_~x~0))} assume !(~a~0 > ~b~0);~b~0 := ~b~0 - ~a~0;~q~0 := ~q~0 - ~p~0;~s~0 := ~s~0 - ~r~0; {16533#(and (= main_~r~0 0) (<= 1 main_~p~0) (= main_~a~0 main_~x~0))} is VALID [2022-04-08 12:22:17,774 INFO L290 TraceCheckUtils]: 64: Hoare triple {16533#(and (= main_~r~0 0) (<= 1 main_~p~0) (= main_~a~0 main_~x~0))} assume !false; {16533#(and (= main_~r~0 0) (<= 1 main_~p~0) (= main_~a~0 main_~x~0))} is VALID [2022-04-08 12:22:17,774 INFO L272 TraceCheckUtils]: 65: Hoare triple {16533#(and (= main_~r~0 0) (<= 1 main_~p~0) (= main_~a~0 main_~x~0))} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {16447#true} is VALID [2022-04-08 12:22:17,774 INFO L290 TraceCheckUtils]: 66: Hoare triple {16447#true} ~cond := #in~cond; {16447#true} is VALID [2022-04-08 12:22:17,774 INFO L290 TraceCheckUtils]: 67: Hoare triple {16447#true} assume !(0 == ~cond); {16447#true} is VALID [2022-04-08 12:22:17,774 INFO L290 TraceCheckUtils]: 68: Hoare triple {16447#true} assume true; {16447#true} is VALID [2022-04-08 12:22:17,775 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {16447#true} {16533#(and (= main_~r~0 0) (<= 1 main_~p~0) (= main_~a~0 main_~x~0))} #74#return; {16533#(and (= main_~r~0 0) (<= 1 main_~p~0) (= main_~a~0 main_~x~0))} is VALID [2022-04-08 12:22:17,775 INFO L272 TraceCheckUtils]: 70: Hoare triple {16533#(and (= main_~r~0 0) (<= 1 main_~p~0) (= main_~a~0 main_~x~0))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {16447#true} is VALID [2022-04-08 12:22:17,775 INFO L290 TraceCheckUtils]: 71: Hoare triple {16447#true} ~cond := #in~cond; {16447#true} is VALID [2022-04-08 12:22:17,775 INFO L290 TraceCheckUtils]: 72: Hoare triple {16447#true} assume !(0 == ~cond); {16447#true} is VALID [2022-04-08 12:22:17,775 INFO L290 TraceCheckUtils]: 73: Hoare triple {16447#true} assume true; {16447#true} is VALID [2022-04-08 12:22:17,775 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {16447#true} {16533#(and (= main_~r~0 0) (<= 1 main_~p~0) (= main_~a~0 main_~x~0))} #76#return; {16533#(and (= main_~r~0 0) (<= 1 main_~p~0) (= main_~a~0 main_~x~0))} is VALID [2022-04-08 12:22:17,775 INFO L272 TraceCheckUtils]: 75: Hoare triple {16533#(and (= main_~r~0 0) (<= 1 main_~p~0) (= main_~a~0 main_~x~0))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {16447#true} is VALID [2022-04-08 12:22:17,776 INFO L290 TraceCheckUtils]: 76: Hoare triple {16447#true} ~cond := #in~cond; {16681#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 12:22:17,776 INFO L290 TraceCheckUtils]: 77: Hoare triple {16681#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {16685#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 12:22:17,776 INFO L290 TraceCheckUtils]: 78: Hoare triple {16685#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {16685#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 12:22:17,777 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {16685#(not (= |__VERIFIER_assert_#in~cond| 0))} {16533#(and (= main_~r~0 0) (<= 1 main_~p~0) (= main_~a~0 main_~x~0))} #78#return; {16692#(and (= main_~r~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (<= 1 main_~p~0) (= main_~a~0 main_~x~0))} is VALID [2022-04-08 12:22:17,777 INFO L290 TraceCheckUtils]: 80: Hoare triple {16692#(and (= main_~r~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (<= 1 main_~p~0) (= main_~a~0 main_~x~0))} assume !!(~a~0 != ~b~0); {16692#(and (= main_~r~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (<= 1 main_~p~0) (= main_~a~0 main_~x~0))} is VALID [2022-04-08 12:22:17,779 INFO L290 TraceCheckUtils]: 81: Hoare triple {16692#(and (= main_~r~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (<= 1 main_~p~0) (= main_~a~0 main_~x~0))} assume ~a~0 > ~b~0;~a~0 := ~a~0 - ~b~0;~p~0 := ~p~0 - ~q~0;~r~0 := ~r~0 - ~s~0; {16699#(and (= (+ (* main_~q~0 main_~x~0) main_~a~0 (* main_~y~0 main_~s~0)) main_~x~0) (= main_~r~0 (* (- 1) main_~s~0)) (<= 1 (+ main_~q~0 main_~p~0)))} is VALID [2022-04-08 12:22:17,779 INFO L290 TraceCheckUtils]: 82: Hoare triple {16699#(and (= (+ (* main_~q~0 main_~x~0) main_~a~0 (* main_~y~0 main_~s~0)) main_~x~0) (= main_~r~0 (* (- 1) main_~s~0)) (<= 1 (+ main_~q~0 main_~p~0)))} assume !false; {16699#(and (= (+ (* main_~q~0 main_~x~0) main_~a~0 (* main_~y~0 main_~s~0)) main_~x~0) (= main_~r~0 (* (- 1) main_~s~0)) (<= 1 (+ main_~q~0 main_~p~0)))} is VALID [2022-04-08 12:22:17,779 INFO L272 TraceCheckUtils]: 83: Hoare triple {16699#(and (= (+ (* main_~q~0 main_~x~0) main_~a~0 (* main_~y~0 main_~s~0)) main_~x~0) (= main_~r~0 (* (- 1) main_~s~0)) (<= 1 (+ main_~q~0 main_~p~0)))} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {16447#true} is VALID [2022-04-08 12:22:17,779 INFO L290 TraceCheckUtils]: 84: Hoare triple {16447#true} ~cond := #in~cond; {16681#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 12:22:17,780 INFO L290 TraceCheckUtils]: 85: Hoare triple {16681#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {16685#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 12:22:17,780 INFO L290 TraceCheckUtils]: 86: Hoare triple {16685#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {16685#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 12:22:19,782 WARN L284 TraceCheckUtils]: 87: Hoare quadruple {16685#(not (= |__VERIFIER_assert_#in~cond| 0))} {16699#(and (= (+ (* main_~q~0 main_~x~0) main_~a~0 (* main_~y~0 main_~s~0)) main_~x~0) (= main_~r~0 (* (- 1) main_~s~0)) (<= 1 (+ main_~q~0 main_~p~0)))} #74#return; {16718#(or (and (<= 1 (+ (div (+ (* (- 1) main_~a~0) (* main_~y~0 main_~r~0) main_~x~0) main_~x~0) main_~p~0)) (= (mod (+ (* (- 1) main_~a~0) (* main_~y~0 main_~r~0) main_~x~0) main_~x~0) 0) (= (* main_~p~0 (* (- 1) main_~r~0)) (+ (* (div (+ (* (- 1) main_~a~0) (* main_~y~0 main_~r~0) main_~x~0) main_~x~0) main_~r~0) 1)) (not (= main_~x~0 0))) (and (= main_~x~0 0) (not (= main_~r~0 0)) (= (+ (* (- 1) main_~a~0) (* main_~y~0 main_~r~0) main_~x~0) 0) (<= 1 (+ main_~p~0 (div (+ (- 1) (* (- 1) main_~p~0 main_~r~0)) main_~r~0))) (= (mod (+ (- 1) (* (- 1) main_~p~0 main_~r~0)) main_~r~0) 0)))} is UNKNOWN [2022-04-08 12:22:19,801 INFO L272 TraceCheckUtils]: 88: Hoare triple {16718#(or (and (<= 1 (+ (div (+ (* (- 1) main_~a~0) (* main_~y~0 main_~r~0) main_~x~0) main_~x~0) main_~p~0)) (= (mod (+ (* (- 1) main_~a~0) (* main_~y~0 main_~r~0) main_~x~0) main_~x~0) 0) (= (* main_~p~0 (* (- 1) main_~r~0)) (+ (* (div (+ (* (- 1) main_~a~0) (* main_~y~0 main_~r~0) main_~x~0) main_~x~0) main_~r~0) 1)) (not (= main_~x~0 0))) (and (= main_~x~0 0) (not (= main_~r~0 0)) (= (+ (* (- 1) main_~a~0) (* main_~y~0 main_~r~0) main_~x~0) 0) (<= 1 (+ main_~p~0 (div (+ (- 1) (* (- 1) main_~p~0 main_~r~0)) main_~r~0))) (= (mod (+ (- 1) (* (- 1) main_~p~0 main_~r~0)) main_~r~0) 0)))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {16722#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 12:22:19,802 INFO L290 TraceCheckUtils]: 89: Hoare triple {16722#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {16726#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 12:22:19,802 INFO L290 TraceCheckUtils]: 90: Hoare triple {16726#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {16448#false} is VALID [2022-04-08 12:22:19,802 INFO L290 TraceCheckUtils]: 91: Hoare triple {16448#false} assume !false; {16448#false} is VALID [2022-04-08 12:22:19,802 INFO L134 CoverageAnalysis]: Checked inductivity of 251 backedges. 70 proven. 11 refuted. 0 times theorem prover too weak. 170 trivial. 0 not checked. [2022-04-08 12:22:19,803 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 12:23:38,556 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-08 12:25:30,524 WARN L855 $PredicateComparison]: unable to prove that (forall ((v_main_~r~0_BEFORE_CALL_133 Int) (v_main_~q~0_BEFORE_CALL_132 Int) (v_main_~p~0_BEFORE_CALL_136 Int) (v_main_~s~0_BEFORE_CALL_132 Int)) (or (not (= (+ (* (+ (* (- 1) v_main_~s~0_BEFORE_CALL_132) v_main_~r~0_BEFORE_CALL_133) v_main_~q~0_BEFORE_CALL_132) 1) (* (+ v_main_~p~0_BEFORE_CALL_136 (* (- 1) v_main_~q~0_BEFORE_CALL_132)) v_main_~s~0_BEFORE_CALL_132))) (and (not (= |c___VERIFIER_assert_#in~cond| 0)) (let ((.cse0 (+ (* v_main_~r~0_BEFORE_CALL_133 v_main_~q~0_BEFORE_CALL_132) 1))) (or (= .cse0 0) (not (= |c___VERIFIER_assert_#in~cond| 1)) (= (mod .cse0 v_main_~p~0_BEFORE_CALL_136) 0)))))) is different from true [2022-04-08 12:27:09,756 WARN L232 SmtUtils]: Spent 6.45s on a formula simplification that was a NOOP. DAG size: 7 (called from [L1067] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-04-08 12:27:19,778 WARN L855 $PredicateComparison]: unable to prove that (or (forall ((v_main_~r~0_BEFORE_CALL_133 Int) (v_main_~q~0_BEFORE_CALL_132 Int) (v_main_~p~0_BEFORE_CALL_136 Int) (v_main_~s~0_BEFORE_CALL_132 Int)) (or (not (= (+ (* (+ (* (- 1) v_main_~s~0_BEFORE_CALL_132) v_main_~r~0_BEFORE_CALL_133) v_main_~q~0_BEFORE_CALL_132) 1) (* (+ v_main_~p~0_BEFORE_CALL_136 (* (- 1) v_main_~q~0_BEFORE_CALL_132)) v_main_~s~0_BEFORE_CALL_132))) (and (not (= |c___VERIFIER_assert_#in~cond| 0)) (let ((.cse0 (+ (* v_main_~r~0_BEFORE_CALL_133 v_main_~q~0_BEFORE_CALL_132) 1))) (or (= .cse0 0) (not (= |c___VERIFIER_assert_#in~cond| 1)) (= (mod .cse0 v_main_~p~0_BEFORE_CALL_136) 0)))))) (= c___VERIFIER_assert_~cond 0)) is different from true [2022-04-08 12:27:57,980 WARN L855 $PredicateComparison]: unable to prove that (or (not (= |c___VERIFIER_assert_#in~cond| 1)) (forall ((v_main_~r~0_BEFORE_CALL_133 Int) (v_main_~q~0_BEFORE_CALL_132 Int) (v_main_~p~0_BEFORE_CALL_136 Int) (v_main_~s~0_BEFORE_CALL_132 Int)) (let ((.cse0 (+ (* v_main_~r~0_BEFORE_CALL_133 v_main_~q~0_BEFORE_CALL_132) 1))) (or (= .cse0 0) (not (= (+ (* (+ (* (- 1) v_main_~s~0_BEFORE_CALL_132) v_main_~r~0_BEFORE_CALL_133) v_main_~q~0_BEFORE_CALL_132) 1) (* (+ v_main_~p~0_BEFORE_CALL_136 (* (- 1) v_main_~q~0_BEFORE_CALL_132)) v_main_~s~0_BEFORE_CALL_132))) (= (mod .cse0 v_main_~p~0_BEFORE_CALL_136) 0))))) is different from true