/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf -i ../../../trunk/examples/svcomp/nla-digbench-scaling/egcd-ll_valuebound10.c
--------------------------------------------------------------------------------
This is Ultimate 0.2.2-dev-e106359-m
[2022-04-15 08:29:33,335 INFO L177 SettingsManager]: Resetting all preferences to default values...
[2022-04-15 08:29:33,336 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values
[2022-04-15 08:29:33,376 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2022-04-15 08:29:33,377 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2022-04-15 08:29:33,378 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2022-04-15 08:29:33,381 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2022-04-15 08:29:33,383 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values
[2022-04-15 08:29:33,384 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values
[2022-04-15 08:29:33,389 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values
[2022-04-15 08:29:33,389 INFO L181 SettingsManager]: Resetting Sifa preferences to default values
[2022-04-15 08:29:33,390 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2022-04-15 08:29:33,390 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values
[2022-04-15 08:29:33,392 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values
[2022-04-15 08:29:33,392 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2022-04-15 08:29:33,395 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values
[2022-04-15 08:29:33,396 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2022-04-15 08:29:33,396 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2022-04-15 08:29:33,397 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2022-04-15 08:29:33,398 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values
[2022-04-15 08:29:33,398 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values
[2022-04-15 08:29:33,400 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2022-04-15 08:29:33,401 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values
[2022-04-15 08:29:33,402 INFO L181 SettingsManager]: Resetting Referee preferences to default values
[2022-04-15 08:29:33,403 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values
[2022-04-15 08:29:33,408 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2022-04-15 08:29:33,408 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2022-04-15 08:29:33,408 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values
[2022-04-15 08:29:33,409 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values
[2022-04-15 08:29:33,409 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values
[2022-04-15 08:29:33,410 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring...
[2022-04-15 08:29:33,410 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values
[2022-04-15 08:29:33,411 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values
[2022-04-15 08:29:33,412 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values
[2022-04-15 08:29:33,412 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values
[2022-04-15 08:29:33,413 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2022-04-15 08:29:33,413 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values
[2022-04-15 08:29:33,413 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2022-04-15 08:29:33,413 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring...
[2022-04-15 08:29:33,413 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values
[2022-04-15 08:29:33,414 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values
[2022-04-15 08:29:33,415 INFO L188 SettingsManager]: Finished resetting all preferences to default values...
[2022-04-15 08:29:33,415 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf
[2022-04-15 08:29:33,426 INFO L113 SettingsManager]: Loading preferences was successful
[2022-04-15 08:29:33,426 INFO L115 SettingsManager]: Preferences different from defaults after loading the file:
[2022-04-15 08:29:33,427 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2022-04-15 08:29:33,427 INFO L138 SettingsManager]: * sizeof long=4
[2022-04-15 08:29:33,427 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true
[2022-04-15 08:29:33,428 INFO L138 SettingsManager]: * sizeof POINTER=4
[2022-04-15 08:29:33,428 INFO L138 SettingsManager]: * Check division by zero=IGNORE
[2022-04-15 08:29:33,428 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE
[2022-04-15 08:29:33,428 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE
[2022-04-15 08:29:33,428 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE
[2022-04-15 08:29:33,429 INFO L138 SettingsManager]: * sizeof long double=12
[2022-04-15 08:29:33,429 INFO L138 SettingsManager]: * Check if freed pointer was valid=false
[2022-04-15 08:29:33,429 INFO L138 SettingsManager]: * Use constant arrays=true
[2022-04-15 08:29:33,429 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE
[2022-04-15 08:29:33,429 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2022-04-15 08:29:33,429 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements
[2022-04-15 08:29:33,429 INFO L138 SettingsManager]: * To the following directory=./dump/
[2022-04-15 08:29:33,429 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode
[2022-04-15 08:29:33,429 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2022-04-15 08:29:33,429 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2022-04-15 08:29:33,429 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation
[2022-04-15 08:29:33,430 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION
[2022-04-15 08:29:33,430 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL
[2022-04-15 08:29:33,430 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2022-04-15 08:29:33,430 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN
[2022-04-15 08:29:33,430 INFO L138 SettingsManager]: * Use separate solver for trace checks=false
WARNING: An illegal reflective access operation has occurred
WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int)
WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1
WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations
WARNING: All illegal access operations will be denied in a future release
Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN;
[2022-04-15 08:29:33,594 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp
[2022-04-15 08:29:33,611 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2022-04-15 08:29:33,613 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2022-04-15 08:29:33,613 INFO L271 PluginConnector]: Initializing CDTParser...
[2022-04-15 08:29:33,616 INFO L275 PluginConnector]: CDTParser initialized
[2022-04-15 08:29:33,617 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/egcd-ll_valuebound10.c
[2022-04-15 08:29:33,681 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5fa73c5cf/d16788cb639244a9a5cb704200b1641b/FLAGc589ad04b
[2022-04-15 08:29:34,051 INFO L306 CDTParser]: Found 1 translation units.
[2022-04-15 08:29:34,051 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/egcd-ll_valuebound10.c
[2022-04-15 08:29:34,057 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5fa73c5cf/d16788cb639244a9a5cb704200b1641b/FLAGc589ad04b
[2022-04-15 08:29:34,065 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5fa73c5cf/d16788cb639244a9a5cb704200b1641b
[2022-04-15 08:29:34,067 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2022-04-15 08:29:34,068 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements.
[2022-04-15 08:29:34,069 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2022-04-15 08:29:34,069 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator...
[2022-04-15 08:29:34,071 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized
[2022-04-15 08:29:34,072 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 08:29:34" (1/1) ...
[2022-04-15 08:29:34,073 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7512054e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 08:29:34, skipping insertion in model container
[2022-04-15 08:29:34,073 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 08:29:34" (1/1) ...
[2022-04-15 08:29:34,077 INFO L145 MainTranslator]: Starting translation in SV-COMP mode
[2022-04-15 08:29:34,086 INFO L178 MainTranslator]: Built tables and reachable declarations
[2022-04-15 08:29:34,192 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_valuebound10.c[489,502]
[2022-04-15 08:29:34,210 INFO L210 PostProcessor]: Analyzing one entry point: main
[2022-04-15 08:29:34,216 INFO L203 MainTranslator]: Completed pre-run
[2022-04-15 08:29:34,225 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_valuebound10.c[489,502]
[2022-04-15 08:29:34,231 INFO L210 PostProcessor]: Analyzing one entry point: main
[2022-04-15 08:29:34,240 INFO L208 MainTranslator]: Completed translation
[2022-04-15 08:29:34,240 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 08:29:34 WrapperNode
[2022-04-15 08:29:34,240 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2022-04-15 08:29:34,241 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2022-04-15 08:29:34,241 INFO L271 PluginConnector]: Initializing Boogie Preprocessor...
[2022-04-15 08:29:34,241 INFO L275 PluginConnector]: Boogie Preprocessor initialized
[2022-04-15 08:29:34,248 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 08:29:34" (1/1) ...
[2022-04-15 08:29:34,248 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 08:29:34" (1/1) ...
[2022-04-15 08:29:34,252 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 08:29:34" (1/1) ...
[2022-04-15 08:29:34,253 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 08:29:34" (1/1) ...
[2022-04-15 08:29:34,257 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 08:29:34" (1/1) ...
[2022-04-15 08:29:34,261 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 08:29:34" (1/1) ...
[2022-04-15 08:29:34,264 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 08:29:34" (1/1) ...
[2022-04-15 08:29:34,265 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2022-04-15 08:29:34,266 INFO L113 PluginConnector]: ------------------------RCFGBuilder----------------------------
[2022-04-15 08:29:34,266 INFO L271 PluginConnector]: Initializing RCFGBuilder...
[2022-04-15 08:29:34,266 INFO L275 PluginConnector]: RCFGBuilder initialized
[2022-04-15 08:29:34,267 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 08:29:34" (1/1) ...
[2022-04-15 08:29:34,272 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2022-04-15 08:29:34,278 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-04-15 08:29:34,287 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null)
[2022-04-15 08:29:34,289 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process
[2022-04-15 08:29:34,311 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init
[2022-04-15 08:29:34,311 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2022-04-15 08:29:34,311 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error
[2022-04-15 08:29:34,311 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not
[2022-04-15 08:29:34,311 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert
[2022-04-15 08:29:34,311 INFO L138 BoogieDeclarations]: Found implementation of procedure main
[2022-04-15 08:29:34,311 INFO L130 BoogieDeclarations]: Found specification of procedure abort
[2022-04-15 08:29:34,311 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail
[2022-04-15 08:29:34,311 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error
[2022-04-15 08:29:34,312 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2022-04-15 08:29:34,312 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int
[2022-04-15 08:29:34,312 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not
[2022-04-15 08:29:34,312 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert
[2022-04-15 08:29:34,312 INFO L130 BoogieDeclarations]: Found specification of procedure main
[2022-04-15 08:29:34,312 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init
[2022-04-15 08:29:34,312 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int
[2022-04-15 08:29:34,312 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2022-04-15 08:29:34,312 INFO L130 BoogieDeclarations]: Found specification of procedure write~int
[2022-04-15 08:29:34,312 INFO L130 BoogieDeclarations]: Found specification of procedure read~int
[2022-04-15 08:29:34,313 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2022-04-15 08:29:34,353 INFO L234 CfgBuilder]: Building ICFG
[2022-04-15 08:29:34,355 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation
[2022-04-15 08:29:34,549 INFO L275 CfgBuilder]: Performing block encoding
[2022-04-15 08:29:34,555 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2022-04-15 08:29:34,555 INFO L299 CfgBuilder]: Removed 1 assume(true) statements.
[2022-04-15 08:29:34,556 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 08:29:34 BoogieIcfgContainer
[2022-04-15 08:29:34,556 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2022-04-15 08:29:34,558 INFO L113 PluginConnector]: ------------------------TraceAbstraction----------------------------
[2022-04-15 08:29:34,558 INFO L271 PluginConnector]: Initializing TraceAbstraction...
[2022-04-15 08:29:34,570 INFO L275 PluginConnector]: TraceAbstraction initialized
[2022-04-15 08:29:34,571 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.04 08:29:34" (1/3) ...
[2022-04-15 08:29:34,571 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29f0d262 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 08:29:34, skipping insertion in model container
[2022-04-15 08:29:34,571 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 08:29:34" (2/3) ...
[2022-04-15 08:29:34,572 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29f0d262 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 08:29:34, skipping insertion in model container
[2022-04-15 08:29:34,572 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 08:29:34" (3/3) ...
[2022-04-15 08:29:34,572 INFO L111 eAbstractionObserver]: Analyzing ICFG egcd-ll_valuebound10.c
[2022-04-15 08:29:34,576 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION
[2022-04-15 08:29:34,576 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations.
[2022-04-15 08:29:34,633 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2022-04-15 08:29:34,637 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP
[2022-04-15 08:29:34,637 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2022-04-15 08:29:34,661 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-15 08:29:34,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34
[2022-04-15 08:29:34,668 INFO L491 BasicCegarLoop]: Found error trace
[2022-04-15 08:29:34,668 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-15 08:29:34,669 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-04-15 08:29:34,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-04-15 08:29:34,676 INFO L85 PathProgramCache]: Analyzing trace with hash 870870740, now seen corresponding path program 1 times
[2022-04-15 08:29:34,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION
[2022-04-15 08:29:34,683 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [90629688]
[2022-04-15 08:29:34,694 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation
[2022-04-15 08:29:34,694 INFO L85 PathProgramCache]: Analyzing trace with hash 870870740, now seen corresponding path program 2 times
[2022-04-15 08:29:34,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-04-15 08:29:34,698 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2111695312]
[2022-04-15 08:29:34,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-15 08:29:34,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-15 08:29:34,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-15 08:29:34,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2022-04-15 08:29:34,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-15 08:29:34,887 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-15 08:29:34,887 INFO L290 TraceCheckUtils]: 1: Hoare triple {40#true} assume true; {40#true} is VALID
[2022-04-15 08:29:34,888 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {40#true} {40#true} #88#return; {40#true} is VALID
[2022-04-15 08:29:34,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6
[2022-04-15 08:29:34,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-15 08:29:34,907 INFO L290 TraceCheckUtils]: 0: Hoare triple {40#true} ~cond := #in~cond; {40#true} is VALID
[2022-04-15 08:29:34,908 INFO L290 TraceCheckUtils]: 1: Hoare triple {40#true} assume 0 == ~cond;assume false; {41#false} is VALID
[2022-04-15 08:29:34,908 INFO L290 TraceCheckUtils]: 2: Hoare triple {41#false} assume true; {41#false} is VALID
[2022-04-15 08:29:34,908 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {41#false} {40#true} #66#return; {41#false} is VALID
[2022-04-15 08:29:34,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12
[2022-04-15 08:29:34,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-15 08:29:34,914 INFO L290 TraceCheckUtils]: 0: Hoare triple {40#true} ~cond := #in~cond; {40#true} is VALID
[2022-04-15 08:29:34,915 INFO L290 TraceCheckUtils]: 1: Hoare triple {40#true} assume 0 == ~cond;assume false; {41#false} is VALID
[2022-04-15 08:29:34,915 INFO L290 TraceCheckUtils]: 2: Hoare triple {41#false} assume true; {41#false} is VALID
[2022-04-15 08:29:34,915 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {41#false} {41#false} #68#return; {41#false} is VALID
[2022-04-15 08:29:34,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17
[2022-04-15 08:29:34,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-15 08:29:34,921 INFO L290 TraceCheckUtils]: 0: Hoare triple {40#true} ~cond := #in~cond; {40#true} is VALID
[2022-04-15 08:29:34,921 INFO L290 TraceCheckUtils]: 1: Hoare triple {40#true} assume 0 == ~cond;assume false; {41#false} is VALID
[2022-04-15 08:29:34,922 INFO L290 TraceCheckUtils]: 2: Hoare triple {41#false} assume true; {41#false} is VALID
[2022-04-15 08:29:34,922 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {41#false} {41#false} #70#return; {41#false} is VALID
[2022-04-15 08:29:34,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22
[2022-04-15 08:29:34,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-15 08:29:34,930 INFO L290 TraceCheckUtils]: 0: Hoare triple {40#true} ~cond := #in~cond; {40#true} is VALID
[2022-04-15 08:29:34,931 INFO L290 TraceCheckUtils]: 1: Hoare triple {40#true} assume 0 == ~cond;assume false; {41#false} is VALID
[2022-04-15 08:29:34,931 INFO L290 TraceCheckUtils]: 2: Hoare triple {41#false} assume true; {41#false} is VALID
[2022-04-15 08:29:34,931 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {41#false} {41#false} #72#return; {41#false} is VALID
[2022-04-15 08:29:34,933 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-15 08:29:34,934 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-15 08:29:34,934 INFO L290 TraceCheckUtils]: 2: Hoare triple {40#true} assume true; {40#true} is VALID
[2022-04-15 08:29:34,934 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {40#true} {40#true} #88#return; {40#true} is VALID
[2022-04-15 08:29:34,934 INFO L272 TraceCheckUtils]: 4: Hoare triple {40#true} call #t~ret6 := main(); {40#true} is VALID
[2022-04-15 08:29:34,934 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-15 08:29:34,934 INFO L272 TraceCheckUtils]: 6: Hoare triple {40#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 10 then 1 else 0)); {40#true} is VALID
[2022-04-15 08:29:34,935 INFO L290 TraceCheckUtils]: 7: Hoare triple {40#true} ~cond := #in~cond; {40#true} is VALID
[2022-04-15 08:29:34,935 INFO L290 TraceCheckUtils]: 8: Hoare triple {40#true} assume 0 == ~cond;assume false; {41#false} is VALID
[2022-04-15 08:29:34,936 INFO L290 TraceCheckUtils]: 9: Hoare triple {41#false} assume true; {41#false} is VALID
[2022-04-15 08:29:34,936 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {41#false} {40#true} #66#return; {41#false} is VALID
[2022-04-15 08:29:34,936 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-15 08:29:34,936 INFO L272 TraceCheckUtils]: 12: Hoare triple {41#false} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 10 then 1 else 0)); {40#true} is VALID
[2022-04-15 08:29:34,936 INFO L290 TraceCheckUtils]: 13: Hoare triple {40#true} ~cond := #in~cond; {40#true} is VALID
[2022-04-15 08:29:34,937 INFO L290 TraceCheckUtils]: 14: Hoare triple {40#true} assume 0 == ~cond;assume false; {41#false} is VALID
[2022-04-15 08:29:34,937 INFO L290 TraceCheckUtils]: 15: Hoare triple {41#false} assume true; {41#false} is VALID
[2022-04-15 08:29:34,938 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {41#false} {41#false} #68#return; {41#false} is VALID
[2022-04-15 08:29:34,938 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-15 08:29:34,938 INFO L290 TraceCheckUtils]: 18: Hoare triple {40#true} ~cond := #in~cond; {40#true} is VALID
[2022-04-15 08:29:34,939 INFO L290 TraceCheckUtils]: 19: Hoare triple {40#true} assume 0 == ~cond;assume false; {41#false} is VALID
[2022-04-15 08:29:34,939 INFO L290 TraceCheckUtils]: 20: Hoare triple {41#false} assume true; {41#false} is VALID
[2022-04-15 08:29:34,939 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {41#false} {41#false} #70#return; {41#false} is VALID
[2022-04-15 08:29:34,940 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-15 08:29:34,940 INFO L290 TraceCheckUtils]: 23: Hoare triple {40#true} ~cond := #in~cond; {40#true} is VALID
[2022-04-15 08:29:34,941 INFO L290 TraceCheckUtils]: 24: Hoare triple {40#true} assume 0 == ~cond;assume false; {41#false} is VALID
[2022-04-15 08:29:34,942 INFO L290 TraceCheckUtils]: 25: Hoare triple {41#false} assume true; {41#false} is VALID
[2022-04-15 08:29:34,942 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {41#false} {41#false} #72#return; {41#false} is VALID
[2022-04-15 08:29:34,942 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-15 08:29:34,942 INFO L290 TraceCheckUtils]: 28: Hoare triple {41#false} assume false; {41#false} is VALID
[2022-04-15 08:29:34,944 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-15 08:29:34,945 INFO L290 TraceCheckUtils]: 30: Hoare triple {41#false} ~cond := #in~cond; {41#false} is VALID
[2022-04-15 08:29:34,945 INFO L290 TraceCheckUtils]: 31: Hoare triple {41#false} assume 0 == ~cond; {41#false} is VALID
[2022-04-15 08:29:34,945 INFO L290 TraceCheckUtils]: 32: Hoare triple {41#false} assume !false; {41#false} is VALID
[2022-04-15 08:29:34,945 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-15 08:29:34,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-04-15 08:29:34,946 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2111695312]
[2022-04-15 08:29:34,946 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2111695312] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-15 08:29:34,947 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-15 08:29:34,947 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2022-04-15 08:29:34,949 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace
[2022-04-15 08:29:34,949 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [90629688]
[2022-04-15 08:29:34,949 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [90629688] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-15 08:29:34,949 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-15 08:29:34,949 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2022-04-15 08:29:34,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [656286981]
[2022-04-15 08:29:34,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-04-15 08:29:34,956 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-15 08:29:34,958 INFO L84 Accepts]: Finished accepts. word is accepted.
[2022-04-15 08:29:34,960 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-15 08:29:34,996 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-15 08:29:34,996 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2022-04-15 08:29:34,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION
[2022-04-15 08:29:35,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2022-04-15 08:29:35,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2022-04-15 08:29:35,016 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-15 08:29:35,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-15 08:29:35,186 INFO L93 Difference]: Finished difference Result 67 states and 105 transitions.
[2022-04-15 08:29:35,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2022-04-15 08:29:35,187 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-15 08:29:35,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-04-15 08:29:35,188 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-15 08:29:35,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 105 transitions.
[2022-04-15 08:29:35,201 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-15 08:29:35,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 105 transitions.
[2022-04-15 08:29:35,206 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 105 transitions.
[2022-04-15 08:29:35,314 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-15 08:29:35,327 INFO L225 Difference]: With dead ends: 67
[2022-04-15 08:29:35,327 INFO L226 Difference]: Without dead ends: 32
[2022-04-15 08:29:35,330 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-15 08:29:35,335 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-15 08:29:35,337 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-15 08:29:35,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states.
[2022-04-15 08:29:35,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32.
[2022-04-15 08:29:35,359 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2022-04-15 08:29:35,359 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-15 08:29:35,360 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-15 08:29:35,360 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-15 08:29:35,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-15 08:29:35,363 INFO L93 Difference]: Finished difference Result 32 states and 42 transitions.
[2022-04-15 08:29:35,363 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 42 transitions.
[2022-04-15 08:29:35,364 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-15 08:29:35,364 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-15 08:29:35,364 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-15 08:29:35,365 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-15 08:29:35,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-15 08:29:35,367 INFO L93 Difference]: Finished difference Result 32 states and 42 transitions.
[2022-04-15 08:29:35,367 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 42 transitions.
[2022-04-15 08:29:35,368 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-15 08:29:35,368 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-15 08:29:35,368 INFO L88 GeneralOperation]: Finished isEquivalent.
[2022-04-15 08:29:35,368 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2022-04-15 08:29:35,369 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-15 08:29:35,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 42 transitions.
[2022-04-15 08:29:35,372 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 42 transitions. Word has length 33
[2022-04-15 08:29:35,372 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-04-15 08:29:35,372 INFO L478 AbstractCegarLoop]: Abstraction has 32 states and 42 transitions.
[2022-04-15 08:29:35,372 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-15 08:29:35,372 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 32 states and 42 transitions.
[2022-04-15 08:29:35,416 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-15 08:29:35,416 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 42 transitions.
[2022-04-15 08:29:35,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34
[2022-04-15 08:29:35,418 INFO L491 BasicCegarLoop]: Found error trace
[2022-04-15 08:29:35,418 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-15 08:29:35,418 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2022-04-15 08:29:35,419 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-04-15 08:29:35,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-04-15 08:29:35,420 INFO L85 PathProgramCache]: Analyzing trace with hash -1006914976, now seen corresponding path program 1 times
[2022-04-15 08:29:35,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION
[2022-04-15 08:29:35,420 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [495677460]
[2022-04-15 08:29:35,421 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation
[2022-04-15 08:29:35,421 INFO L85 PathProgramCache]: Analyzing trace with hash -1006914976, now seen corresponding path program 2 times
[2022-04-15 08:29:35,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-04-15 08:29:35,422 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1767508285]
[2022-04-15 08:29:35,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-15 08:29:35,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-15 08:29:35,443 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic
[2022-04-15 08:29:35,443 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1027407051]
[2022-04-15 08:29:35,443 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2022-04-15 08:29:35,443 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-04-15 08:29:35,444 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-04-15 08:29:35,445 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2022-04-15 08:29:35,470 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process
[2022-04-15 08:29:35,508 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s)
[2022-04-15 08:29:35,509 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat
[2022-04-15 08:29:35,510 INFO L263 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 9 conjunts are in the unsatisfiable core
[2022-04-15 08:29:35,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-15 08:29:35,522 INFO L286 TraceCheckSpWp]: Computing forward predicates...
[2022-04-15 08:29:35,717 INFO L272 TraceCheckUtils]: 0: Hoare triple {326#true} call ULTIMATE.init(); {326#true} is VALID
[2022-04-15 08:29:35,718 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-15 08:29:35,718 INFO L290 TraceCheckUtils]: 2: Hoare triple {326#true} assume true; {326#true} is VALID
[2022-04-15 08:29:35,719 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {326#true} {326#true} #88#return; {326#true} is VALID
[2022-04-15 08:29:35,720 INFO L272 TraceCheckUtils]: 4: Hoare triple {326#true} call #t~ret6 := main(); {326#true} is VALID
[2022-04-15 08:29:35,720 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-15 08:29:35,720 INFO L272 TraceCheckUtils]: 6: Hoare triple {326#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 10 then 1 else 0)); {326#true} is VALID
[2022-04-15 08:29:35,720 INFO L290 TraceCheckUtils]: 7: Hoare triple {326#true} ~cond := #in~cond; {326#true} is VALID
[2022-04-15 08:29:35,720 INFO L290 TraceCheckUtils]: 8: Hoare triple {326#true} assume !(0 == ~cond); {326#true} is VALID
[2022-04-15 08:29:35,720 INFO L290 TraceCheckUtils]: 9: Hoare triple {326#true} assume true; {326#true} is VALID
[2022-04-15 08:29:35,721 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {326#true} {326#true} #66#return; {326#true} is VALID
[2022-04-15 08:29:35,721 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-15 08:29:35,721 INFO L272 TraceCheckUtils]: 12: Hoare triple {326#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 10 then 1 else 0)); {326#true} is VALID
[2022-04-15 08:29:35,721 INFO L290 TraceCheckUtils]: 13: Hoare triple {326#true} ~cond := #in~cond; {326#true} is VALID
[2022-04-15 08:29:35,721 INFO L290 TraceCheckUtils]: 14: Hoare triple {326#true} assume !(0 == ~cond); {326#true} is VALID
[2022-04-15 08:29:35,721 INFO L290 TraceCheckUtils]: 15: Hoare triple {326#true} assume true; {326#true} is VALID
[2022-04-15 08:29:35,721 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {326#true} {326#true} #68#return; {326#true} is VALID
[2022-04-15 08:29:35,721 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-15 08:29:35,722 INFO L290 TraceCheckUtils]: 18: Hoare triple {326#true} ~cond := #in~cond; {326#true} is VALID
[2022-04-15 08:29:35,722 INFO L290 TraceCheckUtils]: 19: Hoare triple {326#true} assume !(0 == ~cond); {326#true} is VALID
[2022-04-15 08:29:35,722 INFO L290 TraceCheckUtils]: 20: Hoare triple {326#true} assume true; {326#true} is VALID
[2022-04-15 08:29:35,722 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {326#true} {326#true} #70#return; {326#true} is VALID
[2022-04-15 08:29:35,722 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-15 08:29:35,722 INFO L290 TraceCheckUtils]: 23: Hoare triple {326#true} ~cond := #in~cond; {326#true} is VALID
[2022-04-15 08:29:35,722 INFO L290 TraceCheckUtils]: 24: Hoare triple {326#true} assume !(0 == ~cond); {326#true} is VALID
[2022-04-15 08:29:35,723 INFO L290 TraceCheckUtils]: 25: Hoare triple {326#true} assume true; {326#true} is VALID
[2022-04-15 08:29:35,723 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {326#true} {326#true} #72#return; {326#true} is VALID
[2022-04-15 08:29:35,724 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-15 08:29:35,724 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-15 08:29:35,725 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-15 08:29:35,726 INFO L290 TraceCheckUtils]: 30: Hoare triple {419#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {423#(<= 1 __VERIFIER_assert_~cond)} is VALID
[2022-04-15 08:29:35,726 INFO L290 TraceCheckUtils]: 31: Hoare triple {423#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {327#false} is VALID
[2022-04-15 08:29:35,726 INFO L290 TraceCheckUtils]: 32: Hoare triple {327#false} assume !false; {327#false} is VALID
[2022-04-15 08:29:35,726 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-15 08:29:35,727 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2022-04-15 08:29:35,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-04-15 08:29:35,727 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1767508285]
[2022-04-15 08:29:35,727 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT
[2022-04-15 08:29:35,727 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1027407051]
[2022-04-15 08:29:35,728 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1027407051] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-15 08:29:35,728 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-15 08:29:35,728 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2022-04-15 08:29:35,729 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace
[2022-04-15 08:29:35,729 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [495677460]
[2022-04-15 08:29:35,729 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [495677460] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-15 08:29:35,729 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-15 08:29:35,729 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2022-04-15 08:29:35,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690578620]
[2022-04-15 08:29:35,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-04-15 08:29:35,731 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-15 08:29:35,731 INFO L84 Accepts]: Finished accepts. word is accepted.
[2022-04-15 08:29:35,732 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-15 08:29:35,749 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-15 08:29:35,750 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2022-04-15 08:29:35,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION
[2022-04-15 08:29:35,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2022-04-15 08:29:35,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2022-04-15 08:29:35,756 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-15 08:29:35,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-15 08:29:35,972 INFO L93 Difference]: Finished difference Result 48 states and 65 transitions.
[2022-04-15 08:29:35,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2022-04-15 08:29:35,973 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-15 08:29:35,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-04-15 08:29:35,973 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-15 08:29:35,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 65 transitions.
[2022-04-15 08:29:35,975 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-15 08:29:35,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 65 transitions.
[2022-04-15 08:29:35,977 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 65 transitions.
[2022-04-15 08:29:36,032 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-15 08:29:36,034 INFO L225 Difference]: With dead ends: 48
[2022-04-15 08:29:36,034 INFO L226 Difference]: Without dead ends: 46
[2022-04-15 08:29:36,035 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-15 08:29:36,035 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-15 08:29:36,036 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-15 08:29:36,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states.
[2022-04-15 08:29:36,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 45.
[2022-04-15 08:29:36,045 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2022-04-15 08:29:36,045 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-15 08:29:36,045 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-15 08:29:36,046 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-15 08:29:36,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-15 08:29:36,048 INFO L93 Difference]: Finished difference Result 46 states and 63 transitions.
[2022-04-15 08:29:36,049 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 63 transitions.
[2022-04-15 08:29:36,049 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-15 08:29:36,049 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-15 08:29:36,050 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-15 08:29:36,050 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-15 08:29:36,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-15 08:29:36,053 INFO L93 Difference]: Finished difference Result 46 states and 63 transitions.
[2022-04-15 08:29:36,053 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 63 transitions.
[2022-04-15 08:29:36,053 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-15 08:29:36,053 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-15 08:29:36,054 INFO L88 GeneralOperation]: Finished isEquivalent.
[2022-04-15 08:29:36,054 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2022-04-15 08:29:36,054 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-15 08:29:36,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 62 transitions.
[2022-04-15 08:29:36,056 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 62 transitions. Word has length 33
[2022-04-15 08:29:36,056 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-04-15 08:29:36,057 INFO L478 AbstractCegarLoop]: Abstraction has 45 states and 62 transitions.
[2022-04-15 08:29:36,057 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-15 08:29:36,057 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 45 states and 62 transitions.
[2022-04-15 08:29:36,120 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-15 08:29:36,120 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 62 transitions.
[2022-04-15 08:29:36,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39
[2022-04-15 08:29:36,121 INFO L491 BasicCegarLoop]: Found error trace
[2022-04-15 08:29:36,121 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-15 08:29:36,137 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-15 08:29:36,332 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-04-15 08:29:36,333 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-04-15 08:29:36,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-04-15 08:29:36,333 INFO L85 PathProgramCache]: Analyzing trace with hash -124657161, now seen corresponding path program 1 times
[2022-04-15 08:29:36,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION
[2022-04-15 08:29:36,333 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [268273998]
[2022-04-15 08:29:36,334 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation
[2022-04-15 08:29:36,334 INFO L85 PathProgramCache]: Analyzing trace with hash -124657161, now seen corresponding path program 2 times
[2022-04-15 08:29:36,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-04-15 08:29:36,334 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1475679694]
[2022-04-15 08:29:36,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-15 08:29:36,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-15 08:29:36,352 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic
[2022-04-15 08:29:36,353 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [566677006]
[2022-04-15 08:29:36,353 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2022-04-15 08:29:36,353 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-04-15 08:29:36,353 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-04-15 08:29:36,355 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2022-04-15 08:29:36,356 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process
[2022-04-15 08:29:36,391 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2022-04-15 08:29:36,392 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat
[2022-04-15 08:29:36,392 INFO L263 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 9 conjunts are in the unsatisfiable core
[2022-04-15 08:29:36,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-15 08:29:36,401 INFO L286 TraceCheckSpWp]: Computing forward predicates...
[2022-04-15 08:29:36,554 INFO L272 TraceCheckUtils]: 0: Hoare triple {709#true} call ULTIMATE.init(); {709#true} is VALID
[2022-04-15 08:29:36,555 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-15 08:29:36,555 INFO L290 TraceCheckUtils]: 2: Hoare triple {709#true} assume true; {709#true} is VALID
[2022-04-15 08:29:36,555 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {709#true} {709#true} #88#return; {709#true} is VALID
[2022-04-15 08:29:36,555 INFO L272 TraceCheckUtils]: 4: Hoare triple {709#true} call #t~ret6 := main(); {709#true} is VALID
[2022-04-15 08:29:36,555 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-15 08:29:36,555 INFO L272 TraceCheckUtils]: 6: Hoare triple {709#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 10 then 1 else 0)); {709#true} is VALID
[2022-04-15 08:29:36,556 INFO L290 TraceCheckUtils]: 7: Hoare triple {709#true} ~cond := #in~cond; {709#true} is VALID
[2022-04-15 08:29:36,556 INFO L290 TraceCheckUtils]: 8: Hoare triple {709#true} assume !(0 == ~cond); {709#true} is VALID
[2022-04-15 08:29:36,556 INFO L290 TraceCheckUtils]: 9: Hoare triple {709#true} assume true; {709#true} is VALID
[2022-04-15 08:29:36,556 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {709#true} {709#true} #66#return; {709#true} is VALID
[2022-04-15 08:29:36,556 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-15 08:29:36,556 INFO L272 TraceCheckUtils]: 12: Hoare triple {709#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 10 then 1 else 0)); {709#true} is VALID
[2022-04-15 08:29:36,556 INFO L290 TraceCheckUtils]: 13: Hoare triple {709#true} ~cond := #in~cond; {709#true} is VALID
[2022-04-15 08:29:36,556 INFO L290 TraceCheckUtils]: 14: Hoare triple {709#true} assume !(0 == ~cond); {709#true} is VALID
[2022-04-15 08:29:36,557 INFO L290 TraceCheckUtils]: 15: Hoare triple {709#true} assume true; {709#true} is VALID
[2022-04-15 08:29:36,557 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {709#true} {709#true} #68#return; {709#true} is VALID
[2022-04-15 08:29:36,557 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-15 08:29:36,557 INFO L290 TraceCheckUtils]: 18: Hoare triple {709#true} ~cond := #in~cond; {709#true} is VALID
[2022-04-15 08:29:36,557 INFO L290 TraceCheckUtils]: 19: Hoare triple {709#true} assume !(0 == ~cond); {709#true} is VALID
[2022-04-15 08:29:36,557 INFO L290 TraceCheckUtils]: 20: Hoare triple {709#true} assume true; {709#true} is VALID
[2022-04-15 08:29:36,557 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {709#true} {709#true} #70#return; {709#true} is VALID
[2022-04-15 08:29:36,557 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-15 08:29:36,557 INFO L290 TraceCheckUtils]: 23: Hoare triple {709#true} ~cond := #in~cond; {709#true} is VALID
[2022-04-15 08:29:36,558 INFO L290 TraceCheckUtils]: 24: Hoare triple {709#true} assume !(0 == ~cond); {709#true} is VALID
[2022-04-15 08:29:36,558 INFO L290 TraceCheckUtils]: 25: Hoare triple {709#true} assume true; {709#true} is VALID
[2022-04-15 08:29:36,558 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {709#true} {709#true} #72#return; {709#true} is VALID
[2022-04-15 08:29:36,558 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-15 08:29:36,559 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-15 08:29:36,559 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-15 08:29:36,559 INFO L290 TraceCheckUtils]: 30: Hoare triple {709#true} ~cond := #in~cond; {709#true} is VALID
[2022-04-15 08:29:36,559 INFO L290 TraceCheckUtils]: 31: Hoare triple {709#true} assume !(0 == ~cond); {709#true} is VALID
[2022-04-15 08:29:36,559 INFO L290 TraceCheckUtils]: 32: Hoare triple {709#true} assume true; {709#true} is VALID
[2022-04-15 08:29:36,560 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-15 08:29:36,561 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-15 08:29:36,561 INFO L290 TraceCheckUtils]: 35: Hoare triple {817#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {821#(<= 1 __VERIFIER_assert_~cond)} is VALID
[2022-04-15 08:29:36,562 INFO L290 TraceCheckUtils]: 36: Hoare triple {821#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {710#false} is VALID
[2022-04-15 08:29:36,562 INFO L290 TraceCheckUtils]: 37: Hoare triple {710#false} assume !false; {710#false} is VALID
[2022-04-15 08:29:36,562 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-15 08:29:36,562 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2022-04-15 08:29:36,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-04-15 08:29:36,563 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1475679694]
[2022-04-15 08:29:36,563 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT
[2022-04-15 08:29:36,563 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [566677006]
[2022-04-15 08:29:36,563 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [566677006] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-15 08:29:36,563 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-15 08:29:36,563 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2022-04-15 08:29:36,563 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace
[2022-04-15 08:29:36,563 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [268273998]
[2022-04-15 08:29:36,563 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [268273998] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-15 08:29:36,563 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-15 08:29:36,564 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2022-04-15 08:29:36,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [111514890]
[2022-04-15 08:29:36,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-04-15 08:29:36,564 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-15 08:29:36,564 INFO L84 Accepts]: Finished accepts. word is accepted.
[2022-04-15 08:29:36,564 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-15 08:29:36,583 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-15 08:29:36,583 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2022-04-15 08:29:36,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION
[2022-04-15 08:29:36,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2022-04-15 08:29:36,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2022-04-15 08:29:36,584 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-15 08:29:36,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-15 08:29:36,808 INFO L93 Difference]: Finished difference Result 52 states and 68 transitions.
[2022-04-15 08:29:36,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2022-04-15 08:29:36,808 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-15 08:29:36,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-04-15 08:29:36,808 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-15 08:29:36,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 65 transitions.
[2022-04-15 08:29:36,810 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-15 08:29:36,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 65 transitions.
[2022-04-15 08:29:36,812 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 65 transitions.
[2022-04-15 08:29:36,866 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-15 08:29:36,868 INFO L225 Difference]: With dead ends: 52
[2022-04-15 08:29:36,868 INFO L226 Difference]: Without dead ends: 50
[2022-04-15 08:29:36,868 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-15 08:29:36,869 INFO L913 BasicCegarLoop]: 44 mSDtfsCounter, 8 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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.0s IncrementalHoareTripleChecker+Time
[2022-04-15 08:29:36,869 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.0s Time]
[2022-04-15 08:29:36,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states.
[2022-04-15 08:29:36,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 49.
[2022-04-15 08:29:36,882 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2022-04-15 08:29:36,883 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-15 08:29:36,883 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-15 08:29:36,883 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-15 08:29:36,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-15 08:29:36,886 INFO L93 Difference]: Finished difference Result 50 states and 66 transitions.
[2022-04-15 08:29:36,886 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 66 transitions.
[2022-04-15 08:29:36,886 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-15 08:29:36,886 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-15 08:29:36,887 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-15 08:29:36,887 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-15 08:29:36,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-15 08:29:36,889 INFO L93 Difference]: Finished difference Result 50 states and 66 transitions.
[2022-04-15 08:29:36,889 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 66 transitions.
[2022-04-15 08:29:36,889 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-15 08:29:36,890 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-15 08:29:36,890 INFO L88 GeneralOperation]: Finished isEquivalent.
[2022-04-15 08:29:36,890 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2022-04-15 08:29:36,890 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-15 08:29:36,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 65 transitions.
[2022-04-15 08:29:36,892 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 65 transitions. Word has length 38
[2022-04-15 08:29:36,892 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-04-15 08:29:36,892 INFO L478 AbstractCegarLoop]: Abstraction has 49 states and 65 transitions.
[2022-04-15 08:29:36,892 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-15 08:29:36,892 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 49 states and 65 transitions.
[2022-04-15 08:29:36,965 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-15 08:29:36,966 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 65 transitions.
[2022-04-15 08:29:36,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44
[2022-04-15 08:29:36,968 INFO L491 BasicCegarLoop]: Found error trace
[2022-04-15 08:29:36,968 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-15 08:29:36,984 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0
[2022-04-15 08:29:37,169 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2
[2022-04-15 08:29:37,169 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-04-15 08:29:37,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-04-15 08:29:37,170 INFO L85 PathProgramCache]: Analyzing trace with hash 1732898944, now seen corresponding path program 1 times
[2022-04-15 08:29:37,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION
[2022-04-15 08:29:37,170 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [689383395]
[2022-04-15 08:29:37,170 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation
[2022-04-15 08:29:37,170 INFO L85 PathProgramCache]: Analyzing trace with hash 1732898944, now seen corresponding path program 2 times
[2022-04-15 08:29:37,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-04-15 08:29:37,170 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [349026572]
[2022-04-15 08:29:37,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-15 08:29:37,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-15 08:29:37,188 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic
[2022-04-15 08:29:37,189 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [256730031]
[2022-04-15 08:29:37,189 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2022-04-15 08:29:37,189 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-04-15 08:29:37,189 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-04-15 08:29:37,190 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2022-04-15 08:29:37,210 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process
[2022-04-15 08:29:37,237 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2022-04-15 08:29:37,237 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat
[2022-04-15 08:29:37,238 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 9 conjunts are in the unsatisfiable core
[2022-04-15 08:29:37,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-15 08:29:37,262 INFO L286 TraceCheckSpWp]: Computing forward predicates...
[2022-04-15 08:29:37,408 INFO L272 TraceCheckUtils]: 0: Hoare triple {1131#true} call ULTIMATE.init(); {1131#true} is VALID
[2022-04-15 08:29:37,408 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-15 08:29:37,408 INFO L290 TraceCheckUtils]: 2: Hoare triple {1131#true} assume true; {1131#true} is VALID
[2022-04-15 08:29:37,408 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1131#true} {1131#true} #88#return; {1131#true} is VALID
[2022-04-15 08:29:37,409 INFO L272 TraceCheckUtils]: 4: Hoare triple {1131#true} call #t~ret6 := main(); {1131#true} is VALID
[2022-04-15 08:29:37,409 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-15 08:29:37,409 INFO L272 TraceCheckUtils]: 6: Hoare triple {1131#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 10 then 1 else 0)); {1131#true} is VALID
[2022-04-15 08:29:37,420 INFO L290 TraceCheckUtils]: 7: Hoare triple {1131#true} ~cond := #in~cond; {1131#true} is VALID
[2022-04-15 08:29:37,420 INFO L290 TraceCheckUtils]: 8: Hoare triple {1131#true} assume !(0 == ~cond); {1131#true} is VALID
[2022-04-15 08:29:37,420 INFO L290 TraceCheckUtils]: 9: Hoare triple {1131#true} assume true; {1131#true} is VALID
[2022-04-15 08:29:37,421 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1131#true} {1131#true} #66#return; {1131#true} is VALID
[2022-04-15 08:29:37,421 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-15 08:29:37,421 INFO L272 TraceCheckUtils]: 12: Hoare triple {1131#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 10 then 1 else 0)); {1131#true} is VALID
[2022-04-15 08:29:37,421 INFO L290 TraceCheckUtils]: 13: Hoare triple {1131#true} ~cond := #in~cond; {1131#true} is VALID
[2022-04-15 08:29:37,421 INFO L290 TraceCheckUtils]: 14: Hoare triple {1131#true} assume !(0 == ~cond); {1131#true} is VALID
[2022-04-15 08:29:37,421 INFO L290 TraceCheckUtils]: 15: Hoare triple {1131#true} assume true; {1131#true} is VALID
[2022-04-15 08:29:37,421 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {1131#true} {1131#true} #68#return; {1131#true} is VALID
[2022-04-15 08:29:37,421 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-15 08:29:37,422 INFO L290 TraceCheckUtils]: 18: Hoare triple {1131#true} ~cond := #in~cond; {1131#true} is VALID
[2022-04-15 08:29:37,422 INFO L290 TraceCheckUtils]: 19: Hoare triple {1131#true} assume !(0 == ~cond); {1131#true} is VALID
[2022-04-15 08:29:37,422 INFO L290 TraceCheckUtils]: 20: Hoare triple {1131#true} assume true; {1131#true} is VALID
[2022-04-15 08:29:37,422 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {1131#true} {1131#true} #70#return; {1131#true} is VALID
[2022-04-15 08:29:37,422 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-15 08:29:37,422 INFO L290 TraceCheckUtils]: 23: Hoare triple {1131#true} ~cond := #in~cond; {1131#true} is VALID
[2022-04-15 08:29:37,422 INFO L290 TraceCheckUtils]: 24: Hoare triple {1131#true} assume !(0 == ~cond); {1131#true} is VALID
[2022-04-15 08:29:37,422 INFO L290 TraceCheckUtils]: 25: Hoare triple {1131#true} assume true; {1131#true} is VALID
[2022-04-15 08:29:37,422 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {1131#true} {1131#true} #72#return; {1131#true} is VALID
[2022-04-15 08:29:37,423 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-15 08:29:37,424 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-15 08:29:37,424 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-15 08:29:37,424 INFO L290 TraceCheckUtils]: 30: Hoare triple {1131#true} ~cond := #in~cond; {1131#true} is VALID
[2022-04-15 08:29:37,424 INFO L290 TraceCheckUtils]: 31: Hoare triple {1131#true} assume !(0 == ~cond); {1131#true} is VALID
[2022-04-15 08:29:37,424 INFO L290 TraceCheckUtils]: 32: Hoare triple {1131#true} assume true; {1131#true} is VALID
[2022-04-15 08:29:37,425 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-15 08:29:37,425 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-15 08:29:37,425 INFO L290 TraceCheckUtils]: 35: Hoare triple {1131#true} ~cond := #in~cond; {1131#true} is VALID
[2022-04-15 08:29:37,425 INFO L290 TraceCheckUtils]: 36: Hoare triple {1131#true} assume !(0 == ~cond); {1131#true} is VALID
[2022-04-15 08:29:37,425 INFO L290 TraceCheckUtils]: 37: Hoare triple {1131#true} assume true; {1131#true} is VALID
[2022-04-15 08:29:37,426 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-15 08:29:37,431 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-15 08:29:37,432 INFO L290 TraceCheckUtils]: 40: Hoare triple {1254#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1258#(<= 1 __VERIFIER_assert_~cond)} is VALID
[2022-04-15 08:29:37,432 INFO L290 TraceCheckUtils]: 41: Hoare triple {1258#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1132#false} is VALID
[2022-04-15 08:29:37,432 INFO L290 TraceCheckUtils]: 42: Hoare triple {1132#false} assume !false; {1132#false} is VALID
[2022-04-15 08:29:37,433 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-15 08:29:37,433 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2022-04-15 08:29:37,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-04-15 08:29:37,433 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [349026572]
[2022-04-15 08:29:37,434 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT
[2022-04-15 08:29:37,434 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [256730031]
[2022-04-15 08:29:37,434 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [256730031] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-15 08:29:37,434 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-15 08:29:37,434 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2022-04-15 08:29:37,434 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace
[2022-04-15 08:29:37,434 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [689383395]
[2022-04-15 08:29:37,434 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [689383395] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-15 08:29:37,434 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-15 08:29:37,434 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2022-04-15 08:29:37,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [356352505]
[2022-04-15 08:29:37,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-04-15 08:29:37,435 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-15 08:29:37,435 INFO L84 Accepts]: Finished accepts. word is accepted.
[2022-04-15 08:29:37,436 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-15 08:29:37,455 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-15 08:29:37,455 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2022-04-15 08:29:37,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION
[2022-04-15 08:29:37,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2022-04-15 08:29:37,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2022-04-15 08:29:37,456 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-15 08:29:37,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-15 08:29:37,633 INFO L93 Difference]: Finished difference Result 74 states and 105 transitions.
[2022-04-15 08:29:37,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2022-04-15 08:29:37,633 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-15 08:29:37,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-04-15 08:29:37,634 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-15 08:29:37,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 65 transitions.
[2022-04-15 08:29:37,635 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-15 08:29:37,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 65 transitions.
[2022-04-15 08:29:37,636 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 65 transitions.
[2022-04-15 08:29:37,675 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-15 08:29:37,677 INFO L225 Difference]: With dead ends: 74
[2022-04-15 08:29:37,677 INFO L226 Difference]: Without dead ends: 70
[2022-04-15 08:29:37,677 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-15 08:29:37,678 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-15 08:29:37,678 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-15 08:29:37,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states.
[2022-04-15 08:29:37,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70.
[2022-04-15 08:29:37,707 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2022-04-15 08:29:37,708 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-15 08:29:37,709 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-15 08:29:37,709 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-15 08:29:37,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-15 08:29:37,712 INFO L93 Difference]: Finished difference Result 70 states and 98 transitions.
[2022-04-15 08:29:37,712 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 98 transitions.
[2022-04-15 08:29:37,713 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-15 08:29:37,713 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-15 08:29:37,713 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-15 08:29:37,714 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-15 08:29:37,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-15 08:29:37,718 INFO L93 Difference]: Finished difference Result 70 states and 98 transitions.
[2022-04-15 08:29:37,718 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 98 transitions.
[2022-04-15 08:29:37,720 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-15 08:29:37,720 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-15 08:29:37,720 INFO L88 GeneralOperation]: Finished isEquivalent.
[2022-04-15 08:29:37,720 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2022-04-15 08:29:37,721 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-15 08:29:37,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 98 transitions.
[2022-04-15 08:29:37,725 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 98 transitions. Word has length 43
[2022-04-15 08:29:37,726 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-04-15 08:29:37,726 INFO L478 AbstractCegarLoop]: Abstraction has 70 states and 98 transitions.
[2022-04-15 08:29:37,726 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-15 08:29:37,727 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 70 states and 98 transitions.
[2022-04-15 08:29:37,818 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-15 08:29:37,818 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 98 transitions.
[2022-04-15 08:29:37,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50
[2022-04-15 08:29:37,819 INFO L491 BasicCegarLoop]: Found error trace
[2022-04-15 08:29:37,819 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-15 08:29:37,835 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-15 08:29:38,027 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-04-15 08:29:38,028 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-04-15 08:29:38,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-04-15 08:29:38,028 INFO L85 PathProgramCache]: Analyzing trace with hash -301191846, now seen corresponding path program 1 times
[2022-04-15 08:29:38,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION
[2022-04-15 08:29:38,028 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [601015287]
[2022-04-15 08:29:38,029 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation
[2022-04-15 08:29:38,029 INFO L85 PathProgramCache]: Analyzing trace with hash -301191846, now seen corresponding path program 2 times
[2022-04-15 08:29:38,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-04-15 08:29:38,029 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [901288184]
[2022-04-15 08:29:38,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-15 08:29:38,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-15 08:29:38,052 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic
[2022-04-15 08:29:38,052 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2054967538]
[2022-04-15 08:29:38,052 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2022-04-15 08:29:38,052 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-04-15 08:29:38,053 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-04-15 08:29:38,053 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2022-04-15 08:29:38,066 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process
[2022-04-15 08:29:38,092 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2022-04-15 08:29:38,092 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat
[2022-04-15 08:29:38,093 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 5 conjunts are in the unsatisfiable core
[2022-04-15 08:29:38,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-15 08:29:38,105 INFO L286 TraceCheckSpWp]: Computing forward predicates...
[2022-04-15 08:29:38,203 INFO L272 TraceCheckUtils]: 0: Hoare triple {1694#true} call ULTIMATE.init(); {1694#true} is VALID
[2022-04-15 08:29:38,203 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-15 08:29:38,203 INFO L290 TraceCheckUtils]: 2: Hoare triple {1694#true} assume true; {1694#true} is VALID
[2022-04-15 08:29:38,204 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1694#true} {1694#true} #88#return; {1694#true} is VALID
[2022-04-15 08:29:38,204 INFO L272 TraceCheckUtils]: 4: Hoare triple {1694#true} call #t~ret6 := main(); {1694#true} is VALID
[2022-04-15 08:29:38,205 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-15 08:29:38,205 INFO L272 TraceCheckUtils]: 6: Hoare triple {1694#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 10 then 1 else 0)); {1694#true} is VALID
[2022-04-15 08:29:38,205 INFO L290 TraceCheckUtils]: 7: Hoare triple {1694#true} ~cond := #in~cond; {1694#true} is VALID
[2022-04-15 08:29:38,205 INFO L290 TraceCheckUtils]: 8: Hoare triple {1694#true} assume !(0 == ~cond); {1694#true} is VALID
[2022-04-15 08:29:38,205 INFO L290 TraceCheckUtils]: 9: Hoare triple {1694#true} assume true; {1694#true} is VALID
[2022-04-15 08:29:38,206 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1694#true} {1694#true} #66#return; {1694#true} is VALID
[2022-04-15 08:29:38,206 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-15 08:29:38,206 INFO L272 TraceCheckUtils]: 12: Hoare triple {1694#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 10 then 1 else 0)); {1694#true} is VALID
[2022-04-15 08:29:38,207 INFO L290 TraceCheckUtils]: 13: Hoare triple {1694#true} ~cond := #in~cond; {1694#true} is VALID
[2022-04-15 08:29:38,207 INFO L290 TraceCheckUtils]: 14: Hoare triple {1694#true} assume !(0 == ~cond); {1694#true} is VALID
[2022-04-15 08:29:38,208 INFO L290 TraceCheckUtils]: 15: Hoare triple {1694#true} assume true; {1694#true} is VALID
[2022-04-15 08:29:38,208 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {1694#true} {1694#true} #68#return; {1694#true} is VALID
[2022-04-15 08:29:38,208 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-15 08:29:38,209 INFO L290 TraceCheckUtils]: 18: Hoare triple {1694#true} ~cond := #in~cond; {1694#true} is VALID
[2022-04-15 08:29:38,209 INFO L290 TraceCheckUtils]: 19: Hoare triple {1694#true} assume !(0 == ~cond); {1694#true} is VALID
[2022-04-15 08:29:38,209 INFO L290 TraceCheckUtils]: 20: Hoare triple {1694#true} assume true; {1694#true} is VALID
[2022-04-15 08:29:38,209 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {1694#true} {1694#true} #70#return; {1694#true} is VALID
[2022-04-15 08:29:38,209 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-15 08:29:38,209 INFO L290 TraceCheckUtils]: 23: Hoare triple {1694#true} ~cond := #in~cond; {1694#true} is VALID
[2022-04-15 08:29:38,209 INFO L290 TraceCheckUtils]: 24: Hoare triple {1694#true} assume !(0 == ~cond); {1694#true} is VALID
[2022-04-15 08:29:38,209 INFO L290 TraceCheckUtils]: 25: Hoare triple {1694#true} assume true; {1694#true} is VALID
[2022-04-15 08:29:38,209 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {1694#true} {1694#true} #72#return; {1694#true} is VALID
[2022-04-15 08:29:38,210 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-15 08:29:38,210 INFO L290 TraceCheckUtils]: 28: Hoare triple {1694#true} assume !false; {1694#true} is VALID
[2022-04-15 08:29:38,210 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-15 08:29:38,210 INFO L290 TraceCheckUtils]: 30: Hoare triple {1694#true} ~cond := #in~cond; {1694#true} is VALID
[2022-04-15 08:29:38,210 INFO L290 TraceCheckUtils]: 31: Hoare triple {1694#true} assume !(0 == ~cond); {1694#true} is VALID
[2022-04-15 08:29:38,210 INFO L290 TraceCheckUtils]: 32: Hoare triple {1694#true} assume true; {1694#true} is VALID
[2022-04-15 08:29:38,210 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {1694#true} {1694#true} #74#return; {1694#true} is VALID
[2022-04-15 08:29:38,210 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-15 08:29:38,210 INFO L290 TraceCheckUtils]: 35: Hoare triple {1694#true} ~cond := #in~cond; {1694#true} is VALID
[2022-04-15 08:29:38,210 INFO L290 TraceCheckUtils]: 36: Hoare triple {1694#true} assume !(0 == ~cond); {1694#true} is VALID
[2022-04-15 08:29:38,211 INFO L290 TraceCheckUtils]: 37: Hoare triple {1694#true} assume true; {1694#true} is VALID
[2022-04-15 08:29:38,211 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {1694#true} {1694#true} #76#return; {1694#true} is VALID
[2022-04-15 08:29:38,211 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-15 08:29:38,211 INFO L290 TraceCheckUtils]: 40: Hoare triple {1694#true} ~cond := #in~cond; {1694#true} is VALID
[2022-04-15 08:29:38,211 INFO L290 TraceCheckUtils]: 41: Hoare triple {1694#true} assume !(0 == ~cond); {1694#true} is VALID
[2022-04-15 08:29:38,211 INFO L290 TraceCheckUtils]: 42: Hoare triple {1694#true} assume true; {1694#true} is VALID
[2022-04-15 08:29:38,211 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {1694#true} {1694#true} #78#return; {1694#true} is VALID
[2022-04-15 08:29:38,212 INFO L290 TraceCheckUtils]: 44: Hoare triple {1694#true} assume !(~a~0 != ~b~0); {1831#(= main_~b~0 main_~a~0)} is VALID
[2022-04-15 08:29:38,212 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-15 08:29:38,213 INFO L290 TraceCheckUtils]: 46: Hoare triple {1835#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1839#(<= 1 __VERIFIER_assert_~cond)} is VALID
[2022-04-15 08:29:38,213 INFO L290 TraceCheckUtils]: 47: Hoare triple {1839#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1695#false} is VALID
[2022-04-15 08:29:38,213 INFO L290 TraceCheckUtils]: 48: Hoare triple {1695#false} assume !false; {1695#false} is VALID
[2022-04-15 08:29:38,213 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-15 08:29:38,214 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2022-04-15 08:29:38,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-04-15 08:29:38,216 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [901288184]
[2022-04-15 08:29:38,216 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT
[2022-04-15 08:29:38,216 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2054967538]
[2022-04-15 08:29:38,216 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2054967538] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-15 08:29:38,216 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-15 08:29:38,216 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2022-04-15 08:29:38,217 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace
[2022-04-15 08:29:38,217 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [601015287]
[2022-04-15 08:29:38,217 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [601015287] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-15 08:29:38,217 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-15 08:29:38,217 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2022-04-15 08:29:38,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1997567924]
[2022-04-15 08:29:38,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-04-15 08:29:38,218 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-15 08:29:38,219 INFO L84 Accepts]: Finished accepts. word is accepted.
[2022-04-15 08:29:38,219 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-15 08:29:38,241 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-15 08:29:38,241 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2022-04-15 08:29:38,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION
[2022-04-15 08:29:38,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2022-04-15 08:29:38,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2022-04-15 08:29:38,242 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-15 08:29:38,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-15 08:29:38,382 INFO L93 Difference]: Finished difference Result 76 states and 103 transitions.
[2022-04-15 08:29:38,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2022-04-15 08:29:38,383 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-15 08:29:38,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-04-15 08:29:38,383 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-15 08:29:38,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 47 transitions.
[2022-04-15 08:29:38,388 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-15 08:29:38,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 47 transitions.
[2022-04-15 08:29:38,389 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 47 transitions.
[2022-04-15 08:29:38,417 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-15 08:29:38,425 INFO L225 Difference]: With dead ends: 76
[2022-04-15 08:29:38,425 INFO L226 Difference]: Without dead ends: 74
[2022-04-15 08:29:38,425 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-15 08:29:38,429 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-15 08:29:38,429 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-15 08:29:38,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states.
[2022-04-15 08:29:38,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74.
[2022-04-15 08:29:38,452 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2022-04-15 08:29:38,453 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-15 08:29:38,453 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-15 08:29:38,453 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-15 08:29:38,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-15 08:29:38,456 INFO L93 Difference]: Finished difference Result 74 states and 101 transitions.
[2022-04-15 08:29:38,456 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 101 transitions.
[2022-04-15 08:29:38,456 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-15 08:29:38,456 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-15 08:29:38,457 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-15 08:29:38,457 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-15 08:29:38,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-15 08:29:38,459 INFO L93 Difference]: Finished difference Result 74 states and 101 transitions.
[2022-04-15 08:29:38,460 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 101 transitions.
[2022-04-15 08:29:38,460 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-15 08:29:38,460 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-15 08:29:38,460 INFO L88 GeneralOperation]: Finished isEquivalent.
[2022-04-15 08:29:38,460 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2022-04-15 08:29:38,460 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-15 08:29:38,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 101 transitions.
[2022-04-15 08:29:38,463 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 101 transitions. Word has length 49
[2022-04-15 08:29:38,463 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-04-15 08:29:38,463 INFO L478 AbstractCegarLoop]: Abstraction has 74 states and 101 transitions.
[2022-04-15 08:29:38,463 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-15 08:29:38,463 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 74 states and 101 transitions.
[2022-04-15 08:29:38,567 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-15 08:29:38,567 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 101 transitions.
[2022-04-15 08:29:38,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52
[2022-04-15 08:29:38,568 INFO L491 BasicCegarLoop]: Found error trace
[2022-04-15 08:29:38,568 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-15 08:29:38,588 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0
[2022-04-15 08:29:38,768 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-04-15 08:29:38,769 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-04-15 08:29:38,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-04-15 08:29:38,769 INFO L85 PathProgramCache]: Analyzing trace with hash -1164909737, now seen corresponding path program 1 times
[2022-04-15 08:29:38,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION
[2022-04-15 08:29:38,769 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1080593258]
[2022-04-15 08:29:38,770 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation
[2022-04-15 08:29:38,770 INFO L85 PathProgramCache]: Analyzing trace with hash -1164909737, now seen corresponding path program 2 times
[2022-04-15 08:29:38,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-04-15 08:29:38,770 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [843985778]
[2022-04-15 08:29:38,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-15 08:29:38,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-15 08:29:38,784 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic
[2022-04-15 08:29:38,784 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [818924048]
[2022-04-15 08:29:38,784 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2022-04-15 08:29:38,784 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-04-15 08:29:38,784 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-04-15 08:29:38,785 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2022-04-15 08:29:38,786 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process
[2022-04-15 08:29:38,827 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2022-04-15 08:29:38,827 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat
[2022-04-15 08:29:38,828 INFO L263 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 11 conjunts are in the unsatisfiable core
[2022-04-15 08:29:38,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-15 08:29:38,836 INFO L286 TraceCheckSpWp]: Computing forward predicates...
[2022-04-15 08:29:38,997 INFO L272 TraceCheckUtils]: 0: Hoare triple {2295#true} call ULTIMATE.init(); {2295#true} is VALID
[2022-04-15 08:29:38,997 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-15 08:29:38,997 INFO L290 TraceCheckUtils]: 2: Hoare triple {2295#true} assume true; {2295#true} is VALID
[2022-04-15 08:29:38,997 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2295#true} {2295#true} #88#return; {2295#true} is VALID
[2022-04-15 08:29:38,998 INFO L272 TraceCheckUtils]: 4: Hoare triple {2295#true} call #t~ret6 := main(); {2295#true} is VALID
[2022-04-15 08:29:38,998 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-15 08:29:38,998 INFO L272 TraceCheckUtils]: 6: Hoare triple {2295#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 10 then 1 else 0)); {2295#true} is VALID
[2022-04-15 08:29:38,998 INFO L290 TraceCheckUtils]: 7: Hoare triple {2295#true} ~cond := #in~cond; {2295#true} is VALID
[2022-04-15 08:29:38,998 INFO L290 TraceCheckUtils]: 8: Hoare triple {2295#true} assume !(0 == ~cond); {2295#true} is VALID
[2022-04-15 08:29:38,998 INFO L290 TraceCheckUtils]: 9: Hoare triple {2295#true} assume true; {2295#true} is VALID
[2022-04-15 08:29:38,998 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2295#true} {2295#true} #66#return; {2295#true} is VALID
[2022-04-15 08:29:38,998 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-15 08:29:38,998 INFO L272 TraceCheckUtils]: 12: Hoare triple {2295#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 10 then 1 else 0)); {2295#true} is VALID
[2022-04-15 08:29:38,998 INFO L290 TraceCheckUtils]: 13: Hoare triple {2295#true} ~cond := #in~cond; {2295#true} is VALID
[2022-04-15 08:29:38,999 INFO L290 TraceCheckUtils]: 14: Hoare triple {2295#true} assume !(0 == ~cond); {2295#true} is VALID
[2022-04-15 08:29:38,999 INFO L290 TraceCheckUtils]: 15: Hoare triple {2295#true} assume true; {2295#true} is VALID
[2022-04-15 08:29:38,999 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {2295#true} {2295#true} #68#return; {2295#true} is VALID
[2022-04-15 08:29:38,999 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-15 08:29:38,999 INFO L290 TraceCheckUtils]: 18: Hoare triple {2295#true} ~cond := #in~cond; {2295#true} is VALID
[2022-04-15 08:29:38,999 INFO L290 TraceCheckUtils]: 19: Hoare triple {2295#true} assume !(0 == ~cond); {2295#true} is VALID
[2022-04-15 08:29:38,999 INFO L290 TraceCheckUtils]: 20: Hoare triple {2295#true} assume true; {2295#true} is VALID
[2022-04-15 08:29:38,999 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {2295#true} {2295#true} #70#return; {2295#true} is VALID
[2022-04-15 08:29:38,999 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-15 08:29:39,000 INFO L290 TraceCheckUtils]: 23: Hoare triple {2295#true} ~cond := #in~cond; {2295#true} is VALID
[2022-04-15 08:29:39,000 INFO L290 TraceCheckUtils]: 24: Hoare triple {2295#true} assume !(0 == ~cond); {2295#true} is VALID
[2022-04-15 08:29:39,000 INFO L290 TraceCheckUtils]: 25: Hoare triple {2295#true} assume true; {2295#true} is VALID
[2022-04-15 08:29:39,000 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {2295#true} {2295#true} #72#return; {2295#true} is VALID
[2022-04-15 08:29:39,000 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-15 08:29:39,001 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-15 08:29:39,001 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-15 08:29:39,001 INFO L290 TraceCheckUtils]: 30: Hoare triple {2295#true} ~cond := #in~cond; {2295#true} is VALID
[2022-04-15 08:29:39,001 INFO L290 TraceCheckUtils]: 31: Hoare triple {2295#true} assume !(0 == ~cond); {2295#true} is VALID
[2022-04-15 08:29:39,001 INFO L290 TraceCheckUtils]: 32: Hoare triple {2295#true} assume true; {2295#true} is VALID
[2022-04-15 08:29:39,005 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-15 08:29:39,006 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-15 08:29:39,007 INFO L290 TraceCheckUtils]: 35: Hoare triple {2295#true} ~cond := #in~cond; {2295#true} is VALID
[2022-04-15 08:29:39,007 INFO L290 TraceCheckUtils]: 36: Hoare triple {2295#true} assume !(0 == ~cond); {2295#true} is VALID
[2022-04-15 08:29:39,008 INFO L290 TraceCheckUtils]: 37: Hoare triple {2295#true} assume true; {2295#true} is VALID
[2022-04-15 08:29:39,009 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-15 08:29:39,012 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-15 08:29:39,012 INFO L290 TraceCheckUtils]: 40: Hoare triple {2295#true} ~cond := #in~cond; {2295#true} is VALID
[2022-04-15 08:29:39,012 INFO L290 TraceCheckUtils]: 41: Hoare triple {2295#true} assume !(0 == ~cond); {2295#true} is VALID
[2022-04-15 08:29:39,012 INFO L290 TraceCheckUtils]: 42: Hoare triple {2295#true} assume true; {2295#true} is VALID
[2022-04-15 08:29:39,015 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-15 08:29:39,015 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-15 08:29:39,016 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-15 08:29:39,016 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-15 08:29:39,017 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-15 08:29:39,017 INFO L290 TraceCheckUtils]: 48: Hoare triple {2442#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2446#(<= 1 __VERIFIER_assert_~cond)} is VALID
[2022-04-15 08:29:39,017 INFO L290 TraceCheckUtils]: 49: Hoare triple {2446#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2296#false} is VALID
[2022-04-15 08:29:39,017 INFO L290 TraceCheckUtils]: 50: Hoare triple {2296#false} assume !false; {2296#false} is VALID
[2022-04-15 08:29:39,018 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-15 08:29:39,018 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2022-04-15 08:29:39,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-04-15 08:29:39,018 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [843985778]
[2022-04-15 08:29:39,019 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT
[2022-04-15 08:29:39,019 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [818924048]
[2022-04-15 08:29:39,019 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [818924048] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-15 08:29:39,019 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-15 08:29:39,019 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2022-04-15 08:29:39,019 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace
[2022-04-15 08:29:39,019 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1080593258]
[2022-04-15 08:29:39,019 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1080593258] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-15 08:29:39,019 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-15 08:29:39,019 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2022-04-15 08:29:39,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472661113]
[2022-04-15 08:29:39,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-04-15 08:29:39,020 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-15 08:29:39,020 INFO L84 Accepts]: Finished accepts. word is accepted.
[2022-04-15 08:29:39,020 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-15 08:29:39,043 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-15 08:29:39,043 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2022-04-15 08:29:39,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION
[2022-04-15 08:29:39,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2022-04-15 08:29:39,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2022-04-15 08:29:39,044 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-15 08:29:39,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-15 08:29:39,197 INFO L93 Difference]: Finished difference Result 84 states and 109 transitions.
[2022-04-15 08:29:39,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2022-04-15 08:29:39,197 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-15 08:29:39,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-04-15 08:29:39,198 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-15 08:29:39,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 63 transitions.
[2022-04-15 08:29:39,200 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-15 08:29:39,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 63 transitions.
[2022-04-15 08:29:39,201 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 63 transitions.
[2022-04-15 08:29:39,242 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-15 08:29:39,244 INFO L225 Difference]: With dead ends: 84
[2022-04-15 08:29:39,245 INFO L226 Difference]: Without dead ends: 81
[2022-04-15 08:29:39,245 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-15 08:29:39,246 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-15 08:29:39,247 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-15 08:29:39,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states.
[2022-04-15 08:29:39,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 79.
[2022-04-15 08:29:39,275 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2022-04-15 08:29:39,276 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-15 08:29:39,276 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-15 08:29:39,276 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-15 08:29:39,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-15 08:29:39,280 INFO L93 Difference]: Finished difference Result 81 states and 105 transitions.
[2022-04-15 08:29:39,280 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 105 transitions.
[2022-04-15 08:29:39,280 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-15 08:29:39,280 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-15 08:29:39,281 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-15 08:29:39,281 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-15 08:29:39,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-15 08:29:39,283 INFO L93 Difference]: Finished difference Result 81 states and 105 transitions.
[2022-04-15 08:29:39,284 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 105 transitions.
[2022-04-15 08:29:39,284 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-15 08:29:39,284 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-15 08:29:39,284 INFO L88 GeneralOperation]: Finished isEquivalent.
[2022-04-15 08:29:39,284 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2022-04-15 08:29:39,284 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-15 08:29:39,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 102 transitions.
[2022-04-15 08:29:39,287 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 102 transitions. Word has length 51
[2022-04-15 08:29:39,287 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-04-15 08:29:39,288 INFO L478 AbstractCegarLoop]: Abstraction has 79 states and 102 transitions.
[2022-04-15 08:29:39,288 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-15 08:29:39,288 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 79 states and 102 transitions.
[2022-04-15 08:29:39,375 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-15 08:29:39,375 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 102 transitions.
[2022-04-15 08:29:39,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55
[2022-04-15 08:29:39,376 INFO L491 BasicCegarLoop]: Found error trace
[2022-04-15 08:29:39,376 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-15 08:29:39,392 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-15 08:29:39,591 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-04-15 08:29:39,592 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-04-15 08:29:39,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-04-15 08:29:39,592 INFO L85 PathProgramCache]: Analyzing trace with hash 1924168317, now seen corresponding path program 1 times
[2022-04-15 08:29:39,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION
[2022-04-15 08:29:39,592 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1215155954]
[2022-04-15 08:29:39,593 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation
[2022-04-15 08:29:39,593 INFO L85 PathProgramCache]: Analyzing trace with hash 1924168317, now seen corresponding path program 2 times
[2022-04-15 08:29:39,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-04-15 08:29:39,593 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1408519968]
[2022-04-15 08:29:39,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-15 08:29:39,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-15 08:29:39,605 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic
[2022-04-15 08:29:39,606 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2131136732]
[2022-04-15 08:29:39,606 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2022-04-15 08:29:39,606 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-04-15 08:29:39,606 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-04-15 08:29:39,607 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2022-04-15 08:29:39,608 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process
[2022-04-15 08:29:39,642 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2022-04-15 08:29:39,643 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat
[2022-04-15 08:29:39,643 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 10 conjunts are in the unsatisfiable core
[2022-04-15 08:29:39,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-15 08:29:39,654 INFO L286 TraceCheckSpWp]: Computing forward predicates...
[2022-04-15 08:29:39,792 INFO L272 TraceCheckUtils]: 0: Hoare triple {2942#true} call ULTIMATE.init(); {2942#true} is VALID
[2022-04-15 08:29:39,792 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-15 08:29:39,792 INFO L290 TraceCheckUtils]: 2: Hoare triple {2942#true} assume true; {2942#true} is VALID
[2022-04-15 08:29:39,792 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2942#true} {2942#true} #88#return; {2942#true} is VALID
[2022-04-15 08:29:39,792 INFO L272 TraceCheckUtils]: 4: Hoare triple {2942#true} call #t~ret6 := main(); {2942#true} is VALID
[2022-04-15 08:29:39,792 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-15 08:29:39,792 INFO L272 TraceCheckUtils]: 6: Hoare triple {2942#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 10 then 1 else 0)); {2942#true} is VALID
[2022-04-15 08:29:39,792 INFO L290 TraceCheckUtils]: 7: Hoare triple {2942#true} ~cond := #in~cond; {2942#true} is VALID
[2022-04-15 08:29:39,793 INFO L290 TraceCheckUtils]: 8: Hoare triple {2942#true} assume !(0 == ~cond); {2942#true} is VALID
[2022-04-15 08:29:39,793 INFO L290 TraceCheckUtils]: 9: Hoare triple {2942#true} assume true; {2942#true} is VALID
[2022-04-15 08:29:39,793 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2942#true} {2942#true} #66#return; {2942#true} is VALID
[2022-04-15 08:29:39,793 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-15 08:29:39,793 INFO L272 TraceCheckUtils]: 12: Hoare triple {2942#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 10 then 1 else 0)); {2942#true} is VALID
[2022-04-15 08:29:39,793 INFO L290 TraceCheckUtils]: 13: Hoare triple {2942#true} ~cond := #in~cond; {2942#true} is VALID
[2022-04-15 08:29:39,793 INFO L290 TraceCheckUtils]: 14: Hoare triple {2942#true} assume !(0 == ~cond); {2942#true} is VALID
[2022-04-15 08:29:39,793 INFO L290 TraceCheckUtils]: 15: Hoare triple {2942#true} assume true; {2942#true} is VALID
[2022-04-15 08:29:39,794 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {2942#true} {2942#true} #68#return; {2942#true} is VALID
[2022-04-15 08:29:39,794 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-15 08:29:39,794 INFO L290 TraceCheckUtils]: 18: Hoare triple {2942#true} ~cond := #in~cond; {2942#true} is VALID
[2022-04-15 08:29:39,794 INFO L290 TraceCheckUtils]: 19: Hoare triple {2942#true} assume !(0 == ~cond); {2942#true} is VALID
[2022-04-15 08:29:39,794 INFO L290 TraceCheckUtils]: 20: Hoare triple {2942#true} assume true; {2942#true} is VALID
[2022-04-15 08:29:39,794 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {2942#true} {2942#true} #70#return; {2942#true} is VALID
[2022-04-15 08:29:39,794 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-15 08:29:39,794 INFO L290 TraceCheckUtils]: 23: Hoare triple {2942#true} ~cond := #in~cond; {2942#true} is VALID
[2022-04-15 08:29:39,795 INFO L290 TraceCheckUtils]: 24: Hoare triple {2942#true} assume !(0 == ~cond); {2942#true} is VALID
[2022-04-15 08:29:39,795 INFO L290 TraceCheckUtils]: 25: Hoare triple {2942#true} assume true; {2942#true} is VALID
[2022-04-15 08:29:39,795 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {2942#true} {2942#true} #72#return; {2942#true} is VALID
[2022-04-15 08:29:39,795 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-15 08:29:39,795 INFO L290 TraceCheckUtils]: 28: Hoare triple {2942#true} assume !false; {2942#true} is VALID
[2022-04-15 08:29:39,795 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-15 08:29:39,795 INFO L290 TraceCheckUtils]: 30: Hoare triple {2942#true} ~cond := #in~cond; {2942#true} is VALID
[2022-04-15 08:29:39,795 INFO L290 TraceCheckUtils]: 31: Hoare triple {2942#true} assume !(0 == ~cond); {2942#true} is VALID
[2022-04-15 08:29:39,796 INFO L290 TraceCheckUtils]: 32: Hoare triple {2942#true} assume true; {2942#true} is VALID
[2022-04-15 08:29:39,796 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {2942#true} {2942#true} #74#return; {2942#true} is VALID
[2022-04-15 08:29:39,796 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-15 08:29:39,796 INFO L290 TraceCheckUtils]: 35: Hoare triple {2942#true} ~cond := #in~cond; {3052#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID
[2022-04-15 08:29:39,797 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-15 08:29:39,798 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-15 08:29:39,801 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-15 08:29:39,801 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-15 08:29:39,801 INFO L290 TraceCheckUtils]: 40: Hoare triple {2942#true} ~cond := #in~cond; {2942#true} is VALID
[2022-04-15 08:29:39,802 INFO L290 TraceCheckUtils]: 41: Hoare triple {2942#true} assume !(0 == ~cond); {2942#true} is VALID
[2022-04-15 08:29:39,802 INFO L290 TraceCheckUtils]: 42: Hoare triple {2942#true} assume true; {2942#true} is VALID
[2022-04-15 08:29:39,802 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-15 08:29:39,803 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-15 08:29:39,803 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-15 08:29:39,803 INFO L290 TraceCheckUtils]: 46: Hoare triple {2942#true} ~cond := #in~cond; {2942#true} is VALID
[2022-04-15 08:29:39,803 INFO L290 TraceCheckUtils]: 47: Hoare triple {2942#true} assume !(0 == ~cond); {2942#true} is VALID
[2022-04-15 08:29:39,803 INFO L290 TraceCheckUtils]: 48: Hoare triple {2942#true} assume true; {2942#true} is VALID
[2022-04-15 08:29:39,803 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-15 08:29:39,804 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-15 08:29:39,804 INFO L290 TraceCheckUtils]: 51: Hoare triple {3101#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3105#(<= 1 __VERIFIER_assert_~cond)} is VALID
[2022-04-15 08:29:39,805 INFO L290 TraceCheckUtils]: 52: Hoare triple {3105#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2943#false} is VALID
[2022-04-15 08:29:39,805 INFO L290 TraceCheckUtils]: 53: Hoare triple {2943#false} assume !false; {2943#false} is VALID
[2022-04-15 08:29:39,806 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-15 08:29:39,806 INFO L328 TraceCheckSpWp]: Computing backward predicates...
[2022-04-15 08:29:59,265 INFO L290 TraceCheckUtils]: 53: Hoare triple {2943#false} assume !false; {2943#false} is VALID
[2022-04-15 08:29:59,266 INFO L290 TraceCheckUtils]: 52: Hoare triple {3105#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2943#false} is VALID
[2022-04-15 08:29:59,266 INFO L290 TraceCheckUtils]: 51: Hoare triple {3101#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3105#(<= 1 __VERIFIER_assert_~cond)} is VALID
[2022-04-15 08:29:59,267 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-15 08:29:59,268 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-15 08:29:59,268 INFO L290 TraceCheckUtils]: 48: Hoare triple {2942#true} assume true; {2942#true} is VALID
[2022-04-15 08:29:59,268 INFO L290 TraceCheckUtils]: 47: Hoare triple {2942#true} assume !(0 == ~cond); {2942#true} is VALID
[2022-04-15 08:29:59,268 INFO L290 TraceCheckUtils]: 46: Hoare triple {2942#true} ~cond := #in~cond; {2942#true} is VALID
[2022-04-15 08:29:59,268 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-15 08:29:59,268 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-15 08:29:59,269 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-15 08:29:59,269 INFO L290 TraceCheckUtils]: 42: Hoare triple {2942#true} assume true; {2942#true} is VALID
[2022-04-15 08:29:59,269 INFO L290 TraceCheckUtils]: 41: Hoare triple {2942#true} assume !(0 == ~cond); {2942#true} is VALID
[2022-04-15 08:29:59,269 INFO L290 TraceCheckUtils]: 40: Hoare triple {2942#true} ~cond := #in~cond; {2942#true} is VALID
[2022-04-15 08:29:59,269 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-15 08:29:59,270 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-15 08:29:59,270 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-15 08:29:59,271 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-15 08:29:59,271 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-15 08:29:59,271 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-15 08:29:59,271 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {2942#true} {2942#true} #74#return; {2942#true} is VALID
[2022-04-15 08:29:59,271 INFO L290 TraceCheckUtils]: 32: Hoare triple {2942#true} assume true; {2942#true} is VALID
[2022-04-15 08:29:59,271 INFO L290 TraceCheckUtils]: 31: Hoare triple {2942#true} assume !(0 == ~cond); {2942#true} is VALID
[2022-04-15 08:29:59,271 INFO L290 TraceCheckUtils]: 30: Hoare triple {2942#true} ~cond := #in~cond; {2942#true} is VALID
[2022-04-15 08:29:59,272 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-15 08:29:59,272 INFO L290 TraceCheckUtils]: 28: Hoare triple {2942#true} assume !false; {2942#true} is VALID
[2022-04-15 08:29:59,272 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-15 08:29:59,272 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {2942#true} {2942#true} #72#return; {2942#true} is VALID
[2022-04-15 08:29:59,272 INFO L290 TraceCheckUtils]: 25: Hoare triple {2942#true} assume true; {2942#true} is VALID
[2022-04-15 08:29:59,272 INFO L290 TraceCheckUtils]: 24: Hoare triple {2942#true} assume !(0 == ~cond); {2942#true} is VALID
[2022-04-15 08:29:59,272 INFO L290 TraceCheckUtils]: 23: Hoare triple {2942#true} ~cond := #in~cond; {2942#true} is VALID
[2022-04-15 08:29:59,272 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-15 08:29:59,272 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {2942#true} {2942#true} #70#return; {2942#true} is VALID
[2022-04-15 08:29:59,272 INFO L290 TraceCheckUtils]: 20: Hoare triple {2942#true} assume true; {2942#true} is VALID
[2022-04-15 08:29:59,272 INFO L290 TraceCheckUtils]: 19: Hoare triple {2942#true} assume !(0 == ~cond); {2942#true} is VALID
[2022-04-15 08:29:59,272 INFO L290 TraceCheckUtils]: 18: Hoare triple {2942#true} ~cond := #in~cond; {2942#true} is VALID
[2022-04-15 08:29:59,273 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-15 08:29:59,273 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {2942#true} {2942#true} #68#return; {2942#true} is VALID
[2022-04-15 08:29:59,273 INFO L290 TraceCheckUtils]: 15: Hoare triple {2942#true} assume true; {2942#true} is VALID
[2022-04-15 08:29:59,273 INFO L290 TraceCheckUtils]: 14: Hoare triple {2942#true} assume !(0 == ~cond); {2942#true} is VALID
[2022-04-15 08:29:59,273 INFO L290 TraceCheckUtils]: 13: Hoare triple {2942#true} ~cond := #in~cond; {2942#true} is VALID
[2022-04-15 08:29:59,273 INFO L272 TraceCheckUtils]: 12: Hoare triple {2942#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 10 then 1 else 0)); {2942#true} is VALID
[2022-04-15 08:29:59,273 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-15 08:29:59,273 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2942#true} {2942#true} #66#return; {2942#true} is VALID
[2022-04-15 08:29:59,273 INFO L290 TraceCheckUtils]: 9: Hoare triple {2942#true} assume true; {2942#true} is VALID
[2022-04-15 08:29:59,273 INFO L290 TraceCheckUtils]: 8: Hoare triple {2942#true} assume !(0 == ~cond); {2942#true} is VALID
[2022-04-15 08:29:59,273 INFO L290 TraceCheckUtils]: 7: Hoare triple {2942#true} ~cond := #in~cond; {2942#true} is VALID
[2022-04-15 08:29:59,273 INFO L272 TraceCheckUtils]: 6: Hoare triple {2942#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 10 then 1 else 0)); {2942#true} is VALID
[2022-04-15 08:29:59,273 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-15 08:29:59,274 INFO L272 TraceCheckUtils]: 4: Hoare triple {2942#true} call #t~ret6 := main(); {2942#true} is VALID
[2022-04-15 08:29:59,274 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2942#true} {2942#true} #88#return; {2942#true} is VALID
[2022-04-15 08:29:59,274 INFO L290 TraceCheckUtils]: 2: Hoare triple {2942#true} assume true; {2942#true} is VALID
[2022-04-15 08:29:59,274 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-15 08:29:59,274 INFO L272 TraceCheckUtils]: 0: Hoare triple {2942#true} call ULTIMATE.init(); {2942#true} is VALID
[2022-04-15 08:29:59,274 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-15 08:29:59,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-04-15 08:29:59,274 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1408519968]
[2022-04-15 08:29:59,274 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT
[2022-04-15 08:29:59,275 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2131136732]
[2022-04-15 08:29:59,275 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2131136732] provided 0 perfect and 2 imperfect interpolant sequences
[2022-04-15 08:29:59,275 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences.
[2022-04-15 08:29:59,275 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9
[2022-04-15 08:29:59,275 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace
[2022-04-15 08:29:59,275 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1215155954]
[2022-04-15 08:29:59,275 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1215155954] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-15 08:29:59,275 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-15 08:29:59,275 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2022-04-15 08:29:59,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [54651521]
[2022-04-15 08:29:59,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-04-15 08:29:59,276 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-15 08:29:59,276 INFO L84 Accepts]: Finished accepts. word is accepted.
[2022-04-15 08:29:59,276 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-15 08:29:59,315 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-15 08:29:59,316 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2022-04-15 08:29:59,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION
[2022-04-15 08:29:59,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2022-04-15 08:29:59,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72
[2022-04-15 08:29:59,316 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-15 08:29:59,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-15 08:29:59,805 INFO L93 Difference]: Finished difference Result 88 states and 112 transitions.
[2022-04-15 08:29:59,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states.
[2022-04-15 08:29:59,805 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-15 08:29:59,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-04-15 08:29:59,805 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-15 08:29:59,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 52 transitions.
[2022-04-15 08:29:59,807 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-15 08:29:59,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 52 transitions.
[2022-04-15 08:29:59,808 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 52 transitions.
[2022-04-15 08:29:59,846 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-15 08:29:59,848 INFO L225 Difference]: With dead ends: 88
[2022-04-15 08:29:59,848 INFO L226 Difference]: Without dead ends: 84
[2022-04-15 08:29:59,848 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 99 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132
[2022-04-15 08:29:59,849 INFO L913 BasicCegarLoop]: 31 mSDtfsCounter, 14 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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.2s IncrementalHoareTripleChecker+Time
[2022-04-15 08:29:59,849 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.2s Time]
[2022-04-15 08:29:59,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states.
[2022-04-15 08:29:59,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84.
[2022-04-15 08:29:59,877 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2022-04-15 08:29:59,878 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-15 08:29:59,878 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-15 08:29:59,878 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-15 08:29:59,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-15 08:29:59,881 INFO L93 Difference]: Finished difference Result 84 states and 105 transitions.
[2022-04-15 08:29:59,881 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 105 transitions.
[2022-04-15 08:29:59,881 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-15 08:29:59,881 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-15 08:29:59,882 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-15 08:29:59,882 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-15 08:29:59,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-15 08:29:59,885 INFO L93 Difference]: Finished difference Result 84 states and 105 transitions.
[2022-04-15 08:29:59,885 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 105 transitions.
[2022-04-15 08:29:59,885 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-15 08:29:59,885 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-15 08:29:59,885 INFO L88 GeneralOperation]: Finished isEquivalent.
[2022-04-15 08:29:59,885 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2022-04-15 08:29:59,886 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-15 08:29:59,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 105 transitions.
[2022-04-15 08:29:59,888 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 105 transitions. Word has length 54
[2022-04-15 08:29:59,889 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-04-15 08:29:59,889 INFO L478 AbstractCegarLoop]: Abstraction has 84 states and 105 transitions.
[2022-04-15 08:29:59,889 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-15 08:29:59,889 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 84 states and 105 transitions.
[2022-04-15 08:29:59,999 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-15 08:29:59,999 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 105 transitions.
[2022-04-15 08:30:00,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57
[2022-04-15 08:30:00,000 INFO L491 BasicCegarLoop]: Found error trace
[2022-04-15 08:30:00,000 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-15 08:30:00,016 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0
[2022-04-15 08:30:00,201 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-04-15 08:30:00,201 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-04-15 08:30:00,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-04-15 08:30:00,201 INFO L85 PathProgramCache]: Analyzing trace with hash 1698149216, now seen corresponding path program 3 times
[2022-04-15 08:30:00,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION
[2022-04-15 08:30:00,202 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [311607636]
[2022-04-15 08:30:00,202 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation
[2022-04-15 08:30:00,202 INFO L85 PathProgramCache]: Analyzing trace with hash 1698149216, now seen corresponding path program 4 times
[2022-04-15 08:30:00,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-04-15 08:30:00,203 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835189299]
[2022-04-15 08:30:00,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-15 08:30:00,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-15 08:30:00,247 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic
[2022-04-15 08:30:00,247 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1125190486]
[2022-04-15 08:30:00,247 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST
[2022-04-15 08:30:00,247 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-04-15 08:30:00,248 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-04-15 08:30:00,264 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2022-04-15 08:30:00,293 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process
[2022-04-15 08:30:00,318 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s)
[2022-04-15 08:30:00,318 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat
[2022-04-15 08:30:00,319 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 26 conjunts are in the unsatisfiable core
[2022-04-15 08:30:00,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-15 08:30:00,331 INFO L286 TraceCheckSpWp]: Computing forward predicates...
[2022-04-15 08:30:00,709 INFO L272 TraceCheckUtils]: 0: Hoare triple {3792#true} call ULTIMATE.init(); {3792#true} is VALID
[2022-04-15 08:30:00,709 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-15 08:30:00,709 INFO L290 TraceCheckUtils]: 2: Hoare triple {3792#true} assume true; {3792#true} is VALID
[2022-04-15 08:30:00,709 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3792#true} {3792#true} #88#return; {3792#true} is VALID
[2022-04-15 08:30:00,709 INFO L272 TraceCheckUtils]: 4: Hoare triple {3792#true} call #t~ret6 := main(); {3792#true} is VALID
[2022-04-15 08:30:00,709 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-15 08:30:00,709 INFO L272 TraceCheckUtils]: 6: Hoare triple {3792#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 10 then 1 else 0)); {3792#true} is VALID
[2022-04-15 08:30:00,709 INFO L290 TraceCheckUtils]: 7: Hoare triple {3792#true} ~cond := #in~cond; {3792#true} is VALID
[2022-04-15 08:30:00,710 INFO L290 TraceCheckUtils]: 8: Hoare triple {3792#true} assume !(0 == ~cond); {3792#true} is VALID
[2022-04-15 08:30:00,710 INFO L290 TraceCheckUtils]: 9: Hoare triple {3792#true} assume true; {3792#true} is VALID
[2022-04-15 08:30:00,710 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3792#true} {3792#true} #66#return; {3792#true} is VALID
[2022-04-15 08:30:00,710 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-15 08:30:00,710 INFO L272 TraceCheckUtils]: 12: Hoare triple {3792#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 10 then 1 else 0)); {3792#true} is VALID
[2022-04-15 08:30:00,710 INFO L290 TraceCheckUtils]: 13: Hoare triple {3792#true} ~cond := #in~cond; {3792#true} is VALID
[2022-04-15 08:30:00,710 INFO L290 TraceCheckUtils]: 14: Hoare triple {3792#true} assume !(0 == ~cond); {3792#true} is VALID
[2022-04-15 08:30:00,710 INFO L290 TraceCheckUtils]: 15: Hoare triple {3792#true} assume true; {3792#true} is VALID
[2022-04-15 08:30:00,710 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {3792#true} {3792#true} #68#return; {3792#true} is VALID
[2022-04-15 08:30:00,710 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-15 08:30:00,710 INFO L290 TraceCheckUtils]: 18: Hoare triple {3792#true} ~cond := #in~cond; {3792#true} is VALID
[2022-04-15 08:30:00,710 INFO L290 TraceCheckUtils]: 19: Hoare triple {3792#true} assume !(0 == ~cond); {3792#true} is VALID
[2022-04-15 08:30:00,711 INFO L290 TraceCheckUtils]: 20: Hoare triple {3792#true} assume true; {3792#true} is VALID
[2022-04-15 08:30:00,711 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {3792#true} {3792#true} #70#return; {3792#true} is VALID
[2022-04-15 08:30:00,711 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-15 08:30:00,711 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-15 08:30:00,711 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-15 08:30:00,712 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-15 08:30:00,712 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-15 08:30:00,713 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-15 08:30:00,713 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-15 08:30:00,713 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-15 08:30:00,713 INFO L290 TraceCheckUtils]: 30: Hoare triple {3792#true} ~cond := #in~cond; {3792#true} is VALID
[2022-04-15 08:30:00,713 INFO L290 TraceCheckUtils]: 31: Hoare triple {3792#true} assume !(0 == ~cond); {3792#true} is VALID
[2022-04-15 08:30:00,714 INFO L290 TraceCheckUtils]: 32: Hoare triple {3792#true} assume true; {3792#true} is VALID
[2022-04-15 08:30:00,714 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-15 08:30:00,714 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-15 08:30:00,714 INFO L290 TraceCheckUtils]: 35: Hoare triple {3792#true} ~cond := #in~cond; {3792#true} is VALID
[2022-04-15 08:30:00,715 INFO L290 TraceCheckUtils]: 36: Hoare triple {3792#true} assume !(0 == ~cond); {3792#true} is VALID
[2022-04-15 08:30:00,715 INFO L290 TraceCheckUtils]: 37: Hoare triple {3792#true} assume true; {3792#true} is VALID
[2022-04-15 08:30:00,715 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-15 08:30:00,715 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-15 08:30:00,715 INFO L290 TraceCheckUtils]: 40: Hoare triple {3792#true} ~cond := #in~cond; {3792#true} is VALID
[2022-04-15 08:30:00,716 INFO L290 TraceCheckUtils]: 41: Hoare triple {3792#true} assume !(0 == ~cond); {3792#true} is VALID
[2022-04-15 08:30:00,716 INFO L290 TraceCheckUtils]: 42: Hoare triple {3792#true} assume true; {3792#true} is VALID
[2022-04-15 08:30:00,716 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-15 08:30:00,717 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-15 08:30:00,717 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-15 08:30:00,718 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-15 08:30:00,718 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-15 08:30:00,718 INFO L290 TraceCheckUtils]: 48: Hoare triple {3792#true} ~cond := #in~cond; {3792#true} is VALID
[2022-04-15 08:30:00,718 INFO L290 TraceCheckUtils]: 49: Hoare triple {3792#true} assume !(0 == ~cond); {3792#true} is VALID
[2022-04-15 08:30:00,718 INFO L290 TraceCheckUtils]: 50: Hoare triple {3792#true} assume true; {3792#true} is VALID
[2022-04-15 08:30:00,719 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-15 08:30:00,719 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-15 08:30:00,720 INFO L290 TraceCheckUtils]: 53: Hoare triple {3958#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3962#(<= 1 __VERIFIER_assert_~cond)} is VALID
[2022-04-15 08:30:00,720 INFO L290 TraceCheckUtils]: 54: Hoare triple {3962#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3793#false} is VALID
[2022-04-15 08:30:00,720 INFO L290 TraceCheckUtils]: 55: Hoare triple {3793#false} assume !false; {3793#false} is VALID
[2022-04-15 08:30:00,720 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-15 08:30:00,720 INFO L328 TraceCheckSpWp]: Computing backward predicates...
[2022-04-15 08:30:01,025 INFO L290 TraceCheckUtils]: 55: Hoare triple {3793#false} assume !false; {3793#false} is VALID
[2022-04-15 08:30:01,025 INFO L290 TraceCheckUtils]: 54: Hoare triple {3962#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3793#false} is VALID
[2022-04-15 08:30:01,026 INFO L290 TraceCheckUtils]: 53: Hoare triple {3958#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3962#(<= 1 __VERIFIER_assert_~cond)} is VALID
[2022-04-15 08:30:01,027 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-15 08:30:01,027 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-15 08:30:01,027 INFO L290 TraceCheckUtils]: 50: Hoare triple {3792#true} assume true; {3792#true} is VALID
[2022-04-15 08:30:01,027 INFO L290 TraceCheckUtils]: 49: Hoare triple {3792#true} assume !(0 == ~cond); {3792#true} is VALID
[2022-04-15 08:30:01,027 INFO L290 TraceCheckUtils]: 48: Hoare triple {3792#true} ~cond := #in~cond; {3792#true} is VALID
[2022-04-15 08:30:01,028 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-15 08:30:01,028 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-15 08:30:01,207 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-15 08:30:01,208 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-15 08:30:01,209 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-15 08:30:01,209 INFO L290 TraceCheckUtils]: 42: Hoare triple {3792#true} assume true; {3792#true} is VALID
[2022-04-15 08:30:01,209 INFO L290 TraceCheckUtils]: 41: Hoare triple {3792#true} assume !(0 == ~cond); {3792#true} is VALID
[2022-04-15 08:30:01,209 INFO L290 TraceCheckUtils]: 40: Hoare triple {3792#true} ~cond := #in~cond; {3792#true} is VALID
[2022-04-15 08:30:01,209 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-15 08:30:01,210 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-15 08:30:01,210 INFO L290 TraceCheckUtils]: 37: Hoare triple {3792#true} assume true; {3792#true} is VALID
[2022-04-15 08:30:01,210 INFO L290 TraceCheckUtils]: 36: Hoare triple {3792#true} assume !(0 == ~cond); {3792#true} is VALID
[2022-04-15 08:30:01,210 INFO L290 TraceCheckUtils]: 35: Hoare triple {3792#true} ~cond := #in~cond; {3792#true} is VALID
[2022-04-15 08:30:01,210 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-15 08:30:01,211 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-15 08:30:01,211 INFO L290 TraceCheckUtils]: 32: Hoare triple {3792#true} assume true; {3792#true} is VALID
[2022-04-15 08:30:01,211 INFO L290 TraceCheckUtils]: 31: Hoare triple {3792#true} assume !(0 == ~cond); {3792#true} is VALID
[2022-04-15 08:30:01,211 INFO L290 TraceCheckUtils]: 30: Hoare triple {3792#true} ~cond := #in~cond; {3792#true} is VALID
[2022-04-15 08:30:01,211 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-15 08:30:01,211 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-15 08:30:01,212 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-15 08:30:01,212 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {3792#true} {3792#true} #72#return; {3792#true} is VALID
[2022-04-15 08:30:01,212 INFO L290 TraceCheckUtils]: 25: Hoare triple {3792#true} assume true; {3792#true} is VALID
[2022-04-15 08:30:01,212 INFO L290 TraceCheckUtils]: 24: Hoare triple {3792#true} assume !(0 == ~cond); {3792#true} is VALID
[2022-04-15 08:30:01,212 INFO L290 TraceCheckUtils]: 23: Hoare triple {3792#true} ~cond := #in~cond; {3792#true} is VALID
[2022-04-15 08:30:01,212 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-15 08:30:01,212 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {3792#true} {3792#true} #70#return; {3792#true} is VALID
[2022-04-15 08:30:01,212 INFO L290 TraceCheckUtils]: 20: Hoare triple {3792#true} assume true; {3792#true} is VALID
[2022-04-15 08:30:01,213 INFO L290 TraceCheckUtils]: 19: Hoare triple {3792#true} assume !(0 == ~cond); {3792#true} is VALID
[2022-04-15 08:30:01,213 INFO L290 TraceCheckUtils]: 18: Hoare triple {3792#true} ~cond := #in~cond; {3792#true} is VALID
[2022-04-15 08:30:01,213 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-15 08:30:01,213 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {3792#true} {3792#true} #68#return; {3792#true} is VALID
[2022-04-15 08:30:01,213 INFO L290 TraceCheckUtils]: 15: Hoare triple {3792#true} assume true; {3792#true} is VALID
[2022-04-15 08:30:01,213 INFO L290 TraceCheckUtils]: 14: Hoare triple {3792#true} assume !(0 == ~cond); {3792#true} is VALID
[2022-04-15 08:30:01,213 INFO L290 TraceCheckUtils]: 13: Hoare triple {3792#true} ~cond := #in~cond; {3792#true} is VALID
[2022-04-15 08:30:01,213 INFO L272 TraceCheckUtils]: 12: Hoare triple {3792#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 10 then 1 else 0)); {3792#true} is VALID
[2022-04-15 08:30:01,213 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-15 08:30:01,213 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3792#true} {3792#true} #66#return; {3792#true} is VALID
[2022-04-15 08:30:01,213 INFO L290 TraceCheckUtils]: 9: Hoare triple {3792#true} assume true; {3792#true} is VALID
[2022-04-15 08:30:01,213 INFO L290 TraceCheckUtils]: 8: Hoare triple {3792#true} assume !(0 == ~cond); {3792#true} is VALID
[2022-04-15 08:30:01,214 INFO L290 TraceCheckUtils]: 7: Hoare triple {3792#true} ~cond := #in~cond; {3792#true} is VALID
[2022-04-15 08:30:01,214 INFO L272 TraceCheckUtils]: 6: Hoare triple {3792#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 10 then 1 else 0)); {3792#true} is VALID
[2022-04-15 08:30:01,214 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-15 08:30:01,214 INFO L272 TraceCheckUtils]: 4: Hoare triple {3792#true} call #t~ret6 := main(); {3792#true} is VALID
[2022-04-15 08:30:01,214 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3792#true} {3792#true} #88#return; {3792#true} is VALID
[2022-04-15 08:30:01,214 INFO L290 TraceCheckUtils]: 2: Hoare triple {3792#true} assume true; {3792#true} is VALID
[2022-04-15 08:30:01,214 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-15 08:30:01,214 INFO L272 TraceCheckUtils]: 0: Hoare triple {3792#true} call ULTIMATE.init(); {3792#true} is VALID
[2022-04-15 08:30:01,214 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-15 08:30:01,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-04-15 08:30:01,214 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [835189299]
[2022-04-15 08:30:01,215 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT
[2022-04-15 08:30:01,215 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1125190486]
[2022-04-15 08:30:01,215 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1125190486] provided 0 perfect and 2 imperfect interpolant sequences
[2022-04-15 08:30:01,215 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences.
[2022-04-15 08:30:01,215 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6] total 11
[2022-04-15 08:30:01,215 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace
[2022-04-15 08:30:01,215 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [311607636]
[2022-04-15 08:30:01,215 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [311607636] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-15 08:30:01,215 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-15 08:30:01,215 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2022-04-15 08:30:01,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1589280930]
[2022-04-15 08:30:01,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-04-15 08:30:01,216 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-15 08:30:01,216 INFO L84 Accepts]: Finished accepts. word is accepted.
[2022-04-15 08:30:01,216 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-15 08:30:01,241 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-15 08:30:01,241 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2022-04-15 08:30:01,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION
[2022-04-15 08:30:01,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2022-04-15 08:30:01,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110
[2022-04-15 08:30:01,242 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-15 08:30:02,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-15 08:30:02,131 INFO L93 Difference]: Finished difference Result 118 states and 147 transitions.
[2022-04-15 08:30:02,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states.
[2022-04-15 08:30:02,131 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-15 08:30:02,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-04-15 08:30:02,132 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-15 08:30:02,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 75 transitions.
[2022-04-15 08:30:02,133 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-15 08:30:02,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 75 transitions.
[2022-04-15 08:30:02,134 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 75 transitions.
[2022-04-15 08:30:02,200 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-15 08:30:02,203 INFO L225 Difference]: With dead ends: 118
[2022-04-15 08:30:02,203 INFO L226 Difference]: Without dead ends: 116
[2022-04-15 08:30:02,203 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-15 08:30:02,204 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-15 08:30:02,204 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-15 08:30:02,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states.
[2022-04-15 08:30:02,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 112.
[2022-04-15 08:30:02,266 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2022-04-15 08:30:02,266 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-15 08:30:02,272 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-15 08:30:02,273 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-15 08:30:02,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-15 08:30:02,276 INFO L93 Difference]: Finished difference Result 116 states and 145 transitions.
[2022-04-15 08:30:02,276 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 145 transitions.
[2022-04-15 08:30:02,276 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-15 08:30:02,276 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-15 08:30:02,277 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-15 08:30:02,278 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-15 08:30:02,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-15 08:30:02,281 INFO L93 Difference]: Finished difference Result 116 states and 145 transitions.
[2022-04-15 08:30:02,281 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 145 transitions.
[2022-04-15 08:30:02,281 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-15 08:30:02,282 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-15 08:30:02,282 INFO L88 GeneralOperation]: Finished isEquivalent.
[2022-04-15 08:30:02,282 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2022-04-15 08:30:02,283 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-15 08:30:02,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 138 transitions.
[2022-04-15 08:30:02,286 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 138 transitions. Word has length 56
[2022-04-15 08:30:02,287 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-04-15 08:30:02,287 INFO L478 AbstractCegarLoop]: Abstraction has 112 states and 138 transitions.
[2022-04-15 08:30:02,287 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-15 08:30:02,287 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 112 states and 138 transitions.
[2022-04-15 08:30:02,434 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-15 08:30:02,434 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 138 transitions.
[2022-04-15 08:30:02,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62
[2022-04-15 08:30:02,435 INFO L491 BasicCegarLoop]: Found error trace
[2022-04-15 08:30:02,435 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-15 08:30:02,457 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0
[2022-04-15 08:30:02,635 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-04-15 08:30:02,636 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-04-15 08:30:02,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-04-15 08:30:02,636 INFO L85 PathProgramCache]: Analyzing trace with hash 888099957, now seen corresponding path program 1 times
[2022-04-15 08:30:02,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION
[2022-04-15 08:30:02,636 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [177932080]
[2022-04-15 08:30:02,637 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation
[2022-04-15 08:30:02,637 INFO L85 PathProgramCache]: Analyzing trace with hash 888099957, now seen corresponding path program 2 times
[2022-04-15 08:30:02,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-04-15 08:30:02,637 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1103792774]
[2022-04-15 08:30:02,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-15 08:30:02,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-15 08:30:02,647 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic
[2022-04-15 08:30:02,647 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [525892036]
[2022-04-15 08:30:02,648 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2022-04-15 08:30:02,648 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-04-15 08:30:02,648 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-04-15 08:30:02,649 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2022-04-15 08:30:02,650 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process
[2022-04-15 08:30:02,687 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2022-04-15 08:30:02,687 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat
[2022-04-15 08:30:02,688 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 23 conjunts are in the unsatisfiable core
[2022-04-15 08:30:02,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-15 08:30:02,699 INFO L286 TraceCheckSpWp]: Computing forward predicates...
[2022-04-15 08:30:02,974 INFO L272 TraceCheckUtils]: 0: Hoare triple {4834#true} call ULTIMATE.init(); {4834#true} is VALID
[2022-04-15 08:30:02,974 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-15 08:30:02,974 INFO L290 TraceCheckUtils]: 2: Hoare triple {4834#true} assume true; {4834#true} is VALID
[2022-04-15 08:30:02,974 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4834#true} {4834#true} #88#return; {4834#true} is VALID
[2022-04-15 08:30:02,974 INFO L272 TraceCheckUtils]: 4: Hoare triple {4834#true} call #t~ret6 := main(); {4834#true} is VALID
[2022-04-15 08:30:02,974 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-15 08:30:02,974 INFO L272 TraceCheckUtils]: 6: Hoare triple {4834#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 10 then 1 else 0)); {4834#true} is VALID
[2022-04-15 08:30:02,974 INFO L290 TraceCheckUtils]: 7: Hoare triple {4834#true} ~cond := #in~cond; {4834#true} is VALID
[2022-04-15 08:30:02,975 INFO L290 TraceCheckUtils]: 8: Hoare triple {4834#true} assume !(0 == ~cond); {4834#true} is VALID
[2022-04-15 08:30:02,975 INFO L290 TraceCheckUtils]: 9: Hoare triple {4834#true} assume true; {4834#true} is VALID
[2022-04-15 08:30:02,975 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4834#true} {4834#true} #66#return; {4834#true} is VALID
[2022-04-15 08:30:02,975 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-15 08:30:02,975 INFO L272 TraceCheckUtils]: 12: Hoare triple {4834#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 10 then 1 else 0)); {4834#true} is VALID
[2022-04-15 08:30:02,975 INFO L290 TraceCheckUtils]: 13: Hoare triple {4834#true} ~cond := #in~cond; {4834#true} is VALID
[2022-04-15 08:30:02,975 INFO L290 TraceCheckUtils]: 14: Hoare triple {4834#true} assume !(0 == ~cond); {4834#true} is VALID
[2022-04-15 08:30:02,975 INFO L290 TraceCheckUtils]: 15: Hoare triple {4834#true} assume true; {4834#true} is VALID
[2022-04-15 08:30:02,975 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {4834#true} {4834#true} #68#return; {4834#true} is VALID
[2022-04-15 08:30:02,975 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-15 08:30:02,975 INFO L290 TraceCheckUtils]: 18: Hoare triple {4834#true} ~cond := #in~cond; {4834#true} is VALID
[2022-04-15 08:30:02,976 INFO L290 TraceCheckUtils]: 19: Hoare triple {4834#true} assume !(0 == ~cond); {4834#true} is VALID
[2022-04-15 08:30:02,976 INFO L290 TraceCheckUtils]: 20: Hoare triple {4834#true} assume true; {4834#true} is VALID
[2022-04-15 08:30:02,976 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {4834#true} {4834#true} #70#return; {4834#true} is VALID
[2022-04-15 08:30:02,976 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-15 08:30:02,976 INFO L290 TraceCheckUtils]: 23: Hoare triple {4834#true} ~cond := #in~cond; {4834#true} is VALID
[2022-04-15 08:30:02,976 INFO L290 TraceCheckUtils]: 24: Hoare triple {4834#true} assume !(0 == ~cond); {4834#true} is VALID
[2022-04-15 08:30:02,976 INFO L290 TraceCheckUtils]: 25: Hoare triple {4834#true} assume true; {4834#true} is VALID
[2022-04-15 08:30:02,976 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {4834#true} {4834#true} #72#return; {4834#true} is VALID
[2022-04-15 08:30:02,977 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-15 08:30:02,977 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-15 08:30:02,977 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-15 08:30:02,977 INFO L290 TraceCheckUtils]: 30: Hoare triple {4834#true} ~cond := #in~cond; {4834#true} is VALID
[2022-04-15 08:30:02,977 INFO L290 TraceCheckUtils]: 31: Hoare triple {4834#true} assume !(0 == ~cond); {4834#true} is VALID
[2022-04-15 08:30:02,977 INFO L290 TraceCheckUtils]: 32: Hoare triple {4834#true} assume true; {4834#true} is VALID
[2022-04-15 08:30:02,978 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-15 08:30:02,978 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-15 08:30:02,979 INFO L290 TraceCheckUtils]: 35: Hoare triple {4834#true} ~cond := #in~cond; {4834#true} is VALID
[2022-04-15 08:30:02,979 INFO L290 TraceCheckUtils]: 36: Hoare triple {4834#true} assume !(0 == ~cond); {4834#true} is VALID
[2022-04-15 08:30:02,979 INFO L290 TraceCheckUtils]: 37: Hoare triple {4834#true} assume true; {4834#true} is VALID
[2022-04-15 08:30:02,979 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-15 08:30:02,980 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-15 08:30:02,980 INFO L290 TraceCheckUtils]: 40: Hoare triple {4834#true} ~cond := #in~cond; {4834#true} is VALID
[2022-04-15 08:30:02,980 INFO L290 TraceCheckUtils]: 41: Hoare triple {4834#true} assume !(0 == ~cond); {4834#true} is VALID
[2022-04-15 08:30:02,980 INFO L290 TraceCheckUtils]: 42: Hoare triple {4834#true} assume true; {4834#true} is VALID
[2022-04-15 08:30:02,981 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-15 08:30:02,981 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-15 08:30:02,981 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-15 08:30:02,982 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-15 08:30:02,982 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-15 08:30:02,982 INFO L290 TraceCheckUtils]: 48: Hoare triple {4834#true} ~cond := #in~cond; {4834#true} is VALID
[2022-04-15 08:30:02,982 INFO L290 TraceCheckUtils]: 49: Hoare triple {4834#true} assume !(0 == ~cond); {4834#true} is VALID
[2022-04-15 08:30:02,982 INFO L290 TraceCheckUtils]: 50: Hoare triple {4834#true} assume true; {4834#true} is VALID
[2022-04-15 08:30:02,983 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-15 08:30:02,983 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-15 08:30:02,983 INFO L290 TraceCheckUtils]: 53: Hoare triple {4834#true} ~cond := #in~cond; {4834#true} is VALID
[2022-04-15 08:30:02,983 INFO L290 TraceCheckUtils]: 54: Hoare triple {4834#true} assume !(0 == ~cond); {4834#true} is VALID
[2022-04-15 08:30:02,983 INFO L290 TraceCheckUtils]: 55: Hoare triple {4834#true} assume true; {4834#true} is VALID
[2022-04-15 08:30:02,984 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-15 08:30:02,984 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-15 08:30:02,985 INFO L290 TraceCheckUtils]: 58: Hoare triple {5012#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {5016#(<= 1 __VERIFIER_assert_~cond)} is VALID
[2022-04-15 08:30:02,985 INFO L290 TraceCheckUtils]: 59: Hoare triple {5016#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4835#false} is VALID
[2022-04-15 08:30:02,985 INFO L290 TraceCheckUtils]: 60: Hoare triple {4835#false} assume !false; {4835#false} is VALID
[2022-04-15 08:30:02,985 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-15 08:30:02,985 INFO L328 TraceCheckSpWp]: Computing backward predicates...
[2022-04-15 08:30:03,210 INFO L290 TraceCheckUtils]: 60: Hoare triple {4835#false} assume !false; {4835#false} is VALID
[2022-04-15 08:30:03,210 INFO L290 TraceCheckUtils]: 59: Hoare triple {5016#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4835#false} is VALID
[2022-04-15 08:30:03,211 INFO L290 TraceCheckUtils]: 58: Hoare triple {5012#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {5016#(<= 1 __VERIFIER_assert_~cond)} is VALID
[2022-04-15 08:30:03,211 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-15 08:30:03,212 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-15 08:30:03,212 INFO L290 TraceCheckUtils]: 55: Hoare triple {4834#true} assume true; {4834#true} is VALID
[2022-04-15 08:30:03,212 INFO L290 TraceCheckUtils]: 54: Hoare triple {4834#true} assume !(0 == ~cond); {4834#true} is VALID
[2022-04-15 08:30:03,212 INFO L290 TraceCheckUtils]: 53: Hoare triple {4834#true} ~cond := #in~cond; {4834#true} is VALID
[2022-04-15 08:30:03,212 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-15 08:30:03,213 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-15 08:30:03,213 INFO L290 TraceCheckUtils]: 50: Hoare triple {4834#true} assume true; {4834#true} is VALID
[2022-04-15 08:30:03,213 INFO L290 TraceCheckUtils]: 49: Hoare triple {4834#true} assume !(0 == ~cond); {4834#true} is VALID
[2022-04-15 08:30:03,213 INFO L290 TraceCheckUtils]: 48: Hoare triple {4834#true} ~cond := #in~cond; {4834#true} is VALID
[2022-04-15 08:30:03,213 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-15 08:30:03,214 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-15 08:30:03,286 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-15 08:30:03,286 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-15 08:30:03,287 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-15 08:30:03,287 INFO L290 TraceCheckUtils]: 42: Hoare triple {4834#true} assume true; {4834#true} is VALID
[2022-04-15 08:30:03,287 INFO L290 TraceCheckUtils]: 41: Hoare triple {4834#true} assume !(0 == ~cond); {4834#true} is VALID
[2022-04-15 08:30:03,288 INFO L290 TraceCheckUtils]: 40: Hoare triple {4834#true} ~cond := #in~cond; {4834#true} is VALID
[2022-04-15 08:30:03,288 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-15 08:30:03,288 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-15 08:30:03,288 INFO L290 TraceCheckUtils]: 37: Hoare triple {4834#true} assume true; {4834#true} is VALID
[2022-04-15 08:30:03,288 INFO L290 TraceCheckUtils]: 36: Hoare triple {4834#true} assume !(0 == ~cond); {4834#true} is VALID
[2022-04-15 08:30:03,288 INFO L290 TraceCheckUtils]: 35: Hoare triple {4834#true} ~cond := #in~cond; {4834#true} is VALID
[2022-04-15 08:30:03,289 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-15 08:30:03,289 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-15 08:30:03,289 INFO L290 TraceCheckUtils]: 32: Hoare triple {4834#true} assume true; {4834#true} is VALID
[2022-04-15 08:30:03,289 INFO L290 TraceCheckUtils]: 31: Hoare triple {4834#true} assume !(0 == ~cond); {4834#true} is VALID
[2022-04-15 08:30:03,289 INFO L290 TraceCheckUtils]: 30: Hoare triple {4834#true} ~cond := #in~cond; {4834#true} is VALID
[2022-04-15 08:30:03,289 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-15 08:30:03,290 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-15 08:30:03,290 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-15 08:30:03,290 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {4834#true} {4834#true} #72#return; {4834#true} is VALID
[2022-04-15 08:30:03,290 INFO L290 TraceCheckUtils]: 25: Hoare triple {4834#true} assume true; {4834#true} is VALID
[2022-04-15 08:30:03,291 INFO L290 TraceCheckUtils]: 24: Hoare triple {4834#true} assume !(0 == ~cond); {4834#true} is VALID
[2022-04-15 08:30:03,291 INFO L290 TraceCheckUtils]: 23: Hoare triple {4834#true} ~cond := #in~cond; {4834#true} is VALID
[2022-04-15 08:30:03,291 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-15 08:30:03,291 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {4834#true} {4834#true} #70#return; {4834#true} is VALID
[2022-04-15 08:30:03,291 INFO L290 TraceCheckUtils]: 20: Hoare triple {4834#true} assume true; {4834#true} is VALID
[2022-04-15 08:30:03,291 INFO L290 TraceCheckUtils]: 19: Hoare triple {4834#true} assume !(0 == ~cond); {4834#true} is VALID
[2022-04-15 08:30:03,291 INFO L290 TraceCheckUtils]: 18: Hoare triple {4834#true} ~cond := #in~cond; {4834#true} is VALID
[2022-04-15 08:30:03,291 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-15 08:30:03,291 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {4834#true} {4834#true} #68#return; {4834#true} is VALID
[2022-04-15 08:30:03,291 INFO L290 TraceCheckUtils]: 15: Hoare triple {4834#true} assume true; {4834#true} is VALID
[2022-04-15 08:30:03,291 INFO L290 TraceCheckUtils]: 14: Hoare triple {4834#true} assume !(0 == ~cond); {4834#true} is VALID
[2022-04-15 08:30:03,291 INFO L290 TraceCheckUtils]: 13: Hoare triple {4834#true} ~cond := #in~cond; {4834#true} is VALID
[2022-04-15 08:30:03,291 INFO L272 TraceCheckUtils]: 12: Hoare triple {4834#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 10 then 1 else 0)); {4834#true} is VALID
[2022-04-15 08:30:03,292 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-15 08:30:03,292 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4834#true} {4834#true} #66#return; {4834#true} is VALID
[2022-04-15 08:30:03,292 INFO L290 TraceCheckUtils]: 9: Hoare triple {4834#true} assume true; {4834#true} is VALID
[2022-04-15 08:30:03,292 INFO L290 TraceCheckUtils]: 8: Hoare triple {4834#true} assume !(0 == ~cond); {4834#true} is VALID
[2022-04-15 08:30:03,292 INFO L290 TraceCheckUtils]: 7: Hoare triple {4834#true} ~cond := #in~cond; {4834#true} is VALID
[2022-04-15 08:30:03,292 INFO L272 TraceCheckUtils]: 6: Hoare triple {4834#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 10 then 1 else 0)); {4834#true} is VALID
[2022-04-15 08:30:03,292 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-15 08:30:03,292 INFO L272 TraceCheckUtils]: 4: Hoare triple {4834#true} call #t~ret6 := main(); {4834#true} is VALID
[2022-04-15 08:30:03,292 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4834#true} {4834#true} #88#return; {4834#true} is VALID
[2022-04-15 08:30:03,292 INFO L290 TraceCheckUtils]: 2: Hoare triple {4834#true} assume true; {4834#true} is VALID
[2022-04-15 08:30:03,292 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-15 08:30:03,292 INFO L272 TraceCheckUtils]: 0: Hoare triple {4834#true} call ULTIMATE.init(); {4834#true} is VALID
[2022-04-15 08:30:03,293 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-15 08:30:03,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-04-15 08:30:03,293 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1103792774]
[2022-04-15 08:30:03,293 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT
[2022-04-15 08:30:03,293 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [525892036]
[2022-04-15 08:30:03,293 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [525892036] provided 0 perfect and 2 imperfect interpolant sequences
[2022-04-15 08:30:03,293 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences.
[2022-04-15 08:30:03,293 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8
[2022-04-15 08:30:03,293 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace
[2022-04-15 08:30:03,293 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [177932080]
[2022-04-15 08:30:03,294 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [177932080] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-15 08:30:03,294 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-15 08:30:03,294 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2022-04-15 08:30:03,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [499075777]
[2022-04-15 08:30:03,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-04-15 08:30:03,294 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-15 08:30:03,294 INFO L84 Accepts]: Finished accepts. word is accepted.
[2022-04-15 08:30:03,294 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-15 08:30:03,329 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-15 08:30:03,330 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2022-04-15 08:30:03,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION
[2022-04-15 08:30:03,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2022-04-15 08:30:03,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56
[2022-04-15 08:30:03,330 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-15 08:30:03,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-15 08:30:03,706 INFO L93 Difference]: Finished difference Result 137 states and 178 transitions.
[2022-04-15 08:30:03,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2022-04-15 08:30:03,706 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-15 08:30:03,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-04-15 08:30:03,707 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-15 08:30:03,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 75 transitions.
[2022-04-15 08:30:03,708 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-15 08:30:03,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 75 transitions.
[2022-04-15 08:30:03,709 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 75 transitions.
[2022-04-15 08:30:03,791 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-15 08:30:03,796 INFO L225 Difference]: With dead ends: 137
[2022-04-15 08:30:03,796 INFO L226 Difference]: Without dead ends: 131
[2022-04-15 08:30:03,797 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-15 08:30:03,799 INFO L913 BasicCegarLoop]: 45 mSDtfsCounter, 8 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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.1s IncrementalHoareTripleChecker+Time
[2022-04-15 08:30:03,799 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.1s Time]
[2022-04-15 08:30:03,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states.
[2022-04-15 08:30:03,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131.
[2022-04-15 08:30:03,861 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2022-04-15 08:30:03,861 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-15 08:30:03,861 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-15 08:30:03,862 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-15 08:30:03,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-15 08:30:03,865 INFO L93 Difference]: Finished difference Result 131 states and 167 transitions.
[2022-04-15 08:30:03,865 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 167 transitions.
[2022-04-15 08:30:03,866 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-15 08:30:03,866 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-15 08:30:03,866 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-15 08:30:03,866 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-15 08:30:03,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-15 08:30:03,871 INFO L93 Difference]: Finished difference Result 131 states and 167 transitions.
[2022-04-15 08:30:03,871 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 167 transitions.
[2022-04-15 08:30:03,871 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-15 08:30:03,871 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-15 08:30:03,871 INFO L88 GeneralOperation]: Finished isEquivalent.
[2022-04-15 08:30:03,871 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2022-04-15 08:30:03,871 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-15 08:30:03,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 167 transitions.
[2022-04-15 08:30:03,875 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 167 transitions. Word has length 61
[2022-04-15 08:30:03,875 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-04-15 08:30:03,875 INFO L478 AbstractCegarLoop]: Abstraction has 131 states and 167 transitions.
[2022-04-15 08:30:03,875 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-15 08:30:03,875 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 131 states and 167 transitions.
[2022-04-15 08:30:04,045 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 167 edges. 167 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-15 08:30:04,045 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 167 transitions.
[2022-04-15 08:30:04,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70
[2022-04-15 08:30:04,046 INFO L491 BasicCegarLoop]: Found error trace
[2022-04-15 08:30:04,046 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-15 08:30:04,066 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0
[2022-04-15 08:30:04,246 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8
[2022-04-15 08:30:04,247 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-04-15 08:30:04,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-04-15 08:30:04,247 INFO L85 PathProgramCache]: Analyzing trace with hash 2064127436, now seen corresponding path program 1 times
[2022-04-15 08:30:04,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION
[2022-04-15 08:30:04,247 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1993433340]
[2022-04-15 08:30:04,248 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation
[2022-04-15 08:30:04,248 INFO L85 PathProgramCache]: Analyzing trace with hash 2064127436, now seen corresponding path program 2 times
[2022-04-15 08:30:04,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-04-15 08:30:04,248 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [53671425]
[2022-04-15 08:30:04,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-15 08:30:04,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-15 08:30:04,258 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic
[2022-04-15 08:30:04,259 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [676075350]
[2022-04-15 08:30:04,259 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2022-04-15 08:30:04,259 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-04-15 08:30:04,259 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-04-15 08:30:04,260 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2022-04-15 08:30:04,261 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process
[2022-04-15 08:30:04,296 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2022-04-15 08:30:04,296 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat
[2022-04-15 08:30:04,297 INFO L263 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 19 conjunts are in the unsatisfiable core
[2022-04-15 08:30:04,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-15 08:30:04,309 INFO L286 TraceCheckSpWp]: Computing forward predicates...
[2022-04-15 08:30:04,602 INFO L272 TraceCheckUtils]: 0: Hoare triple {6007#true} call ULTIMATE.init(); {6007#true} is VALID
[2022-04-15 08:30:04,602 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-15 08:30:04,602 INFO L290 TraceCheckUtils]: 2: Hoare triple {6007#true} assume true; {6007#true} is VALID
[2022-04-15 08:30:04,603 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6007#true} {6007#true} #88#return; {6007#true} is VALID
[2022-04-15 08:30:04,603 INFO L272 TraceCheckUtils]: 4: Hoare triple {6007#true} call #t~ret6 := main(); {6007#true} is VALID
[2022-04-15 08:30:04,603 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-15 08:30:04,603 INFO L272 TraceCheckUtils]: 6: Hoare triple {6007#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 10 then 1 else 0)); {6007#true} is VALID
[2022-04-15 08:30:04,603 INFO L290 TraceCheckUtils]: 7: Hoare triple {6007#true} ~cond := #in~cond; {6007#true} is VALID
[2022-04-15 08:30:04,603 INFO L290 TraceCheckUtils]: 8: Hoare triple {6007#true} assume !(0 == ~cond); {6007#true} is VALID
[2022-04-15 08:30:04,603 INFO L290 TraceCheckUtils]: 9: Hoare triple {6007#true} assume true; {6007#true} is VALID
[2022-04-15 08:30:04,603 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {6007#true} {6007#true} #66#return; {6007#true} is VALID
[2022-04-15 08:30:04,603 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-15 08:30:04,603 INFO L272 TraceCheckUtils]: 12: Hoare triple {6007#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 10 then 1 else 0)); {6007#true} is VALID
[2022-04-15 08:30:04,603 INFO L290 TraceCheckUtils]: 13: Hoare triple {6007#true} ~cond := #in~cond; {6007#true} is VALID
[2022-04-15 08:30:04,603 INFO L290 TraceCheckUtils]: 14: Hoare triple {6007#true} assume !(0 == ~cond); {6007#true} is VALID
[2022-04-15 08:30:04,603 INFO L290 TraceCheckUtils]: 15: Hoare triple {6007#true} assume true; {6007#true} is VALID
[2022-04-15 08:30:04,604 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {6007#true} {6007#true} #68#return; {6007#true} is VALID
[2022-04-15 08:30:04,604 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-15 08:30:04,604 INFO L290 TraceCheckUtils]: 18: Hoare triple {6007#true} ~cond := #in~cond; {6007#true} is VALID
[2022-04-15 08:30:04,604 INFO L290 TraceCheckUtils]: 19: Hoare triple {6007#true} assume !(0 == ~cond); {6007#true} is VALID
[2022-04-15 08:30:04,604 INFO L290 TraceCheckUtils]: 20: Hoare triple {6007#true} assume true; {6007#true} is VALID
[2022-04-15 08:30:04,604 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {6007#true} {6007#true} #70#return; {6007#true} is VALID
[2022-04-15 08:30:04,604 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-15 08:30:04,604 INFO L290 TraceCheckUtils]: 23: Hoare triple {6007#true} ~cond := #in~cond; {6007#true} is VALID
[2022-04-15 08:30:04,604 INFO L290 TraceCheckUtils]: 24: Hoare triple {6007#true} assume !(0 == ~cond); {6007#true} is VALID
[2022-04-15 08:30:04,604 INFO L290 TraceCheckUtils]: 25: Hoare triple {6007#true} assume true; {6007#true} is VALID
[2022-04-15 08:30:04,604 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {6007#true} {6007#true} #72#return; {6007#true} is VALID
[2022-04-15 08:30:04,606 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-15 08:30:04,606 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-15 08:30:04,606 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-15 08:30:04,606 INFO L290 TraceCheckUtils]: 30: Hoare triple {6007#true} ~cond := #in~cond; {6007#true} is VALID
[2022-04-15 08:30:04,606 INFO L290 TraceCheckUtils]: 31: Hoare triple {6007#true} assume !(0 == ~cond); {6007#true} is VALID
[2022-04-15 08:30:04,607 INFO L290 TraceCheckUtils]: 32: Hoare triple {6007#true} assume true; {6007#true} is VALID
[2022-04-15 08:30:04,608 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-15 08:30:04,608 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-15 08:30:04,608 INFO L290 TraceCheckUtils]: 35: Hoare triple {6007#true} ~cond := #in~cond; {6007#true} is VALID
[2022-04-15 08:30:04,608 INFO L290 TraceCheckUtils]: 36: Hoare triple {6007#true} assume !(0 == ~cond); {6007#true} is VALID
[2022-04-15 08:30:04,608 INFO L290 TraceCheckUtils]: 37: Hoare triple {6007#true} assume true; {6007#true} is VALID
[2022-04-15 08:30:04,609 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-15 08:30:04,609 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-15 08:30:04,609 INFO L290 TraceCheckUtils]: 40: Hoare triple {6007#true} ~cond := #in~cond; {6007#true} is VALID
[2022-04-15 08:30:04,609 INFO L290 TraceCheckUtils]: 41: Hoare triple {6007#true} assume !(0 == ~cond); {6007#true} is VALID
[2022-04-15 08:30:04,609 INFO L290 TraceCheckUtils]: 42: Hoare triple {6007#true} assume true; {6007#true} is VALID
[2022-04-15 08:30:04,610 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-15 08:30:04,610 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-15 08:30:04,611 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-15 08:30:04,611 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-15 08:30:04,611 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-15 08:30:04,611 INFO L290 TraceCheckUtils]: 48: Hoare triple {6007#true} ~cond := #in~cond; {6007#true} is VALID
[2022-04-15 08:30:04,611 INFO L290 TraceCheckUtils]: 49: Hoare triple {6007#true} assume !(0 == ~cond); {6007#true} is VALID
[2022-04-15 08:30:04,611 INFO L290 TraceCheckUtils]: 50: Hoare triple {6007#true} assume true; {6007#true} is VALID
[2022-04-15 08:30:04,612 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-15 08:30:04,612 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-15 08:30:04,612 INFO L290 TraceCheckUtils]: 53: Hoare triple {6007#true} ~cond := #in~cond; {6007#true} is VALID
[2022-04-15 08:30:04,612 INFO L290 TraceCheckUtils]: 54: Hoare triple {6007#true} assume !(0 == ~cond); {6007#true} is VALID
[2022-04-15 08:30:04,612 INFO L290 TraceCheckUtils]: 55: Hoare triple {6007#true} assume true; {6007#true} is VALID
[2022-04-15 08:30:04,613 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-15 08:30:04,613 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-15 08:30:04,613 INFO L290 TraceCheckUtils]: 58: Hoare triple {6007#true} ~cond := #in~cond; {6007#true} is VALID
[2022-04-15 08:30:04,613 INFO L290 TraceCheckUtils]: 59: Hoare triple {6007#true} assume !(0 == ~cond); {6007#true} is VALID
[2022-04-15 08:30:04,613 INFO L290 TraceCheckUtils]: 60: Hoare triple {6007#true} assume true; {6007#true} is VALID
[2022-04-15 08:30:04,614 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-15 08:30:04,614 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-15 08:30:04,614 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-15 08:30:04,615 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-15 08:30:04,615 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-15 08:30:04,616 INFO L290 TraceCheckUtils]: 66: Hoare triple {6210#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {6214#(<= 1 __VERIFIER_assert_~cond)} is VALID
[2022-04-15 08:30:04,616 INFO L290 TraceCheckUtils]: 67: Hoare triple {6214#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {6008#false} is VALID
[2022-04-15 08:30:04,616 INFO L290 TraceCheckUtils]: 68: Hoare triple {6008#false} assume !false; {6008#false} is VALID
[2022-04-15 08:30:04,616 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-15 08:30:04,617 INFO L328 TraceCheckSpWp]: Computing backward predicates...
[2022-04-15 08:30:04,834 INFO L290 TraceCheckUtils]: 68: Hoare triple {6008#false} assume !false; {6008#false} is VALID
[2022-04-15 08:30:04,834 INFO L290 TraceCheckUtils]: 67: Hoare triple {6214#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {6008#false} is VALID
[2022-04-15 08:30:04,835 INFO L290 TraceCheckUtils]: 66: Hoare triple {6210#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {6214#(<= 1 __VERIFIER_assert_~cond)} is VALID
[2022-04-15 08:30:04,835 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-15 08:30:04,836 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-15 08:30:04,838 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-15 08:30:04,838 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-15 08:30:04,839 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-15 08:30:04,839 INFO L290 TraceCheckUtils]: 60: Hoare triple {6007#true} assume true; {6007#true} is VALID
[2022-04-15 08:30:04,839 INFO L290 TraceCheckUtils]: 59: Hoare triple {6007#true} assume !(0 == ~cond); {6007#true} is VALID
[2022-04-15 08:30:04,839 INFO L290 TraceCheckUtils]: 58: Hoare triple {6007#true} ~cond := #in~cond; {6007#true} is VALID
[2022-04-15 08:30:04,839 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-15 08:30:04,840 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-15 08:30:04,840 INFO L290 TraceCheckUtils]: 55: Hoare triple {6007#true} assume true; {6007#true} is VALID
[2022-04-15 08:30:04,840 INFO L290 TraceCheckUtils]: 54: Hoare triple {6007#true} assume !(0 == ~cond); {6007#true} is VALID
[2022-04-15 08:30:04,840 INFO L290 TraceCheckUtils]: 53: Hoare triple {6007#true} ~cond := #in~cond; {6007#true} is VALID
[2022-04-15 08:30:04,840 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-15 08:30:04,841 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-15 08:30:04,841 INFO L290 TraceCheckUtils]: 50: Hoare triple {6007#true} assume true; {6007#true} is VALID
[2022-04-15 08:30:04,841 INFO L290 TraceCheckUtils]: 49: Hoare triple {6007#true} assume !(0 == ~cond); {6007#true} is VALID
[2022-04-15 08:30:04,841 INFO L290 TraceCheckUtils]: 48: Hoare triple {6007#true} ~cond := #in~cond; {6007#true} is VALID
[2022-04-15 08:30:04,841 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-15 08:30:04,841 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-15 08:30:04,843 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-15 08:30:04,844 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-15 08:30:04,844 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-15 08:30:04,844 INFO L290 TraceCheckUtils]: 42: Hoare triple {6007#true} assume true; {6007#true} is VALID
[2022-04-15 08:30:04,844 INFO L290 TraceCheckUtils]: 41: Hoare triple {6007#true} assume !(0 == ~cond); {6007#true} is VALID
[2022-04-15 08:30:04,844 INFO L290 TraceCheckUtils]: 40: Hoare triple {6007#true} ~cond := #in~cond; {6007#true} is VALID
[2022-04-15 08:30:04,844 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-15 08:30:04,845 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-15 08:30:04,845 INFO L290 TraceCheckUtils]: 37: Hoare triple {6007#true} assume true; {6007#true} is VALID
[2022-04-15 08:30:04,845 INFO L290 TraceCheckUtils]: 36: Hoare triple {6007#true} assume !(0 == ~cond); {6007#true} is VALID
[2022-04-15 08:30:04,845 INFO L290 TraceCheckUtils]: 35: Hoare triple {6007#true} ~cond := #in~cond; {6007#true} is VALID
[2022-04-15 08:30:04,845 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-15 08:30:04,848 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-15 08:30:04,849 INFO L290 TraceCheckUtils]: 32: Hoare triple {6007#true} assume true; {6007#true} is VALID
[2022-04-15 08:30:04,849 INFO L290 TraceCheckUtils]: 31: Hoare triple {6007#true} assume !(0 == ~cond); {6007#true} is VALID
[2022-04-15 08:30:04,849 INFO L290 TraceCheckUtils]: 30: Hoare triple {6007#true} ~cond := #in~cond; {6007#true} is VALID
[2022-04-15 08:30:04,849 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-15 08:30:04,849 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-15 08:30:04,850 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-15 08:30:04,850 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {6007#true} {6007#true} #72#return; {6007#true} is VALID
[2022-04-15 08:30:04,850 INFO L290 TraceCheckUtils]: 25: Hoare triple {6007#true} assume true; {6007#true} is VALID
[2022-04-15 08:30:04,850 INFO L290 TraceCheckUtils]: 24: Hoare triple {6007#true} assume !(0 == ~cond); {6007#true} is VALID
[2022-04-15 08:30:04,850 INFO L290 TraceCheckUtils]: 23: Hoare triple {6007#true} ~cond := #in~cond; {6007#true} is VALID
[2022-04-15 08:30:04,850 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-15 08:30:04,850 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {6007#true} {6007#true} #70#return; {6007#true} is VALID
[2022-04-15 08:30:04,850 INFO L290 TraceCheckUtils]: 20: Hoare triple {6007#true} assume true; {6007#true} is VALID
[2022-04-15 08:30:04,850 INFO L290 TraceCheckUtils]: 19: Hoare triple {6007#true} assume !(0 == ~cond); {6007#true} is VALID
[2022-04-15 08:30:04,850 INFO L290 TraceCheckUtils]: 18: Hoare triple {6007#true} ~cond := #in~cond; {6007#true} is VALID
[2022-04-15 08:30:04,850 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-15 08:30:04,850 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {6007#true} {6007#true} #68#return; {6007#true} is VALID
[2022-04-15 08:30:04,850 INFO L290 TraceCheckUtils]: 15: Hoare triple {6007#true} assume true; {6007#true} is VALID
[2022-04-15 08:30:04,851 INFO L290 TraceCheckUtils]: 14: Hoare triple {6007#true} assume !(0 == ~cond); {6007#true} is VALID
[2022-04-15 08:30:04,851 INFO L290 TraceCheckUtils]: 13: Hoare triple {6007#true} ~cond := #in~cond; {6007#true} is VALID
[2022-04-15 08:30:04,851 INFO L272 TraceCheckUtils]: 12: Hoare triple {6007#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 10 then 1 else 0)); {6007#true} is VALID
[2022-04-15 08:30:04,851 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-15 08:30:04,851 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {6007#true} {6007#true} #66#return; {6007#true} is VALID
[2022-04-15 08:30:04,851 INFO L290 TraceCheckUtils]: 9: Hoare triple {6007#true} assume true; {6007#true} is VALID
[2022-04-15 08:30:04,851 INFO L290 TraceCheckUtils]: 8: Hoare triple {6007#true} assume !(0 == ~cond); {6007#true} is VALID
[2022-04-15 08:30:04,851 INFO L290 TraceCheckUtils]: 7: Hoare triple {6007#true} ~cond := #in~cond; {6007#true} is VALID
[2022-04-15 08:30:04,851 INFO L272 TraceCheckUtils]: 6: Hoare triple {6007#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 10 then 1 else 0)); {6007#true} is VALID
[2022-04-15 08:30:04,851 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-15 08:30:04,851 INFO L272 TraceCheckUtils]: 4: Hoare triple {6007#true} call #t~ret6 := main(); {6007#true} is VALID
[2022-04-15 08:30:04,851 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6007#true} {6007#true} #88#return; {6007#true} is VALID
[2022-04-15 08:30:04,851 INFO L290 TraceCheckUtils]: 2: Hoare triple {6007#true} assume true; {6007#true} is VALID
[2022-04-15 08:30:04,851 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-15 08:30:04,852 INFO L272 TraceCheckUtils]: 0: Hoare triple {6007#true} call ULTIMATE.init(); {6007#true} is VALID
[2022-04-15 08:30:04,852 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-15 08:30:04,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-04-15 08:30:04,852 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [53671425]
[2022-04-15 08:30:04,852 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT
[2022-04-15 08:30:04,852 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [676075350]
[2022-04-15 08:30:04,852 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [676075350] provided 1 perfect and 1 imperfect interpolant sequences
[2022-04-15 08:30:04,852 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2022-04-15 08:30:04,852 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 8
[2022-04-15 08:30:04,853 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace
[2022-04-15 08:30:04,853 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1993433340]
[2022-04-15 08:30:04,853 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1993433340] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-15 08:30:04,853 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-15 08:30:04,853 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2022-04-15 08:30:04,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [773154085]
[2022-04-15 08:30:04,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-04-15 08:30:04,853 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-15 08:30:04,853 INFO L84 Accepts]: Finished accepts. word is accepted.
[2022-04-15 08:30:04,854 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-15 08:30:04,879 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-15 08:30:04,879 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2022-04-15 08:30:04,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION
[2022-04-15 08:30:04,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2022-04-15 08:30:04,880 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56
[2022-04-15 08:30:04,880 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-15 08:30:05,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-15 08:30:05,106 INFO L93 Difference]: Finished difference Result 137 states and 172 transitions.
[2022-04-15 08:30:05,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2022-04-15 08:30:05,106 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-15 08:30:05,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-04-15 08:30:05,106 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-15 08:30:05,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 47 transitions.
[2022-04-15 08:30:05,107 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-15 08:30:05,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 47 transitions.
[2022-04-15 08:30:05,108 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 47 transitions.
[2022-04-15 08:30:05,146 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-15 08:30:05,148 INFO L225 Difference]: With dead ends: 137
[2022-04-15 08:30:05,148 INFO L226 Difference]: Without dead ends: 132
[2022-04-15 08:30:05,149 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 128 SyntacticMatches, 3 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72
[2022-04-15 08:30:05,149 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-15 08:30:05,149 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-15 08:30:05,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states.
[2022-04-15 08:30:05,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 132.
[2022-04-15 08:30:05,211 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2022-04-15 08:30:05,211 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-15 08:30:05,212 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-15 08:30:05,212 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-15 08:30:05,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-15 08:30:05,214 INFO L93 Difference]: Finished difference Result 132 states and 164 transitions.
[2022-04-15 08:30:05,214 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 164 transitions.
[2022-04-15 08:30:05,215 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-15 08:30:05,215 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-15 08:30:05,215 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-15 08:30:05,215 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-15 08:30:05,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-15 08:30:05,218 INFO L93 Difference]: Finished difference Result 132 states and 164 transitions.
[2022-04-15 08:30:05,218 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 164 transitions.
[2022-04-15 08:30:05,218 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-15 08:30:05,218 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-15 08:30:05,218 INFO L88 GeneralOperation]: Finished isEquivalent.
[2022-04-15 08:30:05,218 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2022-04-15 08:30:05,219 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-15 08:30:05,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 164 transitions.
[2022-04-15 08:30:05,221 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 164 transitions. Word has length 69
[2022-04-15 08:30:05,221 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-04-15 08:30:05,221 INFO L478 AbstractCegarLoop]: Abstraction has 132 states and 164 transitions.
[2022-04-15 08:30:05,221 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-15 08:30:05,221 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 132 states and 164 transitions.
[2022-04-15 08:30:05,399 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-15 08:30:05,399 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 164 transitions.
[2022-04-15 08:30:05,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75
[2022-04-15 08:30:05,400 INFO L491 BasicCegarLoop]: Found error trace
[2022-04-15 08:30:05,400 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-15 08:30:05,421 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0
[2022-04-15 08:30:05,600 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9
[2022-04-15 08:30:05,601 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-04-15 08:30:05,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-04-15 08:30:05,601 INFO L85 PathProgramCache]: Analyzing trace with hash 1196252297, now seen corresponding path program 5 times
[2022-04-15 08:30:05,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION
[2022-04-15 08:30:05,601 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1534412439]
[2022-04-15 08:30:05,601 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation
[2022-04-15 08:30:05,601 INFO L85 PathProgramCache]: Analyzing trace with hash 1196252297, now seen corresponding path program 6 times
[2022-04-15 08:30:05,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-04-15 08:30:05,602 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [732897568]
[2022-04-15 08:30:05,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-15 08:30:05,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-15 08:30:05,613 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic
[2022-04-15 08:30:05,613 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [49460087]
[2022-04-15 08:30:05,613 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE
[2022-04-15 08:30:05,613 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-04-15 08:30:05,613 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-04-15 08:30:05,614 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2022-04-15 08:30:05,618 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process
[2022-04-15 08:30:05,666 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s)
[2022-04-15 08:30:05,666 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat
[2022-04-15 08:30:05,668 INFO L263 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 41 conjunts are in the unsatisfiable core
[2022-04-15 08:30:05,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-15 08:30:05,680 INFO L286 TraceCheckSpWp]: Computing forward predicates...
[2022-04-15 08:30:06,131 INFO L272 TraceCheckUtils]: 0: Hoare triple {7232#true} call ULTIMATE.init(); {7232#true} is VALID
[2022-04-15 08:30:06,131 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-15 08:30:06,131 INFO L290 TraceCheckUtils]: 2: Hoare triple {7232#true} assume true; {7232#true} is VALID
[2022-04-15 08:30:06,131 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7232#true} {7232#true} #88#return; {7232#true} is VALID
[2022-04-15 08:30:06,131 INFO L272 TraceCheckUtils]: 4: Hoare triple {7232#true} call #t~ret6 := main(); {7232#true} is VALID
[2022-04-15 08:30:06,131 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-15 08:30:06,131 INFO L272 TraceCheckUtils]: 6: Hoare triple {7232#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 10 then 1 else 0)); {7232#true} is VALID
[2022-04-15 08:30:06,131 INFO L290 TraceCheckUtils]: 7: Hoare triple {7232#true} ~cond := #in~cond; {7232#true} is VALID
[2022-04-15 08:30:06,131 INFO L290 TraceCheckUtils]: 8: Hoare triple {7232#true} assume !(0 == ~cond); {7232#true} is VALID
[2022-04-15 08:30:06,132 INFO L290 TraceCheckUtils]: 9: Hoare triple {7232#true} assume true; {7232#true} is VALID
[2022-04-15 08:30:06,132 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {7232#true} {7232#true} #66#return; {7232#true} is VALID
[2022-04-15 08:30:06,132 INFO L290 TraceCheckUtils]: 11: Hoare triple {7232#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {7232#true} is VALID
[2022-04-15 08:30:06,132 INFO L272 TraceCheckUtils]: 12: Hoare triple {7232#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 10 then 1 else 0)); {7232#true} is VALID
[2022-04-15 08:30:06,132 INFO L290 TraceCheckUtils]: 13: Hoare triple {7232#true} ~cond := #in~cond; {7232#true} is VALID
[2022-04-15 08:30:06,132 INFO L290 TraceCheckUtils]: 14: Hoare triple {7232#true} assume !(0 == ~cond); {7232#true} is VALID
[2022-04-15 08:30:06,132 INFO L290 TraceCheckUtils]: 15: Hoare triple {7232#true} assume true; {7232#true} is VALID
[2022-04-15 08:30:06,132 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {7232#true} {7232#true} #68#return; {7232#true} is VALID
[2022-04-15 08:30:06,132 INFO L272 TraceCheckUtils]: 17: Hoare triple {7232#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {7232#true} is VALID
[2022-04-15 08:30:06,132 INFO L290 TraceCheckUtils]: 18: Hoare triple {7232#true} ~cond := #in~cond; {7232#true} is VALID
[2022-04-15 08:30:06,132 INFO L290 TraceCheckUtils]: 19: Hoare triple {7232#true} assume !(0 == ~cond); {7232#true} is VALID
[2022-04-15 08:30:06,132 INFO L290 TraceCheckUtils]: 20: Hoare triple {7232#true} assume true; {7232#true} is VALID
[2022-04-15 08:30:06,132 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {7232#true} {7232#true} #70#return; {7232#true} is VALID
[2022-04-15 08:30:06,133 INFO L272 TraceCheckUtils]: 22: Hoare triple {7232#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {7232#true} is VALID
[2022-04-15 08:30:06,133 INFO L290 TraceCheckUtils]: 23: Hoare triple {7232#true} ~cond := #in~cond; {7232#true} is VALID
[2022-04-15 08:30:06,133 INFO L290 TraceCheckUtils]: 24: Hoare triple {7232#true} assume !(0 == ~cond); {7232#true} is VALID
[2022-04-15 08:30:06,133 INFO L290 TraceCheckUtils]: 25: Hoare triple {7232#true} assume true; {7232#true} is VALID
[2022-04-15 08:30:06,133 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {7232#true} {7232#true} #72#return; {7232#true} is VALID
[2022-04-15 08:30:06,139 INFO L290 TraceCheckUtils]: 27: Hoare triple {7232#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {7318#(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-15 08:30:06,140 INFO L290 TraceCheckUtils]: 28: Hoare triple {7318#(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; {7318#(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-15 08:30:06,140 INFO L272 TraceCheckUtils]: 29: Hoare triple {7318#(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)); {7232#true} is VALID
[2022-04-15 08:30:06,140 INFO L290 TraceCheckUtils]: 30: Hoare triple {7232#true} ~cond := #in~cond; {7232#true} is VALID
[2022-04-15 08:30:06,140 INFO L290 TraceCheckUtils]: 31: Hoare triple {7232#true} assume !(0 == ~cond); {7232#true} is VALID
[2022-04-15 08:30:06,140 INFO L290 TraceCheckUtils]: 32: Hoare triple {7232#true} assume true; {7232#true} is VALID
[2022-04-15 08:30:06,141 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {7232#true} {7318#(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; {7318#(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-15 08:30:06,141 INFO L272 TraceCheckUtils]: 34: Hoare triple {7318#(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)); {7232#true} is VALID
[2022-04-15 08:30:06,141 INFO L290 TraceCheckUtils]: 35: Hoare triple {7232#true} ~cond := #in~cond; {7232#true} is VALID
[2022-04-15 08:30:06,141 INFO L290 TraceCheckUtils]: 36: Hoare triple {7232#true} assume !(0 == ~cond); {7232#true} is VALID
[2022-04-15 08:30:06,141 INFO L290 TraceCheckUtils]: 37: Hoare triple {7232#true} assume true; {7232#true} is VALID
[2022-04-15 08:30:06,142 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {7232#true} {7318#(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; {7318#(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-15 08:30:06,142 INFO L272 TraceCheckUtils]: 39: Hoare triple {7318#(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)); {7232#true} is VALID
[2022-04-15 08:30:06,142 INFO L290 TraceCheckUtils]: 40: Hoare triple {7232#true} ~cond := #in~cond; {7232#true} is VALID
[2022-04-15 08:30:06,142 INFO L290 TraceCheckUtils]: 41: Hoare triple {7232#true} assume !(0 == ~cond); {7232#true} is VALID
[2022-04-15 08:30:06,142 INFO L290 TraceCheckUtils]: 42: Hoare triple {7232#true} assume true; {7232#true} is VALID
[2022-04-15 08:30:06,143 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {7232#true} {7318#(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; {7318#(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-15 08:30:06,143 INFO L290 TraceCheckUtils]: 44: Hoare triple {7318#(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); {7318#(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-15 08:30:06,144 INFO L290 TraceCheckUtils]: 45: Hoare triple {7318#(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;~a~0 := ~a~0 - ~b~0;~p~0 := ~p~0 - ~q~0;~r~0 := ~r~0 - ~s~0; {7373#(and (= main_~s~0 1) (= main_~p~0 (+ (* (- 1) main_~q~0) 1)) (= main_~b~0 main_~y~0) (= main_~r~0 (* (- 1) main_~s~0)) (= main_~q~0 0) (= main_~x~0 (+ main_~b~0 main_~a~0)))} is VALID
[2022-04-15 08:30:06,144 INFO L290 TraceCheckUtils]: 46: Hoare triple {7373#(and (= main_~s~0 1) (= main_~p~0 (+ (* (- 1) main_~q~0) 1)) (= main_~b~0 main_~y~0) (= main_~r~0 (* (- 1) main_~s~0)) (= main_~q~0 0) (= main_~x~0 (+ main_~b~0 main_~a~0)))} assume !false; {7373#(and (= main_~s~0 1) (= main_~p~0 (+ (* (- 1) main_~q~0) 1)) (= main_~b~0 main_~y~0) (= main_~r~0 (* (- 1) main_~s~0)) (= main_~q~0 0) (= main_~x~0 (+ main_~b~0 main_~a~0)))} is VALID
[2022-04-15 08:30:06,144 INFO L272 TraceCheckUtils]: 47: Hoare triple {7373#(and (= main_~s~0 1) (= main_~p~0 (+ (* (- 1) main_~q~0) 1)) (= main_~b~0 main_~y~0) (= main_~r~0 (* (- 1) main_~s~0)) (= main_~q~0 0) (= 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)); {7232#true} is VALID
[2022-04-15 08:30:06,144 INFO L290 TraceCheckUtils]: 48: Hoare triple {7232#true} ~cond := #in~cond; {7232#true} is VALID
[2022-04-15 08:30:06,144 INFO L290 TraceCheckUtils]: 49: Hoare triple {7232#true} assume !(0 == ~cond); {7232#true} is VALID
[2022-04-15 08:30:06,144 INFO L290 TraceCheckUtils]: 50: Hoare triple {7232#true} assume true; {7232#true} is VALID
[2022-04-15 08:30:06,148 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {7232#true} {7373#(and (= main_~s~0 1) (= main_~p~0 (+ (* (- 1) main_~q~0) 1)) (= main_~b~0 main_~y~0) (= main_~r~0 (* (- 1) main_~s~0)) (= main_~q~0 0) (= main_~x~0 (+ main_~b~0 main_~a~0)))} #74#return; {7373#(and (= main_~s~0 1) (= main_~p~0 (+ (* (- 1) main_~q~0) 1)) (= main_~b~0 main_~y~0) (= main_~r~0 (* (- 1) main_~s~0)) (= main_~q~0 0) (= main_~x~0 (+ main_~b~0 main_~a~0)))} is VALID
[2022-04-15 08:30:06,148 INFO L272 TraceCheckUtils]: 52: Hoare triple {7373#(and (= main_~s~0 1) (= main_~p~0 (+ (* (- 1) main_~q~0) 1)) (= main_~b~0 main_~y~0) (= main_~r~0 (* (- 1) main_~s~0)) (= main_~q~0 0) (= 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)); {7232#true} is VALID
[2022-04-15 08:30:06,149 INFO L290 TraceCheckUtils]: 53: Hoare triple {7232#true} ~cond := #in~cond; {7398#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID
[2022-04-15 08:30:06,149 INFO L290 TraceCheckUtils]: 54: Hoare triple {7398#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {7402#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID
[2022-04-15 08:30:06,149 INFO L290 TraceCheckUtils]: 55: Hoare triple {7402#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {7402#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID
[2022-04-15 08:30:06,150 INFO L284 TraceCheckUtils]: 56: Hoare quadruple {7402#(not (= |__VERIFIER_assert_#in~cond| 0))} {7373#(and (= main_~s~0 1) (= main_~p~0 (+ (* (- 1) main_~q~0) 1)) (= main_~b~0 main_~y~0) (= main_~r~0 (* (- 1) main_~s~0)) (= main_~q~0 0) (= main_~x~0 (+ main_~b~0 main_~a~0)))} #76#return; {7373#(and (= main_~s~0 1) (= main_~p~0 (+ (* (- 1) main_~q~0) 1)) (= main_~b~0 main_~y~0) (= main_~r~0 (* (- 1) main_~s~0)) (= main_~q~0 0) (= main_~x~0 (+ main_~b~0 main_~a~0)))} is VALID
[2022-04-15 08:30:06,150 INFO L272 TraceCheckUtils]: 57: Hoare triple {7373#(and (= main_~s~0 1) (= main_~p~0 (+ (* (- 1) main_~q~0) 1)) (= main_~b~0 main_~y~0) (= main_~r~0 (* (- 1) main_~s~0)) (= main_~q~0 0) (= 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)); {7232#true} is VALID
[2022-04-15 08:30:06,150 INFO L290 TraceCheckUtils]: 58: Hoare triple {7232#true} ~cond := #in~cond; {7232#true} is VALID
[2022-04-15 08:30:06,150 INFO L290 TraceCheckUtils]: 59: Hoare triple {7232#true} assume !(0 == ~cond); {7232#true} is VALID
[2022-04-15 08:30:06,150 INFO L290 TraceCheckUtils]: 60: Hoare triple {7232#true} assume true; {7232#true} is VALID
[2022-04-15 08:30:06,151 INFO L284 TraceCheckUtils]: 61: Hoare quadruple {7232#true} {7373#(and (= main_~s~0 1) (= main_~p~0 (+ (* (- 1) main_~q~0) 1)) (= main_~b~0 main_~y~0) (= main_~r~0 (* (- 1) main_~s~0)) (= main_~q~0 0) (= main_~x~0 (+ main_~b~0 main_~a~0)))} #78#return; {7373#(and (= main_~s~0 1) (= main_~p~0 (+ (* (- 1) main_~q~0) 1)) (= main_~b~0 main_~y~0) (= main_~r~0 (* (- 1) main_~s~0)) (= main_~q~0 0) (= main_~x~0 (+ main_~b~0 main_~a~0)))} is VALID
[2022-04-15 08:30:06,151 INFO L290 TraceCheckUtils]: 62: Hoare triple {7373#(and (= main_~s~0 1) (= main_~p~0 (+ (* (- 1) main_~q~0) 1)) (= main_~b~0 main_~y~0) (= main_~r~0 (* (- 1) main_~s~0)) (= main_~q~0 0) (= main_~x~0 (+ main_~b~0 main_~a~0)))} assume !!(~a~0 != ~b~0); {7373#(and (= main_~s~0 1) (= main_~p~0 (+ (* (- 1) main_~q~0) 1)) (= main_~b~0 main_~y~0) (= main_~r~0 (* (- 1) main_~s~0)) (= main_~q~0 0) (= main_~x~0 (+ main_~b~0 main_~a~0)))} is VALID
[2022-04-15 08:30:06,152 INFO L290 TraceCheckUtils]: 63: Hoare triple {7373#(and (= main_~s~0 1) (= main_~p~0 (+ (* (- 1) main_~q~0) 1)) (= main_~b~0 main_~y~0) (= main_~r~0 (* (- 1) main_~s~0)) (= main_~q~0 0) (= 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; {7430#(and (= (+ main_~s~0 main_~r~0) (* (- 1) main_~s~0)) (= main_~s~0 1) (= (+ main_~a~0 (* main_~y~0 2)) main_~x~0) (= main_~q~0 0) (= main_~p~0 (+ (* (- 2) main_~q~0) 1)))} is VALID
[2022-04-15 08:30:06,153 INFO L290 TraceCheckUtils]: 64: Hoare triple {7430#(and (= (+ main_~s~0 main_~r~0) (* (- 1) main_~s~0)) (= main_~s~0 1) (= (+ main_~a~0 (* main_~y~0 2)) main_~x~0) (= main_~q~0 0) (= main_~p~0 (+ (* (- 2) main_~q~0) 1)))} assume !false; {7430#(and (= (+ main_~s~0 main_~r~0) (* (- 1) main_~s~0)) (= main_~s~0 1) (= (+ main_~a~0 (* main_~y~0 2)) main_~x~0) (= main_~q~0 0) (= main_~p~0 (+ (* (- 2) main_~q~0) 1)))} is VALID
[2022-04-15 08:30:06,153 INFO L272 TraceCheckUtils]: 65: Hoare triple {7430#(and (= (+ main_~s~0 main_~r~0) (* (- 1) main_~s~0)) (= main_~s~0 1) (= (+ main_~a~0 (* main_~y~0 2)) main_~x~0) (= main_~q~0 0) (= main_~p~0 (+ (* (- 2) main_~q~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-15 08:30:06,153 INFO L290 TraceCheckUtils]: 66: Hoare triple {7232#true} ~cond := #in~cond; {7398#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID
[2022-04-15 08:30:06,153 INFO L290 TraceCheckUtils]: 67: Hoare triple {7398#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {7402#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID
[2022-04-15 08:30:06,154 INFO L290 TraceCheckUtils]: 68: Hoare triple {7402#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {7402#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID
[2022-04-15 08:30:06,154 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {7402#(not (= |__VERIFIER_assert_#in~cond| 0))} {7430#(and (= (+ main_~s~0 main_~r~0) (* (- 1) main_~s~0)) (= main_~s~0 1) (= (+ main_~a~0 (* main_~y~0 2)) main_~x~0) (= main_~q~0 0) (= main_~p~0 (+ (* (- 2) main_~q~0) 1)))} #74#return; {7449#(and (= (- 1) (+ main_~r~0 1)) (= (+ main_~a~0 (* main_~y~0 2)) main_~x~0) (= main_~p~0 1))} is VALID
[2022-04-15 08:30:06,155 INFO L272 TraceCheckUtils]: 70: Hoare triple {7449#(and (= (- 1) (+ main_~r~0 1)) (= (+ main_~a~0 (* main_~y~0 2)) 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)); {7453#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID
[2022-04-15 08:30:06,155 INFO L290 TraceCheckUtils]: 71: Hoare triple {7453#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {7457#(<= 1 __VERIFIER_assert_~cond)} is VALID
[2022-04-15 08:30:06,156 INFO L290 TraceCheckUtils]: 72: Hoare triple {7457#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {7233#false} is VALID
[2022-04-15 08:30:06,156 INFO L290 TraceCheckUtils]: 73: Hoare triple {7233#false} assume !false; {7233#false} is VALID
[2022-04-15 08:30:06,156 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 39 proven. 17 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked.
[2022-04-15 08:30:06,156 INFO L328 TraceCheckSpWp]: Computing backward predicates...
[2022-04-15 08:32:08,672 INFO L290 TraceCheckUtils]: 73: Hoare triple {7233#false} assume !false; {7233#false} is VALID
[2022-04-15 08:32:08,673 INFO L290 TraceCheckUtils]: 72: Hoare triple {7457#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {7233#false} is VALID
[2022-04-15 08:32:08,673 INFO L290 TraceCheckUtils]: 71: Hoare triple {7453#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {7457#(<= 1 __VERIFIER_assert_~cond)} is VALID
[2022-04-15 08:32:08,674 INFO L272 TraceCheckUtils]: 70: Hoare triple {7473#(= 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)); {7453#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID
[2022-04-15 08:32:08,675 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {7402#(not (= |__VERIFIER_assert_#in~cond| 0))} {7477#(or (not (= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1))) (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} #74#return; {7473#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID
[2022-04-15 08:32:08,675 INFO L290 TraceCheckUtils]: 68: Hoare triple {7402#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {7402#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID
[2022-04-15 08:32:08,675 INFO L290 TraceCheckUtils]: 67: Hoare triple {7487#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {7402#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID
[2022-04-15 08:32:08,675 INFO L290 TraceCheckUtils]: 66: Hoare triple {7232#true} ~cond := #in~cond; {7487#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID
[2022-04-15 08:32:08,676 INFO L272 TraceCheckUtils]: 65: Hoare triple {7477#(or (not (= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1))) (= 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)); {7232#true} is VALID
[2022-04-15 08:32:08,676 INFO L290 TraceCheckUtils]: 64: Hoare triple {7477#(or (not (= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1))) (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} assume !false; {7477#(or (not (= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1))) (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} is VALID
[2022-04-15 08:32:08,857 INFO L290 TraceCheckUtils]: 63: Hoare triple {7497#(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_~s~0 (+ main_~p~0 (* (- 1) main_~q~0))) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~q~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; {7477#(or (not (= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1))) (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} is VALID
[2022-04-15 08:32:08,858 INFO L290 TraceCheckUtils]: 62: Hoare triple {7497#(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_~s~0 (+ main_~p~0 (* (- 1) main_~q~0))) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~q~0) 1))))} assume !!(~a~0 != ~b~0); {7497#(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_~s~0 (+ main_~p~0 (* (- 1) main_~q~0))) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~q~0) 1))))} is VALID
[2022-04-15 08:32:08,858 INFO L284 TraceCheckUtils]: 61: Hoare quadruple {7232#true} {7497#(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_~s~0 (+ main_~p~0 (* (- 1) main_~q~0))) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~q~0) 1))))} #78#return; {7497#(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_~s~0 (+ main_~p~0 (* (- 1) main_~q~0))) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~q~0) 1))))} is VALID
[2022-04-15 08:32:08,859 INFO L290 TraceCheckUtils]: 60: Hoare triple {7232#true} assume true; {7232#true} is VALID
[2022-04-15 08:32:08,859 INFO L290 TraceCheckUtils]: 59: Hoare triple {7232#true} assume !(0 == ~cond); {7232#true} is VALID
[2022-04-15 08:32:08,859 INFO L290 TraceCheckUtils]: 58: Hoare triple {7232#true} ~cond := #in~cond; {7232#true} is VALID
[2022-04-15 08:32:08,859 INFO L272 TraceCheckUtils]: 57: Hoare triple {7497#(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_~s~0 (+ main_~p~0 (* (- 1) main_~q~0))) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~q~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-15 08:32:08,868 INFO L284 TraceCheckUtils]: 56: Hoare quadruple {7402#(not (= |__VERIFIER_assert_#in~cond| 0))} {7519#(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_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= (* main_~s~0 (+ main_~p~0 (* (- 1) main_~q~0))) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~q~0) 1))))} #76#return; {7497#(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_~s~0 (+ main_~p~0 (* (- 1) main_~q~0))) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~q~0) 1))))} is VALID
[2022-04-15 08:32:08,869 INFO L290 TraceCheckUtils]: 55: Hoare triple {7402#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {7402#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID
[2022-04-15 08:32:08,869 INFO L290 TraceCheckUtils]: 54: Hoare triple {7487#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {7402#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID
[2022-04-15 08:32:08,869 INFO L290 TraceCheckUtils]: 53: Hoare triple {7232#true} ~cond := #in~cond; {7487#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID
[2022-04-15 08:32:08,869 INFO L272 TraceCheckUtils]: 52: Hoare triple {7519#(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_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= (* main_~s~0 (+ main_~p~0 (* (- 1) main_~q~0))) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~q~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-15 08:32:08,870 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {7232#true} {7519#(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_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= (* main_~s~0 (+ main_~p~0 (* (- 1) main_~q~0))) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~q~0) 1))))} #74#return; {7519#(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_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= (* main_~s~0 (+ main_~p~0 (* (- 1) main_~q~0))) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~q~0) 1))))} is VALID
[2022-04-15 08:32:08,870 INFO L290 TraceCheckUtils]: 50: Hoare triple {7232#true} assume true; {7232#true} is VALID
[2022-04-15 08:32:08,870 INFO L290 TraceCheckUtils]: 49: Hoare triple {7232#true} assume !(0 == ~cond); {7232#true} is VALID
[2022-04-15 08:32:08,870 INFO L290 TraceCheckUtils]: 48: Hoare triple {7232#true} ~cond := #in~cond; {7232#true} is VALID
[2022-04-15 08:32:08,870 INFO L272 TraceCheckUtils]: 47: Hoare triple {7519#(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_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= (* main_~s~0 (+ main_~p~0 (* (- 1) main_~q~0))) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~q~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-15 08:32:08,871 INFO L290 TraceCheckUtils]: 46: Hoare triple {7519#(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_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= (* main_~s~0 (+ main_~p~0 (* (- 1) main_~q~0))) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~q~0) 1))))} assume !false; {7519#(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_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= (* main_~s~0 (+ main_~p~0 (* (- 1) main_~q~0))) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~q~0) 1))))} is VALID
[2022-04-15 08:32:10,003 INFO L290 TraceCheckUtils]: 45: Hoare triple {7553#(or (= (+ (* main_~x~0 (+ main_~p~0 (* (- 2) main_~q~0))) (* (+ (* (- 2) main_~s~0) main_~r~0) main_~y~0)) (+ (* (- 2) main_~b~0) main_~a~0)) (not (= (+ (* (+ (* (- 2) main_~s~0) main_~r~0) main_~q~0) 1) (* main_~s~0 (+ main_~p~0 (* (- 2) main_~q~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; {7519#(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_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= (* main_~s~0 (+ main_~p~0 (* (- 1) main_~q~0))) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~q~0) 1))))} is VALID
[2022-04-15 08:32:10,004 INFO L290 TraceCheckUtils]: 44: Hoare triple {7553#(or (= (+ (* main_~x~0 (+ main_~p~0 (* (- 2) main_~q~0))) (* (+ (* (- 2) main_~s~0) main_~r~0) main_~y~0)) (+ (* (- 2) main_~b~0) main_~a~0)) (not (= (+ (* (+ (* (- 2) main_~s~0) main_~r~0) main_~q~0) 1) (* main_~s~0 (+ main_~p~0 (* (- 2) main_~q~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); {7553#(or (= (+ (* main_~x~0 (+ main_~p~0 (* (- 2) main_~q~0))) (* (+ (* (- 2) main_~s~0) main_~r~0) main_~y~0)) (+ (* (- 2) main_~b~0) main_~a~0)) (not (= (+ (* (+ (* (- 2) main_~s~0) main_~r~0) main_~q~0) 1) (* main_~s~0 (+ main_~p~0 (* (- 2) main_~q~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-15 08:32:10,005 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {7232#true} {7553#(or (= (+ (* main_~x~0 (+ main_~p~0 (* (- 2) main_~q~0))) (* (+ (* (- 2) main_~s~0) main_~r~0) main_~y~0)) (+ (* (- 2) main_~b~0) main_~a~0)) (not (= (+ (* (+ (* (- 2) main_~s~0) main_~r~0) main_~q~0) 1) (* main_~s~0 (+ main_~p~0 (* (- 2) main_~q~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; {7553#(or (= (+ (* main_~x~0 (+ main_~p~0 (* (- 2) main_~q~0))) (* (+ (* (- 2) main_~s~0) main_~r~0) main_~y~0)) (+ (* (- 2) main_~b~0) main_~a~0)) (not (= (+ (* (+ (* (- 2) main_~s~0) main_~r~0) main_~q~0) 1) (* main_~s~0 (+ main_~p~0 (* (- 2) main_~q~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-15 08:32:10,005 INFO L290 TraceCheckUtils]: 42: Hoare triple {7232#true} assume true; {7232#true} is VALID
[2022-04-15 08:32:10,005 INFO L290 TraceCheckUtils]: 41: Hoare triple {7232#true} assume !(0 == ~cond); {7232#true} is VALID
[2022-04-15 08:32:10,005 INFO L290 TraceCheckUtils]: 40: Hoare triple {7232#true} ~cond := #in~cond; {7232#true} is VALID
[2022-04-15 08:32:10,005 INFO L272 TraceCheckUtils]: 39: Hoare triple {7553#(or (= (+ (* main_~x~0 (+ main_~p~0 (* (- 2) main_~q~0))) (* (+ (* (- 2) main_~s~0) main_~r~0) main_~y~0)) (+ (* (- 2) main_~b~0) main_~a~0)) (not (= (+ (* (+ (* (- 2) main_~s~0) main_~r~0) main_~q~0) 1) (* main_~s~0 (+ main_~p~0 (* (- 2) main_~q~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)); {7232#true} is VALID
[2022-04-15 08:32:10,006 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {7232#true} {7553#(or (= (+ (* main_~x~0 (+ main_~p~0 (* (- 2) main_~q~0))) (* (+ (* (- 2) main_~s~0) main_~r~0) main_~y~0)) (+ (* (- 2) main_~b~0) main_~a~0)) (not (= (+ (* (+ (* (- 2) main_~s~0) main_~r~0) main_~q~0) 1) (* main_~s~0 (+ main_~p~0 (* (- 2) main_~q~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; {7553#(or (= (+ (* main_~x~0 (+ main_~p~0 (* (- 2) main_~q~0))) (* (+ (* (- 2) main_~s~0) main_~r~0) main_~y~0)) (+ (* (- 2) main_~b~0) main_~a~0)) (not (= (+ (* (+ (* (- 2) main_~s~0) main_~r~0) main_~q~0) 1) (* main_~s~0 (+ main_~p~0 (* (- 2) main_~q~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-15 08:32:10,006 INFO L290 TraceCheckUtils]: 37: Hoare triple {7232#true} assume true; {7232#true} is VALID
[2022-04-15 08:32:10,006 INFO L290 TraceCheckUtils]: 36: Hoare triple {7232#true} assume !(0 == ~cond); {7232#true} is VALID
[2022-04-15 08:32:10,006 INFO L290 TraceCheckUtils]: 35: Hoare triple {7232#true} ~cond := #in~cond; {7232#true} is VALID
[2022-04-15 08:32:10,006 INFO L272 TraceCheckUtils]: 34: Hoare triple {7553#(or (= (+ (* main_~x~0 (+ main_~p~0 (* (- 2) main_~q~0))) (* (+ (* (- 2) main_~s~0) main_~r~0) main_~y~0)) (+ (* (- 2) main_~b~0) main_~a~0)) (not (= (+ (* (+ (* (- 2) main_~s~0) main_~r~0) main_~q~0) 1) (* main_~s~0 (+ main_~p~0 (* (- 2) main_~q~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)); {7232#true} is VALID
[2022-04-15 08:32:10,007 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {7232#true} {7553#(or (= (+ (* main_~x~0 (+ main_~p~0 (* (- 2) main_~q~0))) (* (+ (* (- 2) main_~s~0) main_~r~0) main_~y~0)) (+ (* (- 2) main_~b~0) main_~a~0)) (not (= (+ (* (+ (* (- 2) main_~s~0) main_~r~0) main_~q~0) 1) (* main_~s~0 (+ main_~p~0 (* (- 2) main_~q~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; {7553#(or (= (+ (* main_~x~0 (+ main_~p~0 (* (- 2) main_~q~0))) (* (+ (* (- 2) main_~s~0) main_~r~0) main_~y~0)) (+ (* (- 2) main_~b~0) main_~a~0)) (not (= (+ (* (+ (* (- 2) main_~s~0) main_~r~0) main_~q~0) 1) (* main_~s~0 (+ main_~p~0 (* (- 2) main_~q~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-15 08:32:10,007 INFO L290 TraceCheckUtils]: 32: Hoare triple {7232#true} assume true; {7232#true} is VALID
[2022-04-15 08:32:10,007 INFO L290 TraceCheckUtils]: 31: Hoare triple {7232#true} assume !(0 == ~cond); {7232#true} is VALID
[2022-04-15 08:32:10,007 INFO L290 TraceCheckUtils]: 30: Hoare triple {7232#true} ~cond := #in~cond; {7232#true} is VALID
[2022-04-15 08:32:10,007 INFO L272 TraceCheckUtils]: 29: Hoare triple {7553#(or (= (+ (* main_~x~0 (+ main_~p~0 (* (- 2) main_~q~0))) (* (+ (* (- 2) main_~s~0) main_~r~0) main_~y~0)) (+ (* (- 2) main_~b~0) main_~a~0)) (not (= (+ (* (+ (* (- 2) main_~s~0) main_~r~0) main_~q~0) 1) (* main_~s~0 (+ main_~p~0 (* (- 2) main_~q~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)); {7232#true} is VALID
[2022-04-15 08:32:10,008 INFO L290 TraceCheckUtils]: 28: Hoare triple {7553#(or (= (+ (* main_~x~0 (+ main_~p~0 (* (- 2) main_~q~0))) (* (+ (* (- 2) main_~s~0) main_~r~0) main_~y~0)) (+ (* (- 2) main_~b~0) main_~a~0)) (not (= (+ (* (+ (* (- 2) main_~s~0) main_~r~0) main_~q~0) 1) (* main_~s~0 (+ main_~p~0 (* (- 2) main_~q~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; {7553#(or (= (+ (* main_~x~0 (+ main_~p~0 (* (- 2) main_~q~0))) (* (+ (* (- 2) main_~s~0) main_~r~0) main_~y~0)) (+ (* (- 2) main_~b~0) main_~a~0)) (not (= (+ (* (+ (* (- 2) main_~s~0) main_~r~0) main_~q~0) 1) (* main_~s~0 (+ main_~p~0 (* (- 2) main_~q~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-15 08:32:10,008 INFO L290 TraceCheckUtils]: 27: Hoare triple {7232#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {7553#(or (= (+ (* main_~x~0 (+ main_~p~0 (* (- 2) main_~q~0))) (* (+ (* (- 2) main_~s~0) main_~r~0) main_~y~0)) (+ (* (- 2) main_~b~0) main_~a~0)) (not (= (+ (* (+ (* (- 2) main_~s~0) main_~r~0) main_~q~0) 1) (* main_~s~0 (+ main_~p~0 (* (- 2) main_~q~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-15 08:32:10,008 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {7232#true} {7232#true} #72#return; {7232#true} is VALID
[2022-04-15 08:32:10,008 INFO L290 TraceCheckUtils]: 25: Hoare triple {7232#true} assume true; {7232#true} is VALID
[2022-04-15 08:32:10,009 INFO L290 TraceCheckUtils]: 24: Hoare triple {7232#true} assume !(0 == ~cond); {7232#true} is VALID
[2022-04-15 08:32:10,009 INFO L290 TraceCheckUtils]: 23: Hoare triple {7232#true} ~cond := #in~cond; {7232#true} is VALID
[2022-04-15 08:32:10,009 INFO L272 TraceCheckUtils]: 22: Hoare triple {7232#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {7232#true} is VALID
[2022-04-15 08:32:10,009 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {7232#true} {7232#true} #70#return; {7232#true} is VALID
[2022-04-15 08:32:10,009 INFO L290 TraceCheckUtils]: 20: Hoare triple {7232#true} assume true; {7232#true} is VALID
[2022-04-15 08:32:10,009 INFO L290 TraceCheckUtils]: 19: Hoare triple {7232#true} assume !(0 == ~cond); {7232#true} is VALID
[2022-04-15 08:32:10,009 INFO L290 TraceCheckUtils]: 18: Hoare triple {7232#true} ~cond := #in~cond; {7232#true} is VALID
[2022-04-15 08:32:10,009 INFO L272 TraceCheckUtils]: 17: Hoare triple {7232#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {7232#true} is VALID
[2022-04-15 08:32:10,009 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {7232#true} {7232#true} #68#return; {7232#true} is VALID
[2022-04-15 08:32:10,009 INFO L290 TraceCheckUtils]: 15: Hoare triple {7232#true} assume true; {7232#true} is VALID
[2022-04-15 08:32:10,009 INFO L290 TraceCheckUtils]: 14: Hoare triple {7232#true} assume !(0 == ~cond); {7232#true} is VALID
[2022-04-15 08:32:10,009 INFO L290 TraceCheckUtils]: 13: Hoare triple {7232#true} ~cond := #in~cond; {7232#true} is VALID
[2022-04-15 08:32:10,010 INFO L272 TraceCheckUtils]: 12: Hoare triple {7232#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 10 then 1 else 0)); {7232#true} is VALID
[2022-04-15 08:32:10,010 INFO L290 TraceCheckUtils]: 11: Hoare triple {7232#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {7232#true} is VALID
[2022-04-15 08:32:10,010 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {7232#true} {7232#true} #66#return; {7232#true} is VALID
[2022-04-15 08:32:10,010 INFO L290 TraceCheckUtils]: 9: Hoare triple {7232#true} assume true; {7232#true} is VALID
[2022-04-15 08:32:10,010 INFO L290 TraceCheckUtils]: 8: Hoare triple {7232#true} assume !(0 == ~cond); {7232#true} is VALID
[2022-04-15 08:32:10,010 INFO L290 TraceCheckUtils]: 7: Hoare triple {7232#true} ~cond := #in~cond; {7232#true} is VALID
[2022-04-15 08:32:10,010 INFO L272 TraceCheckUtils]: 6: Hoare triple {7232#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 10 then 1 else 0)); {7232#true} is VALID
[2022-04-15 08:32:10,011 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-15 08:32:10,011 INFO L272 TraceCheckUtils]: 4: Hoare triple {7232#true} call #t~ret6 := main(); {7232#true} is VALID
[2022-04-15 08:32:10,011 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7232#true} {7232#true} #88#return; {7232#true} is VALID
[2022-04-15 08:32:10,011 INFO L290 TraceCheckUtils]: 2: Hoare triple {7232#true} assume true; {7232#true} is VALID
[2022-04-15 08:32:10,011 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-15 08:32:10,011 INFO L272 TraceCheckUtils]: 0: Hoare triple {7232#true} call ULTIMATE.init(); {7232#true} is VALID
[2022-04-15 08:32:10,011 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 42 proven. 14 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked.
[2022-04-15 08:32:10,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-04-15 08:32:10,012 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [732897568]
[2022-04-15 08:32:10,012 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT
[2022-04-15 08:32:10,012 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [49460087]
[2022-04-15 08:32:10,012 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [49460087] provided 0 perfect and 2 imperfect interpolant sequences
[2022-04-15 08:32:10,012 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences.
[2022-04-15 08:32:10,012 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 16
[2022-04-15 08:32:10,012 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace
[2022-04-15 08:32:10,012 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1534412439]
[2022-04-15 08:32:10,012 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1534412439] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-15 08:32:10,012 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-15 08:32:10,012 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10
[2022-04-15 08:32:10,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1162761685]
[2022-04-15 08:32:10,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-04-15 08:32:10,013 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 8 states have internal predecessors, (24), 5 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) Word has length 74
[2022-04-15 08:32:10,013 INFO L84 Accepts]: Finished accepts. word is accepted.
[2022-04-15 08:32:10,013 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 8 states have internal predecessors, (24), 5 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12)
[2022-04-15 08:32:10,054 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-15 08:32:10,055 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2022-04-15 08:32:10,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION
[2022-04-15 08:32:10,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2022-04-15 08:32:10,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240
[2022-04-15 08:32:10,056 INFO L87 Difference]: Start difference. First operand 132 states and 164 transitions. Second operand has 10 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 8 states have internal predecessors, (24), 5 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12)
[2022-04-15 08:32:11,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-15 08:32:11,237 INFO L93 Difference]: Finished difference Result 166 states and 206 transitions.
[2022-04-15 08:32:11,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states.
[2022-04-15 08:32:11,237 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 8 states have internal predecessors, (24), 5 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) Word has length 74
[2022-04-15 08:32:11,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-04-15 08:32:11,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 8 states have internal predecessors, (24), 5 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12)
[2022-04-15 08:32:11,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 95 transitions.
[2022-04-15 08:32:11,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 8 states have internal predecessors, (24), 5 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12)
[2022-04-15 08:32:11,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 95 transitions.
[2022-04-15 08:32:11,240 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 95 transitions.
[2022-04-15 08:32:11,329 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 95 edges. 95 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-15 08:32:11,331 INFO L225 Difference]: With dead ends: 166
[2022-04-15 08:32:11,332 INFO L226 Difference]: Without dead ends: 164
[2022-04-15 08:32:11,332 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 131 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=67, Invalid=239, Unknown=0, NotChecked=0, Total=306
[2022-04-15 08:32:11,332 INFO L913 BasicCegarLoop]: 42 mSDtfsCounter, 17 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 431 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 442 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 431 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time
[2022-04-15 08:32:11,332 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [26 Valid, 208 Invalid, 442 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 431 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time]
[2022-04-15 08:32:11,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states.
[2022-04-15 08:32:11,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 150.
[2022-04-15 08:32:11,428 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2022-04-15 08:32:11,428 INFO L82 GeneralOperation]: Start isEquivalent. First operand 164 states. Second operand has 150 states, 88 states have (on average 1.1477272727272727) internal successors, (101), 91 states have internal predecessors, (101), 42 states have call successors, (42), 20 states have call predecessors, (42), 19 states have return successors, (40), 38 states have call predecessors, (40), 40 states have call successors, (40)
[2022-04-15 08:32:11,429 INFO L74 IsIncluded]: Start isIncluded. First operand 164 states. Second operand has 150 states, 88 states have (on average 1.1477272727272727) internal successors, (101), 91 states have internal predecessors, (101), 42 states have call successors, (42), 20 states have call predecessors, (42), 19 states have return successors, (40), 38 states have call predecessors, (40), 40 states have call successors, (40)
[2022-04-15 08:32:11,429 INFO L87 Difference]: Start difference. First operand 164 states. Second operand has 150 states, 88 states have (on average 1.1477272727272727) internal successors, (101), 91 states have internal predecessors, (101), 42 states have call successors, (42), 20 states have call predecessors, (42), 19 states have return successors, (40), 38 states have call predecessors, (40), 40 states have call successors, (40)
[2022-04-15 08:32:11,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-15 08:32:11,432 INFO L93 Difference]: Finished difference Result 164 states and 204 transitions.
[2022-04-15 08:32:11,432 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 204 transitions.
[2022-04-15 08:32:11,433 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-15 08:32:11,433 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-15 08:32:11,433 INFO L74 IsIncluded]: Start isIncluded. First operand has 150 states, 88 states have (on average 1.1477272727272727) internal successors, (101), 91 states have internal predecessors, (101), 42 states have call successors, (42), 20 states have call predecessors, (42), 19 states have return successors, (40), 38 states have call predecessors, (40), 40 states have call successors, (40) Second operand 164 states.
[2022-04-15 08:32:11,433 INFO L87 Difference]: Start difference. First operand has 150 states, 88 states have (on average 1.1477272727272727) internal successors, (101), 91 states have internal predecessors, (101), 42 states have call successors, (42), 20 states have call predecessors, (42), 19 states have return successors, (40), 38 states have call predecessors, (40), 40 states have call successors, (40) Second operand 164 states.
[2022-04-15 08:32:11,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-15 08:32:11,436 INFO L93 Difference]: Finished difference Result 164 states and 204 transitions.
[2022-04-15 08:32:11,436 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 204 transitions.
[2022-04-15 08:32:11,436 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-15 08:32:11,436 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-15 08:32:11,436 INFO L88 GeneralOperation]: Finished isEquivalent.
[2022-04-15 08:32:11,436 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2022-04-15 08:32:11,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 88 states have (on average 1.1477272727272727) internal successors, (101), 91 states have internal predecessors, (101), 42 states have call successors, (42), 20 states have call predecessors, (42), 19 states have return successors, (40), 38 states have call predecessors, (40), 40 states have call successors, (40)
[2022-04-15 08:32:11,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 183 transitions.
[2022-04-15 08:32:11,439 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 183 transitions. Word has length 74
[2022-04-15 08:32:11,439 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-04-15 08:32:11,440 INFO L478 AbstractCegarLoop]: Abstraction has 150 states and 183 transitions.
[2022-04-15 08:32:11,440 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 8 states have internal predecessors, (24), 5 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12)
[2022-04-15 08:32:11,440 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 150 states and 183 transitions.
[2022-04-15 08:32:11,658 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 183 edges. 183 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-15 08:32:11,659 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 183 transitions.
[2022-04-15 08:32:11,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75
[2022-04-15 08:32:11,659 INFO L491 BasicCegarLoop]: Found error trace
[2022-04-15 08:32:11,659 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-15 08:32:11,676 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0
[2022-04-15 08:32:11,860 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10
[2022-04-15 08:32:11,860 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-04-15 08:32:11,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-04-15 08:32:11,860 INFO L85 PathProgramCache]: Analyzing trace with hash -1712511605, now seen corresponding path program 3 times
[2022-04-15 08:32:11,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION
[2022-04-15 08:32:11,860 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [804389914]
[2022-04-15 08:32:11,861 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation
[2022-04-15 08:32:11,861 INFO L85 PathProgramCache]: Analyzing trace with hash -1712511605, now seen corresponding path program 4 times
[2022-04-15 08:32:11,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-04-15 08:32:11,861 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2072361393]
[2022-04-15 08:32:11,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-15 08:32:11,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-15 08:32:11,888 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic
[2022-04-15 08:32:11,889 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1982009537]
[2022-04-15 08:32:11,889 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST
[2022-04-15 08:32:11,889 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-04-15 08:32:11,889 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-04-15 08:32:11,900 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2022-04-15 08:32:11,900 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process
[2022-04-15 08:32:11,943 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s)
[2022-04-15 08:32:11,943 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat
[2022-04-15 08:32:11,944 INFO L263 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 40 conjunts are in the unsatisfiable core
[2022-04-15 08:32:11,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-15 08:32:11,956 INFO L286 TraceCheckSpWp]: Computing forward predicates...
[2022-04-15 08:32:12,805 INFO L272 TraceCheckUtils]: 0: Hoare triple {8655#true} call ULTIMATE.init(); {8655#true} is VALID
[2022-04-15 08:32:12,805 INFO L290 TraceCheckUtils]: 1: Hoare triple {8655#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); {8655#true} is VALID
[2022-04-15 08:32:12,805 INFO L290 TraceCheckUtils]: 2: Hoare triple {8655#true} assume true; {8655#true} is VALID
[2022-04-15 08:32:12,805 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8655#true} {8655#true} #88#return; {8655#true} is VALID
[2022-04-15 08:32:12,805 INFO L272 TraceCheckUtils]: 4: Hoare triple {8655#true} call #t~ret6 := main(); {8655#true} is VALID
[2022-04-15 08:32:12,805 INFO L290 TraceCheckUtils]: 5: Hoare triple {8655#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; {8655#true} is VALID
[2022-04-15 08:32:12,805 INFO L272 TraceCheckUtils]: 6: Hoare triple {8655#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 10 then 1 else 0)); {8655#true} is VALID
[2022-04-15 08:32:12,806 INFO L290 TraceCheckUtils]: 7: Hoare triple {8655#true} ~cond := #in~cond; {8655#true} is VALID
[2022-04-15 08:32:12,806 INFO L290 TraceCheckUtils]: 8: Hoare triple {8655#true} assume !(0 == ~cond); {8655#true} is VALID
[2022-04-15 08:32:12,806 INFO L290 TraceCheckUtils]: 9: Hoare triple {8655#true} assume true; {8655#true} is VALID
[2022-04-15 08:32:12,806 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {8655#true} {8655#true} #66#return; {8655#true} is VALID
[2022-04-15 08:32:12,806 INFO L290 TraceCheckUtils]: 11: Hoare triple {8655#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {8655#true} is VALID
[2022-04-15 08:32:12,806 INFO L272 TraceCheckUtils]: 12: Hoare triple {8655#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 10 then 1 else 0)); {8655#true} is VALID
[2022-04-15 08:32:12,806 INFO L290 TraceCheckUtils]: 13: Hoare triple {8655#true} ~cond := #in~cond; {8655#true} is VALID
[2022-04-15 08:32:12,806 INFO L290 TraceCheckUtils]: 14: Hoare triple {8655#true} assume !(0 == ~cond); {8655#true} is VALID
[2022-04-15 08:32:12,806 INFO L290 TraceCheckUtils]: 15: Hoare triple {8655#true} assume true; {8655#true} is VALID
[2022-04-15 08:32:12,806 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {8655#true} {8655#true} #68#return; {8655#true} is VALID
[2022-04-15 08:32:12,806 INFO L272 TraceCheckUtils]: 17: Hoare triple {8655#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {8655#true} is VALID
[2022-04-15 08:32:12,807 INFO L290 TraceCheckUtils]: 18: Hoare triple {8655#true} ~cond := #in~cond; {8714#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID
[2022-04-15 08:32:12,807 INFO L290 TraceCheckUtils]: 19: Hoare triple {8714#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {8718#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID
[2022-04-15 08:32:12,807 INFO L290 TraceCheckUtils]: 20: Hoare triple {8718#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {8718#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID
[2022-04-15 08:32:12,808 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {8718#(not (= |assume_abort_if_not_#in~cond| 0))} {8655#true} #70#return; {8725#(<= 1 main_~x~0)} is VALID
[2022-04-15 08:32:12,808 INFO L272 TraceCheckUtils]: 22: Hoare triple {8725#(<= 1 main_~x~0)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {8655#true} is VALID
[2022-04-15 08:32:12,808 INFO L290 TraceCheckUtils]: 23: Hoare triple {8655#true} ~cond := #in~cond; {8655#true} is VALID
[2022-04-15 08:32:12,808 INFO L290 TraceCheckUtils]: 24: Hoare triple {8655#true} assume !(0 == ~cond); {8655#true} is VALID
[2022-04-15 08:32:12,808 INFO L290 TraceCheckUtils]: 25: Hoare triple {8655#true} assume true; {8655#true} is VALID
[2022-04-15 08:32:12,808 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {8655#true} {8725#(<= 1 main_~x~0)} #72#return; {8725#(<= 1 main_~x~0)} is VALID
[2022-04-15 08:32:12,809 INFO L290 TraceCheckUtils]: 27: Hoare triple {8725#(<= 1 main_~x~0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {8744#(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-15 08:32:12,809 INFO L290 TraceCheckUtils]: 28: Hoare triple {8744#(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; {8744#(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-15 08:32:12,809 INFO L272 TraceCheckUtils]: 29: Hoare triple {8744#(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)); {8655#true} is VALID
[2022-04-15 08:32:12,809 INFO L290 TraceCheckUtils]: 30: Hoare triple {8655#true} ~cond := #in~cond; {8655#true} is VALID
[2022-04-15 08:32:12,809 INFO L290 TraceCheckUtils]: 31: Hoare triple {8655#true} assume !(0 == ~cond); {8655#true} is VALID
[2022-04-15 08:32:12,809 INFO L290 TraceCheckUtils]: 32: Hoare triple {8655#true} assume true; {8655#true} is VALID
[2022-04-15 08:32:12,810 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {8655#true} {8744#(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; {8744#(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-15 08:32:12,810 INFO L272 TraceCheckUtils]: 34: Hoare triple {8744#(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)); {8655#true} is VALID
[2022-04-15 08:32:12,810 INFO L290 TraceCheckUtils]: 35: Hoare triple {8655#true} ~cond := #in~cond; {8655#true} is VALID
[2022-04-15 08:32:12,810 INFO L290 TraceCheckUtils]: 36: Hoare triple {8655#true} assume !(0 == ~cond); {8655#true} is VALID
[2022-04-15 08:32:12,810 INFO L290 TraceCheckUtils]: 37: Hoare triple {8655#true} assume true; {8655#true} is VALID
[2022-04-15 08:32:12,811 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {8655#true} {8744#(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; {8744#(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-15 08:32:12,811 INFO L272 TraceCheckUtils]: 39: Hoare triple {8744#(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)); {8655#true} is VALID
[2022-04-15 08:32:12,811 INFO L290 TraceCheckUtils]: 40: Hoare triple {8655#true} ~cond := #in~cond; {8655#true} is VALID
[2022-04-15 08:32:12,811 INFO L290 TraceCheckUtils]: 41: Hoare triple {8655#true} assume !(0 == ~cond); {8655#true} is VALID
[2022-04-15 08:32:12,811 INFO L290 TraceCheckUtils]: 42: Hoare triple {8655#true} assume true; {8655#true} is VALID
[2022-04-15 08:32:12,811 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {8655#true} {8744#(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; {8744#(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-15 08:32:12,813 INFO L290 TraceCheckUtils]: 44: Hoare triple {8744#(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); {8796#(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-15 08:32:12,814 INFO L290 TraceCheckUtils]: 45: Hoare triple {8796#(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; {8800#(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 (* (- 1) main_~p~0)) (= main_~p~0 1))} is VALID
[2022-04-15 08:32:12,815 INFO L290 TraceCheckUtils]: 46: Hoare triple {8800#(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 (* (- 1) main_~p~0)) (= main_~p~0 1))} assume !false; {8800#(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 (* (- 1) main_~p~0)) (= main_~p~0 1))} is VALID
[2022-04-15 08:32:12,815 INFO L272 TraceCheckUtils]: 47: Hoare triple {8800#(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 (* (- 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)); {8655#true} is VALID
[2022-04-15 08:32:12,815 INFO L290 TraceCheckUtils]: 48: Hoare triple {8655#true} ~cond := #in~cond; {8655#true} is VALID
[2022-04-15 08:32:12,815 INFO L290 TraceCheckUtils]: 49: Hoare triple {8655#true} assume !(0 == ~cond); {8655#true} is VALID
[2022-04-15 08:32:12,815 INFO L290 TraceCheckUtils]: 50: Hoare triple {8655#true} assume true; {8655#true} is VALID
[2022-04-15 08:32:12,816 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {8655#true} {8800#(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 (* (- 1) main_~p~0)) (= main_~p~0 1))} #74#return; {8800#(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 (* (- 1) main_~p~0)) (= main_~p~0 1))} is VALID
[2022-04-15 08:32:12,816 INFO L272 TraceCheckUtils]: 52: Hoare triple {8800#(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 (* (- 1) main_~p~0)) (= main_~p~0 1))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {8655#true} is VALID
[2022-04-15 08:32:12,816 INFO L290 TraceCheckUtils]: 53: Hoare triple {8655#true} ~cond := #in~cond; {8655#true} is VALID
[2022-04-15 08:32:12,816 INFO L290 TraceCheckUtils]: 54: Hoare triple {8655#true} assume !(0 == ~cond); {8655#true} is VALID
[2022-04-15 08:32:12,816 INFO L290 TraceCheckUtils]: 55: Hoare triple {8655#true} assume true; {8655#true} is VALID
[2022-04-15 08:32:12,817 INFO L284 TraceCheckUtils]: 56: Hoare quadruple {8655#true} {8800#(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 (* (- 1) main_~p~0)) (= main_~p~0 1))} #76#return; {8800#(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 (* (- 1) main_~p~0)) (= main_~p~0 1))} is VALID
[2022-04-15 08:32:12,817 INFO L272 TraceCheckUtils]: 57: Hoare triple {8800#(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 (* (- 1) main_~p~0)) (= main_~p~0 1))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {8655#true} is VALID
[2022-04-15 08:32:12,817 INFO L290 TraceCheckUtils]: 58: Hoare triple {8655#true} ~cond := #in~cond; {8840#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID
[2022-04-15 08:32:12,817 INFO L290 TraceCheckUtils]: 59: Hoare triple {8840#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {8844#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID
[2022-04-15 08:32:12,817 INFO L290 TraceCheckUtils]: 60: Hoare triple {8844#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {8844#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID
[2022-04-15 08:32:12,818 INFO L284 TraceCheckUtils]: 61: Hoare quadruple {8844#(not (= |__VERIFIER_assert_#in~cond| 0))} {8800#(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 (* (- 1) main_~p~0)) (= main_~p~0 1))} #78#return; {8800#(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 (* (- 1) main_~p~0)) (= main_~p~0 1))} is VALID
[2022-04-15 08:32:12,818 INFO L290 TraceCheckUtils]: 62: Hoare triple {8800#(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 (* (- 1) main_~p~0)) (= main_~p~0 1))} assume !!(~a~0 != ~b~0); {8800#(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 (* (- 1) main_~p~0)) (= main_~p~0 1))} is VALID
[2022-04-15 08:32:12,819 INFO L290 TraceCheckUtils]: 63: Hoare triple {8800#(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 (* (- 1) main_~p~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; {8857#(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-15 08:32:12,820 INFO L290 TraceCheckUtils]: 64: Hoare triple {8857#(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; {8857#(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-15 08:32:12,820 INFO L272 TraceCheckUtils]: 65: Hoare triple {8857#(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)); {8655#true} is VALID
[2022-04-15 08:32:12,820 INFO L290 TraceCheckUtils]: 66: Hoare triple {8655#true} ~cond := #in~cond; {8655#true} is VALID
[2022-04-15 08:32:12,820 INFO L290 TraceCheckUtils]: 67: Hoare triple {8655#true} assume !(0 == ~cond); {8655#true} is VALID
[2022-04-15 08:32:12,820 INFO L290 TraceCheckUtils]: 68: Hoare triple {8655#true} assume true; {8655#true} is VALID
[2022-04-15 08:32:12,821 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {8655#true} {8857#(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; {8857#(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-15 08:32:12,821 INFO L272 TraceCheckUtils]: 70: Hoare triple {8857#(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)); {8879#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID
[2022-04-15 08:32:12,822 INFO L290 TraceCheckUtils]: 71: Hoare triple {8879#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {8883#(<= 1 __VERIFIER_assert_~cond)} is VALID
[2022-04-15 08:32:12,822 INFO L290 TraceCheckUtils]: 72: Hoare triple {8883#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {8656#false} is VALID
[2022-04-15 08:32:12,822 INFO L290 TraceCheckUtils]: 73: Hoare triple {8656#false} assume !false; {8656#false} is VALID
[2022-04-15 08:32:12,822 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-15 08:32:12,822 INFO L328 TraceCheckSpWp]: Computing backward predicates...
[2022-04-15 08:32:38,248 INFO L290 TraceCheckUtils]: 73: Hoare triple {8656#false} assume !false; {8656#false} is VALID
[2022-04-15 08:32:38,249 INFO L290 TraceCheckUtils]: 72: Hoare triple {8883#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {8656#false} is VALID
[2022-04-15 08:32:38,249 INFO L290 TraceCheckUtils]: 71: Hoare triple {8879#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {8883#(<= 1 __VERIFIER_assert_~cond)} is VALID
[2022-04-15 08:32:38,250 INFO L272 TraceCheckUtils]: 70: Hoare triple {8899#(= 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)); {8879#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID
[2022-04-15 08:32:38,250 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {8655#true} {8899#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} #74#return; {8899#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID
[2022-04-15 08:32:38,250 INFO L290 TraceCheckUtils]: 68: Hoare triple {8655#true} assume true; {8655#true} is VALID
[2022-04-15 08:32:38,251 INFO L290 TraceCheckUtils]: 67: Hoare triple {8655#true} assume !(0 == ~cond); {8655#true} is VALID
[2022-04-15 08:32:38,251 INFO L290 TraceCheckUtils]: 66: Hoare triple {8655#true} ~cond := #in~cond; {8655#true} is VALID
[2022-04-15 08:32:38,251 INFO L272 TraceCheckUtils]: 65: Hoare triple {8899#(= 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)); {8655#true} is VALID
[2022-04-15 08:32:38,251 INFO L290 TraceCheckUtils]: 64: Hoare triple {8899#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} assume !false; {8899#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID
[2022-04-15 08:32:38,470 INFO L290 TraceCheckUtils]: 63: Hoare triple {8921#(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; {8899#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID
[2022-04-15 08:32:38,471 INFO L290 TraceCheckUtils]: 62: Hoare triple {8921#(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); {8921#(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-15 08:32:38,472 INFO L284 TraceCheckUtils]: 61: Hoare quadruple {8844#(not (= |__VERIFIER_assert_#in~cond| 0))} {8928#(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; {8921#(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-15 08:32:38,472 INFO L290 TraceCheckUtils]: 60: Hoare triple {8844#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {8844#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID
[2022-04-15 08:32:38,473 INFO L290 TraceCheckUtils]: 59: Hoare triple {8938#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {8844#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID
[2022-04-15 08:32:38,473 INFO L290 TraceCheckUtils]: 58: Hoare triple {8655#true} ~cond := #in~cond; {8938#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID
[2022-04-15 08:32:38,473 INFO L272 TraceCheckUtils]: 57: Hoare triple {8928#(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)); {8655#true} is VALID
[2022-04-15 08:32:38,474 INFO L284 TraceCheckUtils]: 56: Hoare quadruple {8655#true} {8928#(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; {8928#(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-15 08:32:38,474 INFO L290 TraceCheckUtils]: 55: Hoare triple {8655#true} assume true; {8655#true} is VALID
[2022-04-15 08:32:38,474 INFO L290 TraceCheckUtils]: 54: Hoare triple {8655#true} assume !(0 == ~cond); {8655#true} is VALID
[2022-04-15 08:32:38,474 INFO L290 TraceCheckUtils]: 53: Hoare triple {8655#true} ~cond := #in~cond; {8655#true} is VALID
[2022-04-15 08:32:38,474 INFO L272 TraceCheckUtils]: 52: Hoare triple {8928#(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)); {8655#true} is VALID
[2022-04-15 08:32:38,482 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {8655#true} {8928#(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; {8928#(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-15 08:32:38,483 INFO L290 TraceCheckUtils]: 50: Hoare triple {8655#true} assume true; {8655#true} is VALID
[2022-04-15 08:32:38,483 INFO L290 TraceCheckUtils]: 49: Hoare triple {8655#true} assume !(0 == ~cond); {8655#true} is VALID
[2022-04-15 08:32:38,483 INFO L290 TraceCheckUtils]: 48: Hoare triple {8655#true} ~cond := #in~cond; {8655#true} is VALID
[2022-04-15 08:32:38,483 INFO L272 TraceCheckUtils]: 47: Hoare triple {8928#(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)); {8655#true} is VALID
[2022-04-15 08:32:38,483 INFO L290 TraceCheckUtils]: 46: Hoare triple {8928#(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; {8928#(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-15 08:32:40,485 WARN L290 TraceCheckUtils]: 45: Hoare triple {8978#(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; {8928#(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 UNKNOWN
[2022-04-15 08:32:40,486 INFO L290 TraceCheckUtils]: 44: Hoare triple {8982#(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); {8978#(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-15 08:32:40,487 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {8655#true} {8982#(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; {8982#(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-15 08:32:40,487 INFO L290 TraceCheckUtils]: 42: Hoare triple {8655#true} assume true; {8655#true} is VALID
[2022-04-15 08:32:40,487 INFO L290 TraceCheckUtils]: 41: Hoare triple {8655#true} assume !(0 == ~cond); {8655#true} is VALID
[2022-04-15 08:32:40,487 INFO L290 TraceCheckUtils]: 40: Hoare triple {8655#true} ~cond := #in~cond; {8655#true} is VALID
[2022-04-15 08:32:40,487 INFO L272 TraceCheckUtils]: 39: Hoare triple {8982#(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)); {8655#true} is VALID
[2022-04-15 08:32:40,488 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {8655#true} {8982#(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; {8982#(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-15 08:32:40,488 INFO L290 TraceCheckUtils]: 37: Hoare triple {8655#true} assume true; {8655#true} is VALID
[2022-04-15 08:32:40,488 INFO L290 TraceCheckUtils]: 36: Hoare triple {8655#true} assume !(0 == ~cond); {8655#true} is VALID
[2022-04-15 08:32:40,488 INFO L290 TraceCheckUtils]: 35: Hoare triple {8655#true} ~cond := #in~cond; {8655#true} is VALID
[2022-04-15 08:32:40,488 INFO L272 TraceCheckUtils]: 34: Hoare triple {8982#(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)); {8655#true} is VALID
[2022-04-15 08:32:40,488 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {8655#true} {8982#(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; {8982#(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-15 08:32:40,489 INFO L290 TraceCheckUtils]: 32: Hoare triple {8655#true} assume true; {8655#true} is VALID
[2022-04-15 08:32:40,489 INFO L290 TraceCheckUtils]: 31: Hoare triple {8655#true} assume !(0 == ~cond); {8655#true} is VALID
[2022-04-15 08:32:40,489 INFO L290 TraceCheckUtils]: 30: Hoare triple {8655#true} ~cond := #in~cond; {8655#true} is VALID
[2022-04-15 08:32:40,489 INFO L272 TraceCheckUtils]: 29: Hoare triple {8982#(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)); {8655#true} is VALID
[2022-04-15 08:32:40,489 INFO L290 TraceCheckUtils]: 28: Hoare triple {8982#(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; {8982#(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-15 08:32:40,490 INFO L290 TraceCheckUtils]: 27: Hoare triple {8655#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {8982#(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-15 08:32:40,490 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {8655#true} {8655#true} #72#return; {8655#true} is VALID
[2022-04-15 08:32:40,490 INFO L290 TraceCheckUtils]: 25: Hoare triple {8655#true} assume true; {8655#true} is VALID
[2022-04-15 08:32:40,490 INFO L290 TraceCheckUtils]: 24: Hoare triple {8655#true} assume !(0 == ~cond); {8655#true} is VALID
[2022-04-15 08:32:40,490 INFO L290 TraceCheckUtils]: 23: Hoare triple {8655#true} ~cond := #in~cond; {8655#true} is VALID
[2022-04-15 08:32:40,490 INFO L272 TraceCheckUtils]: 22: Hoare triple {8655#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {8655#true} is VALID
[2022-04-15 08:32:40,490 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {8655#true} {8655#true} #70#return; {8655#true} is VALID
[2022-04-15 08:32:40,491 INFO L290 TraceCheckUtils]: 20: Hoare triple {8655#true} assume true; {8655#true} is VALID
[2022-04-15 08:32:40,491 INFO L290 TraceCheckUtils]: 19: Hoare triple {8655#true} assume !(0 == ~cond); {8655#true} is VALID
[2022-04-15 08:32:40,491 INFO L290 TraceCheckUtils]: 18: Hoare triple {8655#true} ~cond := #in~cond; {8655#true} is VALID
[2022-04-15 08:32:40,491 INFO L272 TraceCheckUtils]: 17: Hoare triple {8655#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {8655#true} is VALID
[2022-04-15 08:32:40,491 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {8655#true} {8655#true} #68#return; {8655#true} is VALID
[2022-04-15 08:32:40,491 INFO L290 TraceCheckUtils]: 15: Hoare triple {8655#true} assume true; {8655#true} is VALID
[2022-04-15 08:32:40,491 INFO L290 TraceCheckUtils]: 14: Hoare triple {8655#true} assume !(0 == ~cond); {8655#true} is VALID
[2022-04-15 08:32:40,491 INFO L290 TraceCheckUtils]: 13: Hoare triple {8655#true} ~cond := #in~cond; {8655#true} is VALID
[2022-04-15 08:32:40,491 INFO L272 TraceCheckUtils]: 12: Hoare triple {8655#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 10 then 1 else 0)); {8655#true} is VALID
[2022-04-15 08:32:40,491 INFO L290 TraceCheckUtils]: 11: Hoare triple {8655#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {8655#true} is VALID
[2022-04-15 08:32:40,491 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {8655#true} {8655#true} #66#return; {8655#true} is VALID
[2022-04-15 08:32:40,491 INFO L290 TraceCheckUtils]: 9: Hoare triple {8655#true} assume true; {8655#true} is VALID
[2022-04-15 08:32:40,491 INFO L290 TraceCheckUtils]: 8: Hoare triple {8655#true} assume !(0 == ~cond); {8655#true} is VALID
[2022-04-15 08:32:40,491 INFO L290 TraceCheckUtils]: 7: Hoare triple {8655#true} ~cond := #in~cond; {8655#true} is VALID
[2022-04-15 08:32:40,492 INFO L272 TraceCheckUtils]: 6: Hoare triple {8655#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 10 then 1 else 0)); {8655#true} is VALID
[2022-04-15 08:32:40,492 INFO L290 TraceCheckUtils]: 5: Hoare triple {8655#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; {8655#true} is VALID
[2022-04-15 08:32:40,492 INFO L272 TraceCheckUtils]: 4: Hoare triple {8655#true} call #t~ret6 := main(); {8655#true} is VALID
[2022-04-15 08:32:40,492 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8655#true} {8655#true} #88#return; {8655#true} is VALID
[2022-04-15 08:32:40,492 INFO L290 TraceCheckUtils]: 2: Hoare triple {8655#true} assume true; {8655#true} is VALID
[2022-04-15 08:32:40,492 INFO L290 TraceCheckUtils]: 1: Hoare triple {8655#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); {8655#true} is VALID
[2022-04-15 08:32:40,492 INFO L272 TraceCheckUtils]: 0: Hoare triple {8655#true} call ULTIMATE.init(); {8655#true} is VALID
[2022-04-15 08:32:40,492 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-15 08:32:40,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-04-15 08:32:40,492 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2072361393]
[2022-04-15 08:32:40,493 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT
[2022-04-15 08:32:40,493 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1982009537]
[2022-04-15 08:32:40,493 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1982009537] provided 0 perfect and 2 imperfect interpolant sequences
[2022-04-15 08:32:40,493 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences.
[2022-04-15 08:32:40,493 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11] total 19
[2022-04-15 08:32:40,493 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace
[2022-04-15 08:32:40,493 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [804389914]
[2022-04-15 08:32:40,493 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [804389914] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-15 08:32:40,493 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-15 08:32:40,493 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13
[2022-04-15 08:32:40,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1378112808]
[2022-04-15 08:32:40,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-04-15 08:32:40,494 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-15 08:32:40,494 INFO L84 Accepts]: Finished accepts. word is accepted.
[2022-04-15 08:32:40,494 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-15 08:32:40,546 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-15 08:32:40,547 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 13 states
[2022-04-15 08:32:40,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION
[2022-04-15 08:32:40,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants.
[2022-04-15 08:32:40,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=274, Unknown=0, NotChecked=0, Total=342
[2022-04-15 08:32:40,547 INFO L87 Difference]: Start difference. First operand 150 states and 183 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-15 08:32:42,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-15 08:32:42,855 INFO L93 Difference]: Finished difference Result 188 states and 228 transitions.
[2022-04-15 08:32:42,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states.
[2022-04-15 08:32:42,855 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-15 08:32:42,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-04-15 08:32:42,856 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-15 08:32:42,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 85 transitions.
[2022-04-15 08:32:42,857 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-15 08:32:42,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 85 transitions.
[2022-04-15 08:32:42,858 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 85 transitions.
[2022-04-15 08:32:42,943 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-15 08:32:42,946 INFO L225 Difference]: With dead ends: 188
[2022-04-15 08:32:42,946 INFO L226 Difference]: Without dead ends: 186
[2022-04-15 08:32:42,947 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-15 08:32:42,947 INFO L913 BasicCegarLoop]: 36 mSDtfsCounter, 24 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 543 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 559 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 543 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time
[2022-04-15 08:32:42,947 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [35 Valid, 190 Invalid, 559 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 543 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time]
[2022-04-15 08:32:42,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states.
[2022-04-15 08:32:43,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 172.
[2022-04-15 08:32:43,104 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2022-04-15 08:32:43,105 INFO L82 GeneralOperation]: Start isEquivalent. First operand 186 states. Second operand has 172 states, 103 states have (on average 1.1359223300970873) internal successors, (117), 106 states have internal predecessors, (117), 45 states have call successors, (45), 24 states have call predecessors, (45), 23 states have return successors, (43), 41 states have call predecessors, (43), 43 states have call successors, (43)
[2022-04-15 08:32:43,105 INFO L74 IsIncluded]: Start isIncluded. First operand 186 states. Second operand has 172 states, 103 states have (on average 1.1359223300970873) internal successors, (117), 106 states have internal predecessors, (117), 45 states have call successors, (45), 24 states have call predecessors, (45), 23 states have return successors, (43), 41 states have call predecessors, (43), 43 states have call successors, (43)
[2022-04-15 08:32:43,105 INFO L87 Difference]: Start difference. First operand 186 states. Second operand has 172 states, 103 states have (on average 1.1359223300970873) internal successors, (117), 106 states have internal predecessors, (117), 45 states have call successors, (45), 24 states have call predecessors, (45), 23 states have return successors, (43), 41 states have call predecessors, (43), 43 states have call successors, (43)
[2022-04-15 08:32:43,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-15 08:32:43,108 INFO L93 Difference]: Finished difference Result 186 states and 226 transitions.
[2022-04-15 08:32:43,108 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 226 transitions.
[2022-04-15 08:32:43,109 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-15 08:32:43,109 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-15 08:32:43,109 INFO L74 IsIncluded]: Start isIncluded. First operand has 172 states, 103 states have (on average 1.1359223300970873) internal successors, (117), 106 states have internal predecessors, (117), 45 states have call successors, (45), 24 states have call predecessors, (45), 23 states have return successors, (43), 41 states have call predecessors, (43), 43 states have call successors, (43) Second operand 186 states.
[2022-04-15 08:32:43,109 INFO L87 Difference]: Start difference. First operand has 172 states, 103 states have (on average 1.1359223300970873) internal successors, (117), 106 states have internal predecessors, (117), 45 states have call successors, (45), 24 states have call predecessors, (45), 23 states have return successors, (43), 41 states have call predecessors, (43), 43 states have call successors, (43) Second operand 186 states.
[2022-04-15 08:32:43,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-15 08:32:43,112 INFO L93 Difference]: Finished difference Result 186 states and 226 transitions.
[2022-04-15 08:32:43,112 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 226 transitions.
[2022-04-15 08:32:43,113 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-15 08:32:43,113 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-15 08:32:43,113 INFO L88 GeneralOperation]: Finished isEquivalent.
[2022-04-15 08:32:43,113 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2022-04-15 08:32:43,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 103 states have (on average 1.1359223300970873) internal successors, (117), 106 states have internal predecessors, (117), 45 states have call successors, (45), 24 states have call predecessors, (45), 23 states have return successors, (43), 41 states have call predecessors, (43), 43 states have call successors, (43)
[2022-04-15 08:32:43,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 205 transitions.
[2022-04-15 08:32:43,116 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 205 transitions. Word has length 74
[2022-04-15 08:32:43,116 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-04-15 08:32:43,116 INFO L478 AbstractCegarLoop]: Abstraction has 172 states and 205 transitions.
[2022-04-15 08:32:43,116 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-15 08:32:43,117 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 172 states and 205 transitions.
[2022-04-15 08:32:43,388 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 205 edges. 205 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-15 08:32:43,389 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 205 transitions.
[2022-04-15 08:32:43,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80
[2022-04-15 08:32:43,389 INFO L491 BasicCegarLoop]: Found error trace
[2022-04-15 08:32:43,389 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-15 08:32:43,406 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0
[2022-04-15 08:32:43,596 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11
[2022-04-15 08:32:43,596 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-04-15 08:32:43,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-04-15 08:32:43,597 INFO L85 PathProgramCache]: Analyzing trace with hash 15858924, now seen corresponding path program 5 times
[2022-04-15 08:32:43,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION
[2022-04-15 08:32:43,597 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [55233363]
[2022-04-15 08:32:43,597 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation
[2022-04-15 08:32:43,597 INFO L85 PathProgramCache]: Analyzing trace with hash 15858924, now seen corresponding path program 6 times
[2022-04-15 08:32:43,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-04-15 08:32:43,597 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [137823583]
[2022-04-15 08:32:43,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-15 08:32:43,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-15 08:32:43,607 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic
[2022-04-15 08:32:43,607 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1561751122]
[2022-04-15 08:32:43,608 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE
[2022-04-15 08:32:43,608 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-04-15 08:32:43,608 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-04-15 08:32:43,608 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2022-04-15 08:32:43,609 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process
[2022-04-15 08:32:43,669 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s)
[2022-04-15 08:32:43,669 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat
[2022-04-15 08:32:43,670 INFO L263 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 24 conjunts are in the unsatisfiable core
[2022-04-15 08:32:43,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-15 08:32:43,692 INFO L286 TraceCheckSpWp]: Computing forward predicates...
[2022-04-15 08:32:43,996 INFO L272 TraceCheckUtils]: 0: Hoare triple {10215#true} call ULTIMATE.init(); {10215#true} is VALID
[2022-04-15 08:32:43,996 INFO L290 TraceCheckUtils]: 1: Hoare triple {10215#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); {10215#true} is VALID
[2022-04-15 08:32:43,996 INFO L290 TraceCheckUtils]: 2: Hoare triple {10215#true} assume true; {10215#true} is VALID
[2022-04-15 08:32:43,996 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10215#true} {10215#true} #88#return; {10215#true} is VALID
[2022-04-15 08:32:43,996 INFO L272 TraceCheckUtils]: 4: Hoare triple {10215#true} call #t~ret6 := main(); {10215#true} is VALID
[2022-04-15 08:32:43,996 INFO L290 TraceCheckUtils]: 5: Hoare triple {10215#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; {10215#true} is VALID
[2022-04-15 08:32:43,996 INFO L272 TraceCheckUtils]: 6: Hoare triple {10215#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 10 then 1 else 0)); {10215#true} is VALID
[2022-04-15 08:32:43,996 INFO L290 TraceCheckUtils]: 7: Hoare triple {10215#true} ~cond := #in~cond; {10215#true} is VALID
[2022-04-15 08:32:43,996 INFO L290 TraceCheckUtils]: 8: Hoare triple {10215#true} assume !(0 == ~cond); {10215#true} is VALID
[2022-04-15 08:32:43,996 INFO L290 TraceCheckUtils]: 9: Hoare triple {10215#true} assume true; {10215#true} is VALID
[2022-04-15 08:32:43,996 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {10215#true} {10215#true} #66#return; {10215#true} is VALID
[2022-04-15 08:32:43,997 INFO L290 TraceCheckUtils]: 11: Hoare triple {10215#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {10215#true} is VALID
[2022-04-15 08:32:43,997 INFO L272 TraceCheckUtils]: 12: Hoare triple {10215#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 10 then 1 else 0)); {10215#true} is VALID
[2022-04-15 08:32:43,997 INFO L290 TraceCheckUtils]: 13: Hoare triple {10215#true} ~cond := #in~cond; {10215#true} is VALID
[2022-04-15 08:32:43,997 INFO L290 TraceCheckUtils]: 14: Hoare triple {10215#true} assume !(0 == ~cond); {10215#true} is VALID
[2022-04-15 08:32:43,997 INFO L290 TraceCheckUtils]: 15: Hoare triple {10215#true} assume true; {10215#true} is VALID
[2022-04-15 08:32:43,997 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {10215#true} {10215#true} #68#return; {10215#true} is VALID
[2022-04-15 08:32:43,997 INFO L272 TraceCheckUtils]: 17: Hoare triple {10215#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {10215#true} is VALID
[2022-04-15 08:32:43,997 INFO L290 TraceCheckUtils]: 18: Hoare triple {10215#true} ~cond := #in~cond; {10215#true} is VALID
[2022-04-15 08:32:43,997 INFO L290 TraceCheckUtils]: 19: Hoare triple {10215#true} assume !(0 == ~cond); {10215#true} is VALID
[2022-04-15 08:32:43,997 INFO L290 TraceCheckUtils]: 20: Hoare triple {10215#true} assume true; {10215#true} is VALID
[2022-04-15 08:32:43,997 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {10215#true} {10215#true} #70#return; {10215#true} is VALID
[2022-04-15 08:32:43,997 INFO L272 TraceCheckUtils]: 22: Hoare triple {10215#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {10215#true} is VALID
[2022-04-15 08:32:43,997 INFO L290 TraceCheckUtils]: 23: Hoare triple {10215#true} ~cond := #in~cond; {10215#true} is VALID
[2022-04-15 08:32:43,997 INFO L290 TraceCheckUtils]: 24: Hoare triple {10215#true} assume !(0 == ~cond); {10215#true} is VALID
[2022-04-15 08:32:43,998 INFO L290 TraceCheckUtils]: 25: Hoare triple {10215#true} assume true; {10215#true} is VALID
[2022-04-15 08:32:43,998 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {10215#true} {10215#true} #72#return; {10215#true} is VALID
[2022-04-15 08:32:43,998 INFO L290 TraceCheckUtils]: 27: Hoare triple {10215#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {10301#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID
[2022-04-15 08:32:43,998 INFO L290 TraceCheckUtils]: 28: Hoare triple {10301#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} assume !false; {10301#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID
[2022-04-15 08:32:43,998 INFO L272 TraceCheckUtils]: 29: Hoare triple {10301#(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)); {10215#true} is VALID
[2022-04-15 08:32:43,998 INFO L290 TraceCheckUtils]: 30: Hoare triple {10215#true} ~cond := #in~cond; {10215#true} is VALID
[2022-04-15 08:32:43,999 INFO L290 TraceCheckUtils]: 31: Hoare triple {10215#true} assume !(0 == ~cond); {10215#true} is VALID
[2022-04-15 08:32:43,999 INFO L290 TraceCheckUtils]: 32: Hoare triple {10215#true} assume true; {10215#true} is VALID
[2022-04-15 08:32:43,999 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {10215#true} {10301#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} #74#return; {10301#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID
[2022-04-15 08:32:43,999 INFO L272 TraceCheckUtils]: 34: Hoare triple {10301#(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)); {10215#true} is VALID
[2022-04-15 08:32:43,999 INFO L290 TraceCheckUtils]: 35: Hoare triple {10215#true} ~cond := #in~cond; {10215#true} is VALID
[2022-04-15 08:32:43,999 INFO L290 TraceCheckUtils]: 36: Hoare triple {10215#true} assume !(0 == ~cond); {10215#true} is VALID
[2022-04-15 08:32:44,000 INFO L290 TraceCheckUtils]: 37: Hoare triple {10215#true} assume true; {10215#true} is VALID
[2022-04-15 08:32:44,000 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {10215#true} {10301#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} #76#return; {10301#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID
[2022-04-15 08:32:44,000 INFO L272 TraceCheckUtils]: 39: Hoare triple {10301#(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)); {10215#true} is VALID
[2022-04-15 08:32:44,000 INFO L290 TraceCheckUtils]: 40: Hoare triple {10215#true} ~cond := #in~cond; {10215#true} is VALID
[2022-04-15 08:32:44,000 INFO L290 TraceCheckUtils]: 41: Hoare triple {10215#true} assume !(0 == ~cond); {10215#true} is VALID
[2022-04-15 08:32:44,000 INFO L290 TraceCheckUtils]: 42: Hoare triple {10215#true} assume true; {10215#true} is VALID
[2022-04-15 08:32:44,001 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {10215#true} {10301#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} #78#return; {10301#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID
[2022-04-15 08:32:44,001 INFO L290 TraceCheckUtils]: 44: Hoare triple {10301#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} assume !!(~a~0 != ~b~0); {10301#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID
[2022-04-15 08:32:44,002 INFO L290 TraceCheckUtils]: 45: Hoare triple {10301#(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; {10301#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID
[2022-04-15 08:32:44,002 INFO L290 TraceCheckUtils]: 46: Hoare triple {10301#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} assume !false; {10301#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID
[2022-04-15 08:32:44,002 INFO L272 TraceCheckUtils]: 47: Hoare triple {10301#(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)); {10215#true} is VALID
[2022-04-15 08:32:44,002 INFO L290 TraceCheckUtils]: 48: Hoare triple {10215#true} ~cond := #in~cond; {10215#true} is VALID
[2022-04-15 08:32:44,002 INFO L290 TraceCheckUtils]: 49: Hoare triple {10215#true} assume !(0 == ~cond); {10215#true} is VALID
[2022-04-15 08:32:44,002 INFO L290 TraceCheckUtils]: 50: Hoare triple {10215#true} assume true; {10215#true} is VALID
[2022-04-15 08:32:44,003 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {10215#true} {10301#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} #74#return; {10301#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID
[2022-04-15 08:32:44,003 INFO L272 TraceCheckUtils]: 52: Hoare triple {10301#(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)); {10215#true} is VALID
[2022-04-15 08:32:44,003 INFO L290 TraceCheckUtils]: 53: Hoare triple {10215#true} ~cond := #in~cond; {10380#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID
[2022-04-15 08:32:44,004 INFO L290 TraceCheckUtils]: 54: Hoare triple {10380#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {10384#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID
[2022-04-15 08:32:44,004 INFO L290 TraceCheckUtils]: 55: Hoare triple {10384#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {10384#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID
[2022-04-15 08:32:44,005 INFO L284 TraceCheckUtils]: 56: Hoare quadruple {10384#(not (= |__VERIFIER_assert_#in~cond| 0))} {10301#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} #76#return; {10391#(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-15 08:32:44,005 INFO L272 TraceCheckUtils]: 57: Hoare triple {10391#(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)); {10215#true} is VALID
[2022-04-15 08:32:44,005 INFO L290 TraceCheckUtils]: 58: Hoare triple {10215#true} ~cond := #in~cond; {10215#true} is VALID
[2022-04-15 08:32:44,005 INFO L290 TraceCheckUtils]: 59: Hoare triple {10215#true} assume !(0 == ~cond); {10215#true} is VALID
[2022-04-15 08:32:44,005 INFO L290 TraceCheckUtils]: 60: Hoare triple {10215#true} assume true; {10215#true} is VALID
[2022-04-15 08:32:44,006 INFO L284 TraceCheckUtils]: 61: Hoare quadruple {10215#true} {10391#(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; {10391#(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-15 08:32:44,006 INFO L290 TraceCheckUtils]: 62: Hoare triple {10391#(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); {10391#(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-15 08:32:44,011 INFO L290 TraceCheckUtils]: 63: Hoare triple {10391#(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; {10413#(= main_~b~0 (+ main_~y~0 (* (- 1) (* main_~x~0 (* (- 1) main_~q~0))) (* (- 1) (* main_~y~0 (+ (* (- 1) main_~s~0) 1)))))} is VALID
[2022-04-15 08:32:44,012 INFO L290 TraceCheckUtils]: 64: Hoare triple {10413#(= main_~b~0 (+ main_~y~0 (* (- 1) (* main_~x~0 (* (- 1) main_~q~0))) (* (- 1) (* main_~y~0 (+ (* (- 1) main_~s~0) 1)))))} assume !false; {10413#(= main_~b~0 (+ main_~y~0 (* (- 1) (* main_~x~0 (* (- 1) main_~q~0))) (* (- 1) (* main_~y~0 (+ (* (- 1) main_~s~0) 1)))))} is VALID
[2022-04-15 08:32:44,012 INFO L272 TraceCheckUtils]: 65: Hoare triple {10413#(= main_~b~0 (+ main_~y~0 (* (- 1) (* main_~x~0 (* (- 1) main_~q~0))) (* (- 1) (* 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)); {10215#true} is VALID
[2022-04-15 08:32:44,012 INFO L290 TraceCheckUtils]: 66: Hoare triple {10215#true} ~cond := #in~cond; {10215#true} is VALID
[2022-04-15 08:32:44,012 INFO L290 TraceCheckUtils]: 67: Hoare triple {10215#true} assume !(0 == ~cond); {10215#true} is VALID
[2022-04-15 08:32:44,012 INFO L290 TraceCheckUtils]: 68: Hoare triple {10215#true} assume true; {10215#true} is VALID
[2022-04-15 08:32:44,013 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {10215#true} {10413#(= main_~b~0 (+ main_~y~0 (* (- 1) (* main_~x~0 (* (- 1) main_~q~0))) (* (- 1) (* main_~y~0 (+ (* (- 1) main_~s~0) 1)))))} #74#return; {10413#(= main_~b~0 (+ main_~y~0 (* (- 1) (* main_~x~0 (* (- 1) main_~q~0))) (* (- 1) (* main_~y~0 (+ (* (- 1) main_~s~0) 1)))))} is VALID
[2022-04-15 08:32:44,013 INFO L272 TraceCheckUtils]: 70: Hoare triple {10413#(= main_~b~0 (+ main_~y~0 (* (- 1) (* main_~x~0 (* (- 1) main_~q~0))) (* (- 1) (* 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)); {10215#true} is VALID
[2022-04-15 08:32:44,013 INFO L290 TraceCheckUtils]: 71: Hoare triple {10215#true} ~cond := #in~cond; {10215#true} is VALID
[2022-04-15 08:32:44,013 INFO L290 TraceCheckUtils]: 72: Hoare triple {10215#true} assume !(0 == ~cond); {10215#true} is VALID
[2022-04-15 08:32:44,013 INFO L290 TraceCheckUtils]: 73: Hoare triple {10215#true} assume true; {10215#true} is VALID
[2022-04-15 08:32:44,014 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {10215#true} {10413#(= main_~b~0 (+ main_~y~0 (* (- 1) (* main_~x~0 (* (- 1) main_~q~0))) (* (- 1) (* main_~y~0 (+ (* (- 1) main_~s~0) 1)))))} #76#return; {10413#(= main_~b~0 (+ main_~y~0 (* (- 1) (* main_~x~0 (* (- 1) main_~q~0))) (* (- 1) (* main_~y~0 (+ (* (- 1) main_~s~0) 1)))))} is VALID
[2022-04-15 08:32:44,015 INFO L272 TraceCheckUtils]: 75: Hoare triple {10413#(= main_~b~0 (+ main_~y~0 (* (- 1) (* main_~x~0 (* (- 1) main_~q~0))) (* (- 1) (* 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)); {10450#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID
[2022-04-15 08:32:44,015 INFO L290 TraceCheckUtils]: 76: Hoare triple {10450#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {10454#(<= 1 __VERIFIER_assert_~cond)} is VALID
[2022-04-15 08:32:44,016 INFO L290 TraceCheckUtils]: 77: Hoare triple {10454#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {10216#false} is VALID
[2022-04-15 08:32:44,016 INFO L290 TraceCheckUtils]: 78: Hoare triple {10216#false} assume !false; {10216#false} is VALID
[2022-04-15 08:32:44,016 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-15 08:32:44,016 INFO L328 TraceCheckSpWp]: Computing backward predicates...
[2022-04-15 08:32:53,380 INFO L290 TraceCheckUtils]: 78: Hoare triple {10216#false} assume !false; {10216#false} is VALID
[2022-04-15 08:32:53,381 INFO L290 TraceCheckUtils]: 77: Hoare triple {10454#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {10216#false} is VALID
[2022-04-15 08:32:53,381 INFO L290 TraceCheckUtils]: 76: Hoare triple {10450#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {10454#(<= 1 __VERIFIER_assert_~cond)} is VALID
[2022-04-15 08:32:53,382 INFO L272 TraceCheckUtils]: 75: Hoare triple {10413#(= main_~b~0 (+ main_~y~0 (* (- 1) (* main_~x~0 (* (- 1) main_~q~0))) (* (- 1) (* 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)); {10450#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID
[2022-04-15 08:32:53,383 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {10215#true} {10413#(= main_~b~0 (+ main_~y~0 (* (- 1) (* main_~x~0 (* (- 1) main_~q~0))) (* (- 1) (* main_~y~0 (+ (* (- 1) main_~s~0) 1)))))} #76#return; {10413#(= main_~b~0 (+ main_~y~0 (* (- 1) (* main_~x~0 (* (- 1) main_~q~0))) (* (- 1) (* main_~y~0 (+ (* (- 1) main_~s~0) 1)))))} is VALID
[2022-04-15 08:32:53,383 INFO L290 TraceCheckUtils]: 73: Hoare triple {10215#true} assume true; {10215#true} is VALID
[2022-04-15 08:32:53,383 INFO L290 TraceCheckUtils]: 72: Hoare triple {10215#true} assume !(0 == ~cond); {10215#true} is VALID
[2022-04-15 08:32:53,383 INFO L290 TraceCheckUtils]: 71: Hoare triple {10215#true} ~cond := #in~cond; {10215#true} is VALID
[2022-04-15 08:32:53,383 INFO L272 TraceCheckUtils]: 70: Hoare triple {10413#(= main_~b~0 (+ main_~y~0 (* (- 1) (* main_~x~0 (* (- 1) main_~q~0))) (* (- 1) (* 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)); {10215#true} is VALID
[2022-04-15 08:32:53,384 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {10215#true} {10413#(= main_~b~0 (+ main_~y~0 (* (- 1) (* main_~x~0 (* (- 1) main_~q~0))) (* (- 1) (* main_~y~0 (+ (* (- 1) main_~s~0) 1)))))} #74#return; {10413#(= main_~b~0 (+ main_~y~0 (* (- 1) (* main_~x~0 (* (- 1) main_~q~0))) (* (- 1) (* main_~y~0 (+ (* (- 1) main_~s~0) 1)))))} is VALID
[2022-04-15 08:32:53,384 INFO L290 TraceCheckUtils]: 68: Hoare triple {10215#true} assume true; {10215#true} is VALID
[2022-04-15 08:32:53,384 INFO L290 TraceCheckUtils]: 67: Hoare triple {10215#true} assume !(0 == ~cond); {10215#true} is VALID
[2022-04-15 08:32:53,384 INFO L290 TraceCheckUtils]: 66: Hoare triple {10215#true} ~cond := #in~cond; {10215#true} is VALID
[2022-04-15 08:32:53,384 INFO L272 TraceCheckUtils]: 65: Hoare triple {10413#(= main_~b~0 (+ main_~y~0 (* (- 1) (* main_~x~0 (* (- 1) main_~q~0))) (* (- 1) (* 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)); {10215#true} is VALID
[2022-04-15 08:32:53,384 INFO L290 TraceCheckUtils]: 64: Hoare triple {10413#(= main_~b~0 (+ main_~y~0 (* (- 1) (* main_~x~0 (* (- 1) main_~q~0))) (* (- 1) (* main_~y~0 (+ (* (- 1) main_~s~0) 1)))))} assume !false; {10413#(= main_~b~0 (+ main_~y~0 (* (- 1) (* main_~x~0 (* (- 1) main_~q~0))) (* (- 1) (* main_~y~0 (+ (* (- 1) main_~s~0) 1)))))} is VALID
[2022-04-15 08:32:53,774 INFO L290 TraceCheckUtils]: 63: Hoare triple {10506#(= (+ (* (- 1) main_~a~0) main_~b~0) (+ main_~y~0 (* (- 1) (* (+ main_~r~0 (* (- 1) main_~s~0) 1) main_~y~0)) (* (- 1) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0))))))} assume !(~a~0 > ~b~0);~b~0 := ~b~0 - ~a~0;~q~0 := ~q~0 - ~p~0;~s~0 := ~s~0 - ~r~0; {10413#(= main_~b~0 (+ main_~y~0 (* (- 1) (* main_~x~0 (* (- 1) main_~q~0))) (* (- 1) (* main_~y~0 (+ (* (- 1) main_~s~0) 1)))))} is VALID
[2022-04-15 08:32:53,774 INFO L290 TraceCheckUtils]: 62: Hoare triple {10506#(= (+ (* (- 1) main_~a~0) main_~b~0) (+ main_~y~0 (* (- 1) (* (+ main_~r~0 (* (- 1) main_~s~0) 1) main_~y~0)) (* (- 1) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0))))))} assume !!(~a~0 != ~b~0); {10506#(= (+ (* (- 1) main_~a~0) main_~b~0) (+ main_~y~0 (* (- 1) (* (+ main_~r~0 (* (- 1) main_~s~0) 1) main_~y~0)) (* (- 1) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0))))))} is VALID
[2022-04-15 08:32:53,775 INFO L284 TraceCheckUtils]: 61: Hoare quadruple {10215#true} {10506#(= (+ (* (- 1) main_~a~0) main_~b~0) (+ main_~y~0 (* (- 1) (* (+ main_~r~0 (* (- 1) main_~s~0) 1) main_~y~0)) (* (- 1) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0))))))} #78#return; {10506#(= (+ (* (- 1) main_~a~0) main_~b~0) (+ main_~y~0 (* (- 1) (* (+ main_~r~0 (* (- 1) main_~s~0) 1) main_~y~0)) (* (- 1) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0))))))} is VALID
[2022-04-15 08:32:53,775 INFO L290 TraceCheckUtils]: 60: Hoare triple {10215#true} assume true; {10215#true} is VALID
[2022-04-15 08:32:53,775 INFO L290 TraceCheckUtils]: 59: Hoare triple {10215#true} assume !(0 == ~cond); {10215#true} is VALID
[2022-04-15 08:32:53,775 INFO L290 TraceCheckUtils]: 58: Hoare triple {10215#true} ~cond := #in~cond; {10215#true} is VALID
[2022-04-15 08:32:53,775 INFO L272 TraceCheckUtils]: 57: Hoare triple {10506#(= (+ (* (- 1) main_~a~0) main_~b~0) (+ main_~y~0 (* (- 1) (* (+ main_~r~0 (* (- 1) main_~s~0) 1) main_~y~0)) (* (- 1) (* 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)); {10215#true} is VALID
[2022-04-15 08:32:53,777 INFO L284 TraceCheckUtils]: 56: Hoare quadruple {10384#(not (= |__VERIFIER_assert_#in~cond| 0))} {10413#(= main_~b~0 (+ main_~y~0 (* (- 1) (* main_~x~0 (* (- 1) main_~q~0))) (* (- 1) (* main_~y~0 (+ (* (- 1) main_~s~0) 1)))))} #76#return; {10506#(= (+ (* (- 1) main_~a~0) main_~b~0) (+ main_~y~0 (* (- 1) (* (+ main_~r~0 (* (- 1) main_~s~0) 1) main_~y~0)) (* (- 1) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0))))))} is VALID
[2022-04-15 08:32:53,777 INFO L290 TraceCheckUtils]: 55: Hoare triple {10384#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {10384#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID
[2022-04-15 08:32:53,777 INFO L290 TraceCheckUtils]: 54: Hoare triple {10537#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {10384#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID
[2022-04-15 08:32:53,777 INFO L290 TraceCheckUtils]: 53: Hoare triple {10215#true} ~cond := #in~cond; {10537#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID
[2022-04-15 08:32:53,778 INFO L272 TraceCheckUtils]: 52: Hoare triple {10413#(= main_~b~0 (+ main_~y~0 (* (- 1) (* main_~x~0 (* (- 1) main_~q~0))) (* (- 1) (* 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)); {10215#true} is VALID
[2022-04-15 08:32:53,778 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {10215#true} {10413#(= main_~b~0 (+ main_~y~0 (* (- 1) (* main_~x~0 (* (- 1) main_~q~0))) (* (- 1) (* main_~y~0 (+ (* (- 1) main_~s~0) 1)))))} #74#return; {10413#(= main_~b~0 (+ main_~y~0 (* (- 1) (* main_~x~0 (* (- 1) main_~q~0))) (* (- 1) (* main_~y~0 (+ (* (- 1) main_~s~0) 1)))))} is VALID
[2022-04-15 08:32:53,778 INFO L290 TraceCheckUtils]: 50: Hoare triple {10215#true} assume true; {10215#true} is VALID
[2022-04-15 08:32:53,778 INFO L290 TraceCheckUtils]: 49: Hoare triple {10215#true} assume !(0 == ~cond); {10215#true} is VALID
[2022-04-15 08:32:53,778 INFO L290 TraceCheckUtils]: 48: Hoare triple {10215#true} ~cond := #in~cond; {10215#true} is VALID
[2022-04-15 08:32:53,778 INFO L272 TraceCheckUtils]: 47: Hoare triple {10413#(= main_~b~0 (+ main_~y~0 (* (- 1) (* main_~x~0 (* (- 1) main_~q~0))) (* (- 1) (* 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)); {10215#true} is VALID
[2022-04-15 08:32:53,779 INFO L290 TraceCheckUtils]: 46: Hoare triple {10413#(= main_~b~0 (+ main_~y~0 (* (- 1) (* main_~x~0 (* (- 1) main_~q~0))) (* (- 1) (* main_~y~0 (+ (* (- 1) main_~s~0) 1)))))} assume !false; {10413#(= main_~b~0 (+ main_~y~0 (* (- 1) (* main_~x~0 (* (- 1) main_~q~0))) (* (- 1) (* main_~y~0 (+ (* (- 1) main_~s~0) 1)))))} is VALID
[2022-04-15 08:32:53,779 INFO L290 TraceCheckUtils]: 45: Hoare triple {10413#(= main_~b~0 (+ main_~y~0 (* (- 1) (* main_~x~0 (* (- 1) main_~q~0))) (* (- 1) (* 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; {10413#(= main_~b~0 (+ main_~y~0 (* (- 1) (* main_~x~0 (* (- 1) main_~q~0))) (* (- 1) (* main_~y~0 (+ (* (- 1) main_~s~0) 1)))))} is VALID
[2022-04-15 08:32:53,779 INFO L290 TraceCheckUtils]: 44: Hoare triple {10413#(= main_~b~0 (+ main_~y~0 (* (- 1) (* main_~x~0 (* (- 1) main_~q~0))) (* (- 1) (* main_~y~0 (+ (* (- 1) main_~s~0) 1)))))} assume !!(~a~0 != ~b~0); {10413#(= main_~b~0 (+ main_~y~0 (* (- 1) (* main_~x~0 (* (- 1) main_~q~0))) (* (- 1) (* main_~y~0 (+ (* (- 1) main_~s~0) 1)))))} is VALID
[2022-04-15 08:32:53,780 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {10215#true} {10413#(= main_~b~0 (+ main_~y~0 (* (- 1) (* main_~x~0 (* (- 1) main_~q~0))) (* (- 1) (* main_~y~0 (+ (* (- 1) main_~s~0) 1)))))} #78#return; {10413#(= main_~b~0 (+ main_~y~0 (* (- 1) (* main_~x~0 (* (- 1) main_~q~0))) (* (- 1) (* main_~y~0 (+ (* (- 1) main_~s~0) 1)))))} is VALID
[2022-04-15 08:32:53,780 INFO L290 TraceCheckUtils]: 42: Hoare triple {10215#true} assume true; {10215#true} is VALID
[2022-04-15 08:32:53,780 INFO L290 TraceCheckUtils]: 41: Hoare triple {10215#true} assume !(0 == ~cond); {10215#true} is VALID
[2022-04-15 08:32:53,780 INFO L290 TraceCheckUtils]: 40: Hoare triple {10215#true} ~cond := #in~cond; {10215#true} is VALID
[2022-04-15 08:32:53,780 INFO L272 TraceCheckUtils]: 39: Hoare triple {10413#(= main_~b~0 (+ main_~y~0 (* (- 1) (* main_~x~0 (* (- 1) main_~q~0))) (* (- 1) (* 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)); {10215#true} is VALID
[2022-04-15 08:32:53,781 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {10215#true} {10413#(= main_~b~0 (+ main_~y~0 (* (- 1) (* main_~x~0 (* (- 1) main_~q~0))) (* (- 1) (* main_~y~0 (+ (* (- 1) main_~s~0) 1)))))} #76#return; {10413#(= main_~b~0 (+ main_~y~0 (* (- 1) (* main_~x~0 (* (- 1) main_~q~0))) (* (- 1) (* main_~y~0 (+ (* (- 1) main_~s~0) 1)))))} is VALID
[2022-04-15 08:32:53,781 INFO L290 TraceCheckUtils]: 37: Hoare triple {10215#true} assume true; {10215#true} is VALID
[2022-04-15 08:32:53,781 INFO L290 TraceCheckUtils]: 36: Hoare triple {10215#true} assume !(0 == ~cond); {10215#true} is VALID
[2022-04-15 08:32:53,781 INFO L290 TraceCheckUtils]: 35: Hoare triple {10215#true} ~cond := #in~cond; {10215#true} is VALID
[2022-04-15 08:32:53,781 INFO L272 TraceCheckUtils]: 34: Hoare triple {10413#(= main_~b~0 (+ main_~y~0 (* (- 1) (* main_~x~0 (* (- 1) main_~q~0))) (* (- 1) (* 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)); {10215#true} is VALID
[2022-04-15 08:32:53,782 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {10215#true} {10413#(= main_~b~0 (+ main_~y~0 (* (- 1) (* main_~x~0 (* (- 1) main_~q~0))) (* (- 1) (* main_~y~0 (+ (* (- 1) main_~s~0) 1)))))} #74#return; {10413#(= main_~b~0 (+ main_~y~0 (* (- 1) (* main_~x~0 (* (- 1) main_~q~0))) (* (- 1) (* main_~y~0 (+ (* (- 1) main_~s~0) 1)))))} is VALID
[2022-04-15 08:32:53,782 INFO L290 TraceCheckUtils]: 32: Hoare triple {10215#true} assume true; {10215#true} is VALID
[2022-04-15 08:32:53,782 INFO L290 TraceCheckUtils]: 31: Hoare triple {10215#true} assume !(0 == ~cond); {10215#true} is VALID
[2022-04-15 08:32:53,782 INFO L290 TraceCheckUtils]: 30: Hoare triple {10215#true} ~cond := #in~cond; {10215#true} is VALID
[2022-04-15 08:32:53,782 INFO L272 TraceCheckUtils]: 29: Hoare triple {10413#(= main_~b~0 (+ main_~y~0 (* (- 1) (* main_~x~0 (* (- 1) main_~q~0))) (* (- 1) (* 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)); {10215#true} is VALID
[2022-04-15 08:32:53,782 INFO L290 TraceCheckUtils]: 28: Hoare triple {10413#(= main_~b~0 (+ main_~y~0 (* (- 1) (* main_~x~0 (* (- 1) main_~q~0))) (* (- 1) (* main_~y~0 (+ (* (- 1) main_~s~0) 1)))))} assume !false; {10413#(= main_~b~0 (+ main_~y~0 (* (- 1) (* main_~x~0 (* (- 1) main_~q~0))) (* (- 1) (* main_~y~0 (+ (* (- 1) main_~s~0) 1)))))} is VALID
[2022-04-15 08:32:53,783 INFO L290 TraceCheckUtils]: 27: Hoare triple {10215#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {10413#(= main_~b~0 (+ main_~y~0 (* (- 1) (* main_~x~0 (* (- 1) main_~q~0))) (* (- 1) (* main_~y~0 (+ (* (- 1) main_~s~0) 1)))))} is VALID
[2022-04-15 08:32:53,783 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {10215#true} {10215#true} #72#return; {10215#true} is VALID
[2022-04-15 08:32:53,783 INFO L290 TraceCheckUtils]: 25: Hoare triple {10215#true} assume true; {10215#true} is VALID
[2022-04-15 08:32:53,783 INFO L290 TraceCheckUtils]: 24: Hoare triple {10215#true} assume !(0 == ~cond); {10215#true} is VALID
[2022-04-15 08:32:53,783 INFO L290 TraceCheckUtils]: 23: Hoare triple {10215#true} ~cond := #in~cond; {10215#true} is VALID
[2022-04-15 08:32:53,783 INFO L272 TraceCheckUtils]: 22: Hoare triple {10215#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {10215#true} is VALID
[2022-04-15 08:32:53,783 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {10215#true} {10215#true} #70#return; {10215#true} is VALID
[2022-04-15 08:32:53,783 INFO L290 TraceCheckUtils]: 20: Hoare triple {10215#true} assume true; {10215#true} is VALID
[2022-04-15 08:32:53,783 INFO L290 TraceCheckUtils]: 19: Hoare triple {10215#true} assume !(0 == ~cond); {10215#true} is VALID
[2022-04-15 08:32:53,783 INFO L290 TraceCheckUtils]: 18: Hoare triple {10215#true} ~cond := #in~cond; {10215#true} is VALID
[2022-04-15 08:32:53,783 INFO L272 TraceCheckUtils]: 17: Hoare triple {10215#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {10215#true} is VALID
[2022-04-15 08:32:53,783 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {10215#true} {10215#true} #68#return; {10215#true} is VALID
[2022-04-15 08:32:53,784 INFO L290 TraceCheckUtils]: 15: Hoare triple {10215#true} assume true; {10215#true} is VALID
[2022-04-15 08:32:53,784 INFO L290 TraceCheckUtils]: 14: Hoare triple {10215#true} assume !(0 == ~cond); {10215#true} is VALID
[2022-04-15 08:32:53,784 INFO L290 TraceCheckUtils]: 13: Hoare triple {10215#true} ~cond := #in~cond; {10215#true} is VALID
[2022-04-15 08:32:53,784 INFO L272 TraceCheckUtils]: 12: Hoare triple {10215#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 10 then 1 else 0)); {10215#true} is VALID
[2022-04-15 08:32:53,784 INFO L290 TraceCheckUtils]: 11: Hoare triple {10215#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {10215#true} is VALID
[2022-04-15 08:32:53,784 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {10215#true} {10215#true} #66#return; {10215#true} is VALID
[2022-04-15 08:32:53,784 INFO L290 TraceCheckUtils]: 9: Hoare triple {10215#true} assume true; {10215#true} is VALID
[2022-04-15 08:32:53,784 INFO L290 TraceCheckUtils]: 8: Hoare triple {10215#true} assume !(0 == ~cond); {10215#true} is VALID
[2022-04-15 08:32:53,784 INFO L290 TraceCheckUtils]: 7: Hoare triple {10215#true} ~cond := #in~cond; {10215#true} is VALID
[2022-04-15 08:32:53,784 INFO L272 TraceCheckUtils]: 6: Hoare triple {10215#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 10 then 1 else 0)); {10215#true} is VALID
[2022-04-15 08:32:53,784 INFO L290 TraceCheckUtils]: 5: Hoare triple {10215#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; {10215#true} is VALID
[2022-04-15 08:32:53,784 INFO L272 TraceCheckUtils]: 4: Hoare triple {10215#true} call #t~ret6 := main(); {10215#true} is VALID
[2022-04-15 08:32:53,784 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10215#true} {10215#true} #88#return; {10215#true} is VALID
[2022-04-15 08:32:53,785 INFO L290 TraceCheckUtils]: 2: Hoare triple {10215#true} assume true; {10215#true} is VALID
[2022-04-15 08:32:53,785 INFO L290 TraceCheckUtils]: 1: Hoare triple {10215#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); {10215#true} is VALID
[2022-04-15 08:32:53,785 INFO L272 TraceCheckUtils]: 0: Hoare triple {10215#true} call ULTIMATE.init(); {10215#true} is VALID
[2022-04-15 08:32:53,785 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-15 08:32:53,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-04-15 08:32:53,785 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [137823583]
[2022-04-15 08:32:53,785 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT
[2022-04-15 08:32:53,785 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1561751122]
[2022-04-15 08:32:53,785 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1561751122] provided 0 perfect and 2 imperfect interpolant sequences
[2022-04-15 08:32:53,785 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences.
[2022-04-15 08:32:53,786 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 11
[2022-04-15 08:32:53,786 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace
[2022-04-15 08:32:53,786 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [55233363]
[2022-04-15 08:32:53,786 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [55233363] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-15 08:32:53,786 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-15 08:32:53,786 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2022-04-15 08:32:53,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1698909599]
[2022-04-15 08:32:53,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-04-15 08:32:53,786 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-15 08:32:53,787 INFO L84 Accepts]: Finished accepts. word is accepted.
[2022-04-15 08:32:53,787 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-15 08:32:53,835 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-15 08:32:53,835 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2022-04-15 08:32:53,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION
[2022-04-15 08:32:53,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2022-04-15 08:32:53,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110
[2022-04-15 08:32:53,836 INFO L87 Difference]: Start difference. First operand 172 states and 205 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-15 08:32:54,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-15 08:32:54,625 INFO L93 Difference]: Finished difference Result 186 states and 224 transitions.
[2022-04-15 08:32:54,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states.
[2022-04-15 08:32:54,625 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-15 08:32:54,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-04-15 08:32:54,625 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-15 08:32:54,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 64 transitions.
[2022-04-15 08:32:54,626 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-15 08:32:54,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 64 transitions.
[2022-04-15 08:32:54,627 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 64 transitions.
[2022-04-15 08:32:54,716 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-15 08:32:54,719 INFO L225 Difference]: With dead ends: 186
[2022-04-15 08:32:54,719 INFO L226 Difference]: Without dead ends: 173
[2022-04-15 08:32:54,719 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-15 08:32:54,720 INFO L913 BasicCegarLoop]: 31 mSDtfsCounter, 14 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2022-04-15 08:32:54,720 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [19 Valid, 152 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2022-04-15 08:32:54,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states.
[2022-04-15 08:32:54,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 153.
[2022-04-15 08:32:54,829 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2022-04-15 08:32:54,830 INFO L82 GeneralOperation]: Start isEquivalent. First operand 173 states. Second operand has 153 states, 94 states have (on average 1.0851063829787233) internal successors, (102), 98 states have internal predecessors, (102), 36 states have call successors, (36), 23 states have call predecessors, (36), 22 states have return successors, (35), 31 states have call predecessors, (35), 35 states have call successors, (35)
[2022-04-15 08:32:54,830 INFO L74 IsIncluded]: Start isIncluded. First operand 173 states. Second operand has 153 states, 94 states have (on average 1.0851063829787233) internal successors, (102), 98 states have internal predecessors, (102), 36 states have call successors, (36), 23 states have call predecessors, (36), 22 states have return successors, (35), 31 states have call predecessors, (35), 35 states have call successors, (35)
[2022-04-15 08:32:54,830 INFO L87 Difference]: Start difference. First operand 173 states. Second operand has 153 states, 94 states have (on average 1.0851063829787233) internal successors, (102), 98 states have internal predecessors, (102), 36 states have call successors, (36), 23 states have call predecessors, (36), 22 states have return successors, (35), 31 states have call predecessors, (35), 35 states have call successors, (35)
[2022-04-15 08:32:54,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-15 08:32:54,833 INFO L93 Difference]: Finished difference Result 173 states and 203 transitions.
[2022-04-15 08:32:54,833 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 203 transitions.
[2022-04-15 08:32:54,833 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-15 08:32:54,833 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-15 08:32:54,834 INFO L74 IsIncluded]: Start isIncluded. First operand has 153 states, 94 states have (on average 1.0851063829787233) internal successors, (102), 98 states have internal predecessors, (102), 36 states have call successors, (36), 23 states have call predecessors, (36), 22 states have return successors, (35), 31 states have call predecessors, (35), 35 states have call successors, (35) Second operand 173 states.
[2022-04-15 08:32:54,834 INFO L87 Difference]: Start difference. First operand has 153 states, 94 states have (on average 1.0851063829787233) internal successors, (102), 98 states have internal predecessors, (102), 36 states have call successors, (36), 23 states have call predecessors, (36), 22 states have return successors, (35), 31 states have call predecessors, (35), 35 states have call successors, (35) Second operand 173 states.
[2022-04-15 08:32:54,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-15 08:32:54,837 INFO L93 Difference]: Finished difference Result 173 states and 203 transitions.
[2022-04-15 08:32:54,837 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 203 transitions.
[2022-04-15 08:32:54,837 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-15 08:32:54,837 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-15 08:32:54,837 INFO L88 GeneralOperation]: Finished isEquivalent.
[2022-04-15 08:32:54,837 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2022-04-15 08:32:54,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 94 states have (on average 1.0851063829787233) internal successors, (102), 98 states have internal predecessors, (102), 36 states have call successors, (36), 23 states have call predecessors, (36), 22 states have return successors, (35), 31 states have call predecessors, (35), 35 states have call successors, (35)
[2022-04-15 08:32:54,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 173 transitions.
[2022-04-15 08:32:54,840 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 173 transitions. Word has length 79
[2022-04-15 08:32:54,840 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-04-15 08:32:54,840 INFO L478 AbstractCegarLoop]: Abstraction has 153 states and 173 transitions.
[2022-04-15 08:32:54,840 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-15 08:32:54,840 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 153 states and 173 transitions.
[2022-04-15 08:32:55,494 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 173 edges. 173 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-15 08:32:55,494 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 173 transitions.
[2022-04-15 08:32:55,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80
[2022-04-15 08:32:55,495 INFO L491 BasicCegarLoop]: Found error trace
[2022-04-15 08:32:55,495 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-15 08:32:55,511 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-15 08:32:55,699 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12
[2022-04-15 08:32:55,699 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-04-15 08:32:55,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-04-15 08:32:55,700 INFO L85 PathProgramCache]: Analyzing trace with hash 2066842922, now seen corresponding path program 3 times
[2022-04-15 08:32:55,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION
[2022-04-15 08:32:55,700 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1948688746]
[2022-04-15 08:32:55,705 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation
[2022-04-15 08:32:55,705 INFO L85 PathProgramCache]: Analyzing trace with hash 2066842922, now seen corresponding path program 4 times
[2022-04-15 08:32:55,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-04-15 08:32:55,705 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1482818842]
[2022-04-15 08:32:55,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-15 08:32:55,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-15 08:32:55,727 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic
[2022-04-15 08:32:55,727 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [164260123]
[2022-04-15 08:32:55,727 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST
[2022-04-15 08:32:55,727 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-04-15 08:32:55,727 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-04-15 08:32:55,732 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2022-04-15 08:32:55,733 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process
[2022-04-15 08:32:55,774 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s)
[2022-04-15 08:32:55,774 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat
[2022-04-15 08:32:55,775 INFO L263 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 41 conjunts are in the unsatisfiable core
[2022-04-15 08:32:55,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-15 08:32:55,789 INFO L286 TraceCheckSpWp]: Computing forward predicates...
[2022-04-15 08:32:56,421 INFO L272 TraceCheckUtils]: 0: Hoare triple {11727#true} call ULTIMATE.init(); {11727#true} is VALID
[2022-04-15 08:32:56,422 INFO L290 TraceCheckUtils]: 1: Hoare triple {11727#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); {11727#true} is VALID
[2022-04-15 08:32:56,422 INFO L290 TraceCheckUtils]: 2: Hoare triple {11727#true} assume true; {11727#true} is VALID
[2022-04-15 08:32:56,422 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11727#true} {11727#true} #88#return; {11727#true} is VALID
[2022-04-15 08:32:56,422 INFO L272 TraceCheckUtils]: 4: Hoare triple {11727#true} call #t~ret6 := main(); {11727#true} is VALID
[2022-04-15 08:32:56,422 INFO L290 TraceCheckUtils]: 5: Hoare triple {11727#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; {11727#true} is VALID
[2022-04-15 08:32:56,422 INFO L272 TraceCheckUtils]: 6: Hoare triple {11727#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 10 then 1 else 0)); {11727#true} is VALID
[2022-04-15 08:32:56,422 INFO L290 TraceCheckUtils]: 7: Hoare triple {11727#true} ~cond := #in~cond; {11727#true} is VALID
[2022-04-15 08:32:56,422 INFO L290 TraceCheckUtils]: 8: Hoare triple {11727#true} assume !(0 == ~cond); {11727#true} is VALID
[2022-04-15 08:32:56,422 INFO L290 TraceCheckUtils]: 9: Hoare triple {11727#true} assume true; {11727#true} is VALID
[2022-04-15 08:32:56,422 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {11727#true} {11727#true} #66#return; {11727#true} is VALID
[2022-04-15 08:32:56,422 INFO L290 TraceCheckUtils]: 11: Hoare triple {11727#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {11727#true} is VALID
[2022-04-15 08:32:56,423 INFO L272 TraceCheckUtils]: 12: Hoare triple {11727#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 10 then 1 else 0)); {11727#true} is VALID
[2022-04-15 08:32:56,423 INFO L290 TraceCheckUtils]: 13: Hoare triple {11727#true} ~cond := #in~cond; {11727#true} is VALID
[2022-04-15 08:32:56,423 INFO L290 TraceCheckUtils]: 14: Hoare triple {11727#true} assume !(0 == ~cond); {11727#true} is VALID
[2022-04-15 08:32:56,423 INFO L290 TraceCheckUtils]: 15: Hoare triple {11727#true} assume true; {11727#true} is VALID
[2022-04-15 08:32:56,423 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {11727#true} {11727#true} #68#return; {11727#true} is VALID
[2022-04-15 08:32:56,423 INFO L272 TraceCheckUtils]: 17: Hoare triple {11727#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {11727#true} is VALID
[2022-04-15 08:32:56,423 INFO L290 TraceCheckUtils]: 18: Hoare triple {11727#true} ~cond := #in~cond; {11786#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID
[2022-04-15 08:32:56,424 INFO L290 TraceCheckUtils]: 19: Hoare triple {11786#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {11790#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID
[2022-04-15 08:32:56,424 INFO L290 TraceCheckUtils]: 20: Hoare triple {11790#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {11790#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID
[2022-04-15 08:32:56,424 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {11790#(not (= |assume_abort_if_not_#in~cond| 0))} {11727#true} #70#return; {11797#(<= 1 main_~x~0)} is VALID
[2022-04-15 08:32:56,424 INFO L272 TraceCheckUtils]: 22: Hoare triple {11797#(<= 1 main_~x~0)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {11727#true} is VALID
[2022-04-15 08:32:56,424 INFO L290 TraceCheckUtils]: 23: Hoare triple {11727#true} ~cond := #in~cond; {11727#true} is VALID
[2022-04-15 08:32:56,425 INFO L290 TraceCheckUtils]: 24: Hoare triple {11727#true} assume !(0 == ~cond); {11727#true} is VALID
[2022-04-15 08:32:56,425 INFO L290 TraceCheckUtils]: 25: Hoare triple {11727#true} assume true; {11727#true} is VALID
[2022-04-15 08:32:56,425 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {11727#true} {11797#(<= 1 main_~x~0)} #72#return; {11797#(<= 1 main_~x~0)} is VALID
[2022-04-15 08:32:56,425 INFO L290 TraceCheckUtils]: 27: Hoare triple {11797#(<= 1 main_~x~0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {11816#(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-15 08:32:56,426 INFO L290 TraceCheckUtils]: 28: Hoare triple {11816#(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; {11816#(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-15 08:32:56,426 INFO L272 TraceCheckUtils]: 29: Hoare triple {11816#(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)); {11727#true} is VALID
[2022-04-15 08:32:56,426 INFO L290 TraceCheckUtils]: 30: Hoare triple {11727#true} ~cond := #in~cond; {11727#true} is VALID
[2022-04-15 08:32:56,426 INFO L290 TraceCheckUtils]: 31: Hoare triple {11727#true} assume !(0 == ~cond); {11727#true} is VALID
[2022-04-15 08:32:56,426 INFO L290 TraceCheckUtils]: 32: Hoare triple {11727#true} assume true; {11727#true} is VALID
[2022-04-15 08:32:56,427 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {11727#true} {11816#(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; {11816#(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-15 08:32:56,427 INFO L272 TraceCheckUtils]: 34: Hoare triple {11816#(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)); {11727#true} is VALID
[2022-04-15 08:32:56,427 INFO L290 TraceCheckUtils]: 35: Hoare triple {11727#true} ~cond := #in~cond; {11727#true} is VALID
[2022-04-15 08:32:56,427 INFO L290 TraceCheckUtils]: 36: Hoare triple {11727#true} assume !(0 == ~cond); {11727#true} is VALID
[2022-04-15 08:32:56,427 INFO L290 TraceCheckUtils]: 37: Hoare triple {11727#true} assume true; {11727#true} is VALID
[2022-04-15 08:32:56,428 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {11727#true} {11816#(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; {11816#(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-15 08:32:56,428 INFO L272 TraceCheckUtils]: 39: Hoare triple {11816#(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)); {11727#true} is VALID
[2022-04-15 08:32:56,428 INFO L290 TraceCheckUtils]: 40: Hoare triple {11727#true} ~cond := #in~cond; {11856#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID
[2022-04-15 08:32:56,428 INFO L290 TraceCheckUtils]: 41: Hoare triple {11856#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {11860#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID
[2022-04-15 08:32:56,429 INFO L290 TraceCheckUtils]: 42: Hoare triple {11860#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {11860#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID
[2022-04-15 08:32:56,429 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {11860#(not (= |__VERIFIER_assert_#in~cond| 0))} {11816#(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; {11867#(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-15 08:32:56,430 INFO L290 TraceCheckUtils]: 44: Hoare triple {11867#(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); {11867#(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-15 08:32:56,431 INFO L290 TraceCheckUtils]: 45: Hoare triple {11867#(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; {11874#(and (= main_~b~0 (+ (* (- 1) main_~a~0) (* (+ main_~s~0 main_~r~0) main_~y~0))) (= main_~r~0 0) (= (+ main_~s~0 main_~r~0) 1) (<= 1 main_~x~0) (= main_~a~0 main_~x~0) (= main_~q~0 (* (- 1) main_~p~0)) (= main_~p~0 1))} is VALID
[2022-04-15 08:32:56,431 INFO L290 TraceCheckUtils]: 46: Hoare triple {11874#(and (= main_~b~0 (+ (* (- 1) main_~a~0) (* (+ main_~s~0 main_~r~0) main_~y~0))) (= main_~r~0 0) (= (+ main_~s~0 main_~r~0) 1) (<= 1 main_~x~0) (= main_~a~0 main_~x~0) (= main_~q~0 (* (- 1) main_~p~0)) (= main_~p~0 1))} assume !false; {11874#(and (= main_~b~0 (+ (* (- 1) main_~a~0) (* (+ main_~s~0 main_~r~0) main_~y~0))) (= main_~r~0 0) (= (+ main_~s~0 main_~r~0) 1) (<= 1 main_~x~0) (= main_~a~0 main_~x~0) (= main_~q~0 (* (- 1) main_~p~0)) (= main_~p~0 1))} is VALID
[2022-04-15 08:32:56,431 INFO L272 TraceCheckUtils]: 47: Hoare triple {11874#(and (= main_~b~0 (+ (* (- 1) main_~a~0) (* (+ main_~s~0 main_~r~0) main_~y~0))) (= main_~r~0 0) (= (+ main_~s~0 main_~r~0) 1) (<= 1 main_~x~0) (= main_~a~0 main_~x~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)); {11727#true} is VALID
[2022-04-15 08:32:56,431 INFO L290 TraceCheckUtils]: 48: Hoare triple {11727#true} ~cond := #in~cond; {11727#true} is VALID
[2022-04-15 08:32:56,431 INFO L290 TraceCheckUtils]: 49: Hoare triple {11727#true} assume !(0 == ~cond); {11727#true} is VALID
[2022-04-15 08:32:56,432 INFO L290 TraceCheckUtils]: 50: Hoare triple {11727#true} assume true; {11727#true} is VALID
[2022-04-15 08:32:56,432 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {11727#true} {11874#(and (= main_~b~0 (+ (* (- 1) main_~a~0) (* (+ main_~s~0 main_~r~0) main_~y~0))) (= main_~r~0 0) (= (+ main_~s~0 main_~r~0) 1) (<= 1 main_~x~0) (= main_~a~0 main_~x~0) (= main_~q~0 (* (- 1) main_~p~0)) (= main_~p~0 1))} #74#return; {11874#(and (= main_~b~0 (+ (* (- 1) main_~a~0) (* (+ main_~s~0 main_~r~0) main_~y~0))) (= main_~r~0 0) (= (+ main_~s~0 main_~r~0) 1) (<= 1 main_~x~0) (= main_~a~0 main_~x~0) (= main_~q~0 (* (- 1) main_~p~0)) (= main_~p~0 1))} is VALID
[2022-04-15 08:32:56,432 INFO L272 TraceCheckUtils]: 52: Hoare triple {11874#(and (= main_~b~0 (+ (* (- 1) main_~a~0) (* (+ main_~s~0 main_~r~0) main_~y~0))) (= main_~r~0 0) (= (+ main_~s~0 main_~r~0) 1) (<= 1 main_~x~0) (= main_~a~0 main_~x~0) (= main_~q~0 (* (- 1) main_~p~0)) (= main_~p~0 1))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {11727#true} is VALID
[2022-04-15 08:32:56,432 INFO L290 TraceCheckUtils]: 53: Hoare triple {11727#true} ~cond := #in~cond; {11727#true} is VALID
[2022-04-15 08:32:56,432 INFO L290 TraceCheckUtils]: 54: Hoare triple {11727#true} assume !(0 == ~cond); {11727#true} is VALID
[2022-04-15 08:32:56,432 INFO L290 TraceCheckUtils]: 55: Hoare triple {11727#true} assume true; {11727#true} is VALID
[2022-04-15 08:32:56,433 INFO L284 TraceCheckUtils]: 56: Hoare quadruple {11727#true} {11874#(and (= main_~b~0 (+ (* (- 1) main_~a~0) (* (+ main_~s~0 main_~r~0) main_~y~0))) (= main_~r~0 0) (= (+ main_~s~0 main_~r~0) 1) (<= 1 main_~x~0) (= main_~a~0 main_~x~0) (= main_~q~0 (* (- 1) main_~p~0)) (= main_~p~0 1))} #76#return; {11874#(and (= main_~b~0 (+ (* (- 1) main_~a~0) (* (+ main_~s~0 main_~r~0) main_~y~0))) (= main_~r~0 0) (= (+ main_~s~0 main_~r~0) 1) (<= 1 main_~x~0) (= main_~a~0 main_~x~0) (= main_~q~0 (* (- 1) main_~p~0)) (= main_~p~0 1))} is VALID
[2022-04-15 08:32:56,433 INFO L272 TraceCheckUtils]: 57: Hoare triple {11874#(and (= main_~b~0 (+ (* (- 1) main_~a~0) (* (+ main_~s~0 main_~r~0) main_~y~0))) (= main_~r~0 0) (= (+ main_~s~0 main_~r~0) 1) (<= 1 main_~x~0) (= main_~a~0 main_~x~0) (= main_~q~0 (* (- 1) main_~p~0)) (= main_~p~0 1))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {11727#true} is VALID
[2022-04-15 08:32:56,433 INFO L290 TraceCheckUtils]: 58: Hoare triple {11727#true} ~cond := #in~cond; {11856#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID
[2022-04-15 08:32:56,434 INFO L290 TraceCheckUtils]: 59: Hoare triple {11856#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {11860#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID
[2022-04-15 08:32:56,434 INFO L290 TraceCheckUtils]: 60: Hoare triple {11860#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {11860#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID
[2022-04-15 08:32:56,434 INFO L284 TraceCheckUtils]: 61: Hoare quadruple {11860#(not (= |__VERIFIER_assert_#in~cond| 0))} {11874#(and (= main_~b~0 (+ (* (- 1) main_~a~0) (* (+ main_~s~0 main_~r~0) main_~y~0))) (= main_~r~0 0) (= (+ main_~s~0 main_~r~0) 1) (<= 1 main_~x~0) (= main_~a~0 main_~x~0) (= main_~q~0 (* (- 1) main_~p~0)) (= main_~p~0 1))} #78#return; {11874#(and (= main_~b~0 (+ (* (- 1) main_~a~0) (* (+ main_~s~0 main_~r~0) main_~y~0))) (= main_~r~0 0) (= (+ main_~s~0 main_~r~0) 1) (<= 1 main_~x~0) (= main_~a~0 main_~x~0) (= main_~q~0 (* (- 1) main_~p~0)) (= main_~p~0 1))} is VALID
[2022-04-15 08:32:56,435 INFO L290 TraceCheckUtils]: 62: Hoare triple {11874#(and (= main_~b~0 (+ (* (- 1) main_~a~0) (* (+ main_~s~0 main_~r~0) main_~y~0))) (= main_~r~0 0) (= (+ main_~s~0 main_~r~0) 1) (<= 1 main_~x~0) (= main_~a~0 main_~x~0) (= main_~q~0 (* (- 1) main_~p~0)) (= main_~p~0 1))} assume !!(~a~0 != ~b~0); {11874#(and (= main_~b~0 (+ (* (- 1) main_~a~0) (* (+ main_~s~0 main_~r~0) main_~y~0))) (= main_~r~0 0) (= (+ main_~s~0 main_~r~0) 1) (<= 1 main_~x~0) (= main_~a~0 main_~x~0) (= main_~q~0 (* (- 1) main_~p~0)) (= main_~p~0 1))} is VALID
[2022-04-15 08:32:56,436 INFO L290 TraceCheckUtils]: 63: Hoare triple {11874#(and (= main_~b~0 (+ (* (- 1) main_~a~0) (* (+ main_~s~0 main_~r~0) main_~y~0))) (= main_~r~0 0) (= (+ main_~s~0 main_~r~0) 1) (<= 1 main_~x~0) (= main_~a~0 main_~x~0) (= main_~q~0 (* (- 1) main_~p~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; {11929#(and (= (+ (* (- 2) main_~x~0) main_~y~0) main_~b~0) (<= 1 main_~x~0) (= (- 1) (+ main_~q~0 1)) (= main_~s~0 1))} is VALID
[2022-04-15 08:32:56,436 INFO L290 TraceCheckUtils]: 64: Hoare triple {11929#(and (= (+ (* (- 2) main_~x~0) main_~y~0) main_~b~0) (<= 1 main_~x~0) (= (- 1) (+ main_~q~0 1)) (= main_~s~0 1))} assume !false; {11929#(and (= (+ (* (- 2) main_~x~0) main_~y~0) main_~b~0) (<= 1 main_~x~0) (= (- 1) (+ main_~q~0 1)) (= main_~s~0 1))} is VALID
[2022-04-15 08:32:56,436 INFO L272 TraceCheckUtils]: 65: Hoare triple {11929#(and (= (+ (* (- 2) main_~x~0) main_~y~0) main_~b~0) (<= 1 main_~x~0) (= (- 1) (+ main_~q~0 1)) (= main_~s~0 1))} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {11727#true} is VALID
[2022-04-15 08:32:56,436 INFO L290 TraceCheckUtils]: 66: Hoare triple {11727#true} ~cond := #in~cond; {11727#true} is VALID
[2022-04-15 08:32:56,436 INFO L290 TraceCheckUtils]: 67: Hoare triple {11727#true} assume !(0 == ~cond); {11727#true} is VALID
[2022-04-15 08:32:56,436 INFO L290 TraceCheckUtils]: 68: Hoare triple {11727#true} assume true; {11727#true} is VALID
[2022-04-15 08:32:56,437 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {11727#true} {11929#(and (= (+ (* (- 2) main_~x~0) main_~y~0) main_~b~0) (<= 1 main_~x~0) (= (- 1) (+ main_~q~0 1)) (= main_~s~0 1))} #74#return; {11929#(and (= (+ (* (- 2) main_~x~0) main_~y~0) main_~b~0) (<= 1 main_~x~0) (= (- 1) (+ main_~q~0 1)) (= main_~s~0 1))} is VALID
[2022-04-15 08:32:56,437 INFO L272 TraceCheckUtils]: 70: Hoare triple {11929#(and (= (+ (* (- 2) main_~x~0) main_~y~0) main_~b~0) (<= 1 main_~x~0) (= (- 1) (+ main_~q~0 1)) (= main_~s~0 1))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {11727#true} is VALID
[2022-04-15 08:32:56,437 INFO L290 TraceCheckUtils]: 71: Hoare triple {11727#true} ~cond := #in~cond; {11727#true} is VALID
[2022-04-15 08:32:56,437 INFO L290 TraceCheckUtils]: 72: Hoare triple {11727#true} assume !(0 == ~cond); {11727#true} is VALID
[2022-04-15 08:32:56,437 INFO L290 TraceCheckUtils]: 73: Hoare triple {11727#true} assume true; {11727#true} is VALID
[2022-04-15 08:32:56,438 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {11727#true} {11929#(and (= (+ (* (- 2) main_~x~0) main_~y~0) main_~b~0) (<= 1 main_~x~0) (= (- 1) (+ main_~q~0 1)) (= main_~s~0 1))} #76#return; {11929#(and (= (+ (* (- 2) main_~x~0) main_~y~0) main_~b~0) (<= 1 main_~x~0) (= (- 1) (+ main_~q~0 1)) (= main_~s~0 1))} is VALID
[2022-04-15 08:32:56,438 INFO L272 TraceCheckUtils]: 75: Hoare triple {11929#(and (= (+ (* (- 2) main_~x~0) main_~y~0) main_~b~0) (<= 1 main_~x~0) (= (- 1) (+ main_~q~0 1)) (= main_~s~0 1))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {11966#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID
[2022-04-15 08:32:56,439 INFO L290 TraceCheckUtils]: 76: Hoare triple {11966#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {11970#(<= 1 __VERIFIER_assert_~cond)} is VALID
[2022-04-15 08:32:56,439 INFO L290 TraceCheckUtils]: 77: Hoare triple {11970#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {11728#false} is VALID
[2022-04-15 08:32:56,439 INFO L290 TraceCheckUtils]: 78: Hoare triple {11728#false} assume !false; {11728#false} is VALID
[2022-04-15 08:32:56,440 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-15 08:32:56,440 INFO L328 TraceCheckSpWp]: Computing backward predicates...
[2022-04-15 08:33:39,751 INFO L290 TraceCheckUtils]: 78: Hoare triple {11728#false} assume !false; {11728#false} is VALID
[2022-04-15 08:33:39,751 INFO L290 TraceCheckUtils]: 77: Hoare triple {11970#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {11728#false} is VALID
[2022-04-15 08:33:39,752 INFO L290 TraceCheckUtils]: 76: Hoare triple {11966#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {11970#(<= 1 __VERIFIER_assert_~cond)} is VALID
[2022-04-15 08:33:39,752 INFO L272 TraceCheckUtils]: 75: Hoare triple {11986#(= 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)); {11966#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID
[2022-04-15 08:33:39,753 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {11727#true} {11986#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} #76#return; {11986#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID
[2022-04-15 08:33:39,753 INFO L290 TraceCheckUtils]: 73: Hoare triple {11727#true} assume true; {11727#true} is VALID
[2022-04-15 08:33:39,753 INFO L290 TraceCheckUtils]: 72: Hoare triple {11727#true} assume !(0 == ~cond); {11727#true} is VALID
[2022-04-15 08:33:39,753 INFO L290 TraceCheckUtils]: 71: Hoare triple {11727#true} ~cond := #in~cond; {11727#true} is VALID
[2022-04-15 08:33:39,753 INFO L272 TraceCheckUtils]: 70: Hoare triple {11986#(= 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)); {11727#true} is VALID
[2022-04-15 08:33:39,754 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {11727#true} {11986#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} #74#return; {11986#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID
[2022-04-15 08:33:39,754 INFO L290 TraceCheckUtils]: 68: Hoare triple {11727#true} assume true; {11727#true} is VALID
[2022-04-15 08:33:39,754 INFO L290 TraceCheckUtils]: 67: Hoare triple {11727#true} assume !(0 == ~cond); {11727#true} is VALID
[2022-04-15 08:33:39,754 INFO L290 TraceCheckUtils]: 66: Hoare triple {11727#true} ~cond := #in~cond; {11727#true} is VALID
[2022-04-15 08:33:39,754 INFO L272 TraceCheckUtils]: 65: Hoare triple {11986#(= 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)); {11727#true} is VALID
[2022-04-15 08:33:39,754 INFO L290 TraceCheckUtils]: 64: Hoare triple {11986#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} assume !false; {11986#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID
[2022-04-15 08:33:40,290 INFO L290 TraceCheckUtils]: 63: Hoare triple {12023#(= (+ (* (+ 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; {11986#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID
[2022-04-15 08:33:40,291 INFO L290 TraceCheckUtils]: 62: Hoare triple {12023#(= (+ (* (+ 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); {12023#(= (+ (* (+ 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-15 08:33:40,292 INFO L284 TraceCheckUtils]: 61: Hoare quadruple {11860#(not (= |__VERIFIER_assert_#in~cond| 0))} {12030#(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; {12023#(= (+ (* (+ 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-15 08:33:40,292 INFO L290 TraceCheckUtils]: 60: Hoare triple {11860#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {11860#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID
[2022-04-15 08:33:40,292 INFO L290 TraceCheckUtils]: 59: Hoare triple {12040#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {11860#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID
[2022-04-15 08:33:40,292 INFO L290 TraceCheckUtils]: 58: Hoare triple {11727#true} ~cond := #in~cond; {12040#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID
[2022-04-15 08:33:40,293 INFO L272 TraceCheckUtils]: 57: Hoare triple {12030#(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)); {11727#true} is VALID
[2022-04-15 08:33:40,293 INFO L284 TraceCheckUtils]: 56: Hoare quadruple {11727#true} {12030#(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; {12030#(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-15 08:33:40,293 INFO L290 TraceCheckUtils]: 55: Hoare triple {11727#true} assume true; {11727#true} is VALID
[2022-04-15 08:33:40,293 INFO L290 TraceCheckUtils]: 54: Hoare triple {11727#true} assume !(0 == ~cond); {11727#true} is VALID
[2022-04-15 08:33:40,293 INFO L290 TraceCheckUtils]: 53: Hoare triple {11727#true} ~cond := #in~cond; {11727#true} is VALID
[2022-04-15 08:33:40,293 INFO L272 TraceCheckUtils]: 52: Hoare triple {12030#(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)); {11727#true} is VALID
[2022-04-15 08:33:40,294 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {11727#true} {12030#(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; {12030#(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-15 08:33:40,294 INFO L290 TraceCheckUtils]: 50: Hoare triple {11727#true} assume true; {11727#true} is VALID
[2022-04-15 08:33:40,294 INFO L290 TraceCheckUtils]: 49: Hoare triple {11727#true} assume !(0 == ~cond); {11727#true} is VALID
[2022-04-15 08:33:40,294 INFO L290 TraceCheckUtils]: 48: Hoare triple {11727#true} ~cond := #in~cond; {11727#true} is VALID
[2022-04-15 08:33:40,294 INFO L272 TraceCheckUtils]: 47: Hoare triple {12030#(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)); {11727#true} is VALID
[2022-04-15 08:33:40,295 INFO L290 TraceCheckUtils]: 46: Hoare triple {12030#(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; {12030#(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-15 08:33:40,615 INFO L290 TraceCheckUtils]: 45: Hoare triple {12080#(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; {12030#(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-15 08:33:40,616 INFO L290 TraceCheckUtils]: 44: Hoare triple {12080#(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); {12080#(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-15 08:33:40,617 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {11860#(not (= |__VERIFIER_assert_#in~cond| 0))} {11727#true} #78#return; {12080#(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-15 08:33:40,617 INFO L290 TraceCheckUtils]: 42: Hoare triple {11860#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {11860#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID
[2022-04-15 08:33:40,618 INFO L290 TraceCheckUtils]: 41: Hoare triple {12040#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {11860#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID
[2022-04-15 08:33:40,618 INFO L290 TraceCheckUtils]: 40: Hoare triple {11727#true} ~cond := #in~cond; {12040#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID
[2022-04-15 08:33:40,618 INFO L272 TraceCheckUtils]: 39: Hoare triple {11727#true} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {11727#true} is VALID
[2022-04-15 08:33:40,618 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {11727#true} {11727#true} #76#return; {11727#true} is VALID
[2022-04-15 08:33:40,618 INFO L290 TraceCheckUtils]: 37: Hoare triple {11727#true} assume true; {11727#true} is VALID
[2022-04-15 08:33:40,618 INFO L290 TraceCheckUtils]: 36: Hoare triple {11727#true} assume !(0 == ~cond); {11727#true} is VALID
[2022-04-15 08:33:40,618 INFO L290 TraceCheckUtils]: 35: Hoare triple {11727#true} ~cond := #in~cond; {11727#true} is VALID
[2022-04-15 08:33:40,618 INFO L272 TraceCheckUtils]: 34: Hoare triple {11727#true} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {11727#true} is VALID
[2022-04-15 08:33:40,618 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {11727#true} {11727#true} #74#return; {11727#true} is VALID
[2022-04-15 08:33:40,618 INFO L290 TraceCheckUtils]: 32: Hoare triple {11727#true} assume true; {11727#true} is VALID
[2022-04-15 08:33:40,619 INFO L290 TraceCheckUtils]: 31: Hoare triple {11727#true} assume !(0 == ~cond); {11727#true} is VALID
[2022-04-15 08:33:40,619 INFO L290 TraceCheckUtils]: 30: Hoare triple {11727#true} ~cond := #in~cond; {11727#true} is VALID
[2022-04-15 08:33:40,619 INFO L272 TraceCheckUtils]: 29: Hoare triple {11727#true} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {11727#true} is VALID
[2022-04-15 08:33:40,619 INFO L290 TraceCheckUtils]: 28: Hoare triple {11727#true} assume !false; {11727#true} is VALID
[2022-04-15 08:33:40,619 INFO L290 TraceCheckUtils]: 27: Hoare triple {11727#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {11727#true} is VALID
[2022-04-15 08:33:40,630 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {11727#true} {11727#true} #72#return; {11727#true} is VALID
[2022-04-15 08:33:40,631 INFO L290 TraceCheckUtils]: 25: Hoare triple {11727#true} assume true; {11727#true} is VALID
[2022-04-15 08:33:40,631 INFO L290 TraceCheckUtils]: 24: Hoare triple {11727#true} assume !(0 == ~cond); {11727#true} is VALID
[2022-04-15 08:33:40,631 INFO L290 TraceCheckUtils]: 23: Hoare triple {11727#true} ~cond := #in~cond; {11727#true} is VALID
[2022-04-15 08:33:40,635 INFO L272 TraceCheckUtils]: 22: Hoare triple {11727#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {11727#true} is VALID
[2022-04-15 08:33:40,635 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {11727#true} {11727#true} #70#return; {11727#true} is VALID
[2022-04-15 08:33:40,635 INFO L290 TraceCheckUtils]: 20: Hoare triple {11727#true} assume true; {11727#true} is VALID
[2022-04-15 08:33:40,635 INFO L290 TraceCheckUtils]: 19: Hoare triple {11727#true} assume !(0 == ~cond); {11727#true} is VALID
[2022-04-15 08:33:40,635 INFO L290 TraceCheckUtils]: 18: Hoare triple {11727#true} ~cond := #in~cond; {11727#true} is VALID
[2022-04-15 08:33:40,635 INFO L272 TraceCheckUtils]: 17: Hoare triple {11727#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {11727#true} is VALID
[2022-04-15 08:33:40,636 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {11727#true} {11727#true} #68#return; {11727#true} is VALID
[2022-04-15 08:33:40,636 INFO L290 TraceCheckUtils]: 15: Hoare triple {11727#true} assume true; {11727#true} is VALID
[2022-04-15 08:33:40,636 INFO L290 TraceCheckUtils]: 14: Hoare triple {11727#true} assume !(0 == ~cond); {11727#true} is VALID
[2022-04-15 08:33:40,636 INFO L290 TraceCheckUtils]: 13: Hoare triple {11727#true} ~cond := #in~cond; {11727#true} is VALID
[2022-04-15 08:33:40,636 INFO L272 TraceCheckUtils]: 12: Hoare triple {11727#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 10 then 1 else 0)); {11727#true} is VALID
[2022-04-15 08:33:40,636 INFO L290 TraceCheckUtils]: 11: Hoare triple {11727#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {11727#true} is VALID
[2022-04-15 08:33:40,636 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {11727#true} {11727#true} #66#return; {11727#true} is VALID
[2022-04-15 08:33:40,636 INFO L290 TraceCheckUtils]: 9: Hoare triple {11727#true} assume true; {11727#true} is VALID
[2022-04-15 08:33:40,636 INFO L290 TraceCheckUtils]: 8: Hoare triple {11727#true} assume !(0 == ~cond); {11727#true} is VALID
[2022-04-15 08:33:40,636 INFO L290 TraceCheckUtils]: 7: Hoare triple {11727#true} ~cond := #in~cond; {11727#true} is VALID
[2022-04-15 08:33:40,636 INFO L272 TraceCheckUtils]: 6: Hoare triple {11727#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 10 then 1 else 0)); {11727#true} is VALID
[2022-04-15 08:33:40,636 INFO L290 TraceCheckUtils]: 5: Hoare triple {11727#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; {11727#true} is VALID
[2022-04-15 08:33:40,636 INFO L272 TraceCheckUtils]: 4: Hoare triple {11727#true} call #t~ret6 := main(); {11727#true} is VALID
[2022-04-15 08:33:40,636 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11727#true} {11727#true} #88#return; {11727#true} is VALID
[2022-04-15 08:33:40,637 INFO L290 TraceCheckUtils]: 2: Hoare triple {11727#true} assume true; {11727#true} is VALID
[2022-04-15 08:33:40,637 INFO L290 TraceCheckUtils]: 1: Hoare triple {11727#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); {11727#true} is VALID
[2022-04-15 08:33:40,637 INFO L272 TraceCheckUtils]: 0: Hoare triple {11727#true} call ULTIMATE.init(); {11727#true} is VALID
[2022-04-15 08:33:40,637 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-15 08:33:40,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-04-15 08:33:40,637 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1482818842]
[2022-04-15 08:33:40,637 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT
[2022-04-15 08:33:40,637 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [164260123]
[2022-04-15 08:33:40,637 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [164260123] provided 0 perfect and 2 imperfect interpolant sequences
[2022-04-15 08:33:40,637 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences.
[2022-04-15 08:33:40,638 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10] total 18
[2022-04-15 08:33:40,638 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace
[2022-04-15 08:33:40,638 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1948688746]
[2022-04-15 08:33:40,638 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1948688746] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-15 08:33:40,638 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-15 08:33:40,638 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13
[2022-04-15 08:33:40,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [862127936]
[2022-04-15 08:33:40,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-04-15 08:33:40,638 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-15 08:33:40,639 INFO L84 Accepts]: Finished accepts. word is accepted.
[2022-04-15 08:33:40,639 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-15 08:33:40,683 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-15 08:33:40,683 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 13 states
[2022-04-15 08:33:40,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION
[2022-04-15 08:33:40,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants.
[2022-04-15 08:33:40,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=250, Unknown=0, NotChecked=0, Total=306
[2022-04-15 08:33:40,684 INFO L87 Difference]: Start difference. First operand 153 states and 173 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-15 08:33:42,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-15 08:33:42,066 INFO L93 Difference]: Finished difference Result 175 states and 201 transitions.
[2022-04-15 08:33:42,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states.
[2022-04-15 08:33:42,067 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-15 08:33:42,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-04-15 08:33:42,067 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-15 08:33:42,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 69 transitions.
[2022-04-15 08:33:42,068 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-15 08:33:42,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 69 transitions.
[2022-04-15 08:33:42,069 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 69 transitions.
[2022-04-15 08:33:42,139 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-15 08:33:42,142 INFO L225 Difference]: With dead ends: 175
[2022-04-15 08:33:42,142 INFO L226 Difference]: Without dead ends: 173
[2022-04-15 08:33:42,142 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-15 08:33:42,142 INFO L913 BasicCegarLoop]: 27 mSDtfsCounter, 23 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 398 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 416 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 398 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time
[2022-04-15 08:33:42,142 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [29 Valid, 166 Invalid, 416 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 398 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time]
[2022-04-15 08:33:42,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states.
[2022-04-15 08:33:42,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 163.
[2022-04-15 08:33:42,265 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2022-04-15 08:33:42,266 INFO L82 GeneralOperation]: Start isEquivalent. First operand 173 states. Second operand has 163 states, 100 states have (on average 1.09) internal successors, (109), 104 states have internal predecessors, (109), 39 states have call successors, (39), 24 states have call predecessors, (39), 23 states have return successors, (38), 34 states have call predecessors, (38), 38 states have call successors, (38)
[2022-04-15 08:33:42,266 INFO L74 IsIncluded]: Start isIncluded. First operand 173 states. Second operand has 163 states, 100 states have (on average 1.09) internal successors, (109), 104 states have internal predecessors, (109), 39 states have call successors, (39), 24 states have call predecessors, (39), 23 states have return successors, (38), 34 states have call predecessors, (38), 38 states have call successors, (38)
[2022-04-15 08:33:42,266 INFO L87 Difference]: Start difference. First operand 173 states. Second operand has 163 states, 100 states have (on average 1.09) internal successors, (109), 104 states have internal predecessors, (109), 39 states have call successors, (39), 24 states have call predecessors, (39), 23 states have return successors, (38), 34 states have call predecessors, (38), 38 states have call successors, (38)
[2022-04-15 08:33:42,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-15 08:33:42,269 INFO L93 Difference]: Finished difference Result 173 states and 199 transitions.
[2022-04-15 08:33:42,269 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 199 transitions.
[2022-04-15 08:33:42,269 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-15 08:33:42,269 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-15 08:33:42,270 INFO L74 IsIncluded]: Start isIncluded. First operand has 163 states, 100 states have (on average 1.09) internal successors, (109), 104 states have internal predecessors, (109), 39 states have call successors, (39), 24 states have call predecessors, (39), 23 states have return successors, (38), 34 states have call predecessors, (38), 38 states have call successors, (38) Second operand 173 states.
[2022-04-15 08:33:42,270 INFO L87 Difference]: Start difference. First operand has 163 states, 100 states have (on average 1.09) internal successors, (109), 104 states have internal predecessors, (109), 39 states have call successors, (39), 24 states have call predecessors, (39), 23 states have return successors, (38), 34 states have call predecessors, (38), 38 states have call successors, (38) Second operand 173 states.
[2022-04-15 08:33:42,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-15 08:33:42,273 INFO L93 Difference]: Finished difference Result 173 states and 199 transitions.
[2022-04-15 08:33:42,273 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 199 transitions.
[2022-04-15 08:33:42,273 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-15 08:33:42,273 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-15 08:33:42,273 INFO L88 GeneralOperation]: Finished isEquivalent.
[2022-04-15 08:33:42,273 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2022-04-15 08:33:42,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 100 states have (on average 1.09) internal successors, (109), 104 states have internal predecessors, (109), 39 states have call successors, (39), 24 states have call predecessors, (39), 23 states have return successors, (38), 34 states have call predecessors, (38), 38 states have call successors, (38)
[2022-04-15 08:33:42,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 186 transitions.
[2022-04-15 08:33:42,276 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 186 transitions. Word has length 79
[2022-04-15 08:33:42,276 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-04-15 08:33:42,276 INFO L478 AbstractCegarLoop]: Abstraction has 163 states and 186 transitions.
[2022-04-15 08:33:42,277 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-15 08:33:42,277 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 163 states and 186 transitions.
[2022-04-15 08:33:42,999 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 186 edges. 186 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-15 08:33:43,000 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 186 transitions.
[2022-04-15 08:33:43,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93
[2022-04-15 08:33:43,000 INFO L491 BasicCegarLoop]: Found error trace
[2022-04-15 08:33:43,000 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-15 08:33:43,021 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0
[2022-04-15 08:33:43,219 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13
[2022-04-15 08:33:43,219 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-04-15 08:33:43,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-04-15 08:33:43,220 INFO L85 PathProgramCache]: Analyzing trace with hash 1804875380, now seen corresponding path program 7 times
[2022-04-15 08:33:43,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION
[2022-04-15 08:33:43,220 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [336591803]
[2022-04-15 08:33:43,220 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation
[2022-04-15 08:33:43,220 INFO L85 PathProgramCache]: Analyzing trace with hash 1804875380, now seen corresponding path program 8 times
[2022-04-15 08:33:43,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-04-15 08:33:43,221 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [501997486]
[2022-04-15 08:33:43,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-15 08:33:43,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-15 08:33:43,230 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic
[2022-04-15 08:33:43,231 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [803275727]
[2022-04-15 08:33:43,231 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2022-04-15 08:33:43,231 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-04-15 08:33:43,231 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-04-15 08:33:43,232 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2022-04-15 08:33:43,233 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process
[2022-04-15 08:33:43,281 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2022-04-15 08:33:43,281 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat
[2022-04-15 08:33:43,283 INFO L263 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 51 conjunts are in the unsatisfiable core
[2022-04-15 08:33:43,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-15 08:33:43,301 INFO L286 TraceCheckSpWp]: Computing forward predicates...
[2022-04-15 08:37:32,476 INFO L272 TraceCheckUtils]: 0: Hoare triple {13246#true} call ULTIMATE.init(); {13246#true} is VALID
[2022-04-15 08:37:32,477 INFO L290 TraceCheckUtils]: 1: Hoare triple {13246#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); {13246#true} is VALID
[2022-04-15 08:37:32,477 INFO L290 TraceCheckUtils]: 2: Hoare triple {13246#true} assume true; {13246#true} is VALID
[2022-04-15 08:37:32,477 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13246#true} {13246#true} #88#return; {13246#true} is VALID
[2022-04-15 08:37:32,477 INFO L272 TraceCheckUtils]: 4: Hoare triple {13246#true} call #t~ret6 := main(); {13246#true} is VALID
[2022-04-15 08:37:32,477 INFO L290 TraceCheckUtils]: 5: Hoare triple {13246#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; {13246#true} is VALID
[2022-04-15 08:37:32,477 INFO L272 TraceCheckUtils]: 6: Hoare triple {13246#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 10 then 1 else 0)); {13246#true} is VALID
[2022-04-15 08:37:32,477 INFO L290 TraceCheckUtils]: 7: Hoare triple {13246#true} ~cond := #in~cond; {13246#true} is VALID
[2022-04-15 08:37:32,477 INFO L290 TraceCheckUtils]: 8: Hoare triple {13246#true} assume !(0 == ~cond); {13246#true} is VALID
[2022-04-15 08:37:32,477 INFO L290 TraceCheckUtils]: 9: Hoare triple {13246#true} assume true; {13246#true} is VALID
[2022-04-15 08:37:32,477 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {13246#true} {13246#true} #66#return; {13246#true} is VALID
[2022-04-15 08:37:32,478 INFO L290 TraceCheckUtils]: 11: Hoare triple {13246#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {13246#true} is VALID
[2022-04-15 08:37:32,478 INFO L272 TraceCheckUtils]: 12: Hoare triple {13246#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 10 then 1 else 0)); {13246#true} is VALID
[2022-04-15 08:37:32,478 INFO L290 TraceCheckUtils]: 13: Hoare triple {13246#true} ~cond := #in~cond; {13246#true} is VALID
[2022-04-15 08:37:32,478 INFO L290 TraceCheckUtils]: 14: Hoare triple {13246#true} assume !(0 == ~cond); {13246#true} is VALID
[2022-04-15 08:37:32,478 INFO L290 TraceCheckUtils]: 15: Hoare triple {13246#true} assume true; {13246#true} is VALID
[2022-04-15 08:37:32,478 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {13246#true} {13246#true} #68#return; {13246#true} is VALID
[2022-04-15 08:37:32,478 INFO L272 TraceCheckUtils]: 17: Hoare triple {13246#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {13246#true} is VALID
[2022-04-15 08:37:32,478 INFO L290 TraceCheckUtils]: 18: Hoare triple {13246#true} ~cond := #in~cond; {13305#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID
[2022-04-15 08:37:32,479 INFO L290 TraceCheckUtils]: 19: Hoare triple {13305#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {13309#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID
[2022-04-15 08:37:32,479 INFO L290 TraceCheckUtils]: 20: Hoare triple {13309#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {13309#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID
[2022-04-15 08:37:32,479 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {13309#(not (= |assume_abort_if_not_#in~cond| 0))} {13246#true} #70#return; {13316#(<= 1 main_~x~0)} is VALID
[2022-04-15 08:37:32,479 INFO L272 TraceCheckUtils]: 22: Hoare triple {13316#(<= 1 main_~x~0)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {13246#true} is VALID
[2022-04-15 08:37:32,479 INFO L290 TraceCheckUtils]: 23: Hoare triple {13246#true} ~cond := #in~cond; {13246#true} is VALID
[2022-04-15 08:37:32,480 INFO L290 TraceCheckUtils]: 24: Hoare triple {13246#true} assume !(0 == ~cond); {13246#true} is VALID
[2022-04-15 08:37:32,480 INFO L290 TraceCheckUtils]: 25: Hoare triple {13246#true} assume true; {13246#true} is VALID
[2022-04-15 08:37:32,480 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {13246#true} {13316#(<= 1 main_~x~0)} #72#return; {13316#(<= 1 main_~x~0)} is VALID
[2022-04-15 08:37:32,480 INFO L290 TraceCheckUtils]: 27: Hoare triple {13316#(<= 1 main_~x~0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {13335#(and (= main_~r~0 0) (<= 1 main_~x~0) (<= 1 main_~p~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0))} is VALID
[2022-04-15 08:37:32,481 INFO L290 TraceCheckUtils]: 28: Hoare triple {13335#(and (= main_~r~0 0) (<= 1 main_~x~0) (<= 1 main_~p~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0))} assume !false; {13335#(and (= main_~r~0 0) (<= 1 main_~x~0) (<= 1 main_~p~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0))} is VALID
[2022-04-15 08:37:32,481 INFO L272 TraceCheckUtils]: 29: Hoare triple {13335#(and (= main_~r~0 0) (<= 1 main_~x~0) (<= 1 main_~p~0) (= main_~b~0 main_~y~0) (= 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)); {13246#true} is VALID
[2022-04-15 08:37:32,481 INFO L290 TraceCheckUtils]: 30: Hoare triple {13246#true} ~cond := #in~cond; {13246#true} is VALID
[2022-04-15 08:37:32,481 INFO L290 TraceCheckUtils]: 31: Hoare triple {13246#true} assume !(0 == ~cond); {13246#true} is VALID
[2022-04-15 08:37:32,481 INFO L290 TraceCheckUtils]: 32: Hoare triple {13246#true} assume true; {13246#true} is VALID
[2022-04-15 08:37:32,482 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {13246#true} {13335#(and (= main_~r~0 0) (<= 1 main_~x~0) (<= 1 main_~p~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0))} #74#return; {13335#(and (= main_~r~0 0) (<= 1 main_~x~0) (<= 1 main_~p~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0))} is VALID
[2022-04-15 08:37:32,482 INFO L272 TraceCheckUtils]: 34: Hoare triple {13335#(and (= main_~r~0 0) (<= 1 main_~x~0) (<= 1 main_~p~0) (= main_~b~0 main_~y~0) (= 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)); {13246#true} is VALID
[2022-04-15 08:37:32,482 INFO L290 TraceCheckUtils]: 35: Hoare triple {13246#true} ~cond := #in~cond; {13246#true} is VALID
[2022-04-15 08:37:32,482 INFO L290 TraceCheckUtils]: 36: Hoare triple {13246#true} assume !(0 == ~cond); {13246#true} is VALID
[2022-04-15 08:37:32,482 INFO L290 TraceCheckUtils]: 37: Hoare triple {13246#true} assume true; {13246#true} is VALID
[2022-04-15 08:37:32,483 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {13246#true} {13335#(and (= main_~r~0 0) (<= 1 main_~x~0) (<= 1 main_~p~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0))} #76#return; {13335#(and (= main_~r~0 0) (<= 1 main_~x~0) (<= 1 main_~p~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0))} is VALID
[2022-04-15 08:37:32,483 INFO L272 TraceCheckUtils]: 39: Hoare triple {13335#(and (= main_~r~0 0) (<= 1 main_~x~0) (<= 1 main_~p~0) (= main_~b~0 main_~y~0) (= 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)); {13246#true} is VALID
[2022-04-15 08:37:32,483 INFO L290 TraceCheckUtils]: 40: Hoare triple {13246#true} ~cond := #in~cond; {13246#true} is VALID
[2022-04-15 08:37:32,483 INFO L290 TraceCheckUtils]: 41: Hoare triple {13246#true} assume !(0 == ~cond); {13246#true} is VALID
[2022-04-15 08:37:32,483 INFO L290 TraceCheckUtils]: 42: Hoare triple {13246#true} assume true; {13246#true} is VALID
[2022-04-15 08:37:32,484 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {13246#true} {13335#(and (= main_~r~0 0) (<= 1 main_~x~0) (<= 1 main_~p~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0))} #78#return; {13335#(and (= main_~r~0 0) (<= 1 main_~x~0) (<= 1 main_~p~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0))} is VALID
[2022-04-15 08:37:32,484 INFO L290 TraceCheckUtils]: 44: Hoare triple {13335#(and (= main_~r~0 0) (<= 1 main_~x~0) (<= 1 main_~p~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0))} assume !!(~a~0 != ~b~0); {13335#(and (= main_~r~0 0) (<= 1 main_~x~0) (<= 1 main_~p~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0))} is VALID
[2022-04-15 08:37:32,485 INFO L290 TraceCheckUtils]: 45: Hoare triple {13335#(and (= main_~r~0 0) (<= 1 main_~x~0) (<= 1 main_~p~0) (= main_~b~0 main_~y~0) (= 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; {13390#(and (= (+ main_~s~0 main_~r~0) 0) (<= 1 main_~x~0) (< main_~b~0 main_~x~0) (= (+ main_~x~0 (* (- 1) main_~b~0)) main_~a~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 (+ main_~q~0 main_~p~0)))} is VALID
[2022-04-15 08:37:32,486 INFO L290 TraceCheckUtils]: 46: Hoare triple {13390#(and (= (+ main_~s~0 main_~r~0) 0) (<= 1 main_~x~0) (< main_~b~0 main_~x~0) (= (+ main_~x~0 (* (- 1) main_~b~0)) main_~a~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 (+ main_~q~0 main_~p~0)))} assume !false; {13390#(and (= (+ main_~s~0 main_~r~0) 0) (<= 1 main_~x~0) (< main_~b~0 main_~x~0) (= (+ main_~x~0 (* (- 1) main_~b~0)) main_~a~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 (+ main_~q~0 main_~p~0)))} is VALID
[2022-04-15 08:37:32,486 INFO L272 TraceCheckUtils]: 47: Hoare triple {13390#(and (= (+ main_~s~0 main_~r~0) 0) (<= 1 main_~x~0) (< main_~b~0 main_~x~0) (= (+ main_~x~0 (* (- 1) main_~b~0)) main_~a~0) (= main_~b~0 main_~y~0) (= main_~q~0 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)); {13246#true} is VALID
[2022-04-15 08:37:32,486 INFO L290 TraceCheckUtils]: 48: Hoare triple {13246#true} ~cond := #in~cond; {13246#true} is VALID
[2022-04-15 08:37:32,486 INFO L290 TraceCheckUtils]: 49: Hoare triple {13246#true} assume !(0 == ~cond); {13246#true} is VALID
[2022-04-15 08:37:32,486 INFO L290 TraceCheckUtils]: 50: Hoare triple {13246#true} assume true; {13246#true} is VALID
[2022-04-15 08:37:32,487 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {13246#true} {13390#(and (= (+ main_~s~0 main_~r~0) 0) (<= 1 main_~x~0) (< main_~b~0 main_~x~0) (= (+ main_~x~0 (* (- 1) main_~b~0)) main_~a~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 (+ main_~q~0 main_~p~0)))} #74#return; {13390#(and (= (+ main_~s~0 main_~r~0) 0) (<= 1 main_~x~0) (< main_~b~0 main_~x~0) (= (+ main_~x~0 (* (- 1) main_~b~0)) main_~a~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 (+ main_~q~0 main_~p~0)))} is VALID
[2022-04-15 08:37:32,487 INFO L272 TraceCheckUtils]: 52: Hoare triple {13390#(and (= (+ main_~s~0 main_~r~0) 0) (<= 1 main_~x~0) (< main_~b~0 main_~x~0) (= (+ main_~x~0 (* (- 1) main_~b~0)) main_~a~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 (+ main_~q~0 main_~p~0)))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {13246#true} is VALID
[2022-04-15 08:37:32,487 INFO L290 TraceCheckUtils]: 53: Hoare triple {13246#true} ~cond := #in~cond; {13246#true} is VALID
[2022-04-15 08:37:32,487 INFO L290 TraceCheckUtils]: 54: Hoare triple {13246#true} assume !(0 == ~cond); {13246#true} is VALID
[2022-04-15 08:37:32,487 INFO L290 TraceCheckUtils]: 55: Hoare triple {13246#true} assume true; {13246#true} is VALID
[2022-04-15 08:37:32,488 INFO L284 TraceCheckUtils]: 56: Hoare quadruple {13246#true} {13390#(and (= (+ main_~s~0 main_~r~0) 0) (<= 1 main_~x~0) (< main_~b~0 main_~x~0) (= (+ main_~x~0 (* (- 1) main_~b~0)) main_~a~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 (+ main_~q~0 main_~p~0)))} #76#return; {13390#(and (= (+ main_~s~0 main_~r~0) 0) (<= 1 main_~x~0) (< main_~b~0 main_~x~0) (= (+ main_~x~0 (* (- 1) main_~b~0)) main_~a~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 (+ main_~q~0 main_~p~0)))} is VALID
[2022-04-15 08:37:32,488 INFO L272 TraceCheckUtils]: 57: Hoare triple {13390#(and (= (+ main_~s~0 main_~r~0) 0) (<= 1 main_~x~0) (< main_~b~0 main_~x~0) (= (+ main_~x~0 (* (- 1) main_~b~0)) main_~a~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 (+ main_~q~0 main_~p~0)))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {13246#true} is VALID
[2022-04-15 08:37:32,488 INFO L290 TraceCheckUtils]: 58: Hoare triple {13246#true} ~cond := #in~cond; {13246#true} is VALID
[2022-04-15 08:37:32,488 INFO L290 TraceCheckUtils]: 59: Hoare triple {13246#true} assume !(0 == ~cond); {13246#true} is VALID
[2022-04-15 08:37:32,488 INFO L290 TraceCheckUtils]: 60: Hoare triple {13246#true} assume true; {13246#true} is VALID
[2022-04-15 08:37:32,489 INFO L284 TraceCheckUtils]: 61: Hoare quadruple {13246#true} {13390#(and (= (+ main_~s~0 main_~r~0) 0) (<= 1 main_~x~0) (< main_~b~0 main_~x~0) (= (+ main_~x~0 (* (- 1) main_~b~0)) main_~a~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 (+ main_~q~0 main_~p~0)))} #78#return; {13390#(and (= (+ main_~s~0 main_~r~0) 0) (<= 1 main_~x~0) (< main_~b~0 main_~x~0) (= (+ main_~x~0 (* (- 1) main_~b~0)) main_~a~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 (+ main_~q~0 main_~p~0)))} is VALID
[2022-04-15 08:37:32,490 INFO L290 TraceCheckUtils]: 62: Hoare triple {13390#(and (= (+ main_~s~0 main_~r~0) 0) (<= 1 main_~x~0) (< main_~b~0 main_~x~0) (= (+ main_~x~0 (* (- 1) main_~b~0)) main_~a~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 (+ main_~q~0 main_~p~0)))} assume !!(~a~0 != ~b~0); {13390#(and (= (+ main_~s~0 main_~r~0) 0) (<= 1 main_~x~0) (< main_~b~0 main_~x~0) (= (+ main_~x~0 (* (- 1) main_~b~0)) main_~a~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 (+ main_~q~0 main_~p~0)))} is VALID
[2022-04-15 08:37:32,491 INFO L290 TraceCheckUtils]: 63: Hoare triple {13390#(and (= (+ main_~s~0 main_~r~0) 0) (<= 1 main_~x~0) (< main_~b~0 main_~x~0) (= (+ main_~x~0 (* (- 1) main_~b~0)) main_~a~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 (+ main_~q~0 main_~p~0)))} assume !(~a~0 > ~b~0);~b~0 := ~b~0 - ~a~0;~q~0 := ~q~0 - ~p~0;~s~0 := ~s~0 - ~r~0; {13445#(and (= (+ (* main_~a~0 2) main_~b~0) main_~x~0) (= (+ main_~a~0 main_~y~0) main_~x~0) (<= 1 main_~p~0) (< 0 main_~a~0) (<= (* main_~a~0 2) main_~x~0) (= (+ main_~q~0 main_~p~0) 0) (= (+ main_~s~0 (* main_~r~0 2)) 0))} is VALID
[2022-04-15 08:37:32,491 INFO L290 TraceCheckUtils]: 64: Hoare triple {13445#(and (= (+ (* main_~a~0 2) main_~b~0) main_~x~0) (= (+ main_~a~0 main_~y~0) main_~x~0) (<= 1 main_~p~0) (< 0 main_~a~0) (<= (* main_~a~0 2) main_~x~0) (= (+ main_~q~0 main_~p~0) 0) (= (+ main_~s~0 (* main_~r~0 2)) 0))} assume !false; {13445#(and (= (+ (* main_~a~0 2) main_~b~0) main_~x~0) (= (+ main_~a~0 main_~y~0) main_~x~0) (<= 1 main_~p~0) (< 0 main_~a~0) (<= (* main_~a~0 2) main_~x~0) (= (+ main_~q~0 main_~p~0) 0) (= (+ main_~s~0 (* main_~r~0 2)) 0))} is VALID
[2022-04-15 08:37:32,491 INFO L272 TraceCheckUtils]: 65: Hoare triple {13445#(and (= (+ (* main_~a~0 2) main_~b~0) main_~x~0) (= (+ main_~a~0 main_~y~0) main_~x~0) (<= 1 main_~p~0) (< 0 main_~a~0) (<= (* main_~a~0 2) main_~x~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)); {13246#true} is VALID
[2022-04-15 08:37:32,491 INFO L290 TraceCheckUtils]: 66: Hoare triple {13246#true} ~cond := #in~cond; {13246#true} is VALID
[2022-04-15 08:37:32,492 INFO L290 TraceCheckUtils]: 67: Hoare triple {13246#true} assume !(0 == ~cond); {13246#true} is VALID
[2022-04-15 08:37:32,492 INFO L290 TraceCheckUtils]: 68: Hoare triple {13246#true} assume true; {13246#true} is VALID
[2022-04-15 08:37:32,492 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {13246#true} {13445#(and (= (+ (* main_~a~0 2) main_~b~0) main_~x~0) (= (+ main_~a~0 main_~y~0) main_~x~0) (<= 1 main_~p~0) (< 0 main_~a~0) (<= (* main_~a~0 2) main_~x~0) (= (+ main_~q~0 main_~p~0) 0) (= (+ main_~s~0 (* main_~r~0 2)) 0))} #74#return; {13445#(and (= (+ (* main_~a~0 2) main_~b~0) main_~x~0) (= (+ main_~a~0 main_~y~0) main_~x~0) (<= 1 main_~p~0) (< 0 main_~a~0) (<= (* main_~a~0 2) main_~x~0) (= (+ main_~q~0 main_~p~0) 0) (= (+ main_~s~0 (* main_~r~0 2)) 0))} is VALID
[2022-04-15 08:37:32,492 INFO L272 TraceCheckUtils]: 70: Hoare triple {13445#(and (= (+ (* main_~a~0 2) main_~b~0) main_~x~0) (= (+ main_~a~0 main_~y~0) main_~x~0) (<= 1 main_~p~0) (< 0 main_~a~0) (<= (* main_~a~0 2) main_~x~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)); {13246#true} is VALID
[2022-04-15 08:37:32,493 INFO L290 TraceCheckUtils]: 71: Hoare triple {13246#true} ~cond := #in~cond; {13470#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID
[2022-04-15 08:37:32,493 INFO L290 TraceCheckUtils]: 72: Hoare triple {13470#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {13474#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID
[2022-04-15 08:37:32,493 INFO L290 TraceCheckUtils]: 73: Hoare triple {13474#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {13474#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID
[2022-04-15 08:37:32,494 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {13474#(not (= |__VERIFIER_assert_#in~cond| 0))} {13445#(and (= (+ (* main_~a~0 2) main_~b~0) main_~x~0) (= (+ main_~a~0 main_~y~0) main_~x~0) (<= 1 main_~p~0) (< 0 main_~a~0) (<= (* main_~a~0 2) main_~x~0) (= (+ main_~q~0 main_~p~0) 0) (= (+ main_~s~0 (* main_~r~0 2)) 0))} #76#return; {13481#(and (= (+ (* main_~a~0 2) main_~b~0) main_~x~0) (= (+ main_~a~0 main_~y~0) main_~x~0) (<= 1 main_~p~0) (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (< 0 main_~a~0) (<= (* main_~a~0 2) main_~x~0) (= (+ main_~q~0 main_~p~0) 0) (= (+ main_~s~0 (* main_~r~0 2)) 0))} is VALID
[2022-04-15 08:37:32,495 INFO L272 TraceCheckUtils]: 75: Hoare triple {13481#(and (= (+ (* main_~a~0 2) main_~b~0) main_~x~0) (= (+ main_~a~0 main_~y~0) main_~x~0) (<= 1 main_~p~0) (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (< 0 main_~a~0) (<= (* main_~a~0 2) main_~x~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)); {13246#true} is VALID
[2022-04-15 08:37:32,495 INFO L290 TraceCheckUtils]: 76: Hoare triple {13246#true} ~cond := #in~cond; {13470#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID
[2022-04-15 08:37:32,495 INFO L290 TraceCheckUtils]: 77: Hoare triple {13470#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {13474#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID
[2022-04-15 08:37:32,495 INFO L290 TraceCheckUtils]: 78: Hoare triple {13474#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {13474#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID
[2022-04-15 08:37:32,497 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {13474#(not (= |__VERIFIER_assert_#in~cond| 0))} {13481#(and (= (+ (* main_~a~0 2) main_~b~0) main_~x~0) (= (+ main_~a~0 main_~y~0) main_~x~0) (<= 1 main_~p~0) (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (< 0 main_~a~0) (<= (* main_~a~0 2) main_~x~0) (= (+ main_~q~0 main_~p~0) 0) (= (+ main_~s~0 (* main_~r~0 2)) 0))} #78#return; {13497#(and (= (+ (* main_~a~0 2) main_~b~0) main_~x~0) (= (+ main_~a~0 main_~y~0) main_~x~0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (< 0 main_~a~0) (<= (* main_~a~0 2) main_~x~0) (= (+ main_~q~0 main_~p~0) 0) (= (+ main_~s~0 (* main_~r~0 2)) 0))} is VALID
[2022-04-15 08:37:32,497 INFO L290 TraceCheckUtils]: 80: Hoare triple {13497#(and (= (+ (* main_~a~0 2) main_~b~0) main_~x~0) (= (+ main_~a~0 main_~y~0) main_~x~0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (< 0 main_~a~0) (<= (* main_~a~0 2) main_~x~0) (= (+ main_~q~0 main_~p~0) 0) (= (+ main_~s~0 (* main_~r~0 2)) 0))} assume !!(~a~0 != ~b~0); {13497#(and (= (+ (* main_~a~0 2) main_~b~0) main_~x~0) (= (+ main_~a~0 main_~y~0) main_~x~0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (< 0 main_~a~0) (<= (* main_~a~0 2) main_~x~0) (= (+ main_~q~0 main_~p~0) 0) (= (+ main_~s~0 (* main_~r~0 2)) 0))} is VALID
[2022-04-15 08:37:32,505 INFO L290 TraceCheckUtils]: 81: Hoare triple {13497#(and (= (+ (* main_~a~0 2) main_~b~0) main_~x~0) (= (+ main_~a~0 main_~y~0) main_~x~0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (< 0 main_~a~0) (<= (* main_~a~0 2) main_~x~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; {13504#(and (<= (+ (* 2 (* main_~x~0 (div (* (- 1) main_~p~0) 2))) (* (* main_~y~0 main_~r~0) 2) (* 2 (* main_~y~0 (div (* (- 2) main_~r~0) 3))) (* 2 (* main_~p~0 main_~x~0))) main_~x~0) (= (mod main_~r~0 3) 0) (= (+ main_~y~0 (* main_~x~0 (+ main_~p~0 (div (- main_~p~0) 2))) (* (+ main_~r~0 (div (* (- 2) main_~r~0) 3)) main_~y~0)) main_~x~0) (< 0 (+ (* main_~y~0 main_~r~0) (* main_~y~0 (div (* (- 2) main_~r~0) 3)) (* main_~p~0 main_~x~0) (* main_~x~0 (div (* (- 1) main_~p~0) 2)))) (= main_~x~0 (+ (* 2 (* main_~x~0 (+ main_~p~0 (div (- main_~p~0) 2)))) (* main_~x~0 (div (- main_~p~0) 2)) (* main_~y~0 (div (* (- 2) main_~r~0) 3)) (* 2 (* (+ main_~r~0 (div (* (- 2) main_~r~0) 3)) main_~y~0)))) (= (mod main_~p~0 2) 0) (= main_~a~0 (+ (* (- 1) (* main_~y~0 (div (* (- 2) main_~r~0) 3))) (* main_~x~0 (+ main_~p~0 (div (- main_~p~0) 2))) (* (+ main_~r~0 (div (* (- 2) main_~r~0) 3)) main_~y~0) (* (- 1) (* main_~x~0 (div (- main_~p~0) 2))))))} is VALID
[2022-04-15 08:37:32,506 INFO L290 TraceCheckUtils]: 82: Hoare triple {13504#(and (<= (+ (* 2 (* main_~x~0 (div (* (- 1) main_~p~0) 2))) (* (* main_~y~0 main_~r~0) 2) (* 2 (* main_~y~0 (div (* (- 2) main_~r~0) 3))) (* 2 (* main_~p~0 main_~x~0))) main_~x~0) (= (mod main_~r~0 3) 0) (= (+ main_~y~0 (* main_~x~0 (+ main_~p~0 (div (- main_~p~0) 2))) (* (+ main_~r~0 (div (* (- 2) main_~r~0) 3)) main_~y~0)) main_~x~0) (< 0 (+ (* main_~y~0 main_~r~0) (* main_~y~0 (div (* (- 2) main_~r~0) 3)) (* main_~p~0 main_~x~0) (* main_~x~0 (div (* (- 1) main_~p~0) 2)))) (= main_~x~0 (+ (* 2 (* main_~x~0 (+ main_~p~0 (div (- main_~p~0) 2)))) (* main_~x~0 (div (- main_~p~0) 2)) (* main_~y~0 (div (* (- 2) main_~r~0) 3)) (* 2 (* (+ main_~r~0 (div (* (- 2) main_~r~0) 3)) main_~y~0)))) (= (mod main_~p~0 2) 0) (= main_~a~0 (+ (* (- 1) (* main_~y~0 (div (* (- 2) main_~r~0) 3))) (* main_~x~0 (+ main_~p~0 (div (- main_~p~0) 2))) (* (+ main_~r~0 (div (* (- 2) main_~r~0) 3)) main_~y~0) (* (- 1) (* main_~x~0 (div (- main_~p~0) 2))))))} assume !false; {13504#(and (<= (+ (* 2 (* main_~x~0 (div (* (- 1) main_~p~0) 2))) (* (* main_~y~0 main_~r~0) 2) (* 2 (* main_~y~0 (div (* (- 2) main_~r~0) 3))) (* 2 (* main_~p~0 main_~x~0))) main_~x~0) (= (mod main_~r~0 3) 0) (= (+ main_~y~0 (* main_~x~0 (+ main_~p~0 (div (- main_~p~0) 2))) (* (+ main_~r~0 (div (* (- 2) main_~r~0) 3)) main_~y~0)) main_~x~0) (< 0 (+ (* main_~y~0 main_~r~0) (* main_~y~0 (div (* (- 2) main_~r~0) 3)) (* main_~p~0 main_~x~0) (* main_~x~0 (div (* (- 1) main_~p~0) 2)))) (= main_~x~0 (+ (* 2 (* main_~x~0 (+ main_~p~0 (div (- main_~p~0) 2)))) (* main_~x~0 (div (- main_~p~0) 2)) (* main_~y~0 (div (* (- 2) main_~r~0) 3)) (* 2 (* (+ main_~r~0 (div (* (- 2) main_~r~0) 3)) main_~y~0)))) (= (mod main_~p~0 2) 0) (= main_~a~0 (+ (* (- 1) (* main_~y~0 (div (* (- 2) main_~r~0) 3))) (* main_~x~0 (+ main_~p~0 (div (- main_~p~0) 2))) (* (+ main_~r~0 (div (* (- 2) main_~r~0) 3)) main_~y~0) (* (- 1) (* main_~x~0 (div (- main_~p~0) 2))))))} is VALID
[2022-04-15 08:37:32,506 INFO L272 TraceCheckUtils]: 83: Hoare triple {13504#(and (<= (+ (* 2 (* main_~x~0 (div (* (- 1) main_~p~0) 2))) (* (* main_~y~0 main_~r~0) 2) (* 2 (* main_~y~0 (div (* (- 2) main_~r~0) 3))) (* 2 (* main_~p~0 main_~x~0))) main_~x~0) (= (mod main_~r~0 3) 0) (= (+ main_~y~0 (* main_~x~0 (+ main_~p~0 (div (- main_~p~0) 2))) (* (+ main_~r~0 (div (* (- 2) main_~r~0) 3)) main_~y~0)) main_~x~0) (< 0 (+ (* main_~y~0 main_~r~0) (* main_~y~0 (div (* (- 2) main_~r~0) 3)) (* main_~p~0 main_~x~0) (* main_~x~0 (div (* (- 1) main_~p~0) 2)))) (= main_~x~0 (+ (* 2 (* main_~x~0 (+ main_~p~0 (div (- main_~p~0) 2)))) (* main_~x~0 (div (- main_~p~0) 2)) (* main_~y~0 (div (* (- 2) main_~r~0) 3)) (* 2 (* (+ main_~r~0 (div (* (- 2) main_~r~0) 3)) main_~y~0)))) (= (mod main_~p~0 2) 0) (= main_~a~0 (+ (* (- 1) (* main_~y~0 (div (* (- 2) main_~r~0) 3))) (* main_~x~0 (+ main_~p~0 (div (- main_~p~0) 2))) (* (+ main_~r~0 (div (* (- 2) main_~r~0) 3)) main_~y~0) (* (- 1) (* main_~x~0 (div (- main_~p~0) 2))))))} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {13246#true} is VALID
[2022-04-15 08:37:32,506 INFO L290 TraceCheckUtils]: 84: Hoare triple {13246#true} ~cond := #in~cond; {13246#true} is VALID
[2022-04-15 08:37:32,506 INFO L290 TraceCheckUtils]: 85: Hoare triple {13246#true} assume !(0 == ~cond); {13246#true} is VALID
[2022-04-15 08:37:32,506 INFO L290 TraceCheckUtils]: 86: Hoare triple {13246#true} assume true; {13246#true} is VALID
[2022-04-15 08:37:32,507 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {13246#true} {13504#(and (<= (+ (* 2 (* main_~x~0 (div (* (- 1) main_~p~0) 2))) (* (* main_~y~0 main_~r~0) 2) (* 2 (* main_~y~0 (div (* (- 2) main_~r~0) 3))) (* 2 (* main_~p~0 main_~x~0))) main_~x~0) (= (mod main_~r~0 3) 0) (= (+ main_~y~0 (* main_~x~0 (+ main_~p~0 (div (- main_~p~0) 2))) (* (+ main_~r~0 (div (* (- 2) main_~r~0) 3)) main_~y~0)) main_~x~0) (< 0 (+ (* main_~y~0 main_~r~0) (* main_~y~0 (div (* (- 2) main_~r~0) 3)) (* main_~p~0 main_~x~0) (* main_~x~0 (div (* (- 1) main_~p~0) 2)))) (= main_~x~0 (+ (* 2 (* main_~x~0 (+ main_~p~0 (div (- main_~p~0) 2)))) (* main_~x~0 (div (- main_~p~0) 2)) (* main_~y~0 (div (* (- 2) main_~r~0) 3)) (* 2 (* (+ main_~r~0 (div (* (- 2) main_~r~0) 3)) main_~y~0)))) (= (mod main_~p~0 2) 0) (= main_~a~0 (+ (* (- 1) (* main_~y~0 (div (* (- 2) main_~r~0) 3))) (* main_~x~0 (+ main_~p~0 (div (- main_~p~0) 2))) (* (+ main_~r~0 (div (* (- 2) main_~r~0) 3)) main_~y~0) (* (- 1) (* main_~x~0 (div (- main_~p~0) 2))))))} #74#return; {13504#(and (<= (+ (* 2 (* main_~x~0 (div (* (- 1) main_~p~0) 2))) (* (* main_~y~0 main_~r~0) 2) (* 2 (* main_~y~0 (div (* (- 2) main_~r~0) 3))) (* 2 (* main_~p~0 main_~x~0))) main_~x~0) (= (mod main_~r~0 3) 0) (= (+ main_~y~0 (* main_~x~0 (+ main_~p~0 (div (- main_~p~0) 2))) (* (+ main_~r~0 (div (* (- 2) main_~r~0) 3)) main_~y~0)) main_~x~0) (< 0 (+ (* main_~y~0 main_~r~0) (* main_~y~0 (div (* (- 2) main_~r~0) 3)) (* main_~p~0 main_~x~0) (* main_~x~0 (div (* (- 1) main_~p~0) 2)))) (= main_~x~0 (+ (* 2 (* main_~x~0 (+ main_~p~0 (div (- main_~p~0) 2)))) (* main_~x~0 (div (- main_~p~0) 2)) (* main_~y~0 (div (* (- 2) main_~r~0) 3)) (* 2 (* (+ main_~r~0 (div (* (- 2) main_~r~0) 3)) main_~y~0)))) (= (mod main_~p~0 2) 0) (= main_~a~0 (+ (* (- 1) (* main_~y~0 (div (* (- 2) main_~r~0) 3))) (* main_~x~0 (+ main_~p~0 (div (- main_~p~0) 2))) (* (+ main_~r~0 (div (* (- 2) main_~r~0) 3)) main_~y~0) (* (- 1) (* main_~x~0 (div (- main_~p~0) 2))))))} is VALID
[2022-04-15 08:37:32,508 INFO L272 TraceCheckUtils]: 88: Hoare triple {13504#(and (<= (+ (* 2 (* main_~x~0 (div (* (- 1) main_~p~0) 2))) (* (* main_~y~0 main_~r~0) 2) (* 2 (* main_~y~0 (div (* (- 2) main_~r~0) 3))) (* 2 (* main_~p~0 main_~x~0))) main_~x~0) (= (mod main_~r~0 3) 0) (= (+ main_~y~0 (* main_~x~0 (+ main_~p~0 (div (- main_~p~0) 2))) (* (+ main_~r~0 (div (* (- 2) main_~r~0) 3)) main_~y~0)) main_~x~0) (< 0 (+ (* main_~y~0 main_~r~0) (* main_~y~0 (div (* (- 2) main_~r~0) 3)) (* main_~p~0 main_~x~0) (* main_~x~0 (div (* (- 1) main_~p~0) 2)))) (= main_~x~0 (+ (* 2 (* main_~x~0 (+ main_~p~0 (div (- main_~p~0) 2)))) (* main_~x~0 (div (- main_~p~0) 2)) (* main_~y~0 (div (* (- 2) main_~r~0) 3)) (* 2 (* (+ main_~r~0 (div (* (- 2) main_~r~0) 3)) main_~y~0)))) (= (mod main_~p~0 2) 0) (= main_~a~0 (+ (* (- 1) (* main_~y~0 (div (* (- 2) main_~r~0) 3))) (* main_~x~0 (+ main_~p~0 (div (- main_~p~0) 2))) (* (+ main_~r~0 (div (* (- 2) main_~r~0) 3)) main_~y~0) (* (- 1) (* main_~x~0 (div (- main_~p~0) 2))))))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {13526#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID
[2022-04-15 08:37:32,508 INFO L290 TraceCheckUtils]: 89: Hoare triple {13526#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {13530#(<= 1 __VERIFIER_assert_~cond)} is VALID
[2022-04-15 08:37:32,508 INFO L290 TraceCheckUtils]: 90: Hoare triple {13530#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {13247#false} is VALID
[2022-04-15 08:37:32,508 INFO L290 TraceCheckUtils]: 91: Hoare triple {13247#false} assume !false; {13247#false} is VALID
[2022-04-15 08:37:32,509 INFO L134 CoverageAnalysis]: Checked inductivity of 251 backedges. 66 proven. 38 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked.
[2022-04-15 08:37:32,509 INFO L328 TraceCheckSpWp]: Computing backward predicates...
[2022-04-15 08:38:04,542 INFO L290 TraceCheckUtils]: 91: Hoare triple {13247#false} assume !false; {13247#false} is VALID
[2022-04-15 08:38:04,543 INFO L290 TraceCheckUtils]: 90: Hoare triple {13530#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {13247#false} is VALID
[2022-04-15 08:38:04,543 INFO L290 TraceCheckUtils]: 89: Hoare triple {13526#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {13530#(<= 1 __VERIFIER_assert_~cond)} is VALID
[2022-04-15 08:38:04,544 INFO L272 TraceCheckUtils]: 88: Hoare triple {13546#(= 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)); {13526#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID
[2022-04-15 08:38:04,544 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {13246#true} {13546#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} #74#return; {13546#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID
[2022-04-15 08:38:04,544 INFO L290 TraceCheckUtils]: 86: Hoare triple {13246#true} assume true; {13246#true} is VALID
[2022-04-15 08:38:04,544 INFO L290 TraceCheckUtils]: 85: Hoare triple {13246#true} assume !(0 == ~cond); {13246#true} is VALID
[2022-04-15 08:38:04,544 INFO L290 TraceCheckUtils]: 84: Hoare triple {13246#true} ~cond := #in~cond; {13246#true} is VALID
[2022-04-15 08:38:04,545 INFO L272 TraceCheckUtils]: 83: Hoare triple {13546#(= 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)); {13246#true} is VALID
[2022-04-15 08:38:04,545 INFO L290 TraceCheckUtils]: 82: Hoare triple {13546#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} assume !false; {13546#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID
[2022-04-15 08:38:04,788 INFO L290 TraceCheckUtils]: 81: Hoare triple {13568#(= (+ 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; {13546#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID
[2022-04-15 08:38:04,789 INFO L290 TraceCheckUtils]: 80: Hoare triple {13568#(= (+ 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); {13568#(= (+ 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-15 08:38:04,790 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {13474#(not (= |__VERIFIER_assert_#in~cond| 0))} {13575#(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_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} #78#return; {13568#(= (+ 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-15 08:38:04,790 INFO L290 TraceCheckUtils]: 78: Hoare triple {13474#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {13474#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID
[2022-04-15 08:38:04,790 INFO L290 TraceCheckUtils]: 77: Hoare triple {13585#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {13474#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID
[2022-04-15 08:38:04,790 INFO L290 TraceCheckUtils]: 76: Hoare triple {13246#true} ~cond := #in~cond; {13585#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID
[2022-04-15 08:38:04,791 INFO L272 TraceCheckUtils]: 75: Hoare triple {13575#(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_~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)); {13246#true} is VALID
[2022-04-15 08:38:04,792 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {13474#(not (= |__VERIFIER_assert_#in~cond| 0))} {13246#true} #76#return; {13575#(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_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} is VALID
[2022-04-15 08:38:04,792 INFO L290 TraceCheckUtils]: 73: Hoare triple {13474#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {13474#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID
[2022-04-15 08:38:04,792 INFO L290 TraceCheckUtils]: 72: Hoare triple {13585#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {13474#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID
[2022-04-15 08:38:04,793 INFO L290 TraceCheckUtils]: 71: Hoare triple {13246#true} ~cond := #in~cond; {13585#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID
[2022-04-15 08:38:04,793 INFO L272 TraceCheckUtils]: 70: Hoare triple {13246#true} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {13246#true} is VALID
[2022-04-15 08:38:04,793 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {13246#true} {13246#true} #74#return; {13246#true} is VALID
[2022-04-15 08:38:04,793 INFO L290 TraceCheckUtils]: 68: Hoare triple {13246#true} assume true; {13246#true} is VALID
[2022-04-15 08:38:04,793 INFO L290 TraceCheckUtils]: 67: Hoare triple {13246#true} assume !(0 == ~cond); {13246#true} is VALID
[2022-04-15 08:38:04,793 INFO L290 TraceCheckUtils]: 66: Hoare triple {13246#true} ~cond := #in~cond; {13246#true} is VALID
[2022-04-15 08:38:04,793 INFO L272 TraceCheckUtils]: 65: Hoare triple {13246#true} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {13246#true} is VALID
[2022-04-15 08:38:04,793 INFO L290 TraceCheckUtils]: 64: Hoare triple {13246#true} assume !false; {13246#true} is VALID
[2022-04-15 08:38:04,793 INFO L290 TraceCheckUtils]: 63: Hoare triple {13246#true} assume !(~a~0 > ~b~0);~b~0 := ~b~0 - ~a~0;~q~0 := ~q~0 - ~p~0;~s~0 := ~s~0 - ~r~0; {13246#true} is VALID
[2022-04-15 08:38:04,793 INFO L290 TraceCheckUtils]: 62: Hoare triple {13246#true} assume !!(~a~0 != ~b~0); {13246#true} is VALID
[2022-04-15 08:38:04,793 INFO L284 TraceCheckUtils]: 61: Hoare quadruple {13246#true} {13246#true} #78#return; {13246#true} is VALID
[2022-04-15 08:38:04,793 INFO L290 TraceCheckUtils]: 60: Hoare triple {13246#true} assume true; {13246#true} is VALID
[2022-04-15 08:38:04,794 INFO L290 TraceCheckUtils]: 59: Hoare triple {13246#true} assume !(0 == ~cond); {13246#true} is VALID
[2022-04-15 08:38:04,794 INFO L290 TraceCheckUtils]: 58: Hoare triple {13246#true} ~cond := #in~cond; {13246#true} is VALID
[2022-04-15 08:38:04,794 INFO L272 TraceCheckUtils]: 57: Hoare triple {13246#true} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {13246#true} is VALID
[2022-04-15 08:38:04,794 INFO L284 TraceCheckUtils]: 56: Hoare quadruple {13246#true} {13246#true} #76#return; {13246#true} is VALID
[2022-04-15 08:38:04,794 INFO L290 TraceCheckUtils]: 55: Hoare triple {13246#true} assume true; {13246#true} is VALID
[2022-04-15 08:38:04,794 INFO L290 TraceCheckUtils]: 54: Hoare triple {13246#true} assume !(0 == ~cond); {13246#true} is VALID
[2022-04-15 08:38:04,794 INFO L290 TraceCheckUtils]: 53: Hoare triple {13246#true} ~cond := #in~cond; {13246#true} is VALID
[2022-04-15 08:38:04,794 INFO L272 TraceCheckUtils]: 52: Hoare triple {13246#true} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {13246#true} is VALID
[2022-04-15 08:38:04,794 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {13246#true} {13246#true} #74#return; {13246#true} is VALID
[2022-04-15 08:38:04,794 INFO L290 TraceCheckUtils]: 50: Hoare triple {13246#true} assume true; {13246#true} is VALID
[2022-04-15 08:38:04,794 INFO L290 TraceCheckUtils]: 49: Hoare triple {13246#true} assume !(0 == ~cond); {13246#true} is VALID
[2022-04-15 08:38:04,794 INFO L290 TraceCheckUtils]: 48: Hoare triple {13246#true} ~cond := #in~cond; {13246#true} is VALID
[2022-04-15 08:38:04,794 INFO L272 TraceCheckUtils]: 47: Hoare triple {13246#true} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {13246#true} is VALID
[2022-04-15 08:38:04,794 INFO L290 TraceCheckUtils]: 46: Hoare triple {13246#true} assume !false; {13246#true} is VALID
[2022-04-15 08:38:04,794 INFO L290 TraceCheckUtils]: 45: Hoare triple {13246#true} assume ~a~0 > ~b~0;~a~0 := ~a~0 - ~b~0;~p~0 := ~p~0 - ~q~0;~r~0 := ~r~0 - ~s~0; {13246#true} is VALID
[2022-04-15 08:38:04,795 INFO L290 TraceCheckUtils]: 44: Hoare triple {13246#true} assume !!(~a~0 != ~b~0); {13246#true} is VALID
[2022-04-15 08:38:04,795 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {13246#true} {13246#true} #78#return; {13246#true} is VALID
[2022-04-15 08:38:04,795 INFO L290 TraceCheckUtils]: 42: Hoare triple {13246#true} assume true; {13246#true} is VALID
[2022-04-15 08:38:04,795 INFO L290 TraceCheckUtils]: 41: Hoare triple {13246#true} assume !(0 == ~cond); {13246#true} is VALID
[2022-04-15 08:38:04,795 INFO L290 TraceCheckUtils]: 40: Hoare triple {13246#true} ~cond := #in~cond; {13246#true} is VALID
[2022-04-15 08:38:04,795 INFO L272 TraceCheckUtils]: 39: Hoare triple {13246#true} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {13246#true} is VALID
[2022-04-15 08:38:04,795 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {13246#true} {13246#true} #76#return; {13246#true} is VALID
[2022-04-15 08:38:04,795 INFO L290 TraceCheckUtils]: 37: Hoare triple {13246#true} assume true; {13246#true} is VALID
[2022-04-15 08:38:04,795 INFO L290 TraceCheckUtils]: 36: Hoare triple {13246#true} assume !(0 == ~cond); {13246#true} is VALID
[2022-04-15 08:38:04,795 INFO L290 TraceCheckUtils]: 35: Hoare triple {13246#true} ~cond := #in~cond; {13246#true} is VALID
[2022-04-15 08:38:04,795 INFO L272 TraceCheckUtils]: 34: Hoare triple {13246#true} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {13246#true} is VALID
[2022-04-15 08:38:04,795 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {13246#true} {13246#true} #74#return; {13246#true} is VALID
[2022-04-15 08:38:04,795 INFO L290 TraceCheckUtils]: 32: Hoare triple {13246#true} assume true; {13246#true} is VALID
[2022-04-15 08:38:04,795 INFO L290 TraceCheckUtils]: 31: Hoare triple {13246#true} assume !(0 == ~cond); {13246#true} is VALID
[2022-04-15 08:38:04,796 INFO L290 TraceCheckUtils]: 30: Hoare triple {13246#true} ~cond := #in~cond; {13246#true} is VALID
[2022-04-15 08:38:04,796 INFO L272 TraceCheckUtils]: 29: Hoare triple {13246#true} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {13246#true} is VALID
[2022-04-15 08:38:04,796 INFO L290 TraceCheckUtils]: 28: Hoare triple {13246#true} assume !false; {13246#true} is VALID
[2022-04-15 08:38:04,796 INFO L290 TraceCheckUtils]: 27: Hoare triple {13246#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {13246#true} is VALID
[2022-04-15 08:38:04,796 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {13246#true} {13246#true} #72#return; {13246#true} is VALID
[2022-04-15 08:38:04,796 INFO L290 TraceCheckUtils]: 25: Hoare triple {13246#true} assume true; {13246#true} is VALID
[2022-04-15 08:38:04,796 INFO L290 TraceCheckUtils]: 24: Hoare triple {13246#true} assume !(0 == ~cond); {13246#true} is VALID
[2022-04-15 08:38:04,796 INFO L290 TraceCheckUtils]: 23: Hoare triple {13246#true} ~cond := #in~cond; {13246#true} is VALID
[2022-04-15 08:38:04,796 INFO L272 TraceCheckUtils]: 22: Hoare triple {13246#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {13246#true} is VALID
[2022-04-15 08:38:04,796 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {13246#true} {13246#true} #70#return; {13246#true} is VALID
[2022-04-15 08:38:04,796 INFO L290 TraceCheckUtils]: 20: Hoare triple {13246#true} assume true; {13246#true} is VALID
[2022-04-15 08:38:04,796 INFO L290 TraceCheckUtils]: 19: Hoare triple {13246#true} assume !(0 == ~cond); {13246#true} is VALID
[2022-04-15 08:38:04,796 INFO L290 TraceCheckUtils]: 18: Hoare triple {13246#true} ~cond := #in~cond; {13246#true} is VALID
[2022-04-15 08:38:04,796 INFO L272 TraceCheckUtils]: 17: Hoare triple {13246#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {13246#true} is VALID
[2022-04-15 08:38:04,797 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {13246#true} {13246#true} #68#return; {13246#true} is VALID
[2022-04-15 08:38:04,797 INFO L290 TraceCheckUtils]: 15: Hoare triple {13246#true} assume true; {13246#true} is VALID
[2022-04-15 08:38:04,797 INFO L290 TraceCheckUtils]: 14: Hoare triple {13246#true} assume !(0 == ~cond); {13246#true} is VALID
[2022-04-15 08:38:04,797 INFO L290 TraceCheckUtils]: 13: Hoare triple {13246#true} ~cond := #in~cond; {13246#true} is VALID
[2022-04-15 08:38:04,797 INFO L272 TraceCheckUtils]: 12: Hoare triple {13246#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 10 then 1 else 0)); {13246#true} is VALID
[2022-04-15 08:38:04,797 INFO L290 TraceCheckUtils]: 11: Hoare triple {13246#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {13246#true} is VALID
[2022-04-15 08:38:04,797 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {13246#true} {13246#true} #66#return; {13246#true} is VALID
[2022-04-15 08:38:04,797 INFO L290 TraceCheckUtils]: 9: Hoare triple {13246#true} assume true; {13246#true} is VALID
[2022-04-15 08:38:04,797 INFO L290 TraceCheckUtils]: 8: Hoare triple {13246#true} assume !(0 == ~cond); {13246#true} is VALID
[2022-04-15 08:38:04,797 INFO L290 TraceCheckUtils]: 7: Hoare triple {13246#true} ~cond := #in~cond; {13246#true} is VALID
[2022-04-15 08:38:04,797 INFO L272 TraceCheckUtils]: 6: Hoare triple {13246#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 10 then 1 else 0)); {13246#true} is VALID
[2022-04-15 08:38:04,797 INFO L290 TraceCheckUtils]: 5: Hoare triple {13246#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; {13246#true} is VALID
[2022-04-15 08:38:04,797 INFO L272 TraceCheckUtils]: 4: Hoare triple {13246#true} call #t~ret6 := main(); {13246#true} is VALID
[2022-04-15 08:38:04,797 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13246#true} {13246#true} #88#return; {13246#true} is VALID
[2022-04-15 08:38:04,798 INFO L290 TraceCheckUtils]: 2: Hoare triple {13246#true} assume true; {13246#true} is VALID
[2022-04-15 08:38:04,798 INFO L290 TraceCheckUtils]: 1: Hoare triple {13246#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); {13246#true} is VALID
[2022-04-15 08:38:04,798 INFO L272 TraceCheckUtils]: 0: Hoare triple {13246#true} call ULTIMATE.init(); {13246#true} is VALID
[2022-04-15 08:38:04,798 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-15 08:38:04,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-04-15 08:38:04,798 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [501997486]
[2022-04-15 08:38:04,798 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT
[2022-04-15 08:38:04,798 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [803275727]
[2022-04-15 08:38:04,798 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [803275727] provided 0 perfect and 2 imperfect interpolant sequences
[2022-04-15 08:38:04,798 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences.
[2022-04-15 08:38:04,799 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 9] total 19
[2022-04-15 08:38:04,799 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace
[2022-04-15 08:38:04,799 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [336591803]
[2022-04-15 08:38:04,799 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [336591803] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-15 08:38:04,799 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-15 08:38:04,799 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15
[2022-04-15 08:38:04,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [812245075]
[2022-04-15 08:38:04,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-04-15 08:38:04,799 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 2.142857142857143) internal successors, (30), 12 states have internal predecessors, (30), 7 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (15), 8 states have call predecessors, (15), 7 states have call successors, (15) Word has length 92
[2022-04-15 08:38:04,800 INFO L84 Accepts]: Finished accepts. word is accepted.
[2022-04-15 08:38:04,800 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 15 states, 14 states have (on average 2.142857142857143) internal successors, (30), 12 states have internal predecessors, (30), 7 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (15), 8 states have call predecessors, (15), 7 states have call successors, (15)
[2022-04-15 08:38:04,866 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-15 08:38:04,866 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 15 states
[2022-04-15 08:38:04,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION
[2022-04-15 08:38:04,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants.
[2022-04-15 08:38:04,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=285, Unknown=0, NotChecked=0, Total=342
[2022-04-15 08:38:04,867 INFO L87 Difference]: Start difference. First operand 163 states and 186 transitions. Second operand has 15 states, 14 states have (on average 2.142857142857143) internal successors, (30), 12 states have internal predecessors, (30), 7 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (15), 8 states have call predecessors, (15), 7 states have call successors, (15)
[2022-04-15 08:38:19,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-15 08:38:19,417 INFO L93 Difference]: Finished difference Result 193 states and 224 transitions.
[2022-04-15 08:38:19,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states.
[2022-04-15 08:38:19,417 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 2.142857142857143) internal successors, (30), 12 states have internal predecessors, (30), 7 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (15), 8 states have call predecessors, (15), 7 states have call successors, (15) Word has length 92
[2022-04-15 08:38:19,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-04-15 08:38:19,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 2.142857142857143) internal successors, (30), 12 states have internal predecessors, (30), 7 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (15), 8 states have call predecessors, (15), 7 states have call successors, (15)
[2022-04-15 08:38:19,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 79 transitions.
[2022-04-15 08:38:19,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 2.142857142857143) internal successors, (30), 12 states have internal predecessors, (30), 7 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (15), 8 states have call predecessors, (15), 7 states have call successors, (15)
[2022-04-15 08:38:19,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 79 transitions.
[2022-04-15 08:38:19,420 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 79 transitions.
[2022-04-15 08:38:19,535 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-15 08:38:19,538 INFO L225 Difference]: With dead ends: 193
[2022-04-15 08:38:19,538 INFO L226 Difference]: Without dead ends: 191
[2022-04-15 08:38:19,538 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 165 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=74, Invalid=388, Unknown=0, NotChecked=0, Total=462
[2022-04-15 08:38:19,538 INFO L913 BasicCegarLoop]: 33 mSDtfsCounter, 25 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 502 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 523 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 502 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.3s IncrementalHoareTripleChecker+Time
[2022-04-15 08:38:19,539 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [31 Valid, 189 Invalid, 523 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 502 Invalid, 0 Unknown, 0 Unchecked, 6.3s Time]
[2022-04-15 08:38:19,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states.
[2022-04-15 08:38:19,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 191.
[2022-04-15 08:38:19,763 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2022-04-15 08:38:19,764 INFO L82 GeneralOperation]: Start isEquivalent. First operand 191 states. Second operand has 191 states, 116 states have (on average 1.0948275862068966) internal successors, (127), 121 states have internal predecessors, (127), 48 states have call successors, (48), 27 states have call predecessors, (48), 26 states have return successors, (47), 42 states have call predecessors, (47), 47 states have call successors, (47)
[2022-04-15 08:38:19,764 INFO L74 IsIncluded]: Start isIncluded. First operand 191 states. Second operand has 191 states, 116 states have (on average 1.0948275862068966) internal successors, (127), 121 states have internal predecessors, (127), 48 states have call successors, (48), 27 states have call predecessors, (48), 26 states have return successors, (47), 42 states have call predecessors, (47), 47 states have call successors, (47)
[2022-04-15 08:38:19,764 INFO L87 Difference]: Start difference. First operand 191 states. Second operand has 191 states, 116 states have (on average 1.0948275862068966) internal successors, (127), 121 states have internal predecessors, (127), 48 states have call successors, (48), 27 states have call predecessors, (48), 26 states have return successors, (47), 42 states have call predecessors, (47), 47 states have call successors, (47)
[2022-04-15 08:38:19,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-15 08:38:19,769 INFO L93 Difference]: Finished difference Result 191 states and 222 transitions.
[2022-04-15 08:38:19,769 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 222 transitions.
[2022-04-15 08:38:19,769 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-15 08:38:19,769 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-15 08:38:19,770 INFO L74 IsIncluded]: Start isIncluded. First operand has 191 states, 116 states have (on average 1.0948275862068966) internal successors, (127), 121 states have internal predecessors, (127), 48 states have call successors, (48), 27 states have call predecessors, (48), 26 states have return successors, (47), 42 states have call predecessors, (47), 47 states have call successors, (47) Second operand 191 states.
[2022-04-15 08:38:19,770 INFO L87 Difference]: Start difference. First operand has 191 states, 116 states have (on average 1.0948275862068966) internal successors, (127), 121 states have internal predecessors, (127), 48 states have call successors, (48), 27 states have call predecessors, (48), 26 states have return successors, (47), 42 states have call predecessors, (47), 47 states have call successors, (47) Second operand 191 states.
[2022-04-15 08:38:19,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-15 08:38:19,773 INFO L93 Difference]: Finished difference Result 191 states and 222 transitions.
[2022-04-15 08:38:19,773 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 222 transitions.
[2022-04-15 08:38:19,774 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-15 08:38:19,774 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-15 08:38:19,774 INFO L88 GeneralOperation]: Finished isEquivalent.
[2022-04-15 08:38:19,774 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2022-04-15 08:38:19,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 116 states have (on average 1.0948275862068966) internal successors, (127), 121 states have internal predecessors, (127), 48 states have call successors, (48), 27 states have call predecessors, (48), 26 states have return successors, (47), 42 states have call predecessors, (47), 47 states have call successors, (47)
[2022-04-15 08:38:19,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 222 transitions.
[2022-04-15 08:38:19,777 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 222 transitions. Word has length 92
[2022-04-15 08:38:19,778 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-04-15 08:38:19,778 INFO L478 AbstractCegarLoop]: Abstraction has 191 states and 222 transitions.
[2022-04-15 08:38:19,778 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 2.142857142857143) internal successors, (30), 12 states have internal predecessors, (30), 7 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (15), 8 states have call predecessors, (15), 7 states have call successors, (15)
[2022-04-15 08:38:19,778 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 191 states and 222 transitions.
[2022-04-15 08:38:20,921 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 222 edges. 222 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-15 08:38:20,921 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 222 transitions.
[2022-04-15 08:38:20,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93
[2022-04-15 08:38:20,922 INFO L491 BasicCegarLoop]: Found error trace
[2022-04-15 08:38:20,922 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-15 08:38:20,941 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0
[2022-04-15 08:38:21,122 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-04-15 08:38:21,125 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-04-15 08:38:21,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-04-15 08:38:21,125 INFO L85 PathProgramCache]: Analyzing trace with hash 65583604, now seen corresponding path program 9 times
[2022-04-15 08:38:21,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION
[2022-04-15 08:38:21,125 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1717118469]
[2022-04-15 08:38:21,126 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation
[2022-04-15 08:38:21,126 INFO L85 PathProgramCache]: Analyzing trace with hash 65583604, now seen corresponding path program 10 times
[2022-04-15 08:38:21,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-04-15 08:38:21,126 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [347320835]
[2022-04-15 08:38:21,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-15 08:38:21,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-15 08:38:21,136 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic
[2022-04-15 08:38:21,136 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [225012150]
[2022-04-15 08:38:21,136 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST
[2022-04-15 08:38:21,136 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-04-15 08:38:21,136 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-04-15 08:38:21,137 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2022-04-15 08:38:21,138 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process
[2022-04-15 08:38:21,188 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s)
[2022-04-15 08:38:21,188 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat
[2022-04-15 08:38:21,189 INFO L263 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 46 conjunts are in the unsatisfiable core
[2022-04-15 08:38:21,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-15 08:38:21,207 INFO L286 TraceCheckSpWp]: Computing forward predicates...
[2022-04-15 08:43:10,936 INFO L272 TraceCheckUtils]: 0: Hoare triple {14972#true} call ULTIMATE.init(); {14972#true} is VALID
[2022-04-15 08:43:10,937 INFO L290 TraceCheckUtils]: 1: Hoare triple {14972#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); {14972#true} is VALID
[2022-04-15 08:43:10,937 INFO L290 TraceCheckUtils]: 2: Hoare triple {14972#true} assume true; {14972#true} is VALID
[2022-04-15 08:43:10,937 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14972#true} {14972#true} #88#return; {14972#true} is VALID
[2022-04-15 08:43:10,937 INFO L272 TraceCheckUtils]: 4: Hoare triple {14972#true} call #t~ret6 := main(); {14972#true} is VALID
[2022-04-15 08:43:10,937 INFO L290 TraceCheckUtils]: 5: Hoare triple {14972#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; {14972#true} is VALID
[2022-04-15 08:43:10,937 INFO L272 TraceCheckUtils]: 6: Hoare triple {14972#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 10 then 1 else 0)); {14972#true} is VALID
[2022-04-15 08:43:10,937 INFO L290 TraceCheckUtils]: 7: Hoare triple {14972#true} ~cond := #in~cond; {14972#true} is VALID
[2022-04-15 08:43:10,937 INFO L290 TraceCheckUtils]: 8: Hoare triple {14972#true} assume !(0 == ~cond); {14972#true} is VALID
[2022-04-15 08:43:10,937 INFO L290 TraceCheckUtils]: 9: Hoare triple {14972#true} assume true; {14972#true} is VALID
[2022-04-15 08:43:10,937 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {14972#true} {14972#true} #66#return; {14972#true} is VALID
[2022-04-15 08:43:10,937 INFO L290 TraceCheckUtils]: 11: Hoare triple {14972#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {14972#true} is VALID
[2022-04-15 08:43:10,937 INFO L272 TraceCheckUtils]: 12: Hoare triple {14972#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 10 then 1 else 0)); {14972#true} is VALID
[2022-04-15 08:43:10,937 INFO L290 TraceCheckUtils]: 13: Hoare triple {14972#true} ~cond := #in~cond; {14972#true} is VALID
[2022-04-15 08:43:10,937 INFO L290 TraceCheckUtils]: 14: Hoare triple {14972#true} assume !(0 == ~cond); {14972#true} is VALID
[2022-04-15 08:43:10,938 INFO L290 TraceCheckUtils]: 15: Hoare triple {14972#true} assume true; {14972#true} is VALID
[2022-04-15 08:43:10,938 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {14972#true} {14972#true} #68#return; {14972#true} is VALID
[2022-04-15 08:43:10,938 INFO L272 TraceCheckUtils]: 17: Hoare triple {14972#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {14972#true} is VALID
[2022-04-15 08:43:10,938 INFO L290 TraceCheckUtils]: 18: Hoare triple {14972#true} ~cond := #in~cond; {14972#true} is VALID
[2022-04-15 08:43:10,938 INFO L290 TraceCheckUtils]: 19: Hoare triple {14972#true} assume !(0 == ~cond); {14972#true} is VALID
[2022-04-15 08:43:10,938 INFO L290 TraceCheckUtils]: 20: Hoare triple {14972#true} assume true; {14972#true} is VALID
[2022-04-15 08:43:10,938 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {14972#true} {14972#true} #70#return; {14972#true} is VALID
[2022-04-15 08:43:10,938 INFO L272 TraceCheckUtils]: 22: Hoare triple {14972#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {14972#true} is VALID
[2022-04-15 08:43:10,938 INFO L290 TraceCheckUtils]: 23: Hoare triple {14972#true} ~cond := #in~cond; {14972#true} is VALID
[2022-04-15 08:43:10,938 INFO L290 TraceCheckUtils]: 24: Hoare triple {14972#true} assume !(0 == ~cond); {14972#true} is VALID
[2022-04-15 08:43:10,938 INFO L290 TraceCheckUtils]: 25: Hoare triple {14972#true} assume true; {14972#true} is VALID
[2022-04-15 08:43:10,938 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {14972#true} {14972#true} #72#return; {14972#true} is VALID
[2022-04-15 08:43:10,939 INFO L290 TraceCheckUtils]: 27: Hoare triple {14972#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {15058#(and (= 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-15 08:43:10,939 INFO L290 TraceCheckUtils]: 28: Hoare triple {15058#(and (= 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; {15058#(and (= 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-15 08:43:10,939 INFO L272 TraceCheckUtils]: 29: Hoare triple {15058#(and (= 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)); {14972#true} is VALID
[2022-04-15 08:43:10,939 INFO L290 TraceCheckUtils]: 30: Hoare triple {14972#true} ~cond := #in~cond; {14972#true} is VALID
[2022-04-15 08:43:10,939 INFO L290 TraceCheckUtils]: 31: Hoare triple {14972#true} assume !(0 == ~cond); {14972#true} is VALID
[2022-04-15 08:43:10,939 INFO L290 TraceCheckUtils]: 32: Hoare triple {14972#true} assume true; {14972#true} is VALID
[2022-04-15 08:43:10,940 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {14972#true} {15058#(and (= 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; {15058#(and (= 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-15 08:43:10,940 INFO L272 TraceCheckUtils]: 34: Hoare triple {15058#(and (= 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)); {14972#true} is VALID
[2022-04-15 08:43:10,940 INFO L290 TraceCheckUtils]: 35: Hoare triple {14972#true} ~cond := #in~cond; {15083#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID
[2022-04-15 08:43:10,941 INFO L290 TraceCheckUtils]: 36: Hoare triple {15083#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {15087#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID
[2022-04-15 08:43:10,941 INFO L290 TraceCheckUtils]: 37: Hoare triple {15087#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {15087#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID
[2022-04-15 08:43:10,942 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {15087#(not (= |__VERIFIER_assert_#in~cond| 0))} {15058#(and (= 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; {15058#(and (= 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-15 08:43:10,942 INFO L272 TraceCheckUtils]: 39: Hoare triple {15058#(and (= 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)); {14972#true} is VALID
[2022-04-15 08:43:10,942 INFO L290 TraceCheckUtils]: 40: Hoare triple {14972#true} ~cond := #in~cond; {14972#true} is VALID
[2022-04-15 08:43:10,942 INFO L290 TraceCheckUtils]: 41: Hoare triple {14972#true} assume !(0 == ~cond); {14972#true} is VALID
[2022-04-15 08:43:10,942 INFO L290 TraceCheckUtils]: 42: Hoare triple {14972#true} assume true; {14972#true} is VALID
[2022-04-15 08:43:10,943 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {14972#true} {15058#(and (= 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; {15058#(and (= 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-15 08:43:10,943 INFO L290 TraceCheckUtils]: 44: Hoare triple {15058#(and (= 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); {15058#(and (= 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-15 08:43:10,943 INFO L290 TraceCheckUtils]: 45: Hoare triple {15058#(and (= 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);~b~0 := ~b~0 - ~a~0;~q~0 := ~q~0 - ~p~0;~s~0 := ~s~0 - ~r~0; {15115#(and (= main_~r~0 0) (= main_~y~0 (+ main_~b~0 main_~a~0)) (= main_~a~0 main_~x~0) (= (+ main_~q~0 main_~p~0) 0) (= main_~p~0 1))} is VALID
[2022-04-15 08:43:10,944 INFO L290 TraceCheckUtils]: 46: Hoare triple {15115#(and (= main_~r~0 0) (= main_~y~0 (+ main_~b~0 main_~a~0)) (= main_~a~0 main_~x~0) (= (+ main_~q~0 main_~p~0) 0) (= main_~p~0 1))} assume !false; {15115#(and (= main_~r~0 0) (= main_~y~0 (+ main_~b~0 main_~a~0)) (= main_~a~0 main_~x~0) (= (+ main_~q~0 main_~p~0) 0) (= main_~p~0 1))} is VALID
[2022-04-15 08:43:10,944 INFO L272 TraceCheckUtils]: 47: Hoare triple {15115#(and (= main_~r~0 0) (= main_~y~0 (+ main_~b~0 main_~a~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)); {14972#true} is VALID
[2022-04-15 08:43:10,944 INFO L290 TraceCheckUtils]: 48: Hoare triple {14972#true} ~cond := #in~cond; {14972#true} is VALID
[2022-04-15 08:43:10,944 INFO L290 TraceCheckUtils]: 49: Hoare triple {14972#true} assume !(0 == ~cond); {14972#true} is VALID
[2022-04-15 08:43:10,944 INFO L290 TraceCheckUtils]: 50: Hoare triple {14972#true} assume true; {14972#true} is VALID
[2022-04-15 08:43:10,945 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {14972#true} {15115#(and (= main_~r~0 0) (= main_~y~0 (+ main_~b~0 main_~a~0)) (= main_~a~0 main_~x~0) (= (+ main_~q~0 main_~p~0) 0) (= main_~p~0 1))} #74#return; {15115#(and (= main_~r~0 0) (= main_~y~0 (+ main_~b~0 main_~a~0)) (= main_~a~0 main_~x~0) (= (+ main_~q~0 main_~p~0) 0) (= main_~p~0 1))} is VALID
[2022-04-15 08:43:10,945 INFO L272 TraceCheckUtils]: 52: Hoare triple {15115#(and (= main_~r~0 0) (= main_~y~0 (+ main_~b~0 main_~a~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)); {14972#true} is VALID
[2022-04-15 08:43:10,945 INFO L290 TraceCheckUtils]: 53: Hoare triple {14972#true} ~cond := #in~cond; {14972#true} is VALID
[2022-04-15 08:43:10,945 INFO L290 TraceCheckUtils]: 54: Hoare triple {14972#true} assume !(0 == ~cond); {14972#true} is VALID
[2022-04-15 08:43:10,945 INFO L290 TraceCheckUtils]: 55: Hoare triple {14972#true} assume true; {14972#true} is VALID
[2022-04-15 08:43:10,946 INFO L284 TraceCheckUtils]: 56: Hoare quadruple {14972#true} {15115#(and (= main_~r~0 0) (= main_~y~0 (+ main_~b~0 main_~a~0)) (= main_~a~0 main_~x~0) (= (+ main_~q~0 main_~p~0) 0) (= main_~p~0 1))} #76#return; {15115#(and (= main_~r~0 0) (= main_~y~0 (+ main_~b~0 main_~a~0)) (= main_~a~0 main_~x~0) (= (+ main_~q~0 main_~p~0) 0) (= main_~p~0 1))} is VALID
[2022-04-15 08:43:10,946 INFO L272 TraceCheckUtils]: 57: Hoare triple {15115#(and (= main_~r~0 0) (= main_~y~0 (+ main_~b~0 main_~a~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)); {14972#true} is VALID
[2022-04-15 08:43:10,946 INFO L290 TraceCheckUtils]: 58: Hoare triple {14972#true} ~cond := #in~cond; {14972#true} is VALID
[2022-04-15 08:43:10,946 INFO L290 TraceCheckUtils]: 59: Hoare triple {14972#true} assume !(0 == ~cond); {14972#true} is VALID
[2022-04-15 08:43:10,946 INFO L290 TraceCheckUtils]: 60: Hoare triple {14972#true} assume true; {14972#true} is VALID
[2022-04-15 08:43:10,947 INFO L284 TraceCheckUtils]: 61: Hoare quadruple {14972#true} {15115#(and (= main_~r~0 0) (= main_~y~0 (+ main_~b~0 main_~a~0)) (= main_~a~0 main_~x~0) (= (+ main_~q~0 main_~p~0) 0) (= main_~p~0 1))} #78#return; {15115#(and (= main_~r~0 0) (= main_~y~0 (+ main_~b~0 main_~a~0)) (= main_~a~0 main_~x~0) (= (+ main_~q~0 main_~p~0) 0) (= main_~p~0 1))} is VALID
[2022-04-15 08:43:10,947 INFO L290 TraceCheckUtils]: 62: Hoare triple {15115#(and (= main_~r~0 0) (= main_~y~0 (+ main_~b~0 main_~a~0)) (= main_~a~0 main_~x~0) (= (+ main_~q~0 main_~p~0) 0) (= main_~p~0 1))} assume !!(~a~0 != ~b~0); {15115#(and (= main_~r~0 0) (= main_~y~0 (+ main_~b~0 main_~a~0)) (= main_~a~0 main_~x~0) (= (+ main_~q~0 main_~p~0) 0) (= main_~p~0 1))} is VALID
[2022-04-15 08:43:10,947 INFO L290 TraceCheckUtils]: 63: Hoare triple {15115#(and (= main_~r~0 0) (= main_~y~0 (+ main_~b~0 main_~a~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; {15170#(and (= main_~y~0 (+ main_~b~0 main_~x~0)) (= (+ main_~q~0 main_~p~0) 1) (= (+ main_~x~0 (* (- 1) main_~b~0)) main_~a~0) (= main_~r~0 (* (- 1) main_~s~0)) (= (+ main_~p~0 (* main_~q~0 2)) 0))} is VALID
[2022-04-15 08:43:10,948 INFO L290 TraceCheckUtils]: 64: Hoare triple {15170#(and (= main_~y~0 (+ main_~b~0 main_~x~0)) (= (+ main_~q~0 main_~p~0) 1) (= (+ main_~x~0 (* (- 1) main_~b~0)) main_~a~0) (= main_~r~0 (* (- 1) main_~s~0)) (= (+ main_~p~0 (* main_~q~0 2)) 0))} assume !false; {15170#(and (= main_~y~0 (+ main_~b~0 main_~x~0)) (= (+ main_~q~0 main_~p~0) 1) (= (+ main_~x~0 (* (- 1) main_~b~0)) main_~a~0) (= main_~r~0 (* (- 1) main_~s~0)) (= (+ main_~p~0 (* main_~q~0 2)) 0))} is VALID
[2022-04-15 08:43:10,948 INFO L272 TraceCheckUtils]: 65: Hoare triple {15170#(and (= main_~y~0 (+ main_~b~0 main_~x~0)) (= (+ main_~q~0 main_~p~0) 1) (= (+ main_~x~0 (* (- 1) main_~b~0)) main_~a~0) (= main_~r~0 (* (- 1) main_~s~0)) (= (+ main_~p~0 (* main_~q~0 2)) 0))} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {14972#true} is VALID
[2022-04-15 08:43:10,948 INFO L290 TraceCheckUtils]: 66: Hoare triple {14972#true} ~cond := #in~cond; {14972#true} is VALID
[2022-04-15 08:43:10,948 INFO L290 TraceCheckUtils]: 67: Hoare triple {14972#true} assume !(0 == ~cond); {14972#true} is VALID
[2022-04-15 08:43:10,948 INFO L290 TraceCheckUtils]: 68: Hoare triple {14972#true} assume true; {14972#true} is VALID
[2022-04-15 08:43:10,949 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {14972#true} {15170#(and (= main_~y~0 (+ main_~b~0 main_~x~0)) (= (+ main_~q~0 main_~p~0) 1) (= (+ main_~x~0 (* (- 1) main_~b~0)) main_~a~0) (= main_~r~0 (* (- 1) main_~s~0)) (= (+ main_~p~0 (* main_~q~0 2)) 0))} #74#return; {15170#(and (= main_~y~0 (+ main_~b~0 main_~x~0)) (= (+ main_~q~0 main_~p~0) 1) (= (+ main_~x~0 (* (- 1) main_~b~0)) main_~a~0) (= main_~r~0 (* (- 1) main_~s~0)) (= (+ main_~p~0 (* main_~q~0 2)) 0))} is VALID
[2022-04-15 08:43:10,949 INFO L272 TraceCheckUtils]: 70: Hoare triple {15170#(and (= main_~y~0 (+ main_~b~0 main_~x~0)) (= (+ main_~q~0 main_~p~0) 1) (= (+ main_~x~0 (* (- 1) main_~b~0)) main_~a~0) (= main_~r~0 (* (- 1) main_~s~0)) (= (+ main_~p~0 (* main_~q~0 2)) 0))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {14972#true} is VALID
[2022-04-15 08:43:10,949 INFO L290 TraceCheckUtils]: 71: Hoare triple {14972#true} ~cond := #in~cond; {15083#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID
[2022-04-15 08:43:10,949 INFO L290 TraceCheckUtils]: 72: Hoare triple {15083#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {15087#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID
[2022-04-15 08:43:10,950 INFO L290 TraceCheckUtils]: 73: Hoare triple {15087#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {15087#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID
[2022-04-15 08:43:10,951 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {15087#(not (= |__VERIFIER_assert_#in~cond| 0))} {15170#(and (= main_~y~0 (+ main_~b~0 main_~x~0)) (= (+ main_~q~0 main_~p~0) 1) (= (+ main_~x~0 (* (- 1) main_~b~0)) main_~a~0) (= main_~r~0 (* (- 1) main_~s~0)) (= (+ main_~p~0 (* main_~q~0 2)) 0))} #76#return; {15204#(and (= main_~y~0 (+ main_~b~0 main_~x~0)) (= (+ main_~q~0 main_~p~0) 1) (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (= (+ main_~x~0 (* (- 1) main_~b~0)) main_~a~0) (= main_~r~0 (* (- 1) main_~s~0)) (= (+ main_~p~0 (* main_~q~0 2)) 0))} is VALID
[2022-04-15 08:43:10,951 INFO L272 TraceCheckUtils]: 75: Hoare triple {15204#(and (= main_~y~0 (+ main_~b~0 main_~x~0)) (= (+ main_~q~0 main_~p~0) 1) (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (= (+ main_~x~0 (* (- 1) main_~b~0)) main_~a~0) (= main_~r~0 (* (- 1) main_~s~0)) (= (+ main_~p~0 (* main_~q~0 2)) 0))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {14972#true} is VALID
[2022-04-15 08:43:10,951 INFO L290 TraceCheckUtils]: 76: Hoare triple {14972#true} ~cond := #in~cond; {15083#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID
[2022-04-15 08:43:10,951 INFO L290 TraceCheckUtils]: 77: Hoare triple {15083#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {15087#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID
[2022-04-15 08:43:10,952 INFO L290 TraceCheckUtils]: 78: Hoare triple {15087#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {15087#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID
[2022-04-15 08:43:10,952 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {15087#(not (= |__VERIFIER_assert_#in~cond| 0))} {15204#(and (= main_~y~0 (+ main_~b~0 main_~x~0)) (= (+ main_~q~0 main_~p~0) 1) (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (= (+ main_~x~0 (* (- 1) main_~b~0)) main_~a~0) (= main_~r~0 (* (- 1) main_~s~0)) (= (+ main_~p~0 (* main_~q~0 2)) 0))} #78#return; {15204#(and (= main_~y~0 (+ main_~b~0 main_~x~0)) (= (+ main_~q~0 main_~p~0) 1) (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (= (+ main_~x~0 (* (- 1) main_~b~0)) main_~a~0) (= main_~r~0 (* (- 1) main_~s~0)) (= (+ main_~p~0 (* main_~q~0 2)) 0))} is VALID
[2022-04-15 08:43:10,953 INFO L290 TraceCheckUtils]: 80: Hoare triple {15204#(and (= main_~y~0 (+ main_~b~0 main_~x~0)) (= (+ main_~q~0 main_~p~0) 1) (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (= (+ main_~x~0 (* (- 1) main_~b~0)) main_~a~0) (= main_~r~0 (* (- 1) main_~s~0)) (= (+ main_~p~0 (* main_~q~0 2)) 0))} assume !!(~a~0 != ~b~0); {15204#(and (= main_~y~0 (+ main_~b~0 main_~x~0)) (= (+ main_~q~0 main_~p~0) 1) (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (= (+ main_~x~0 (* (- 1) main_~b~0)) main_~a~0) (= main_~r~0 (* (- 1) main_~s~0)) (= (+ main_~p~0 (* main_~q~0 2)) 0))} is VALID
[2022-04-15 08:43:10,962 INFO L290 TraceCheckUtils]: 81: Hoare triple {15204#(and (= main_~y~0 (+ main_~b~0 main_~x~0)) (= (+ main_~q~0 main_~p~0) 1) (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (= (+ main_~x~0 (* (- 1) main_~b~0)) main_~a~0) (= main_~r~0 (* (- 1) main_~s~0)) (= (+ main_~p~0 (* main_~q~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; {15226#(and (= (mod (* main_~p~0 2) 3) 0) (= main_~a~0 (+ (* main_~x~0 (+ (div (- main_~p~0) 3) main_~p~0)) main_~x~0 (* (+ (div (- main_~r~0) 2) main_~r~0) main_~y~0) (* (- 1) main_~y~0))) (= (mod main_~r~0 2) 0) (= (+ (* (div (- main_~p~0) 3) 2) main_~p~0) 1) (= (+ (* main_~x~0 (+ (div (- main_~p~0) 3) main_~p~0)) (* (+ (div (- main_~r~0) 2) main_~r~0) main_~y~0)) (+ (* main_~x~0 2) (* (- 1) main_~y~0))))} is VALID
[2022-04-15 08:43:10,962 INFO L290 TraceCheckUtils]: 82: Hoare triple {15226#(and (= (mod (* main_~p~0 2) 3) 0) (= main_~a~0 (+ (* main_~x~0 (+ (div (- main_~p~0) 3) main_~p~0)) main_~x~0 (* (+ (div (- main_~r~0) 2) main_~r~0) main_~y~0) (* (- 1) main_~y~0))) (= (mod main_~r~0 2) 0) (= (+ (* (div (- main_~p~0) 3) 2) main_~p~0) 1) (= (+ (* main_~x~0 (+ (div (- main_~p~0) 3) main_~p~0)) (* (+ (div (- main_~r~0) 2) main_~r~0) main_~y~0)) (+ (* main_~x~0 2) (* (- 1) main_~y~0))))} assume !false; {15226#(and (= (mod (* main_~p~0 2) 3) 0) (= main_~a~0 (+ (* main_~x~0 (+ (div (- main_~p~0) 3) main_~p~0)) main_~x~0 (* (+ (div (- main_~r~0) 2) main_~r~0) main_~y~0) (* (- 1) main_~y~0))) (= (mod main_~r~0 2) 0) (= (+ (* (div (- main_~p~0) 3) 2) main_~p~0) 1) (= (+ (* main_~x~0 (+ (div (- main_~p~0) 3) main_~p~0)) (* (+ (div (- main_~r~0) 2) main_~r~0) main_~y~0)) (+ (* main_~x~0 2) (* (- 1) main_~y~0))))} is VALID
[2022-04-15 08:43:10,962 INFO L272 TraceCheckUtils]: 83: Hoare triple {15226#(and (= (mod (* main_~p~0 2) 3) 0) (= main_~a~0 (+ (* main_~x~0 (+ (div (- main_~p~0) 3) main_~p~0)) main_~x~0 (* (+ (div (- main_~r~0) 2) main_~r~0) main_~y~0) (* (- 1) main_~y~0))) (= (mod main_~r~0 2) 0) (= (+ (* (div (- main_~p~0) 3) 2) main_~p~0) 1) (= (+ (* main_~x~0 (+ (div (- main_~p~0) 3) main_~p~0)) (* (+ (div (- main_~r~0) 2) main_~r~0) main_~y~0)) (+ (* main_~x~0 2) (* (- 1) main_~y~0))))} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {14972#true} is VALID
[2022-04-15 08:43:10,962 INFO L290 TraceCheckUtils]: 84: Hoare triple {14972#true} ~cond := #in~cond; {14972#true} is VALID
[2022-04-15 08:43:10,963 INFO L290 TraceCheckUtils]: 85: Hoare triple {14972#true} assume !(0 == ~cond); {14972#true} is VALID
[2022-04-15 08:43:10,963 INFO L290 TraceCheckUtils]: 86: Hoare triple {14972#true} assume true; {14972#true} is VALID
[2022-04-15 08:43:10,963 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {14972#true} {15226#(and (= (mod (* main_~p~0 2) 3) 0) (= main_~a~0 (+ (* main_~x~0 (+ (div (- main_~p~0) 3) main_~p~0)) main_~x~0 (* (+ (div (- main_~r~0) 2) main_~r~0) main_~y~0) (* (- 1) main_~y~0))) (= (mod main_~r~0 2) 0) (= (+ (* (div (- main_~p~0) 3) 2) main_~p~0) 1) (= (+ (* main_~x~0 (+ (div (- main_~p~0) 3) main_~p~0)) (* (+ (div (- main_~r~0) 2) main_~r~0) main_~y~0)) (+ (* main_~x~0 2) (* (- 1) main_~y~0))))} #74#return; {15226#(and (= (mod (* main_~p~0 2) 3) 0) (= main_~a~0 (+ (* main_~x~0 (+ (div (- main_~p~0) 3) main_~p~0)) main_~x~0 (* (+ (div (- main_~r~0) 2) main_~r~0) main_~y~0) (* (- 1) main_~y~0))) (= (mod main_~r~0 2) 0) (= (+ (* (div (- main_~p~0) 3) 2) main_~p~0) 1) (= (+ (* main_~x~0 (+ (div (- main_~p~0) 3) main_~p~0)) (* (+ (div (- main_~r~0) 2) main_~r~0) main_~y~0)) (+ (* main_~x~0 2) (* (- 1) main_~y~0))))} is VALID
[2022-04-15 08:43:11,603 INFO L272 TraceCheckUtils]: 88: Hoare triple {15226#(and (= (mod (* main_~p~0 2) 3) 0) (= main_~a~0 (+ (* main_~x~0 (+ (div (- main_~p~0) 3) main_~p~0)) main_~x~0 (* (+ (div (- main_~r~0) 2) main_~r~0) main_~y~0) (* (- 1) main_~y~0))) (= (mod main_~r~0 2) 0) (= (+ (* (div (- main_~p~0) 3) 2) main_~p~0) 1) (= (+ (* main_~x~0 (+ (div (- main_~p~0) 3) main_~p~0)) (* (+ (div (- main_~r~0) 2) main_~r~0) main_~y~0)) (+ (* main_~x~0 2) (* (- 1) main_~y~0))))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {15248#(exists ((aux_div_aux_mod_v_main_~r~0_BEFORE_CALL_111_45_46 Int) (aux_div_v_main_~r~0_BEFORE_CALL_111_45 Int) (v_main_~x~0_BEFORE_CALL_128 Int) (aux_div_v_main_~p~0_BEFORE_CALL_114_45 Int) (v_main_~y~0_BEFORE_CALL_127 Int) (aux_div_aux_mod_aux_mod_v_main_~p~0_BEFORE_CALL_114_45_95_57 Int)) (and (< 0 (+ (* 6 aux_div_aux_mod_aux_mod_v_main_~p~0_BEFORE_CALL_114_45_95_57) (* aux_div_v_main_~p~0_BEFORE_CALL_114_45 3) 6)) (<= (+ (* 6 aux_div_aux_mod_aux_mod_v_main_~p~0_BEFORE_CALL_114_45_95_57) (* aux_div_v_main_~p~0_BEFORE_CALL_114_45 3) 3) 0) (< (* 2 aux_div_aux_mod_v_main_~r~0_BEFORE_CALL_111_45_46) 2) (<= 0 (* 3 aux_div_aux_mod_aux_mod_v_main_~p~0_BEFORE_CALL_114_45_95_57)) (<= 1 |__VERIFIER_assert_#in~cond|) (< (* 3 aux_div_aux_mod_aux_mod_v_main_~p~0_BEFORE_CALL_114_45_95_57) 3) (<= 0 (* 2 aux_div_aux_mod_v_main_~r~0_BEFORE_CALL_111_45_46)) (= (+ v_main_~y~0_BEFORE_CALL_127 (* aux_div_v_main_~p~0_BEFORE_CALL_114_45 v_main_~x~0_BEFORE_CALL_128) (* 6 (* v_main_~x~0_BEFORE_CALL_128 aux_div_aux_mod_aux_mod_v_main_~p~0_BEFORE_CALL_114_45_95_57)) v_main_~x~0_BEFORE_CALL_128) (+ (* v_main_~y~0_BEFORE_CALL_127 aux_div_v_main_~r~0_BEFORE_CALL_111_45) (* (* v_main_~y~0_BEFORE_CALL_127 aux_div_aux_mod_v_main_~r~0_BEFORE_CALL_111_45_46) 2)))))} is VALID
[2022-04-15 08:43:11,604 INFO L290 TraceCheckUtils]: 89: Hoare triple {15248#(exists ((aux_div_aux_mod_v_main_~r~0_BEFORE_CALL_111_45_46 Int) (aux_div_v_main_~r~0_BEFORE_CALL_111_45 Int) (v_main_~x~0_BEFORE_CALL_128 Int) (aux_div_v_main_~p~0_BEFORE_CALL_114_45 Int) (v_main_~y~0_BEFORE_CALL_127 Int) (aux_div_aux_mod_aux_mod_v_main_~p~0_BEFORE_CALL_114_45_95_57 Int)) (and (< 0 (+ (* 6 aux_div_aux_mod_aux_mod_v_main_~p~0_BEFORE_CALL_114_45_95_57) (* aux_div_v_main_~p~0_BEFORE_CALL_114_45 3) 6)) (<= (+ (* 6 aux_div_aux_mod_aux_mod_v_main_~p~0_BEFORE_CALL_114_45_95_57) (* aux_div_v_main_~p~0_BEFORE_CALL_114_45 3) 3) 0) (< (* 2 aux_div_aux_mod_v_main_~r~0_BEFORE_CALL_111_45_46) 2) (<= 0 (* 3 aux_div_aux_mod_aux_mod_v_main_~p~0_BEFORE_CALL_114_45_95_57)) (<= 1 |__VERIFIER_assert_#in~cond|) (< (* 3 aux_div_aux_mod_aux_mod_v_main_~p~0_BEFORE_CALL_114_45_95_57) 3) (<= 0 (* 2 aux_div_aux_mod_v_main_~r~0_BEFORE_CALL_111_45_46)) (= (+ v_main_~y~0_BEFORE_CALL_127 (* aux_div_v_main_~p~0_BEFORE_CALL_114_45 v_main_~x~0_BEFORE_CALL_128) (* 6 (* v_main_~x~0_BEFORE_CALL_128 aux_div_aux_mod_aux_mod_v_main_~p~0_BEFORE_CALL_114_45_95_57)) v_main_~x~0_BEFORE_CALL_128) (+ (* v_main_~y~0_BEFORE_CALL_127 aux_div_v_main_~r~0_BEFORE_CALL_111_45) (* (* v_main_~y~0_BEFORE_CALL_127 aux_div_aux_mod_v_main_~r~0_BEFORE_CALL_111_45_46) 2)))))} ~cond := #in~cond; {15252#(<= 1 __VERIFIER_assert_~cond)} is VALID
[2022-04-15 08:43:11,605 INFO L290 TraceCheckUtils]: 90: Hoare triple {15252#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {14973#false} is VALID
[2022-04-15 08:43:11,605 INFO L290 TraceCheckUtils]: 91: Hoare triple {14973#false} assume !false; {14973#false} is VALID
[2022-04-15 08:43:11,605 INFO L134 CoverageAnalysis]: Checked inductivity of 251 backedges. 56 proven. 54 refuted. 0 times theorem prover too weak. 141 trivial. 0 not checked.
[2022-04-15 08:43:11,605 INFO L328 TraceCheckSpWp]: Computing backward predicates...
[2022-04-15 08:43:52,036 INFO L290 TraceCheckUtils]: 91: Hoare triple {14973#false} assume !false; {14973#false} is VALID
[2022-04-15 08:43:52,037 INFO L290 TraceCheckUtils]: 90: Hoare triple {15252#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {14973#false} is VALID
[2022-04-15 08:43:52,037 INFO L290 TraceCheckUtils]: 89: Hoare triple {15265#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {15252#(<= 1 __VERIFIER_assert_~cond)} is VALID
[2022-04-15 08:43:52,038 INFO L272 TraceCheckUtils]: 88: Hoare triple {15269#(= 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)); {15265#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID
[2022-04-15 08:43:52,038 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {14972#true} {15269#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} #74#return; {15269#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID
[2022-04-15 08:43:52,038 INFO L290 TraceCheckUtils]: 86: Hoare triple {14972#true} assume true; {14972#true} is VALID
[2022-04-15 08:43:52,038 INFO L290 TraceCheckUtils]: 85: Hoare triple {14972#true} assume !(0 == ~cond); {14972#true} is VALID
[2022-04-15 08:43:52,039 INFO L290 TraceCheckUtils]: 84: Hoare triple {14972#true} ~cond := #in~cond; {14972#true} is VALID
[2022-04-15 08:43:52,039 INFO L272 TraceCheckUtils]: 83: Hoare triple {15269#(= 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)); {14972#true} is VALID
[2022-04-15 08:43:52,039 INFO L290 TraceCheckUtils]: 82: Hoare triple {15269#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} assume !false; {15269#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID
[2022-04-15 08:43:52,269 INFO L290 TraceCheckUtils]: 81: Hoare triple {15291#(= (+ 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; {15269#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID
[2022-04-15 08:43:52,270 INFO L290 TraceCheckUtils]: 80: Hoare triple {15291#(= (+ 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); {15291#(= (+ 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-15 08:43:52,271 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {15087#(not (= |__VERIFIER_assert_#in~cond| 0))} {15298#(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_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} #78#return; {15291#(= (+ 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-15 08:43:52,271 INFO L290 TraceCheckUtils]: 78: Hoare triple {15087#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {15087#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID
[2022-04-15 08:43:52,271 INFO L290 TraceCheckUtils]: 77: Hoare triple {15308#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {15087#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID
[2022-04-15 08:43:52,271 INFO L290 TraceCheckUtils]: 76: Hoare triple {14972#true} ~cond := #in~cond; {15308#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID
[2022-04-15 08:43:52,272 INFO L272 TraceCheckUtils]: 75: Hoare triple {15298#(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_~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)); {14972#true} is VALID
[2022-04-15 08:43:52,273 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {15087#(not (= |__VERIFIER_assert_#in~cond| 0))} {14972#true} #76#return; {15298#(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_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} is VALID
[2022-04-15 08:43:52,273 INFO L290 TraceCheckUtils]: 73: Hoare triple {15087#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {15087#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID
[2022-04-15 08:43:52,273 INFO L290 TraceCheckUtils]: 72: Hoare triple {15308#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {15087#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID
[2022-04-15 08:43:52,274 INFO L290 TraceCheckUtils]: 71: Hoare triple {14972#true} ~cond := #in~cond; {15308#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID
[2022-04-15 08:43:52,274 INFO L272 TraceCheckUtils]: 70: Hoare triple {14972#true} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {14972#true} is VALID
[2022-04-15 08:43:52,274 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {14972#true} {14972#true} #74#return; {14972#true} is VALID
[2022-04-15 08:43:52,274 INFO L290 TraceCheckUtils]: 68: Hoare triple {14972#true} assume true; {14972#true} is VALID
[2022-04-15 08:43:52,274 INFO L290 TraceCheckUtils]: 67: Hoare triple {14972#true} assume !(0 == ~cond); {14972#true} is VALID
[2022-04-15 08:43:52,274 INFO L290 TraceCheckUtils]: 66: Hoare triple {14972#true} ~cond := #in~cond; {14972#true} is VALID
[2022-04-15 08:43:52,274 INFO L272 TraceCheckUtils]: 65: Hoare triple {14972#true} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {14972#true} is VALID
[2022-04-15 08:43:52,274 INFO L290 TraceCheckUtils]: 64: Hoare triple {14972#true} assume !false; {14972#true} is VALID
[2022-04-15 08:43:52,274 INFO L290 TraceCheckUtils]: 63: Hoare triple {14972#true} assume ~a~0 > ~b~0;~a~0 := ~a~0 - ~b~0;~p~0 := ~p~0 - ~q~0;~r~0 := ~r~0 - ~s~0; {14972#true} is VALID
[2022-04-15 08:43:52,274 INFO L290 TraceCheckUtils]: 62: Hoare triple {14972#true} assume !!(~a~0 != ~b~0); {14972#true} is VALID
[2022-04-15 08:43:52,274 INFO L284 TraceCheckUtils]: 61: Hoare quadruple {14972#true} {14972#true} #78#return; {14972#true} is VALID
[2022-04-15 08:43:52,274 INFO L290 TraceCheckUtils]: 60: Hoare triple {14972#true} assume true; {14972#true} is VALID
[2022-04-15 08:43:52,274 INFO L290 TraceCheckUtils]: 59: Hoare triple {14972#true} assume !(0 == ~cond); {14972#true} is VALID
[2022-04-15 08:43:52,275 INFO L290 TraceCheckUtils]: 58: Hoare triple {14972#true} ~cond := #in~cond; {14972#true} is VALID
[2022-04-15 08:43:52,275 INFO L272 TraceCheckUtils]: 57: Hoare triple {14972#true} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {14972#true} is VALID
[2022-04-15 08:43:52,275 INFO L284 TraceCheckUtils]: 56: Hoare quadruple {14972#true} {14972#true} #76#return; {14972#true} is VALID
[2022-04-15 08:43:52,275 INFO L290 TraceCheckUtils]: 55: Hoare triple {14972#true} assume true; {14972#true} is VALID
[2022-04-15 08:43:52,275 INFO L290 TraceCheckUtils]: 54: Hoare triple {14972#true} assume !(0 == ~cond); {14972#true} is VALID
[2022-04-15 08:43:52,275 INFO L290 TraceCheckUtils]: 53: Hoare triple {14972#true} ~cond := #in~cond; {14972#true} is VALID
[2022-04-15 08:43:52,275 INFO L272 TraceCheckUtils]: 52: Hoare triple {14972#true} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {14972#true} is VALID
[2022-04-15 08:43:52,275 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {14972#true} {14972#true} #74#return; {14972#true} is VALID
[2022-04-15 08:43:52,275 INFO L290 TraceCheckUtils]: 50: Hoare triple {14972#true} assume true; {14972#true} is VALID
[2022-04-15 08:43:52,275 INFO L290 TraceCheckUtils]: 49: Hoare triple {14972#true} assume !(0 == ~cond); {14972#true} is VALID
[2022-04-15 08:43:52,275 INFO L290 TraceCheckUtils]: 48: Hoare triple {14972#true} ~cond := #in~cond; {14972#true} is VALID
[2022-04-15 08:43:52,275 INFO L272 TraceCheckUtils]: 47: Hoare triple {14972#true} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {14972#true} is VALID
[2022-04-15 08:43:52,275 INFO L290 TraceCheckUtils]: 46: Hoare triple {14972#true} assume !false; {14972#true} is VALID
[2022-04-15 08:43:52,275 INFO L290 TraceCheckUtils]: 45: Hoare triple {14972#true} assume !(~a~0 > ~b~0);~b~0 := ~b~0 - ~a~0;~q~0 := ~q~0 - ~p~0;~s~0 := ~s~0 - ~r~0; {14972#true} is VALID
[2022-04-15 08:43:52,276 INFO L290 TraceCheckUtils]: 44: Hoare triple {14972#true} assume !!(~a~0 != ~b~0); {14972#true} is VALID
[2022-04-15 08:43:52,276 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {14972#true} {14972#true} #78#return; {14972#true} is VALID
[2022-04-15 08:43:52,276 INFO L290 TraceCheckUtils]: 42: Hoare triple {14972#true} assume true; {14972#true} is VALID
[2022-04-15 08:43:52,276 INFO L290 TraceCheckUtils]: 41: Hoare triple {14972#true} assume !(0 == ~cond); {14972#true} is VALID
[2022-04-15 08:43:52,276 INFO L290 TraceCheckUtils]: 40: Hoare triple {14972#true} ~cond := #in~cond; {14972#true} is VALID
[2022-04-15 08:43:52,276 INFO L272 TraceCheckUtils]: 39: Hoare triple {14972#true} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {14972#true} is VALID
[2022-04-15 08:43:52,276 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {14972#true} {14972#true} #76#return; {14972#true} is VALID
[2022-04-15 08:43:52,276 INFO L290 TraceCheckUtils]: 37: Hoare triple {14972#true} assume true; {14972#true} is VALID
[2022-04-15 08:43:52,276 INFO L290 TraceCheckUtils]: 36: Hoare triple {14972#true} assume !(0 == ~cond); {14972#true} is VALID
[2022-04-15 08:43:52,276 INFO L290 TraceCheckUtils]: 35: Hoare triple {14972#true} ~cond := #in~cond; {14972#true} is VALID
[2022-04-15 08:43:52,276 INFO L272 TraceCheckUtils]: 34: Hoare triple {14972#true} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {14972#true} is VALID
[2022-04-15 08:43:52,276 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {14972#true} {14972#true} #74#return; {14972#true} is VALID
[2022-04-15 08:43:52,276 INFO L290 TraceCheckUtils]: 32: Hoare triple {14972#true} assume true; {14972#true} is VALID
[2022-04-15 08:43:52,276 INFO L290 TraceCheckUtils]: 31: Hoare triple {14972#true} assume !(0 == ~cond); {14972#true} is VALID
[2022-04-15 08:43:52,276 INFO L290 TraceCheckUtils]: 30: Hoare triple {14972#true} ~cond := #in~cond; {14972#true} is VALID
[2022-04-15 08:43:52,277 INFO L272 TraceCheckUtils]: 29: Hoare triple {14972#true} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {14972#true} is VALID
[2022-04-15 08:43:52,277 INFO L290 TraceCheckUtils]: 28: Hoare triple {14972#true} assume !false; {14972#true} is VALID
[2022-04-15 08:43:52,277 INFO L290 TraceCheckUtils]: 27: Hoare triple {14972#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {14972#true} is VALID
[2022-04-15 08:43:52,277 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {14972#true} {14972#true} #72#return; {14972#true} is VALID
[2022-04-15 08:43:52,277 INFO L290 TraceCheckUtils]: 25: Hoare triple {14972#true} assume true; {14972#true} is VALID
[2022-04-15 08:43:52,277 INFO L290 TraceCheckUtils]: 24: Hoare triple {14972#true} assume !(0 == ~cond); {14972#true} is VALID
[2022-04-15 08:43:52,277 INFO L290 TraceCheckUtils]: 23: Hoare triple {14972#true} ~cond := #in~cond; {14972#true} is VALID
[2022-04-15 08:43:52,277 INFO L272 TraceCheckUtils]: 22: Hoare triple {14972#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {14972#true} is VALID
[2022-04-15 08:43:52,277 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {14972#true} {14972#true} #70#return; {14972#true} is VALID
[2022-04-15 08:43:52,277 INFO L290 TraceCheckUtils]: 20: Hoare triple {14972#true} assume true; {14972#true} is VALID
[2022-04-15 08:43:52,277 INFO L290 TraceCheckUtils]: 19: Hoare triple {14972#true} assume !(0 == ~cond); {14972#true} is VALID
[2022-04-15 08:43:52,277 INFO L290 TraceCheckUtils]: 18: Hoare triple {14972#true} ~cond := #in~cond; {14972#true} is VALID
[2022-04-15 08:43:52,277 INFO L272 TraceCheckUtils]: 17: Hoare triple {14972#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {14972#true} is VALID
[2022-04-15 08:43:52,277 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {14972#true} {14972#true} #68#return; {14972#true} is VALID
[2022-04-15 08:43:52,278 INFO L290 TraceCheckUtils]: 15: Hoare triple {14972#true} assume true; {14972#true} is VALID
[2022-04-15 08:43:52,278 INFO L290 TraceCheckUtils]: 14: Hoare triple {14972#true} assume !(0 == ~cond); {14972#true} is VALID
[2022-04-15 08:43:52,278 INFO L290 TraceCheckUtils]: 13: Hoare triple {14972#true} ~cond := #in~cond; {14972#true} is VALID
[2022-04-15 08:43:52,278 INFO L272 TraceCheckUtils]: 12: Hoare triple {14972#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 10 then 1 else 0)); {14972#true} is VALID
[2022-04-15 08:43:52,278 INFO L290 TraceCheckUtils]: 11: Hoare triple {14972#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {14972#true} is VALID
[2022-04-15 08:43:52,278 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {14972#true} {14972#true} #66#return; {14972#true} is VALID
[2022-04-15 08:43:52,278 INFO L290 TraceCheckUtils]: 9: Hoare triple {14972#true} assume true; {14972#true} is VALID
[2022-04-15 08:43:52,278 INFO L290 TraceCheckUtils]: 8: Hoare triple {14972#true} assume !(0 == ~cond); {14972#true} is VALID
[2022-04-15 08:43:52,278 INFO L290 TraceCheckUtils]: 7: Hoare triple {14972#true} ~cond := #in~cond; {14972#true} is VALID
[2022-04-15 08:43:52,278 INFO L272 TraceCheckUtils]: 6: Hoare triple {14972#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 10 then 1 else 0)); {14972#true} is VALID
[2022-04-15 08:43:52,278 INFO L290 TraceCheckUtils]: 5: Hoare triple {14972#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; {14972#true} is VALID
[2022-04-15 08:43:52,278 INFO L272 TraceCheckUtils]: 4: Hoare triple {14972#true} call #t~ret6 := main(); {14972#true} is VALID
[2022-04-15 08:43:52,278 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14972#true} {14972#true} #88#return; {14972#true} is VALID
[2022-04-15 08:43:52,278 INFO L290 TraceCheckUtils]: 2: Hoare triple {14972#true} assume true; {14972#true} is VALID
[2022-04-15 08:43:52,279 INFO L290 TraceCheckUtils]: 1: Hoare triple {14972#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); {14972#true} is VALID
[2022-04-15 08:43:52,279 INFO L272 TraceCheckUtils]: 0: Hoare triple {14972#true} call ULTIMATE.init(); {14972#true} is VALID
[2022-04-15 08:43:52,279 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-15 08:43:52,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-04-15 08:43:52,279 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [347320835]
[2022-04-15 08:43:52,279 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT
[2022-04-15 08:43:52,279 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [225012150]
[2022-04-15 08:43:52,279 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [225012150] provided 0 perfect and 2 imperfect interpolant sequences
[2022-04-15 08:43:52,279 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences.
[2022-04-15 08:43:52,279 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 16
[2022-04-15 08:43:52,280 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace
[2022-04-15 08:43:52,280 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1717118469]
[2022-04-15 08:43:52,280 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1717118469] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-15 08:43:52,280 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-15 08:43:52,280 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11
[2022-04-15 08:43:52,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1497144013]
[2022-04-15 08:43:52,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-04-15 08:43:52,280 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 10 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-15 08:43:52,280 INFO L84 Accepts]: Finished accepts. word is accepted.
[2022-04-15 08:43:52,281 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 10 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-15 08:43:52,416 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-15 08:43:52,416 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2022-04-15 08:43:52,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION
[2022-04-15 08:43:52,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2022-04-15 08:43:52,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240
[2022-04-15 08:43:52,417 INFO L87 Difference]: Start difference. First operand 191 states and 222 transitions. Second operand has 11 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 10 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-15 08:43:55,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-15 08:43:55,822 INFO L93 Difference]: Finished difference Result 218 states and 257 transitions.
[2022-04-15 08:43:55,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states.
[2022-04-15 08:43:55,822 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 10 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-15 08:43:55,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-04-15 08:43:55,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 10 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-15 08:43:55,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 81 transitions.
[2022-04-15 08:43:55,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 10 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-15 08:43:55,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 81 transitions.
[2022-04-15 08:43:55,824 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 81 transitions.
[2022-04-15 08:43:56,024 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 81 edges. 81 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-15 08:43:56,039 INFO L225 Difference]: With dead ends: 218
[2022-04-15 08:43:56,039 INFO L226 Difference]: Without dead ends: 216
[2022-04-15 08:43:56,040 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 167 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=64, Invalid=242, Unknown=0, NotChecked=0, Total=306
[2022-04-15 08:43:56,040 INFO L913 BasicCegarLoop]: 39 mSDtfsCounter, 13 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 338 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 214 SdHoareTripleChecker+Invalid, 395 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 338 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 49 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time
[2022-04-15 08:43:56,040 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 214 Invalid, 395 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 338 Invalid, 0 Unknown, 49 Unchecked, 1.7s Time]
[2022-04-15 08:43:56,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states.
[2022-04-15 08:43:56,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 214.
[2022-04-15 08:43:56,275 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2022-04-15 08:43:56,276 INFO L82 GeneralOperation]: Start isEquivalent. First operand 216 states. Second operand has 214 states, 130 states have (on average 1.1076923076923078) internal successors, (144), 134 states have internal predecessors, (144), 55 states have call successors, (55), 29 states have call predecessors, (55), 28 states have return successors, (54), 50 states have call predecessors, (54), 54 states have call successors, (54)
[2022-04-15 08:43:56,276 INFO L74 IsIncluded]: Start isIncluded. First operand 216 states. Second operand has 214 states, 130 states have (on average 1.1076923076923078) internal successors, (144), 134 states have internal predecessors, (144), 55 states have call successors, (55), 29 states have call predecessors, (55), 28 states have return successors, (54), 50 states have call predecessors, (54), 54 states have call successors, (54)
[2022-04-15 08:43:56,276 INFO L87 Difference]: Start difference. First operand 216 states. Second operand has 214 states, 130 states have (on average 1.1076923076923078) internal successors, (144), 134 states have internal predecessors, (144), 55 states have call successors, (55), 29 states have call predecessors, (55), 28 states have return successors, (54), 50 states have call predecessors, (54), 54 states have call successors, (54)
[2022-04-15 08:43:56,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-15 08:43:56,280 INFO L93 Difference]: Finished difference Result 216 states and 255 transitions.
[2022-04-15 08:43:56,280 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 255 transitions.
[2022-04-15 08:43:56,280 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-15 08:43:56,280 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-15 08:43:56,280 INFO L74 IsIncluded]: Start isIncluded. First operand has 214 states, 130 states have (on average 1.1076923076923078) internal successors, (144), 134 states have internal predecessors, (144), 55 states have call successors, (55), 29 states have call predecessors, (55), 28 states have return successors, (54), 50 states have call predecessors, (54), 54 states have call successors, (54) Second operand 216 states.
[2022-04-15 08:43:56,281 INFO L87 Difference]: Start difference. First operand has 214 states, 130 states have (on average 1.1076923076923078) internal successors, (144), 134 states have internal predecessors, (144), 55 states have call successors, (55), 29 states have call predecessors, (55), 28 states have return successors, (54), 50 states have call predecessors, (54), 54 states have call successors, (54) Second operand 216 states.
[2022-04-15 08:43:56,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-15 08:43:56,284 INFO L93 Difference]: Finished difference Result 216 states and 255 transitions.
[2022-04-15 08:43:56,284 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 255 transitions.
[2022-04-15 08:43:56,284 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-15 08:43:56,285 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-15 08:43:56,285 INFO L88 GeneralOperation]: Finished isEquivalent.
[2022-04-15 08:43:56,285 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2022-04-15 08:43:56,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 214 states, 130 states have (on average 1.1076923076923078) internal successors, (144), 134 states have internal predecessors, (144), 55 states have call successors, (55), 29 states have call predecessors, (55), 28 states have return successors, (54), 50 states have call predecessors, (54), 54 states have call successors, (54)
[2022-04-15 08:43:56,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 253 transitions.
[2022-04-15 08:43:56,289 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 253 transitions. Word has length 92
[2022-04-15 08:43:56,289 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-04-15 08:43:56,289 INFO L478 AbstractCegarLoop]: Abstraction has 214 states and 253 transitions.
[2022-04-15 08:43:56,289 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 10 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-15 08:43:56,289 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 214 states and 253 transitions.
[2022-04-15 08:43:58,347 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 253 edges. 253 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-15 08:43:58,347 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 253 transitions.
[2022-04-15 08:43:58,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93
[2022-04-15 08:43:58,348 INFO L491 BasicCegarLoop]: Found error trace
[2022-04-15 08:43:58,348 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-15 08:43:58,374 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-15 08:43:58,565 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15
[2022-04-15 08:43:58,565 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-04-15 08:43:58,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-04-15 08:43:58,566 INFO L85 PathProgramCache]: Analyzing trace with hash 1451786998, now seen corresponding path program 11 times
[2022-04-15 08:43:58,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION
[2022-04-15 08:43:58,566 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [979600747]
[2022-04-15 08:43:58,566 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation
[2022-04-15 08:43:58,566 INFO L85 PathProgramCache]: Analyzing trace with hash 1451786998, now seen corresponding path program 12 times
[2022-04-15 08:43:58,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-04-15 08:43:58,566 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2118018189]
[2022-04-15 08:43:58,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-15 08:43:58,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-15 08:43:58,581 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic
[2022-04-15 08:43:58,581 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [44528292]
[2022-04-15 08:43:58,581 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE
[2022-04-15 08:43:58,581 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-04-15 08:43:58,581 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-04-15 08:43:58,583 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2022-04-15 08:43:58,583 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process
[2022-04-15 08:43:58,630 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s)
[2022-04-15 08:43:58,630 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat
[2022-04-15 08:43:58,631 INFO L263 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 30 conjunts are in the unsatisfiable core
[2022-04-15 08:43:58,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-15 08:43:58,656 INFO L286 TraceCheckSpWp]: Computing forward predicates...